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> */
37 #include "hard-reg-set.h"
45 #ifdef XCOFF_DEBUGGING_INFO
52 #define ASM_STABS_OP ".stabs"
55 /* This macro gets just the user-specified name
56 out of the string in a SYMBOL_REF. On most machines,
57 we discard the * if any and that's all. */
58 #ifndef STRIP_NAME_ENCODING
59 #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \
60 (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*'))
63 /* File in which assembler code is being written. */
65 extern FILE *asm_out_file;
67 /* The (assembler) name of the first globally-visible object output. */
68 char *first_global_object_name;
70 extern struct obstack *current_obstack;
71 extern struct obstack *saveable_obstack;
72 extern struct obstack permanent_obstack;
73 #define obstack_chunk_alloc xmalloc
75 /* Number for making the label on the next
76 constant that is stored in memory. */
80 /* Number for making the label on the next
81 static variable internal to a function. */
85 /* Carry information from ASM_DECLARE_OBJECT_NAME
86 to ASM_FINISH_DECLARE_OBJECT. */
88 int size_directive_output;
90 /* The last decl for which assemble_variable was called,
91 if it did ASM_DECLARE_OBJECT_NAME.
92 If the last call to assemble_variable didn't do that,
95 tree last_assemble_variable_decl;
97 /* Nonzero if at least one function definition has been seen. */
98 static int function_defined;
100 extern FILE *asm_out_file;
102 static char *compare_constant_1 ();
103 static void record_constant_1 ();
104 static void output_constant_def_contents ();
105 static int contains_pointers_p ();
106 static void bc_output_ascii ();
108 void output_constant_pool ();
109 void assemble_name ();
110 int output_addressed_constants ();
111 void output_constant ();
112 void output_constructor ();
113 void output_byte_asm ();
114 void text_section ();
115 void readonly_data_section ();
116 void data_section ();
117 void named_section ();
118 static void bc_assemble_integer ();
120 #ifdef EXTRA_SECTIONS
121 static enum in_section {no_section, in_text, in_data, in_named, EXTRA_SECTIONS} in_section
124 static enum in_section {no_section, in_text, in_data, in_named} in_section
128 /* Return a non-zero value if DECL has a section attribute. */
129 #define IN_NAMED_SECTION(DECL) \
130 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
131 && DECL_SECTION_NAME (DECL) != NULL_TREE)
133 /* Text of section name when in_section == in_named. */
134 static char *in_named_name;
136 /* Define functions like text_section for any extra sections. */
137 #ifdef EXTRA_SECTION_FUNCTIONS
138 EXTRA_SECTION_FUNCTIONS
141 /* Tell assembler to switch to text section. */
146 if (in_section != in_text)
151 fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP);
153 in_section = in_text;
157 /* Tell assembler to switch to data section. */
162 if (in_section != in_data)
168 if (flag_shared_data)
170 #ifdef SHARED_SECTION_ASM_OP
171 fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP);
173 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
177 fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP);
180 in_section = in_data;
184 /* Tell assembler to switch to read-only data section. This is normally
188 readonly_data_section ()
190 #ifdef READONLY_DATA_SECTION
191 READONLY_DATA_SECTION (); /* Note this can call data_section. */
197 /* Determine if we're in the text section. */
202 return in_section == in_text;
205 /* Tell assembler to change to named section. */
211 if (in_section != in_named || strcmp (name, in_named_name))
213 in_named_name = name;
214 in_section = in_named;
216 #ifdef ASM_OUTPUT_SECTION_NAME
217 ASM_OUTPUT_SECTION_NAME (asm_out_file, name);
219 /* Section attributes are not supported if this macro isn't provided -
220 some host formats don't support them at all. The front-end should
221 already have flagged this as an error. */
227 /* Create the rtl to represent a function, for a function definition.
228 DECL is a FUNCTION_DECL node which describes which function.
229 The rtl is stored into DECL. */
232 make_function_rtl (decl)
235 char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
239 if (DECL_RTL (decl) == 0)
240 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
242 /* Record that at least one function has been defined. */
243 function_defined = 1;
247 /* Rename a nested function to avoid conflicts. */
248 if (decl_function_context (decl) != 0
249 && DECL_INITIAL (decl) != 0
250 && DECL_RTL (decl) == 0)
254 name = IDENTIFIER_POINTER (DECL_NAME (decl));
255 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
256 name = obstack_copy0 (saveable_obstack, label, strlen (label));
260 if (DECL_RTL (decl) == 0)
263 = gen_rtx (MEM, DECL_MODE (decl),
264 gen_rtx (SYMBOL_REF, Pmode, name));
266 /* Optionally set flags or add text to the name to record information
267 such as that it is a function name. If the name is changed, the macro
268 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
269 #ifdef ENCODE_SECTION_INFO
270 ENCODE_SECTION_INFO (decl);
274 /* Record at least one function has been defined. */
275 function_defined = 1;
278 /* Create the DECL_RTL for a declaration for a static or external
279 variable or static or external function.
280 ASMSPEC, if not 0, is the string which the user specified
281 as the assembler symbol name.
282 TOP_LEVEL is nonzero if this is a file-scope variable.
283 This is never called for PARM_DECLs. */
285 bc_make_decl_rtl (decl, asmspec, top_level)
290 register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl));
292 if (DECL_RTL (decl) == 0)
294 /* Print an error message for register variables. */
295 if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL)
296 error ("function declared `register'");
297 else if (DECL_REGISTER (decl))
298 error ("global register variables not supported in the interpreter");
300 /* Handle ordinary static variables and functions. */
301 if (DECL_RTL (decl) == 0)
303 /* Can't use just the variable's own name for a variable
304 whose scope is less than the whole file.
305 Concatenate a distinguishing number. */
306 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
310 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
311 name = obstack_copy0 (saveable_obstack, label, strlen (label));
315 DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0);
320 /* Given NAME, a putative register name, discard any customary prefixes. */
323 strip_reg_name (name)
326 #ifdef REGISTER_PREFIX
327 if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX)))
328 name += strlen (REGISTER_PREFIX);
330 if (name[0] == '%' || name[0] == '#')
335 /* Decode an `asm' spec for a declaration as a register name.
336 Return the register number, or -1 if nothing specified,
337 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
338 or -3 if ASMSPEC is `cc' and is not recognized,
339 or -4 if ASMSPEC is `memory' and is not recognized.
340 Accept an exact spelling or a decimal number.
341 Prefixes such as % are optional. */
344 decode_reg_name (asmspec)
351 /* Get rid of confusing prefixes. */
352 asmspec = strip_reg_name (asmspec);
354 /* Allow a decimal number as a "register name". */
355 for (i = strlen (asmspec) - 1; i >= 0; i--)
356 if (! (asmspec[i] >= '0' && asmspec[i] <= '9'))
358 if (asmspec[0] != 0 && i < 0)
361 if (i < FIRST_PSEUDO_REGISTER && i >= 0)
367 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
369 && ! strcmp (asmspec, strip_reg_name (reg_names[i])))
372 #ifdef ADDITIONAL_REGISTER_NAMES
374 static struct { char *name; int number; } table[]
375 = ADDITIONAL_REGISTER_NAMES;
377 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
378 if (! strcmp (asmspec, table[i].name))
379 return table[i].number;
381 #endif /* ADDITIONAL_REGISTER_NAMES */
383 if (!strcmp (asmspec, "memory"))
386 if (!strcmp (asmspec, "cc"))
395 /* Create the DECL_RTL for a declaration for a static or external variable
396 or static or external function.
397 ASMSPEC, if not 0, is the string which the user specified
398 as the assembler symbol name.
399 TOP_LEVEL is nonzero if this is a file-scope variable.
401 This is never called for PARM_DECL nodes. */
404 make_decl_rtl (decl, asmspec, top_level)
409 register char *name = 0;
414 bc_make_decl_rtl (decl, asmspec, top_level);
418 reg_number = decode_reg_name (asmspec);
420 if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE)
421 name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
423 if (reg_number == -2)
425 /* ASMSPEC is given, and not the name of a register. */
426 name = (char *) obstack_alloc (saveable_obstack,
427 strlen (asmspec) + 2);
429 strcpy (&name[1], asmspec);
432 /* For a duplicate declaration, we can be called twice on the
433 same DECL node. Don't discard the RTL already made. */
434 if (DECL_RTL (decl) == 0)
438 /* First detect errors in declaring global registers. */
439 if (DECL_REGISTER (decl) && reg_number == -1)
440 error_with_decl (decl,
441 "register name not specified for `%s'");
442 else if (DECL_REGISTER (decl) && reg_number < 0)
443 error_with_decl (decl,
444 "invalid register name for `%s'");
445 else if ((reg_number >= 0 || reg_number == -3) && ! DECL_REGISTER (decl))
446 error_with_decl (decl,
447 "register name given for non-register variable `%s'");
448 else if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL)
449 error ("function declared `register'");
450 else if (DECL_REGISTER (decl) && TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
451 error_with_decl (decl, "data type of `%s' isn't suitable for a register");
452 else if (DECL_REGISTER (decl)
453 && ! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
454 error_with_decl (decl, "register number for `%s' isn't suitable for the data type");
455 /* Now handle properly declared static register variables. */
456 else if (DECL_REGISTER (decl))
459 #if 0 /* yylex should print the warning for this */
461 pedwarn ("ANSI C forbids global register variables");
463 if (DECL_INITIAL (decl) != 0 && top_level)
465 DECL_INITIAL (decl) = 0;
466 error ("global register variable has initial value");
468 if (fixed_regs[reg_number] == 0
469 && function_defined && top_level)
470 error ("global register variable follows a function definition");
471 if (TREE_THIS_VOLATILE (decl))
472 warning ("volatile register variables don't work as you might wish");
474 /* If the user specified one of the eliminables registers here,
475 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
476 confused with that register and be eliminated. Although this
477 usage is somewhat suspect, we nevertheless use the following
478 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
481 = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER);
482 REGNO (DECL_RTL (decl)) = reg_number;
483 REG_USERVAR_P (DECL_RTL (decl)) = 1;
487 /* Make this register global, so not usable for anything
489 nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl));
491 globalize_reg (reg_number + --nregs);
494 /* Specifying a section attribute on an uninitialized variable does not
495 (and cannot) cause it to be put in the given section. The linker
496 can only put initialized objects in specific sections, everything
497 else goes in bss for the linker to sort out later (otherwise the
498 linker would give a duplicate definition error for each compilation
499 unit that behaved thusly). So warn the user. */
500 else if (TREE_CODE (decl) == VAR_DECL
501 && DECL_SECTION_NAME (decl) != NULL_TREE
502 && DECL_INITIAL (decl) == NULL_TREE)
504 warning_with_decl (decl,
505 "section attribute ignored for uninitialized variable `%s'");
506 /* Remove the section name so subsequent declarations won't see it.
507 We are ignoring it, remember. */
508 DECL_SECTION_NAME (decl) = NULL_TREE;
511 /* Now handle ordinary static variables and functions (in memory).
512 Also handle vars declared register invalidly. */
513 if (DECL_RTL (decl) == 0)
515 /* Can't use just the variable's own name for a variable
516 whose scope is less than the whole file.
517 Concatenate a distinguishing number. */
518 if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0)
522 ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno);
523 name = obstack_copy0 (saveable_obstack, label, strlen (label));
530 DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl),
531 gen_rtx (SYMBOL_REF, Pmode, name));
533 /* If this variable is to be treated as volatile, show its
534 tree node has side effects. If it has side effects, either
535 because of this test or from TREE_THIS_VOLATILE also
536 being set, show the MEM is volatile. */
537 if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL
538 && TREE_PUBLIC (decl))
539 TREE_SIDE_EFFECTS (decl) = 1;
540 if (TREE_SIDE_EFFECTS (decl))
541 MEM_VOLATILE_P (DECL_RTL (decl)) = 1;
543 if (TREE_READONLY (decl))
544 RTX_UNCHANGING_P (DECL_RTL (decl)) = 1;
545 MEM_IN_STRUCT_P (DECL_RTL (decl))
546 = AGGREGATE_TYPE_P (TREE_TYPE (decl));
548 /* Optionally set flags or add text to the name to record information
549 such as that it is a function name.
550 If the name is changed, the macro ASM_OUTPUT_LABELREF
551 will have to know how to strip this information. */
552 #ifdef ENCODE_SECTION_INFO
553 ENCODE_SECTION_INFO (decl);
557 /* If the old RTL had the wrong mode, fix the mode. */
558 else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl))
560 rtx rtl = DECL_RTL (decl);
561 PUT_MODE (rtl, DECL_MODE (decl));
565 /* Make the rtl for variable VAR be volatile.
566 Use this only for static variables. */
569 make_var_volatile (var)
572 if (GET_CODE (DECL_RTL (var)) != MEM)
575 MEM_VOLATILE_P (DECL_RTL (var)) = 1;
578 /* Output alignment directive to align for constant expression EXP. */
581 assemble_constant_align (exp)
586 /* Align the location counter as required by EXP's data type. */
587 align = TYPE_ALIGN (TREE_TYPE (exp));
588 #ifdef CONSTANT_ALIGNMENT
589 align = CONSTANT_ALIGNMENT (exp, align);
592 if (align > BITS_PER_UNIT)
593 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
596 /* Output a string of literal assembler code
597 for an `asm' keyword used between functions. */
600 assemble_asm (string)
605 error ("asm statements not allowed in interpreter");
611 if (TREE_CODE (string) == ADDR_EXPR)
612 string = TREE_OPERAND (string, 0);
614 fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
617 #if 0 /* This should no longer be needed, because
618 flag_gnu_linker should be 0 on these systems,
619 which should prevent any output
620 if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */
621 #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER))
622 #ifndef ASM_OUTPUT_CONSTRUCTOR
623 #define ASM_OUTPUT_CONSTRUCTOR(file, name)
625 #ifndef ASM_OUTPUT_DESTRUCTOR
626 #define ASM_OUTPUT_DESTRUCTOR(file, name)
631 /* Record an element in the table of global destructors.
632 How this is done depends on what sort of assembler and linker
635 NAME should be the name of a global function to be called
636 at exit time. This name is output using assemble_name. */
639 assemble_destructor (name)
642 #ifdef ASM_OUTPUT_DESTRUCTOR
643 ASM_OUTPUT_DESTRUCTOR (asm_out_file, name);
647 /* Now tell GNU LD that this is part of the static destructor set. */
648 /* This code works for any machine provided you use GNU as/ld. */
649 fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP);
650 assemble_name (asm_out_file, name);
651 fputc ('\n', asm_out_file);
656 /* Likewise for global constructors. */
659 assemble_constructor (name)
662 #ifdef ASM_OUTPUT_CONSTRUCTOR
663 ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name);
667 /* Now tell GNU LD that this is part of the static constructor set. */
668 /* This code works for any machine provided you use GNU as/ld. */
669 fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP);
670 assemble_name (asm_out_file, name);
671 fputc ('\n', asm_out_file);
676 /* Likewise for entries we want to record for garbage collection.
677 Garbage collection is still under development. */
680 assemble_gc_entry (name)
683 #ifdef ASM_OUTPUT_GC_ENTRY
684 ASM_OUTPUT_GC_ENTRY (asm_out_file, name);
688 /* Now tell GNU LD that this is part of the static constructor set. */
689 fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP);
690 assemble_name (asm_out_file, name);
691 fputc ('\n', asm_out_file);
696 /* Output assembler code for the constant pool of a function and associated
697 with defining the name of the function. DECL describes the function.
698 NAME is the function's name. For the constant pool, we use the current
699 constant pool data. */
702 assemble_start_function (decl, fnname)
708 /* The following code does not need preprocessing in the assembler. */
712 output_constant_pool (fnname, decl);
714 if (IN_NAMED_SECTION (decl))
715 named_section (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)));
719 /* Tell assembler to move to target machine's alignment for functions. */
720 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
724 BC_OUTPUT_ALIGN (asm_out_file, align);
726 ASM_OUTPUT_ALIGN (asm_out_file, align);
729 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
730 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname);
733 #ifdef SDB_DEBUGGING_INFO
734 /* Output SDB definition of the function. */
735 if (write_symbols == SDB_DEBUG)
736 sdbout_mark_begin_function ();
739 #ifdef DBX_DEBUGGING_INFO
740 /* Output DBX definition of the function. */
741 if (write_symbols == DBX_DEBUG)
742 dbxout_begin_function (decl);
745 /* Make function name accessible from other files, if appropriate. */
747 if (TREE_PUBLIC (decl))
749 if (!first_global_object_name)
750 STRIP_NAME_ENCODING (first_global_object_name, fnname);
752 BC_GLOBALIZE_LABEL (asm_out_file, fnname);
754 ASM_GLOBALIZE_LABEL (asm_out_file, fnname);
757 /* Do any machine/system dependent processing of the function name */
758 #ifdef ASM_DECLARE_FUNCTION_NAME
759 ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
761 /* Standard thing is just output label for the function. */
763 BC_OUTPUT_LABEL (asm_out_file, fnname);
765 ASM_OUTPUT_LABEL (asm_out_file, fnname);
766 #endif /* ASM_DECLARE_FUNCTION_NAME */
769 /* Output assembler code associated with defining the size of the
770 function. DECL describes the function. NAME is the function's name. */
773 assemble_end_function (decl, fnname)
777 #ifdef ASM_DECLARE_FUNCTION_SIZE
778 ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
782 /* Assemble code to leave SIZE bytes of zeros. */
785 assemble_zeros (size)
790 bc_emit_const_skip (size);
794 #ifdef ASM_NO_SKIP_IN_TEXT
795 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
796 so we must output 0s explicitly in the text section. */
797 if (ASM_NO_SKIP_IN_TEXT && in_text_section ())
801 for (i = 0; i < size - 20; i += 20)
804 fprintf (asm_out_file,
805 "%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);
807 fprintf (asm_out_file,
808 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
814 fprintf (asm_out_file, "%s 0", ASM_BYTE_OP);
816 fprintf (asm_out_file, "\tbyte 0");
819 for (; i < size; i++)
820 fprintf (asm_out_file, ",0");
821 fprintf (asm_out_file, "\n");
829 BC_OUTPUT_SKIP (asm_out_file, size);
831 ASM_OUTPUT_SKIP (asm_out_file, size);
835 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
838 assemble_align (align)
841 if (align > BITS_PER_UNIT)
842 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
845 /* Assemble a string constant with the specified C string as contents. */
848 assemble_string (p, size)
862 /* If the string is very long, split it up. */
866 int thissize = size - pos;
867 if (thissize > maximum)
871 bc_output_ascii (asm_out_file, p, thissize);
874 ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
883 bc_output_ascii (file, p, size)
888 BC_OUTPUT_ASCII (file, p, size);
891 /* Assemble everything that is needed for a variable or function declaration.
892 Not used for automatic variables, and not used for function definitions.
893 Should not be called for variables of incomplete structure type.
895 TOP_LEVEL is nonzero if this variable has file scope.
896 AT_END is nonzero if this is the special handling, at end of compilation,
897 to define things that have had only tentative definitions.
898 DONT_OUTPUT_DATA if nonzero means don't actually output the
899 initial value (that will be done by the caller). */
902 assemble_variable (decl, top_level, at_end, dont_output_data)
911 enum in_section saved_in_section;
913 last_assemble_variable_decl = 0;
918 if (GET_CODE (DECL_RTL (decl)) == REG)
920 /* Do output symbol info for global register variables, but do nothing
923 if (TREE_ASM_WRITTEN (decl))
925 TREE_ASM_WRITTEN (decl) = 1;
927 if (!output_bytecode)
929 #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO)
930 /* File-scope global variables are output here. */
931 if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG)
933 dbxout_symbol (decl, 0);
935 #ifdef SDB_DEBUGGING_INFO
936 if (write_symbols == SDB_DEBUG && top_level
937 /* Leave initialized global vars for end of compilation;
938 see comment in compile_file. */
939 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
940 sdbout_symbol (decl, 0);
944 /* Don't output any DWARF debugging information for variables here.
945 In the case of local variables, the information for them is output
946 when we do our recursive traversal of the tree representation for
947 the entire containing function. In the case of file-scope variables,
948 we output information for all of them at the very end of compilation
949 while we are doing our final traversal of the chain of file-scope
955 /* Normally no need to say anything here for external references,
956 since assemble_external is called by the langauge-specific code
957 when a declaration is first seen. */
959 if (DECL_EXTERNAL (decl))
962 /* Output no assembler code for a function declaration.
963 Only definitions of functions output anything. */
965 if (TREE_CODE (decl) == FUNCTION_DECL)
968 /* If type was incomplete when the variable was declared,
969 see if it is complete now. */
971 if (DECL_SIZE (decl) == 0)
972 layout_decl (decl, 0);
974 /* Still incomplete => don't allocate it; treat the tentative defn
975 (which is what it must have been) as an `extern' reference. */
977 if (!dont_output_data && DECL_SIZE (decl) == 0)
979 error_with_file_and_line (DECL_SOURCE_FILE (decl),
980 DECL_SOURCE_LINE (decl),
981 "storage size of `%s' isn't known",
982 IDENTIFIER_POINTER (DECL_NAME (decl)));
983 TREE_ASM_WRITTEN (decl) = 1;
987 /* The first declaration of a variable that comes through this function
988 decides whether it is global (in C, has external linkage)
989 or local (in C, has internal linkage). So do nothing more
990 if this function has already run. */
992 if (TREE_ASM_WRITTEN (decl))
995 TREE_ASM_WRITTEN (decl) = 1;
997 /* If storage size is erroneously variable, just continue.
998 Error message was already made. */
1000 if (DECL_SIZE (decl))
1002 if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST)
1007 /* This is better than explicit arithmetic, since it avoids overflow. */
1008 size_tree = size_binop (CEIL_DIV_EXPR,
1009 DECL_SIZE (decl), size_int (BITS_PER_UNIT));
1011 if (TREE_INT_CST_HIGH (size_tree) != 0)
1013 error_with_decl (decl, "size of variable `%s' is too large");
1018 name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
1020 /* Handle uninitialized definitions. */
1022 /* ANSI specifies that a tentative definition which is not merged with
1023 a non-tentative definition behaves exactly like a definition with an
1024 initializer equal to zero. (Section 3.7.2)
1025 -fno-common gives strict ANSI behavior. Usually you don't want it.
1026 This matters only for variables with external linkage. */
1027 if ((! flag_no_common || ! TREE_PUBLIC (decl))
1028 && DECL_COMMON (decl)
1029 && ! dont_output_data
1030 && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
1032 int size = TREE_INT_CST_LOW (size_tree);
1035 if (TREE_INT_CST_HIGH (size_tree) != 0)
1036 error_with_decl (decl, "size of variable `%s' is too large");
1037 /* Don't allocate zero bytes of common,
1038 since that means "undefined external" in the linker. */
1039 if (size == 0) rounded = 1;
1040 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1041 so that each uninitialized object starts on such a boundary. */
1042 rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
1043 rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1044 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1046 #ifdef DBX_DEBUGGING_INFO
1047 /* File-scope global variables are output here. */
1048 if (write_symbols == DBX_DEBUG && top_level)
1049 dbxout_symbol (decl, 0);
1051 #ifdef SDB_DEBUGGING_INFO
1052 if (write_symbols == SDB_DEBUG && top_level
1053 /* Leave initialized global vars for end of compilation;
1054 see comment in compile_file. */
1055 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1056 sdbout_symbol (decl, 0);
1059 /* Don't output any DWARF debugging information for variables here.
1060 In the case of local variables, the information for them is output
1061 when we do our recursive traversal of the tree representation for
1062 the entire containing function. In the case of file-scope variables,
1063 we output information for all of them at the very end of compilation
1064 while we are doing our final traversal of the chain of file-scope
1068 if (flag_shared_data)
1071 if (TREE_PUBLIC (decl))
1073 #ifdef ASM_OUTPUT_SHARED_COMMON
1074 if (flag_shared_data)
1075 ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded);
1078 if (output_bytecode)
1080 BC_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1084 #ifdef ASM_OUTPUT_ALIGNED_COMMON
1085 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size,
1088 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
1094 #ifdef ASM_OUTPUT_SHARED_LOCAL
1095 if (flag_shared_data)
1096 ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded);
1099 if (output_bytecode)
1101 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1105 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1106 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size,
1109 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1116 /* Handle initialized definitions. */
1118 /* First make the assembler name(s) global if appropriate. */
1119 if (TREE_PUBLIC (decl) && DECL_NAME (decl))
1121 if (!first_global_object_name)
1122 STRIP_NAME_ENCODING(first_global_object_name, name);
1123 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1126 for (d = equivalents; d; d = TREE_CHAIN (d))
1128 tree e = TREE_VALUE (d);
1129 if (TREE_PUBLIC (e) && DECL_NAME (e))
1130 ASM_GLOBALIZE_LABEL (asm_out_file,
1131 XSTR (XEXP (DECL_RTL (e), 0), 0));
1135 /* Output any data that we will need to use the address of. */
1136 if (DECL_INITIAL (decl) == error_mark_node)
1137 reloc = contains_pointers_p (TREE_TYPE (decl));
1138 else if (DECL_INITIAL (decl))
1139 reloc = output_addressed_constants (DECL_INITIAL (decl));
1141 /* Switch to the proper section for this data. */
1142 if (IN_NAMED_SECTION (decl))
1143 named_section (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)));
1146 /* C++ can have const variables that get initialized from constructors,
1147 and thus can not be in a readonly section. We prevent this by
1148 verifying that the initial value is constant for objects put in a
1151 error_mark_node is used by the C front end to indicate that the
1152 initializer has not been seen yet. In this case, we assume that
1153 the initializer must be constant. */
1154 #ifdef SELECT_SECTION
1155 SELECT_SECTION (decl, reloc);
1157 if (TREE_READONLY (decl)
1158 && ! TREE_THIS_VOLATILE (decl)
1159 && DECL_INITIAL (decl)
1160 && (DECL_INITIAL (decl) == error_mark_node
1161 || TREE_CONSTANT (DECL_INITIAL (decl)))
1162 && ! (flag_pic && reloc))
1163 readonly_data_section ();
1169 /* dbxout.c needs to know this. */
1170 if (in_text_section ())
1171 DECL_IN_TEXT_SECTION (decl) = 1;
1173 /* Record current section so we can restore it if dbxout.c clobbers it. */
1174 saved_in_section = in_section;
1176 /* Output the dbx info now that we have chosen the section. */
1178 #ifdef DBX_DEBUGGING_INFO
1179 /* File-scope global variables are output here. */
1180 if (write_symbols == DBX_DEBUG && top_level)
1181 dbxout_symbol (decl, 0);
1183 #ifdef SDB_DEBUGGING_INFO
1184 if (write_symbols == SDB_DEBUG && top_level
1185 /* Leave initialized global vars for end of compilation;
1186 see comment in compile_file. */
1187 && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0))
1188 sdbout_symbol (decl, 0);
1191 /* Don't output any DWARF debugging information for variables here.
1192 In the case of local variables, the information for them is output
1193 when we do our recursive traversal of the tree representation for
1194 the entire containing function. In the case of file-scope variables,
1195 we output information for all of them at the very end of compilation
1196 while we are doing our final traversal of the chain of file-scope
1199 /* If the debugging output changed sections, reselect the section
1200 that's supposed to be selected. */
1201 if (in_section != saved_in_section)
1203 /* Switch to the proper section for this data. */
1204 #ifdef SELECT_SECTION
1205 SELECT_SECTION (decl, reloc);
1207 if (TREE_READONLY (decl)
1208 && ! TREE_THIS_VOLATILE (decl)
1209 && DECL_INITIAL (decl)
1210 && (DECL_INITIAL (decl) == error_mark_node
1211 || TREE_CONSTANT (DECL_INITIAL (decl)))
1212 && ! (flag_pic && reloc))
1213 readonly_data_section ();
1219 /* Compute and output the alignment of this data. */
1221 align = DECL_ALIGN (decl);
1222 /* In the case for initialing an array whose length isn't specified,
1223 where we have not yet been able to do the layout,
1224 figure out the proper alignment now. */
1225 if (dont_output_data && DECL_SIZE (decl) == 0
1226 && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1227 align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl))));
1229 /* Some object file formats have a maximum alignment which they support.
1230 In particular, a.out format supports a maximum alignment of 4. */
1231 #ifndef MAX_OFILE_ALIGNMENT
1232 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1234 if (align > MAX_OFILE_ALIGNMENT)
1236 warning_with_decl (decl,
1237 "alignment of `%s' is greater than maximum object file alignment");
1238 align = MAX_OFILE_ALIGNMENT;
1240 #ifdef DATA_ALIGNMENT
1241 /* On some machines, it is good to increase alignment sometimes. */
1242 align = DATA_ALIGNMENT (TREE_TYPE (decl), align);
1244 #ifdef CONSTANT_ALIGNMENT
1245 if (DECL_INITIAL (decl))
1246 align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align);
1249 /* Reset the alignment in case we have made it tighter, so we can benefit
1250 from it in get_pointer_alignment. */
1251 DECL_ALIGN (decl) = align;
1253 if (align > BITS_PER_UNIT)
1255 if (output_bytecode)
1256 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1258 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
1261 /* Do any machine/system dependent processing of the object. */
1262 #ifdef ASM_DECLARE_OBJECT_NAME
1263 last_assemble_variable_decl = decl;
1264 ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
1266 /* Standard thing is just output label for the object. */
1267 if (output_bytecode)
1268 BC_OUTPUT_LABEL (asm_out_file, name);
1270 ASM_OUTPUT_LABEL (asm_out_file, name);
1271 #endif /* ASM_DECLARE_OBJECT_NAME */
1273 if (!dont_output_data)
1275 if (DECL_INITIAL (decl))
1276 /* Output the actual data. */
1277 output_constant (DECL_INITIAL (decl),
1278 int_size_in_bytes (TREE_TYPE (decl)));
1280 /* Leave space for it. */
1281 assemble_zeros (int_size_in_bytes (TREE_TYPE (decl)));
1285 #ifdef XCOFF_DEBUGGING_INFO
1286 /* Unfortunately, the IBM assembler cannot handle stabx before the actual
1287 declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted
1288 and `aa' hasn't been output yet, the assembler generates a stab entry with
1289 a value of zero, in addition to creating an unnecessary external entry
1290 for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */
1292 /* File-scope global variables are output here. */
1293 if (write_symbols == XCOFF_DEBUG && top_level)
1295 saved_in_section = in_section;
1297 dbxout_symbol (decl, 0);
1299 if (in_section != saved_in_section)
1301 /* Switch to the proper section for this data. */
1302 #ifdef SELECT_SECTION
1303 SELECT_SECTION (decl, reloc);
1305 if (TREE_READONLY (decl)
1306 && ! TREE_THIS_VOLATILE (decl)
1307 && DECL_INITIAL (decl)
1308 && (DECL_INITIAL (decl) == error_mark_node
1309 || TREE_CONSTANT (DECL_INITIAL (decl)))
1310 && ! (flag_pic && reloc))
1311 readonly_data_section ();
1318 /* There must be a statement after a label. */
1323 /* Return 1 if type TYPE contains any pointers. */
1326 contains_pointers_p (type)
1329 switch (TREE_CODE (type))
1332 case REFERENCE_TYPE:
1333 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1334 so I'll play safe and return 1. */
1340 case QUAL_UNION_TYPE:
1343 /* For a type that has fields, see if the fields have pointers. */
1344 for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields))
1345 if (TREE_CODE (fields) == FIELD_DECL
1346 && contains_pointers_p (TREE_TYPE (fields)))
1352 /* An array type contains pointers if its element type does. */
1353 return contains_pointers_p (TREE_TYPE (type));
1360 /* Output text storage for constructor CONSTR. Returns rtx of
1364 bc_output_constructor (constr)
1369 /* Must always be a literal; non-literal constructors are handled
1372 if (!TREE_CONSTANT (constr))
1379 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1381 BC_OUTPUT_ALIGN (asm_out_file, i);
1384 output_constant (constr, int_size_in_bytes (TREE_TYPE (constr)));
1388 /* Create storage for constructor CONSTR. */
1391 bc_output_data_constructor (constr)
1396 /* Put in data section */
1400 for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++);
1402 BC_OUTPUT_ALIGN (asm_out_file, i);
1404 /* The constructor is filled in at runtime. */
1405 BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr)));
1409 /* Output something to declare an external symbol to the assembler.
1410 (Most assemblers don't need this, so we normally output nothing.)
1411 Do nothing if DECL is not external. */
1414 assemble_external (decl)
1417 if (output_bytecode)
1420 #ifdef ASM_OUTPUT_EXTERNAL
1421 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd'
1422 && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
1424 rtx rtl = DECL_RTL (decl);
1426 if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF
1427 && ! SYMBOL_REF_USED (XEXP (rtl, 0)))
1429 /* Some systems do require some output. */
1430 SYMBOL_REF_USED (XEXP (rtl, 0)) = 1;
1431 ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0));
1437 /* Similar, for calling a library function FUN. */
1440 assemble_external_libcall (fun)
1443 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1444 if (!output_bytecode)
1446 /* Declare library function name external when first used, if nec. */
1447 if (! SYMBOL_REF_USED (fun))
1449 SYMBOL_REF_USED (fun) = 1;
1450 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun);
1456 /* Declare the label NAME global. */
1459 assemble_global (name)
1462 ASM_GLOBALIZE_LABEL (asm_out_file, name);
1465 /* Assemble a label named NAME. */
1468 assemble_label (name)
1471 if (output_bytecode)
1472 BC_OUTPUT_LABEL (asm_out_file, name);
1474 ASM_OUTPUT_LABEL (asm_out_file, name);
1477 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1478 If NAME starts with a *, the rest of NAME is output verbatim.
1479 Otherwise NAME is transformed in an implementation-defined way
1480 (usually by the addition of an underscore).
1481 Many macros in the tm file are defined to call this function. */
1484 assemble_name (file, name)
1490 STRIP_NAME_ENCODING (real_name, name);
1491 TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1;
1495 if (output_bytecode)
1496 bc_emit_labelref (name);
1498 fputs (&name[1], file);
1502 if (output_bytecode)
1503 BC_OUTPUT_LABELREF (file, name);
1505 ASM_OUTPUT_LABELREF (file, name);
1509 /* Allocate SIZE bytes writable static space with a gensym name
1510 and return an RTX to refer to its address. */
1513 assemble_static_space (size)
1519 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1520 so that each uninitialized object starts on such a boundary. */
1521 int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1)
1522 / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
1523 * (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
1526 if (flag_shared_data)
1530 ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno);
1533 namestring = (char *) obstack_alloc (saveable_obstack,
1535 strcpy (namestring, name);
1537 if (output_bytecode)
1538 x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0);
1540 x = gen_rtx (SYMBOL_REF, Pmode, namestring);
1542 if (output_bytecode)
1544 BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1548 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1549 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT);
1551 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
1557 /* Assemble the static constant template for function entry trampolines.
1558 This is done at most once per compilation.
1559 Returns an RTX for the address of the template. */
1562 assemble_trampoline_template ()
1568 /* Shouldn't get here */
1569 if (output_bytecode)
1572 /* By default, put trampoline templates in read-only data section. */
1574 #ifdef TRAMPOLINE_SECTION
1575 TRAMPOLINE_SECTION ();
1577 readonly_data_section ();
1580 /* Write the assembler code to define one. */
1581 align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT);
1583 ASM_OUTPUT_ALIGN (asm_out_file, align);
1585 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0);
1586 TRAMPOLINE_TEMPLATE (asm_out_file);
1588 /* Record the rtl to refer to it. */
1589 ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0);
1591 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
1592 return gen_rtx (SYMBOL_REF, Pmode, name);
1595 /* Assemble the integer constant X into an object of SIZE bytes.
1596 X must be either a CONST_INT or CONST_DOUBLE.
1598 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1599 non-zero, abort if we can't output the constant. */
1602 assemble_integer (x, size, force)
1607 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1608 ASM_OUTPUT... macros. */
1612 #ifdef ASM_OUTPUT_CHAR
1614 ASM_OUTPUT_CHAR (asm_out_file, x);
1618 #ifdef ASM_OUTPUT_SHORT
1620 ASM_OUTPUT_SHORT (asm_out_file, x);
1624 #ifdef ASM_OUTPUT_INT
1626 ASM_OUTPUT_INT (asm_out_file, x);
1630 #ifdef ASM_OUTPUT_DOUBLE_INT
1632 ASM_OUTPUT_DOUBLE_INT (asm_out_file, x);
1636 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1638 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x);
1643 /* If we couldn't do it that way, there are two other possibilities: First,
1644 if the machine can output an explicit byte and this is a 1 byte constant,
1645 we can use ASM_OUTPUT_BYTE. */
1647 #ifdef ASM_OUTPUT_BYTE
1648 if (size == 1 && GET_CODE (x) == CONST_INT)
1650 ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x));
1655 /* Finally, if SIZE is larger than a single word, try to output the constant
1656 one word at a time. */
1658 if (size > UNITS_PER_WORD)
1661 enum machine_mode mode
1662 = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0);
1665 for (i = 0; i < size / UNITS_PER_WORD; i++)
1667 word = operand_subword (x, i, 0, mode);
1672 if (! assemble_integer (word, UNITS_PER_WORD, 0))
1676 if (i == size / UNITS_PER_WORD)
1678 /* If we output at least one word and then could not finish,
1679 there is no valid way to continue. */
1690 /* Assemble the floating-point constant D into an object of size MODE. */
1693 assemble_real (d, mode)
1695 enum machine_mode mode;
1697 jmp_buf output_constant_handler;
1699 if (setjmp (output_constant_handler))
1701 error ("floating point trap outputting a constant");
1702 #ifdef REAL_IS_NOT_DOUBLE
1703 bzero ((char *) &d, sizeof d);
1710 set_float_handler (output_constant_handler);
1714 #ifdef ASM_OUTPUT_BYTE_FLOAT
1716 ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d);
1719 #ifdef ASM_OUTPUT_SHORT_FLOAT
1721 ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d);
1724 #ifdef ASM_OUTPUT_FLOAT
1726 ASM_OUTPUT_FLOAT (asm_out_file, d);
1730 #ifdef ASM_OUTPUT_DOUBLE
1732 ASM_OUTPUT_DOUBLE (asm_out_file, d);
1736 #ifdef ASM_OUTPUT_LONG_DOUBLE
1739 ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d);
1747 set_float_handler (NULL_PTR);
1750 /* Here we combine duplicate floating constants to make
1751 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1753 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
1754 They are chained through the CONST_DOUBLE_CHAIN.
1755 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
1756 In that case, CONST_DOUBLE_MEM is either a MEM,
1757 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet.
1759 (CONST_DOUBLE_MEM is used only for top-level functions.
1760 See force_const_mem for explanation.) */
1762 static rtx const_double_chain;
1764 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1765 For an integer, I0 is the low-order word and I1 is the high-order word.
1766 For a real number, I0 is the word with the low address
1767 and I1 is the word with the high address. */
1770 immed_double_const (i0, i1, mode)
1771 HOST_WIDE_INT i0, i1;
1772 enum machine_mode mode;
1775 int in_current_obstack;
1777 if (GET_MODE_CLASS (mode) == MODE_INT
1778 || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT)
1780 /* We clear out all bits that don't belong in MODE, unless they and our
1781 sign bit are all one. So we get either a reasonable negative value
1782 or a reasonable unsigned value for this mode. */
1783 int width = GET_MODE_BITSIZE (mode);
1784 if (width < HOST_BITS_PER_WIDE_INT
1785 && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1)))
1786 != ((HOST_WIDE_INT) (-1) << (width - 1))))
1787 i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0;
1788 else if (width == HOST_BITS_PER_WIDE_INT
1789 && ! (i1 == ~0 && i0 < 0))
1791 else if (width > 2 * HOST_BITS_PER_WIDE_INT)
1792 /* We cannot represent this value as a constant. */
1795 /* If this would be an entire word for the target, but is not for
1796 the host, then sign-extend on the host so that the number will look
1797 the same way on the host that it would on the target.
1799 For example, when building a 64 bit alpha hosted 32 bit sparc
1800 targeted compiler, then we want the 32 bit unsigned value -1 to be
1801 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1802 The later confuses the sparc backend. */
1804 if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width
1805 && (i0 & ((HOST_WIDE_INT) 1 << (width - 1))))
1806 i0 |= ((HOST_WIDE_INT) (-1) << width);
1808 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1810 ??? Strictly speaking, this is wrong if we create a CONST_INT
1811 for a large unsigned constant with the size of MODE being
1812 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1813 wider mode. In that case we will mis-interpret it as a negative
1816 Unfortunately, the only alternative is to make a CONST_DOUBLE
1817 for any constant in any mode if it is an unsigned constant larger
1818 than the maximum signed integer in an int on the host. However,
1819 doing this will break everyone that always expects to see a CONST_INT
1820 for SImode and smaller.
1822 We have always been making CONST_INTs in this case, so nothing new
1825 if (width <= HOST_BITS_PER_WIDE_INT)
1826 i1 = (i0 < 0) ? ~0 : 0;
1828 /* If this integer fits in one word, return a CONST_INT. */
1829 if ((i1 == 0 && i0 >= 0)
1830 || (i1 == ~0 && i0 < 0))
1831 return GEN_INT (i0);
1833 /* We use VOIDmode for integers. */
1837 /* Search the chain for an existing CONST_DOUBLE with the right value.
1838 If one is found, return it. */
1840 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1841 if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1
1842 && GET_MODE (r) == mode)
1845 /* No; make a new one and add it to the chain.
1847 We may be called by an optimizer which may be discarding any memory
1848 allocated during its processing (such as combine and loop). However,
1849 we will be leaving this constant on the chain, so we cannot tolerate
1850 freed memory. So switch to saveable_obstack for this allocation
1851 and then switch back if we were in current_obstack. */
1853 push_obstacks_nochange ();
1854 rtl_in_saveable_obstack ();
1855 r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1);
1858 /* Don't touch const_double_chain in nested function; see force_const_mem.
1859 Also, don't touch it if not inside any function. */
1860 if (outer_function_chain == 0 && current_function_decl != 0)
1862 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1863 const_double_chain = r;
1866 /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain.
1867 Actual use of mem-slot is only through force_const_mem. */
1869 CONST_DOUBLE_MEM (r) = const0_rtx;
1874 /* Return a CONST_DOUBLE for a specified `double' value
1875 and machine mode. */
1878 immed_real_const_1 (d, mode)
1880 enum machine_mode mode;
1882 union real_extract u;
1884 int in_current_obstack;
1886 /* Get the desired `double' value as a sequence of ints
1887 since that is how they are stored in a CONST_DOUBLE. */
1891 /* Detect special cases. */
1893 /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */
1894 if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d))
1895 return CONST0_RTX (mode);
1896 /* Check for NaN first, because some ports (specifically the i386) do not
1897 emit correct ieee-fp code by default, and thus will generate a core
1898 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1899 does a floating point comparison. */
1900 else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d))
1901 return CONST1_RTX (mode);
1903 if (sizeof u == 2 * sizeof (HOST_WIDE_INT))
1904 return immed_double_const (u.i[0], u.i[1], mode);
1906 /* The rest of this function handles the case where
1907 a float value requires more than 2 ints of space.
1908 It will be deleted as dead code on machines that don't need it. */
1910 /* Search the chain for an existing CONST_DOUBLE with the right value.
1911 If one is found, return it. */
1913 for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r))
1914 if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u)
1915 && GET_MODE (r) == mode)
1918 /* No; make a new one and add it to the chain.
1920 We may be called by an optimizer which may be discarding any memory
1921 allocated during its processing (such as combine and loop). However,
1922 we will be leaving this constant on the chain, so we cannot tolerate
1923 freed memory. So switch to saveable_obstack for this allocation
1924 and then switch back if we were in current_obstack. */
1926 push_obstacks_nochange ();
1927 rtl_in_saveable_obstack ();
1928 r = rtx_alloc (CONST_DOUBLE);
1930 bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u);
1933 /* Don't touch const_double_chain in nested function; see force_const_mem.
1934 Also, don't touch it if not inside any function. */
1935 if (outer_function_chain == 0 && current_function_decl != 0)
1937 CONST_DOUBLE_CHAIN (r) = const_double_chain;
1938 const_double_chain = r;
1941 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
1942 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
1943 is only through force_const_mem. */
1945 CONST_DOUBLE_MEM (r) = const0_rtx;
1950 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
1951 which must be a REAL_CST tree node. */
1954 immed_real_const (exp)
1957 return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)));
1960 /* At the end of a function, forget the memory-constants
1961 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
1962 Also clear out real_constant_chain and clear out all the chain-pointers. */
1965 clear_const_double_mem ()
1967 register rtx r, next;
1969 /* Don't touch CONST_DOUBLE_MEM for nested functions.
1970 See force_const_mem for explanation. */
1971 if (outer_function_chain != 0)
1974 for (r = const_double_chain; r; r = next)
1976 next = CONST_DOUBLE_CHAIN (r);
1977 CONST_DOUBLE_CHAIN (r) = 0;
1978 CONST_DOUBLE_MEM (r) = cc0_rtx;
1980 const_double_chain = 0;
1983 /* Given an expression EXP with a constant value,
1984 reduce it to the sum of an assembler symbol and an integer.
1985 Store them both in the structure *VALUE.
1986 Abort if EXP does not reduce. */
1991 HOST_WIDE_INT offset;
1995 decode_addr_const (exp, value)
1997 struct addr_const *value;
1999 register tree target = TREE_OPERAND (exp, 0);
2000 register int offset = 0;
2005 if (TREE_CODE (target) == COMPONENT_REF
2006 && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1)))
2009 offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT;
2010 target = TREE_OPERAND (target, 0);
2012 else if (TREE_CODE (target) == ARRAY_REF)
2014 if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST
2015 || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST)
2017 offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target)))
2018 * TREE_INT_CST_LOW (TREE_OPERAND (target, 1)))
2020 target = TREE_OPERAND (target, 0);
2026 switch (TREE_CODE (target))
2030 x = DECL_RTL (target);
2034 if (output_bytecode)
2035 /* FIXME: this may not be correct, check it */
2036 x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0);
2038 x = gen_rtx (MEM, FUNCTION_MODE,
2039 gen_rtx (LABEL_REF, VOIDmode,
2040 label_rtx (TREE_OPERAND (exp, 0))));
2047 x = TREE_CST_RTL (target);
2054 if (!output_bytecode)
2056 if (GET_CODE (x) != MEM)
2062 value->offset = offset;
2065 /* Uniquize all constants that appear in memory.
2066 Each constant in memory thus far output is recorded
2067 in `const_hash_table' with a `struct constant_descriptor'
2068 that contains a polish representation of the value of
2071 We cannot store the trees in the hash table
2072 because the trees may be temporary. */
2074 struct constant_descriptor
2076 struct constant_descriptor *next;
2082 #define MAX_HASH_TABLE 1009
2083 static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE];
2085 /* Compute a hash code for a constant expression. */
2092 register int len, hi, i;
2093 register enum tree_code code = TREE_CODE (exp);
2095 if (code == INTEGER_CST)
2097 p = (char *) &TREE_INT_CST_LOW (exp);
2098 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2100 else if (code == REAL_CST)
2102 p = (char *) &TREE_REAL_CST (exp);
2103 len = sizeof TREE_REAL_CST (exp);
2105 else if (code == STRING_CST)
2106 p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp);
2107 else if (code == COMPLEX_CST)
2108 return const_hash (TREE_REALPART (exp)) * 5
2109 + const_hash (TREE_IMAGPART (exp));
2110 else if (code == CONSTRUCTOR)
2114 /* For record type, include the type in the hashing.
2115 We do not do so for array types
2116 because (1) the sizes of the elements are sufficient
2117 and (2) distinct array types can have the same constructor.
2118 Instead, we include the array size because the constructor could
2120 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2121 hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1))
2124 hi = ((5 + int_size_in_bytes (TREE_TYPE (exp)))
2125 & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE;
2127 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2128 if (TREE_VALUE (link))
2129 hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE;
2133 else if (code == ADDR_EXPR)
2135 struct addr_const value;
2136 decode_addr_const (exp, &value);
2137 if (GET_CODE (value.base) == SYMBOL_REF)
2139 /* Don't hash the address of the SYMBOL_REF;
2140 only use the offset and the symbol name. */
2142 p = XSTR (value.base, 0);
2143 for (i = 0; p[i] != 0; i++)
2144 hi = ((hi * 613) + (unsigned)(p[i]));
2146 else if (GET_CODE (value.base) == LABEL_REF)
2147 hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
2149 hi &= (1 << HASHBITS) - 1;
2150 hi %= MAX_HASH_TABLE;
2153 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2154 return const_hash (TREE_OPERAND (exp, 0)) * 9
2155 + const_hash (TREE_OPERAND (exp, 1));
2156 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2157 return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2;
2159 /* Compute hashing function */
2161 for (i = 0; i < len; i++)
2162 hi = ((hi * 613) + (unsigned)(p[i]));
2164 hi &= (1 << HASHBITS) - 1;
2165 hi %= MAX_HASH_TABLE;
2169 /* Compare a constant expression EXP with a constant-descriptor DESC.
2170 Return 1 if DESC describes a constant with the same value as EXP. */
2173 compare_constant (exp, desc)
2175 struct constant_descriptor *desc;
2177 return 0 != compare_constant_1 (exp, desc->contents);
2180 /* Compare constant expression EXP with a substring P of a constant descriptor.
2181 If they match, return a pointer to the end of the substring matched.
2182 If they do not match, return 0.
2184 Since descriptors are written in polish prefix notation,
2185 this function can be used recursively to test one operand of EXP
2186 against a subdescriptor, and if it succeeds it returns the
2187 address of the subdescriptor for the next operand. */
2190 compare_constant_1 (exp, p)
2194 register char *strp;
2196 register enum tree_code code = TREE_CODE (exp);
2198 if (code != (enum tree_code) *p++)
2201 if (code == INTEGER_CST)
2203 /* Integer constants are the same only if the same width of type. */
2204 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2206 strp = (char *) &TREE_INT_CST_LOW (exp);
2207 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2209 else if (code == REAL_CST)
2211 /* Real constants are the same only if the same width of type. */
2212 if (*p++ != TYPE_PRECISION (TREE_TYPE (exp)))
2214 strp = (char *) &TREE_REAL_CST (exp);
2215 len = sizeof TREE_REAL_CST (exp);
2217 else if (code == STRING_CST)
2219 if (flag_writable_strings)
2221 strp = TREE_STRING_POINTER (exp);
2222 len = TREE_STRING_LENGTH (exp);
2223 if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p,
2224 sizeof TREE_STRING_LENGTH (exp)))
2226 p += sizeof TREE_STRING_LENGTH (exp);
2228 else if (code == COMPLEX_CST)
2230 p = compare_constant_1 (TREE_REALPART (exp), p);
2231 if (p == 0) return 0;
2232 p = compare_constant_1 (TREE_IMAGPART (exp), p);
2235 else if (code == CONSTRUCTOR)
2238 int length = list_length (CONSTRUCTOR_ELTS (exp));
2241 if (bcmp ((char *) &length, p, sizeof length))
2245 /* For record constructors, insist that the types match.
2246 For arrays, just verify both constructors are for arrays. */
2247 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2248 type = TREE_TYPE (exp);
2251 if (bcmp ((char *) &type, p, sizeof type))
2255 /* For arrays, insist that the size in bytes match. */
2256 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2258 int size = int_size_in_bytes (TREE_TYPE (exp));
2259 if (bcmp ((char *) &size, p, sizeof size))
2264 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2266 if (TREE_VALUE (link))
2268 if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0)
2275 if (bcmp ((char *) &zero, p, sizeof zero))
2283 else if (code == ADDR_EXPR)
2285 struct addr_const value;
2286 decode_addr_const (exp, &value);
2287 strp = (char *) &value.offset;
2288 len = sizeof value.offset;
2289 /* Compare the offset. */
2291 if (*p++ != *strp++)
2293 /* Compare symbol name. */
2294 strp = XSTR (value.base, 0);
2295 len = strlen (strp) + 1;
2297 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2299 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2300 if (p == 0) return 0;
2301 p = compare_constant_1 (TREE_OPERAND (exp, 1), p);
2304 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2306 p = compare_constant_1 (TREE_OPERAND (exp, 0), p);
2310 /* Compare constant contents. */
2312 if (*p++ != *strp++)
2318 /* Construct a constant descriptor for the expression EXP.
2319 It is up to the caller to enter the descriptor in the hash table. */
2321 static struct constant_descriptor *
2322 record_constant (exp)
2325 struct constant_descriptor *next = 0;
2328 /* Make a struct constant_descriptor. The first two pointers will
2329 be filled in later. Here we just leave space for them. */
2331 obstack_grow (&permanent_obstack, (char *) &next, sizeof next);
2332 obstack_grow (&permanent_obstack, (char *) &label, sizeof label);
2333 record_constant_1 (exp);
2334 return (struct constant_descriptor *) obstack_finish (&permanent_obstack);
2337 /* Add a description of constant expression EXP
2338 to the object growing in `permanent_obstack'.
2339 No need to return its address; the caller will get that
2340 from the obstack when the object is complete. */
2343 record_constant_1 (exp)
2346 register char *strp;
2348 register enum tree_code code = TREE_CODE (exp);
2350 obstack_1grow (&permanent_obstack, (unsigned int) code);
2352 if (code == INTEGER_CST)
2354 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2355 strp = (char *) &TREE_INT_CST_LOW (exp);
2356 len = 2 * sizeof TREE_INT_CST_LOW (exp);
2358 else if (code == REAL_CST)
2360 obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp)));
2361 strp = (char *) &TREE_REAL_CST (exp);
2362 len = sizeof TREE_REAL_CST (exp);
2364 else if (code == STRING_CST)
2366 if (flag_writable_strings)
2368 strp = TREE_STRING_POINTER (exp);
2369 len = TREE_STRING_LENGTH (exp);
2370 obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp),
2371 sizeof TREE_STRING_LENGTH (exp));
2373 else if (code == COMPLEX_CST)
2375 record_constant_1 (TREE_REALPART (exp));
2376 record_constant_1 (TREE_IMAGPART (exp));
2379 else if (code == CONSTRUCTOR)
2382 int length = list_length (CONSTRUCTOR_ELTS (exp));
2385 obstack_grow (&permanent_obstack, (char *) &length, sizeof length);
2387 /* For record constructors, insist that the types match.
2388 For arrays, just verify both constructors are for arrays. */
2389 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
2390 type = TREE_TYPE (exp);
2393 obstack_grow (&permanent_obstack, (char *) &type, sizeof type);
2395 /* For arrays, insist that the size in bytes match. */
2396 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
2398 int size = int_size_in_bytes (TREE_TYPE (exp));
2399 obstack_grow (&permanent_obstack, (char *) &size, sizeof size);
2402 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
2404 if (TREE_VALUE (link))
2405 record_constant_1 (TREE_VALUE (link));
2410 obstack_grow (&permanent_obstack, (char *) &zero, sizeof zero);
2416 else if (code == ADDR_EXPR)
2418 struct addr_const value;
2419 decode_addr_const (exp, &value);
2420 /* Record the offset. */
2421 obstack_grow (&permanent_obstack,
2422 (char *) &value.offset, sizeof value.offset);
2423 /* Record the symbol name. */
2424 obstack_grow (&permanent_obstack, XSTR (value.base, 0),
2425 strlen (XSTR (value.base, 0)) + 1);
2428 else if (code == PLUS_EXPR || code == MINUS_EXPR)
2430 record_constant_1 (TREE_OPERAND (exp, 0));
2431 record_constant_1 (TREE_OPERAND (exp, 1));
2434 else if (code == NOP_EXPR || code == CONVERT_EXPR)
2436 record_constant_1 (TREE_OPERAND (exp, 0));
2440 /* Record constant contents. */
2441 obstack_grow (&permanent_obstack, strp, len);
2444 /* Record a list of constant expressions that were passed to
2445 output_constant_def but that could not be output right away. */
2447 struct deferred_constant
2449 struct deferred_constant *next;
2455 static struct deferred_constant *deferred_constants;
2457 /* Nonzero means defer output of addressed subconstants
2458 (i.e., those for which output_constant_def is called.) */
2459 static int defer_addressed_constants_flag;
2461 /* Start deferring output of subconstants. */
2464 defer_addressed_constants ()
2466 defer_addressed_constants_flag++;
2469 /* Stop deferring output of subconstants,
2470 and output now all those that have been deferred. */
2473 output_deferred_addressed_constants ()
2475 struct deferred_constant *p, *next;
2477 defer_addressed_constants_flag--;
2479 if (defer_addressed_constants_flag > 0)
2482 for (p = deferred_constants; p; p = next)
2484 output_constant_def_contents (p->exp, p->reloc, p->labelno);
2489 deferred_constants = 0;
2492 /* Make a copy of the whole tree structure for a constant.
2493 This handles the same types of nodes that compare_constant
2494 and record_constant handle. */
2500 switch (TREE_CODE (exp))
2506 /* For ADDR_EXPR, we do not want to copy the decl
2507 whose address is requested. */
2508 return copy_node (exp);
2511 return build_complex (copy_constant (TREE_REALPART (exp)),
2512 copy_constant (TREE_IMAGPART (exp)));
2516 return build (TREE_CODE (exp), TREE_TYPE (exp),
2517 copy_constant (TREE_OPERAND (exp, 0)),
2518 copy_constant (TREE_OPERAND (exp, 1)));
2522 return build1 (TREE_CODE (exp), TREE_TYPE (exp),
2523 copy_constant (TREE_OPERAND (exp, 0)));
2527 tree copy = copy_node (exp);
2528 tree list = copy_list (CONSTRUCTOR_ELTS (exp));
2531 CONSTRUCTOR_ELTS (copy) = list;
2532 for (tail = list; tail; tail = TREE_CHAIN (tail))
2533 TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail));
2543 /* Return an rtx representing a reference to constant data in memory
2544 for the constant expression EXP.
2546 If assembler code for such a constant has already been output,
2547 return an rtx to refer to it.
2548 Otherwise, output such a constant in memory (or defer it for later)
2549 and generate an rtx for it.
2551 The TREE_CST_RTL of EXP is set up to point to that rtx.
2552 The const_hash_table records which constants already have label strings. */
2555 output_constant_def (exp)
2559 register struct constant_descriptor *desc;
2565 if (TREE_CODE (exp) == INTEGER_CST)
2566 abort (); /* No TREE_CST_RTL slot in these. */
2568 if (TREE_CST_RTL (exp))
2569 return TREE_CST_RTL (exp);
2571 /* Make sure any other constants whose addresses appear in EXP
2572 are assigned label numbers. */
2574 reloc = output_addressed_constants (exp);
2576 /* Compute hash code of EXP. Search the descriptors for that hash code
2577 to see if any of them describes EXP. If yes, the descriptor records
2578 the label number already assigned. */
2580 hash = const_hash (exp) % MAX_HASH_TABLE;
2582 for (desc = const_hash_table[hash]; desc; desc = desc->next)
2583 if (compare_constant (exp, desc))
2585 found = desc->label;
2591 /* No constant equal to EXP is known to have been output.
2592 Make a constant descriptor to enter EXP in the hash table.
2593 Assign the label number and record it in the descriptor for
2594 future calls to this function to find. */
2596 /* Create a string containing the label name, in LABEL. */
2597 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2599 desc = record_constant (exp);
2600 desc->next = const_hash_table[hash];
2602 = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label));
2603 const_hash_table[hash] = desc;
2607 /* Create a string containing the label name, in LABEL. */
2608 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
2611 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
2613 push_obstacks_nochange ();
2614 if (TREE_PERMANENT (exp))
2615 end_temporary_allocation ();
2617 def = gen_rtx (SYMBOL_REF, Pmode, desc->label);
2620 = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def);
2621 RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1;
2622 if (AGGREGATE_TYPE_P (TREE_TYPE (exp)))
2623 MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1;
2627 /* Optionally set flags or add text to the name to record information
2628 such as that it is a function name. If the name is changed, the macro
2629 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
2630 #ifdef ENCODE_SECTION_INFO
2631 ENCODE_SECTION_INFO (exp);
2634 /* If this is the first time we've seen this particular constant,
2635 output it (or defer its output for later). */
2638 if (defer_addressed_constants_flag)
2640 struct deferred_constant *p;
2641 p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant));
2643 push_obstacks_nochange ();
2644 suspend_momentary ();
2645 p->exp = copy_constant (exp);
2648 p->labelno = const_labelno++;
2649 p->next = deferred_constants;
2650 deferred_constants = p;
2653 output_constant_def_contents (exp, reloc, const_labelno++);
2656 return TREE_CST_RTL (exp);
2659 /* Now output assembler code to define the label for EXP,
2660 and follow it with the data of EXP. */
2663 output_constant_def_contents (exp, reloc, labelno)
2670 if (IN_NAMED_SECTION (exp))
2671 named_section (TREE_STRING_POINTER (DECL_SECTION_NAME (exp)));
2674 /* First switch to text section, except for writable strings. */
2675 #ifdef SELECT_SECTION
2676 SELECT_SECTION (exp, reloc);
2678 if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings)
2679 || (flag_pic && reloc))
2682 readonly_data_section ();
2686 /* Align the location counter as required by EXP's data type. */
2687 align = TYPE_ALIGN (TREE_TYPE (exp));
2688 #ifdef CONSTANT_ALIGNMENT
2689 align = CONSTANT_ALIGNMENT (exp, align);
2692 if (align > BITS_PER_UNIT)
2694 if (!output_bytecode)
2696 ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2700 BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
2704 /* Output the label itself. */
2705 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno);
2707 /* Output the value of EXP. */
2708 output_constant (exp,
2709 (TREE_CODE (exp) == STRING_CST
2710 ? TREE_STRING_LENGTH (exp)
2711 : int_size_in_bytes (TREE_TYPE (exp))));
2715 /* Similar hash facility for making memory-constants
2716 from constant rtl-expressions. It is used on RISC machines
2717 where immediate integer arguments and constant addresses are restricted
2718 so that such constants must be stored in memory.
2720 This pool of constants is reinitialized for each function
2721 so each function gets its own constants-pool that comes right before it.
2723 All structures allocated here are discarded when functions are saved for
2724 inlining, so they do not need to be allocated permanently. */
2726 #define MAX_RTX_HASH_TABLE 61
2727 static struct constant_descriptor **const_rtx_hash_table;
2729 /* Structure to represent sufficient information about a constant so that
2730 it can be output when the constant pool is output, so that function
2731 integration can be done, and to simplify handling on machines that reference
2732 constant pool as base+displacement. */
2734 struct pool_constant
2736 struct constant_descriptor *desc;
2737 struct pool_constant *next;
2738 enum machine_mode mode;
2745 /* Pointers to first and last constant in pool. */
2747 static struct pool_constant *first_pool, *last_pool;
2749 /* Current offset in constant pool (does not include any machine-specific
2752 static int pool_offset;
2754 /* Structure used to maintain hash table mapping symbols used to their
2755 corresponding constants. */
2760 struct pool_constant *pool;
2761 struct pool_sym *next;
2764 static struct pool_sym **const_rtx_sym_hash_table;
2766 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
2767 The argument is XSTR (... , 0) */
2769 #define SYMHASH(LABEL) \
2770 ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
2772 /* Initialize constant pool hashing for next function. */
2775 init_const_rtx_hash_table ()
2777 const_rtx_hash_table
2778 = ((struct constant_descriptor **)
2779 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)));
2780 const_rtx_sym_hash_table
2781 = ((struct pool_sym **)
2782 oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)));
2783 bzero ((char *) const_rtx_hash_table,
2784 MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *));
2785 bzero ((char *) const_rtx_sym_hash_table,
2786 MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *));
2788 first_pool = last_pool = 0;
2792 /* Save and restore it for a nested function. */
2795 save_varasm_status (p)
2798 p->const_rtx_hash_table = const_rtx_hash_table;
2799 p->const_rtx_sym_hash_table = const_rtx_sym_hash_table;
2800 p->first_pool = first_pool;
2801 p->last_pool = last_pool;
2802 p->pool_offset = pool_offset;
2806 restore_varasm_status (p)
2809 const_rtx_hash_table = p->const_rtx_hash_table;
2810 const_rtx_sym_hash_table = p->const_rtx_sym_hash_table;
2811 first_pool = p->first_pool;
2812 last_pool = p->last_pool;
2813 pool_offset = p->pool_offset;
2816 enum kind { RTX_DOUBLE, RTX_INT };
2820 #ifdef ONLY_INT_FIELDS
2821 unsigned int kind : 16;
2822 unsigned int mode : 16;
2824 enum kind kind : 16;
2825 enum machine_mode mode : 16;
2828 union real_extract du;
2829 struct addr_const addr;
2833 /* Express an rtx for a constant integer (perhaps symbolic)
2834 as the sum of a symbol or label plus an explicit integer.
2835 They are stored into VALUE. */
2838 decode_rtx_const (mode, x, value)
2839 enum machine_mode mode;
2841 struct rtx_const *value;
2843 /* Clear the whole structure, including any gaps. */
2846 int *p = (int *) value;
2847 int *end = (int *) (value + 1);
2852 value->kind = RTX_INT; /* Most usual kind. */
2855 switch (GET_CODE (x))
2858 value->kind = RTX_DOUBLE;
2859 if (GET_MODE (x) != VOIDmode)
2860 value->mode = GET_MODE (x);
2861 bcopy ((char *) &CONST_DOUBLE_LOW (x),
2862 (char *) &value->un.du, sizeof value->un.du);
2866 value->un.addr.offset = INTVAL (x);
2872 value->un.addr.base = x;
2877 if (GET_CODE (x) == PLUS)
2879 value->un.addr.base = XEXP (x, 0);
2880 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
2882 value->un.addr.offset = INTVAL (XEXP (x, 1));
2884 else if (GET_CODE (x) == MINUS)
2886 value->un.addr.base = XEXP (x, 0);
2887 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
2889 value->un.addr.offset = - INTVAL (XEXP (x, 1));
2899 if (value->kind == RTX_INT && value->un.addr.base != 0)
2900 switch (GET_CODE (value->un.addr.base))
2904 /* Use the string's address, not the SYMBOL_REF's address,
2905 for the sake of addresses of library routines.
2906 For a LABEL_REF, compare labels. */
2907 value->un.addr.base = XEXP (value->un.addr.base, 0);
2911 /* Given a MINUS expression, simplify it if both sides
2912 include the same symbol. */
2915 simplify_subtraction (x)
2918 struct rtx_const val0, val1;
2920 decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0);
2921 decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1);
2923 if (val0.un.addr.base == val1.un.addr.base)
2924 return GEN_INT (val0.un.addr.offset - val1.un.addr.offset);
2928 /* Compute a hash code for a constant RTL expression. */
2931 const_hash_rtx (mode, x)
2932 enum machine_mode mode;
2937 struct rtx_const value;
2938 decode_rtx_const (mode, x, &value);
2940 /* Compute hashing function */
2942 for (i = 0; i < sizeof value / sizeof (int); i++)
2943 hi += ((int *) &value)[i];
2945 hi &= (1 << HASHBITS) - 1;
2946 hi %= MAX_RTX_HASH_TABLE;
2950 /* Compare a constant rtl object X with a constant-descriptor DESC.
2951 Return 1 if DESC describes a constant with the same value as X. */
2954 compare_constant_rtx (mode, x, desc)
2955 enum machine_mode mode;
2957 struct constant_descriptor *desc;
2959 register int *p = (int *) desc->contents;
2962 struct rtx_const value;
2964 decode_rtx_const (mode, x, &value);
2965 strp = (int *) &value;
2966 len = sizeof value / sizeof (int);
2968 /* Compare constant contents. */
2970 if (*p++ != *strp++)
2976 /* Construct a constant descriptor for the rtl-expression X.
2977 It is up to the caller to enter the descriptor in the hash table. */
2979 static struct constant_descriptor *
2980 record_constant_rtx (mode, x)
2981 enum machine_mode mode;
2984 struct constant_descriptor *ptr;
2986 struct rtx_const value;
2988 decode_rtx_const (mode, x, &value);
2990 obstack_grow (current_obstack, &ptr, sizeof ptr);
2991 obstack_grow (current_obstack, &label, sizeof label);
2993 /* Record constant contents. */
2994 obstack_grow (current_obstack, &value, sizeof value);
2996 return (struct constant_descriptor *) obstack_finish (current_obstack);
2999 /* Given a constant rtx X, make (or find) a memory constant for its value
3000 and return a MEM rtx to refer to it in memory. */
3003 force_const_mem (mode, x)
3004 enum machine_mode mode;
3008 register struct constant_descriptor *desc;
3013 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3014 (this will always be true for floating CONST_DOUBLEs that have been
3015 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3016 use the previous copy. Otherwise, make a new one. Note that in
3017 the unlikely event that this same CONST_DOUBLE is used in two different
3018 modes in an alternating fashion, we will allocate a lot of different
3019 memory locations, but this should be extremely rare. */
3021 /* Don't use CONST_DOUBLE_MEM in a nested function.
3022 Nested functions have their own constant pools,
3023 so they can't share the same values in CONST_DOUBLE_MEM
3024 with the containing function. */
3025 if (outer_function_chain == 0)
3026 if (GET_CODE (x) == CONST_DOUBLE
3027 && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM
3028 && GET_MODE (CONST_DOUBLE_MEM (x)) == mode)
3029 return CONST_DOUBLE_MEM (x);
3031 /* Compute hash code of X. Search the descriptors for that hash code
3032 to see if any of them describes X. If yes, the descriptor records
3033 the label number already assigned. */
3035 hash = const_hash_rtx (mode, x);
3037 for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next)
3038 if (compare_constant_rtx (mode, x, desc))
3040 found = desc->label;
3046 register struct pool_constant *pool;
3047 register struct pool_sym *sym;
3050 /* No constant equal to X is known to have been output.
3051 Make a constant descriptor to enter X in the hash table.
3052 Assign the label number and record it in the descriptor for
3053 future calls to this function to find. */
3055 desc = record_constant_rtx (mode, x);
3056 desc->next = const_rtx_hash_table[hash];
3057 const_rtx_hash_table[hash] = desc;
3059 /* Align the location counter as required by EXP's data type. */
3060 align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode);
3061 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
3062 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
3064 pool_offset += align - 1;
3065 pool_offset &= ~ (align - 1);
3067 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3069 pool = (struct pool_constant *) oballoc (sizeof (struct pool_constant));
3073 pool->labelno = const_labelno;
3074 pool->align = align;
3075 pool->offset = pool_offset;
3081 last_pool->next = pool;
3084 pool_offset += GET_MODE_SIZE (mode);
3086 /* Create a string containing the label name, in LABEL. */
3087 ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
3092 = (char *) obstack_copy0 (saveable_obstack, label, strlen (label));
3094 /* Add label to symbol hash table. */
3095 hash = SYMHASH (found);
3096 sym = (struct pool_sym *) oballoc (sizeof (struct pool_sym));
3099 sym->next = const_rtx_sym_hash_table[hash];
3100 const_rtx_sym_hash_table[hash] = sym;
3103 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3105 def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found));
3107 RTX_UNCHANGING_P (def) = 1;
3108 /* Mark the symbol_ref as belonging to this constants pool. */
3109 CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1;
3110 current_function_uses_const_pool = 1;
3112 if (outer_function_chain == 0)
3113 if (GET_CODE (x) == CONST_DOUBLE)
3115 if (CONST_DOUBLE_MEM (x) == cc0_rtx)
3117 CONST_DOUBLE_CHAIN (x) = const_double_chain;
3118 const_double_chain = x;
3120 CONST_DOUBLE_MEM (x) = def;
3126 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3127 the corresponding pool_constant structure. */
3129 static struct pool_constant *
3130 find_pool_constant (addr)
3133 struct pool_sym *sym;
3134 char *label = XSTR (addr, 0);
3136 for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next)
3137 if (sym->label == label)
3143 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3146 get_pool_constant (addr)
3149 return (find_pool_constant (addr))->constant;
3152 /* Similar, return the mode. */
3155 get_pool_mode (addr)
3158 return (find_pool_constant (addr))->mode;
3161 /* Similar, return the offset in the constant pool. */
3164 get_pool_offset (addr)
3167 return (find_pool_constant (addr))->offset;
3170 /* Return the size of the constant pool. */
3178 /* Write all the constants in the constant pool. */
3181 output_constant_pool (fnname, fndecl)
3185 struct pool_constant *pool;
3187 union real_extract u;
3189 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3190 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset);
3193 for (pool = first_pool; pool; pool = pool->next)
3197 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3198 whose CODE_LABEL has been deleted. This can occur if a jump table
3199 is eliminated by optimization. If so, write a constant of zero
3200 instead. Note that this can also happen by turning the
3201 CODE_LABEL into a NOTE. */
3202 if (((GET_CODE (x) == LABEL_REF
3203 && (INSN_DELETED_P (XEXP (x, 0))
3204 || GET_CODE (XEXP (x, 0)) == NOTE)))
3205 || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS
3206 && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF
3207 && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0))
3208 || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE)))
3211 /* First switch to correct section. */
3212 #ifdef SELECT_RTX_SECTION
3213 SELECT_RTX_SECTION (pool->mode, x);
3215 readonly_data_section ();
3218 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3219 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode,
3220 pool->align, pool->labelno, done);
3223 if (pool->align > 1)
3224 ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align));
3226 /* Output the label. */
3227 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno);
3229 /* Output the value of the constant itself. */
3230 switch (GET_MODE_CLASS (pool->mode))
3233 if (GET_CODE (x) != CONST_DOUBLE)
3236 bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u);
3237 assemble_real (u.d, pool->mode);
3241 case MODE_PARTIAL_INT:
3242 assemble_integer (x, GET_MODE_SIZE (pool->mode), 1);
3252 /* Done with this pool. */
3253 first_pool = last_pool = 0;
3256 /* Find all the constants whose addresses are referenced inside of EXP,
3257 and make sure assembler code with a label has been output for each one.
3258 Indicate whether an ADDR_EXPR has been encountered. */
3261 output_addressed_constants (exp)
3266 switch (TREE_CODE (exp))
3270 register tree constant = TREE_OPERAND (exp, 0);
3272 while (TREE_CODE (constant) == COMPONENT_REF)
3274 constant = TREE_OPERAND (constant, 0);
3277 if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c'
3278 || TREE_CODE (constant) == CONSTRUCTOR)
3279 /* No need to do anything here
3280 for addresses of variables or functions. */
3281 output_constant_def (constant);
3288 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3289 reloc |= output_addressed_constants (TREE_OPERAND (exp, 1));
3294 case NON_LVALUE_EXPR:
3295 reloc = output_addressed_constants (TREE_OPERAND (exp, 0));
3301 for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link))
3302 if (TREE_VALUE (link) != 0)
3303 reloc |= output_addressed_constants (TREE_VALUE (link));
3314 /* Output assembler for byte constant */
3316 output_byte_asm (byte)
3319 if (output_bytecode)
3320 bc_emit_const ((char *) &byte, sizeof (char));
3321 #ifdef ASM_OUTPUT_BYTE
3324 ASM_OUTPUT_BYTE (asm_out_file, byte);
3329 /* Output assembler code for constant EXP to FILE, with no label.
3330 This includes the pseudo-op such as ".int" or ".byte", and a newline.
3331 Assumes output_addressed_constants has been done on EXP already.
3333 Generate exactly SIZE bytes of assembler data, padding at the end
3334 with zeros if necessary. SIZE must always be specified.
3336 SIZE is important for structure constructors,
3337 since trailing members may have been omitted from the constructor.
3338 It is also important for initialization of arrays from string constants
3339 since the full length of the string constant might not be wanted.
3340 It is also needed for initialization of unions, where the initializer's
3341 type is just one member, and that may not be as long as the union.
3343 There a case in which we would fail to output exactly SIZE bytes:
3344 for a structure constructor that wants to produce more than SIZE bytes.
3345 But such constructors will never be generated for any possible input. */
3348 output_constant (exp, size)
3352 register enum tree_code code = TREE_CODE (TREE_TYPE (exp));
3358 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
3359 That way we get the constant (we hope) inside it. Also, strip
3360 off any NOP_EXPR that converts between two record or union types. */
3361 while ((TREE_CODE (exp) == NOP_EXPR
3362 && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0))
3363 || TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3364 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE
3365 || TREE_CODE (TREE_TYPE (exp)) == QUAL_UNION_TYPE))
3366 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3367 exp = TREE_OPERAND (exp, 0);
3369 /* Allow a constructor with no elements for any data type.
3370 This means to fill the space with zeros. */
3371 if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0)
3373 if (output_bytecode)
3374 bc_emit_const_skip (size);
3376 assemble_zeros (size);
3387 case REFERENCE_TYPE:
3388 /* ??? What about (int)((float)(int)&foo + 4) */
3389 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
3390 || TREE_CODE (exp) == NON_LVALUE_EXPR)
3391 exp = TREE_OPERAND (exp, 0);
3393 if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
3394 EXPAND_INITIALIZER),
3396 error ("initializer for integer value is too complicated");
3401 if (TREE_CODE (exp) != REAL_CST)
3402 error ("initializer for floating value is not a floating constant");
3404 assemble_real (TREE_REAL_CST (exp),
3405 mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0));
3410 output_constant (TREE_REALPART (exp), size / 2);
3411 output_constant (TREE_IMAGPART (exp), size / 2);
3412 size -= (size / 2) * 2;
3416 if (TREE_CODE (exp) == CONSTRUCTOR)
3418 output_constructor (exp, size);
3421 else if (TREE_CODE (exp) == STRING_CST)
3425 if (size > TREE_STRING_LENGTH (exp))
3427 excess = size - TREE_STRING_LENGTH (exp);
3428 size = TREE_STRING_LENGTH (exp);
3431 assemble_string (TREE_STRING_POINTER (exp), size);
3440 if (TREE_CODE (exp) == CONSTRUCTOR)
3441 output_constructor (exp, size);
3448 assemble_zeros (size);
3452 /* Bytecode specific code to output assembler for integer. */
3454 bc_assemble_integer (exp, size)
3462 /* FIXME: is this fold() business going to be as good as the
3463 expand_expr() using EXPAND_SUM above in the RTL case? I
3465 FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */
3469 while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR)
3470 exp = TREE_OPERAND (exp, 0);
3471 if (TREE_CODE (exp) == INTEGER_CST)
3476 else if (TREE_CODE (exp) == PLUS_EXPR)
3478 const_part = TREE_OPERAND (exp, 0);
3479 while (TREE_CODE (const_part) == NOP_EXPR
3480 || TREE_CODE (const_part) == CONVERT_EXPR)
3481 const_part = TREE_OPERAND (const_part, 0);
3482 addr_part = TREE_OPERAND (exp, 1);
3483 while (TREE_CODE (addr_part) == NOP_EXPR
3484 || TREE_CODE (addr_part) == CONVERT_EXPR)
3485 addr_part = TREE_OPERAND (addr_part, 0);
3486 if (TREE_CODE (const_part) != INTEGER_CST)
3487 tmp = const_part, const_part = addr_part, addr_part = tmp;
3488 if (TREE_CODE (const_part) != INTEGER_CST
3489 || TREE_CODE (addr_part) != ADDR_EXPR)
3490 abort (); /* FIXME: we really haven't considered
3491 all the possible cases here. */
3493 else if (TREE_CODE (exp) == ADDR_EXPR)
3495 const_part = integer_zero_node;
3499 abort (); /* FIXME: ditto previous. */
3505 char c = TREE_INT_CST_LOW (const_part);
3511 short s = TREE_INT_CST_LOW (const_part);
3512 bc_emit ((char *) &s, 2);
3517 int i = TREE_INT_CST_LOW (const_part);
3518 bc_emit ((char *) &i, 4);
3523 #if WORDS_BIG_ENDIAN
3524 int i = TREE_INT_CST_HIGH (const_part);
3525 bc_emit ((char *) &i, 4);
3526 i = TREE_INT_CST_LOW (const_part);
3527 bc_emit ((char *) &i, 4);
3529 int i = TREE_INT_CST_LOW (const_part);
3530 bc_emit ((char *) &i, 4);
3531 i = TREE_INT_CST_HIGH (const_part);
3532 bc_emit ((char *) &i, 4);
3539 && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL)
3540 bc_emit_labelref (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0)),
3541 TREE_INT_CST_LOW (const_part));
3543 abort (); /* FIXME: there may be more cases. */
3546 /* Subroutine of output_constant, used for CONSTRUCTORs
3547 (aggregate constants).
3548 Generate at least SIZE bytes, padding if necessary. */
3551 output_constructor (exp, size)
3555 register tree link, field = 0;
3556 HOST_WIDE_INT min_index = 0;
3557 /* Number of bytes output or skipped so far.
3558 In other words, current position within the constructor. */
3559 int total_bytes = 0;
3560 /* Non-zero means BYTE contains part of a byte, to be output. */
3561 int byte_buffer_in_use = 0;
3564 if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT)
3567 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE)
3568 field = TYPE_FIELDS (TREE_TYPE (exp));
3570 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE
3571 && TYPE_DOMAIN (TREE_TYPE (exp)) != 0)
3573 = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp))));
3575 /* As LINK goes through the elements of the constant,
3576 FIELD goes through the structure fields, if the constant is a structure.
3577 if the constant is a union, then we override this,
3578 by getting the field from the TREE_LIST element.
3579 But the constant could also be an array. Then FIELD is zero. */
3580 for (link = CONSTRUCTOR_ELTS (exp);
3582 link = TREE_CHAIN (link),
3583 field = field ? TREE_CHAIN (field) : 0)
3585 tree val = TREE_VALUE (link);
3588 /* the element in a union constructor specifies the proper field. */
3590 if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE
3591 || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE)
3593 /* if available, use the type given by link */
3594 if (TREE_PURPOSE (link) != 0)
3595 field = TREE_PURPOSE (link);
3598 if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
3599 index = TREE_PURPOSE (link);
3601 /* Eliminate the marker that makes a cast not be an lvalue. */
3605 if (field == 0 || !DECL_BIT_FIELD (field))
3607 /* An element that is not a bit-field. */
3609 register int fieldsize;
3610 /* Since this structure is static,
3611 we know the positions are constant. */
3612 int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))
3616 bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val)))
3618 * (TREE_INT_CST_LOW (index) - min_index));
3620 /* Output any buffered-up bit-fields preceding this element. */
3621 if (byte_buffer_in_use)
3623 ASM_OUTPUT_BYTE (asm_out_file, byte);
3625 byte_buffer_in_use = 0;
3628 /* Advance to offset of this element.
3629 Note no alignment needed in an array, since that is guaranteed
3630 if each element has the proper size. */
3631 if ((field != 0 || index != 0) && bitpos != total_bytes)
3633 if (!output_bytecode)
3634 assemble_zeros (bitpos - total_bytes);
3636 bc_emit_const_skip (bitpos - total_bytes);
3637 total_bytes = bitpos;
3640 /* Determine size this element should occupy. */
3643 if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST)
3645 if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000)
3647 /* This avoids overflow trouble. */
3648 tree size_tree = size_binop (CEIL_DIV_EXPR,
3650 size_int (BITS_PER_UNIT));
3651 fieldsize = TREE_INT_CST_LOW (size_tree);
3655 fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field));
3656 fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT;
3660 fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp)));
3662 /* Output the element's initial value. */
3664 assemble_zeros (fieldsize);
3666 output_constant (val, fieldsize);
3668 /* Count its size. */
3669 total_bytes += fieldsize;
3671 else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
3672 error ("invalid initial value for member `%s'",
3673 IDENTIFIER_POINTER (DECL_NAME (field)));
3676 /* Element that is a bit-field. */
3678 int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field));
3680 = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field)));
3683 val = integer_zero_node;
3685 /* If this field does not start in this (or, next) byte,
3687 if (next_offset / BITS_PER_UNIT != total_bytes)
3689 /* Output remnant of any bit field in previous bytes. */
3690 if (byte_buffer_in_use)
3692 ASM_OUTPUT_BYTE (asm_out_file, byte);
3694 byte_buffer_in_use = 0;
3697 /* If still not at proper byte, advance to there. */
3698 if (next_offset / BITS_PER_UNIT != total_bytes)
3700 assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
3701 total_bytes = next_offset / BITS_PER_UNIT;
3705 if (! byte_buffer_in_use)
3708 /* We must split the element into pieces that fall within
3709 separate bytes, and combine each byte with previous or
3710 following bit-fields. */
3712 /* next_offset is the offset n fbits from the beginning of
3713 the structure to the next bit of this element to be processed.
3714 end_offset is the offset of the first bit past the end of
3716 while (next_offset < end_offset)
3720 int next_byte = next_offset / BITS_PER_UNIT;
3721 int next_bit = next_offset % BITS_PER_UNIT;
3723 /* Advance from byte to byte
3724 within this element when necessary. */
3725 while (next_byte != total_bytes)
3727 ASM_OUTPUT_BYTE (asm_out_file, byte);
3732 /* Number of bits we can process at once
3733 (all part of the same byte). */
3734 this_time = MIN (end_offset - next_offset,
3735 BITS_PER_UNIT - next_bit);
3736 #if BYTES_BIG_ENDIAN
3737 /* On big-endian machine, take the most significant bits
3738 first (of the bits that are significant)
3739 and put them into bytes from the most significant end. */
3740 shift = end_offset - next_offset - this_time;
3741 /* Don't try to take a bunch of bits that cross
3742 the word boundary in the INTEGER_CST. */
3743 if (shift < HOST_BITS_PER_WIDE_INT
3744 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3746 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
3747 shift = HOST_BITS_PER_WIDE_INT;
3750 /* Now get the bits from the appropriate constant word. */
3751 if (shift < HOST_BITS_PER_WIDE_INT)
3753 value = TREE_INT_CST_LOW (val);
3755 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3757 value = TREE_INT_CST_HIGH (val);
3758 shift -= HOST_BITS_PER_WIDE_INT;
3762 byte |= (((value >> shift)
3763 & (((HOST_WIDE_INT) 1 << this_time) - 1))
3764 << (BITS_PER_UNIT - this_time - next_bit));
3766 /* On little-endian machines,
3767 take first the least significant bits of the value
3768 and pack them starting at the least significant
3769 bits of the bytes. */
3770 shift = (next_offset
3771 - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)));
3772 /* Don't try to take a bunch of bits that cross
3773 the word boundary in the INTEGER_CST. */
3774 if (shift < HOST_BITS_PER_WIDE_INT
3775 && shift + this_time > HOST_BITS_PER_WIDE_INT)
3777 this_time -= (HOST_BITS_PER_WIDE_INT - shift);
3778 shift = HOST_BITS_PER_WIDE_INT;
3781 /* Now get the bits from the appropriate constant word. */
3782 if (shift < HOST_BITS_PER_INT)
3783 value = TREE_INT_CST_LOW (val);
3784 else if (shift < 2 * HOST_BITS_PER_WIDE_INT)
3786 value = TREE_INT_CST_HIGH (val);
3787 shift -= HOST_BITS_PER_WIDE_INT;
3791 byte |= ((value >> shift)
3792 & (((HOST_WIDE_INT) 1 << this_time) - 1)) << next_bit;
3794 next_offset += this_time;
3795 byte_buffer_in_use = 1;
3799 if (byte_buffer_in_use)
3801 ASM_OUTPUT_BYTE (asm_out_file, byte);
3804 if (total_bytes < size)
3805 assemble_zeros (size - total_bytes);
3809 #ifdef HANDLE_SYSV_PRAGMA
3811 /* Support #pragma weak by default if WEAK_ASM_OP and ASM_OUTPUT_DEF
3813 #if defined (WEAK_ASM_OP) && defined (ASM_OUTPUT_DEF)
3815 /* See c-pragma.c for an identical definition. */
3831 /* Output asm to handle ``#pragma weak'' */
3833 handle_pragma_weak (what, asm_out_file, name, value)
3834 enum pragma_state what;
3838 if (what == ps_name || what == ps_value)
3840 fprintf (asm_out_file, "\t%s\t", WEAK_ASM_OP);
3842 if (output_bytecode)
3843 BC_OUTPUT_LABELREF (asm_out_file, name);
3845 ASM_OUTPUT_LABELREF (asm_out_file, name);
3847 fputc ('\n', asm_out_file);
3848 if (what == ps_value)
3849 ASM_OUTPUT_DEF (asm_out_file, name, value);
3851 else if (! (what == ps_done || what == ps_start))
3852 warning ("malformed `#pragma weak'");
3855 #endif /* HANDLE_PRAGMA_WEAK or (WEAK_ASM_OP and SET_ASM_OP) */
3857 #endif /* WEAK_ASM_OP && ASM_OUTPUT_DEF */