1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file handles generation of all the assembler code
23 *except* the instructions of a function.
24 This includes declarations of variables and their initial values.
26 We also output the assembler code for constants stored in memory
27 and are responsible for combining constants with the same value. */
31 /* #include <stab.h> */
39 #include "hard-reg-set.h"
48 #ifdef XCOFF_DEBUGGING_INFO
55 #define ASM_STABS_OP ".stabs"
58 /* This macro gets just the user-specified name
59 out of the string in a SYMBOL_REF. On most machines,
60 we discard the * if any and that's all. */
61 #ifndef STRIP_NAME_ENCODING
62 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
63 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
66 /* File in which assembler code is being written. */
68 extern FILE *asm_out_file
;
70 /* The (assembler) name of the first globally-visible object output. */
71 char *first_global_object_name
;
73 extern struct obstack
*current_obstack
;
74 extern struct obstack
*saveable_obstack
;
75 extern struct obstack
*rtl_obstack
;
76 extern struct obstack permanent_obstack
;
77 #define obstack_chunk_alloc xmalloc
79 /* Number for making the label on the next
80 constant that is stored in memory. */
84 /* Number for making the label on the next
85 static variable internal to a function. */
89 /* Carry information from ASM_DECLARE_OBJECT_NAME
90 to ASM_FINISH_DECLARE_OBJECT. */
92 int size_directive_output
;
94 /* The last decl for which assemble_variable was called,
95 if it did ASM_DECLARE_OBJECT_NAME.
96 If the last call to assemble_variable didn't do that,
99 tree last_assemble_variable_decl
;
102 #ifdef HANDLE_PRAGMA_WEAK
103 /* Any weak symbol declarations waiting to be emitted. */
107 struct weak_syms
*next
;
112 static struct weak_syms
*weak_decls
;
115 /* Nonzero if at least one function definition has been seen. */
117 static int function_defined
;
120 struct constant_descriptor
;
122 struct pool_constant
;
124 static void bc_make_decl_rtl
PROTO((tree
, char *, int));
125 static char *strip_reg_name
PROTO((char *));
126 static void bc_output_ascii
PROTO((FILE *, char *, int));
127 static int contains_pointers_p
PROTO((tree
));
128 static void decode_addr_const
PROTO((tree
, struct addr_const
*));
129 static int const_hash
PROTO((tree
));
130 static int compare_constant
PROTO((tree
,
131 struct constant_descriptor
*));
132 static char *compare_constant_1
PROTO((tree
, char *));
133 static struct constant_descriptor
*record_constant
PROTO((tree
));
134 static void record_constant_1
PROTO((tree
));
135 static tree copy_constant
PROTO((tree
));
136 static void output_constant_def_contents
PROTO((tree
, int, int));
137 static void decode_rtx_const
PROTO((enum machine_mode
, rtx
,
138 struct rtx_const
*));
139 static int const_hash_rtx
PROTO((enum machine_mode
, rtx
));
140 static int compare_constant_rtx
PROTO((enum machine_mode
, rtx
,
141 struct constant_descriptor
*));
142 static struct constant_descriptor
*record_constant_rtx
PROTO((enum machine_mode
,
144 static struct pool_constant
*find_pool_constant
PROTO((rtx
));
145 static int output_addressed_constants
PROTO((tree
));
146 static void bc_assemble_integer
PROTO((tree
, int));
147 static void output_constructor
PROTO((tree
, int));
149 #ifdef EXTRA_SECTIONS
150 static enum in_section
{no_section
, in_text
, in_data
, in_named
, EXTRA_SECTIONS
} in_section
153 static enum in_section
{no_section
, in_text
, in_data
, in_named
} in_section
157 /* Return a non-zero value if DECL has a section attribute. */
158 #define IN_NAMED_SECTION(DECL) \
159 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
160 && DECL_SECTION_NAME (DECL) != NULL_TREE)
162 /* Text of section name when in_section == in_named. */
163 static char *in_named_name
;
165 /* Define functions like text_section for any extra sections. */
166 #ifdef EXTRA_SECTION_FUNCTIONS
167 EXTRA_SECTION_FUNCTIONS
170 /* Tell assembler to switch to text section. */
175 if (in_section
!= in_text
)
180 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
182 in_section
= in_text
;
186 /* Tell assembler to switch to data section. */
191 if (in_section
!= in_data
)
197 if (flag_shared_data
)
199 #ifdef SHARED_SECTION_ASM_OP
200 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
202 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
206 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
209 in_section
= in_data
;
213 /* Tell assembler to switch to read-only data section. This is normally
217 readonly_data_section ()
219 #ifdef READONLY_DATA_SECTION
220 READONLY_DATA_SECTION (); /* Note this can call data_section. */
226 /* Determine if we're in the text section. */
231 return in_section
== in_text
;
234 /* Tell assembler to change to section NAME for DECL.
235 If DECL is NULL, just switch to section NAME.
236 If NAME is NULL, get the name from DECL. */
239 named_section (decl
, name
)
243 if (decl
!= NULL_TREE
244 && (TREE_CODE (decl
) != FUNCTION_DECL
&& TREE_CODE (decl
) != VAR_DECL
))
247 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
249 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
251 in_named_name
= name
;
252 in_section
= in_named
;
254 #ifdef ASM_OUTPUT_SECTION_NAME
255 ASM_OUTPUT_SECTION_NAME (asm_out_file
, decl
, name
);
257 /* Section attributes are not supported if this macro isn't provided -
258 some host formats don't support them at all. The front-end should
259 already have flagged this as an error. */
265 /* Switch to the section for function DECL.
267 If DECL is NULL_TREE, switch to the text section.
268 ??? It's not clear that we will ever be passed NULL_TREE, but it's
269 safer to handle it. */
272 function_section (decl
)
275 if (decl
!= NULL_TREE
276 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
277 named_section (decl
, (char *) 0);
282 /* Create the rtl to represent a function, for a function definition.
283 DECL is a FUNCTION_DECL node which describes which function.
284 The rtl is stored into DECL. */
287 make_function_rtl (decl
)
290 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
294 if (DECL_RTL (decl
) == 0)
295 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
297 /* Record that at least one function has been defined. */
298 function_defined
= 1;
302 /* Rename a nested function to avoid conflicts. */
303 if (decl_function_context (decl
) != 0
304 && DECL_INITIAL (decl
) != 0
305 && DECL_RTL (decl
) == 0)
309 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
310 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
311 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
315 if (DECL_RTL (decl
) == 0)
318 = gen_rtx (MEM
, DECL_MODE (decl
),
319 gen_rtx (SYMBOL_REF
, Pmode
, name
));
321 /* Optionally set flags or add text to the name to record information
322 such as that it is a function name. If the name is changed, the macro
323 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
324 #ifdef ENCODE_SECTION_INFO
325 ENCODE_SECTION_INFO (decl
);
329 /* Record at least one function has been defined. */
330 function_defined
= 1;
333 /* Create the DECL_RTL for a declaration for a static or external
334 variable or static or external function.
335 ASMSPEC, if not 0, is the string which the user specified
336 as the assembler symbol name.
337 TOP_LEVEL is nonzero if this is a file-scope variable.
338 This is never called for PARM_DECLs. */
341 bc_make_decl_rtl (decl
, asmspec
, top_level
)
346 register char *name
= TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl
));
348 if (DECL_RTL (decl
) == 0)
350 /* Print an error message for register variables. */
351 if (DECL_REGISTER (decl
) && TREE_CODE (decl
) == FUNCTION_DECL
)
352 error ("function declared `register'");
353 else if (DECL_REGISTER (decl
))
354 error ("global register variables not supported in the interpreter");
356 /* Handle ordinary static variables and functions. */
357 if (DECL_RTL (decl
) == 0)
359 /* Can't use just the variable's own name for a variable
360 whose scope is less than the whole file.
361 Concatenate a distinguishing number. */
362 if (!top_level
&& !DECL_EXTERNAL (decl
) && asmspec
== 0)
366 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
367 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
371 DECL_RTL (decl
) = bc_gen_rtx (name
, 0, (struct bc_label
*) 0);
376 /* Given NAME, a putative register name, discard any customary prefixes. */
379 strip_reg_name (name
)
382 #ifdef REGISTER_PREFIX
383 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
384 name
+= strlen (REGISTER_PREFIX
);
386 if (name
[0] == '%' || name
[0] == '#')
391 /* Decode an `asm' spec for a declaration as a register name.
392 Return the register number, or -1 if nothing specified,
393 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
394 or -3 if ASMSPEC is `cc' and is not recognized,
395 or -4 if ASMSPEC is `memory' and is not recognized.
396 Accept an exact spelling or a decimal number.
397 Prefixes such as % are optional. */
400 decode_reg_name (asmspec
)
407 /* Get rid of confusing prefixes. */
408 asmspec
= strip_reg_name (asmspec
);
410 /* Allow a decimal number as a "register name". */
411 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
412 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
414 if (asmspec
[0] != 0 && i
< 0)
417 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
423 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
425 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
428 #ifdef ADDITIONAL_REGISTER_NAMES
430 static struct { char *name
; int number
; } table
[]
431 = ADDITIONAL_REGISTER_NAMES
;
433 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
434 if (! strcmp (asmspec
, table
[i
].name
))
435 return table
[i
].number
;
437 #endif /* ADDITIONAL_REGISTER_NAMES */
439 if (!strcmp (asmspec
, "memory"))
442 if (!strcmp (asmspec
, "cc"))
451 /* Create the DECL_RTL for a declaration for a static or external variable
452 or static or external function.
453 ASMSPEC, if not 0, is the string which the user specified
454 as the assembler symbol name.
455 TOP_LEVEL is nonzero if this is a file-scope variable.
457 This is never called for PARM_DECL nodes. */
460 make_decl_rtl (decl
, asmspec
, top_level
)
465 register char *name
= 0;
470 bc_make_decl_rtl (decl
, asmspec
, top_level
);
474 reg_number
= decode_reg_name (asmspec
);
476 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
477 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
479 if (reg_number
== -2)
481 /* ASMSPEC is given, and not the name of a register. */
482 name
= (char *) obstack_alloc (saveable_obstack
,
483 strlen (asmspec
) + 2);
485 strcpy (&name
[1], asmspec
);
488 /* For a duplicate declaration, we can be called twice on the
489 same DECL node. Don't discard the RTL already made. */
490 if (DECL_RTL (decl
) == 0)
494 /* First detect errors in declaring global registers. */
495 if (DECL_REGISTER (decl
) && reg_number
== -1)
496 error_with_decl (decl
,
497 "register name not specified for `%s'");
498 else if (DECL_REGISTER (decl
) && reg_number
< 0)
499 error_with_decl (decl
,
500 "invalid register name for `%s'");
501 else if ((reg_number
>= 0 || reg_number
== -3) && ! DECL_REGISTER (decl
))
502 error_with_decl (decl
,
503 "register name given for non-register variable `%s'");
504 else if (DECL_REGISTER (decl
) && TREE_CODE (decl
) == FUNCTION_DECL
)
505 error ("function declared `register'");
506 else if (DECL_REGISTER (decl
) && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
507 error_with_decl (decl
, "data type of `%s' isn't suitable for a register");
508 else if (DECL_REGISTER (decl
)
509 && ! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
510 error_with_decl (decl
, "register number for `%s' isn't suitable for the data type");
511 /* Now handle properly declared static register variables. */
512 else if (DECL_REGISTER (decl
))
515 #if 0 /* yylex should print the warning for this */
517 pedwarn ("ANSI C forbids global register variables");
519 if (DECL_INITIAL (decl
) != 0 && top_level
)
521 DECL_INITIAL (decl
) = 0;
522 error ("global register variable has initial value");
524 if (fixed_regs
[reg_number
] == 0
525 && function_defined
&& top_level
)
526 error ("global register variable follows a function definition");
527 if (TREE_THIS_VOLATILE (decl
))
528 warning ("volatile register variables don't work as you might wish");
530 /* If the user specified one of the eliminables registers here,
531 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
532 confused with that register and be eliminated. Although this
533 usage is somewhat suspect, we nevertheless use the following
534 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
537 = gen_rtx (REG
, DECL_MODE (decl
), FIRST_PSEUDO_REGISTER
);
538 REGNO (DECL_RTL (decl
)) = reg_number
;
539 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
543 /* Make this register global, so not usable for anything
545 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
547 globalize_reg (reg_number
+ --nregs
);
550 /* Specifying a section attribute on an uninitialized variable does not
551 (and cannot) cause it to be put in the given section. The linker
552 can only put initialized objects in specific sections, everything
553 else goes in bss for the linker to sort out later (otherwise the
554 linker would give a duplicate definition error for each compilation
555 unit that behaved thusly). So warn the user. */
556 else if (TREE_CODE (decl
) == VAR_DECL
557 && DECL_SECTION_NAME (decl
) != NULL_TREE
558 && DECL_INITIAL (decl
) == NULL_TREE
559 && DECL_COMMON (decl
)
562 warning_with_decl (decl
,
563 "section attribute ignored for uninitialized variable `%s'");
564 /* Remove the section name so subsequent declarations won't see it.
565 We are ignoring it, remember. */
566 DECL_SECTION_NAME (decl
) = NULL_TREE
;
569 /* Now handle ordinary static variables and functions (in memory).
570 Also handle vars declared register invalidly. */
571 if (DECL_RTL (decl
) == 0)
573 /* Can't use just the variable's own name for a variable
574 whose scope is less than the whole file.
575 Concatenate a distinguishing number. */
576 if (!top_level
&& !DECL_EXTERNAL (decl
) && asmspec
== 0)
580 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
581 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
588 DECL_RTL (decl
) = gen_rtx (MEM
, DECL_MODE (decl
),
589 gen_rtx (SYMBOL_REF
, Pmode
, name
));
591 /* If this variable is to be treated as volatile, show its
592 tree node has side effects. If it has side effects, either
593 because of this test or from TREE_THIS_VOLATILE also
594 being set, show the MEM is volatile. */
595 if (flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
596 && TREE_PUBLIC (decl
))
597 TREE_SIDE_EFFECTS (decl
) = 1;
598 if (TREE_SIDE_EFFECTS (decl
))
599 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
601 if (TREE_READONLY (decl
))
602 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
603 MEM_IN_STRUCT_P (DECL_RTL (decl
))
604 = AGGREGATE_TYPE_P (TREE_TYPE (decl
));
606 /* Optionally set flags or add text to the name to record information
607 such as that it is a function name.
608 If the name is changed, the macro ASM_OUTPUT_LABELREF
609 will have to know how to strip this information. */
610 #ifdef ENCODE_SECTION_INFO
611 ENCODE_SECTION_INFO (decl
);
615 /* If the old RTL had the wrong mode, fix the mode. */
616 else if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
618 rtx rtl
= DECL_RTL (decl
);
619 PUT_MODE (rtl
, DECL_MODE (decl
));
623 /* Make the rtl for variable VAR be volatile.
624 Use this only for static variables. */
627 make_var_volatile (var
)
630 if (GET_CODE (DECL_RTL (var
)) != MEM
)
633 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
636 /* Output alignment directive to align for constant expression EXP. */
639 assemble_constant_align (exp
)
644 /* Align the location counter as required by EXP's data type. */
645 align
= TYPE_ALIGN (TREE_TYPE (exp
));
646 #ifdef CONSTANT_ALIGNMENT
647 align
= CONSTANT_ALIGNMENT (exp
, align
);
650 if (align
> BITS_PER_UNIT
)
651 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
654 /* Output a string of literal assembler code
655 for an `asm' keyword used between functions. */
658 assemble_asm (string
)
663 error ("asm statements not allowed in interpreter");
669 if (TREE_CODE (string
) == ADDR_EXPR
)
670 string
= TREE_OPERAND (string
, 0);
672 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
675 #if 0 /* This should no longer be needed, because
676 flag_gnu_linker should be 0 on these systems,
677 which should prevent any output
678 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
679 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
680 #ifndef ASM_OUTPUT_CONSTRUCTOR
681 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
683 #ifndef ASM_OUTPUT_DESTRUCTOR
684 #define ASM_OUTPUT_DESTRUCTOR(file, name)
689 /* Record an element in the table of global destructors.
690 How this is done depends on what sort of assembler and linker
693 NAME should be the name of a global function to be called
694 at exit time. This name is output using assemble_name. */
697 assemble_destructor (name
)
700 #ifdef ASM_OUTPUT_DESTRUCTOR
701 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
705 /* Now tell GNU LD that this is part of the static destructor set. */
706 /* This code works for any machine provided you use GNU as/ld. */
707 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
708 assemble_name (asm_out_file
, name
);
709 fputc ('\n', asm_out_file
);
714 /* Likewise for global constructors. */
717 assemble_constructor (name
)
720 #ifdef ASM_OUTPUT_CONSTRUCTOR
721 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
725 /* Now tell GNU LD that this is part of the static constructor set. */
726 /* This code works for any machine provided you use GNU as/ld. */
727 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
728 assemble_name (asm_out_file
, name
);
729 fputc ('\n', asm_out_file
);
734 /* Likewise for entries we want to record for garbage collection.
735 Garbage collection is still under development. */
738 assemble_gc_entry (name
)
741 #ifdef ASM_OUTPUT_GC_ENTRY
742 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
746 /* Now tell GNU LD that this is part of the static constructor set. */
747 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
748 assemble_name (asm_out_file
, name
);
749 fputc ('\n', asm_out_file
);
754 /* Output assembler code for the constant pool of a function and associated
755 with defining the name of the function. DECL describes the function.
756 NAME is the function's name. For the constant pool, we use the current
757 constant pool data. */
760 assemble_start_function (decl
, fnname
)
766 /* The following code does not need preprocessing in the assembler. */
770 output_constant_pool (fnname
, decl
);
772 function_section (decl
);
774 /* Tell assembler to move to target machine's alignment for functions. */
775 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
779 BC_OUTPUT_ALIGN (asm_out_file
, align
);
781 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
784 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
785 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
788 #ifdef SDB_DEBUGGING_INFO
789 /* Output SDB definition of the function. */
790 if (write_symbols
== SDB_DEBUG
)
791 sdbout_mark_begin_function ();
794 #ifdef DBX_DEBUGGING_INFO
795 /* Output DBX definition of the function. */
796 if (write_symbols
== DBX_DEBUG
)
797 dbxout_begin_function (decl
);
800 /* Make function name accessible from other files, if appropriate. */
802 if (TREE_PUBLIC (decl
))
804 if (!first_global_object_name
)
808 STRIP_NAME_ENCODING (p
, fnname
);
809 first_global_object_name
= permalloc (strlen (p
) + 1);
810 strcpy (first_global_object_name
, p
);
813 #ifdef ASM_WEAKEN_LABEL
814 if (DECL_WEAK (decl
))
815 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
819 BC_GLOBALIZE_LABEL (asm_out_file
, fnname
);
821 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
824 /* Do any machine/system dependent processing of the function name */
825 #ifdef ASM_DECLARE_FUNCTION_NAME
826 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
828 /* Standard thing is just output label for the function. */
830 BC_OUTPUT_LABEL (asm_out_file
, fnname
);
832 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
833 #endif /* ASM_DECLARE_FUNCTION_NAME */
836 /* Output assembler code associated with defining the size of the
837 function. DECL describes the function. NAME is the function's name. */
840 assemble_end_function (decl
, fnname
)
844 #ifdef ASM_DECLARE_FUNCTION_SIZE
845 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
849 /* Assemble code to leave SIZE bytes of zeros. */
852 assemble_zeros (size
)
857 bc_emit_const_skip (size
);
861 #ifdef ASM_NO_SKIP_IN_TEXT
862 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
863 so we must output 0s explicitly in the text section. */
864 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
868 for (i
= 0; i
< size
- 20; i
+= 20)
871 fprintf (asm_out_file
,
872 "%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
);
874 fprintf (asm_out_file
,
875 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
881 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
883 fprintf (asm_out_file
, "\tbyte 0");
886 for (; i
< size
; i
++)
887 fprintf (asm_out_file
, ",0");
888 fprintf (asm_out_file
, "\n");
896 BC_OUTPUT_SKIP (asm_out_file
, size
);
898 ASM_OUTPUT_SKIP (asm_out_file
, size
);
902 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
905 assemble_align (align
)
908 if (align
> BITS_PER_UNIT
)
909 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
912 /* Assemble a string constant with the specified C string as contents. */
915 assemble_string (p
, size
)
929 /* If the string is very long, split it up. */
933 int thissize
= size
- pos
;
934 if (thissize
> maximum
)
938 bc_output_ascii (asm_out_file
, p
, thissize
);
941 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
950 bc_output_ascii (file
, p
, size
)
955 BC_OUTPUT_ASCII (file
, p
, size
);
958 /* Assemble everything that is needed for a variable or function declaration.
959 Not used for automatic variables, and not used for function definitions.
960 Should not be called for variables of incomplete structure type.
962 TOP_LEVEL is nonzero if this variable has file scope.
963 AT_END is nonzero if this is the special handling, at end of compilation,
964 to define things that have had only tentative definitions.
965 DONT_OUTPUT_DATA if nonzero means don't actually output the
966 initial value (that will be done by the caller). */
969 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
973 int dont_output_data
;
979 enum in_section saved_in_section
;
981 last_assemble_variable_decl
= 0;
986 if (GET_CODE (DECL_RTL (decl
)) == REG
)
988 /* Do output symbol info for global register variables, but do nothing
991 if (TREE_ASM_WRITTEN (decl
))
993 TREE_ASM_WRITTEN (decl
) = 1;
995 if (!output_bytecode
)
997 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
998 /* File-scope global variables are output here. */
999 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
1001 dbxout_symbol (decl
, 0);
1003 #ifdef SDB_DEBUGGING_INFO
1004 if (write_symbols
== SDB_DEBUG
&& top_level
1005 /* Leave initialized global vars for end of compilation;
1006 see comment in compile_file. */
1007 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1008 sdbout_symbol (decl
, 0);
1012 /* Don't output any DWARF debugging information for variables here.
1013 In the case of local variables, the information for them is output
1014 when we do our recursive traversal of the tree representation for
1015 the entire containing function. In the case of file-scope variables,
1016 we output information for all of them at the very end of compilation
1017 while we are doing our final traversal of the chain of file-scope
1023 /* Normally no need to say anything here for external references,
1024 since assemble_external is called by the language-specific code
1025 when a declaration is first seen. */
1027 if (DECL_EXTERNAL (decl
))
1030 /* Output no assembler code for a function declaration.
1031 Only definitions of functions output anything. */
1033 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1036 /* If type was incomplete when the variable was declared,
1037 see if it is complete now. */
1039 if (DECL_SIZE (decl
) == 0)
1040 layout_decl (decl
, 0);
1042 /* Still incomplete => don't allocate it; treat the tentative defn
1043 (which is what it must have been) as an `extern' reference. */
1045 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1047 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1048 DECL_SOURCE_LINE (decl
),
1049 "storage size of `%s' isn't known",
1050 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1051 TREE_ASM_WRITTEN (decl
) = 1;
1055 /* The first declaration of a variable that comes through this function
1056 decides whether it is global (in C, has external linkage)
1057 or local (in C, has internal linkage). So do nothing more
1058 if this function has already run. */
1060 if (TREE_ASM_WRITTEN (decl
))
1063 TREE_ASM_WRITTEN (decl
) = 1;
1067 if (! dont_output_data
)
1069 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
1072 /* This is better than explicit arithmetic, since it avoids overflow. */
1073 size_tree
= size_binop (CEIL_DIV_EXPR
,
1074 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
1076 if (TREE_INT_CST_HIGH (size_tree
) != 0)
1078 error_with_decl (decl
, "size of variable `%s' is too large");
1083 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
1085 /* Handle uninitialized definitions. */
1087 /* ANSI specifies that a tentative definition which is not merged with
1088 a non-tentative definition behaves exactly like a definition with an
1089 initializer equal to zero. (Section 3.7.2)
1090 -fno-common gives strict ANSI behavior. Usually you don't want it.
1091 This matters only for variables with external linkage. */
1092 if ((! flag_no_common
|| ! TREE_PUBLIC (decl
))
1093 && DECL_COMMON (decl
)
1094 && ! dont_output_data
1095 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
1097 int size
= TREE_INT_CST_LOW (size_tree
);
1100 if (TREE_INT_CST_HIGH (size_tree
) != 0)
1101 error_with_decl (decl
, "size of variable `%s' is too large");
1102 /* Don't allocate zero bytes of common,
1103 since that means "undefined external" in the linker. */
1104 if (size
== 0) rounded
= 1;
1105 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1106 so that each uninitialized object starts on such a boundary. */
1107 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1108 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1109 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1111 #ifdef DBX_DEBUGGING_INFO
1112 /* File-scope global variables are output here. */
1113 if (write_symbols
== DBX_DEBUG
&& top_level
)
1114 dbxout_symbol (decl
, 0);
1116 #ifdef SDB_DEBUGGING_INFO
1117 if (write_symbols
== SDB_DEBUG
&& top_level
1118 /* Leave initialized global vars for end of compilation;
1119 see comment in compile_file. */
1120 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1121 sdbout_symbol (decl
, 0);
1124 /* Don't output any DWARF debugging information for variables here.
1125 In the case of local variables, the information for them is output
1126 when we do our recursive traversal of the tree representation for
1127 the entire containing function. In the case of file-scope variables,
1128 we output information for all of them at the very end of compilation
1129 while we are doing our final traversal of the chain of file-scope
1133 if (flag_shared_data
)
1136 if (TREE_PUBLIC (decl
))
1138 #ifdef ASM_OUTPUT_SHARED_COMMON
1139 if (flag_shared_data
)
1140 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1143 if (output_bytecode
)
1145 BC_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1149 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1150 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
1153 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
1159 #ifdef ASM_OUTPUT_SHARED_LOCAL
1160 if (flag_shared_data
)
1161 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1164 if (output_bytecode
)
1166 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1170 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1171 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
1174 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1181 /* Handle initialized definitions. */
1183 /* First make the assembler name(s) global if appropriate. */
1184 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1186 if (!first_global_object_name
)
1190 STRIP_NAME_ENCODING (p
, name
);
1191 first_global_object_name
= permalloc (strlen (p
) + 1);
1192 strcpy (first_global_object_name
, p
);
1195 #ifdef ASM_WEAKEN_LABEL
1196 if (DECL_WEAK (decl
))
1197 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1200 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1203 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
1205 tree e
= TREE_VALUE (d
);
1206 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
1207 ASM_GLOBALIZE_LABEL (asm_out_file
,
1208 XSTR (XEXP (DECL_RTL (e
), 0), 0));
1212 /* Output any data that we will need to use the address of. */
1213 if (DECL_INITIAL (decl
) == error_mark_node
)
1214 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1215 else if (DECL_INITIAL (decl
))
1216 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1218 /* Switch to the proper section for this data. */
1219 if (IN_NAMED_SECTION (decl
))
1220 named_section (decl
, NULL
);
1223 /* C++ can have const variables that get initialized from constructors,
1224 and thus can not be in a readonly section. We prevent this by
1225 verifying that the initial value is constant for objects put in a
1228 error_mark_node is used by the C front end to indicate that the
1229 initializer has not been seen yet. In this case, we assume that
1230 the initializer must be constant. */
1231 #ifdef SELECT_SECTION
1232 SELECT_SECTION (decl
, reloc
);
1234 if (TREE_READONLY (decl
)
1235 && ! TREE_THIS_VOLATILE (decl
)
1236 && DECL_INITIAL (decl
)
1237 && (DECL_INITIAL (decl
) == error_mark_node
1238 || TREE_CONSTANT (DECL_INITIAL (decl
)))
1239 && ! (flag_pic
&& reloc
))
1240 readonly_data_section ();
1246 /* dbxout.c needs to know this. */
1247 if (in_text_section ())
1248 DECL_IN_TEXT_SECTION (decl
) = 1;
1250 /* Record current section so we can restore it if dbxout.c clobbers it. */
1251 saved_in_section
= in_section
;
1253 /* Output the dbx info now that we have chosen the section. */
1255 #ifdef DBX_DEBUGGING_INFO
1256 /* File-scope global variables are output here. */
1257 if (write_symbols
== DBX_DEBUG
&& top_level
)
1258 dbxout_symbol (decl
, 0);
1260 #ifdef SDB_DEBUGGING_INFO
1261 if (write_symbols
== SDB_DEBUG
&& top_level
1262 /* Leave initialized global vars for end of compilation;
1263 see comment in compile_file. */
1264 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
1265 sdbout_symbol (decl
, 0);
1268 /* Don't output any DWARF debugging information for variables here.
1269 In the case of local variables, the information for them is output
1270 when we do our recursive traversal of the tree representation for
1271 the entire containing function. In the case of file-scope variables,
1272 we output information for all of them at the very end of compilation
1273 while we are doing our final traversal of the chain of file-scope
1276 /* If the debugging output changed sections, reselect the section
1277 that's supposed to be selected. */
1278 if (in_section
!= saved_in_section
)
1280 /* Switch to the proper section for this data. */
1281 #ifdef SELECT_SECTION
1282 SELECT_SECTION (decl
, reloc
);
1284 if (TREE_READONLY (decl
)
1285 && ! TREE_THIS_VOLATILE (decl
)
1286 && DECL_INITIAL (decl
)
1287 && (DECL_INITIAL (decl
) == error_mark_node
1288 || TREE_CONSTANT (DECL_INITIAL (decl
)))
1289 && ! (flag_pic
&& reloc
))
1290 readonly_data_section ();
1296 /* Compute and output the alignment of this data. */
1298 align
= DECL_ALIGN (decl
);
1299 /* In the case for initialing an array whose length isn't specified,
1300 where we have not yet been able to do the layout,
1301 figure out the proper alignment now. */
1302 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1303 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1304 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1306 /* Some object file formats have a maximum alignment which they support.
1307 In particular, a.out format supports a maximum alignment of 4. */
1308 #ifndef MAX_OFILE_ALIGNMENT
1309 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1311 if (align
> MAX_OFILE_ALIGNMENT
)
1313 warning_with_decl (decl
,
1314 "alignment of `%s' is greater than maximum object file alignment");
1315 align
= MAX_OFILE_ALIGNMENT
;
1317 #ifdef DATA_ALIGNMENT
1318 /* On some machines, it is good to increase alignment sometimes. */
1319 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1321 #ifdef CONSTANT_ALIGNMENT
1322 if (DECL_INITIAL (decl
))
1323 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1326 /* Reset the alignment in case we have made it tighter, so we can benefit
1327 from it in get_pointer_alignment. */
1328 DECL_ALIGN (decl
) = align
;
1330 if (align
> BITS_PER_UNIT
)
1332 if (output_bytecode
)
1333 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1335 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1338 /* Do any machine/system dependent processing of the object. */
1339 #ifdef ASM_DECLARE_OBJECT_NAME
1340 last_assemble_variable_decl
= decl
;
1341 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1343 /* Standard thing is just output label for the object. */
1344 if (output_bytecode
)
1345 BC_OUTPUT_LABEL (asm_out_file
, name
);
1347 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1348 #endif /* ASM_DECLARE_OBJECT_NAME */
1350 if (!dont_output_data
)
1352 if (DECL_INITIAL (decl
))
1353 /* Output the actual data. */
1354 output_constant (DECL_INITIAL (decl
), TREE_INT_CST_LOW (size_tree
));
1356 /* Leave space for it. */
1357 assemble_zeros (TREE_INT_CST_LOW (size_tree
));
1361 #ifdef XCOFF_DEBUGGING_INFO
1362 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1363 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1364 and `aa' hasn't been output yet, the assembler generates a stab entry with
1365 a value of zero, in addition to creating an unnecessary external entry
1366 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1368 /* File-scope global variables are output here. */
1369 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
1371 saved_in_section
= in_section
;
1373 dbxout_symbol (decl
, 0);
1375 if (in_section
!= saved_in_section
)
1377 /* Switch to the proper section for this data. */
1378 #ifdef SELECT_SECTION
1379 SELECT_SECTION (decl
, reloc
);
1381 if (TREE_READONLY (decl
)
1382 && ! TREE_THIS_VOLATILE (decl
)
1383 && DECL_INITIAL (decl
)
1384 && (DECL_INITIAL (decl
) == error_mark_node
1385 || TREE_CONSTANT (DECL_INITIAL (decl
)))
1386 && ! (flag_pic
&& reloc
))
1387 readonly_data_section ();
1394 /* There must be a statement after a label. */
1399 /* Return 1 if type TYPE contains any pointers. */
1402 contains_pointers_p (type
)
1405 switch (TREE_CODE (type
))
1408 case REFERENCE_TYPE
:
1409 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1410 so I'll play safe and return 1. */
1416 case QUAL_UNION_TYPE
:
1419 /* For a type that has fields, see if the fields have pointers. */
1420 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1421 if (TREE_CODE (fields
) == FIELD_DECL
1422 && contains_pointers_p (TREE_TYPE (fields
)))
1428 /* An array type contains pointers if its element type does. */
1429 return contains_pointers_p (TREE_TYPE (type
));
1436 /* Output text storage for constructor CONSTR. */
1439 bc_output_constructor (constr
, size
)
1445 /* Must always be a literal; non-literal constructors are handled
1448 if (!TREE_CONSTANT (constr
))
1455 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++)
1459 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1462 output_constant (constr
, size
);
1465 /* Create storage for constructor CONSTR. */
1468 bc_output_data_constructor (constr
)
1473 /* Put in data section */
1477 for (i
= 0; TYPE_ALIGN (constr
) >= BITS_PER_UNIT
<< (i
+ 1); i
++);
1479 BC_OUTPUT_ALIGN (asm_out_file
, i
);
1481 /* The constructor is filled in at runtime. */
1482 BC_OUTPUT_SKIP (asm_out_file
, int_size_in_bytes (TREE_TYPE (constr
)));
1485 /* Output something to declare an external symbol to the assembler.
1486 (Most assemblers don't need this, so we normally output nothing.)
1487 Do nothing if DECL is not external. */
1490 assemble_external (decl
)
1493 if (output_bytecode
)
1496 #ifdef ASM_OUTPUT_EXTERNAL
1497 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
1498 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1500 rtx rtl
= DECL_RTL (decl
);
1502 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1503 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1505 /* Some systems do require some output. */
1506 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1507 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1513 /* Similar, for calling a library function FUN. */
1516 assemble_external_libcall (fun
)
1519 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1520 if (!output_bytecode
)
1522 /* Declare library function name external when first used, if nec. */
1523 if (! SYMBOL_REF_USED (fun
))
1525 SYMBOL_REF_USED (fun
) = 1;
1526 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1532 /* Declare the label NAME global. */
1535 assemble_global (name
)
1538 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1541 /* Assemble a label named NAME. */
1544 assemble_label (name
)
1547 if (output_bytecode
)
1548 BC_OUTPUT_LABEL (asm_out_file
, name
);
1550 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1553 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1554 If NAME starts with a *, the rest of NAME is output verbatim.
1555 Otherwise NAME is transformed in an implementation-defined way
1556 (usually by the addition of an underscore).
1557 Many macros in the tm file are defined to call this function. */
1560 assemble_name (file
, name
)
1565 int save_warn_id_clash
= warn_id_clash
;
1567 STRIP_NAME_ENCODING (real_name
, name
);
1569 /* Don't warn about an identifier name length clash on this name, since
1570 it can be a user symbol suffixed by a number. */
1572 TREE_SYMBOL_REFERENCED (get_identifier (real_name
)) = 1;
1573 warn_id_clash
= save_warn_id_clash
;
1577 if (output_bytecode
)
1578 bc_emit_labelref (name
);
1580 fputs (&name
[1], file
);
1584 if (output_bytecode
)
1585 BC_OUTPUT_LABELREF (file
, name
);
1587 ASM_OUTPUT_LABELREF (file
, name
);
1591 /* Allocate SIZE bytes writable static space with a gensym name
1592 and return an RTX to refer to its address. */
1595 assemble_static_space (size
)
1601 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1602 so that each uninitialized object starts on such a boundary. */
1603 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1604 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1605 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1608 if (flag_shared_data
)
1612 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1615 namestring
= (char *) obstack_alloc (saveable_obstack
,
1617 strcpy (namestring
, name
);
1619 if (output_bytecode
)
1620 x
= bc_gen_rtx (namestring
, 0, (struct bc_label
*) 0);
1622 x
= gen_rtx (SYMBOL_REF
, Pmode
, namestring
);
1624 if (output_bytecode
)
1626 BC_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1630 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1631 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1633 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1639 /* Assemble the static constant template for function entry trampolines.
1640 This is done at most once per compilation.
1641 Returns an RTX for the address of the template. */
1644 assemble_trampoline_template ()
1650 /* Shouldn't get here */
1651 if (output_bytecode
)
1654 /* By default, put trampoline templates in read-only data section. */
1656 #ifdef TRAMPOLINE_SECTION
1657 TRAMPOLINE_SECTION ();
1659 readonly_data_section ();
1662 /* Write the assembler code to define one. */
1663 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1665 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1667 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1668 TRAMPOLINE_TEMPLATE (asm_out_file
);
1670 /* Record the rtl to refer to it. */
1671 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1673 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1674 return gen_rtx (SYMBOL_REF
, Pmode
, name
);
1677 /* Assemble the integer constant X into an object of SIZE bytes.
1678 X must be either a CONST_INT or CONST_DOUBLE.
1680 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1681 non-zero, abort if we can't output the constant. */
1684 assemble_integer (x
, size
, force
)
1689 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1690 ASM_OUTPUT... macros. */
1694 #ifdef ASM_OUTPUT_CHAR
1696 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1700 #ifdef ASM_OUTPUT_SHORT
1702 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1706 #ifdef ASM_OUTPUT_INT
1708 ASM_OUTPUT_INT (asm_out_file
, x
);
1712 #ifdef ASM_OUTPUT_DOUBLE_INT
1714 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1718 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1720 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1725 /* If we couldn't do it that way, there are two other possibilities: First,
1726 if the machine can output an explicit byte and this is a 1 byte constant,
1727 we can use ASM_OUTPUT_BYTE. */
1729 #ifdef ASM_OUTPUT_BYTE
1730 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1732 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1737 /* Finally, if SIZE is larger than a single word, try to output the constant
1738 one word at a time. */
1740 if (size
> UNITS_PER_WORD
)
1743 enum machine_mode mode
1744 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1747 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1749 word
= operand_subword (x
, i
, 0, mode
);
1754 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1758 if (i
== size
/ UNITS_PER_WORD
)
1760 /* If we output at least one word and then could not finish,
1761 there is no valid way to continue. */
1772 /* Assemble the floating-point constant D into an object of size MODE. */
1775 assemble_real (d
, mode
)
1777 enum machine_mode mode
;
1779 jmp_buf output_constant_handler
;
1781 if (setjmp (output_constant_handler
))
1783 error ("floating point trap outputting a constant");
1784 #ifdef REAL_IS_NOT_DOUBLE
1785 bzero ((char *) &d
, sizeof d
);
1792 set_float_handler (output_constant_handler
);
1796 #ifdef ASM_OUTPUT_BYTE_FLOAT
1798 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, d
);
1801 #ifdef ASM_OUTPUT_SHORT_FLOAT
1803 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, d
);
1806 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1808 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, d
);
1811 #ifdef ASM_OUTPUT_FLOAT
1813 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1817 #ifdef ASM_OUTPUT_DOUBLE
1819 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1823 #ifdef ASM_OUTPUT_LONG_DOUBLE
1826 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1834 set_float_handler (NULL_PTR
);
1837 /* Here we combine duplicate floating constants to make
1838 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1840 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1841 They are chained through the CONST_DOUBLE_CHAIN.
1842 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1843 In that case, CONST_DOUBLE_MEM is either a MEM,
1844 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1846 (CONST_DOUBLE_MEM is used only for top-level functions.
1847 See force_const_mem for explanation.) */
1849 static rtx const_double_chain
;
1851 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1852 For an integer, I0 is the low-order word and I1 is the high-order word.
1853 For a real number, I0 is the word with the low address
1854 and I1 is the word with the high address. */
1857 immed_double_const (i0
, i1
, mode
)
1858 HOST_WIDE_INT i0
, i1
;
1859 enum machine_mode mode
;
1862 int in_current_obstack
;
1864 if (GET_MODE_CLASS (mode
) == MODE_INT
1865 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1867 /* We clear out all bits that don't belong in MODE, unless they and our
1868 sign bit are all one. So we get either a reasonable negative value
1869 or a reasonable unsigned value for this mode. */
1870 int width
= GET_MODE_BITSIZE (mode
);
1871 if (width
< HOST_BITS_PER_WIDE_INT
1872 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1873 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1874 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1875 else if (width
== HOST_BITS_PER_WIDE_INT
1876 && ! (i1
== ~0 && i0
< 0))
1878 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1879 /* We cannot represent this value as a constant. */
1882 /* If this would be an entire word for the target, but is not for
1883 the host, then sign-extend on the host so that the number will look
1884 the same way on the host that it would on the target.
1886 For example, when building a 64 bit alpha hosted 32 bit sparc
1887 targeted compiler, then we want the 32 bit unsigned value -1 to be
1888 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1889 The later confuses the sparc backend. */
1891 if (BITS_PER_WORD
< HOST_BITS_PER_WIDE_INT
&& BITS_PER_WORD
== width
1892 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1893 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1895 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1897 ??? Strictly speaking, this is wrong if we create a CONST_INT
1898 for a large unsigned constant with the size of MODE being
1899 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1900 wider mode. In that case we will mis-interpret it as a negative
1903 Unfortunately, the only alternative is to make a CONST_DOUBLE
1904 for any constant in any mode if it is an unsigned constant larger
1905 than the maximum signed integer in an int on the host. However,
1906 doing this will break everyone that always expects to see a CONST_INT
1907 for SImode and smaller.
1909 We have always been making CONST_INTs in this case, so nothing new
1912 if (width
<= HOST_BITS_PER_WIDE_INT
)
1913 i1
= (i0
< 0) ? ~0 : 0;
1915 /* If this integer fits in one word, return a CONST_INT. */
1916 if ((i1
== 0 && i0
>= 0)
1917 || (i1
== ~0 && i0
< 0))
1918 return GEN_INT (i0
);
1920 /* We use VOIDmode for integers. */
1924 /* Search the chain for an existing CONST_DOUBLE with the right value.
1925 If one is found, return it. */
1927 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1928 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1929 && GET_MODE (r
) == mode
)
1932 /* No; make a new one and add it to the chain.
1934 We may be called by an optimizer which may be discarding any memory
1935 allocated during its processing (such as combine and loop). However,
1936 we will be leaving this constant on the chain, so we cannot tolerate
1937 freed memory. So switch to saveable_obstack for this allocation
1938 and then switch back if we were in current_obstack. */
1940 push_obstacks_nochange ();
1941 rtl_in_saveable_obstack ();
1942 r
= gen_rtx (CONST_DOUBLE
, mode
, 0, i0
, i1
);
1945 /* Don't touch const_double_chain in nested function; see force_const_mem.
1946 Also, don't touch it if not inside any function. */
1947 if (outer_function_chain
== 0 && current_function_decl
!= 0)
1949 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1950 const_double_chain
= r
;
1953 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
1954 Actual use of mem-slot is only through force_const_mem. */
1956 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1961 /* Return a CONST_DOUBLE for a specified `double' value
1962 and machine mode. */
1965 immed_real_const_1 (d
, mode
)
1967 enum machine_mode mode
;
1969 union real_extract u
;
1971 int in_current_obstack
;
1973 /* Get the desired `double' value as a sequence of ints
1974 since that is how they are stored in a CONST_DOUBLE. */
1978 /* Detect special cases. */
1980 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
1981 if (!bcmp ((char *) &dconst0
, (char *) &d
, sizeof d
))
1982 return CONST0_RTX (mode
);
1983 /* Check for NaN first, because some ports (specifically the i386) do not
1984 emit correct ieee-fp code by default, and thus will generate a core
1985 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1986 does a floating point comparison. */
1987 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
1988 return CONST1_RTX (mode
);
1990 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
1991 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
1993 /* The rest of this function handles the case where
1994 a float value requires more than 2 ints of space.
1995 It will be deleted as dead code on machines that don't need it. */
1997 /* Search the chain for an existing CONST_DOUBLE with the right value.
1998 If one is found, return it. */
2000 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2001 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2002 && GET_MODE (r
) == mode
)
2005 /* No; make a new one and add it to the chain.
2007 We may be called by an optimizer which may be discarding any memory
2008 allocated during its processing (such as combine and loop). However,
2009 we will be leaving this constant on the chain, so we cannot tolerate
2010 freed memory. So switch to saveable_obstack for this allocation
2011 and then switch back if we were in current_obstack. */
2013 push_obstacks_nochange ();
2014 rtl_in_saveable_obstack ();
2015 r
= rtx_alloc (CONST_DOUBLE
);
2017 bcopy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (r
), sizeof u
);
2020 /* Don't touch const_double_chain in nested function; see force_const_mem.
2021 Also, don't touch it if not inside any function. */
2022 if (outer_function_chain
== 0 && current_function_decl
!= 0)
2024 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2025 const_double_chain
= r
;
2028 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2029 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2030 is only through force_const_mem. */
2032 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2037 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2038 which must be a REAL_CST tree node. */
2041 immed_real_const (exp
)
2044 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2047 /* At the end of a function, forget the memory-constants
2048 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2049 Also clear out real_constant_chain and clear out all the chain-pointers. */
2052 clear_const_double_mem ()
2054 register rtx r
, next
;
2056 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2057 See force_const_mem for explanation. */
2058 if (outer_function_chain
!= 0)
2061 for (r
= const_double_chain
; r
; r
= next
)
2063 next
= CONST_DOUBLE_CHAIN (r
);
2064 CONST_DOUBLE_CHAIN (r
) = 0;
2065 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2067 const_double_chain
= 0;
2070 /* Given an expression EXP with a constant value,
2071 reduce it to the sum of an assembler symbol and an integer.
2072 Store them both in the structure *VALUE.
2073 Abort if EXP does not reduce. */
2078 HOST_WIDE_INT offset
;
2082 decode_addr_const (exp
, value
)
2084 struct addr_const
*value
;
2086 register tree target
= TREE_OPERAND (exp
, 0);
2087 register int offset
= 0;
2092 if (TREE_CODE (target
) == COMPONENT_REF
2093 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
2096 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
2097 target
= TREE_OPERAND (target
, 0);
2099 else if (TREE_CODE (target
) == ARRAY_REF
)
2101 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
2102 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
2104 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
2105 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
2107 target
= TREE_OPERAND (target
, 0);
2113 switch (TREE_CODE (target
))
2117 x
= DECL_RTL (target
);
2121 if (output_bytecode
)
2122 /* FIXME: this may not be correct, check it */
2123 x
= bc_gen_rtx (TREE_STRING_POINTER (target
), 0, (struct bc_label
*) 0);
2125 x
= gen_rtx (MEM
, FUNCTION_MODE
,
2126 gen_rtx (LABEL_REF
, VOIDmode
,
2127 label_rtx (TREE_OPERAND (exp
, 0))));
2134 x
= TREE_CST_RTL (target
);
2141 if (!output_bytecode
)
2143 if (GET_CODE (x
) != MEM
)
2149 value
->offset
= offset
;
2152 /* Uniquize all constants that appear in memory.
2153 Each constant in memory thus far output is recorded
2154 in `const_hash_table' with a `struct constant_descriptor'
2155 that contains a polish representation of the value of
2158 We cannot store the trees in the hash table
2159 because the trees may be temporary. */
2161 struct constant_descriptor
2163 struct constant_descriptor
*next
;
2169 #define MAX_HASH_TABLE 1009
2170 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2172 /* Compute a hash code for a constant expression. */
2179 register int len
, hi
, i
;
2180 register enum tree_code code
= TREE_CODE (exp
);
2182 if (code
== INTEGER_CST
)
2184 p
= (char *) &TREE_INT_CST_LOW (exp
);
2185 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2187 else if (code
== REAL_CST
)
2189 p
= (char *) &TREE_REAL_CST (exp
);
2190 len
= sizeof TREE_REAL_CST (exp
);
2192 else if (code
== STRING_CST
)
2193 p
= TREE_STRING_POINTER (exp
), len
= TREE_STRING_LENGTH (exp
);
2194 else if (code
== COMPLEX_CST
)
2195 return const_hash (TREE_REALPART (exp
)) * 5
2196 + const_hash (TREE_IMAGPART (exp
));
2197 else if (code
== CONSTRUCTOR
&& TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2199 len
= int_size_in_bytes (TREE_TYPE (exp
));
2200 p
= (char*) alloca (len
);
2201 get_set_constructor_bytes (exp
, (unsigned char *) p
, len
);
2203 else if (code
== CONSTRUCTOR
)
2207 /* For record type, include the type in the hashing.
2208 We do not do so for array types
2209 because (1) the sizes of the elements are sufficient
2210 and (2) distinct array types can have the same constructor.
2211 Instead, we include the array size because the constructor could
2213 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2214 hi
= ((HOST_WIDE_INT
) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2217 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2218 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2220 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2221 if (TREE_VALUE (link
))
2222 hi
= (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2226 else if (code
== ADDR_EXPR
)
2228 struct addr_const value
;
2229 decode_addr_const (exp
, &value
);
2230 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2232 /* Don't hash the address of the SYMBOL_REF;
2233 only use the offset and the symbol name. */
2235 p
= XSTR (value
.base
, 0);
2236 for (i
= 0; p
[i
] != 0; i
++)
2237 hi
= ((hi
* 613) + (unsigned)(p
[i
]));
2239 else if (GET_CODE (value
.base
) == LABEL_REF
)
2240 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2242 hi
&= (1 << HASHBITS
) - 1;
2243 hi
%= MAX_HASH_TABLE
;
2246 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
2247 return const_hash (TREE_OPERAND (exp
, 0)) * 9
2248 + const_hash (TREE_OPERAND (exp
, 1));
2249 else if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
)
2250 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2252 /* Compute hashing function */
2254 for (i
= 0; i
< len
; i
++)
2255 hi
= ((hi
* 613) + (unsigned)(p
[i
]));
2257 hi
&= (1 << HASHBITS
) - 1;
2258 hi
%= MAX_HASH_TABLE
;
2262 /* Compare a constant expression EXP with a constant-descriptor DESC.
2263 Return 1 if DESC describes a constant with the same value as EXP. */
2266 compare_constant (exp
, desc
)
2268 struct constant_descriptor
*desc
;
2270 return 0 != compare_constant_1 (exp
, desc
->contents
);
2273 /* Compare constant expression EXP with a substring P of a constant descriptor.
2274 If they match, return a pointer to the end of the substring matched.
2275 If they do not match, return 0.
2277 Since descriptors are written in polish prefix notation,
2278 this function can be used recursively to test one operand of EXP
2279 against a subdescriptor, and if it succeeds it returns the
2280 address of the subdescriptor for the next operand. */
2283 compare_constant_1 (exp
, p
)
2287 register char *strp
;
2289 register enum tree_code code
= TREE_CODE (exp
);
2291 if (code
!= (enum tree_code
) *p
++)
2294 if (code
== INTEGER_CST
)
2296 /* Integer constants are the same only if the same width of type. */
2297 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2299 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2300 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2302 else if (code
== REAL_CST
)
2304 /* Real constants are the same only if the same width of type. */
2305 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2307 strp
= (char *) &TREE_REAL_CST (exp
);
2308 len
= sizeof TREE_REAL_CST (exp
);
2310 else if (code
== STRING_CST
)
2312 if (flag_writable_strings
)
2314 strp
= TREE_STRING_POINTER (exp
);
2315 len
= TREE_STRING_LENGTH (exp
);
2316 if (bcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2317 sizeof TREE_STRING_LENGTH (exp
)))
2319 p
+= sizeof TREE_STRING_LENGTH (exp
);
2321 else if (code
== COMPLEX_CST
)
2323 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2324 if (p
== 0) return 0;
2325 p
= compare_constant_1 (TREE_IMAGPART (exp
), p
);
2328 else if (code
== CONSTRUCTOR
&& TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2330 len
= int_size_in_bytes (TREE_TYPE (exp
));
2331 strp
= (char*) alloca (len
);
2332 get_set_constructor_bytes (exp
, (unsigned char *) strp
, len
);
2334 else if (code
== CONSTRUCTOR
)
2337 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2340 if (bcmp ((char *) &length
, p
, sizeof length
))
2344 /* For record constructors, insist that the types match.
2345 For arrays, just verify both constructors are for arrays. */
2346 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2347 type
= TREE_TYPE (exp
);
2350 if (bcmp ((char *) &type
, p
, sizeof type
))
2354 /* For arrays, insist that the size in bytes match. */
2355 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2357 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2358 if (bcmp ((char *) &size
, p
, sizeof size
))
2363 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2365 if (TREE_VALUE (link
))
2367 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2374 if (bcmp ((char *) &zero
, p
, sizeof zero
))
2382 else if (code
== ADDR_EXPR
)
2384 struct addr_const value
;
2385 decode_addr_const (exp
, &value
);
2386 strp
= (char *) &value
.offset
;
2387 len
= sizeof value
.offset
;
2388 /* Compare the offset. */
2390 if (*p
++ != *strp
++)
2392 /* Compare symbol name. */
2393 strp
= XSTR (value
.base
, 0);
2394 len
= strlen (strp
) + 1;
2396 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
2398 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2399 if (p
== 0) return 0;
2400 p
= compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2403 else if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
)
2405 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2409 /* Compare constant contents. */
2411 if (*p
++ != *strp
++)
2417 /* Construct a constant descriptor for the expression EXP.
2418 It is up to the caller to enter the descriptor in the hash table. */
2420 static struct constant_descriptor
*
2421 record_constant (exp
)
2424 struct constant_descriptor
*next
= 0;
2427 /* Make a struct constant_descriptor. The first two pointers will
2428 be filled in later. Here we just leave space for them. */
2430 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2431 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2432 record_constant_1 (exp
);
2433 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2436 /* Add a description of constant expression EXP
2437 to the object growing in `permanent_obstack'.
2438 No need to return its address; the caller will get that
2439 from the obstack when the object is complete. */
2442 record_constant_1 (exp
)
2445 register char *strp
;
2447 register enum tree_code code
= TREE_CODE (exp
);
2449 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2454 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2455 strp
= (char *) &TREE_INT_CST_LOW (exp
);
2456 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
2460 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2461 strp
= (char *) &TREE_REAL_CST (exp
);
2462 len
= sizeof TREE_REAL_CST (exp
);
2466 if (flag_writable_strings
)
2469 strp
= TREE_STRING_POINTER (exp
);
2470 len
= TREE_STRING_LENGTH (exp
);
2471 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2472 sizeof TREE_STRING_LENGTH (exp
));
2476 record_constant_1 (TREE_REALPART (exp
));
2477 record_constant_1 (TREE_IMAGPART (exp
));
2481 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2483 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2484 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2485 obstack_blank (&permanent_obstack
, nbytes
);
2486 get_set_constructor_bytes
2487 (exp
, (unsigned char *) permanent_obstack
.next_free
, nbytes
);
2493 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2496 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2498 /* For record constructors, insist that the types match.
2499 For arrays, just verify both constructors are for arrays. */
2500 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2501 type
= TREE_TYPE (exp
);
2504 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2506 /* For arrays, insist that the size in bytes match. */
2507 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2509 int size
= int_size_in_bytes (TREE_TYPE (exp
));
2510 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2513 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2515 if (TREE_VALUE (link
))
2516 record_constant_1 (TREE_VALUE (link
));
2521 obstack_grow (&permanent_obstack
,
2522 (char *) &zero
, sizeof zero
);
2530 struct addr_const value
;
2532 decode_addr_const (exp
, &value
);
2533 /* Record the offset. */
2534 obstack_grow (&permanent_obstack
,
2535 (char *) &value
.offset
, sizeof value
.offset
);
2536 /* Record the symbol name. */
2537 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2538 strlen (XSTR (value
.base
, 0)) + 1);
2544 record_constant_1 (TREE_OPERAND (exp
, 0));
2545 record_constant_1 (TREE_OPERAND (exp
, 1));
2550 case NON_LVALUE_EXPR
:
2551 record_constant_1 (TREE_OPERAND (exp
, 0));
2558 /* Record constant contents. */
2559 obstack_grow (&permanent_obstack
, strp
, len
);
2562 /* Record a list of constant expressions that were passed to
2563 output_constant_def but that could not be output right away. */
2565 struct deferred_constant
2567 struct deferred_constant
*next
;
2573 static struct deferred_constant
*deferred_constants
;
2575 /* Nonzero means defer output of addressed subconstants
2576 (i.e., those for which output_constant_def is called.) */
2577 static int defer_addressed_constants_flag
;
2579 /* Start deferring output of subconstants. */
2582 defer_addressed_constants ()
2584 defer_addressed_constants_flag
++;
2587 /* Stop deferring output of subconstants,
2588 and output now all those that have been deferred. */
2591 output_deferred_addressed_constants ()
2593 struct deferred_constant
*p
, *next
;
2595 defer_addressed_constants_flag
--;
2597 if (defer_addressed_constants_flag
> 0)
2600 for (p
= deferred_constants
; p
; p
= next
)
2602 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2607 deferred_constants
= 0;
2610 /* Make a copy of the whole tree structure for a constant.
2611 This handles the same types of nodes that compare_constant
2612 and record_constant handle. */
2618 switch (TREE_CODE (exp
))
2621 /* For ADDR_EXPR, we do not want to copy the decl whose address
2622 is requested. We do want to copy constants though. */
2623 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2624 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2625 copy_constant (TREE_OPERAND (exp
, 0)));
2627 return copy_node (exp
);
2632 return copy_node (exp
);
2635 return build_complex (copy_constant (TREE_REALPART (exp
)),
2636 copy_constant (TREE_IMAGPART (exp
)));
2640 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2641 copy_constant (TREE_OPERAND (exp
, 0)),
2642 copy_constant (TREE_OPERAND (exp
, 1)));
2646 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2647 copy_constant (TREE_OPERAND (exp
, 0)));
2651 tree copy
= copy_node (exp
);
2652 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2655 CONSTRUCTOR_ELTS (copy
) = list
;
2656 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2657 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2658 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2659 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2660 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2670 /* Return an rtx representing a reference to constant data in memory
2671 for the constant expression EXP.
2673 If assembler code for such a constant has already been output,
2674 return an rtx to refer to it.
2675 Otherwise, output such a constant in memory (or defer it for later)
2676 and generate an rtx for it.
2678 The TREE_CST_RTL of EXP is set up to point to that rtx.
2679 The const_hash_table records which constants already have label strings. */
2682 output_constant_def (exp
)
2686 register struct constant_descriptor
*desc
;
2692 if (TREE_CODE (exp
) == INTEGER_CST
)
2693 abort (); /* No TREE_CST_RTL slot in these. */
2695 if (TREE_CST_RTL (exp
))
2696 return TREE_CST_RTL (exp
);
2698 /* Make sure any other constants whose addresses appear in EXP
2699 are assigned label numbers. */
2701 reloc
= output_addressed_constants (exp
);
2703 /* Compute hash code of EXP. Search the descriptors for that hash code
2704 to see if any of them describes EXP. If yes, the descriptor records
2705 the label number already assigned. */
2707 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
2709 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
2710 if (compare_constant (exp
, desc
))
2712 found
= desc
->label
;
2718 /* No constant equal to EXP is known to have been output.
2719 Make a constant descriptor to enter EXP in the hash table.
2720 Assign the label number and record it in the descriptor for
2721 future calls to this function to find. */
2723 /* Create a string containing the label name, in LABEL. */
2724 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2726 desc
= record_constant (exp
);
2727 desc
->next
= const_hash_table
[hash
];
2729 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
2730 const_hash_table
[hash
] = desc
;
2734 /* Create a string containing the label name, in LABEL. */
2735 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2738 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2740 push_obstacks_nochange ();
2741 if (TREE_PERMANENT (exp
))
2742 end_temporary_allocation ();
2744 def
= gen_rtx (SYMBOL_REF
, Pmode
, desc
->label
);
2747 = gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)), def
);
2748 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
2749 if (AGGREGATE_TYPE_P (TREE_TYPE (exp
)))
2750 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
2754 /* Optionally set flags or add text to the name to record information
2755 such as that it is a function name. If the name is changed, the macro
2756 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2757 #ifdef ENCODE_SECTION_INFO
2758 ENCODE_SECTION_INFO (exp
);
2761 /* If this is the first time we've seen this particular constant,
2762 output it (or defer its output for later). */
2765 if (defer_addressed_constants_flag
)
2767 struct deferred_constant
*p
;
2768 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
2770 push_obstacks_nochange ();
2771 suspend_momentary ();
2772 p
->exp
= copy_constant (exp
);
2775 p
->labelno
= const_labelno
++;
2776 p
->next
= deferred_constants
;
2777 deferred_constants
= p
;
2780 output_constant_def_contents (exp
, reloc
, const_labelno
++);
2783 return TREE_CST_RTL (exp
);
2786 /* Now output assembler code to define the label for EXP,
2787 and follow it with the data of EXP. */
2790 output_constant_def_contents (exp
, reloc
, labelno
)
2797 if (IN_NAMED_SECTION (exp
))
2798 named_section (exp
, NULL
);
2801 /* First switch to text section, except for writable strings. */
2802 #ifdef SELECT_SECTION
2803 SELECT_SECTION (exp
, reloc
);
2805 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
2806 || (flag_pic
&& reloc
))
2809 readonly_data_section ();
2813 /* Align the location counter as required by EXP's data type. */
2814 align
= TYPE_ALIGN (TREE_TYPE (exp
));
2815 #ifdef CONSTANT_ALIGNMENT
2816 align
= CONSTANT_ALIGNMENT (exp
, align
);
2819 if (align
> BITS_PER_UNIT
)
2821 if (!output_bytecode
)
2823 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2827 BC_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
2831 /* Output the label itself. */
2832 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
2834 /* Output the value of EXP. */
2835 output_constant (exp
,
2836 (TREE_CODE (exp
) == STRING_CST
2837 ? TREE_STRING_LENGTH (exp
)
2838 : int_size_in_bytes (TREE_TYPE (exp
))));
2842 /* Similar hash facility for making memory-constants
2843 from constant rtl-expressions. It is used on RISC machines
2844 where immediate integer arguments and constant addresses are restricted
2845 so that such constants must be stored in memory.
2847 This pool of constants is reinitialized for each function
2848 so each function gets its own constants-pool that comes right before it.
2850 All structures allocated here are discarded when functions are saved for
2851 inlining, so they do not need to be allocated permanently. */
2853 #define MAX_RTX_HASH_TABLE 61
2854 static struct constant_descriptor
**const_rtx_hash_table
;
2856 /* Structure to represent sufficient information about a constant so that
2857 it can be output when the constant pool is output, so that function
2858 integration can be done, and to simplify handling on machines that reference
2859 constant pool as base+displacement. */
2861 struct pool_constant
2863 struct constant_descriptor
*desc
;
2864 struct pool_constant
*next
;
2865 enum machine_mode mode
;
2872 /* Pointers to first and last constant in pool. */
2874 static struct pool_constant
*first_pool
, *last_pool
;
2876 /* Current offset in constant pool (does not include any machine-specific
2879 static int pool_offset
;
2881 /* Structure used to maintain hash table mapping symbols used to their
2882 corresponding constants. */
2887 struct pool_constant
*pool
;
2888 struct pool_sym
*next
;
2891 static struct pool_sym
**const_rtx_sym_hash_table
;
2893 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2894 The argument is XSTR (... , 0) */
2896 #define SYMHASH(LABEL) \
2897 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2899 /* Initialize constant pool hashing for next function. */
2902 init_const_rtx_hash_table ()
2904 const_rtx_hash_table
2905 = ((struct constant_descriptor
**)
2906 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*)));
2907 const_rtx_sym_hash_table
2908 = ((struct pool_sym
**)
2909 oballoc (MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*)));
2910 bzero ((char *) const_rtx_hash_table
,
2911 MAX_RTX_HASH_TABLE
* sizeof (struct constant_descriptor
*));
2912 bzero ((char *) const_rtx_sym_hash_table
,
2913 MAX_RTX_HASH_TABLE
* sizeof (struct pool_sym
*));
2915 first_pool
= last_pool
= 0;
2919 /* Save and restore status for a nested function. */
2922 save_varasm_status (p
)
2925 p
->const_rtx_hash_table
= const_rtx_hash_table
;
2926 p
->const_rtx_sym_hash_table
= const_rtx_sym_hash_table
;
2927 p
->first_pool
= first_pool
;
2928 p
->last_pool
= last_pool
;
2929 p
->pool_offset
= pool_offset
;
2933 restore_varasm_status (p
)
2936 const_rtx_hash_table
= p
->const_rtx_hash_table
;
2937 const_rtx_sym_hash_table
= p
->const_rtx_sym_hash_table
;
2938 first_pool
= p
->first_pool
;
2939 last_pool
= p
->last_pool
;
2940 pool_offset
= p
->pool_offset
;
2943 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2947 #ifdef ONLY_INT_FIELDS
2948 unsigned int kind
: 16;
2949 unsigned int mode
: 16;
2951 enum kind kind
: 16;
2952 enum machine_mode mode
: 16;
2955 union real_extract du
;
2956 struct addr_const addr
;
2960 /* Express an rtx for a constant integer (perhaps symbolic)
2961 as the sum of a symbol or label plus an explicit integer.
2962 They are stored into VALUE. */
2965 decode_rtx_const (mode
, x
, value
)
2966 enum machine_mode mode
;
2968 struct rtx_const
*value
;
2970 /* Clear the whole structure, including any gaps. */
2973 int *p
= (int *) value
;
2974 int *end
= (int *) (value
+ 1);
2979 value
->kind
= RTX_INT
; /* Most usual kind. */
2982 switch (GET_CODE (x
))
2985 value
->kind
= RTX_DOUBLE
;
2986 if (GET_MODE (x
) != VOIDmode
)
2987 value
->mode
= GET_MODE (x
);
2988 bcopy ((char *) &CONST_DOUBLE_LOW (x
),
2989 (char *) &value
->un
.du
, sizeof value
->un
.du
);
2993 value
->un
.addr
.offset
= INTVAL (x
);
2999 value
->un
.addr
.base
= x
;
3004 if (GET_CODE (x
) == PLUS
)
3006 value
->un
.addr
.base
= XEXP (x
, 0);
3007 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3009 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3011 else if (GET_CODE (x
) == MINUS
)
3013 value
->un
.addr
.base
= XEXP (x
, 0);
3014 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
3016 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3026 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3027 switch (GET_CODE (value
->un
.addr
.base
))
3031 /* Use the string's address, not the SYMBOL_REF's address,
3032 for the sake of addresses of library routines.
3033 For a LABEL_REF, compare labels. */
3034 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3038 /* Given a MINUS expression, simplify it if both sides
3039 include the same symbol. */
3042 simplify_subtraction (x
)
3045 struct rtx_const val0
, val1
;
3047 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3048 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3050 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3051 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3055 /* Compute a hash code for a constant RTL expression. */
3058 const_hash_rtx (mode
, x
)
3059 enum machine_mode mode
;
3064 struct rtx_const value
;
3065 decode_rtx_const (mode
, x
, &value
);
3067 /* Compute hashing function */
3069 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3070 hi
+= ((int *) &value
)[i
];
3072 hi
&= (1 << HASHBITS
) - 1;
3073 hi
%= MAX_RTX_HASH_TABLE
;
3077 /* Compare a constant rtl object X with a constant-descriptor DESC.
3078 Return 1 if DESC describes a constant with the same value as X. */
3081 compare_constant_rtx (mode
, x
, desc
)
3082 enum machine_mode mode
;
3084 struct constant_descriptor
*desc
;
3086 register int *p
= (int *) desc
->contents
;
3089 struct rtx_const value
;
3091 decode_rtx_const (mode
, x
, &value
);
3092 strp
= (int *) &value
;
3093 len
= sizeof value
/ sizeof (int);
3095 /* Compare constant contents. */
3097 if (*p
++ != *strp
++)
3103 /* Construct a constant descriptor for the rtl-expression X.
3104 It is up to the caller to enter the descriptor in the hash table. */
3106 static struct constant_descriptor
*
3107 record_constant_rtx (mode
, x
)
3108 enum machine_mode mode
;
3111 struct constant_descriptor
*ptr
;
3113 struct rtx_const value
;
3115 decode_rtx_const (mode
, x
, &value
);
3117 /* Put these things in the saveable obstack so we can ensure it won't
3118 be freed if we are called from combine or some other phase that discards
3119 memory allocated from function_obstack (current_obstack). */
3120 obstack_grow (saveable_obstack
, &ptr
, sizeof ptr
);
3121 obstack_grow (saveable_obstack
, &label
, sizeof label
);
3123 /* Record constant contents. */
3124 obstack_grow (saveable_obstack
, &value
, sizeof value
);
3126 return (struct constant_descriptor
*) obstack_finish (saveable_obstack
);
3129 /* Given a constant rtx X, make (or find) a memory constant for its value
3130 and return a MEM rtx to refer to it in memory. */
3133 force_const_mem (mode
, x
)
3134 enum machine_mode mode
;
3138 register struct constant_descriptor
*desc
;
3143 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3144 (this will always be true for floating CONST_DOUBLEs that have been
3145 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3146 use the previous copy. Otherwise, make a new one. Note that in
3147 the unlikely event that this same CONST_DOUBLE is used in two different
3148 modes in an alternating fashion, we will allocate a lot of different
3149 memory locations, but this should be extremely rare. */
3151 /* Don't use CONST_DOUBLE_MEM in a nested function.
3152 Nested functions have their own constant pools,
3153 so they can't share the same values in CONST_DOUBLE_MEM
3154 with the containing function. */
3155 if (outer_function_chain
== 0)
3156 if (GET_CODE (x
) == CONST_DOUBLE
3157 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3158 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3159 return CONST_DOUBLE_MEM (x
);
3161 /* Compute hash code of X. Search the descriptors for that hash code
3162 to see if any of them describes X. If yes, the descriptor records
3163 the label number already assigned. */
3165 hash
= const_hash_rtx (mode
, x
);
3167 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3168 if (compare_constant_rtx (mode
, x
, desc
))
3170 found
= desc
->label
;
3176 register struct pool_constant
*pool
;
3177 register struct pool_sym
*sym
;
3180 /* No constant equal to X is known to have been output.
3181 Make a constant descriptor to enter X in the hash table.
3182 Assign the label number and record it in the descriptor for
3183 future calls to this function to find. */
3185 desc
= record_constant_rtx (mode
, x
);
3186 desc
->next
= const_rtx_hash_table
[hash
];
3187 const_rtx_hash_table
[hash
] = desc
;
3189 /* Align the location counter as required by EXP's data type. */
3190 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
3191 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
3192 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
3194 pool_offset
+= align
- 1;
3195 pool_offset
&= ~ (align
- 1);
3197 /* If RTL is not being placed into the saveable obstack, make a
3198 copy of X that is in the saveable obstack in case we are being
3199 called from combine or some other phase that discards memory
3200 it allocates. We need only do this if it is a CONST, since
3201 no other RTX should be allocated in this situation. */
3202 if (rtl_obstack
!= saveable_obstack
3203 && GET_CODE (x
) == CONST
)
3205 push_obstacks_nochange ();
3206 rtl_in_saveable_obstack ();
3208 x
= gen_rtx (CONST
, GET_MODE (x
),
3209 gen_rtx (PLUS
, GET_MODE (x
),
3210 XEXP (XEXP (x
, 0), 0), XEXP (XEXP (x
, 0), 1)));
3214 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3216 pool
= (struct pool_constant
*) savealloc (sizeof (struct pool_constant
));
3220 pool
->labelno
= const_labelno
;
3221 pool
->align
= align
;
3222 pool
->offset
= pool_offset
;
3228 last_pool
->next
= pool
;
3231 pool_offset
+= GET_MODE_SIZE (mode
);
3233 /* Create a string containing the label name, in LABEL. */
3234 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3239 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
3241 /* Add label to symbol hash table. */
3242 hash
= SYMHASH (found
);
3243 sym
= (struct pool_sym
*) savealloc (sizeof (struct pool_sym
));
3246 sym
->next
= const_rtx_sym_hash_table
[hash
];
3247 const_rtx_sym_hash_table
[hash
] = sym
;
3250 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3252 def
= gen_rtx (MEM
, mode
, gen_rtx (SYMBOL_REF
, Pmode
, found
));
3254 RTX_UNCHANGING_P (def
) = 1;
3255 /* Mark the symbol_ref as belonging to this constants pool. */
3256 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3257 current_function_uses_const_pool
= 1;
3259 if (outer_function_chain
== 0)
3260 if (GET_CODE (x
) == CONST_DOUBLE
)
3262 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3264 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3265 const_double_chain
= x
;
3267 CONST_DOUBLE_MEM (x
) = def
;
3273 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3274 the corresponding pool_constant structure. */
3276 static struct pool_constant
*
3277 find_pool_constant (addr
)
3280 struct pool_sym
*sym
;
3281 char *label
= XSTR (addr
, 0);
3283 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
3284 if (sym
->label
== label
)
3290 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3293 get_pool_constant (addr
)
3296 return (find_pool_constant (addr
))->constant
;
3299 /* Similar, return the mode. */
3302 get_pool_mode (addr
)
3305 return (find_pool_constant (addr
))->mode
;
3308 /* Similar, return the offset in the constant pool. */
3311 get_pool_offset (addr
)
3314 return (find_pool_constant (addr
))->offset
;
3317 /* Return the size of the constant pool. */
3325 /* Write all the constants in the constant pool. */
3328 output_constant_pool (fnname
, fndecl
)
3332 struct pool_constant
*pool
;
3334 union real_extract u
;
3336 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3337 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3340 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3344 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3345 whose CODE_LABEL has been deleted. This can occur if a jump table
3346 is eliminated by optimization. If so, write a constant of zero
3347 instead. Note that this can also happen by turning the
3348 CODE_LABEL into a NOTE. */
3349 if (((GET_CODE (x
) == LABEL_REF
3350 && (INSN_DELETED_P (XEXP (x
, 0))
3351 || GET_CODE (XEXP (x
, 0)) == NOTE
)))
3352 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
3353 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
3354 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))
3355 || GET_CODE (XEXP (XEXP (XEXP (x
, 0), 0), 0)) == NOTE
)))
3358 /* First switch to correct section. */
3359 #ifdef SELECT_RTX_SECTION
3360 SELECT_RTX_SECTION (pool
->mode
, x
);
3362 readonly_data_section ();
3365 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3366 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3367 pool
->align
, pool
->labelno
, done
);
3370 if (pool
->align
> 1)
3371 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
3373 /* Output the label. */
3374 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3376 /* Output the value of the constant itself. */
3377 switch (GET_MODE_CLASS (pool
->mode
))
3380 if (GET_CODE (x
) != CONST_DOUBLE
)
3383 bcopy ((char *) &CONST_DOUBLE_LOW (x
), (char *) &u
, sizeof u
);
3384 assemble_real (u
.d
, pool
->mode
);
3388 case MODE_PARTIAL_INT
:
3389 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3399 /* Done with this pool. */
3400 first_pool
= last_pool
= 0;
3403 /* Find all the constants whose addresses are referenced inside of EXP,
3404 and make sure assembler code with a label has been output for each one.
3405 Indicate whether an ADDR_EXPR has been encountered. */
3408 output_addressed_constants (exp
)
3413 switch (TREE_CODE (exp
))
3417 register tree constant
= TREE_OPERAND (exp
, 0);
3419 while (TREE_CODE (constant
) == COMPONENT_REF
)
3421 constant
= TREE_OPERAND (constant
, 0);
3424 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3425 || TREE_CODE (constant
) == CONSTRUCTOR
)
3426 /* No need to do anything here
3427 for addresses of variables or functions. */
3428 output_constant_def (constant
);
3435 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3436 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3441 case NON_LVALUE_EXPR
:
3442 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3448 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3449 if (TREE_VALUE (link
) != 0)
3450 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3460 /* Output assembler code for constant EXP to FILE, with no label.
3461 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3462 Assumes output_addressed_constants has been done on EXP already.
3464 Generate exactly SIZE bytes of assembler data, padding at the end
3465 with zeros if necessary. SIZE must always be specified.
3467 SIZE is important for structure constructors,
3468 since trailing members may have been omitted from the constructor.
3469 It is also important for initialization of arrays from string constants
3470 since the full length of the string constant might not be wanted.
3471 It is also needed for initialization of unions, where the initializer's
3472 type is just one member, and that may not be as long as the union.
3474 There a case in which we would fail to output exactly SIZE bytes:
3475 for a structure constructor that wants to produce more than SIZE bytes.
3476 But such constructors will never be generated for any possible input. */
3479 output_constant (exp
, size
)
3483 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
3489 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3490 That way we get the constant (we hope) inside it. Also, strip off any
3491 NOP_EXPR that converts between two record, union, array, or set types. */
3492 while ((TREE_CODE (exp
) == NOP_EXPR
3493 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
3494 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
3495 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3496 exp
= TREE_OPERAND (exp
, 0);
3498 /* Allow a constructor with no elements for any data type.
3499 This means to fill the space with zeros. */
3500 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
3502 if (output_bytecode
)
3503 bc_emit_const_skip (size
);
3505 assemble_zeros (size
);
3516 case REFERENCE_TYPE
:
3517 /* ??? What about (int)((float)(int)&foo + 4) */
3518 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
3519 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
3520 exp
= TREE_OPERAND (exp
, 0);
3522 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
3523 EXPAND_INITIALIZER
),
3525 error ("initializer for integer value is too complicated");
3530 if (TREE_CODE (exp
) != REAL_CST
)
3531 error ("initializer for floating value is not a floating constant");
3533 assemble_real (TREE_REAL_CST (exp
),
3534 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
3539 output_constant (TREE_REALPART (exp
), size
/ 2);
3540 output_constant (TREE_IMAGPART (exp
), size
/ 2);
3541 size
-= (size
/ 2) * 2;
3545 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3547 output_constructor (exp
, size
);
3550 else if (TREE_CODE (exp
) == STRING_CST
)
3554 if (size
> TREE_STRING_LENGTH (exp
))
3556 excess
= size
- TREE_STRING_LENGTH (exp
);
3557 size
= TREE_STRING_LENGTH (exp
);
3560 assemble_string (TREE_STRING_POINTER (exp
), size
);
3569 if (TREE_CODE (exp
) == CONSTRUCTOR
)
3570 output_constructor (exp
, size
);
3576 if (TREE_CODE (exp
) == INTEGER_CST
)
3577 assemble_integer (expand_expr (exp
, NULL_RTX
,
3578 VOIDmode
, EXPAND_INITIALIZER
),
3580 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
3582 unsigned char *buffer
= (unsigned char *) alloca (size
);
3583 if (get_set_constructor_bytes (exp
, buffer
, size
))
3585 assemble_string ((char *) buffer
, size
);
3588 error ("unknown set constructor type");
3593 assemble_zeros (size
);
3596 /* Bytecode specific code to output assembler for integer. */
3599 bc_assemble_integer (exp
, size
)
3607 /* FIXME: is this fold() business going to be as good as the
3608 expand_expr() using EXPAND_SUM above in the RTL case? I
3610 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3614 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
)
3615 exp
= TREE_OPERAND (exp
, 0);
3616 if (TREE_CODE (exp
) == INTEGER_CST
)
3621 else if (TREE_CODE (exp
) == PLUS_EXPR
)
3623 const_part
= TREE_OPERAND (exp
, 0);
3624 while (TREE_CODE (const_part
) == NOP_EXPR
3625 || TREE_CODE (const_part
) == CONVERT_EXPR
)
3626 const_part
= TREE_OPERAND (const_part
, 0);
3627 addr_part
= TREE_OPERAND (exp
, 1);
3628 while (TREE_CODE (addr_part
) == NOP_EXPR
3629 || TREE_CODE (addr_part
) == CONVERT_EXPR
)
3630 addr_part
= TREE_OPERAND (addr_part
, 0);
3631 if (TREE_CODE (const_part
) != INTEGER_CST
)
3632 tmp
= const_part
, const_part
= addr_part
, addr_part
= tmp
;
3633 if (TREE_CODE (const_part
) != INTEGER_CST
3634 || TREE_CODE (addr_part
) != ADDR_EXPR
)
3635 abort (); /* FIXME: we really haven't considered
3636 all the possible cases here. */
3638 else if (TREE_CODE (exp
) == ADDR_EXPR
)
3640 const_part
= integer_zero_node
;
3644 abort (); /* FIXME: ditto previous. */
3650 char c
= TREE_INT_CST_LOW (const_part
);
3656 short s
= TREE_INT_CST_LOW (const_part
);
3657 bc_emit ((char *) &s
, 2);
3662 int i
= TREE_INT_CST_LOW (const_part
);
3663 bc_emit ((char *) &i
, 4);
3668 if (WORDS_BIG_ENDIAN
)
3670 int i
= TREE_INT_CST_HIGH (const_part
);
3671 bc_emit ((char *) &i
, 4);
3672 i
= TREE_INT_CST_LOW (const_part
);
3673 bc_emit ((char *) &i
, 4);
3677 int i
= TREE_INT_CST_LOW (const_part
);
3678 bc_emit ((char *) &i
, 4);
3679 i
= TREE_INT_CST_HIGH (const_part
);
3680 bc_emit ((char *) &i
, 4);
3687 && TREE_CODE (TREE_OPERAND (addr_part
, 0)) == VAR_DECL
)
3688 bc_emit_labelref (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part
, 0)),
3689 TREE_INT_CST_LOW (const_part
));
3691 abort (); /* FIXME: there may be more cases. */
3694 /* Subroutine of output_constant, used for CONSTRUCTORs
3695 (aggregate constants).
3696 Generate at least SIZE bytes, padding if necessary. */
3699 output_constructor (exp
, size
)
3703 register tree link
, field
= 0;
3704 HOST_WIDE_INT min_index
= 0;
3705 /* Number of bytes output or skipped so far.
3706 In other words, current position within the constructor. */
3707 int total_bytes
= 0;
3708 /* Non-zero means BYTE contains part of a byte, to be output. */
3709 int byte_buffer_in_use
= 0;
3712 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
3715 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
3716 field
= TYPE_FIELDS (TREE_TYPE (exp
));
3718 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
3719 && TYPE_DOMAIN (TREE_TYPE (exp
)) != 0)
3721 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp
))));
3723 /* As LINK goes through the elements of the constant,
3724 FIELD goes through the structure fields, if the constant is a structure.
3725 if the constant is a union, then we override this,
3726 by getting the field from the TREE_LIST element.
3727 But the constant could also be an array. Then FIELD is zero. */
3728 for (link
= CONSTRUCTOR_ELTS (exp
);
3730 link
= TREE_CHAIN (link
),
3731 field
= field
? TREE_CHAIN (field
) : 0)
3733 tree val
= TREE_VALUE (link
);
3736 /* the element in a union constructor specifies the proper field. */
3738 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
3739 || TREE_CODE (TREE_TYPE (exp
)) == UNION_TYPE
)
3741 /* if available, use the type given by link */
3742 if (TREE_PURPOSE (link
) != 0)
3743 field
= TREE_PURPOSE (link
);
3746 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
3747 index
= TREE_PURPOSE (link
);
3749 /* Eliminate the marker that makes a cast not be an lvalue. */
3753 if (field
== 0 || !DECL_BIT_FIELD (field
))
3755 /* An element that is not a bit-field. */
3757 register int fieldsize
;
3758 /* Since this structure is static,
3759 we know the positions are constant. */
3760 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
3764 bitpos
= (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val
)))
3766 * (TREE_INT_CST_LOW (index
) - min_index
));
3768 /* Output any buffered-up bit-fields preceding this element. */
3769 if (byte_buffer_in_use
)
3771 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
3773 byte_buffer_in_use
= 0;
3776 /* Advance to offset of this element.
3777 Note no alignment needed in an array, since that is guaranteed
3778 if each element has the proper size. */
3779 if ((field
!= 0 || index
!= 0) && bitpos
!= total_bytes
)
3781 if (!output_bytecode
)
3782 assemble_zeros (bitpos
- total_bytes
);
3784 bc_emit_const_skip (bitpos
- total_bytes
);
3785 total_bytes
= bitpos
;
3788 /* Determine size this element should occupy. */
3791 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
3793 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
3795 /* This avoids overflow trouble. */
3796 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
3798 size_int (BITS_PER_UNIT
));
3799 fieldsize
= TREE_INT_CST_LOW (size_tree
);
3803 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
3804 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
3808 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
3810 /* Output the element's initial value. */
3812 assemble_zeros (fieldsize
);
3814 output_constant (val
, fieldsize
);
3816 /* Count its size. */
3817 total_bytes
+= fieldsize
;
3819 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
3820 error ("invalid initial value for member `%s'",
3821 IDENTIFIER_POINTER (DECL_NAME (field
)));
3824 /* Element that is a bit-field. */
3826 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
3828 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
3831 val
= integer_zero_node
;
3833 /* If this field does not start in this (or, next) byte,
3835 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3837 /* Output remnant of any bit field in previous bytes. */
3838 if (byte_buffer_in_use
)
3840 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
3842 byte_buffer_in_use
= 0;
3845 /* If still not at proper byte, advance to there. */
3846 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
3848 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
3849 total_bytes
= next_offset
/ BITS_PER_UNIT
;
3853 if (! byte_buffer_in_use
)
3856 /* We must split the element into pieces that fall within
3857 separate bytes, and combine each byte with previous or
3858 following bit-fields. */
3860 /* next_offset is the offset n fbits from the beginning of
3861 the structure to the next bit of this element to be processed.
3862 end_offset is the offset of the first bit past the end of
3864 while (next_offset
< end_offset
)
3868 HOST_WIDE_INT value
;
3869 int next_byte
= next_offset
/ BITS_PER_UNIT
;
3870 int next_bit
= next_offset
% BITS_PER_UNIT
;
3872 /* Advance from byte to byte
3873 within this element when necessary. */
3874 while (next_byte
!= total_bytes
)
3876 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
3881 /* Number of bits we can process at once
3882 (all part of the same byte). */
3883 this_time
= MIN (end_offset
- next_offset
,
3884 BITS_PER_UNIT
- next_bit
);
3885 if (BYTES_BIG_ENDIAN
)
3887 /* On big-endian machine, take the most significant bits
3888 first (of the bits that are significant)
3889 and put them into bytes from the most significant end. */
3890 shift
= end_offset
- next_offset
- this_time
;
3891 /* Don't try to take a bunch of bits that cross
3892 the word boundary in the INTEGER_CST. */
3893 if (shift
< HOST_BITS_PER_WIDE_INT
3894 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3896 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
3897 shift
= HOST_BITS_PER_WIDE_INT
;
3900 /* Now get the bits from the appropriate constant word. */
3901 if (shift
< HOST_BITS_PER_WIDE_INT
)
3903 value
= TREE_INT_CST_LOW (val
);
3905 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3907 value
= TREE_INT_CST_HIGH (val
);
3908 shift
-= HOST_BITS_PER_WIDE_INT
;
3912 byte
|= (((value
>> shift
)
3913 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
3914 << (BITS_PER_UNIT
- this_time
- next_bit
));
3918 /* On little-endian machines,
3919 take first the least significant bits of the value
3920 and pack them starting at the least significant
3921 bits of the bytes. */
3922 shift
= (next_offset
3923 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
3924 /* Don't try to take a bunch of bits that cross
3925 the word boundary in the INTEGER_CST. */
3926 if (shift
< HOST_BITS_PER_WIDE_INT
3927 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
3929 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
3930 shift
= HOST_BITS_PER_WIDE_INT
;
3933 /* Now get the bits from the appropriate constant word. */
3934 if (shift
< HOST_BITS_PER_INT
)
3935 value
= TREE_INT_CST_LOW (val
);
3936 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
3938 value
= TREE_INT_CST_HIGH (val
);
3939 shift
-= HOST_BITS_PER_WIDE_INT
;
3943 byte
|= (((value
>> shift
)
3944 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
3947 next_offset
+= this_time
;
3948 byte_buffer_in_use
= 1;
3952 if (byte_buffer_in_use
)
3954 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
3957 if (total_bytes
< size
)
3958 assemble_zeros (size
- total_bytes
);
3961 /* Output asm to handle ``#pragma weak'' */
3963 handle_pragma_weak (what
, name
, value
)
3964 enum pragma_state what
;
3967 #ifdef HANDLE_PRAGMA_WEAK
3968 if (what
== ps_name
|| what
== ps_value
)
3970 struct weak_syms
*weak
=
3971 (struct weak_syms
*)permalloc (sizeof (struct weak_syms
));
3972 weak
->next
= weak_decls
;
3973 weak
->name
= permalloc (strlen (name
) + 1);
3974 strcpy (weak
->name
, name
);
3976 if (what
!= ps_value
)
3977 weak
->value
= NULL_PTR
;
3981 weak
->value
= permalloc (strlen (value
) + 1);
3982 strcpy (weak
->value
, value
);
3987 else if (! (what
== ps_done
|| what
== ps_start
))
3988 warning ("malformed `#pragma weak'");
3989 #endif /* HANDLE_PRAGMA_WEAK */
3992 /* Declare DECL to be a weak symbol. */
3998 if (! TREE_PUBLIC (decl
))
3999 error_with_decl (decl
, "weak declaration of `%s' must be public");
4000 else if (TREE_ASM_WRITTEN (decl
))
4001 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4002 else if (SUPPORTS_WEAK
)
4003 DECL_WEAK (decl
) = 1;
4006 /* Emit any pending weak declarations. */
4011 #ifdef HANDLE_PRAGMA_WEAK
4012 if (HANDLE_PRAGMA_WEAK
)
4014 struct weak_syms
*t
;
4015 for (t
= weak_decls
; t
; t
= t
->next
)
4017 ASM_WEAKEN_LABEL (asm_out_file
, t
->name
);
4019 ASM_OUTPUT_DEF (asm_out_file
, t
->name
, t
->value
);
4026 assemble_alias (decl
, target
)
4029 #ifdef ASM_OUTPUT_DEF
4032 make_decl_rtl (decl
, (char*)0, 1);
4033 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
4035 /* Make name accessible from other files, if appropriate. */
4037 if (TREE_PUBLIC (decl
))
4039 #ifdef ASM_WEAKEN_LABEL
4040 if (DECL_WEAK (decl
))
4041 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4044 if (output_bytecode
)
4045 BC_GLOBALIZE_LABEL (asm_out_file
, name
);
4047 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4050 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4051 TREE_ASM_WRITTEN (decl
) = 1;
4053 warning ("alias definitions not supported in this configuration");