1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This file handles generation of all the assembler code
22 *except* the instructions of a function.
23 This includes declarations of variables and their initial values.
25 We also output the assembler code for constants stored in memory
26 and are responsible for combining constants with the same value. */
30 /* #include <stab.h> */
36 #include "hard-reg-set.h"
43 #ifdef XCOFF_DEBUGGING_INFO
48 #define ASM_STABS_OP ".stabs"
51 /* File in which assembler code is being written. */
53 extern FILE *asm_out_file
;
55 /* The (assembler) name of the first globally-visible object output. */
56 char *first_global_object_name
;
58 extern struct obstack
*current_obstack
;
59 extern struct obstack
*saveable_obstack
;
60 extern struct obstack permanent_obstack
;
61 #define obstack_chunk_alloc xmalloc
63 /* Number for making the label on the next
64 constant that is stored in memory. */
68 /* Number for making the label on the next
69 static variable internal to a function. */
73 /* Nonzero if at least one function definition has been seen. */
74 static int function_defined
;
76 extern FILE *asm_out_file
;
78 static char *compare_constant_1 ();
79 static void record_constant_1 ();
80 void output_constant_pool ();
81 void assemble_name ();
82 int output_addressed_constants ();
83 void output_constant ();
84 void output_constructor ();
86 void readonly_data_section ();
90 static enum in_section
{no_section
, in_text
, in_data
, EXTRA_SECTIONS
} in_section
93 static enum in_section
{no_section
, in_text
, in_data
} in_section
97 /* Define functions like text_section for any extra sections. */
98 #ifdef EXTRA_SECTION_FUNCTIONS
99 EXTRA_SECTION_FUNCTIONS
102 /* Tell assembler to switch to text section. */
107 if (in_section
!= in_text
)
109 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
110 in_section
= in_text
;
114 /* Tell assembler to switch to data section. */
119 if (in_section
!= in_data
)
121 if (flag_shared_data
)
123 #ifdef SHARED_SECTION_ASM_OP
124 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
126 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
130 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
132 in_section
= in_data
;
136 /* Tell assembler to switch to read-only data section. This is normally
140 readonly_data_section ()
142 #ifdef READONLY_DATA_SECTION
143 READONLY_DATA_SECTION (); /* Note this can call data_section. */
149 /* Determine if we're in the text section. */
154 return in_section
== in_text
;
157 /* Create the rtl to represent a function, for a function definition.
158 DECL is a FUNCTION_DECL node which describes which function.
159 The rtl is stored into DECL. */
162 make_function_rtl (decl
)
165 char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
167 /* Rename a nested function to avoid conflicts. */
168 if (decl_function_context (decl
) != 0
169 && DECL_INITIAL (decl
) != 0
170 && DECL_RTL (decl
) == 0)
174 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
175 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
176 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
180 if (DECL_RTL (decl
) == 0)
183 = gen_rtx (MEM
, DECL_MODE (decl
),
184 gen_rtx (SYMBOL_REF
, Pmode
, name
));
186 /* Optionally set flags or add text to the name to record information
187 such as that it is a function name. If the name is changed, the macro
188 ASM_OUTPUT_LABELREF will have to know how to strip this information.
189 And if it finds a * at the beginning after doing so, it must handle
191 #ifdef ENCODE_SECTION_INFO
192 ENCODE_SECTION_INFO (decl
);
196 /* Record at least one function has been defined. */
197 function_defined
= 1;
200 /* Given NAME, a putative register name, discard any customary prefixes. */
203 strip_reg_name (name
)
206 #ifdef REGISTER_PREFIX
207 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
208 name
+= strlen (REGISTER_PREFIX
);
210 if (name
[0] == '%' || name
[0] == '#')
215 /* Decode an `asm' spec for a declaration as a register name.
216 Return the register number, or -1 if nothing specified,
217 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
218 or -3 if ASMSPEC is `cc' and is not recognized,
219 or -4 if ASMSPEC is `memory' and is not recognized.
220 Accept an exact spelling or a decimal number.
221 Prefixes such as % are optional. */
224 decode_reg_name (asmspec
)
231 /* Get rid of confusing prefixes. */
232 asmspec
= strip_reg_name (asmspec
);
234 /* Allow a decimal number as a "register name". */
235 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
236 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
238 if (asmspec
[0] != 0 && i
< 0)
241 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
247 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
249 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
252 #ifdef ADDITIONAL_REGISTER_NAMES
254 static struct { char *name
; int number
; } table
[]
255 = ADDITIONAL_REGISTER_NAMES
;
257 for (i
= 0; i
< sizeof (table
) / sizeof (table
[0]); i
++)
258 if (! strcmp (asmspec
, table
[i
].name
))
259 return table
[i
].number
;
261 #endif /* ADDITIONAL_REGISTER_NAMES */
263 if (!strcmp (asmspec
, "memory"))
266 if (!strcmp (asmspec
, "cc"))
275 /* Create the DECL_RTL for a declaration for a static or external variable
276 or static or external function.
277 ASMSPEC, if not 0, is the string which the user specified
278 as the assembler symbol name.
279 TOP_LEVEL is nonzero if this is a file-scope variable.
281 This is never called for PARM_DECL nodes. */
284 make_decl_rtl (decl
, asmspec
, top_level
)
290 int reg_number
= decode_reg_name (asmspec
);
292 if (DECL_ASSEMBLER_NAME (decl
) != NULL_TREE
)
293 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
295 if (reg_number
== -2)
297 /* ASMSPEC is given, and not the name of a register. */
298 name
= (char *) obstack_alloc (saveable_obstack
,
299 strlen (asmspec
) + 2);
301 strcpy (&name
[1], asmspec
);
304 /* For a duplicate declaration, we can be called twice on the
305 same DECL node. Don't alter the RTL already made
306 unless the old mode is wrong (which can happen when
307 the previous rtl was made when the type was incomplete). */
308 if (DECL_RTL (decl
) == 0
309 || GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
313 /* First detect errors in declaring global registers. */
314 if (DECL_REGISTER (decl
) && reg_number
== -1)
315 error_with_decl (decl
,
316 "register name not specified for `%s'");
317 else if (DECL_REGISTER (decl
) && reg_number
< 0)
318 error_with_decl (decl
,
319 "invalid register name for `%s'");
320 else if ((reg_number
>= 0 || reg_number
== -3) && ! DECL_REGISTER (decl
))
321 error_with_decl (decl
,
322 "register name given for non-register variable `%s'");
323 else if (DECL_REGISTER (decl
) && TREE_CODE (decl
) == FUNCTION_DECL
)
324 error ("function declared `register'");
325 else if (DECL_REGISTER (decl
) && TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
326 error_with_decl (decl
, "data type of `%s' isn't suitable for a register");
327 /* Now handle properly declared static register variables. */
328 else if (DECL_REGISTER (decl
))
331 #if 0 /* yylex should print the warning for this */
333 pedwarn ("ANSI C forbids global register variables");
335 if (DECL_INITIAL (decl
) != 0 && top_level
)
337 DECL_INITIAL (decl
) = 0;
338 error ("global register variable has initial value");
340 if (fixed_regs
[reg_number
] == 0
341 && function_defined
&& top_level
)
342 error ("global register variable follows a function definition");
343 if (TREE_THIS_VOLATILE (decl
))
344 warning ("volatile register variables don't work as you might wish");
345 DECL_RTL (decl
) = gen_rtx (REG
, DECL_MODE (decl
), reg_number
);
346 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
350 /* Make this register fixed, so not usable for anything else. */
351 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
353 global_regs
[reg_number
+ --nregs
] = 1;
358 /* Now handle ordinary static variables and functions (in memory).
359 Also handle vars declared register invalidly. */
360 if (DECL_RTL (decl
) == 0)
362 /* Can't use just the variable's own name for a variable
363 whose scope is less than the whole file.
364 Concatenate a distinguishing number. */
365 if (!top_level
&& !DECL_EXTERNAL (decl
) && asmspec
== 0)
369 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
370 name
= obstack_copy0 (saveable_obstack
, label
, strlen (label
));
374 DECL_RTL (decl
) = gen_rtx (MEM
, DECL_MODE (decl
),
375 gen_rtx (SYMBOL_REF
, Pmode
, name
));
376 if (TREE_THIS_VOLATILE (decl
))
377 MEM_VOLATILE_P (DECL_RTL (decl
)) = 1;
378 if (TREE_READONLY (decl
))
379 RTX_UNCHANGING_P (DECL_RTL (decl
)) = 1;
380 MEM_IN_STRUCT_P (DECL_RTL (decl
))
381 = (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
382 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
383 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
);
385 /* Optionally set flags or add text to the name to record information
386 such as that it is a function name.
387 If the name is changed, the macro ASM_OUTPUT_LABELREF
388 will have to know how to strip this information.
389 And if it finds a * at the beginning after doing so,
390 it must handle that too. */
391 #ifdef ENCODE_SECTION_INFO
392 ENCODE_SECTION_INFO (decl
);
398 /* Make the rtl for variable VAR be volatile.
399 Use this only for static variables. */
401 make_var_volatile (var
)
404 if (GET_CODE (DECL_RTL (var
)) != MEM
)
407 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
410 /* Output a string of literal assembler code
411 for an `asm' keyword used between functions. */
414 assemble_asm (string
)
419 if (TREE_CODE (string
) == ADDR_EXPR
)
420 string
= TREE_OPERAND (string
, 0);
422 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
425 #if 0 /* This should no longer be needed, because
426 flag_gnu_linker should be 0 on these systems,
427 which should prevent any output
428 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
429 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
430 #ifndef ASM_OUTPUT_CONSTRUCTOR
431 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
433 #ifndef ASM_OUTPUT_DESTRUCTOR
434 #define ASM_OUTPUT_DESTRUCTOR(file, name)
439 /* Record an element in the table of global destructors.
440 How this is done depends on what sort of assembler and linker
443 NAME should be the name of a global function to be called
444 at exit time. This name is output using assemble_name. */
447 assemble_destructor (name
)
450 #ifdef ASM_OUTPUT_DESTRUCTOR
451 ASM_OUTPUT_DESTRUCTOR (asm_out_file
, name
);
455 /* Now tell GNU LD that this is part of the static destructor set. */
456 /* This code works for any machine provided you use GNU as/ld. */
457 fprintf (asm_out_file
, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
458 assemble_name (asm_out_file
, name
);
459 fputc ('\n', asm_out_file
);
464 /* Likewise for global constructors. */
467 assemble_constructor (name
)
470 #ifdef ASM_OUTPUT_CONSTRUCTOR
471 ASM_OUTPUT_CONSTRUCTOR (asm_out_file
, name
);
475 /* Now tell GNU LD that this is part of the static constructor set. */
476 /* This code works for any machine provided you use GNU as/ld. */
477 fprintf (asm_out_file
, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
478 assemble_name (asm_out_file
, name
);
479 fputc ('\n', asm_out_file
);
484 /* Likewise for entries we want to record for garbage collection.
485 Garbage collection is still under development. */
488 assemble_gc_entry (name
)
491 #ifdef ASM_OUTPUT_GC_ENTRY
492 ASM_OUTPUT_GC_ENTRY (asm_out_file
, name
);
496 /* Now tell GNU LD that this is part of the static constructor set. */
497 fprintf (asm_out_file
, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP
);
498 assemble_name (asm_out_file
, name
);
499 fputc ('\n', asm_out_file
);
504 /* Output assembler code for the constant pool of a function and associated
505 with defining the name of the function. DECL describes the function.
506 NAME is the function's name. For the constant pool, we use the current
507 constant pool data. */
510 assemble_start_function (decl
, fnname
)
516 /* The following code does not need preprocessing in the assembler. */
520 output_constant_pool (fnname
, decl
);
525 /* Tell assembler to move to target machine's alignment for functions. */
526 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
528 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
530 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
531 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
534 #ifdef SDB_DEBUGGING_INFO
535 /* Output SDB definition of the function. */
536 if (write_symbols
== SDB_DEBUG
)
537 sdbout_mark_begin_function ();
540 #ifdef DBX_DEBUGGING_INFO
541 /* Output DBX definition of the function. */
542 if (write_symbols
== DBX_DEBUG
)
543 dbxout_begin_function (decl
);
546 /* Make function name accessible from other files, if appropriate. */
548 if (TREE_PUBLIC (decl
))
550 if (!first_global_object_name
)
551 first_global_object_name
= fnname
+ (fnname
[0] == '*');
552 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
555 /* Do any machine/system dependent processing of the function name */
556 #ifdef ASM_DECLARE_FUNCTION_NAME
557 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
559 /* Standard thing is just output label for the function. */
560 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
561 #endif /* ASM_DECLARE_FUNCTION_NAME */
564 /* Output assembler code associated with defining the size of the
565 function. DECL describes the function. NAME is the function's name. */
568 assemble_end_function (decl
, fnname
)
572 #ifdef ASM_DECLARE_FUNCTION_SIZE
573 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
577 /* Assemble code to leave SIZE bytes of zeros. */
580 assemble_zeros (size
)
583 #ifdef ASM_NO_SKIP_IN_TEXT
584 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
585 so we must output 0s explicitly in the text section. */
586 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
590 for (i
= 0; i
< size
- 20; i
+= 20)
593 fprintf (asm_out_file
,
594 "%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
);
596 fprintf (asm_out_file
,
597 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
603 fprintf (asm_out_file
, "%s 0", ASM_BYTE_OP
);
605 fprintf (asm_out_file
, "\tbyte 0");
608 for (; i
< size
; i
++)
609 fprintf (asm_out_file
, ",0");
610 fprintf (asm_out_file
, "\n");
615 ASM_OUTPUT_SKIP (asm_out_file
, size
);
618 /* Assemble a string constant with the specified C string as contents. */
621 assemble_string (p
, size
)
629 /* If the string is very long, split it up. */
633 int thissize
= size
- pos
;
634 if (thissize
> maximum
)
637 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
644 /* Assemble everything that is needed for a variable or function declaration.
645 Not used for automatic variables, and not used for function definitions.
646 Should not be called for variables of incomplete structure type.
648 TOP_LEVEL is nonzero if this variable has file scope.
649 AT_END is nonzero if this is the special handling, at end of compilation,
650 to define things that have had only tentative definitions. */
653 assemble_variable (decl
, top_level
, at_end
)
663 if (GET_CODE (DECL_RTL (decl
)) == REG
)
665 /* Do output symbol info for global register variables, but do nothing
668 if (TREE_ASM_WRITTEN (decl
))
670 TREE_ASM_WRITTEN (decl
) = 1;
672 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
673 /* File-scope global variables are output here. */
674 if ((write_symbols
== DBX_DEBUG
|| write_symbols
== XCOFF_DEBUG
)
676 dbxout_symbol (decl
, 0);
678 #ifdef SDB_DEBUGGING_INFO
679 if (write_symbols
== SDB_DEBUG
&& top_level
680 /* Leave initialized global vars for end of compilation;
681 see comment in compile_file. */
682 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
683 sdbout_symbol (decl
, 0);
686 /* Don't output any DWARF debugging information for variables here.
687 In the case of local variables, the information for them is output
688 when we do our recursive traversal of the tree representation for
689 the entire containing function. In the case of file-scope variables,
690 we output information for all of them at the very end of compilation
691 while we are doing our final traversal of the chain of file-scope
697 /* Normally no need to say anything for external references,
698 since assembler considers all undefined symbols external. */
700 if (DECL_EXTERNAL (decl
))
703 /* Output no assembler code for a function declaration.
704 Only definitions of functions output anything. */
706 if (TREE_CODE (decl
) == FUNCTION_DECL
)
709 /* If type was incomplete when the variable was declared,
710 see if it is complete now. */
712 if (DECL_SIZE (decl
) == 0)
713 layout_decl (decl
, 0);
715 /* Still incomplete => don't allocate it; treat the tentative defn
716 (which is what it must have been) as an `extern' reference. */
718 if (DECL_SIZE (decl
) == 0)
720 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
721 DECL_SOURCE_LINE (decl
),
722 "storage size of `%s' isn't known",
723 IDENTIFIER_POINTER (DECL_NAME (decl
)));
727 /* The first declaration of a variable that comes through this function
728 decides whether it is global (in C, has external linkage)
729 or local (in C, has internal linkage). So do nothing more
730 if this function has already run. */
732 if (TREE_ASM_WRITTEN (decl
))
735 TREE_ASM_WRITTEN (decl
) = 1;
737 #ifdef DBX_DEBUGGING_INFO
738 /* File-scope global variables are output here. */
739 if (write_symbols
== DBX_DEBUG
&& top_level
)
740 dbxout_symbol (decl
, 0);
742 #ifdef SDB_DEBUGGING_INFO
743 if (write_symbols
== SDB_DEBUG
&& top_level
744 /* Leave initialized global vars for end of compilation;
745 see comment in compile_file. */
746 && (TREE_PUBLIC (decl
) == 0 || DECL_INITIAL (decl
) == 0))
747 sdbout_symbol (decl
, 0);
750 /* Don't output any DWARF debugging information for variables here.
751 In the case of local variables, the information for them is output
752 when we do our recursive traversal of the tree representation for
753 the entire containing function. In the case of file-scope variables,
754 we output information for all of them at the very end of compilation
755 while we are doing our final traversal of the chain of file-scope
758 /* If storage size is erroneously variable, just continue.
759 Error message was already made. */
761 if (TREE_CODE (DECL_SIZE (decl
)) != INTEGER_CST
)
766 /* This is better than explicit arithmetic, since it avoids overflow. */
767 size_tree
= size_binop (CEIL_DIV_EXPR
,
768 DECL_SIZE (decl
), size_int (BITS_PER_UNIT
));
770 if (TREE_INT_CST_HIGH (size_tree
) != 0)
772 error_with_decl (decl
, "size of variable `%s' is too large");
776 name
= XSTR (XEXP (DECL_RTL (decl
), 0), 0);
778 /* Handle uninitialized definitions. */
780 /* ANSI specifies that a tentative definition which is not merged with
781 a non-tentative definition behaves exactly like a definition with an
782 initializer equal to zero. (Section 3.7.2)
783 -fno-common gives strict ANSI behavior. Usually you don't want it. */
785 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
787 int size
= TREE_INT_CST_LOW (size_tree
);
790 if (TREE_INT_CST_HIGH (size_tree
) != 0)
791 error_with_decl (decl
, "size of variable `%s' is too large");
792 /* Don't allocate zero bytes of common,
793 since that means "undefined external" in the linker. */
794 if (size
== 0) rounded
= 1;
795 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
796 so that each uninitialized object starts on such a boundary. */
797 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
798 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
799 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
801 if (flag_shared_data
)
804 if (TREE_PUBLIC (decl
))
806 #ifdef ASM_OUTPUT_SHARED_COMMON
807 if (flag_shared_data
)
808 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
811 #ifdef ASM_OUTPUT_ALIGNED_COMMON
812 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file
, name
, size
,
815 ASM_OUTPUT_COMMON (asm_out_file
, name
, size
, rounded
);
820 #ifdef ASM_OUTPUT_SHARED_LOCAL
821 if (flag_shared_data
)
822 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
825 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
826 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
,
829 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
835 /* Handle initialized definitions. */
837 /* First make the assembler name(s) global if appropriate. */
838 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
840 if (!first_global_object_name
)
841 first_global_object_name
= name
+ (name
[0] == '*');
842 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
845 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
847 tree e
= TREE_VALUE (d
);
848 if (TREE_PUBLIC (e
) && DECL_NAME (e
))
849 ASM_GLOBALIZE_LABEL (asm_out_file
,
850 XSTR (XEXP (DECL_RTL (e
), 0), 0));
854 /* Output any data that we will need to use the address of. */
855 if (DECL_INITIAL (decl
))
856 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
858 /* Switch to the proper section for this data. */
859 #ifdef SELECT_SECTION
860 SELECT_SECTION (decl
, reloc
);
862 if (TREE_READONLY (decl
)
863 && ! TREE_THIS_VOLATILE (decl
)
864 && ! (flag_pic
&& reloc
))
865 readonly_data_section ();
870 /* Compute and output the alignment of this data. */
872 align
= DECL_ALIGN (decl
);
873 /* Some object file formats have a maximum alignment which they support.
874 In particular, a.out format supports a maximum alignment of 4. */
875 #ifndef MAX_OFILE_ALIGNMENT
876 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
878 if (align
> MAX_OFILE_ALIGNMENT
)
880 warning_with_decl (decl
,
881 "alignment of `%s' is greater than maximum object file alignment");
882 align
= MAX_OFILE_ALIGNMENT
;
884 #ifdef DATA_ALIGNMENT
885 /* On some machines, it is good to increase alignment sometimes. */
886 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
888 #ifdef CONSTANT_ALIGNMENT
889 if (DECL_INITIAL (decl
))
890 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
893 /* Reset the alignment in case we have made it tighter, so we can benefit
894 from it in get_pointer_alignment. */
895 DECL_ALIGN (decl
) = align
;
897 if (align
> BITS_PER_UNIT
)
898 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
900 /* Do any machine/system dependent processing of the object. */
901 #ifdef ASM_DECLARE_OBJECT_NAME
902 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
904 /* Standard thing is just output label for the object. */
905 ASM_OUTPUT_LABEL (asm_out_file
, name
);
906 #endif /* ASM_DECLARE_OBJECT_NAME */
909 for (d
= equivalents
; d
; d
= TREE_CHAIN (d
))
911 tree e
= TREE_VALUE (d
);
912 ASM_OUTPUT_LABEL (asm_out_file
, XSTR (XEXP (DECL_RTL (e
), 0), 0));
916 if (DECL_INITIAL (decl
))
917 /* Output the actual data. */
918 output_constant (DECL_INITIAL (decl
),
919 int_size_in_bytes (TREE_TYPE (decl
)));
921 /* Leave space for it. */
922 assemble_zeros (int_size_in_bytes (TREE_TYPE (decl
)));
925 #ifdef XCOFF_DEBUGGING_INFO
926 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
927 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
928 and `aa' hasn't been output yet, the assembler generates a stab entry with
929 a value of zero, in addition to creating an unnecessary external entry
930 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
932 /* File-scope global variables are output here. */
933 if (write_symbols
== XCOFF_DEBUG
&& top_level
)
934 dbxout_symbol (decl
, 0);
936 /* There must be a statement after a label. */
941 /* Output something to declare an external symbol to the assembler.
942 (Most assemblers don't need this, so we normally output nothing.)
943 Do nothing if DECL is not external. */
946 assemble_external (decl
)
949 #ifdef ASM_OUTPUT_EXTERNAL
950 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd'
951 && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
953 rtx rtl
= DECL_RTL (decl
);
955 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
956 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
958 /* Some systems do require some output. */
959 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
960 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
966 /* Similar, for calling a library function FUN. */
969 assemble_external_libcall (fun
)
972 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
973 /* Declare library function name external when first used, if nec. */
974 if (! SYMBOL_REF_USED (fun
))
976 SYMBOL_REF_USED (fun
) = 1;
977 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
982 /* Declare the label NAME global. */
985 assemble_global (name
)
988 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
991 /* Assemble a label named NAME. */
994 assemble_label (name
)
997 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1000 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1001 If NAME starts with a *, the rest of NAME is output verbatim.
1002 Otherwise NAME is transformed in an implementation-defined way
1003 (usually by the addition of an underscore).
1004 Many macros in the tm file are defined to call this function. */
1007 assemble_name (file
, name
)
1012 fputs (&name
[1], file
);
1014 ASM_OUTPUT_LABELREF (file
, name
);
1017 /* Allocate SIZE bytes writable static space with a gensym name
1018 and return an RTX to refer to its address. */
1021 assemble_static_space (size
)
1027 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1028 so that each uninitialized object starts on such a boundary. */
1029 int rounded
= ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1030 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1031 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1034 if (flag_shared_data
)
1038 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1041 namestring
= (char *) obstack_alloc (saveable_obstack
,
1043 strcpy (namestring
, name
);
1045 x
= gen_rtx (SYMBOL_REF
, Pmode
, namestring
);
1046 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1047 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1049 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1054 /* Assemble the static constant template for function entry trampolines.
1055 This is done at most once per compilation.
1056 Returns an RTX for the address of the template. */
1059 assemble_trampoline_template ()
1065 /* Write the assembler code to define one. */
1066 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1068 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1070 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1071 TRAMPOLINE_TEMPLATE (asm_out_file
);
1073 /* Record the rtl to refer to it. */
1074 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1076 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1077 return gen_rtx (SYMBOL_REF
, Pmode
, name
);
1080 /* Assemble the integer constant X into an object of SIZE bytes.
1081 X must be either a CONST_INT or CONST_DOUBLE.
1083 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1084 non-zero, abort if we can't output the constant. */
1087 assemble_integer (x
, size
, force
)
1092 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1093 ASM_OUTPUT... macros. */
1097 #ifdef ASM_OUTPUT_CHAR
1099 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1103 #ifdef ASM_OUTPUT_SHORT
1105 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1109 #ifdef ASM_OUTPUT_INT
1111 ASM_OUTPUT_INT (asm_out_file
, x
);
1115 #ifdef ASM_OUTPUT_DOUBLE_INT
1117 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1121 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1123 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1128 /* If we couldn't do it that way, there are two other possibilities: First,
1129 if the machine can output an explicit byte and this is a 1 byte constant,
1130 we can use ASM_OUTPUT_BYTE. */
1132 #ifdef ASM_OUTPUT_BYTE
1133 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1135 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1140 /* Finally, if SIZE is larger than a single word, try to output the constant
1141 one word at a time. */
1143 if (size
> UNITS_PER_WORD
)
1146 enum machine_mode mode
1147 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1150 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1152 word
= operand_subword (x
, i
, 0, mode
);
1157 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1161 if (i
== size
/ UNITS_PER_WORD
)
1163 /* If we output at least one word and then could not finish,
1164 there is no valid way to continue. */
1175 /* Assemble the floating-point constant D into an object of size MODE. */
1178 assemble_real (d
, mode
)
1180 enum machine_mode mode
;
1182 jmp_buf output_constant_handler
;
1184 if (setjmp (output_constant_handler
))
1186 error ("floating point trap outputting a constant");
1187 #ifdef REAL_IS_NOT_DOUBLE
1188 bzero (&d
, sizeof d
);
1195 set_float_handler (output_constant_handler
);
1199 #ifdef ASM_OUTPUT_FLOAT
1201 ASM_OUTPUT_FLOAT (asm_out_file
, d
);
1205 #ifdef ASM_OUTPUT_DOUBLE
1207 ASM_OUTPUT_DOUBLE (asm_out_file
, d
);
1211 #ifdef ASM_OUTPUT_LONG_DOUBLE
1213 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, d
);
1221 set_float_handler (NULL_PTR
);
1224 /* Here we combine duplicate floating constants to make
1225 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1227 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1228 They are chained through the CONST_DOUBLE_CHAIN.
1229 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1230 In that case, CONST_DOUBLE_MEM is either a MEM,
1231 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
1233 static rtx const_double_chain
;
1235 /* Return a CONST_DOUBLE for a value specified as a pair of ints.
1236 For an integer, I0 is the low-order word and I1 is the high-order word.
1237 For a real number, I0 is the word with the low address
1238 and I1 is the word with the high address. */
1241 immed_double_const (i0
, i1
, mode
)
1242 HOST_WIDE_INT i0
, i1
;
1243 enum machine_mode mode
;
1246 int in_current_obstack
;
1248 if (GET_MODE_CLASS (mode
) == MODE_INT
)
1250 /* We clear out all bits that don't belong in MODE, unless they and our
1251 sign bit are all one. So we get either a reasonable negative value
1252 or a reasonable unsigned value for this mode. */
1253 int width
= GET_MODE_BITSIZE (mode
);
1254 if (width
< HOST_BITS_PER_WIDE_INT
1255 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1256 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1257 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1258 else if (width
== HOST_BITS_PER_WIDE_INT
1259 && ! (i1
== ~0 && i0
< 0))
1261 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1262 /* We cannot represent this value as a constant. */
1265 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1267 ??? Strictly speaking, this is wrong if we create a CONST_INT
1268 for a large unsigned constant with the size of MODE being
1269 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1270 wider mode. In that case we will mis-interpret it as a negative
1273 Unfortunately, the only alternative is to make a CONST_DOUBLE
1274 for any constant in any mode if it is an unsigned constant larger
1275 than the maximum signed integer in an int on the host. However,
1276 doing this will break everyone that always expects to see a CONST_INT
1277 for SImode and smaller.
1279 We have always been making CONST_INTs in this case, so nothing new
1282 if (width
<= HOST_BITS_PER_WIDE_INT
)
1283 i1
= (i0
< 0) ? ~0 : 0;
1285 /* If this integer fits in one word, return a CONST_INT. */
1286 if ((i1
== 0 && i0
>= 0)
1287 || (i1
== ~0 && i0
< 0))
1288 return GEN_INT (i0
);
1290 /* We use VOIDmode for integers. */
1294 /* Search the chain for an existing CONST_DOUBLE with the right value.
1295 If one is found, return it. */
1297 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1298 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1299 && GET_MODE (r
) == mode
)
1302 /* No; make a new one and add it to the chain.
1304 We may be called by an optimizer which may be discarding any memory
1305 allocated during its processing (such as combine and loop). However,
1306 we will be leaving this constant on the chain, so we cannot tolerate
1307 freed memory. So switch to saveable_obstack for this allocation
1308 and then switch back if we were in current_obstack. */
1310 in_current_obstack
= rtl_in_saveable_obstack ();
1311 r
= gen_rtx (CONST_DOUBLE
, mode
, 0, i0
, i1
);
1312 if (in_current_obstack
)
1313 rtl_in_current_obstack ();
1315 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1316 const_double_chain
= r
;
1318 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
1319 Actual use of mem-slot is only through force_const_mem. */
1321 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1326 /* Return a CONST_DOUBLE for a specified `double' value
1327 and machine mode. */
1330 immed_real_const_1 (d
, mode
)
1332 enum machine_mode mode
;
1334 union real_extract u
;
1336 int in_current_obstack
;
1338 /* Get the desired `double' value as a sequence of ints
1339 since that is how they are stored in a CONST_DOUBLE. */
1343 /* Detect special cases. */
1345 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
1346 if (!bcmp (&dconst0
, &d
, sizeof d
))
1347 return CONST0_RTX (mode
);
1348 else if (REAL_VALUES_EQUAL (dconst1
, d
))
1349 return CONST1_RTX (mode
);
1351 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
1352 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
1354 /* The rest of this function handles the case where
1355 a float value requires more than 2 ints of space.
1356 It will be deleted as dead code on machines that don't need it. */
1358 /* Search the chain for an existing CONST_DOUBLE with the right value.
1359 If one is found, return it. */
1361 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1362 if (! bcmp (&CONST_DOUBLE_LOW (r
), &u
, sizeof u
)
1363 && GET_MODE (r
) == mode
)
1366 /* No; make a new one and add it to the chain.
1368 We may be called by an optimizer which may be discarding any memory
1369 allocated during its processing (such as combine and loop). However,
1370 we will be leaving this constant on the chain, so we cannot tolerate
1371 freed memory. So switch to saveable_obstack for this allocation
1372 and then switch back if we were in current_obstack. */
1374 in_current_obstack
= rtl_in_saveable_obstack ();
1375 r
= rtx_alloc (CONST_DOUBLE
);
1377 bcopy (&u
, &CONST_DOUBLE_LOW (r
), sizeof u
);
1378 if (in_current_obstack
)
1379 rtl_in_current_obstack ();
1381 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1382 const_double_chain
= r
;
1384 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1385 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1386 is only through force_const_mem. */
1388 CONST_DOUBLE_MEM (r
) = const0_rtx
;
1393 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1394 which must be a REAL_CST tree node. */
1397 immed_real_const (exp
)
1400 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
1403 /* At the end of a function, forget the memory-constants
1404 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
1405 Also clear out real_constant_chain and clear out all the chain-pointers. */
1408 clear_const_double_mem ()
1410 register rtx r
, next
;
1412 for (r
= const_double_chain
; r
; r
= next
)
1414 next
= CONST_DOUBLE_CHAIN (r
);
1415 CONST_DOUBLE_CHAIN (r
) = 0;
1416 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
1418 const_double_chain
= 0;
1421 /* Given an expression EXP with a constant value,
1422 reduce it to the sum of an assembler symbol and an integer.
1423 Store them both in the structure *VALUE.
1424 Abort if EXP does not reduce. */
1429 HOST_WIDE_INT offset
;
1433 decode_addr_const (exp
, value
)
1435 struct addr_const
*value
;
1437 register tree target
= TREE_OPERAND (exp
, 0);
1438 register int offset
= 0;
1443 if (TREE_CODE (target
) == COMPONENT_REF
1444 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1)))
1447 offset
+= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target
, 1))) / BITS_PER_UNIT
;
1448 target
= TREE_OPERAND (target
, 0);
1450 else if (TREE_CODE (target
) == ARRAY_REF
)
1452 if (TREE_CODE (TREE_OPERAND (target
, 1)) != INTEGER_CST
1453 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target
))) != INTEGER_CST
)
1455 offset
+= ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target
)))
1456 * TREE_INT_CST_LOW (TREE_OPERAND (target
, 1)))
1458 target
= TREE_OPERAND (target
, 0);
1464 switch (TREE_CODE (target
))
1468 x
= DECL_RTL (target
);
1472 x
= gen_rtx (MEM
, FUNCTION_MODE
,
1473 gen_rtx (LABEL_REF
, VOIDmode
,
1474 label_rtx (TREE_OPERAND (exp
, 0))));
1481 x
= TREE_CST_RTL (target
);
1488 if (GET_CODE (x
) != MEM
)
1493 value
->offset
= offset
;
1496 /* Uniquize all constants that appear in memory.
1497 Each constant in memory thus far output is recorded
1498 in `const_hash_table' with a `struct constant_descriptor'
1499 that contains a polish representation of the value of
1502 We cannot store the trees in the hash table
1503 because the trees may be temporary. */
1505 struct constant_descriptor
1507 struct constant_descriptor
*next
;
1513 #define MAX_HASH_TABLE 1009
1514 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
1516 /* Compute a hash code for a constant expression. */
1523 register int len
, hi
, i
;
1524 register enum tree_code code
= TREE_CODE (exp
);
1526 if (code
== INTEGER_CST
)
1528 p
= (char *) &TREE_INT_CST_LOW (exp
);
1529 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
1531 else if (code
== REAL_CST
)
1533 p
= (char *) &TREE_REAL_CST (exp
);
1534 len
= sizeof TREE_REAL_CST (exp
);
1536 else if (code
== STRING_CST
)
1537 p
= TREE_STRING_POINTER (exp
), len
= TREE_STRING_LENGTH (exp
);
1538 else if (code
== COMPLEX_CST
)
1539 return const_hash (TREE_REALPART (exp
)) * 5
1540 + const_hash (TREE_IMAGPART (exp
));
1541 else if (code
== CONSTRUCTOR
)
1545 /* For record type, include the type in the hashing.
1546 We do not do so for array types
1547 because (1) the sizes of the elements are sufficient
1548 and (2) distinct array types can have the same constructor.
1549 Instead, we include the array size because the constructor could
1551 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
1552 hi
= ((HOST_WIDE_INT
) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
1555 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
1556 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
1558 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
1559 if (TREE_VALUE (link
))
1560 hi
= (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
1564 else if (code
== ADDR_EXPR
)
1566 struct addr_const value
;
1567 decode_addr_const (exp
, &value
);
1568 if (GET_CODE (value
.base
) == SYMBOL_REF
)
1570 /* Don't hash the address of the SYMBOL_REF;
1571 only use the offset and the symbol name. */
1573 p
= XSTR (value
.base
, 0);
1574 for (i
= 0; p
[i
] != 0; i
++)
1575 hi
= ((hi
* 613) + (unsigned)(p
[i
]));
1577 else if (GET_CODE (value
.base
) == LABEL_REF
)
1578 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
1580 hi
&= (1 << HASHBITS
) - 1;
1581 hi
%= MAX_HASH_TABLE
;
1584 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
1585 return const_hash (TREE_OPERAND (exp
, 0)) * 9
1586 + const_hash (TREE_OPERAND (exp
, 1));
1587 else if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
)
1588 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
1590 /* Compute hashing function */
1592 for (i
= 0; i
< len
; i
++)
1593 hi
= ((hi
* 613) + (unsigned)(p
[i
]));
1595 hi
&= (1 << HASHBITS
) - 1;
1596 hi
%= MAX_HASH_TABLE
;
1600 /* Compare a constant expression EXP with a constant-descriptor DESC.
1601 Return 1 if DESC describes a constant with the same value as EXP. */
1604 compare_constant (exp
, desc
)
1606 struct constant_descriptor
*desc
;
1608 return 0 != compare_constant_1 (exp
, desc
->contents
);
1611 /* Compare constant expression EXP with a substring P of a constant descriptor.
1612 If they match, return a pointer to the end of the substring matched.
1613 If they do not match, return 0.
1615 Since descriptors are written in polish prefix notation,
1616 this function can be used recursively to test one operand of EXP
1617 against a subdescriptor, and if it succeeds it returns the
1618 address of the subdescriptor for the next operand. */
1621 compare_constant_1 (exp
, p
)
1625 register char *strp
;
1627 register enum tree_code code
= TREE_CODE (exp
);
1629 if (code
!= (enum tree_code
) *p
++)
1632 if (code
== INTEGER_CST
)
1634 /* Integer constants are the same only if the same width of type. */
1635 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
1637 strp
= (char *) &TREE_INT_CST_LOW (exp
);
1638 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
1640 else if (code
== REAL_CST
)
1642 /* Real constants are the same only if the same width of type. */
1643 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
1645 strp
= (char *) &TREE_REAL_CST (exp
);
1646 len
= sizeof TREE_REAL_CST (exp
);
1648 else if (code
== STRING_CST
)
1650 if (flag_writable_strings
)
1652 strp
= TREE_STRING_POINTER (exp
);
1653 len
= TREE_STRING_LENGTH (exp
);
1654 if (bcmp (&TREE_STRING_LENGTH (exp
), p
,
1655 sizeof TREE_STRING_LENGTH (exp
)))
1657 p
+= sizeof TREE_STRING_LENGTH (exp
);
1659 else if (code
== COMPLEX_CST
)
1661 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
1662 if (p
== 0) return 0;
1663 p
= compare_constant_1 (TREE_IMAGPART (exp
), p
);
1666 else if (code
== CONSTRUCTOR
)
1669 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
1672 if (bcmp (&length
, p
, sizeof length
))
1676 /* For record constructors, insist that the types match.
1677 For arrays, just verify both constructors are for arrays. */
1678 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
1679 type
= TREE_TYPE (exp
);
1682 if (bcmp (&type
, p
, sizeof type
))
1686 /* For arrays, insist that the size in bytes match. */
1687 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
1689 int size
= int_size_in_bytes (TREE_TYPE (exp
));
1690 if (bcmp (&size
, p
, sizeof size
))
1695 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
1697 if (TREE_VALUE (link
))
1699 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
1706 if (bcmp (&zero
, p
, sizeof zero
))
1714 else if (code
== ADDR_EXPR
)
1716 struct addr_const value
;
1717 decode_addr_const (exp
, &value
);
1718 strp
= (char *) &value
.offset
;
1719 len
= sizeof value
.offset
;
1720 /* Compare the offset. */
1722 if (*p
++ != *strp
++)
1724 /* Compare symbol name. */
1725 strp
= XSTR (value
.base
, 0);
1726 len
= strlen (strp
) + 1;
1728 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
1730 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
1731 if (p
== 0) return 0;
1732 p
= compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
1735 else if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
)
1737 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
1741 /* Compare constant contents. */
1743 if (*p
++ != *strp
++)
1749 /* Construct a constant descriptor for the expression EXP.
1750 It is up to the caller to enter the descriptor in the hash table. */
1752 static struct constant_descriptor
*
1753 record_constant (exp
)
1756 struct constant_descriptor
*ptr
= 0;
1759 obstack_grow (&permanent_obstack
, &ptr
, sizeof ptr
);
1760 obstack_grow (&permanent_obstack
, &buf
, sizeof buf
);
1761 record_constant_1 (exp
);
1762 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
1765 /* Add a description of constant expression EXP
1766 to the object growing in `permanent_obstack'.
1767 No need to return its address; the caller will get that
1768 from the obstack when the object is complete. */
1771 record_constant_1 (exp
)
1774 register char *strp
;
1776 register enum tree_code code
= TREE_CODE (exp
);
1778 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
1780 if (code
== INTEGER_CST
)
1782 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
1783 strp
= (char *) &TREE_INT_CST_LOW (exp
);
1784 len
= 2 * sizeof TREE_INT_CST_LOW (exp
);
1786 else if (code
== REAL_CST
)
1788 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
1789 strp
= (char *) &TREE_REAL_CST (exp
);
1790 len
= sizeof TREE_REAL_CST (exp
);
1792 else if (code
== STRING_CST
)
1794 if (flag_writable_strings
)
1796 strp
= TREE_STRING_POINTER (exp
);
1797 len
= TREE_STRING_LENGTH (exp
);
1798 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
1799 sizeof TREE_STRING_LENGTH (exp
));
1801 else if (code
== COMPLEX_CST
)
1803 record_constant_1 (TREE_REALPART (exp
));
1804 record_constant_1 (TREE_IMAGPART (exp
));
1807 else if (code
== CONSTRUCTOR
)
1810 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
1813 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
1815 /* For record constructors, insist that the types match.
1816 For arrays, just verify both constructors are for arrays. */
1817 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
1818 type
= TREE_TYPE (exp
);
1821 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
1823 /* For arrays, insist that the size in bytes match. */
1824 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
1826 int size
= int_size_in_bytes (TREE_TYPE (exp
));
1827 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
1830 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
1832 if (TREE_VALUE (link
))
1833 record_constant_1 (TREE_VALUE (link
));
1838 obstack_grow (&permanent_obstack
, (char *) &zero
, sizeof zero
);
1844 else if (code
== ADDR_EXPR
)
1846 struct addr_const value
;
1847 decode_addr_const (exp
, &value
);
1848 /* Record the offset. */
1849 obstack_grow (&permanent_obstack
,
1850 (char *) &value
.offset
, sizeof value
.offset
);
1851 /* Record the symbol name. */
1852 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
1853 strlen (XSTR (value
.base
, 0)) + 1);
1856 else if (code
== PLUS_EXPR
|| code
== MINUS_EXPR
)
1858 record_constant_1 (TREE_OPERAND (exp
, 0));
1859 record_constant_1 (TREE_OPERAND (exp
, 1));
1862 else if (code
== NOP_EXPR
|| code
== CONVERT_EXPR
)
1864 record_constant_1 (TREE_OPERAND (exp
, 0));
1868 /* Record constant contents. */
1869 obstack_grow (&permanent_obstack
, strp
, len
);
1872 /* Return an rtx representing a reference to constant data in memory
1873 for the constant expression EXP.
1874 If assembler code for such a constant has already been output,
1875 return an rtx to refer to it.
1876 Otherwise, output such a constant in memory and generate
1877 an rtx for it. The TREE_CST_RTL of EXP is set up to point to that rtx.
1878 The const_hash_table records which constants already have label strings. */
1881 output_constant_def (exp
)
1884 register int hash
, align
;
1885 register struct constant_descriptor
*desc
;
1891 if (TREE_CODE (exp
) == INTEGER_CST
)
1892 abort (); /* No TREE_CST_RTL slot in these. */
1894 if (TREE_CST_RTL (exp
))
1895 return TREE_CST_RTL (exp
);
1897 /* Make sure any other constants whose addresses appear in EXP
1898 are assigned label numbers. */
1900 reloc
= output_addressed_constants (exp
);
1902 /* Compute hash code of EXP. Search the descriptors for that hash code
1903 to see if any of them describes EXP. If yes, the descriptor records
1904 the label number already assigned. */
1906 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
1908 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
1909 if (compare_constant (exp
, desc
))
1911 found
= desc
->label
;
1917 /* No constant equal to EXP is known to have been output.
1918 Make a constant descriptor to enter EXP in the hash table.
1919 Assign the label number and record it in the descriptor for
1920 future calls to this function to find. */
1922 /* Create a string containing the label name, in LABEL. */
1923 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
1925 desc
= record_constant (exp
);
1926 desc
->next
= const_hash_table
[hash
];
1928 = (char *) obstack_copy0 (&permanent_obstack
, label
, strlen (label
));
1929 const_hash_table
[hash
] = desc
;
1932 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
1934 push_obstacks_nochange ();
1935 if (TREE_PERMANENT (exp
))
1936 end_temporary_allocation ();
1938 def
= gen_rtx (SYMBOL_REF
, Pmode
, desc
->label
);
1941 = gen_rtx (MEM
, TYPE_MODE (TREE_TYPE (exp
)), def
);
1942 RTX_UNCHANGING_P (TREE_CST_RTL (exp
)) = 1;
1943 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
1944 || TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
1945 MEM_IN_STRUCT_P (TREE_CST_RTL (exp
)) = 1;
1949 /* Optionally set flags or add text to the name to record information
1950 such as that it is a function name. If the name is changed, the macro
1951 ASM_OUTPUT_LABELREF will have to know how to strip this information.
1952 And if it finds a * at the beginning after doing so, it must handle
1954 #ifdef ENCODE_SECTION_INFO
1955 ENCODE_SECTION_INFO (exp
);
1960 /* Now output assembler code to define that label
1961 and follow it with the data of EXP. */
1963 /* First switch to text section, except for writable strings. */
1964 #ifdef SELECT_SECTION
1965 SELECT_SECTION (exp
, reloc
);
1967 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
1968 || (flag_pic
&& reloc
))
1971 readonly_data_section ();
1974 /* Align the location counter as required by EXP's data type. */
1975 align
= TYPE_ALIGN (TREE_TYPE (exp
));
1976 #ifdef CONSTANT_ALIGNMENT
1977 align
= CONSTANT_ALIGNMENT (exp
, align
);
1980 if (align
> BITS_PER_UNIT
)
1981 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1983 /* Output the label itself. */
1984 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", const_labelno
);
1986 /* Output the value of EXP. */
1987 output_constant (exp
,
1988 (TREE_CODE (exp
) == STRING_CST
1989 ? TREE_STRING_LENGTH (exp
)
1990 : int_size_in_bytes (TREE_TYPE (exp
))));
1995 return TREE_CST_RTL (exp
);
1998 /* Similar hash facility for making memory-constants
1999 from constant rtl-expressions. It is used on RISC machines
2000 where immediate integer arguments and constant addresses are restricted
2001 so that such constants must be stored in memory.
2003 This pool of constants is reinitialized for each function
2004 so each function gets its own constants-pool that comes right before it.
2006 All structures allocated here are discarded when functions are saved for
2007 inlining, so they do not need to be allocated permanently. */
2009 #define MAX_RTX_HASH_TABLE 61
2010 static struct constant_descriptor
*const_rtx_hash_table
[MAX_RTX_HASH_TABLE
];
2012 /* Structure to represent sufficient information about a constant so that
2013 it can be output when the constant pool is output, so that function
2014 integration can be done, and to simplify handling on machines that reference
2015 constant pool as base+displacement. */
2017 struct pool_constant
2019 struct constant_descriptor
*desc
;
2020 struct pool_constant
*next
;
2021 enum machine_mode mode
;
2028 /* Pointers to first and last constant in pool. */
2030 static struct pool_constant
*first_pool
, *last_pool
;
2032 /* Current offset in constant pool (does not include any machine-specific
2035 static int pool_offset
;
2037 /* Structure used to maintain hash table mapping symbols used to their
2038 corresponding constants. */
2043 struct pool_constant
*pool
;
2044 struct pool_sym
*next
;
2047 static struct pool_sym
*const_rtx_sym_hash_table
[MAX_RTX_HASH_TABLE
];
2049 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2050 The argument is XSTR (... , 0) */
2052 #define SYMHASH(LABEL) \
2053 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2055 /* Initialize constant pool hashing for next function. */
2058 init_const_rtx_hash_table ()
2060 bzero (const_rtx_hash_table
, sizeof const_rtx_hash_table
);
2061 bzero (const_rtx_sym_hash_table
, sizeof const_rtx_sym_hash_table
);
2063 first_pool
= last_pool
= 0;
2067 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2071 #ifdef ONLY_INT_FIELDS
2072 unsigned int kind
: 16;
2073 unsigned int mode
: 16;
2075 enum kind kind
: 16;
2076 enum machine_mode mode
: 16;
2079 union real_extract du
;
2080 struct addr_const addr
;
2084 /* Express an rtx for a constant integer (perhaps symbolic)
2085 as the sum of a symbol or label plus an explicit integer.
2086 They are stored into VALUE. */
2089 decode_rtx_const (mode
, x
, value
)
2090 enum machine_mode mode
;
2092 struct rtx_const
*value
;
2094 /* Clear the whole structure, including any gaps. */
2097 int *p
= (int *) value
;
2098 int *end
= (int *) (value
+ 1);
2103 value
->kind
= RTX_INT
; /* Most usual kind. */
2106 switch (GET_CODE (x
))
2109 value
->kind
= RTX_DOUBLE
;
2110 value
->mode
= GET_MODE (x
);
2111 bcopy (&CONST_DOUBLE_LOW (x
), &value
->un
.du
, sizeof value
->un
.du
);
2115 value
->un
.addr
.offset
= INTVAL (x
);
2120 value
->un
.addr
.base
= x
;
2125 if (GET_CODE (x
) == PLUS
)
2127 value
->un
.addr
.base
= XEXP (x
, 0);
2128 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2130 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
2132 else if (GET_CODE (x
) == MINUS
)
2134 value
->un
.addr
.base
= XEXP (x
, 0);
2135 if (GET_CODE (XEXP (x
, 1)) != CONST_INT
)
2137 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
2147 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
2148 switch (GET_CODE (value
->un
.addr
.base
))
2152 /* Use the string's address, not the SYMBOL_REF's address,
2153 for the sake of addresses of library routines.
2154 For a LABEL_REF, compare labels. */
2155 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
2159 /* Compute a hash code for a constant RTL expression. */
2162 const_hash_rtx (mode
, x
)
2163 enum machine_mode mode
;
2168 struct rtx_const value
;
2169 decode_rtx_const (mode
, x
, &value
);
2171 /* Compute hashing function */
2173 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
2174 hi
+= ((int *) &value
)[i
];
2176 hi
&= (1 << HASHBITS
) - 1;
2177 hi
%= MAX_RTX_HASH_TABLE
;
2181 /* Compare a constant rtl object X with a constant-descriptor DESC.
2182 Return 1 if DESC describes a constant with the same value as X. */
2185 compare_constant_rtx (mode
, x
, desc
)
2186 enum machine_mode mode
;
2188 struct constant_descriptor
*desc
;
2190 register int *p
= (int *) desc
->contents
;
2193 struct rtx_const value
;
2195 decode_rtx_const (mode
, x
, &value
);
2196 strp
= (int *) &value
;
2197 len
= sizeof value
/ sizeof (int);
2199 /* Compare constant contents. */
2201 if (*p
++ != *strp
++)
2207 /* Construct a constant descriptor for the rtl-expression X.
2208 It is up to the caller to enter the descriptor in the hash table. */
2210 static struct constant_descriptor
*
2211 record_constant_rtx (mode
, x
)
2212 enum machine_mode mode
;
2215 struct constant_descriptor
*ptr
;
2217 struct rtx_const value
;
2219 decode_rtx_const (mode
, x
, &value
);
2221 obstack_grow (current_obstack
, &ptr
, sizeof ptr
);
2222 obstack_grow (current_obstack
, &label
, sizeof label
);
2224 /* Record constant contents. */
2225 obstack_grow (current_obstack
, &value
, sizeof value
);
2227 return (struct constant_descriptor
*) obstack_finish (current_obstack
);
2230 /* Given a constant rtx X, make (or find) a memory constant for its value
2231 and return a MEM rtx to refer to it in memory. */
2234 force_const_mem (mode
, x
)
2235 enum machine_mode mode
;
2239 register struct constant_descriptor
*desc
;
2244 /* If we want this CONST_DOUBLE in the same mode as it is in memory
2245 (this will always be true for floating CONST_DOUBLEs that have been
2246 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
2247 use the previous copy. Otherwise, make a new one. Note that in
2248 the unlikely event that this same CONST_DOUBLE is used in two different
2249 modes in an alternating fashion, we will allocate a lot of different
2250 memory locations, but this should be extremely rare. */
2252 if (GET_CODE (x
) == CONST_DOUBLE
2253 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
2254 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
2255 return CONST_DOUBLE_MEM (x
);
2257 /* Compute hash code of X. Search the descriptors for that hash code
2258 to see if any of them describes X. If yes, the descriptor records
2259 the label number already assigned. */
2261 hash
= const_hash_rtx (mode
, x
);
2263 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
2264 if (compare_constant_rtx (mode
, x
, desc
))
2266 found
= desc
->label
;
2272 register struct pool_constant
*pool
;
2273 register struct pool_sym
*sym
;
2276 /* No constant equal to X is known to have been output.
2277 Make a constant descriptor to enter X in the hash table.
2278 Assign the label number and record it in the descriptor for
2279 future calls to this function to find. */
2281 desc
= record_constant_rtx (mode
, x
);
2282 desc
->next
= const_rtx_hash_table
[hash
];
2283 const_rtx_hash_table
[hash
] = desc
;
2285 /* Align the location counter as required by EXP's data type. */
2286 align
= (mode
== VOIDmode
) ? UNITS_PER_WORD
: GET_MODE_SIZE (mode
);
2287 if (align
> BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
2288 align
= BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
;
2290 pool_offset
+= align
- 1;
2291 pool_offset
&= ~ (align
- 1);
2293 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
2295 pool
= (struct pool_constant
*) oballoc (sizeof (struct pool_constant
));
2299 pool
->labelno
= const_labelno
;
2300 pool
->align
= align
;
2301 pool
->offset
= pool_offset
;
2307 last_pool
->next
= pool
;
2310 pool_offset
+= GET_MODE_SIZE (mode
);
2312 /* Create a string containing the label name, in LABEL. */
2313 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
2318 = (char *) obstack_copy0 (saveable_obstack
, label
, strlen (label
));
2320 /* Add label to symbol hash table. */
2321 hash
= SYMHASH (found
);
2322 sym
= (struct pool_sym
*) oballoc (sizeof (struct pool_sym
));
2325 sym
->next
= const_rtx_sym_hash_table
[hash
];
2326 const_rtx_sym_hash_table
[hash
] = sym
;
2329 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2331 def
= gen_rtx (MEM
, mode
, gen_rtx (SYMBOL_REF
, Pmode
, found
));
2333 RTX_UNCHANGING_P (def
) = 1;
2334 /* Mark the symbol_ref as belonging to this constants pool. */
2335 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
2336 current_function_uses_const_pool
= 1;
2338 if (GET_CODE (x
) == CONST_DOUBLE
)
2340 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
2342 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
2343 const_double_chain
= x
;
2345 CONST_DOUBLE_MEM (x
) = def
;
2351 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
2352 the corresponding pool_constant structure. */
2354 static struct pool_constant
*
2355 find_pool_constant (addr
)
2358 struct pool_sym
*sym
;
2359 char *label
= XSTR (addr
, 0);
2361 for (sym
= const_rtx_sym_hash_table
[SYMHASH (label
)]; sym
; sym
= sym
->next
)
2362 if (sym
->label
== label
)
2368 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
2371 get_pool_constant (addr
)
2374 return (find_pool_constant (addr
))->constant
;
2377 /* Similar, return the mode. */
2380 get_pool_mode (addr
)
2383 return (find_pool_constant (addr
))->mode
;
2386 /* Similar, return the offset in the constant pool. */
2389 get_pool_offset (addr
)
2392 return (find_pool_constant (addr
))->offset
;
2395 /* Return the size of the constant pool. */
2403 /* Write all the constants in the constant pool. */
2406 output_constant_pool (fnname
, fndecl
)
2410 struct pool_constant
*pool
;
2412 union real_extract u
;
2414 #ifdef ASM_OUTPUT_POOL_PROLOGUE
2415 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
2418 for (pool
= first_pool
; pool
; pool
= pool
->next
)
2422 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
2423 whose CODE_LABEL has been deleted. This can occur if a jump table
2424 is eliminated by optimization. If so, write a constant of zero
2426 if ((GET_CODE (x
) == LABEL_REF
&& INSN_DELETED_P (XEXP (x
, 0)))
2427 || (GET_CODE (x
) == CONST
&& GET_CODE (XEXP (x
, 0)) == PLUS
2428 && GET_CODE (XEXP (XEXP (x
, 0), 0)) == LABEL_REF
2429 && INSN_DELETED_P (XEXP (XEXP (XEXP (x
, 0), 0), 0))))
2432 /* First switch to correct section. */
2433 #ifdef SELECT_RTX_SECTION
2434 SELECT_RTX_SECTION (pool
->mode
, x
);
2436 readonly_data_section ();
2439 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
2440 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
2441 pool
->align
, pool
->labelno
, done
);
2444 if (pool
->align
> 1)
2445 ASM_OUTPUT_ALIGN (asm_out_file
, exact_log2 (pool
->align
));
2447 /* Output the label. */
2448 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
2450 /* Output the value of the constant itself. */
2451 switch (GET_MODE_CLASS (pool
->mode
))
2454 if (GET_CODE (x
) != CONST_DOUBLE
)
2457 bcopy (&CONST_DOUBLE_LOW (x
), &u
, sizeof u
);
2458 assemble_real (u
.d
, pool
->mode
);
2462 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
2472 /* Done with this pool. */
2473 first_pool
= last_pool
= 0;
2476 /* Find all the constants whose addresses are referenced inside of EXP,
2477 and make sure assembler code with a label has been output for each one.
2478 Indicate whether an ADDR_EXPR has been encountered. */
2481 output_addressed_constants (exp
)
2486 switch (TREE_CODE (exp
))
2490 register tree constant
= TREE_OPERAND (exp
, 0);
2492 while (TREE_CODE (constant
) == COMPONENT_REF
)
2494 constant
= TREE_OPERAND (constant
, 0);
2497 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
2498 || TREE_CODE (constant
) == CONSTRUCTOR
)
2499 /* No need to do anything here
2500 for addresses of variables or functions. */
2501 output_constant_def (constant
);
2508 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
2509 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
2514 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
2520 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2521 if (TREE_VALUE (link
) != 0)
2522 reloc
|= output_addressed_constants (TREE_VALUE (link
));
2532 /* Output assembler code for constant EXP to FILE, with no label.
2533 This includes the pseudo-op such as ".int" or ".byte", and a newline.
2534 Assumes output_addressed_constants has been done on EXP already.
2536 Generate exactly SIZE bytes of assembler data, padding at the end
2537 with zeros if necessary. SIZE must always be specified.
2539 SIZE is important for structure constructors,
2540 since trailing members may have been omitted from the constructor.
2541 It is also important for initialization of arrays from string constants
2542 since the full length of the string constant might not be wanted.
2543 It is also needed for initialization of unions, where the initializer's
2544 type is just one member, and that may not be as long as the union.
2546 There a case in which we would fail to output exactly SIZE bytes:
2547 for a structure constructor that wants to produce more than SIZE bytes.
2548 But such constructors will never be generated for any possible input. */
2551 output_constant (exp
, size
)
2555 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
2561 /* Allow a constructor with no elements for any data type.
2562 This means to fill the space with zeros. */
2563 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
2565 assemble_zeros (size
);
2569 /* Eliminate the NOP_EXPR that makes a cast not be an lvalue.
2570 That way we get the constant (we hope) inside it. */
2571 if (TREE_CODE (exp
) == NOP_EXPR
2572 && TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0)))
2573 exp
= TREE_OPERAND (exp
, 0);
2580 case REFERENCE_TYPE
:
2581 /* ??? What about (int)((float)(int)&foo + 4) */
2582 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
2583 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2584 exp
= TREE_OPERAND (exp
, 0);
2586 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
2587 EXPAND_INITIALIZER
),
2589 error ("initializer for integer value is too complicated");
2594 if (TREE_CODE (exp
) != REAL_CST
)
2595 error ("initializer for floating value is not a floating constant");
2597 assemble_real (TREE_REAL_CST (exp
),
2598 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
2603 output_constant (TREE_REALPART (exp
), size
/ 2);
2604 output_constant (TREE_IMAGPART (exp
), size
/ 2);
2605 size
-= (size
/ 2) * 2;
2609 if (TREE_CODE (exp
) == CONSTRUCTOR
)
2611 output_constructor (exp
, size
);
2614 else if (TREE_CODE (exp
) == STRING_CST
)
2618 if (size
> TREE_STRING_LENGTH (exp
))
2620 excess
= size
- TREE_STRING_LENGTH (exp
);
2621 size
= TREE_STRING_LENGTH (exp
);
2624 assemble_string (TREE_STRING_POINTER (exp
), size
);
2633 if (TREE_CODE (exp
) == CONSTRUCTOR
)
2634 output_constructor (exp
, size
);
2641 assemble_zeros (size
);
2644 /* Subroutine of output_constant, used for CONSTRUCTORs
2645 (aggregate constants).
2646 Generate at least SIZE bytes, padding if necessary. */
2649 output_constructor (exp
, size
)
2653 register tree link
, field
= 0;
2654 /* Number of bytes output or skipped so far.
2655 In other words, current position within the constructor. */
2656 int total_bytes
= 0;
2657 /* Non-zero means BYTE contains part of a byte, to be output. */
2658 int byte_buffer_in_use
= 0;
2661 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
2664 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2665 field
= TYPE_FIELDS (TREE_TYPE (exp
));
2667 /* As LINK goes through the elements of the constant,
2668 FIELD goes through the structure fields, if the constant is a structure.
2669 if the constant is a union, then we override this,
2670 by getting the field from the TREE_LIST element.
2671 But the constant could also be an array. Then FIELD is zero. */
2672 for (link
= CONSTRUCTOR_ELTS (exp
);
2674 link
= TREE_CHAIN (link
),
2675 field
= field
? TREE_CHAIN (field
) : 0)
2677 tree val
= TREE_VALUE (link
);
2678 /* the element in a union constructor specifies the proper field. */
2679 if (TREE_PURPOSE (link
) != 0)
2680 field
= TREE_PURPOSE (link
);
2682 /* Eliminate the marker that makes a cast not be an lvalue. */
2686 if (field
== 0 || !DECL_BIT_FIELD (field
))
2688 register int fieldsize
;
2689 /* Since this structure is static,
2690 we know the positions are constant. */
2691 int bitpos
= (field
? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
))
2695 /* An element that is not a bit-field.
2696 Output any buffered-up bit-fields preceding it. */
2697 if (byte_buffer_in_use
)
2699 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
2701 byte_buffer_in_use
= 0;
2704 /* Advance to offset of this element.
2705 Note no alignment needed in an array, since that is guaranteed
2706 if each element has the proper size. */
2707 if (field
!= 0 && bitpos
!= total_bytes
)
2709 assemble_zeros (bitpos
- total_bytes
);
2710 total_bytes
= bitpos
;
2713 /* Determine size this element should occupy. */
2716 if (TREE_CODE (DECL_SIZE (field
)) != INTEGER_CST
)
2718 if (TREE_INT_CST_LOW (DECL_SIZE (field
)) > 100000)
2720 /* This avoids overflow trouble. */
2721 tree size_tree
= size_binop (CEIL_DIV_EXPR
,
2723 size_int (BITS_PER_UNIT
));
2724 fieldsize
= TREE_INT_CST_LOW (size_tree
);
2728 fieldsize
= TREE_INT_CST_LOW (DECL_SIZE (field
));
2729 fieldsize
= (fieldsize
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
2733 fieldsize
= int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp
)));
2735 /* Output the element's initial value. */
2737 assemble_zeros (fieldsize
);
2739 output_constant (val
, fieldsize
);
2741 /* Count its size. */
2742 total_bytes
+= fieldsize
;
2744 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
2745 error ("invalid initial value for member `%s'",
2746 IDENTIFIER_POINTER (DECL_NAME (field
)));
2749 /* Element that is a bit-field. */
2751 int next_offset
= TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
));
2753 = (next_offset
+ TREE_INT_CST_LOW (DECL_SIZE (field
)));
2756 val
= integer_zero_node
;
2758 /* If this field does not start in this (or, next) byte,
2760 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
2762 /* Output remnant of any bit field in previous bytes. */
2763 if (byte_buffer_in_use
)
2765 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
2767 byte_buffer_in_use
= 0;
2770 /* If still not at proper byte, advance to there. */
2771 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
2773 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
2774 total_bytes
= next_offset
/ BITS_PER_UNIT
;
2778 if (! byte_buffer_in_use
)
2781 /* We must split the element into pieces that fall within
2782 separate bytes, and combine each byte with previous or
2783 following bit-fields. */
2785 /* next_offset is the offset n fbits from the beginning of
2786 the structure to the next bit of this element to be processed.
2787 end_offset is the offset of the first bit past the end of
2789 while (next_offset
< end_offset
)
2793 int next_byte
= next_offset
/ BITS_PER_UNIT
;
2794 int next_bit
= next_offset
% BITS_PER_UNIT
;
2796 /* Advance from byte to byte
2797 within this element when necessary. */
2798 while (next_byte
!= total_bytes
)
2800 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
2805 /* Number of bits we can process at once
2806 (all part of the same byte). */
2807 this_time
= MIN (end_offset
- next_offset
,
2808 BITS_PER_UNIT
- next_bit
);
2809 #if BYTES_BIG_ENDIAN
2810 /* On big-endian machine, take the most significant bits
2811 first (of the bits that are significant)
2812 and put them into bytes from the most significant end. */
2813 shift
= end_offset
- next_offset
- this_time
;
2814 /* Don't try to take a bunch of bits that cross
2815 the word boundary in the INTEGER_CST. */
2816 if (shift
< HOST_BITS_PER_WIDE_INT
2817 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
2819 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
2820 shift
= HOST_BITS_PER_WIDE_INT
;
2823 /* Now get the bits from the appropriate constant word. */
2824 if (shift
< HOST_BITS_PER_WIDE_INT
)
2826 value
= TREE_INT_CST_LOW (val
);
2828 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
2830 value
= TREE_INT_CST_HIGH (val
);
2831 shift
-= HOST_BITS_PER_WIDE_INT
;
2835 byte
|= (((value
>> shift
)
2836 & (((HOST_WIDE_INT
) 1 << this_time
) - 1))
2837 << (BITS_PER_UNIT
- this_time
- next_bit
));
2839 /* On little-endian machines,
2840 take first the least significant bits of the value
2841 and pack them starting at the least significant
2842 bits of the bytes. */
2843 shift
= (next_offset
2844 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field
)));
2845 /* Don't try to take a bunch of bits that cross
2846 the word boundary in the INTEGER_CST. */
2847 if (shift
< HOST_BITS_PER_WIDE_INT
2848 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
2850 this_time
-= (HOST_BITS_PER_WIDE_INT
- shift
);
2851 shift
= HOST_BITS_PER_WIDE_INT
;
2854 /* Now get the bits from the appropriate constant word. */
2855 if (shift
< HOST_BITS_PER_INT
)
2856 value
= TREE_INT_CST_LOW (val
);
2857 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
2859 value
= TREE_INT_CST_HIGH (val
);
2860 shift
-= HOST_BITS_PER_WIDE_INT
;
2864 byte
|= ((value
>> shift
)
2865 & (((HOST_WIDE_INT
) 1 << this_time
) - 1)) << next_bit
;
2867 next_offset
+= this_time
;
2868 byte_buffer_in_use
= 1;
2872 if (byte_buffer_in_use
)
2874 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
2877 if (total_bytes
< size
)
2878 assemble_zeros (size
- total_bytes
);