1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 88, 89, 92, 93, 1994 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> */
38 #include "hard-reg-set.h"
46 #ifdef XCOFF_DEBUGGING_INFO
53 #define ASM_STABS_OP ".stabs"
56 /* This macro gets just the user-specified name
57 out of the string in a SYMBOL_REF. On most machines,
58 we discard the * if any and that's all. */
59 #ifndef STRIP_NAME_ENCODING
60 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
61 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
64 /* File in which assembler code is being written. */
66 extern FILE *asm_out_file;
68 /* The (assembler) name of the first globally-visible object output. */
69 char *first_global_object_name;
71 extern struct obstack *current_obstack;
72 extern struct obstack *saveable_obstack;
73 extern struct obstack *rtl_obstack;
74 extern struct obstack permanent_obstack;
75 #define obstack_chunk_alloc xmalloc
77 /* Number for making the label on the next
78 constant that is stored in memory. */
82 /* Number for making the label on the next
83 static variable internal to a function. */
87 /* Carry information from ASM_DECLARE_OBJECT_NAME
88 to ASM_FINISH_DECLARE_OBJECT. */
90 int size_directive_output;
92 /* The last decl for which assemble_variable was called,
93 if it did ASM_DECLARE_OBJECT_NAME.
94 If the last call to assemble_variable didn't do that,
97 tree last_assemble_variable_decl;
99 /* Nonzero if at least one function definition has been seen. */
100 static int function_defined;
103 struct constant_descriptor;
105 struct pool_constant;
107 static void bc_make_decl_rtl PROTO((tree, char *, int));
108 static char *strip_reg_name PROTO((char *));
109 static void bc_output_ascii PROTO((FILE *, char *, int));
110 static int contains_pointers_p PROTO((tree));
111 static void decode_addr_const PROTO((tree, struct addr_const *));
112 static int const_hash PROTO((tree));
113 static int compare_constant PROTO((tree,
114 struct constant_descriptor *));
115 static char *compare_constant_1 PROTO((tree, char *));
116 static struct constant_descriptor *record_constant PROTO((tree));
117 static void record_constant_1 PROTO((tree));
118 static tree copy_constant PROTO((tree));
119 static void output_constant_def_contents PROTO((tree, int, int));
120 static void decode_rtx_const PROTO((enum machine_mode, rtx,
121 struct rtx_const *));
122 static int const_hash_rtx PROTO((enum machine_mode, rtx));
123 static int compare_constant_rtx PROTO((enum machine_mode, rtx,
124 struct constant_descriptor *));
125 static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode,
127 static struct pool_constant *find_pool_constant PROTO((rtx));
128 static int output_addressed_constants PROTO((tree));
129 static void bc_assemble_integer PROTO((tree, int));
130 static void output_constructor PROTO((tree, int));
132 #ifdef EXTRA_SECTIONS
133 static enum in_section {no_section, in_text, in_data, in_named, EXTRA_SECTIONS} in_section
136 static enum in_section {no_section, in_text, in_data, in_named} in_section
140 /* Return a non-zero value if DECL has a section attribute. */
141 #define IN_NAMED_SECTION(DECL) \
142 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
143 && DECL_SECTION_NAME (DECL) != NULL_TREE)
145 /* Text of section name when in_section == in_named. */
146 static char *in_named_name;
148 /* Define functions like text_section for any extra sections. */
149 #ifdef EXTRA_SECTION_FUNCTIONS
150 EXTRA_SECTION_FUNCTIONS
153 /* Tell assembler to switch to text section. */
158 if (in_section != in_text)
163 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
165 in_section = in_text;
169 /* Tell assembler to switch to data section. */
174 if (in_section != in_data)
180 if (flag_shared_data)
182 #ifdef SHARED_SECTION_ASM_OP
183 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
185 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
189 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
192 in_section = in_data;
196 /* Tell assembler to switch to read-only data section. This is normally
200 readonly_data_section ()
202 #ifdef READONLY_DATA_SECTION
203 READONLY_DATA_SECTION (); /* Note this can call data_section. */
209 /* Determine if we're in the text section. */
214 return in_section == in_text;
217 /* Tell assembler to change to section NAME for DECL.
218 If DECL is NULL, just switch to section NAME.
219 If NAME is NULL, get the name from DECL. */
222 named_section (decl, name)
226 if (decl != NULL_TREE
227 && (TREE_CODE (decl) != FUNCTION_DECL && TREE_CODE (decl) != VAR_DECL))
230 name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
232 if (in_section != in_named || strcmp (name, in_named_name))
234 in_named_name = name;
235 in_section = in_named;
237 #ifdef ASM_OUTPUT_SECTION_NAME
238 ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name);
240 /* Section attributes are not supported if this macro isn't provided -
241 some host formats don't support them at all. The front-end should
242 already have flagged this as an error. */
248 /* Switch to the section for function DECL.
250 If DECL is NULL_TREE, switch to the text section.
251 ??? It's not clear that we will ever be passed NULL_TREE, but it's
252 safer to handle it. */
255 function_section (decl)
258 if (decl != NULL_TREE
259 && DECL_SECTION_NAME (decl) != NULL_TREE)
260 named_section (decl, (char *) 0);
265 /* Create the rtl to represent a function, for a function definition.
266 DECL is a FUNCTION_DECL node which describes which function.
267 The rtl is stored into DECL. */
270 make_function_rtl (decl)
273 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
277 if (DECL_RTL (decl) == 0)
278 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
280 /* Record that at least one function has been defined. */
281 function_defined = 1;
285 /* Rename a nested function to avoid conflicts. */
286 if (decl_function_context (decl) != 0
287 && DECL_INITIAL (decl) != 0
288 && DECL_RTL (decl) == 0)
292 name = IDENTIFIER_POINTER (DECL_NAME (decl));
293 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
294 name = obstack_copy0 (saveable_obstack, label, strlen (label));
298 if (DECL_RTL (decl) == 0)
301 = gen_rtx (MEM, DECL_MODE (decl),
302 gen_rtx (SYMBOL_REF, Pmode, name));
304 /* Optionally set flags or add text to the name to record information
305 such as that it is a function name. If the name is changed, the macro
306 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
307 #ifdef ENCODE_SECTION_INFO
308 ENCODE_SECTION_INFO (decl);
312 /* Record at least one function has been defined. */
313 function_defined = 1;
316 /* Create the DECL_RTL for a declaration for a static or external
317 variable or static or external function.
318 ASMSPEC, if not 0, is the string which the user specified
319 as the assembler symbol name.
320 TOP_LEVEL is nonzero if this is a file-scope variable.
321 This is never called for PARM_DECLs. */
324 bc_make_decl_rtl (decl, asmspec, top_level)
329 register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl));
331 if (DECL_RTL (decl) == 0)
333 /* Print an error message for register variables. */
334 if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL)
335 error ("function declared `register'");
336 else if (DECL_REGISTER (decl))
337 error ("global register variables not supported in the interpreter");
339 /* Handle ordinary static variables and functions. */
340 if (DECL_RTL (decl) == 0)
342 /* Can't use just the variable's own name for a variable
343 whose scope is less than the whole file.
344 Concatenate a distinguishing number. */
345 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
349 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
350 name = obstack_copy0 (saveable_obstack, label, strlen (label));
354 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
359 /* Given NAME, a putative register name, discard any customary prefixes. */
362 strip_reg_name (name)
365 #ifdef REGISTER_PREFIX
366 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
367 name += strlen (REGISTER_PREFIX);
369 if (name[0] == '%' || name[0] == '#')
374 /* Decode an `asm' spec for a declaration as a register name.
375 Return the register number, or -1 if nothing specified,
376 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
377 or -3 if ASMSPEC is `cc' and is not recognized,
378 or -4 if ASMSPEC is `memory' and is not recognized.
379 Accept an exact spelling or a decimal number.
380 Prefixes such as % are optional. */
383 decode_reg_name (asmspec)
390 /* Get rid of confusing prefixes. */
391 asmspec = strip_reg_name (asmspec);
393 /* Allow a decimal number as a "register name". */
394 for (i = strlen (asmspec) - 1; i >= 0; i--)
395 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
397 if (asmspec[0] != 0 && i < 0)
400 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
406 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
408 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
411 #ifdef ADDITIONAL_REGISTER_NAMES
413 static struct { char *name; int number; } table[]
414 = ADDITIONAL_REGISTER_NAMES;
416 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
417 if (! strcmp (asmspec, table[i].name))
418 return table[i].number;
420 #endif /* ADDITIONAL_REGISTER_NAMES */
422 if (!strcmp (asmspec, "memory"))
425 if (!strcmp (asmspec, "cc"))
434 /* Create the DECL_RTL for a declaration for a static or external variable
435 or static or external function.
436 ASMSPEC, if not 0, is the string which the user specified
437 as the assembler symbol name.
438 TOP_LEVEL is nonzero if this is a file-scope variable.
440 This is never called for PARM_DECL nodes. */
443 make_decl_rtl (decl, asmspec, top_level)
448 register char *name = 0;
453 bc_make_decl_rtl (decl, asmspec, top_level);
457 reg_number = decode_reg_name (asmspec);
459 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
460 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
462 if (reg_number == -2)
464 /* ASMSPEC is given, and not the name of a register. */
465 name = (char *) obstack_alloc (saveable_obstack,
466 strlen (asmspec) + 2);
468 strcpy (&name[1], asmspec);
471 /* For a duplicate declaration, we can be called twice on the
472 same DECL node. Don't discard the RTL already made. */
473 if (DECL_RTL (decl) == 0)
477 /* First detect errors in declaring global registers. */
478 if (DECL_REGISTER (decl) && reg_number == -1)
479 error_with_decl (decl,
480 "register name not specified for `%s'");
481 else if (DECL_REGISTER (decl) && reg_number < 0)
482 error_with_decl (decl,
483 "invalid register name for `%s'");
484 else if ((reg_number >= 0 || reg_number == -3) && ! DECL_REGISTER (decl))
485 error_with_decl (decl,
486 "register name given for non-register variable `%s'");
487 else if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL)
488 error ("function declared `register'");
489 else if (DECL_REGISTER (decl) && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
490 error_with_decl (decl, "data type of `%s' isn't suitable for a register");
491 else if (DECL_REGISTER (decl)
492 && ! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
493 error_with_decl (decl, "register number for `%s' isn't suitable for the data type");
494 /* Now handle properly declared static register variables. */
495 else if (DECL_REGISTER (decl))
498 #if 0 /* yylex should print the warning for this */
500 pedwarn ("ANSI C forbids global register variables");
502 if (DECL_INITIAL (decl) != 0 && top_level)
504 DECL_INITIAL (decl) = 0;
505 error ("global register variable has initial value");
507 if (fixed_regs[reg_number] == 0
508 && function_defined && top_level)
509 error ("global register variable follows a function definition");
510 if (TREE_THIS_VOLATILE (decl))
511 warning ("volatile register variables don't work as you might wish");
513 /* If the user specified one of the eliminables registers here,
514 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
515 confused with that register and be eliminated. Although this
516 usage is somewhat suspect, we nevertheless use the following
517 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
520 = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
521 REGNO (DECL_RTL (decl)) = reg_number;
522 REG_USERVAR_P (DECL_RTL (decl)) = 1;
526 /* Make this register global, so not usable for anything
528 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
530 globalize_reg (reg_number + --nregs);
533 /* Specifying a section attribute on an uninitialized variable does not
534 (and cannot) cause it to be put in the given section. The linker
535 can only put initialized objects in specific sections, everything
536 else goes in bss for the linker to sort out later (otherwise the
537 linker would give a duplicate definition error for each compilation
538 unit that behaved thusly). So warn the user. */
539 else if (TREE_CODE (decl) == VAR_DECL
540 && DECL_SECTION_NAME (decl) != NULL_TREE
541 && DECL_INITIAL (decl) == NULL_TREE)
543 warning_with_decl (decl,
544 "section attribute ignored for uninitialized variable `%s'");
545 /* Remove the section name so subsequent declarations won't see it.
546 We are ignoring it, remember. */
547 DECL_SECTION_NAME (decl) = NULL_TREE;
550 /* Now handle ordinary static variables and functions (in memory).
551 Also handle vars declared register invalidly. */
552 if (DECL_RTL (decl) == 0)
554 /* Can't use just the variable's own name for a variable
555 whose scope is less than the whole file.
556 Concatenate a distinguishing number. */
557 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
561 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
562 name = obstack_copy0 (saveable_obstack, label, strlen (label));
569 DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl),
570 gen_rtx (SYMBOL_REF, Pmode, name));
572 /* If this variable is to be treated as volatile, show its
573 tree node has side effects. If it has side effects, either
574 because of this test or from TREE_THIS_VOLATILE also
575 being set, show the MEM is volatile. */
576 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
577 && TREE_PUBLIC (decl))
578 TREE_SIDE_EFFECTS (decl) = 1;
579 if (TREE_SIDE_EFFECTS (decl))
580 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
582 if (TREE_READONLY (decl))
583 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
584 MEM_IN_STRUCT_P (DECL_RTL (decl))
585 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
587 /* Optionally set flags or add text to the name to record information
588 such as that it is a function name.
589 If the name is changed, the macro ASM_OUTPUT_LABELREF
590 will have to know how to strip this information. */
591 #ifdef ENCODE_SECTION_INFO
592 ENCODE_SECTION_INFO (decl);
596 /* If the old RTL had the wrong mode, fix the mode. */
597 else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
599 rtx rtl = DECL_RTL (decl);
600 PUT_MODE (rtl, DECL_MODE (decl));
604 /* Make the rtl for variable VAR be volatile.
605 Use this only for static variables. */
608 make_var_volatile (var)
611 if (GET_CODE (DECL_RTL (var)) != MEM)
614 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
617 /* Output alignment directive to align for constant expression EXP. */
620 assemble_constant_align (exp)
625 /* Align the location counter as required by EXP's data type. */
626 align = TYPE_ALIGN (TREE_TYPE (exp));
627 #ifdef CONSTANT_ALIGNMENT
628 align = CONSTANT_ALIGNMENT (exp, align);
631 if (align > BITS_PER_UNIT)
632 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
635 /* Output a string of literal assembler code
636 for an `asm' keyword used between functions. */
639 assemble_asm (string)
644 error ("asm statements not allowed in interpreter");
650 if (TREE_CODE (string) == ADDR_EXPR)
651 string = TREE_OPERAND (string, 0);
653 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
656 #if 0 /* This should no longer be needed, because
657 flag_gnu_linker should be 0 on these systems,
658 which should prevent any output
659 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
660 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
661 #ifndef ASM_OUTPUT_CONSTRUCTOR
662 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
664 #ifndef ASM_OUTPUT_DESTRUCTOR
665 #define ASM_OUTPUT_DESTRUCTOR(file, name)
670 /* Record an element in the table of global destructors.
671 How this is done depends on what sort of assembler and linker
674 NAME should be the name of a global function to be called
675 at exit time. This name is output using assemble_name. */
678 assemble_destructor (name)
681 #ifdef ASM_OUTPUT_DESTRUCTOR
682 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
686 /* Now tell GNU LD that this is part of the static destructor set. */
687 /* This code works for any machine provided you use GNU as/ld. */
688 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
689 assemble_name (asm_out_file, name);
690 fputc ('\n', asm_out_file);
695 /* Likewise for global constructors. */
698 assemble_constructor (name)
701 #ifdef ASM_OUTPUT_CONSTRUCTOR
702 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
706 /* Now tell GNU LD that this is part of the static constructor set. */
707 /* This code works for any machine provided you use GNU as/ld. */
708 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
709 assemble_name (asm_out_file, name);
710 fputc ('\n', asm_out_file);
715 /* Likewise for entries we want to record for garbage collection.
716 Garbage collection is still under development. */
719 assemble_gc_entry (name)
722 #ifdef ASM_OUTPUT_GC_ENTRY
723 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
727 /* Now tell GNU LD that this is part of the static constructor set. */
728 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
729 assemble_name (asm_out_file, name);
730 fputc ('\n', asm_out_file);
735 /* Output assembler code for the constant pool of a function and associated
736 with defining the name of the function. DECL describes the function.
737 NAME is the function's name. For the constant pool, we use the current
738 constant pool data. */
741 assemble_start_function (decl, fnname)
747 /* The following code does not need preprocessing in the assembler. */
751 output_constant_pool (fnname, decl);
753 function_section (decl);
755 /* Tell assembler to move to target machine's alignment for functions. */
756 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
760 BC_OUTPUT_ALIGN (asm_out_file, align);
762 ASM_OUTPUT_ALIGN (asm_out_file, align);
765 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
766 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
769 #ifdef SDB_DEBUGGING_INFO
770 /* Output SDB definition of the function. */
771 if (write_symbols == SDB_DEBUG)
772 sdbout_mark_begin_function ();
775 #ifdef DBX_DEBUGGING_INFO
776 /* Output DBX definition of the function. */
777 if (write_symbols == DBX_DEBUG)
778 dbxout_begin_function (decl);
781 /* Make function name accessible from other files, if appropriate. */
783 if (TREE_PUBLIC (decl))
785 if (!first_global_object_name)
786 STRIP_NAME_ENCODING (first_global_object_name, fnname);
788 BC_GLOBALIZE_LABEL (asm_out_file, fnname);
790 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
793 /* Do any machine/system dependent processing of the function name */
794 #ifdef ASM_DECLARE_FUNCTION_NAME
795 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
797 /* Standard thing is just output label for the function. */
799 BC_OUTPUT_LABEL (asm_out_file, fnname);
801 ASM_OUTPUT_LABEL (asm_out_file, fnname);
802 #endif /* ASM_DECLARE_FUNCTION_NAME */
805 /* Output assembler code associated with defining the size of the
806 function. DECL describes the function. NAME is the function's name. */
809 assemble_end_function (decl, fnname)
813 #ifdef ASM_DECLARE_FUNCTION_SIZE
814 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
818 /* Assemble code to leave SIZE bytes of zeros. */
821 assemble_zeros (size)
826 bc_emit_const_skip (size);
830 #ifdef ASM_NO_SKIP_IN_TEXT
831 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
832 so we must output 0s explicitly in the text section. */
833 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
837 for (i = 0; i < size - 20; i += 20)
840 fprintf (asm_out_file,
841 "%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);
843 fprintf (asm_out_file,
844 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
850 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
852 fprintf (asm_out_file, "\tbyte 0");
855 for (; i < size; i++)
856 fprintf (asm_out_file, ",0");
857 fprintf (asm_out_file, "\n");
865 BC_OUTPUT_SKIP (asm_out_file, size);
867 ASM_OUTPUT_SKIP (asm_out_file, size);
871 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
874 assemble_align (align)
877 if (align > BITS_PER_UNIT)
878 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
881 /* Assemble a string constant with the specified C string as contents. */
884 assemble_string (p, size)
898 /* If the string is very long, split it up. */
902 int thissize = size - pos;
903 if (thissize > maximum)
907 bc_output_ascii (asm_out_file, p, thissize);
910 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
919 bc_output_ascii (file, p, size)
924 BC_OUTPUT_ASCII (file, p, size);
927 /* Assemble everything that is needed for a variable or function declaration.
928 Not used for automatic variables, and not used for function definitions.
929 Should not be called for variables of incomplete structure type.
931 TOP_LEVEL is nonzero if this variable has file scope.
932 AT_END is nonzero if this is the special handling, at end of compilation,
933 to define things that have had only tentative definitions.
934 DONT_OUTPUT_DATA if nonzero means don't actually output the
935 initial value (that will be done by the caller). */
938 assemble_variable (decl, top_level, at_end, dont_output_data)
942 int dont_output_data;
948 enum in_section saved_in_section;
950 last_assemble_variable_decl = 0;
955 if (GET_CODE (DECL_RTL (decl)) == REG)
957 /* Do output symbol info for global register variables, but do nothing
960 if (TREE_ASM_WRITTEN (decl))
962 TREE_ASM_WRITTEN (decl) = 1;
964 if (!output_bytecode)
966 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
967 /* File-scope global variables are output here. */
968 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
970 dbxout_symbol (decl, 0);
972 #ifdef SDB_DEBUGGING_INFO
973 if (write_symbols == SDB_DEBUG && top_level
974 /* Leave initialized global vars for end of compilation;
975 see comment in compile_file. */
976 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
977 sdbout_symbol (decl, 0);
981 /* Don't output any DWARF debugging information for variables here.
982 In the case of local variables, the information for them is output
983 when we do our recursive traversal of the tree representation for
984 the entire containing function. In the case of file-scope variables,
985 we output information for all of them at the very end of compilation
986 while we are doing our final traversal of the chain of file-scope
992 /* Normally no need to say anything here for external references,
993 since assemble_external is called by the langauge-specific code
994 when a declaration is first seen. */
996 if (DECL_EXTERNAL (decl))
999 /* Output no assembler code for a function declaration.
1000 Only definitions of functions output anything. */
1002 if (TREE_CODE (decl) == FUNCTION_DECL)
1005 /* If type was incomplete when the variable was declared,
1006 see if it is complete now. */
1008 if (DECL_SIZE (decl) == 0)
1009 layout_decl (decl, 0);
1011 /* Still incomplete => don't allocate it; treat the tentative defn
1012 (which is what it must have been) as an `extern' reference. */
1014 if (!dont_output_data && DECL_SIZE (decl) == 0)
1016 error_with_file_and_line (DECL_SOURCE_FILE (decl),
1017 DECL_SOURCE_LINE (decl),
1018 "storage size of `%s' isn't known",
1019 IDENTIFIER_POINTER (DECL_NAME (decl)));
1020 TREE_ASM_WRITTEN (decl) = 1;
1024 /* The first declaration of a variable that comes through this function
1025 decides whether it is global (in C, has external linkage)
1026 or local (in C, has internal linkage). So do nothing more
1027 if this function has already run. */
1029 if (TREE_ASM_WRITTEN (decl))
1032 TREE_ASM_WRITTEN (decl) = 1;
1034 /* If storage size is erroneously variable, just continue.
1035 Error message was already made. */
1037 if (DECL_SIZE (decl))
1039 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1044 /* This is better than explicit arithmetic, since it avoids overflow. */
1045 size_tree = size_binop (CEIL_DIV_EXPR,
1046 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1048 if (TREE_INT_CST_HIGH (size_tree) != 0)
1050 error_with_decl (decl, "size of variable `%s' is too large");
1055 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1057 /* Handle uninitialized definitions. */
1059 /* ANSI specifies that a tentative definition which is not merged with
1060 a non-tentative definition behaves exactly like a definition with an
1061 initializer equal to zero. (Section 3.7.2)
1062 -fno-common gives strict ANSI behavior. Usually you don't want it.
1063 This matters only for variables with external linkage. */
1064 if ((! flag_no_common || ! TREE_PUBLIC (decl))
1065 && DECL_COMMON (decl)
1066 && ! dont_output_data
1067 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
1069 int size = TREE_INT_CST_LOW (size_tree);
1072 if (TREE_INT_CST_HIGH (size_tree) != 0)
1073 error_with_decl (decl, "size of variable `%s' is too large");
1074 /* Don't allocate zero bytes of common,
1075 since that means "undefined external" in the linker. */
1076 if (size == 0) rounded = 1;
1077 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1078 so that each uninitialized object starts on such a boundary. */
1079 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1080 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1081 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1083 #ifdef DBX_DEBUGGING_INFO
1084 /* File-scope global variables are output here. */
1085 if (write_symbols == DBX_DEBUG && top_level)
1086 dbxout_symbol (decl, 0);
1088 #ifdef SDB_DEBUGGING_INFO
1089 if (write_symbols == SDB_DEBUG && top_level
1090 /* Leave initialized global vars for end of compilation;
1091 see comment in compile_file. */
1092 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1093 sdbout_symbol (decl, 0);
1096 /* Don't output any DWARF debugging information for variables here.
1097 In the case of local variables, the information for them is output
1098 when we do our recursive traversal of the tree representation for
1099 the entire containing function. In the case of file-scope variables,
1100 we output information for all of them at the very end of compilation
1101 while we are doing our final traversal of the chain of file-scope
1105 if (flag_shared_data)
1108 if (TREE_PUBLIC (decl))
1110 #ifdef ASM_OUTPUT_SHARED_COMMON
1111 if (flag_shared_data)
1112 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1115 if (output_bytecode)
1117 BC_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1121 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1122 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1125 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1131 #ifdef ASM_OUTPUT_SHARED_LOCAL
1132 if (flag_shared_data)
1133 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1136 if (output_bytecode)
1138 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1142 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1143 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1146 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1153 /* Handle initialized definitions. */
1155 /* First make the assembler name(s) global if appropriate. */
1156 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1158 if (!first_global_object_name)
1159 STRIP_NAME_ENCODING(first_global_object_name, name);
1160 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1163 for (d = equivalents; d; d = TREE_CHAIN (d))
1165 tree e = TREE_VALUE (d);
1166 if (TREE_PUBLIC (e) && DECL_NAME (e))
1167 ASM_GLOBALIZE_LABEL (asm_out_file,
1168 XSTR (XEXP (DECL_RTL (e), 0), 0));
1172 /* Output any data that we will need to use the address of. */
1173 if (DECL_INITIAL (decl) == error_mark_node)
1174 reloc = contains_pointers_p (TREE_TYPE (decl));
1175 else if (DECL_INITIAL (decl))
1176 reloc = output_addressed_constants (DECL_INITIAL (decl));
1178 /* Switch to the proper section for this data. */
1179 if (IN_NAMED_SECTION (decl))
1180 named_section (decl, NULL);
1183 /* C++ can have const variables that get initialized from constructors,
1184 and thus can not be in a readonly section. We prevent this by
1185 verifying that the initial value is constant for objects put in a
1188 error_mark_node is used by the C front end to indicate that the
1189 initializer has not been seen yet. In this case, we assume that
1190 the initializer must be constant. */
1191 #ifdef SELECT_SECTION
1192 SELECT_SECTION (decl, reloc);
1194 if (TREE_READONLY (decl)
1195 && ! TREE_THIS_VOLATILE (decl)
1196 && DECL_INITIAL (decl)
1197 && (DECL_INITIAL (decl) == error_mark_node
1198 || TREE_CONSTANT (DECL_INITIAL (decl)))
1199 && ! (flag_pic && reloc))
1200 readonly_data_section ();
1206 /* dbxout.c needs to know this. */
1207 if (in_text_section ())
1208 DECL_IN_TEXT_SECTION (decl) = 1;
1210 /* Record current section so we can restore it if dbxout.c clobbers it. */
1211 saved_in_section = in_section;
1213 /* Output the dbx info now that we have chosen the section. */
1215 #ifdef DBX_DEBUGGING_INFO
1216 /* File-scope global variables are output here. */
1217 if (write_symbols == DBX_DEBUG && top_level)
1218 dbxout_symbol (decl, 0);
1220 #ifdef SDB_DEBUGGING_INFO
1221 if (write_symbols == SDB_DEBUG && top_level
1222 /* Leave initialized global vars for end of compilation;
1223 see comment in compile_file. */
1224 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1225 sdbout_symbol (decl, 0);
1228 /* Don't output any DWARF debugging information for variables here.
1229 In the case of local variables, the information for them is output
1230 when we do our recursive traversal of the tree representation for
1231 the entire containing function. In the case of file-scope variables,
1232 we output information for all of them at the very end of compilation
1233 while we are doing our final traversal of the chain of file-scope
1236 /* If the debugging output changed sections, reselect the section
1237 that's supposed to be selected. */
1238 if (in_section != saved_in_section)
1240 /* Switch to the proper section for this data. */
1241 #ifdef SELECT_SECTION
1242 SELECT_SECTION (decl, reloc);
1244 if (TREE_READONLY (decl)
1245 && ! TREE_THIS_VOLATILE (decl)
1246 && DECL_INITIAL (decl)
1247 && (DECL_INITIAL (decl) == error_mark_node
1248 || TREE_CONSTANT (DECL_INITIAL (decl)))
1249 && ! (flag_pic && reloc))
1250 readonly_data_section ();
1256 /* Compute and output the alignment of this data. */
1258 align = DECL_ALIGN (decl);
1259 /* In the case for initialing an array whose length isn't specified,
1260 where we have not yet been able to do the layout,
1261 figure out the proper alignment now. */
1262 if (dont_output_data && DECL_SIZE (decl) == 0
1263 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1264 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1266 /* Some object file formats have a maximum alignment which they support.
1267 In particular, a.out format supports a maximum alignment of 4. */
1268 #ifndef MAX_OFILE_ALIGNMENT
1269 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1271 if (align > MAX_OFILE_ALIGNMENT)
1273 warning_with_decl (decl,
1274 "alignment of `%s' is greater than maximum object file alignment");
1275 align = MAX_OFILE_ALIGNMENT;
1277 #ifdef DATA_ALIGNMENT
1278 /* On some machines, it is good to increase alignment sometimes. */
1279 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1281 #ifdef CONSTANT_ALIGNMENT
1282 if (DECL_INITIAL (decl))
1283 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1286 /* Reset the alignment in case we have made it tighter, so we can benefit
1287 from it in get_pointer_alignment. */
1288 DECL_ALIGN (decl) = align;
1290 if (align > BITS_PER_UNIT)
1292 if (output_bytecode)
1293 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1295 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1298 /* Do any machine/system dependent processing of the object. */
1299 #ifdef ASM_DECLARE_OBJECT_NAME
1300 last_assemble_variable_decl = decl;
1301 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1303 /* Standard thing is just output label for the object. */
1304 if (output_bytecode)
1305 BC_OUTPUT_LABEL (asm_out_file, name);
1307 ASM_OUTPUT_LABEL (asm_out_file, name);
1308 #endif /* ASM_DECLARE_OBJECT_NAME */
1310 if (!dont_output_data)
1312 if (DECL_INITIAL (decl))
1313 /* Output the actual data. */
1314 output_constant (DECL_INITIAL (decl),
1315 int_size_in_bytes (TREE_TYPE (decl)));
1317 /* Leave space for it. */
1318 assemble_zeros (int_size_in_bytes (TREE_TYPE (decl)));
1322 #ifdef XCOFF_DEBUGGING_INFO
1323 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1324 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1325 and `aa' hasn't been output yet, the assembler generates a stab entry with
1326 a value of zero, in addition to creating an unnecessary external entry
1327 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1329 /* File-scope global variables are output here. */
1330 if (write_symbols == XCOFF_DEBUG && top_level)
1332 saved_in_section = in_section;
1334 dbxout_symbol (decl, 0);
1336 if (in_section != saved_in_section)
1338 /* Switch to the proper section for this data. */
1339 #ifdef SELECT_SECTION
1340 SELECT_SECTION (decl, reloc);
1342 if (TREE_READONLY (decl)
1343 && ! TREE_THIS_VOLATILE (decl)
1344 && DECL_INITIAL (decl)
1345 && (DECL_INITIAL (decl) == error_mark_node
1346 || TREE_CONSTANT (DECL_INITIAL (decl)))
1347 && ! (flag_pic && reloc))
1348 readonly_data_section ();
1355 /* There must be a statement after a label. */
1360 /* Return 1 if type TYPE contains any pointers. */
1363 contains_pointers_p (type)
1366 switch (TREE_CODE (type))
1369 case REFERENCE_TYPE:
1370 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1371 so I'll play safe and return 1. */
1377 case QUAL_UNION_TYPE:
1380 /* For a type that has fields, see if the fields have pointers. */
1381 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1382 if (TREE_CODE (fields) == FIELD_DECL
1383 && contains_pointers_p (TREE_TYPE (fields)))
1389 /* An array type contains pointers if its element type does. */
1390 return contains_pointers_p (TREE_TYPE (type));
1397 /* Output text storage for constructor CONSTR. */
1400 bc_output_constructor (constr, size)
1406 /* Must always be a literal; non-literal constructors are handled
1409 if (!TREE_CONSTANT (constr))
1416 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++)
1420 BC_OUTPUT_ALIGN (asm_out_file, i);
1423 output_constant (constr, size);
1426 /* Create storage for constructor CONSTR. */
1429 bc_output_data_constructor (constr)
1434 /* Put in data section */
1438 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1440 BC_OUTPUT_ALIGN (asm_out_file, i);
1442 /* The constructor is filled in at runtime. */
1443 BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr)));
1446 /* Output something to declare an external symbol to the assembler.
1447 (Most assemblers don't need this, so we normally output nothing.)
1448 Do nothing if DECL is not external. */
1451 assemble_external (decl)
1454 if (output_bytecode)
1457 #ifdef ASM_OUTPUT_EXTERNAL
1458 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1459 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1461 rtx rtl = DECL_RTL (decl);
1463 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1464 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1466 /* Some systems do require some output. */
1467 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1468 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1474 /* Similar, for calling a library function FUN. */
1477 assemble_external_libcall (fun)
1480 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1481 if (!output_bytecode)
1483 /* Declare library function name external when first used, if nec. */
1484 if (! SYMBOL_REF_USED (fun))
1486 SYMBOL_REF_USED (fun) = 1;
1487 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1493 /* Declare the label NAME global. */
1496 assemble_global (name)
1499 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1502 /* Assemble a label named NAME. */
1505 assemble_label (name)
1508 if (output_bytecode)
1509 BC_OUTPUT_LABEL (asm_out_file, name);
1511 ASM_OUTPUT_LABEL (asm_out_file, name);
1514 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1515 If NAME starts with a *, the rest of NAME is output verbatim.
1516 Otherwise NAME is transformed in an implementation-defined way
1517 (usually by the addition of an underscore).
1518 Many macros in the tm file are defined to call this function. */
1521 assemble_name (file, name)
1527 STRIP_NAME_ENCODING (real_name, name);
1528 TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1;
1532 if (output_bytecode)
1533 bc_emit_labelref (name);
1535 fputs (&name[1], file);
1539 if (output_bytecode)
1540 BC_OUTPUT_LABELREF (file, name);
1542 ASM_OUTPUT_LABELREF (file, name);
1546 /* Allocate SIZE bytes writable static space with a gensym name
1547 and return an RTX to refer to its address. */
1550 assemble_static_space (size)
1556 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1557 so that each uninitialized object starts on such a boundary. */
1558 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1559 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1560 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1563 if (flag_shared_data)
1567 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1570 namestring = (char *) obstack_alloc (saveable_obstack,
1572 strcpy (namestring, name);
1574 if (output_bytecode)
1575 x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0);
1577 x = gen_rtx (SYMBOL_REF, Pmode, namestring);
1579 if (output_bytecode)
1581 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1585 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1586 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1588 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1594 /* Assemble the static constant template for function entry trampolines.
1595 This is done at most once per compilation.
1596 Returns an RTX for the address of the template. */
1599 assemble_trampoline_template ()
1605 /* Shouldn't get here */
1606 if (output_bytecode)
1609 /* By default, put trampoline templates in read-only data section. */
1611 #ifdef TRAMPOLINE_SECTION
1612 TRAMPOLINE_SECTION ();
1614 readonly_data_section ();
1617 /* Write the assembler code to define one. */
1618 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1620 ASM_OUTPUT_ALIGN (asm_out_file, align);
1622 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1623 TRAMPOLINE_TEMPLATE (asm_out_file);
1625 /* Record the rtl to refer to it. */
1626 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1628 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1629 return gen_rtx (SYMBOL_REF, Pmode, name);
1632 /* Assemble the integer constant X into an object of SIZE bytes.
1633 X must be either a CONST_INT or CONST_DOUBLE.
1635 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1636 non-zero, abort if we can't output the constant. */
1639 assemble_integer (x, size, force)
1644 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1645 ASM_OUTPUT... macros. */
1649 #ifdef ASM_OUTPUT_CHAR
1651 ASM_OUTPUT_CHAR (asm_out_file, x);
1655 #ifdef ASM_OUTPUT_SHORT
1657 ASM_OUTPUT_SHORT (asm_out_file, x);
1661 #ifdef ASM_OUTPUT_INT
1663 ASM_OUTPUT_INT (asm_out_file, x);
1667 #ifdef ASM_OUTPUT_DOUBLE_INT
1669 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1673 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1675 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1680 /* If we couldn't do it that way, there are two other possibilities: First,
1681 if the machine can output an explicit byte and this is a 1 byte constant,
1682 we can use ASM_OUTPUT_BYTE. */
1684 #ifdef ASM_OUTPUT_BYTE
1685 if (size == 1 && GET_CODE (x) == CONST_INT)
1687 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1692 /* Finally, if SIZE is larger than a single word, try to output the constant
1693 one word at a time. */
1695 if (size > UNITS_PER_WORD)
1698 enum machine_mode mode
1699 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1702 for (i = 0; i < size / UNITS_PER_WORD; i++)
1704 word = operand_subword (x, i, 0, mode);
1709 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1713 if (i == size / UNITS_PER_WORD)
1715 /* If we output at least one word and then could not finish,
1716 there is no valid way to continue. */
1727 /* Assemble the floating-point constant D into an object of size MODE. */
1730 assemble_real (d, mode)
1732 enum machine_mode mode;
1734 jmp_buf output_constant_handler;
1736 if (setjmp (output_constant_handler))
1738 error ("floating point trap outputting a constant");
1739 #ifdef REAL_IS_NOT_DOUBLE
1740 bzero ((char *) &d, sizeof d);
1747 set_float_handler (output_constant_handler);
1751 #ifdef ASM_OUTPUT_BYTE_FLOAT
1753 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1756 #ifdef ASM_OUTPUT_SHORT_FLOAT
1758 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1761 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1763 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d);
1766 #ifdef ASM_OUTPUT_FLOAT
1768 ASM_OUTPUT_FLOAT (asm_out_file, d);
1772 #ifdef ASM_OUTPUT_DOUBLE
1774 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1778 #ifdef ASM_OUTPUT_LONG_DOUBLE
1781 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1789 set_float_handler (NULL_PTR);
1792 /* Here we combine duplicate floating constants to make
1793 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1795 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1796 They are chained through the CONST_DOUBLE_CHAIN.
1797 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1798 In that case, CONST_DOUBLE_MEM is either a MEM,
1799 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1801 (CONST_DOUBLE_MEM is used only for top-level functions.
1802 See force_const_mem for explanation.) */
1804 static rtx const_double_chain;
1806 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1807 For an integer, I0 is the low-order word and I1 is the high-order word.
1808 For a real number, I0 is the word with the low address
1809 and I1 is the word with the high address. */
1812 immed_double_const (i0, i1, mode)
1813 HOST_WIDE_INT i0, i1;
1814 enum machine_mode mode;
1817 int in_current_obstack;
1819 if (GET_MODE_CLASS (mode) == MODE_INT
1820 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1822 /* We clear out all bits that don't belong in MODE, unless they and our
1823 sign bit are all one. So we get either a reasonable negative value
1824 or a reasonable unsigned value for this mode. */
1825 int width = GET_MODE_BITSIZE (mode);
1826 if (width < HOST_BITS_PER_WIDE_INT
1827 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1828 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1829 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
1830 else if (width == HOST_BITS_PER_WIDE_INT
1831 && ! (i1 == ~0 && i0 < 0))
1833 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
1834 /* We cannot represent this value as a constant. */
1837 /* If this would be an entire word for the target, but is not for
1838 the host, then sign-extend on the host so that the number will look
1839 the same way on the host that it would on the target.
1841 For example, when building a 64 bit alpha hosted 32 bit sparc
1842 targeted compiler, then we want the 32 bit unsigned value -1 to be
1843 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1844 The later confuses the sparc backend. */
1846 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
1847 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
1848 i0 |= ((HOST_WIDE_INT) (-1) << width);
1850 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1852 ??? Strictly speaking, this is wrong if we create a CONST_INT
1853 for a large unsigned constant with the size of MODE being
1854 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1855 wider mode. In that case we will mis-interpret it as a negative
1858 Unfortunately, the only alternative is to make a CONST_DOUBLE
1859 for any constant in any mode if it is an unsigned constant larger
1860 than the maximum signed integer in an int on the host. However,
1861 doing this will break everyone that always expects to see a CONST_INT
1862 for SImode and smaller.
1864 We have always been making CONST_INTs in this case, so nothing new
1867 if (width <= HOST_BITS_PER_WIDE_INT)
1868 i1 = (i0 < 0) ? ~0 : 0;
1870 /* If this integer fits in one word, return a CONST_INT. */
1871 if ((i1 == 0 && i0 >= 0)
1872 || (i1 == ~0 && i0 < 0))
1873 return GEN_INT (i0);
1875 /* We use VOIDmode for integers. */
1879 /* Search the chain for an existing CONST_DOUBLE with the right value.
1880 If one is found, return it. */
1882 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1883 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
1884 && GET_MODE (r) == mode)
1887 /* No; make a new one and add it to the chain.
1889 We may be called by an optimizer which may be discarding any memory
1890 allocated during its processing (such as combine and loop). However,
1891 we will be leaving this constant on the chain, so we cannot tolerate
1892 freed memory. So switch to saveable_obstack for this allocation
1893 and then switch back if we were in current_obstack. */
1895 push_obstacks_nochange ();
1896 rtl_in_saveable_obstack ();
1897 r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1);
1900 /* Don't touch const_double_chain in nested function; see force_const_mem.
1901 Also, don't touch it if not inside any function. */
1902 if (outer_function_chain == 0 && current_function_decl != 0)
1904 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1905 const_double_chain = r;
1908 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
1909 Actual use of mem-slot is only through force_const_mem. */
1911 CONST_DOUBLE_MEM (r) = const0_rtx;
1916 /* Return a CONST_DOUBLE for a specified `double' value
1917 and machine mode. */
1920 immed_real_const_1 (d, mode)
1922 enum machine_mode mode;
1924 union real_extract u;
1926 int in_current_obstack;
1928 /* Get the desired `double' value as a sequence of ints
1929 since that is how they are stored in a CONST_DOUBLE. */
1933 /* Detect special cases. */
1935 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
1936 if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d))
1937 return CONST0_RTX (mode);
1938 /* Check for NaN first, because some ports (specifically the i386) do not
1939 emit correct ieee-fp code by default, and thus will generate a core
1940 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1941 does a floating point comparison. */
1942 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
1943 return CONST1_RTX (mode);
1945 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
1946 return immed_double_const (u.i[0], u.i[1], mode);
1948 /* The rest of this function handles the case where
1949 a float value requires more than 2 ints of space.
1950 It will be deleted as dead code on machines that don't need it. */
1952 /* Search the chain for an existing CONST_DOUBLE with the right value.
1953 If one is found, return it. */
1955 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1956 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
1957 && GET_MODE (r) == mode)
1960 /* No; make a new one and add it to the chain.
1962 We may be called by an optimizer which may be discarding any memory
1963 allocated during its processing (such as combine and loop). However,
1964 we will be leaving this constant on the chain, so we cannot tolerate
1965 freed memory. So switch to saveable_obstack for this allocation
1966 and then switch back if we were in current_obstack. */
1968 push_obstacks_nochange ();
1969 rtl_in_saveable_obstack ();
1970 r = rtx_alloc (CONST_DOUBLE);
1972 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
1975 /* Don't touch const_double_chain in nested function; see force_const_mem.
1976 Also, don't touch it if not inside any function. */
1977 if (outer_function_chain == 0 && current_function_decl != 0)
1979 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1980 const_double_chain = r;
1983 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1984 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1985 is only through force_const_mem. */
1987 CONST_DOUBLE_MEM (r) = const0_rtx;
1992 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1993 which must be a REAL_CST tree node. */
1996 immed_real_const (exp)
1999 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
2002 /* At the end of a function, forget the memory-constants
2003 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2004 Also clear out real_constant_chain and clear out all the chain-pointers. */
2007 clear_const_double_mem ()
2009 register rtx r, next;
2011 /* Don't touch CONST_DOUBLE_MEM for nested functions.
2012 See force_const_mem for explanation. */
2013 if (outer_function_chain != 0)
2016 for (r = const_double_chain; r; r = next)
2018 next = CONST_DOUBLE_CHAIN (r);
2019 CONST_DOUBLE_CHAIN (r) = 0;
2020 CONST_DOUBLE_MEM (r) = cc0_rtx;
2022 const_double_chain = 0;
2025 /* Given an expression EXP with a constant value,
2026 reduce it to the sum of an assembler symbol and an integer.
2027 Store them both in the structure *VALUE.
2028 Abort if EXP does not reduce. */
2033 HOST_WIDE_INT offset;
2037 decode_addr_const (exp, value)
2039 struct addr_const *value;
2041 register tree target = TREE_OPERAND (exp, 0);
2042 register int offset = 0;
2047 if (TREE_CODE (target) == COMPONENT_REF
2048 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2051 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2052 target = TREE_OPERAND (target, 0);
2054 else if (TREE_CODE (target) == ARRAY_REF)
2056 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2057 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2059 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2060 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2062 target = TREE_OPERAND (target, 0);
2068 switch (TREE_CODE (target))
2072 x = DECL_RTL (target);
2076 if (output_bytecode)
2077 /* FIXME: this may not be correct, check it */
2078 x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0);
2080 x = gen_rtx (MEM, FUNCTION_MODE,
2081 gen_rtx (LABEL_REF, VOIDmode,
2082 label_rtx (TREE_OPERAND (exp, 0))));
2089 x = TREE_CST_RTL (target);
2096 if (!output_bytecode)
2098 if (GET_CODE (x) != MEM)
2104 value->offset = offset;
2107 /* Uniquize all constants that appear in memory.
2108 Each constant in memory thus far output is recorded
2109 in `const_hash_table' with a `struct constant_descriptor'
2110 that contains a polish representation of the value of
2113 We cannot store the trees in the hash table
2114 because the trees may be temporary. */
2116 struct constant_descriptor
2118 struct constant_descriptor *next;
2124 #define MAX_HASH_TABLE 1009
2125 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2127 /* Compute a hash code for a constant expression. */
2134 register int len, hi, i;
2135 register enum tree_code code = TREE_CODE (exp);
2137 if (code == INTEGER_CST)
2139 p = (char *) &TREE_INT_CST_LOW (exp);
2140 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2142 else if (code == REAL_CST)
2144 p = (char *) &TREE_REAL_CST (exp);
2145 len = sizeof TREE_REAL_CST (exp);
2147 else if (code == STRING_CST)
2148 p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp);
2149 else if (code == COMPLEX_CST)
2150 return const_hash (TREE_REALPART (exp)) * 5
2151 + const_hash (TREE_IMAGPART (exp));
2152 else if (code == CONSTRUCTOR)
2156 /* For record type, include the type in the hashing.
2157 We do not do so for array types
2158 because (1) the sizes of the elements are sufficient
2159 and (2) distinct array types can have the same constructor.
2160 Instead, we include the array size because the constructor could
2162 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2163 hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2166 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2167 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2169 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2170 if (TREE_VALUE (link))
2171 hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2175 else if (code == ADDR_EXPR)
2177 struct addr_const value;
2178 decode_addr_const (exp, &value);
2179 if (GET_CODE (value.base) == SYMBOL_REF)
2181 /* Don't hash the address of the SYMBOL_REF;
2182 only use the offset and the symbol name. */
2184 p = XSTR (value.base, 0);
2185 for (i = 0; p[i] != 0; i++)
2186 hi = ((hi * 613) + (unsigned)(p[i]));
2188 else if (GET_CODE (value.base) == LABEL_REF)
2189 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2191 hi &= (1 << HASHBITS) - 1;
2192 hi %= MAX_HASH_TABLE;
2195 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2196 return const_hash (TREE_OPERAND (exp, 0)) * 9
2197 + const_hash (TREE_OPERAND (exp, 1));
2198 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2199 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2201 /* Compute hashing function */
2203 for (i = 0; i < len; i++)
2204 hi = ((hi * 613) + (unsigned)(p[i]));
2206 hi &= (1 << HASHBITS) - 1;
2207 hi %= MAX_HASH_TABLE;
2211 /* Compare a constant expression EXP with a constant-descriptor DESC.
2212 Return 1 if DESC describes a constant with the same value as EXP. */
2215 compare_constant (exp, desc)
2217 struct constant_descriptor *desc;
2219 return 0 != compare_constant_1 (exp, desc->contents);
2222 /* Compare constant expression EXP with a substring P of a constant descriptor.
2223 If they match, return a pointer to the end of the substring matched.
2224 If they do not match, return 0.
2226 Since descriptors are written in polish prefix notation,
2227 this function can be used recursively to test one operand of EXP
2228 against a subdescriptor, and if it succeeds it returns the
2229 address of the subdescriptor for the next operand. */
2232 compare_constant_1 (exp, p)
2236 register char *strp;
2238 register enum tree_code code = TREE_CODE (exp);
2240 if (code != (enum tree_code) *p++)
2243 if (code == INTEGER_CST)
2245 /* Integer constants are the same only if the same width of type. */
2246 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2248 strp = (char *) &TREE_INT_CST_LOW (exp);
2249 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2251 else if (code == REAL_CST)
2253 /* Real constants are the same only if the same width of type. */
2254 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2256 strp = (char *) &TREE_REAL_CST (exp);
2257 len = sizeof TREE_REAL_CST (exp);
2259 else if (code == STRING_CST)
2261 if (flag_writable_strings)
2263 strp = TREE_STRING_POINTER (exp);
2264 len = TREE_STRING_LENGTH (exp);
2265 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2266 sizeof TREE_STRING_LENGTH (exp)))
2268 p += sizeof TREE_STRING_LENGTH (exp);
2270 else if (code == COMPLEX_CST)
2272 p = compare_constant_1 (TREE_REALPART (exp), p);
2273 if (p == 0) return 0;
2274 p = compare_constant_1 (TREE_IMAGPART (exp), p);
2277 else if (code == CONSTRUCTOR)
2280 int length = list_length (CONSTRUCTOR_ELTS (exp));
2283 if (bcmp ((char *) &length, p, sizeof length))
2287 /* For record constructors, insist that the types match.
2288 For arrays, just verify both constructors are for arrays. */
2289 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2290 type = TREE_TYPE (exp);
2293 if (bcmp ((char *) &type, p, sizeof type))
2297 /* For arrays, insist that the size in bytes match. */
2298 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2300 int size = int_size_in_bytes (TREE_TYPE (exp));
2301 if (bcmp ((char *) &size, p, sizeof size))
2306 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2308 if (TREE_VALUE (link))
2310 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2317 if (bcmp ((char *) &zero, p, sizeof zero))
2325 else if (code == ADDR_EXPR)
2327 struct addr_const value;
2328 decode_addr_const (exp, &value);
2329 strp = (char *) &value.offset;
2330 len = sizeof value.offset;
2331 /* Compare the offset. */
2333 if (*p++ != *strp++)
2335 /* Compare symbol name. */
2336 strp = XSTR (value.base, 0);
2337 len = strlen (strp) + 1;
2339 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2341 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2342 if (p == 0) return 0;
2343 p = compare_constant_1 (TREE_OPERAND (exp, 1), p);
2346 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2348 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2352 /* Compare constant contents. */
2354 if (*p++ != *strp++)
2360 /* Construct a constant descriptor for the expression EXP.
2361 It is up to the caller to enter the descriptor in the hash table. */
2363 static struct constant_descriptor *
2364 record_constant (exp)
2367 struct constant_descriptor *next = 0;
2370 /* Make a struct constant_descriptor. The first two pointers will
2371 be filled in later. Here we just leave space for them. */
2373 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2374 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2375 record_constant_1 (exp);
2376 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2379 /* Add a description of constant expression EXP
2380 to the object growing in `permanent_obstack'.
2381 No need to return its address; the caller will get that
2382 from the obstack when the object is complete. */
2385 record_constant_1 (exp)
2388 register char *strp;
2390 register enum tree_code code = TREE_CODE (exp);
2392 obstack_1grow (&permanent_obstack, (unsigned int) code);
2394 if (code == INTEGER_CST)
2396 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2397 strp = (char *) &TREE_INT_CST_LOW (exp);
2398 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2400 else if (code == REAL_CST)
2402 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2403 strp = (char *) &TREE_REAL_CST (exp);
2404 len = sizeof TREE_REAL_CST (exp);
2406 else if (code == STRING_CST)
2408 if (flag_writable_strings)
2410 strp = TREE_STRING_POINTER (exp);
2411 len = TREE_STRING_LENGTH (exp);
2412 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2413 sizeof TREE_STRING_LENGTH (exp));
2415 else if (code == COMPLEX_CST)
2417 record_constant_1 (TREE_REALPART (exp));
2418 record_constant_1 (TREE_IMAGPART (exp));
2421 else if (code == CONSTRUCTOR)
2424 int length = list_length (CONSTRUCTOR_ELTS (exp));
2427 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2429 /* For record constructors, insist that the types match.
2430 For arrays, just verify both constructors are for arrays. */
2431 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2432 type = TREE_TYPE (exp);
2435 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2437 /* For arrays, insist that the size in bytes match. */
2438 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2440 int size = int_size_in_bytes (TREE_TYPE (exp));
2441 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2444 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2446 if (TREE_VALUE (link))
2447 record_constant_1 (TREE_VALUE (link));
2452 obstack_grow (&permanent_obstack, (char *) &zero, sizeof zero);
2458 else if (code == ADDR_EXPR)
2460 struct addr_const value;
2461 decode_addr_const (exp, &value);
2462 /* Record the offset. */
2463 obstack_grow (&permanent_obstack,
2464 (char *) &value.offset, sizeof value.offset);
2465 /* Record the symbol name. */
2466 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2467 strlen (XSTR (value.base, 0)) + 1);
2470 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2472 record_constant_1 (TREE_OPERAND (exp, 0));
2473 record_constant_1 (TREE_OPERAND (exp, 1));
2476 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2478 record_constant_1 (TREE_OPERAND (exp, 0));
2482 /* Record constant contents. */
2483 obstack_grow (&permanent_obstack, strp, len);
2486 /* Record a list of constant expressions that were passed to
2487 output_constant_def but that could not be output right away. */
2489 struct deferred_constant
2491 struct deferred_constant *next;
2497 static struct deferred_constant *deferred_constants;
2499 /* Nonzero means defer output of addressed subconstants
2500 (i.e., those for which output_constant_def is called.) */
2501 static int defer_addressed_constants_flag;
2503 /* Start deferring output of subconstants. */
2506 defer_addressed_constants ()
2508 defer_addressed_constants_flag++;
2511 /* Stop deferring output of subconstants,
2512 and output now all those that have been deferred. */
2515 output_deferred_addressed_constants ()
2517 struct deferred_constant *p, *next;
2519 defer_addressed_constants_flag--;
2521 if (defer_addressed_constants_flag > 0)
2524 for (p = deferred_constants; p; p = next)
2526 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2531 deferred_constants = 0;
2534 /* Make a copy of the whole tree structure for a constant.
2535 This handles the same types of nodes that compare_constant
2536 and record_constant handle. */
2542 switch (TREE_CODE (exp))
2548 /* For ADDR_EXPR, we do not want to copy the decl
2549 whose address is requested. */
2550 return copy_node (exp);
2553 return build_complex (copy_constant (TREE_REALPART (exp)),
2554 copy_constant (TREE_IMAGPART (exp)));
2558 return build (TREE_CODE (exp), TREE_TYPE (exp),
2559 copy_constant (TREE_OPERAND (exp, 0)),
2560 copy_constant (TREE_OPERAND (exp, 1)));
2564 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2565 copy_constant (TREE_OPERAND (exp, 0)));
2569 tree copy = copy_node (exp);
2570 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2573 CONSTRUCTOR_ELTS (copy) = list;
2574 for (tail = list; tail; tail = TREE_CHAIN (tail))
2575 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2585 /* Return an rtx representing a reference to constant data in memory
2586 for the constant expression EXP.
2588 If assembler code for such a constant has already been output,
2589 return an rtx to refer to it.
2590 Otherwise, output such a constant in memory (or defer it for later)
2591 and generate an rtx for it.
2593 The TREE_CST_RTL of EXP is set up to point to that rtx.
2594 The const_hash_table records which constants already have label strings. */
2597 output_constant_def (exp)
2601 register struct constant_descriptor *desc;
2607 if (TREE_CODE (exp) == INTEGER_CST)
2608 abort (); /* No TREE_CST_RTL slot in these. */
2610 if (TREE_CST_RTL (exp))
2611 return TREE_CST_RTL (exp);
2613 /* Make sure any other constants whose addresses appear in EXP
2614 are assigned label numbers. */
2616 reloc = output_addressed_constants (exp);
2618 /* Compute hash code of EXP. Search the descriptors for that hash code
2619 to see if any of them describes EXP. If yes, the descriptor records
2620 the label number already assigned. */
2622 hash = const_hash (exp) % MAX_HASH_TABLE;
2624 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2625 if (compare_constant (exp, desc))
2627 found = desc->label;
2633 /* No constant equal to EXP is known to have been output.
2634 Make a constant descriptor to enter EXP in the hash table.
2635 Assign the label number and record it in the descriptor for
2636 future calls to this function to find. */
2638 /* Create a string containing the label name, in LABEL. */
2639 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2641 desc = record_constant (exp);
2642 desc->next = const_hash_table[hash];
2644 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2645 const_hash_table[hash] = desc;
2649 /* Create a string containing the label name, in LABEL. */
2650 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2653 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2655 push_obstacks_nochange ();
2656 if (TREE_PERMANENT (exp))
2657 end_temporary_allocation ();
2659 def = gen_rtx (SYMBOL_REF, Pmode, desc->label);
2662 = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def);
2663 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2664 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2665 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2669 /* Optionally set flags or add text to the name to record information
2670 such as that it is a function name. If the name is changed, the macro
2671 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2672 #ifdef ENCODE_SECTION_INFO
2673 ENCODE_SECTION_INFO (exp);
2676 /* If this is the first time we've seen this particular constant,
2677 output it (or defer its output for later). */
2680 if (defer_addressed_constants_flag)
2682 struct deferred_constant *p;
2683 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2685 push_obstacks_nochange ();
2686 suspend_momentary ();
2687 p->exp = copy_constant (exp);
2690 p->labelno = const_labelno++;
2691 p->next = deferred_constants;
2692 deferred_constants = p;
2695 output_constant_def_contents (exp, reloc, const_labelno++);
2698 return TREE_CST_RTL (exp);
2701 /* Now output assembler code to define the label for EXP,
2702 and follow it with the data of EXP. */
2705 output_constant_def_contents (exp, reloc, labelno)
2712 if (IN_NAMED_SECTION (exp))
2713 named_section (exp, NULL);
2716 /* First switch to text section, except for writable strings. */
2717 #ifdef SELECT_SECTION
2718 SELECT_SECTION (exp, reloc);
2720 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
2721 || (flag_pic && reloc))
2724 readonly_data_section ();
2728 /* Align the location counter as required by EXP's data type. */
2729 align = TYPE_ALIGN (TREE_TYPE (exp));
2730 #ifdef CONSTANT_ALIGNMENT
2731 align = CONSTANT_ALIGNMENT (exp, align);
2734 if (align > BITS_PER_UNIT)
2736 if (!output_bytecode)
2738 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2742 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2746 /* Output the label itself. */
2747 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2749 /* Output the value of EXP. */
2750 output_constant (exp,
2751 (TREE_CODE (exp) == STRING_CST
2752 ? TREE_STRING_LENGTH (exp)
2753 : int_size_in_bytes (TREE_TYPE (exp))));
2757 /* Similar hash facility for making memory-constants
2758 from constant rtl-expressions. It is used on RISC machines
2759 where immediate integer arguments and constant addresses are restricted
2760 so that such constants must be stored in memory.
2762 This pool of constants is reinitialized for each function
2763 so each function gets its own constants-pool that comes right before it.
2765 All structures allocated here are discarded when functions are saved for
2766 inlining, so they do not need to be allocated permanently. */
2768 #define MAX_RTX_HASH_TABLE 61
2769 static struct constant_descriptor **const_rtx_hash_table;
2771 /* Structure to represent sufficient information about a constant so that
2772 it can be output when the constant pool is output, so that function
2773 integration can be done, and to simplify handling on machines that reference
2774 constant pool as base+displacement. */
2776 struct pool_constant
2778 struct constant_descriptor *desc;
2779 struct pool_constant *next;
2780 enum machine_mode mode;
2787 /* Pointers to first and last constant in pool. */
2789 static struct pool_constant *first_pool, *last_pool;
2791 /* Current offset in constant pool (does not include any machine-specific
2794 static int pool_offset;
2796 /* Structure used to maintain hash table mapping symbols used to their
2797 corresponding constants. */
2802 struct pool_constant *pool;
2803 struct pool_sym *next;
2806 static struct pool_sym **const_rtx_sym_hash_table;
2808 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2809 The argument is XSTR (... , 0) */
2811 #define SYMHASH(LABEL) \
2812 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2814 /* Initialize constant pool hashing for next function. */
2817 init_const_rtx_hash_table ()
2819 const_rtx_hash_table
2820 = ((struct constant_descriptor **)
2821 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
2822 const_rtx_sym_hash_table
2823 = ((struct pool_sym **)
2824 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
2825 bzero ((char *) const_rtx_hash_table,
2826 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
2827 bzero ((char *) const_rtx_sym_hash_table,
2828 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
2830 first_pool = last_pool = 0;
2834 /* Save and restore status for a nested function. */
2837 save_varasm_status (p)
2840 p->const_rtx_hash_table = const_rtx_hash_table;
2841 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
2842 p->first_pool = first_pool;
2843 p->last_pool = last_pool;
2844 p->pool_offset = pool_offset;
2848 restore_varasm_status (p)
2851 const_rtx_hash_table = p->const_rtx_hash_table;
2852 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
2853 first_pool = p->first_pool;
2854 last_pool = p->last_pool;
2855 pool_offset = p->pool_offset;
2858 enum kind { RTX_DOUBLE, RTX_INT };
2862 #ifdef ONLY_INT_FIELDS
2863 unsigned int kind : 16;
2864 unsigned int mode : 16;
2866 enum kind kind : 16;
2867 enum machine_mode mode : 16;
2870 union real_extract du;
2871 struct addr_const addr;
2875 /* Express an rtx for a constant integer (perhaps symbolic)
2876 as the sum of a symbol or label plus an explicit integer.
2877 They are stored into VALUE. */
2880 decode_rtx_const (mode, x, value)
2881 enum machine_mode mode;
2883 struct rtx_const *value;
2885 /* Clear the whole structure, including any gaps. */
2888 int *p = (int *) value;
2889 int *end = (int *) (value + 1);
2894 value->kind = RTX_INT; /* Most usual kind. */
2897 switch (GET_CODE (x))
2900 value->kind = RTX_DOUBLE;
2901 if (GET_MODE (x) != VOIDmode)
2902 value->mode = GET_MODE (x);
2903 bcopy ((char *) &CONST_DOUBLE_LOW (x),
2904 (char *) &value->un.du, sizeof value->un.du);
2908 value->un.addr.offset = INTVAL (x);
2914 value->un.addr.base = x;
2919 if (GET_CODE (x) == PLUS)
2921 value->un.addr.base = XEXP (x, 0);
2922 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
2924 value->un.addr.offset = INTVAL (XEXP (x, 1));
2926 else if (GET_CODE (x) == MINUS)
2928 value->un.addr.base = XEXP (x, 0);
2929 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
2931 value->un.addr.offset = - INTVAL (XEXP (x, 1));
2941 if (value->kind == RTX_INT && value->un.addr.base != 0)
2942 switch (GET_CODE (value->un.addr.base))
2946 /* Use the string's address, not the SYMBOL_REF's address,
2947 for the sake of addresses of library routines.
2948 For a LABEL_REF, compare labels. */
2949 value->un.addr.base = XEXP (value->un.addr.base, 0);
2953 /* Given a MINUS expression, simplify it if both sides
2954 include the same symbol. */
2957 simplify_subtraction (x)
2960 struct rtx_const val0, val1;
2962 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
2963 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
2965 if (val0.un.addr.base == val1.un.addr.base)
2966 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
2970 /* Compute a hash code for a constant RTL expression. */
2973 const_hash_rtx (mode, x)
2974 enum machine_mode mode;
2979 struct rtx_const value;
2980 decode_rtx_const (mode, x, &value);
2982 /* Compute hashing function */
2984 for (i = 0; i < sizeof value / sizeof (int); i++)
2985 hi += ((int *) &value)[i];
2987 hi &= (1 << HASHBITS) - 1;
2988 hi %= MAX_RTX_HASH_TABLE;
2992 /* Compare a constant rtl object X with a constant-descriptor DESC.
2993 Return 1 if DESC describes a constant with the same value as X. */
2996 compare_constant_rtx (mode, x, desc)
2997 enum machine_mode mode;
2999 struct constant_descriptor *desc;
3001 register int *p = (int *) desc->contents;
3004 struct rtx_const value;
3006 decode_rtx_const (mode, x, &value);
3007 strp = (int *) &value;
3008 len = sizeof value / sizeof (int);
3010 /* Compare constant contents. */
3012 if (*p++ != *strp++)
3018 /* Construct a constant descriptor for the rtl-expression X.
3019 It is up to the caller to enter the descriptor in the hash table. */
3021 static struct constant_descriptor *
3022 record_constant_rtx (mode, x)
3023 enum machine_mode mode;
3026 struct constant_descriptor *ptr;
3028 struct rtx_const value;
3030 decode_rtx_const (mode, x, &value);
3032 /* Put these things in the saveable obstack so we can ensure it won't
3033 be freed if we are called from combine or some other phase that discards
3034 memory allocated from function_obstack (current_obstack). */
3035 obstack_grow (saveable_obstack, &ptr, sizeof ptr);
3036 obstack_grow (saveable_obstack, &label, sizeof label);
3038 /* Record constant contents. */
3039 obstack_grow (saveable_obstack, &value, sizeof value);
3041 return (struct constant_descriptor *) obstack_finish (saveable_obstack);
3044 /* Given a constant rtx X, make (or find) a memory constant for its value
3045 and return a MEM rtx to refer to it in memory. */
3048 force_const_mem (mode, x)
3049 enum machine_mode mode;
3053 register struct constant_descriptor *desc;
3058 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3059 (this will always be true for floating CONST_DOUBLEs that have been
3060 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3061 use the previous copy. Otherwise, make a new one. Note that in
3062 the unlikely event that this same CONST_DOUBLE is used in two different
3063 modes in an alternating fashion, we will allocate a lot of different
3064 memory locations, but this should be extremely rare. */
3066 /* Don't use CONST_DOUBLE_MEM in a nested function.
3067 Nested functions have their own constant pools,
3068 so they can't share the same values in CONST_DOUBLE_MEM
3069 with the containing function. */
3070 if (outer_function_chain == 0)
3071 if (GET_CODE (x) == CONST_DOUBLE
3072 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3073 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3074 return CONST_DOUBLE_MEM (x);
3076 /* Compute hash code of X. Search the descriptors for that hash code
3077 to see if any of them describes X. If yes, the descriptor records
3078 the label number already assigned. */
3080 hash = const_hash_rtx (mode, x);
3082 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3083 if (compare_constant_rtx (mode, x, desc))
3085 found = desc->label;
3091 register struct pool_constant *pool;
3092 register struct pool_sym *sym;
3095 /* No constant equal to X is known to have been output.
3096 Make a constant descriptor to enter X in the hash table.
3097 Assign the label number and record it in the descriptor for
3098 future calls to this function to find. */
3100 desc = record_constant_rtx (mode, x);
3101 desc->next = const_rtx_hash_table[hash];
3102 const_rtx_hash_table[hash] = desc;
3104 /* Align the location counter as required by EXP's data type. */
3105 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3106 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3107 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3109 pool_offset += align - 1;
3110 pool_offset &= ~ (align - 1);
3112 /* If RTL is not being placed into the saveable obstack, make a
3113 copy of X that is in the saveable obstack in case we are being
3114 called from combine or some other phase that discards memory
3115 it allocates. We need only do this if it is a CONST, since
3116 no other RTX should be allocated in this situation. */
3117 if (rtl_obstack != saveable_obstack
3118 && GET_CODE (x) == CONST)
3120 push_obstacks_nochange ();
3121 rtl_in_saveable_obstack ();
3123 x = gen_rtx (CONST, GET_MODE (x),
3124 gen_rtx (PLUS, GET_MODE (x),
3125 XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1)));
3129 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3131 pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant));
3135 pool->labelno = const_labelno;
3136 pool->align = align;
3137 pool->offset = pool_offset;
3143 last_pool->next = pool;
3146 pool_offset += GET_MODE_SIZE (mode);
3148 /* Create a string containing the label name, in LABEL. */
3149 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3154 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3156 /* Add label to symbol hash table. */
3157 hash = SYMHASH (found);
3158 sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym));
3161 sym->next = const_rtx_sym_hash_table[hash];
3162 const_rtx_sym_hash_table[hash] = sym;
3165 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3167 def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found));
3169 RTX_UNCHANGING_P (def) = 1;
3170 /* Mark the symbol_ref as belonging to this constants pool. */
3171 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3172 current_function_uses_const_pool = 1;
3174 if (outer_function_chain == 0)
3175 if (GET_CODE (x) == CONST_DOUBLE)
3177 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3179 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3180 const_double_chain = x;
3182 CONST_DOUBLE_MEM (x) = def;
3188 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3189 the corresponding pool_constant structure. */
3191 static struct pool_constant *
3192 find_pool_constant (addr)
3195 struct pool_sym *sym;
3196 char *label = XSTR (addr, 0);
3198 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3199 if (sym->label == label)
3205 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3208 get_pool_constant (addr)
3211 return (find_pool_constant (addr))->constant;
3214 /* Similar, return the mode. */
3217 get_pool_mode (addr)
3220 return (find_pool_constant (addr))->mode;
3223 /* Similar, return the offset in the constant pool. */
3226 get_pool_offset (addr)
3229 return (find_pool_constant (addr))->offset;
3232 /* Return the size of the constant pool. */
3240 /* Write all the constants in the constant pool. */
3243 output_constant_pool (fnname, fndecl)
3247 struct pool_constant *pool;
3249 union real_extract u;
3251 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3252 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3255 for (pool = first_pool; pool; pool = pool->next)
3259 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3260 whose CODE_LABEL has been deleted. This can occur if a jump table
3261 is eliminated by optimization. If so, write a constant of zero
3262 instead. Note that this can also happen by turning the
3263 CODE_LABEL into a NOTE. */
3264 if (((GET_CODE (x) == LABEL_REF
3265 && (INSN_DELETED_P (XEXP (x, 0))
3266 || GET_CODE (XEXP (x, 0)) == NOTE)))
3267 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3268 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3269 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3270 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3273 /* First switch to correct section. */
3274 #ifdef SELECT_RTX_SECTION
3275 SELECT_RTX_SECTION (pool->mode, x);
3277 readonly_data_section ();
3280 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3281 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3282 pool->align, pool->labelno, done);
3285 if (pool->align > 1)
3286 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3288 /* Output the label. */
3289 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3291 /* Output the value of the constant itself. */
3292 switch (GET_MODE_CLASS (pool->mode))
3295 if (GET_CODE (x) != CONST_DOUBLE)
3298 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3299 assemble_real (u.d, pool->mode);
3303 case MODE_PARTIAL_INT:
3304 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3314 /* Done with this pool. */
3315 first_pool = last_pool = 0;
3318 /* Find all the constants whose addresses are referenced inside of EXP,
3319 and make sure assembler code with a label has been output for each one.
3320 Indicate whether an ADDR_EXPR has been encountered. */
3323 output_addressed_constants (exp)
3328 switch (TREE_CODE (exp))
3332 register tree constant = TREE_OPERAND (exp, 0);
3334 while (TREE_CODE (constant) == COMPONENT_REF)
3336 constant = TREE_OPERAND (constant, 0);
3339 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3340 || TREE_CODE (constant) == CONSTRUCTOR)
3341 /* No need to do anything here
3342 for addresses of variables or functions. */
3343 output_constant_def (constant);
3350 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3351 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3356 case NON_LVALUE_EXPR:
3357 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3363 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3364 if (TREE_VALUE (link) != 0)
3365 reloc |= output_addressed_constants (TREE_VALUE (link));
3375 /* Output assembler code for constant EXP to FILE, with no label.
3376 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3377 Assumes output_addressed_constants has been done on EXP already.
3379 Generate exactly SIZE bytes of assembler data, padding at the end
3380 with zeros if necessary. SIZE must always be specified.
3382 SIZE is important for structure constructors,
3383 since trailing members may have been omitted from the constructor.
3384 It is also important for initialization of arrays from string constants
3385 since the full length of the string constant might not be wanted.
3386 It is also needed for initialization of unions, where the initializer's
3387 type is just one member, and that may not be as long as the union.
3389 There a case in which we would fail to output exactly SIZE bytes:
3390 for a structure constructor that wants to produce more than SIZE bytes.
3391 But such constructors will never be generated for any possible input. */
3394 output_constant (exp, size)
3398 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3404 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3405 That way we get the constant (we hope) inside it. Also, strip off any
3406 NOP_EXPR that converts between two record, union, or array types. */
3407 while ((TREE_CODE (exp) == NOP_EXPR
3408 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3409 || TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3410 || TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3411 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE
3412 || TREE_CODE (TREE_TYPE (exp)) == QUAL_UNION_TYPE))
3413 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3414 exp = TREE_OPERAND (exp, 0);
3416 /* Allow a constructor with no elements for any data type.
3417 This means to fill the space with zeros. */
3418 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3420 if (output_bytecode)
3421 bc_emit_const_skip (size);
3423 assemble_zeros (size);
3434 case REFERENCE_TYPE:
3435 /* ??? What about (int)((float)(int)&foo + 4) */
3436 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3437 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3438 exp = TREE_OPERAND (exp, 0);
3440 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3441 EXPAND_INITIALIZER),
3443 error ("initializer for integer value is too complicated");
3448 if (TREE_CODE (exp) != REAL_CST)
3449 error ("initializer for floating value is not a floating constant");
3451 assemble_real (TREE_REAL_CST (exp),
3452 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3457 output_constant (TREE_REALPART (exp), size / 2);
3458 output_constant (TREE_IMAGPART (exp), size / 2);
3459 size -= (size / 2) * 2;
3463 if (TREE_CODE (exp) == CONSTRUCTOR)
3465 output_constructor (exp, size);
3468 else if (TREE_CODE (exp) == STRING_CST)
3472 if (size > TREE_STRING_LENGTH (exp))
3474 excess = size - TREE_STRING_LENGTH (exp);
3475 size = TREE_STRING_LENGTH (exp);
3478 assemble_string (TREE_STRING_POINTER (exp), size);
3487 if (TREE_CODE (exp) == CONSTRUCTOR)
3488 output_constructor (exp, size);
3495 assemble_zeros (size);
3498 /* Bytecode specific code to output assembler for integer. */
3501 bc_assemble_integer (exp, size)
3509 /* FIXME: is this fold() business going to be as good as the
3510 expand_expr() using EXPAND_SUM above in the RTL case? I
3512 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3516 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR)
3517 exp = TREE_OPERAND (exp, 0);
3518 if (TREE_CODE (exp) == INTEGER_CST)
3523 else if (TREE_CODE (exp) == PLUS_EXPR)
3525 const_part = TREE_OPERAND (exp, 0);
3526 while (TREE_CODE (const_part) == NOP_EXPR
3527 || TREE_CODE (const_part) == CONVERT_EXPR)
3528 const_part = TREE_OPERAND (const_part, 0);
3529 addr_part = TREE_OPERAND (exp, 1);
3530 while (TREE_CODE (addr_part) == NOP_EXPR
3531 || TREE_CODE (addr_part) == CONVERT_EXPR)
3532 addr_part = TREE_OPERAND (addr_part, 0);
3533 if (TREE_CODE (const_part) != INTEGER_CST)
3534 tmp = const_part, const_part = addr_part, addr_part = tmp;
3535 if (TREE_CODE (const_part) != INTEGER_CST
3536 || TREE_CODE (addr_part) != ADDR_EXPR)
3537 abort (); /* FIXME: we really haven't considered
3538 all the possible cases here. */
3540 else if (TREE_CODE (exp) == ADDR_EXPR)
3542 const_part = integer_zero_node;
3546 abort (); /* FIXME: ditto previous. */
3552 char c = TREE_INT_CST_LOW (const_part);
3558 short s = TREE_INT_CST_LOW (const_part);
3559 bc_emit ((char *) &s, 2);
3564 int i = TREE_INT_CST_LOW (const_part);
3565 bc_emit ((char *) &i, 4);
3570 if (WORDS_BIG_ENDIAN)
3572 int i = TREE_INT_CST_HIGH (const_part);
3573 bc_emit ((char *) &i, 4);
3574 i = TREE_INT_CST_LOW (const_part);
3575 bc_emit ((char *) &i, 4);
3579 int i = TREE_INT_CST_LOW (const_part);
3580 bc_emit ((char *) &i, 4);
3581 i = TREE_INT_CST_HIGH (const_part);
3582 bc_emit ((char *) &i, 4);
3589 && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL)
3590 bc_emit_labelref (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0)),
3591 TREE_INT_CST_LOW (const_part));
3593 abort (); /* FIXME: there may be more cases. */
3596 /* Subroutine of output_constant, used for CONSTRUCTORs
3597 (aggregate constants).
3598 Generate at least SIZE bytes, padding if necessary. */
3601 output_constructor (exp, size)
3605 register tree link, field = 0;
3606 HOST_WIDE_INT min_index = 0;
3607 /* Number of bytes output or skipped so far.
3608 In other words, current position within the constructor. */
3609 int total_bytes = 0;
3610 /* Non-zero means BYTE contains part of a byte, to be output. */
3611 int byte_buffer_in_use = 0;
3614 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3617 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3618 field = TYPE_FIELDS (TREE_TYPE (exp));
3620 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3621 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3623 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3625 /* As LINK goes through the elements of the constant,
3626 FIELD goes through the structure fields, if the constant is a structure.
3627 if the constant is a union, then we override this,
3628 by getting the field from the TREE_LIST element.
3629 But the constant could also be an array. Then FIELD is zero. */
3630 for (link = CONSTRUCTOR_ELTS (exp);
3632 link = TREE_CHAIN (link),
3633 field = field ? TREE_CHAIN (field) : 0)
3635 tree val = TREE_VALUE (link);
3638 /* the element in a union constructor specifies the proper field. */
3640 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3641 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3643 /* if available, use the type given by link */
3644 if (TREE_PURPOSE (link) != 0)
3645 field = TREE_PURPOSE (link);
3648 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
3649 index = TREE_PURPOSE (link);
3651 /* Eliminate the marker that makes a cast not be an lvalue. */
3655 if (field == 0 || !DECL_BIT_FIELD (field))
3657 /* An element that is not a bit-field. */
3659 register int fieldsize;
3660 /* Since this structure is static,
3661 we know the positions are constant. */
3662 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
3666 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
3668 * (TREE_INT_CST_LOW (index) - min_index));
3670 /* Output any buffered-up bit-fields preceding this element. */
3671 if (byte_buffer_in_use)
3673 ASM_OUTPUT_BYTE (asm_out_file, byte);
3675 byte_buffer_in_use = 0;
3678 /* Advance to offset of this element.
3679 Note no alignment needed in an array, since that is guaranteed
3680 if each element has the proper size. */
3681 if ((field != 0 || index != 0) && bitpos != total_bytes)
3683 if (!output_bytecode)
3684 assemble_zeros (bitpos - total_bytes);
3686 bc_emit_const_skip (bitpos - total_bytes);
3687 total_bytes = bitpos;
3690 /* Determine size this element should occupy. */
3693 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
3695 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
3697 /* This avoids overflow trouble. */
3698 tree size_tree = size_binop (CEIL_DIV_EXPR,
3700 size_int (BITS_PER_UNIT));
3701 fieldsize = TREE_INT_CST_LOW (size_tree);
3705 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
3706 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
3710 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
3712 /* Output the element's initial value. */
3714 assemble_zeros (fieldsize);
3716 output_constant (val, fieldsize);
3718 /* Count its size. */
3719 total_bytes += fieldsize;
3721 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3722 error ("invalid initial value for member `%s'",
3723 IDENTIFIER_POINTER (DECL_NAME (field)));
3726 /* Element that is a bit-field. */
3728 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
3730 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
3733 val = integer_zero_node;
3735 /* If this field does not start in this (or, next) byte,
3737 if (next_offset / BITS_PER_UNIT != total_bytes)
3739 /* Output remnant of any bit field in previous bytes. */
3740 if (byte_buffer_in_use)
3742 ASM_OUTPUT_BYTE (asm_out_file, byte);
3744 byte_buffer_in_use = 0;
3747 /* If still not at proper byte, advance to there. */
3748 if (next_offset / BITS_PER_UNIT != total_bytes)
3750 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3751 total_bytes = next_offset / BITS_PER_UNIT;
3755 if (! byte_buffer_in_use)
3758 /* We must split the element into pieces that fall within
3759 separate bytes, and combine each byte with previous or
3760 following bit-fields. */
3762 /* next_offset is the offset n fbits from the beginning of
3763 the structure to the next bit of this element to be processed.
3764 end_offset is the offset of the first bit past the end of
3766 while (next_offset < end_offset)
3770 HOST_WIDE_INT value;
3771 int next_byte = next_offset / BITS_PER_UNIT;
3772 int next_bit = next_offset % BITS_PER_UNIT;
3774 /* Advance from byte to byte
3775 within this element when necessary. */
3776 while (next_byte != total_bytes)
3778 ASM_OUTPUT_BYTE (asm_out_file, byte);
3783 /* Number of bits we can process at once
3784 (all part of the same byte). */
3785 this_time = MIN (end_offset - next_offset,
3786 BITS_PER_UNIT - next_bit);
3787 if (BYTES_BIG_ENDIAN)
3789 /* On big-endian machine, take the most significant bits
3790 first (of the bits that are significant)
3791 and put them into bytes from the most significant end. */
3792 shift = end_offset - next_offset - this_time;
3793 /* Don't try to take a bunch of bits that cross
3794 the word boundary in the INTEGER_CST. */
3795 if (shift < HOST_BITS_PER_WIDE_INT
3796 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3798 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
3799 shift = HOST_BITS_PER_WIDE_INT;
3802 /* Now get the bits from the appropriate constant word. */
3803 if (shift < HOST_BITS_PER_WIDE_INT)
3805 value = TREE_INT_CST_LOW (val);
3807 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3809 value = TREE_INT_CST_HIGH (val);
3810 shift -= HOST_BITS_PER_WIDE_INT;
3814 byte |= (((value >> shift)
3815 & (((HOST_WIDE_INT) 1 << this_time) - 1))
3816 << (BITS_PER_UNIT - this_time - next_bit));
3820 /* On little-endian machines,
3821 take first the least significant bits of the value
3822 and pack them starting at the least significant
3823 bits of the bytes. */
3824 shift = (next_offset
3825 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
3826 /* Don't try to take a bunch of bits that cross
3827 the word boundary in the INTEGER_CST. */
3828 if (shift < HOST_BITS_PER_WIDE_INT
3829 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3831 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
3832 shift = HOST_BITS_PER_WIDE_INT;
3835 /* Now get the bits from the appropriate constant word. */
3836 if (shift < HOST_BITS_PER_INT)
3837 value = TREE_INT_CST_LOW (val);
3838 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3840 value = TREE_INT_CST_HIGH (val);
3841 shift -= HOST_BITS_PER_WIDE_INT;
3845 byte |= (((value >> shift)
3846 & (((HOST_WIDE_INT) 1 << this_time) - 1))
3849 next_offset += this_time;
3850 byte_buffer_in_use = 1;
3854 if (byte_buffer_in_use)
3856 ASM_OUTPUT_BYTE (asm_out_file, byte);
3859 if (total_bytes < size)
3860 assemble_zeros (size - total_bytes);
3864 #ifdef HANDLE_SYSV_PRAGMA
3866 /* Support #pragma weak by default if WEAK_ASM_OP and ASM_OUTPUT_DEF
3868 #if defined (WEAK_ASM_OP) && defined (ASM_OUTPUT_DEF)
3870 /* See c-pragma.c for an identical definition. */
3886 /* Output asm to handle ``#pragma weak'' */
3888 handle_pragma_weak (what, asm_out_file, name, value)
3889 enum pragma_state what;
3893 if (what == ps_name || what == ps_value)
3895 fprintf (asm_out_file, "\t%s\t", WEAK_ASM_OP);
3897 if (output_bytecode)
3898 BC_OUTPUT_LABELREF (asm_out_file, name);
3900 ASM_OUTPUT_LABELREF (asm_out_file, name);
3902 fputc ('\n', asm_out_file);
3903 if (what == ps_value)
3904 ASM_OUTPUT_DEF (asm_out_file, name, value);
3906 else if (! (what == ps_done || what == ps_start))
3907 warning ("malformed `#pragma weak'");
3910 #endif /* HANDLE_PRAGMA_WEAK or (WEAK_ASM_OP and SET_ASM_OP) */
3912 #endif /* WEAK_ASM_OP && ASM_OUTPUT_DEF */