1 /* Output variables, constants and external declarations, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file handles generation of all the assembler code
24 *except* the instructions of a function.
25 This includes declarations of variables and their initial values.
27 We also output the assembler code for constants stored in memory
28 and are responsible for combining constants with the same value. */
37 #include "hard-reg-set.h"
50 #ifdef XCOFF_DEBUGGING_INFO
51 #include "xcoffout.h" /* Needed for external data
52 declarations for e.g. AIX 4.x. */
55 #ifndef TRAMPOLINE_ALIGNMENT
56 #define TRAMPOLINE_ALIGNMENT FUNCTION_BOUNDARY
60 #define ASM_STABS_OP "\t.stabs\t"
63 /* Define the prefix to use when check_memory_usage_flag is enable. */
64 #define CHKR_PREFIX "_CHKR_"
65 #define CHKR_PREFIX_SIZE (sizeof (CHKR_PREFIX) - 1)
67 /* The (assembler) name of the first globally-visible object output. */
68 const char *first_global_object_name
;
69 const char *weak_global_object_name
;
71 extern struct obstack permanent_obstack
;
72 #define obstack_chunk_alloc xmalloc
75 struct constant_descriptor
;
79 #define MAX_RTX_HASH_TABLE 61
83 /* Hash facility for making memory-constants
84 from constant rtl-expressions. It is used on RISC machines
85 where immediate integer arguments and constant addresses are restricted
86 so that such constants must be stored in memory.
88 This pool of constants is reinitialized for each function
89 so each function gets its own constants-pool that comes right before
91 struct constant_descriptor
**x_const_rtx_hash_table
;
92 struct pool_constant
**x_const_rtx_sym_hash_table
;
94 /* Pointers to first and last constant in pool. */
95 struct pool_constant
*x_first_pool
, *x_last_pool
;
97 /* Current offset in constant pool (does not include any machine-specific
101 /* Chain of all CONST_DOUBLE rtx's constructed for the current function.
102 They are chained through the CONST_DOUBLE_CHAIN.
103 A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain.
104 In that case, CONST_DOUBLE_MEM is either a MEM,
105 or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. */
106 rtx x_const_double_chain
;
109 #define const_rtx_hash_table (cfun->varasm->x_const_rtx_hash_table)
110 #define const_rtx_sym_hash_table (cfun->varasm->x_const_rtx_sym_hash_table)
111 #define first_pool (cfun->varasm->x_first_pool)
112 #define last_pool (cfun->varasm->x_last_pool)
113 #define pool_offset (cfun->varasm->x_pool_offset)
114 #define const_double_chain (cfun->varasm->x_const_double_chain)
116 /* Number for making the label on the next
117 constant that is stored in memory. */
121 /* Number for making the label on the next
122 static variable internal to a function. */
126 /* Carry information from ASM_DECLARE_OBJECT_NAME
127 to ASM_FINISH_DECLARE_OBJECT. */
129 int size_directive_output
;
131 /* The last decl for which assemble_variable was called,
132 if it did ASM_DECLARE_OBJECT_NAME.
133 If the last call to assemble_variable didn't do that,
136 tree last_assemble_variable_decl
;
138 static const char *strip_reg_name
PARAMS ((const char *));
139 static int contains_pointers_p
PARAMS ((tree
));
140 static void assemble_real_1
PARAMS ((PTR
));
141 static void decode_addr_const
PARAMS ((tree
, struct addr_const
*));
142 static int const_hash
PARAMS ((tree
));
143 static int compare_constant
PARAMS ((tree
,
144 struct constant_descriptor
*));
145 static const unsigned char *compare_constant_1
PARAMS ((tree
, const unsigned char *));
146 static struct constant_descriptor
*record_constant
PARAMS ((tree
));
147 static void record_constant_1
PARAMS ((tree
));
148 static tree copy_constant
PARAMS ((tree
));
149 static void output_constant_def_contents
PARAMS ((tree
, int, int));
150 static void decode_rtx_const
PARAMS ((enum machine_mode
, rtx
,
151 struct rtx_const
*));
152 static int const_hash_rtx
PARAMS ((enum machine_mode
, rtx
));
153 static int compare_constant_rtx
PARAMS ((enum machine_mode
, rtx
,
154 struct constant_descriptor
*));
155 static struct constant_descriptor
*record_constant_rtx
PARAMS ((enum machine_mode
,
157 static struct pool_constant
*find_pool_constant
PARAMS ((struct function
*, rtx
));
158 static void mark_constant_pool
PARAMS ((void));
159 static void mark_constants
PARAMS ((rtx
));
160 static int mark_constant
PARAMS ((rtx
*current_rtx
, void *data
));
161 static int output_addressed_constants
PARAMS ((tree
));
162 static void output_after_function_constants
PARAMS ((void));
163 static unsigned HOST_WIDE_INT array_size_for_constructor
PARAMS ((tree
));
164 static void output_constructor
PARAMS ((tree
, int));
165 #ifdef ASM_WEAKEN_LABEL
166 static void remove_from_pending_weak_list
PARAMS ((const char *));
168 #ifdef ASM_OUTPUT_BSS
169 static void asm_output_bss
PARAMS ((FILE *, tree
, const char *, int, int));
171 #ifdef BSS_SECTION_ASM_OP
172 #ifdef ASM_OUTPUT_ALIGNED_BSS
173 static void asm_output_aligned_bss
PARAMS ((FILE *, tree
, const char *,
176 #endif /* BSS_SECTION_ASM_OP */
177 static void mark_pool_constant
PARAMS ((struct pool_constant
*));
178 static void mark_const_hash_entry
PARAMS ((void *));
179 static int mark_const_str_htab_1
PARAMS ((void **, void *));
180 static void mark_const_str_htab
PARAMS ((void *));
181 static hashval_t const_str_htab_hash
PARAMS ((const void *x
));
182 static int const_str_htab_eq
PARAMS ((const void *x
, const void *y
));
183 static void const_str_htab_del
PARAMS ((void *));
184 static void asm_emit_uninitialised
PARAMS ((tree
, const char*, int, int));
185 static void resolve_unique_section
PARAMS ((tree
, int));
187 static enum in_section
{ no_section
, in_text
, in_data
, in_named
188 #ifdef BSS_SECTION_ASM_OP
191 #ifdef CTORS_SECTION_ASM_OP
194 #ifdef DTORS_SECTION_ASM_OP
197 #ifdef EXTRA_SECTIONS
200 } in_section
= no_section
;
202 /* Return a non-zero value if DECL has a section attribute. */
203 #ifndef IN_NAMED_SECTION
204 #define IN_NAMED_SECTION(DECL) \
205 ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \
206 && DECL_SECTION_NAME (DECL) != NULL_TREE)
209 /* Text of section name when in_section == in_named. */
210 static const char *in_named_name
;
212 /* Define functions like text_section for any extra sections. */
213 #ifdef EXTRA_SECTION_FUNCTIONS
214 EXTRA_SECTION_FUNCTIONS
217 /* Tell assembler to switch to text section. */
222 if (in_section
!= in_text
)
224 fprintf (asm_out_file
, "%s\n", TEXT_SECTION_ASM_OP
);
225 in_section
= in_text
;
229 /* Tell assembler to switch to data section. */
234 if (in_section
!= in_data
)
236 if (flag_shared_data
)
238 #ifdef SHARED_SECTION_ASM_OP
239 fprintf (asm_out_file
, "%s\n", SHARED_SECTION_ASM_OP
);
241 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
245 fprintf (asm_out_file
, "%s\n", DATA_SECTION_ASM_OP
);
247 in_section
= in_data
;
250 /* Tell assembler to ALWAYS switch to data section, in case
251 it's not sure where it is. */
254 force_data_section ()
256 in_section
= no_section
;
260 /* Tell assembler to switch to read-only data section. This is normally
264 readonly_data_section ()
266 #ifdef READONLY_DATA_SECTION
267 READONLY_DATA_SECTION (); /* Note this can call data_section. */
273 /* Determine if we're in the text section. */
278 return in_section
== in_text
;
281 /* Determine if we're in the data section. */
286 return in_section
== in_data
;
289 /* Tell assembler to change to section NAME with attributes FLAGS. */
292 named_section_flags (name
, flags
, align
)
297 if (in_section
!= in_named
|| strcmp (name
, in_named_name
))
299 (* targetm
.asm_out
.named_section
) (name
, flags
, align
);
301 if (flags
& SECTION_FORGET
)
302 in_section
= no_section
;
305 in_named_name
= ggc_strdup (name
);
306 in_section
= in_named
;
311 /* Tell assembler to change to section NAME for DECL.
312 If DECL is NULL, just switch to section NAME.
313 If NAME is NULL, get the name from DECL.
314 If RELOC is 1, the initializer for DECL contains relocs. */
317 named_section (decl
, name
, reloc
)
324 if (decl
!= NULL_TREE
&& !DECL_P (decl
))
327 name
= TREE_STRING_POINTER (DECL_SECTION_NAME (decl
));
329 flags
= (* targetm
.section_type_flags
) (decl
, name
, reloc
);
330 named_section_flags (name
, flags
, 0);
333 /* If required, set DECL_SECTION_NAME to a unique name. */
336 resolve_unique_section (decl
, reloc
)
340 if (DECL_SECTION_NAME (decl
) == NULL_TREE
341 && (flag_function_sections
342 || (targetm
.have_named_sections
343 && DECL_ONE_ONLY (decl
))))
344 UNIQUE_SECTION (decl
, reloc
);
347 #ifdef BSS_SECTION_ASM_OP
349 /* Tell the assembler to switch to the bss section. */
354 if (in_section
!= in_bss
)
356 #ifdef SHARED_BSS_SECTION_ASM_OP
357 if (flag_shared_data
)
358 fprintf (asm_out_file
, "%s\n", SHARED_BSS_SECTION_ASM_OP
);
361 fprintf (asm_out_file
, "%s\n", BSS_SECTION_ASM_OP
);
367 #ifdef ASM_OUTPUT_BSS
369 /* Utility function for ASM_OUTPUT_BSS for targets to use if
370 they don't support alignments in .bss.
371 ??? It is believed that this function will work in most cases so such
372 support is localized here. */
375 asm_output_bss (file
, decl
, name
, size
, rounded
)
377 tree decl ATTRIBUTE_UNUSED
;
379 int size ATTRIBUTE_UNUSED
, rounded
;
381 ASM_GLOBALIZE_LABEL (file
, name
);
383 #ifdef ASM_DECLARE_OBJECT_NAME
384 last_assemble_variable_decl
= decl
;
385 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
387 /* Standard thing is just output label for the object. */
388 ASM_OUTPUT_LABEL (file
, name
);
389 #endif /* ASM_DECLARE_OBJECT_NAME */
390 ASM_OUTPUT_SKIP (file
, rounded
);
395 #ifdef ASM_OUTPUT_ALIGNED_BSS
397 /* Utility function for targets to use in implementing
398 ASM_OUTPUT_ALIGNED_BSS.
399 ??? It is believed that this function will work in most cases so such
400 support is localized here. */
403 asm_output_aligned_bss (file
, decl
, name
, size
, align
)
409 ASM_GLOBALIZE_LABEL (file
, name
);
411 ASM_OUTPUT_ALIGN (file
, floor_log2 (align
/ BITS_PER_UNIT
));
412 #ifdef ASM_DECLARE_OBJECT_NAME
413 last_assemble_variable_decl
= decl
;
414 ASM_DECLARE_OBJECT_NAME (file
, name
, decl
);
416 /* Standard thing is just output label for the object. */
417 ASM_OUTPUT_LABEL (file
, name
);
418 #endif /* ASM_DECLARE_OBJECT_NAME */
419 ASM_OUTPUT_SKIP (file
, size
? size
: 1);
424 #endif /* BSS_SECTION_ASM_OP */
426 /* Switch to the section for function DECL.
428 If DECL is NULL_TREE, switch to the text section.
429 ??? It's not clear that we will ever be passed NULL_TREE, but it's
430 safer to handle it. */
433 function_section (decl
)
436 if (decl
!= NULL_TREE
437 && DECL_SECTION_NAME (decl
) != NULL_TREE
)
438 named_section (decl
, (char *) 0, 0);
443 /* Switch to section for variable DECL.
445 RELOC is the `reloc' argument to SELECT_SECTION. */
448 variable_section (decl
, reloc
)
452 if (IN_NAMED_SECTION (decl
))
453 named_section (decl
, NULL
, reloc
);
456 /* C++ can have const variables that get initialized from constructors,
457 and thus can not be in a readonly section. We prevent this by
458 verifying that the initial value is constant for objects put in a
461 error_mark_node is used by the C front end to indicate that the
462 initializer has not been seen yet. In this case, we assume that
463 the initializer must be constant.
465 C++ uses error_mark_node for variables that have complicated
466 initializers, but these variables go in BSS so we won't be called
469 #ifdef SELECT_SECTION
470 SELECT_SECTION (decl
, reloc
);
472 if (DECL_READONLY_SECTION (decl
, reloc
))
473 readonly_data_section ();
480 /* Tell assembler to switch to the section for the exception handling
486 #if defined (EXCEPTION_SECTION)
487 EXCEPTION_SECTION ();
489 if (targetm
.have_named_sections
)
490 named_section (NULL_TREE
, ".gcc_except_table", 0);
494 readonly_data_section ();
498 /* Given NAME, a putative register name, discard any customary prefixes. */
501 strip_reg_name (name
)
504 #ifdef REGISTER_PREFIX
505 if (!strncmp (name
, REGISTER_PREFIX
, strlen (REGISTER_PREFIX
)))
506 name
+= strlen (REGISTER_PREFIX
);
508 if (name
[0] == '%' || name
[0] == '#')
513 /* Decode an `asm' spec for a declaration as a register name.
514 Return the register number, or -1 if nothing specified,
515 or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized,
516 or -3 if ASMSPEC is `cc' and is not recognized,
517 or -4 if ASMSPEC is `memory' and is not recognized.
518 Accept an exact spelling or a decimal number.
519 Prefixes such as % are optional. */
522 decode_reg_name (asmspec
)
529 /* Get rid of confusing prefixes. */
530 asmspec
= strip_reg_name (asmspec
);
532 /* Allow a decimal number as a "register name". */
533 for (i
= strlen (asmspec
) - 1; i
>= 0; i
--)
534 if (! (asmspec
[i
] >= '0' && asmspec
[i
] <= '9'))
536 if (asmspec
[0] != 0 && i
< 0)
539 if (i
< FIRST_PSEUDO_REGISTER
&& i
>= 0)
545 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
547 && ! strcmp (asmspec
, strip_reg_name (reg_names
[i
])))
550 #ifdef ADDITIONAL_REGISTER_NAMES
552 static struct { const char *name
; int number
; } table
[]
553 = ADDITIONAL_REGISTER_NAMES
;
555 for (i
= 0; i
< (int) ARRAY_SIZE (table
); i
++)
556 if (! strcmp (asmspec
, table
[i
].name
))
557 return table
[i
].number
;
559 #endif /* ADDITIONAL_REGISTER_NAMES */
561 if (!strcmp (asmspec
, "memory"))
564 if (!strcmp (asmspec
, "cc"))
573 /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should
574 have static storage duration. In other words, it should not be an
575 automatic variable, including PARM_DECLs.
577 There is, however, one exception: this function handles variables
578 explicitly placed in a particular register by the user.
580 ASMSPEC, if not 0, is the string which the user specified as the
581 assembler symbol name.
583 This is never called for PARM_DECL nodes. */
586 make_decl_rtl (decl
, asmspec
)
590 int top_level
= (DECL_CONTEXT (decl
) == NULL_TREE
);
591 const char *name
= 0;
592 const char *new_name
= 0;
595 /* Check that we are not being given an automatic variable. */
596 /* A weak alias has TREE_PUBLIC set but not the other bits. */
597 if (TREE_CODE (decl
) == PARM_DECL
598 || TREE_CODE (decl
) == RESULT_DECL
599 || (TREE_CODE (decl
) == VAR_DECL
600 && !TREE_STATIC (decl
)
601 && !TREE_PUBLIC (decl
)
602 && !DECL_EXTERNAL (decl
)
603 && !DECL_REGISTER (decl
)))
605 /* And that we were not given a type or a label. */
606 else if (TREE_CODE (decl
) == TYPE_DECL
607 || TREE_CODE (decl
) == LABEL_DECL
)
610 /* For a duplicate declaration, we can be called twice on the
611 same DECL node. Don't discard the RTL already made. */
612 if (DECL_RTL_SET_P (decl
))
614 /* If the old RTL had the wrong mode, fix the mode. */
615 if (GET_MODE (DECL_RTL (decl
)) != DECL_MODE (decl
))
617 rtx rtl
= DECL_RTL (decl
);
618 PUT_MODE (rtl
, DECL_MODE (decl
));
621 /* ??? Another way to do this would be to do what halfpic.c does
622 and maintain a hashed table of such critters. */
623 /* ??? Another way to do this would be to pass a flag bit to
624 ENCODE_SECTION_INFO saying whether this is a new decl or not. */
625 /* Let the target reassign the RTL if it wants.
626 This is necessary, for example, when one machine specific
627 decl attribute overrides another. */
628 #ifdef REDO_SECTION_INFO_P
629 if (REDO_SECTION_INFO_P (decl
))
630 ENCODE_SECTION_INFO (decl
);
635 new_name
= name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
637 reg_number
= decode_reg_name (asmspec
);
638 if (reg_number
== -2)
640 /* ASMSPEC is given, and not the name of a register. Mark the
641 name with a star so assemble_name won't munge it. */
642 char *starred
= alloca (strlen (asmspec
) + 2);
644 strcpy (starred
+ 1, asmspec
);
648 if (TREE_CODE (decl
) != FUNCTION_DECL
&& DECL_REGISTER (decl
))
650 /* First detect errors in declaring global registers. */
651 if (reg_number
== -1)
652 error_with_decl (decl
, "register name not specified for `%s'");
653 else if (reg_number
< 0)
654 error_with_decl (decl
, "invalid register name for `%s'");
655 else if (TYPE_MODE (TREE_TYPE (decl
)) == BLKmode
)
656 error_with_decl (decl
,
657 "data type of `%s' isn't suitable for a register");
658 else if (! HARD_REGNO_MODE_OK (reg_number
, TYPE_MODE (TREE_TYPE (decl
))))
659 error_with_decl (decl
,
660 "register specified for `%s' isn't suitable for data type");
661 /* Now handle properly declared static register variables. */
666 if (DECL_INITIAL (decl
) != 0 && TREE_STATIC (decl
))
668 DECL_INITIAL (decl
) = 0;
669 error ("global register variable has initial value");
671 if (TREE_THIS_VOLATILE (decl
))
672 warning ("volatile register variables don't work as you might wish");
674 /* If the user specified one of the eliminables registers here,
675 e.g., FRAME_POINTER_REGNUM, we don't want to get this variable
676 confused with that register and be eliminated. Although this
677 usage is somewhat suspect, we nevertheless use the following
678 kludge to avoid setting DECL_RTL to frame_pointer_rtx. */
681 gen_rtx_REG (DECL_MODE (decl
),
682 FIRST_PSEUDO_REGISTER
));
683 REGNO (DECL_RTL (decl
)) = reg_number
;
684 REG_USERVAR_P (DECL_RTL (decl
)) = 1;
686 if (TREE_STATIC (decl
))
688 /* Make this register global, so not usable for anything
690 #ifdef ASM_DECLARE_REGISTER_GLOBAL
691 ASM_DECLARE_REGISTER_GLOBAL (asm_out_file
, decl
, reg_number
, name
);
693 nregs
= HARD_REGNO_NREGS (reg_number
, DECL_MODE (decl
));
695 globalize_reg (reg_number
+ --nregs
);
698 /* As a register variable, it has no section. */
703 /* Now handle ordinary static variables and functions (in memory).
704 Also handle vars declared register invalidly. */
706 if (reg_number
>= 0 || reg_number
== -3)
707 error_with_decl (decl
,
708 "register name given for non-register variable `%s'");
710 /* Specifying a section attribute on a variable forces it into a
711 non-.bss section, and thus it cannot be common. */
712 if (TREE_CODE (decl
) == VAR_DECL
713 && DECL_SECTION_NAME (decl
) != NULL_TREE
714 && DECL_INITIAL (decl
) == NULL_TREE
715 && DECL_COMMON (decl
))
716 DECL_COMMON (decl
) = 0;
718 /* Can't use just the variable's own name for a variable
719 whose scope is less than the whole file, unless it's a member
720 of a local class (which will already be unambiguous).
721 Concatenate a distinguishing number. */
722 if (!top_level
&& !TREE_PUBLIC (decl
)
723 && ! (DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
)))
725 && name
== IDENTIFIER_POINTER (DECL_NAME (decl
)))
728 ASM_FORMAT_PRIVATE_NAME (label
, name
, var_labelno
);
733 /* When -fprefix-function-name is used, the functions
734 names are prefixed. Only nested function names are not
736 else if (flag_prefix_function_name
&& TREE_CODE (decl
) == FUNCTION_DECL
)
738 size_t name_len
= IDENTIFIER_LENGTH (DECL_ASSEMBLER_NAME (decl
));
741 pname
= alloca (name_len
+ CHKR_PREFIX_SIZE
+ 1);
742 memcpy (pname
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
);
743 memcpy (pname
+ CHKR_PREFIX_SIZE
, name
, name_len
+ 1);
747 if (name
!= new_name
)
749 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (new_name
));
750 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
753 /* If this variable is to be treated as volatile, show its
754 tree node has side effects. */
755 if ((flag_volatile_global
&& TREE_CODE (decl
) == VAR_DECL
756 && TREE_PUBLIC (decl
))
757 || ((flag_volatile_static
&& TREE_CODE (decl
) == VAR_DECL
758 && (TREE_PUBLIC (decl
) || TREE_STATIC (decl
)))))
759 TREE_SIDE_EFFECTS (decl
) = 1;
761 SET_DECL_RTL (decl
, gen_rtx_MEM (DECL_MODE (decl
),
762 gen_rtx_SYMBOL_REF (Pmode
, name
)));
763 SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl
), 0)) = DECL_WEAK (decl
);
764 if (TREE_CODE (decl
) != FUNCTION_DECL
)
765 set_mem_attributes (DECL_RTL (decl
), decl
, 1);
767 /* Optionally set flags or add text to the name to record information
768 such as that it is a function name.
769 If the name is changed, the macro ASM_OUTPUT_LABELREF
770 will have to know how to strip this information. */
771 #ifdef ENCODE_SECTION_INFO
772 ENCODE_SECTION_INFO (decl
);
776 /* Make the rtl for variable VAR be volatile.
777 Use this only for static variables. */
780 make_var_volatile (var
)
783 if (GET_CODE (DECL_RTL (var
)) != MEM
)
786 MEM_VOLATILE_P (DECL_RTL (var
)) = 1;
789 /* Output alignment directive to align for constant expression EXP. */
792 assemble_constant_align (exp
)
797 /* Align the location counter as required by EXP's data type. */
798 align
= TYPE_ALIGN (TREE_TYPE (exp
));
799 #ifdef CONSTANT_ALIGNMENT
800 align
= CONSTANT_ALIGNMENT (exp
, align
);
803 if (align
> BITS_PER_UNIT
)
804 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
807 /* Output a string of literal assembler code
808 for an `asm' keyword used between functions. */
811 assemble_asm (string
)
816 if (TREE_CODE (string
) == ADDR_EXPR
)
817 string
= TREE_OPERAND (string
, 0);
819 fprintf (asm_out_file
, "\t%s\n", TREE_STRING_POINTER (string
));
822 /* Record an element in the table of global destructors. SYMBOL is
823 a SYMBOL_REF of the function to be called; PRIORITY is a number
824 between 0 and MAX_INIT_PRIORITY. */
827 default_stabs_asm_out_destructor (symbol
, priority
)
829 int priority ATTRIBUTE_UNUSED
;
831 /* Tell GNU LD that this is part of the static destructor set.
832 This will work for any system that uses stabs, most usefully
834 fprintf (asm_out_file
, "%s\"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
835 assemble_name (asm_out_file
, XSTR (symbol
, 0));
836 fputc ('\n', asm_out_file
);
840 default_named_section_asm_out_destructor (symbol
, priority
)
844 const char *section
= ".dtors";
847 /* ??? This only works reliably with the GNU linker. */
848 if (priority
!= DEFAULT_INIT_PRIORITY
)
850 sprintf (buf
, ".dtors.%.5u",
851 /* Invert the numbering so the linker puts us in the proper
852 order; constructors are run from right to left, and the
853 linker sorts in increasing order. */
854 MAX_INIT_PRIORITY
- priority
);
858 named_section_flags (section
, SECTION_WRITE
, POINTER_SIZE
/ BITS_PER_UNIT
);
859 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
862 #ifdef DTORS_SECTION_ASM_OP
866 if (in_section
!= in_dtors
)
868 in_section
= in_dtors
;
869 fputs (DTORS_SECTION_ASM_OP
, asm_out_file
);
870 fputc ('\n', asm_out_file
);
875 default_dtor_section_asm_out_destructor (symbol
, priority
)
877 int priority ATTRIBUTE_UNUSED
;
880 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
884 /* Likewise for global constructors. */
887 default_stabs_asm_out_constructor (symbol
, priority
)
889 int priority ATTRIBUTE_UNUSED
;
891 /* Tell GNU LD that this is part of the static destructor set.
892 This will work for any system that uses stabs, most usefully
894 fprintf (asm_out_file
, "%s\"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP
);
895 assemble_name (asm_out_file
, XSTR (symbol
, 0));
896 fputc ('\n', asm_out_file
);
900 default_named_section_asm_out_constructor (symbol
, priority
)
904 const char *section
= ".ctors";
907 /* ??? This only works reliably with the GNU linker. */
908 if (priority
!= DEFAULT_INIT_PRIORITY
)
910 sprintf (buf
, ".ctors.%.5u",
911 /* Invert the numbering so the linker puts us in the proper
912 order; constructors are run from right to left, and the
913 linker sorts in increasing order. */
914 MAX_INIT_PRIORITY
- priority
);
918 named_section_flags (section
, SECTION_WRITE
, POINTER_SIZE
/ BITS_PER_UNIT
);
919 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
922 #ifdef CTORS_SECTION_ASM_OP
926 if (in_section
!= in_ctors
)
928 in_section
= in_ctors
;
929 fputs (CTORS_SECTION_ASM_OP
, asm_out_file
);
930 fputc ('\n', asm_out_file
);
935 default_ctor_section_asm_out_constructor (symbol
, priority
)
937 int priority ATTRIBUTE_UNUSED
;
940 assemble_integer (symbol
, POINTER_SIZE
/ BITS_PER_UNIT
, 1);
944 /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with
945 a non-zero value if the constant pool should be output before the
946 start of the function, or a zero value if the pool should output
947 after the end of the function. The default is to put it before the
950 #ifndef CONSTANT_POOL_BEFORE_FUNCTION
951 #define CONSTANT_POOL_BEFORE_FUNCTION 1
954 /* Output assembler code for the constant pool of a function and associated
955 with defining the name of the function. DECL describes the function.
956 NAME is the function's name. For the constant pool, we use the current
957 constant pool data. */
960 assemble_start_function (decl
, fnname
)
966 /* The following code does not need preprocessing in the assembler. */
970 if (CONSTANT_POOL_BEFORE_FUNCTION
)
971 output_constant_pool (fnname
, decl
);
973 resolve_unique_section (decl
, 0);
974 function_section (decl
);
976 /* Tell assembler to move to target machine's alignment for functions. */
977 align
= floor_log2 (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
979 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
981 /* Handle a user-specified function alignment.
982 Note that we still need to align to FUNCTION_BOUNDARY, as above,
983 because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */
984 if (align_functions_log
> align
)
986 #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
987 ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file
,
988 align_functions_log
, align_functions
-1);
990 ASM_OUTPUT_ALIGN (asm_out_file
, align_functions_log
);
994 #ifdef ASM_OUTPUT_FUNCTION_PREFIX
995 ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file
, fnname
);
998 (*debug_hooks
->begin_function
) (decl
);
1000 /* Make function name accessible from other files, if appropriate. */
1002 if (TREE_PUBLIC (decl
))
1004 if (! first_global_object_name
)
1009 STRIP_NAME_ENCODING (p
, fnname
);
1010 name
= permalloc (strlen (p
) + 1);
1013 if (! DECL_WEAK (decl
) && ! DECL_ONE_ONLY (decl
))
1014 first_global_object_name
= name
;
1016 weak_global_object_name
= name
;
1019 #ifdef ASM_WEAKEN_LABEL
1020 if (DECL_WEAK (decl
))
1022 ASM_WEAKEN_LABEL (asm_out_file
, fnname
);
1023 /* Remove this function from the pending weak list so that
1024 we do not emit multiple .weak directives for it. */
1025 remove_from_pending_weak_list
1026 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1030 ASM_GLOBALIZE_LABEL (asm_out_file
, fnname
);
1033 /* Do any machine/system dependent processing of the function name */
1034 #ifdef ASM_DECLARE_FUNCTION_NAME
1035 ASM_DECLARE_FUNCTION_NAME (asm_out_file
, fnname
, current_function_decl
);
1037 /* Standard thing is just output label for the function. */
1038 ASM_OUTPUT_LABEL (asm_out_file
, fnname
);
1039 #endif /* ASM_DECLARE_FUNCTION_NAME */
1042 /* Output assembler code associated with defining the size of the
1043 function. DECL describes the function. NAME is the function's name. */
1046 assemble_end_function (decl
, fnname
)
1050 #ifdef ASM_DECLARE_FUNCTION_SIZE
1051 ASM_DECLARE_FUNCTION_SIZE (asm_out_file
, fnname
, decl
);
1053 if (! CONSTANT_POOL_BEFORE_FUNCTION
)
1055 output_constant_pool (fnname
, decl
);
1056 function_section (decl
); /* need to switch back */
1059 /* Output any constants which should appear after the function. */
1060 output_after_function_constants ();
1063 /* Assemble code to leave SIZE bytes of zeros. */
1066 assemble_zeros (size
)
1069 /* Do no output if -fsyntax-only. */
1070 if (flag_syntax_only
)
1073 #ifdef ASM_NO_SKIP_IN_TEXT
1074 /* The `space' pseudo in the text section outputs nop insns rather than 0s,
1075 so we must output 0s explicitly in the text section. */
1076 if (ASM_NO_SKIP_IN_TEXT
&& in_text_section ())
1080 for (i
= 0; i
< size
- 20; i
+= 20)
1083 fprintf (asm_out_file
,
1084 "%s0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP
);
1086 fprintf (asm_out_file
,
1087 "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n");
1093 fprintf (asm_out_file
, "%s0", ASM_BYTE_OP
);
1095 fprintf (asm_out_file
, "\tbyte 0");
1098 for (; i
< size
; i
++)
1099 fprintf (asm_out_file
, ",0");
1100 fprintf (asm_out_file
, "\n");
1106 ASM_OUTPUT_SKIP (asm_out_file
, size
);
1109 /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */
1112 assemble_align (align
)
1115 if (align
> BITS_PER_UNIT
)
1116 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
1119 /* Assemble a string constant with the specified C string as contents. */
1122 assemble_string (p
, size
)
1129 /* If the string is very long, split it up. */
1133 int thissize
= size
- pos
;
1134 if (thissize
> maximum
)
1137 ASM_OUTPUT_ASCII (asm_out_file
, p
, thissize
);
1145 #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
1146 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1147 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1149 #if defined ASM_OUTPUT_ALIGNED_LOCAL
1150 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1151 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl))
1153 #define ASM_EMIT_LOCAL(decl, name, size, rounded) \
1154 ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded)
1158 #if defined ASM_OUTPUT_ALIGNED_BSS
1159 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1160 ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1162 #if defined ASM_OUTPUT_BSS
1163 #define ASM_EMIT_BSS(decl, name, size, rounded) \
1164 ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded)
1170 #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
1171 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1172 ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl))
1174 #if defined ASM_OUTPUT_ALIGNED_COMMON
1175 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1176 ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl))
1178 #define ASM_EMIT_COMMON(decl, name, size, rounded) \
1179 ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded)
1184 asm_emit_uninitialised (decl
, name
, size
, rounded
)
1187 int size ATTRIBUTE_UNUSED
;
1188 int rounded ATTRIBUTE_UNUSED
;
1196 destination
= asm_dest_local
;
1198 if (TREE_PUBLIC (decl
))
1200 #if defined ASM_EMIT_BSS
1201 if (! DECL_COMMON (decl
))
1202 destination
= asm_dest_bss
;
1205 destination
= asm_dest_common
;
1208 if (flag_shared_data
)
1210 switch (destination
)
1212 #ifdef ASM_OUTPUT_SHARED_BSS
1214 ASM_OUTPUT_SHARED_BSS (asm_out_file
, decl
, name
, size
, rounded
);
1217 #ifdef ASM_OUTPUT_SHARED_COMMON
1218 case asm_dest_common
:
1219 ASM_OUTPUT_SHARED_COMMON (asm_out_file
, name
, size
, rounded
);
1222 #ifdef ASM_OUTPUT_SHARED_LOCAL
1223 case asm_dest_local
:
1224 ASM_OUTPUT_SHARED_LOCAL (asm_out_file
, name
, size
, rounded
);
1232 resolve_unique_section (decl
, 0);
1234 switch (destination
)
1238 ASM_EMIT_BSS (decl
, name
, size
, rounded
);
1241 case asm_dest_common
:
1242 ASM_EMIT_COMMON (decl
, name
, size
, rounded
);
1244 case asm_dest_local
:
1245 ASM_EMIT_LOCAL (decl
, name
, size
, rounded
);
1254 /* Assemble everything that is needed for a variable or function declaration.
1255 Not used for automatic variables, and not used for function definitions.
1256 Should not be called for variables of incomplete structure type.
1258 TOP_LEVEL is nonzero if this variable has file scope.
1259 AT_END is nonzero if this is the special handling, at end of compilation,
1260 to define things that have had only tentative definitions.
1261 DONT_OUTPUT_DATA if nonzero means don't actually output the
1262 initial value (that will be done by the caller). */
1265 assemble_variable (decl
, top_level
, at_end
, dont_output_data
)
1267 int top_level ATTRIBUTE_UNUSED
;
1268 int at_end ATTRIBUTE_UNUSED
;
1269 int dont_output_data
;
1271 register const char *name
;
1276 last_assemble_variable_decl
= 0;
1278 /* Normally no need to say anything here for external references,
1279 since assemble_external is called by the language-specific code
1280 when a declaration is first seen. */
1282 if (DECL_EXTERNAL (decl
))
1285 /* Output no assembler code for a function declaration.
1286 Only definitions of functions output anything. */
1288 if (TREE_CODE (decl
) == FUNCTION_DECL
)
1291 /* Do nothing for global register variables. */
1292 if (DECL_RTL_SET_P (decl
) && GET_CODE (DECL_RTL (decl
)) == REG
)
1294 TREE_ASM_WRITTEN (decl
) = 1;
1298 /* If type was incomplete when the variable was declared,
1299 see if it is complete now. */
1301 if (DECL_SIZE (decl
) == 0)
1302 layout_decl (decl
, 0);
1304 /* Still incomplete => don't allocate it; treat the tentative defn
1305 (which is what it must have been) as an `extern' reference. */
1307 if (!dont_output_data
&& DECL_SIZE (decl
) == 0)
1309 error_with_file_and_line (DECL_SOURCE_FILE (decl
),
1310 DECL_SOURCE_LINE (decl
),
1311 "storage size of `%s' isn't known",
1312 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1313 TREE_ASM_WRITTEN (decl
) = 1;
1317 /* The first declaration of a variable that comes through this function
1318 decides whether it is global (in C, has external linkage)
1319 or local (in C, has internal linkage). So do nothing more
1320 if this function has already run. */
1322 if (TREE_ASM_WRITTEN (decl
))
1325 /* Make sure ENCODE_SECTION_INFO is invoked before we set ASM_WRITTEN. */
1326 decl_rtl
= DECL_RTL (decl
);
1328 TREE_ASM_WRITTEN (decl
) = 1;
1330 /* Do no output if -fsyntax-only. */
1331 if (flag_syntax_only
)
1336 if (! dont_output_data
1337 && ! host_integerp (DECL_SIZE_UNIT (decl
), 1))
1339 error_with_decl (decl
, "size of variable `%s' is too large");
1343 name
= XSTR (XEXP (decl_rtl
, 0), 0);
1344 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
)
1345 && ! first_global_object_name
1346 && ! (DECL_COMMON (decl
) && (DECL_INITIAL (decl
) == 0
1347 || DECL_INITIAL (decl
) == error_mark_node
))
1348 && ! DECL_WEAK (decl
)
1349 && ! DECL_ONE_ONLY (decl
))
1354 STRIP_NAME_ENCODING (p
, name
);
1355 xname
= permalloc (strlen (p
) + 1);
1357 first_global_object_name
= xname
;
1360 /* Compute the alignment of this data. */
1362 align
= DECL_ALIGN (decl
);
1364 /* In the case for initialing an array whose length isn't specified,
1365 where we have not yet been able to do the layout,
1366 figure out the proper alignment now. */
1367 if (dont_output_data
&& DECL_SIZE (decl
) == 0
1368 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
1369 align
= MAX (align
, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl
))));
1371 /* Some object file formats have a maximum alignment which they support.
1372 In particular, a.out format supports a maximum alignment of 4. */
1373 #ifndef MAX_OFILE_ALIGNMENT
1374 #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT
1376 if (align
> MAX_OFILE_ALIGNMENT
)
1378 warning_with_decl (decl
,
1379 "alignment of `%s' is greater than maximum object file alignment. Using %d.",
1380 MAX_OFILE_ALIGNMENT
/BITS_PER_UNIT
);
1381 align
= MAX_OFILE_ALIGNMENT
;
1384 /* On some machines, it is good to increase alignment sometimes. */
1385 #ifdef DATA_ALIGNMENT
1386 align
= DATA_ALIGNMENT (TREE_TYPE (decl
), align
);
1388 #ifdef CONSTANT_ALIGNMENT
1389 if (DECL_INITIAL (decl
) != 0 && DECL_INITIAL (decl
) != error_mark_node
)
1390 align
= CONSTANT_ALIGNMENT (DECL_INITIAL (decl
), align
);
1393 /* Reset the alignment in case we have made it tighter, so we can benefit
1394 from it in get_pointer_alignment. */
1395 DECL_ALIGN (decl
) = align
;
1397 /* Handle uninitialized definitions. */
1399 if ((DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
)
1400 /* If the target can't output uninitialized but not common global data
1401 in .bss, then we have to use .data. */
1402 #if ! defined ASM_EMIT_BSS
1403 && DECL_COMMON (decl
)
1405 && DECL_SECTION_NAME (decl
) == NULL_TREE
1406 && ! dont_output_data
)
1408 unsigned HOST_WIDE_INT size
= tree_low_cst (DECL_SIZE_UNIT (decl
), 1);
1409 unsigned HOST_WIDE_INT rounded
= size
;
1411 /* Don't allocate zero bytes of common,
1412 since that means "undefined external" in the linker. */
1416 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1417 so that each uninitialized object starts on such a boundary. */
1418 rounded
+= (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1;
1419 rounded
= (rounded
/ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1420 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1422 /* Don't continue this line--convex cc version 4.1 would lose. */
1423 #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS)
1424 if ((unsigned HOST_WIDE_INT
) DECL_ALIGN (decl
) / BITS_PER_UNIT
> rounded
)
1426 (decl
, "requested alignment for %s is greater than implemented alignment of %d.",rounded
);
1429 asm_emit_uninitialised (decl
, name
, size
, rounded
);
1434 /* Handle initialized definitions.
1435 Also handle uninitialized global definitions if -fno-common and the
1436 target doesn't support ASM_OUTPUT_BSS. */
1438 /* First make the assembler name(s) global if appropriate. */
1439 if (TREE_PUBLIC (decl
) && DECL_NAME (decl
))
1441 #ifdef ASM_WEAKEN_LABEL
1442 if (DECL_WEAK (decl
))
1444 ASM_WEAKEN_LABEL (asm_out_file
, name
);
1445 /* Remove this variable from the pending weak list so that
1446 we do not emit multiple .weak directives for it. */
1447 remove_from_pending_weak_list
1448 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
1452 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1455 /* Output any data that we will need to use the address of. */
1456 if (DECL_INITIAL (decl
) == error_mark_node
)
1457 reloc
= contains_pointers_p (TREE_TYPE (decl
));
1458 else if (DECL_INITIAL (decl
))
1459 reloc
= output_addressed_constants (DECL_INITIAL (decl
));
1461 /* Switch to the appropriate section. */
1462 resolve_unique_section (decl
, reloc
);
1463 variable_section (decl
, reloc
);
1465 /* dbxout.c needs to know this. */
1466 if (in_text_section ())
1467 DECL_IN_TEXT_SECTION (decl
) = 1;
1469 /* Output the alignment of this data. */
1470 if (align
> BITS_PER_UNIT
)
1471 ASM_OUTPUT_ALIGN (asm_out_file
,
1472 floor_log2 (DECL_ALIGN (decl
) / BITS_PER_UNIT
));
1474 /* Do any machine/system dependent processing of the object. */
1475 #ifdef ASM_DECLARE_OBJECT_NAME
1476 last_assemble_variable_decl
= decl
;
1477 ASM_DECLARE_OBJECT_NAME (asm_out_file
, name
, decl
);
1479 /* Standard thing is just output label for the object. */
1480 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1481 #endif /* ASM_DECLARE_OBJECT_NAME */
1483 if (!dont_output_data
)
1485 if (DECL_INITIAL (decl
))
1486 /* Output the actual data. */
1487 output_constant (DECL_INITIAL (decl
),
1488 tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1490 /* Leave space for it. */
1491 assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl
), 1));
1495 /* Return 1 if type TYPE contains any pointers. */
1498 contains_pointers_p (type
)
1501 switch (TREE_CODE (type
))
1504 case REFERENCE_TYPE
:
1505 /* I'm not sure whether OFFSET_TYPE needs this treatment,
1506 so I'll play safe and return 1. */
1512 case QUAL_UNION_TYPE
:
1515 /* For a type that has fields, see if the fields have pointers. */
1516 for (fields
= TYPE_FIELDS (type
); fields
; fields
= TREE_CHAIN (fields
))
1517 if (TREE_CODE (fields
) == FIELD_DECL
1518 && contains_pointers_p (TREE_TYPE (fields
)))
1524 /* An array type contains pointers if its element type does. */
1525 return contains_pointers_p (TREE_TYPE (type
));
1532 /* Output something to declare an external symbol to the assembler.
1533 (Most assemblers don't need this, so we normally output nothing.)
1534 Do nothing if DECL is not external. */
1537 assemble_external (decl
)
1538 tree decl ATTRIBUTE_UNUSED
;
1540 /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the
1541 main body of this code is only rarely exercised. To provide some
1542 testing, on all platforms, we make sure that the ASM_OUT_FILE is
1543 open. If it's not, we should not be calling this function. */
1547 #ifdef ASM_OUTPUT_EXTERNAL
1548 if (DECL_P (decl
) && DECL_EXTERNAL (decl
) && TREE_PUBLIC (decl
))
1550 rtx rtl
= DECL_RTL (decl
);
1552 if (GET_CODE (rtl
) == MEM
&& GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
1553 && ! SYMBOL_REF_USED (XEXP (rtl
, 0)))
1555 /* Some systems do require some output. */
1556 SYMBOL_REF_USED (XEXP (rtl
, 0)) = 1;
1557 ASM_OUTPUT_EXTERNAL (asm_out_file
, decl
, XSTR (XEXP (rtl
, 0), 0));
1563 /* Similar, for calling a library function FUN. */
1566 assemble_external_libcall (fun
)
1567 rtx fun ATTRIBUTE_UNUSED
;
1569 #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL
1570 /* Declare library function name external when first used, if nec. */
1571 if (! SYMBOL_REF_USED (fun
))
1573 SYMBOL_REF_USED (fun
) = 1;
1574 ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file
, fun
);
1579 /* Declare the label NAME global. */
1582 assemble_global (name
)
1585 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
1588 /* Assemble a label named NAME. */
1591 assemble_label (name
)
1594 ASM_OUTPUT_LABEL (asm_out_file
, name
);
1597 /* Output to FILE a reference to the assembler name of a C-level name NAME.
1598 If NAME starts with a *, the rest of NAME is output verbatim.
1599 Otherwise NAME is transformed in an implementation-defined way
1600 (usually by the addition of an underscore).
1601 Many macros in the tm file are defined to call this function. */
1604 assemble_name (file
, name
)
1608 const char *real_name
;
1611 STRIP_NAME_ENCODING (real_name
, name
);
1612 if (flag_prefix_function_name
1613 && ! memcmp (real_name
, CHKR_PREFIX
, CHKR_PREFIX_SIZE
))
1614 real_name
= real_name
+ CHKR_PREFIX_SIZE
;
1616 id
= maybe_get_identifier (real_name
);
1618 TREE_SYMBOL_REFERENCED (id
) = 1;
1621 fputs (&name
[1], file
);
1623 ASM_OUTPUT_LABELREF (file
, name
);
1626 /* Allocate SIZE bytes writable static space with a gensym name
1627 and return an RTX to refer to its address. */
1630 assemble_static_space (size
)
1634 const char *namestring
;
1638 if (flag_shared_data
)
1642 ASM_GENERATE_INTERNAL_LABEL (name
, "LF", const_labelno
);
1644 namestring
= ggc_strdup (name
);
1646 x
= gen_rtx_SYMBOL_REF (Pmode
, namestring
);
1648 #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL
1649 ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file
, NULL_TREE
, name
, size
,
1652 #ifdef ASM_OUTPUT_ALIGNED_LOCAL
1653 ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file
, name
, size
, BIGGEST_ALIGNMENT
);
1656 /* Round size up to multiple of BIGGEST_ALIGNMENT bits
1657 so that each uninitialized object starts on such a boundary. */
1658 /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */
1659 int rounded ATTRIBUTE_UNUSED
1660 = ((size
+ (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
) - 1)
1661 / (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
)
1662 * (BIGGEST_ALIGNMENT
/ BITS_PER_UNIT
));
1663 ASM_OUTPUT_LOCAL (asm_out_file
, name
, size
, rounded
);
1670 /* Assemble the static constant template for function entry trampolines.
1671 This is done at most once per compilation.
1672 Returns an RTX for the address of the template. */
1674 #ifdef TRAMPOLINE_TEMPLATE
1676 assemble_trampoline_template ()
1682 /* By default, put trampoline templates in read-only data section. */
1684 #ifdef TRAMPOLINE_SECTION
1685 TRAMPOLINE_SECTION ();
1687 readonly_data_section ();
1690 /* Write the assembler code to define one. */
1691 align
= floor_log2 (TRAMPOLINE_ALIGNMENT
/ BITS_PER_UNIT
);
1693 ASM_OUTPUT_ALIGN (asm_out_file
, align
);
1695 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LTRAMP", 0);
1696 TRAMPOLINE_TEMPLATE (asm_out_file
);
1698 /* Record the rtl to refer to it. */
1699 ASM_GENERATE_INTERNAL_LABEL (label
, "LTRAMP", 0);
1700 name
= ggc_strdup (label
);
1701 return gen_rtx_SYMBOL_REF (Pmode
, name
);
1705 /* Assemble the integer constant X into an object of SIZE bytes.
1706 X must be either a CONST_INT or CONST_DOUBLE.
1708 Return 1 if we were able to output the constant, otherwise 0. If FORCE is
1709 non-zero, abort if we can't output the constant. */
1712 assemble_integer (x
, size
, force
)
1717 /* First try to use the standard 1, 2, 4, 8, and 16 byte
1718 ASM_OUTPUT... macros. */
1722 #ifdef ASM_OUTPUT_CHAR
1724 ASM_OUTPUT_CHAR (asm_out_file
, x
);
1728 #ifdef ASM_OUTPUT_SHORT
1730 ASM_OUTPUT_SHORT (asm_out_file
, x
);
1734 #ifdef ASM_OUTPUT_INT
1736 ASM_OUTPUT_INT (asm_out_file
, x
);
1740 #ifdef ASM_OUTPUT_DOUBLE_INT
1742 ASM_OUTPUT_DOUBLE_INT (asm_out_file
, x
);
1746 #ifdef ASM_OUTPUT_QUADRUPLE_INT
1748 ASM_OUTPUT_QUADRUPLE_INT (asm_out_file
, x
);
1753 /* If we couldn't do it that way, there are two other possibilities: First,
1754 if the machine can output an explicit byte and this is a 1 byte constant,
1755 we can use ASM_OUTPUT_BYTE. */
1757 #ifdef ASM_OUTPUT_BYTE
1758 if (size
== 1 && GET_CODE (x
) == CONST_INT
)
1760 ASM_OUTPUT_BYTE (asm_out_file
, INTVAL (x
));
1765 /* Finally, if SIZE is larger than a single word, try to output the constant
1766 one word at a time. */
1768 if (size
> UNITS_PER_WORD
)
1771 enum machine_mode mode
1772 = mode_for_size (size
* BITS_PER_UNIT
, MODE_INT
, 0);
1775 for (i
= 0; i
< size
/ UNITS_PER_WORD
; i
++)
1777 word
= operand_subword (x
, i
, 0, mode
);
1782 if (! assemble_integer (word
, UNITS_PER_WORD
, 0))
1786 if (i
== size
/ UNITS_PER_WORD
)
1788 /* If we output at least one word and then could not finish,
1789 there is no valid way to continue. */
1800 /* Assemble the floating-point constant D into an object of size MODE. */
1801 struct assemble_real_args
1804 enum machine_mode mode
;
1811 struct assemble_real_args
*args
= (struct assemble_real_args
*) p
;
1812 REAL_VALUE_TYPE
*d
= args
->d
;
1813 enum machine_mode mode
= args
->mode
;
1817 #ifdef ASM_OUTPUT_BYTE_FLOAT
1819 ASM_OUTPUT_BYTE_FLOAT (asm_out_file
, *d
);
1822 #ifdef ASM_OUTPUT_SHORT_FLOAT
1824 ASM_OUTPUT_SHORT_FLOAT (asm_out_file
, *d
);
1827 #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT
1829 ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file
, *d
);
1832 #ifdef ASM_OUTPUT_FLOAT
1834 ASM_OUTPUT_FLOAT (asm_out_file
, *d
);
1838 #ifdef ASM_OUTPUT_DOUBLE
1840 ASM_OUTPUT_DOUBLE (asm_out_file
, *d
);
1844 #ifdef ASM_OUTPUT_LONG_DOUBLE
1847 ASM_OUTPUT_LONG_DOUBLE (asm_out_file
, *d
);
1857 assemble_real (d
, mode
)
1859 enum machine_mode mode
;
1861 struct assemble_real_args args
;
1865 if (do_float_handler (assemble_real_1
, (PTR
) &args
))
1868 internal_error ("floating point trap outputting a constant");
1871 /* Here we combine duplicate floating constants to make
1872 CONST_DOUBLE rtx's, and force those out to memory when necessary. */
1874 /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints.
1875 For an integer, I0 is the low-order word and I1 is the high-order word.
1876 For a real number, I0 is the word with the low address
1877 and I1 is the word with the high address. */
1880 immed_double_const (i0
, i1
, mode
)
1881 HOST_WIDE_INT i0
, i1
;
1882 enum machine_mode mode
;
1886 if (GET_MODE_CLASS (mode
) == MODE_INT
1887 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
1889 /* We clear out all bits that don't belong in MODE, unless they and our
1890 sign bit are all one. So we get either a reasonable negative value
1891 or a reasonable unsigned value for this mode. */
1892 int width
= GET_MODE_BITSIZE (mode
);
1893 if (width
< HOST_BITS_PER_WIDE_INT
1894 && ((i0
& ((HOST_WIDE_INT
) (-1) << (width
- 1)))
1895 != ((HOST_WIDE_INT
) (-1) << (width
- 1))))
1896 i0
&= ((HOST_WIDE_INT
) 1 << width
) - 1, i1
= 0;
1897 else if (width
== HOST_BITS_PER_WIDE_INT
1898 && ! (i1
== ~0 && i0
< 0))
1900 else if (width
> 2 * HOST_BITS_PER_WIDE_INT
)
1901 /* We cannot represent this value as a constant. */
1904 /* If this would be an entire word for the target, but is not for
1905 the host, then sign-extend on the host so that the number will look
1906 the same way on the host that it would on the target.
1908 For example, when building a 64 bit alpha hosted 32 bit sparc
1909 targeted compiler, then we want the 32 bit unsigned value -1 to be
1910 represented as a 64 bit value -1, and not as 0x00000000ffffffff.
1911 The later confuses the sparc backend. */
1913 if (width
< HOST_BITS_PER_WIDE_INT
1914 && (i0
& ((HOST_WIDE_INT
) 1 << (width
- 1))))
1915 i0
|= ((HOST_WIDE_INT
) (-1) << width
);
1917 /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT.
1919 ??? Strictly speaking, this is wrong if we create a CONST_INT
1920 for a large unsigned constant with the size of MODE being
1921 HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a
1922 wider mode. In that case we will mis-interpret it as a negative
1925 Unfortunately, the only alternative is to make a CONST_DOUBLE
1926 for any constant in any mode if it is an unsigned constant larger
1927 than the maximum signed integer in an int on the host. However,
1928 doing this will break everyone that always expects to see a CONST_INT
1929 for SImode and smaller.
1931 We have always been making CONST_INTs in this case, so nothing new
1934 if (width
<= HOST_BITS_PER_WIDE_INT
)
1935 i1
= (i0
< 0) ? ~(HOST_WIDE_INT
) 0 : 0;
1937 /* If this integer fits in one word, return a CONST_INT. */
1938 if ((i1
== 0 && i0
>= 0)
1939 || (i1
== ~0 && i0
< 0))
1940 return GEN_INT (i0
);
1942 /* We use VOIDmode for integers. */
1946 /* Search the chain for an existing CONST_DOUBLE with the right value.
1947 If one is found, return it. */
1949 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
1950 if (CONST_DOUBLE_LOW (r
) == i0
&& CONST_DOUBLE_HIGH (r
) == i1
1951 && GET_MODE (r
) == mode
)
1954 /* No; make a new one and add it to the chain. */
1955 r
= gen_rtx_CONST_DOUBLE (mode
, const0_rtx
, i0
, i1
);
1957 /* Don't touch const_double_chain if not inside any function. */
1958 if (current_function_decl
!= 0)
1960 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
1961 const_double_chain
= r
;
1967 /* Return a CONST_DOUBLE for a specified `double' value
1968 and machine mode. */
1971 immed_real_const_1 (d
, mode
)
1973 enum machine_mode mode
;
1975 union real_extract u
;
1978 /* Get the desired `double' value as a sequence of ints
1979 since that is how they are stored in a CONST_DOUBLE. */
1983 /* Detect special cases. */
1984 if (REAL_VALUES_IDENTICAL (dconst0
, d
))
1985 return CONST0_RTX (mode
);
1987 /* Check for NaN first, because some ports (specifically the i386) do not
1988 emit correct ieee-fp code by default, and thus will generate a core
1989 dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL
1990 does a floating point comparison. */
1991 else if (! REAL_VALUE_ISNAN (d
) && REAL_VALUES_EQUAL (dconst1
, d
))
1992 return CONST1_RTX (mode
);
1994 if (sizeof u
== sizeof (HOST_WIDE_INT
))
1995 return immed_double_const (u
.i
[0], 0, mode
);
1996 if (sizeof u
== 2 * sizeof (HOST_WIDE_INT
))
1997 return immed_double_const (u
.i
[0], u
.i
[1], mode
);
1999 /* The rest of this function handles the case where
2000 a float value requires more than 2 ints of space.
2001 It will be deleted as dead code on machines that don't need it. */
2003 /* Search the chain for an existing CONST_DOUBLE with the right value.
2004 If one is found, return it. */
2006 for (r
= const_double_chain
; r
; r
= CONST_DOUBLE_CHAIN (r
))
2007 if (! memcmp ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
)
2008 && GET_MODE (r
) == mode
)
2011 /* No; make a new one and add it to the chain.
2013 We may be called by an optimizer which may be discarding any memory
2014 allocated during its processing (such as combine and loop). However,
2015 we will be leaving this constant on the chain, so we cannot tolerate
2017 r
= rtx_alloc (CONST_DOUBLE
);
2019 memcpy ((char *) &CONST_DOUBLE_LOW (r
), (char *) &u
, sizeof u
);
2021 /* If we aren't inside a function, don't put r on the
2022 const_double_chain. */
2023 if (current_function_decl
!= 0)
2025 CONST_DOUBLE_CHAIN (r
) = const_double_chain
;
2026 const_double_chain
= r
;
2029 CONST_DOUBLE_CHAIN (r
) = NULL_RTX
;
2031 /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the
2032 chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM
2033 is only through force_const_mem. */
2035 CONST_DOUBLE_MEM (r
) = const0_rtx
;
2040 /* Return a CONST_DOUBLE rtx for a value specified by EXP,
2041 which must be a REAL_CST tree node. */
2044 immed_real_const (exp
)
2047 return immed_real_const_1 (TREE_REAL_CST (exp
), TYPE_MODE (TREE_TYPE (exp
)));
2050 /* At the end of a function, forget the memory-constants
2051 previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain.
2052 Also clear out real_constant_chain and clear out all the chain-pointers. */
2055 clear_const_double_mem ()
2057 register rtx r
, next
;
2058 enum machine_mode mode
;
2061 for (r
= const_double_chain
; r
; r
= next
)
2063 next
= CONST_DOUBLE_CHAIN (r
);
2064 CONST_DOUBLE_CHAIN (r
) = 0;
2065 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2067 const_double_chain
= 0;
2069 for (i
= 0; i
<= 2; i
++)
2070 for (mode
= GET_CLASS_NARROWEST_MODE (MODE_FLOAT
); mode
!= VOIDmode
;
2071 mode
= GET_MODE_WIDER_MODE (mode
))
2073 r
= const_tiny_rtx
[i
][(int) mode
];
2074 CONST_DOUBLE_CHAIN (r
) = 0;
2075 CONST_DOUBLE_MEM (r
) = cc0_rtx
;
2079 /* Given an expression EXP with a constant value,
2080 reduce it to the sum of an assembler symbol and an integer.
2081 Store them both in the structure *VALUE.
2082 Abort if EXP does not reduce. */
2087 HOST_WIDE_INT offset
;
2091 decode_addr_const (exp
, value
)
2093 struct addr_const
*value
;
2095 register tree target
= TREE_OPERAND (exp
, 0);
2096 register int offset
= 0;
2101 if (TREE_CODE (target
) == COMPONENT_REF
2102 && host_integerp (byte_position (TREE_OPERAND (target
, 1)), 0))
2105 offset
+= int_byte_position (TREE_OPERAND (target
, 1));
2106 target
= TREE_OPERAND (target
, 0);
2108 else if (TREE_CODE (target
) == ARRAY_REF
2109 || TREE_CODE (target
) == ARRAY_RANGE_REF
)
2111 offset
+= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target
)), 1)
2112 * tree_low_cst (TREE_OPERAND (target
, 1), 0));
2113 target
= TREE_OPERAND (target
, 0);
2119 switch (TREE_CODE (target
))
2123 x
= DECL_RTL (target
);
2127 x
= gen_rtx_MEM (FUNCTION_MODE
,
2128 gen_rtx_LABEL_REF (VOIDmode
,
2129 label_rtx (TREE_OPERAND (exp
, 0))));
2137 x
= TREE_CST_RTL (target
);
2144 if (GET_CODE (x
) != MEM
)
2149 value
->offset
= offset
;
2152 enum kind
{ RTX_DOUBLE
, RTX_INT
};
2155 ENUM_BITFIELD(kind
) kind
: 16;
2156 ENUM_BITFIELD(machine_mode
) mode
: 16;
2158 union real_extract du
;
2159 struct addr_const addr
;
2160 struct {HOST_WIDE_INT high
, low
;} di
;
2164 /* Uniquize all constants that appear in memory.
2165 Each constant in memory thus far output is recorded
2166 in `const_hash_table' with a `struct constant_descriptor'
2167 that contains a polish representation of the value of
2170 We cannot store the trees in the hash table
2171 because the trees may be temporary. */
2173 struct constant_descriptor
2175 struct constant_descriptor
*next
;
2178 /* Make sure the data is reasonably aligned. */
2181 unsigned char contents
[1];
2182 #ifdef HAVE_LONG_DOUBLE
2191 #define MAX_HASH_TABLE 1009
2192 static struct constant_descriptor
*const_hash_table
[MAX_HASH_TABLE
];
2194 #define STRHASH(x) ((hashval_t)((long)(x) >> 3))
2196 struct deferred_string
2203 static htab_t const_str_htab
;
2205 /* Mark a const_hash_table descriptor for GC. */
2208 mark_const_hash_entry (ptr
)
2211 struct constant_descriptor
*desc
= * (struct constant_descriptor
**) ptr
;
2215 ggc_mark_rtx (desc
->rtl
);
2220 /* Mark the hash-table element X (which is really a pointer to an
2221 struct deferred_string *). */
2224 mark_const_str_htab_1 (x
, data
)
2226 void *data ATTRIBUTE_UNUSED
;
2228 ggc_mark_tree (((struct deferred_string
*) *x
)->exp
);
2232 /* Mark a const_str_htab for GC. */
2235 mark_const_str_htab (htab
)
2238 htab_traverse (*((htab_t
*) htab
), mark_const_str_htab_1
, NULL
);
2241 /* Returns a hash code for X (which is a really a
2242 struct deferred_string *). */
2245 const_str_htab_hash (x
)
2248 return STRHASH (((const struct deferred_string
*) x
)->label
);
2251 /* Returns non-zero if the value represented by X (which is really a
2252 struct deferred_string *) is the same as that given by Y
2253 (which is really a char *). */
2256 const_str_htab_eq (x
, y
)
2260 return (((const struct deferred_string
*) x
)->label
== (const char *) y
);
2263 /* Delete the hash table entry dfsp. */
2266 const_str_htab_del (dfsp
)
2272 /* Compute a hash code for a constant expression. */
2278 register const char *p
;
2279 register int len
, hi
, i
;
2280 register enum tree_code code
= TREE_CODE (exp
);
2282 /* Either set P and LEN to the address and len of something to hash and
2283 exit the switch or return a value. */
2288 p
= (char *) &TREE_INT_CST (exp
);
2289 len
= sizeof TREE_INT_CST (exp
);
2293 p
= (char *) &TREE_REAL_CST (exp
);
2294 len
= sizeof TREE_REAL_CST (exp
);
2298 p
= TREE_STRING_POINTER (exp
);
2299 len
= TREE_STRING_LENGTH (exp
);
2303 return (const_hash (TREE_REALPART (exp
)) * 5
2304 + const_hash (TREE_IMAGPART (exp
)));
2307 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2311 len
= int_size_in_bytes (TREE_TYPE (exp
));
2312 tmp
= (char *) alloca (len
);
2313 get_set_constructor_bytes (exp
, (unsigned char *) tmp
, len
);
2321 /* For record type, include the type in the hashing.
2322 We do not do so for array types
2323 because (1) the sizes of the elements are sufficient
2324 and (2) distinct array types can have the same constructor.
2325 Instead, we include the array size because the constructor could
2327 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2328 hi
= ((unsigned long) TREE_TYPE (exp
) & ((1 << HASHBITS
) - 1))
2331 hi
= ((5 + int_size_in_bytes (TREE_TYPE (exp
)))
2332 & ((1 << HASHBITS
) - 1)) % MAX_HASH_TABLE
;
2334 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2335 if (TREE_VALUE (link
))
2337 = (hi
* 603 + const_hash (TREE_VALUE (link
))) % MAX_HASH_TABLE
;
2344 struct addr_const value
;
2346 decode_addr_const (exp
, &value
);
2347 if (GET_CODE (value
.base
) == SYMBOL_REF
)
2349 /* Don't hash the address of the SYMBOL_REF;
2350 only use the offset and the symbol name. */
2352 p
= XSTR (value
.base
, 0);
2353 for (i
= 0; p
[i
] != 0; i
++)
2354 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2356 else if (GET_CODE (value
.base
) == LABEL_REF
)
2357 hi
= value
.offset
+ CODE_LABEL_NUMBER (XEXP (value
.base
, 0)) * 13;
2361 hi
&= (1 << HASHBITS
) - 1;
2362 hi
%= MAX_HASH_TABLE
;
2368 return (const_hash (TREE_OPERAND (exp
, 0)) * 9
2369 + const_hash (TREE_OPERAND (exp
, 1)));
2373 case NON_LVALUE_EXPR
:
2374 return const_hash (TREE_OPERAND (exp
, 0)) * 7 + 2;
2377 /* A language specific constant. Just hash the code. */
2378 return (int) code
% MAX_HASH_TABLE
;
2381 /* Compute hashing function */
2383 for (i
= 0; i
< len
; i
++)
2384 hi
= ((hi
* 613) + (unsigned) (p
[i
]));
2386 hi
&= (1 << HASHBITS
) - 1;
2387 hi
%= MAX_HASH_TABLE
;
2391 /* Compare a constant expression EXP with a constant-descriptor DESC.
2392 Return 1 if DESC describes a constant with the same value as EXP. */
2395 compare_constant (exp
, desc
)
2397 struct constant_descriptor
*desc
;
2399 return 0 != compare_constant_1 (exp
, desc
->u
.contents
);
2402 /* Compare constant expression EXP with a substring P of a constant descriptor.
2403 If they match, return a pointer to the end of the substring matched.
2404 If they do not match, return 0.
2406 Since descriptors are written in polish prefix notation,
2407 this function can be used recursively to test one operand of EXP
2408 against a subdescriptor, and if it succeeds it returns the
2409 address of the subdescriptor for the next operand. */
2411 static const unsigned char *
2412 compare_constant_1 (exp
, p
)
2414 const unsigned char *p
;
2416 register const unsigned char *strp
;
2418 register enum tree_code code
= TREE_CODE (exp
);
2420 if (code
!= (enum tree_code
) *p
++)
2423 /* Either set STRP, P and LEN to pointers and length to compare and exit the
2424 switch, or return the result of the comparison. */
2429 /* Integer constants are the same only if the same width of type. */
2430 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2433 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2434 len
= sizeof TREE_INT_CST (exp
);
2438 /* Real constants are the same only if the same width of type. */
2439 if (*p
++ != TYPE_PRECISION (TREE_TYPE (exp
)))
2442 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2443 len
= sizeof TREE_REAL_CST (exp
);
2447 if (flag_writable_strings
)
2450 if ((enum machine_mode
) *p
++ != TYPE_MODE (TREE_TYPE (exp
)))
2453 strp
= (const unsigned char *)TREE_STRING_POINTER (exp
);
2454 len
= TREE_STRING_LENGTH (exp
);
2455 if (memcmp ((char *) &TREE_STRING_LENGTH (exp
), p
,
2456 sizeof TREE_STRING_LENGTH (exp
)))
2459 p
+= sizeof TREE_STRING_LENGTH (exp
);
2463 p
= compare_constant_1 (TREE_REALPART (exp
), p
);
2467 return compare_constant_1 (TREE_IMAGPART (exp
), p
);
2470 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2472 int xlen
= len
= int_size_in_bytes (TREE_TYPE (exp
));
2473 unsigned char *tmp
= (unsigned char *) alloca (len
);
2475 get_set_constructor_bytes (exp
, tmp
, len
);
2476 strp
= (unsigned char *) tmp
;
2477 if (memcmp ((char *) &xlen
, p
, sizeof xlen
))
2486 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2488 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2489 int have_purpose
= 0;
2491 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2492 if (TREE_PURPOSE (link
))
2495 if (memcmp ((char *) &length
, p
, sizeof length
))
2500 /* For record constructors, insist that the types match.
2501 For arrays, just verify both constructors are for arrays.
2502 Then insist that either both or none have any TREE_PURPOSE
2504 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2505 type
= TREE_TYPE (exp
);
2509 if (memcmp ((char *) &type
, p
, sizeof type
))
2512 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2514 if (memcmp ((char *) &mode
, p
, sizeof mode
))
2522 if (memcmp ((char *) &have_purpose
, p
, sizeof have_purpose
))
2525 p
+= sizeof have_purpose
;
2527 /* For arrays, insist that the size in bytes match. */
2528 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2530 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2532 if (memcmp ((char *) &size
, p
, sizeof size
))
2538 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2540 if (TREE_VALUE (link
))
2542 if ((p
= compare_constant_1 (TREE_VALUE (link
), p
)) == 0)
2549 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2555 if (TREE_PURPOSE (link
)
2556 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2558 if (memcmp ((char *) &TREE_PURPOSE (link
), p
,
2559 sizeof TREE_PURPOSE (link
)))
2562 p
+= sizeof TREE_PURPOSE (link
);
2564 else if (TREE_PURPOSE (link
))
2566 if ((p
= compare_constant_1 (TREE_PURPOSE (link
), p
)) == 0)
2569 else if (have_purpose
)
2573 if (memcmp ((char *) &zero
, p
, sizeof zero
))
2585 struct addr_const value
;
2587 decode_addr_const (exp
, &value
);
2588 strp
= (unsigned char *) &value
.offset
;
2589 len
= sizeof value
.offset
;
2590 /* Compare the offset. */
2592 if (*p
++ != *strp
++)
2595 /* Compare symbol name. */
2596 strp
= (const unsigned char *) XSTR (value
.base
, 0);
2597 len
= strlen ((const char *) strp
) + 1;
2604 p
= compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2608 return compare_constant_1 (TREE_OPERAND (exp
, 1), p
);
2612 case NON_LVALUE_EXPR
:
2613 return compare_constant_1 (TREE_OPERAND (exp
, 0), p
);
2616 if (lang_expand_constant
)
2618 exp
= (*lang_expand_constant
) (exp
);
2619 return compare_constant_1 (exp
, p
);
2624 /* Compare constant contents. */
2626 if (*p
++ != *strp
++)
2632 /* Construct a constant descriptor for the expression EXP.
2633 It is up to the caller to enter the descriptor in the hash table. */
2635 static struct constant_descriptor
*
2636 record_constant (exp
)
2639 struct constant_descriptor
*next
= 0;
2644 /* Make a struct constant_descriptor. The first three pointers will
2645 be filled in later. Here we just leave space for them. */
2647 obstack_grow (&permanent_obstack
, (char *) &next
, sizeof next
);
2648 obstack_grow (&permanent_obstack
, (char *) &label
, sizeof label
);
2649 obstack_grow (&permanent_obstack
, (char *) &rtl
, sizeof rtl
);
2651 /* Align the descriptor for the data payload. */
2652 pad
= (offsetof (struct constant_descriptor
, u
)
2653 - offsetof(struct constant_descriptor
, rtl
)
2654 - sizeof(next
->rtl
));
2656 obstack_blank (&permanent_obstack
, pad
);
2658 record_constant_1 (exp
);
2659 return (struct constant_descriptor
*) obstack_finish (&permanent_obstack
);
2662 /* Add a description of constant expression EXP
2663 to the object growing in `permanent_obstack'.
2664 No need to return its address; the caller will get that
2665 from the obstack when the object is complete. */
2668 record_constant_1 (exp
)
2671 register const unsigned char *strp
;
2673 register enum tree_code code
= TREE_CODE (exp
);
2675 obstack_1grow (&permanent_obstack
, (unsigned int) code
);
2680 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2681 strp
= (unsigned char *) &TREE_INT_CST (exp
);
2682 len
= sizeof TREE_INT_CST (exp
);
2686 obstack_1grow (&permanent_obstack
, TYPE_PRECISION (TREE_TYPE (exp
)));
2687 strp
= (unsigned char *) &TREE_REAL_CST (exp
);
2688 len
= sizeof TREE_REAL_CST (exp
);
2692 if (flag_writable_strings
)
2695 obstack_1grow (&permanent_obstack
, TYPE_MODE (TREE_TYPE (exp
)));
2696 strp
= (const unsigned char *) TREE_STRING_POINTER (exp
);
2697 len
= TREE_STRING_LENGTH (exp
);
2698 obstack_grow (&permanent_obstack
, (char *) &TREE_STRING_LENGTH (exp
),
2699 sizeof TREE_STRING_LENGTH (exp
));
2703 record_constant_1 (TREE_REALPART (exp
));
2704 record_constant_1 (TREE_IMAGPART (exp
));
2708 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2710 int nbytes
= int_size_in_bytes (TREE_TYPE (exp
));
2711 obstack_grow (&permanent_obstack
, &nbytes
, sizeof (nbytes
));
2712 obstack_blank (&permanent_obstack
, nbytes
);
2713 get_set_constructor_bytes
2714 (exp
, (unsigned char *) permanent_obstack
.next_free
-nbytes
,
2721 int length
= list_length (CONSTRUCTOR_ELTS (exp
));
2722 enum machine_mode mode
= TYPE_MODE (TREE_TYPE (exp
));
2724 int have_purpose
= 0;
2726 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2727 if (TREE_PURPOSE (link
))
2730 obstack_grow (&permanent_obstack
, (char *) &length
, sizeof length
);
2732 /* For record constructors, insist that the types match.
2733 For arrays, just verify both constructors are for arrays
2734 of the same mode. Then insist that either both or none
2735 have any TREE_PURPOSE values. */
2736 if (TREE_CODE (TREE_TYPE (exp
)) == RECORD_TYPE
)
2737 type
= TREE_TYPE (exp
);
2741 obstack_grow (&permanent_obstack
, (char *) &type
, sizeof type
);
2742 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2743 obstack_grow (&permanent_obstack
, &mode
, sizeof mode
);
2745 obstack_grow (&permanent_obstack
, (char *) &have_purpose
,
2746 sizeof have_purpose
);
2748 /* For arrays, insist that the size in bytes match. */
2749 if (TREE_CODE (TREE_TYPE (exp
)) == ARRAY_TYPE
)
2751 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (exp
));
2752 obstack_grow (&permanent_obstack
, (char *) &size
, sizeof size
);
2755 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
2757 if (TREE_VALUE (link
))
2758 record_constant_1 (TREE_VALUE (link
));
2763 obstack_grow (&permanent_obstack
,
2764 (char *) &zero
, sizeof zero
);
2767 if (TREE_PURPOSE (link
)
2768 && TREE_CODE (TREE_PURPOSE (link
)) == FIELD_DECL
)
2769 obstack_grow (&permanent_obstack
,
2770 (char *) &TREE_PURPOSE (link
),
2771 sizeof TREE_PURPOSE (link
));
2772 else if (TREE_PURPOSE (link
))
2773 record_constant_1 (TREE_PURPOSE (link
));
2774 else if (have_purpose
)
2778 obstack_grow (&permanent_obstack
,
2779 (char *) &zero
, sizeof zero
);
2787 struct addr_const value
;
2789 decode_addr_const (exp
, &value
);
2790 /* Record the offset. */
2791 obstack_grow (&permanent_obstack
,
2792 (char *) &value
.offset
, sizeof value
.offset
);
2794 switch (GET_CODE (value
.base
))
2797 /* Record the symbol name. */
2798 obstack_grow (&permanent_obstack
, XSTR (value
.base
, 0),
2799 strlen (XSTR (value
.base
, 0)) + 1);
2802 /* Record the address of the CODE_LABEL. It may not have
2803 been emitted yet, so it's UID may be zero. But pointer
2804 identity is good enough. */
2805 obstack_grow (&permanent_obstack
, &XEXP (value
.base
, 0),
2817 record_constant_1 (TREE_OPERAND (exp
, 0));
2818 record_constant_1 (TREE_OPERAND (exp
, 1));
2823 case NON_LVALUE_EXPR
:
2824 record_constant_1 (TREE_OPERAND (exp
, 0));
2828 if (lang_expand_constant
)
2830 exp
= (*lang_expand_constant
) (exp
);
2831 record_constant_1 (exp
);
2836 /* Record constant contents. */
2837 obstack_grow (&permanent_obstack
, strp
, len
);
2840 /* Record a list of constant expressions that were passed to
2841 output_constant_def but that could not be output right away. */
2843 struct deferred_constant
2845 struct deferred_constant
*next
;
2851 static struct deferred_constant
*deferred_constants
;
2853 /* Another list of constants which should be output after the
2855 static struct deferred_constant
*after_function_constants
;
2857 /* Nonzero means defer output of addressed subconstants
2858 (i.e., those for which output_constant_def is called.) */
2859 static int defer_addressed_constants_flag
;
2861 /* Start deferring output of subconstants. */
2864 defer_addressed_constants ()
2866 defer_addressed_constants_flag
++;
2869 /* Stop deferring output of subconstants,
2870 and output now all those that have been deferred. */
2873 output_deferred_addressed_constants ()
2875 struct deferred_constant
*p
, *next
;
2877 defer_addressed_constants_flag
--;
2879 if (defer_addressed_constants_flag
> 0)
2882 for (p
= deferred_constants
; p
; p
= next
)
2884 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2889 deferred_constants
= 0;
2892 /* Output any constants which should appear after a function. */
2895 output_after_function_constants ()
2897 struct deferred_constant
*p
, *next
;
2899 for (p
= after_function_constants
; p
; p
= next
)
2901 output_constant_def_contents (p
->exp
, p
->reloc
, p
->labelno
);
2906 after_function_constants
= 0;
2909 /* Make a copy of the whole tree structure for a constant.
2910 This handles the same types of nodes that compare_constant
2911 and record_constant handle. */
2917 switch (TREE_CODE (exp
))
2920 /* For ADDR_EXPR, we do not want to copy the decl whose address
2921 is requested. We do want to copy constants though. */
2922 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (exp
, 0))) == 'c')
2923 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2924 copy_constant (TREE_OPERAND (exp
, 0)));
2926 return copy_node (exp
);
2931 return copy_node (exp
);
2934 return build_complex (TREE_TYPE (exp
),
2935 copy_constant (TREE_REALPART (exp
)),
2936 copy_constant (TREE_IMAGPART (exp
)));
2940 return build (TREE_CODE (exp
), TREE_TYPE (exp
),
2941 copy_constant (TREE_OPERAND (exp
, 0)),
2942 copy_constant (TREE_OPERAND (exp
, 1)));
2946 case NON_LVALUE_EXPR
:
2947 return build1 (TREE_CODE (exp
), TREE_TYPE (exp
),
2948 copy_constant (TREE_OPERAND (exp
, 0)));
2952 tree copy
= copy_node (exp
);
2953 tree list
= copy_list (CONSTRUCTOR_ELTS (exp
));
2956 CONSTRUCTOR_ELTS (copy
) = list
;
2957 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2958 TREE_VALUE (tail
) = copy_constant (TREE_VALUE (tail
));
2959 if (TREE_CODE (TREE_TYPE (exp
)) == SET_TYPE
)
2960 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
2961 TREE_PURPOSE (tail
) = copy_constant (TREE_PURPOSE (tail
));
2971 /* Return an rtx representing a reference to constant data in memory
2972 for the constant expression EXP.
2974 If assembler code for such a constant has already been output,
2975 return an rtx to refer to it.
2976 Otherwise, output such a constant in memory (or defer it for later)
2977 and generate an rtx for it.
2979 If DEFER is non-zero, the output of string constants can be deferred
2980 and output only if referenced in the function after all optimizations.
2982 The TREE_CST_RTL of EXP is set up to point to that rtx.
2983 The const_hash_table records which constants already have label strings. */
2986 output_constant_def (exp
, defer
)
2991 register struct constant_descriptor
*desc
;
2992 struct deferred_string
**defstr
;
2996 int after_function
= 0;
2999 if (TREE_CST_RTL (exp
))
3000 return TREE_CST_RTL (exp
);
3002 /* Make sure any other constants whose addresses appear in EXP
3003 are assigned label numbers. */
3005 reloc
= output_addressed_constants (exp
);
3007 /* Compute hash code of EXP. Search the descriptors for that hash code
3008 to see if any of them describes EXP. If yes, the descriptor records
3009 the label number already assigned. */
3011 hash
= const_hash (exp
) % MAX_HASH_TABLE
;
3013 for (desc
= const_hash_table
[hash
]; desc
; desc
= desc
->next
)
3014 if (compare_constant (exp
, desc
))
3019 /* No constant equal to EXP is known to have been output.
3020 Make a constant descriptor to enter EXP in the hash table.
3021 Assign the label number and record it in the descriptor for
3022 future calls to this function to find. */
3024 /* Create a string containing the label name, in LABEL. */
3025 labelno
= const_labelno
++;
3026 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", labelno
);
3028 desc
= record_constant (exp
);
3029 desc
->next
= const_hash_table
[hash
];
3030 desc
->label
= ggc_strdup (label
);
3031 const_hash_table
[hash
] = desc
;
3033 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3035 = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp
)),
3036 gen_rtx_SYMBOL_REF (Pmode
, desc
->label
));
3038 set_mem_attributes (desc
->rtl
, exp
, 1);
3043 TREE_CST_RTL (exp
) = desc
->rtl
;
3045 /* Optionally set flags or add text to the name to record information
3046 such as that it is a function name. If the name is changed, the macro
3047 ASM_OUTPUT_LABELREF will have to know how to strip this information. */
3048 #ifdef ENCODE_SECTION_INFO
3049 /* A previously-processed constant would already have section info
3053 ENCODE_SECTION_INFO (exp
);
3054 desc
->rtl
= TREE_CST_RTL (exp
);
3055 desc
->label
= XSTR (XEXP (desc
->rtl
, 0), 0);
3059 #ifdef CONSTANT_AFTER_FUNCTION_P
3060 if (current_function_decl
!= 0
3061 && CONSTANT_AFTER_FUNCTION_P (exp
))
3066 && STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0))
3067 && (!defer
|| defer_addressed_constants_flag
|| after_function
))
3069 defstr
= (struct deferred_string
**)
3070 htab_find_slot_with_hash (const_str_htab
, desc
->label
,
3071 STRHASH (desc
->label
), NO_INSERT
);
3074 /* If the string is currently deferred but we need to output it now,
3075 remove it from deferred string hash table. */
3077 labelno
= (*defstr
)->labelno
;
3078 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 0;
3079 htab_clear_slot (const_str_htab
, (void **) defstr
);
3083 /* If this is the first time we've seen this particular constant,
3084 output it (or defer its output for later). */
3087 if (defer_addressed_constants_flag
|| after_function
)
3089 struct deferred_constant
*p
;
3090 p
= (struct deferred_constant
*) xmalloc (sizeof (struct deferred_constant
));
3092 p
->exp
= copy_constant (exp
);
3094 p
->labelno
= labelno
;
3097 p
->next
= after_function_constants
;
3098 after_function_constants
= p
;
3102 p
->next
= deferred_constants
;
3103 deferred_constants
= p
;
3108 /* Do no output if -fsyntax-only. */
3109 if (! flag_syntax_only
)
3111 if (TREE_CODE (exp
) != STRING_CST
3113 || flag_writable_strings
3114 || (defstr
= (struct deferred_string
**)
3115 htab_find_slot_with_hash (const_str_htab
,
3117 STRHASH (desc
->label
),
3119 output_constant_def_contents (exp
, reloc
, labelno
);
3122 struct deferred_string
*p
;
3124 p
= (struct deferred_string
*)
3125 xmalloc (sizeof (struct deferred_string
));
3127 p
->exp
= copy_constant (exp
);
3128 p
->label
= desc
->label
;
3129 p
->labelno
= labelno
;
3131 STRING_POOL_ADDRESS_P (XEXP (desc
->rtl
, 0)) = 1;
3137 return TREE_CST_RTL (exp
);
3140 /* Now output assembler code to define the label for EXP,
3141 and follow it with the data of EXP. */
3144 output_constant_def_contents (exp
, reloc
, labelno
)
3151 if (IN_NAMED_SECTION (exp
))
3152 named_section (exp
, NULL
, reloc
);
3155 /* First switch to text section, except for writable strings. */
3156 #ifdef SELECT_SECTION
3157 SELECT_SECTION (exp
, reloc
);
3159 if (((TREE_CODE (exp
) == STRING_CST
) && flag_writable_strings
)
3160 || (flag_pic
&& reloc
))
3163 readonly_data_section ();
3167 /* Align the location counter as required by EXP's data type. */
3168 align
= TYPE_ALIGN (TREE_TYPE (exp
));
3169 #ifdef CONSTANT_ALIGNMENT
3170 align
= CONSTANT_ALIGNMENT (exp
, align
);
3173 if (align
> BITS_PER_UNIT
)
3174 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (align
/ BITS_PER_UNIT
));
3176 /* Output the label itself. */
3177 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", labelno
);
3179 /* Output the value of EXP. */
3180 output_constant (exp
,
3181 (TREE_CODE (exp
) == STRING_CST
3182 ? MAX (TREE_STRING_LENGTH (exp
),
3183 int_size_in_bytes (TREE_TYPE (exp
)))
3184 : int_size_in_bytes (TREE_TYPE (exp
))));
3188 /* Structure to represent sufficient information about a constant so that
3189 it can be output when the constant pool is output, so that function
3190 integration can be done, and to simplify handling on machines that reference
3191 constant pool as base+displacement. */
3193 struct pool_constant
3195 struct constant_descriptor
*desc
;
3196 struct pool_constant
*next
, *next_sym
;
3199 enum machine_mode mode
;
3206 /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true.
3207 The argument is XSTR (... , 0) */
3209 #define SYMHASH(LABEL) \
3210 ((((unsigned long) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE)
3212 /* Initialize constant pool hashing for a new function. */
3215 init_varasm_status (f
)
3218 struct varasm_status
*p
;
3219 p
= (struct varasm_status
*) xmalloc (sizeof (struct varasm_status
));
3221 p
->x_const_rtx_hash_table
3222 = ((struct constant_descriptor
**)
3223 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct constant_descriptor
*)));
3224 p
->x_const_rtx_sym_hash_table
3225 = ((struct pool_constant
**)
3226 xcalloc (MAX_RTX_HASH_TABLE
, sizeof (struct pool_constant
*)));
3228 p
->x_first_pool
= p
->x_last_pool
= 0;
3229 p
->x_pool_offset
= 0;
3230 p
->x_const_double_chain
= 0;
3233 /* Mark PC for GC. */
3236 mark_pool_constant (pc
)
3237 struct pool_constant
*pc
;
3242 ggc_mark_rtx (pc
->constant
);
3247 /* Mark P for GC. */
3250 mark_varasm_status (p
)
3251 struct varasm_status
*p
;
3256 mark_pool_constant (p
->x_first_pool
);
3257 ggc_mark_rtx (p
->x_const_double_chain
);
3260 /* Clear out all parts of the state in F that can safely be discarded
3261 after the function has been compiled, to let garbage collection
3262 reclaim the memory. */
3265 free_varasm_status (f
)
3268 struct varasm_status
*p
;
3273 /* Clear out the hash tables. */
3274 for (i
= 0; i
< MAX_RTX_HASH_TABLE
; ++i
)
3276 struct constant_descriptor
* cd
;
3278 cd
= p
->x_const_rtx_hash_table
[i
];
3280 struct constant_descriptor
* next
= cd
->next
;
3286 free (p
->x_const_rtx_hash_table
);
3287 free (p
->x_const_rtx_sym_hash_table
);
3293 /* Express an rtx for a constant integer (perhaps symbolic)
3294 as the sum of a symbol or label plus an explicit integer.
3295 They are stored into VALUE. */
3298 decode_rtx_const (mode
, x
, value
)
3299 enum machine_mode mode
;
3301 struct rtx_const
*value
;
3303 /* Clear the whole structure, including any gaps. */
3304 memset (value
, 0, sizeof (struct rtx_const
));
3306 value
->kind
= RTX_INT
; /* Most usual kind. */
3309 switch (GET_CODE (x
))
3312 value
->kind
= RTX_DOUBLE
;
3313 if (GET_MODE (x
) != VOIDmode
)
3315 value
->mode
= GET_MODE (x
);
3316 memcpy ((char *) &value
->un
.du
,
3317 (char *) &CONST_DOUBLE_LOW (x
), sizeof value
->un
.du
);
3321 value
->un
.di
.low
= CONST_DOUBLE_LOW (x
);
3322 value
->un
.di
.high
= CONST_DOUBLE_HIGH (x
);
3327 value
->un
.addr
.offset
= INTVAL (x
);
3333 value
->un
.addr
.base
= x
;
3338 if (GET_CODE (x
) == PLUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3340 value
->un
.addr
.base
= XEXP (x
, 0);
3341 value
->un
.addr
.offset
= INTVAL (XEXP (x
, 1));
3343 else if (GET_CODE (x
) == MINUS
&& GET_CODE (XEXP (x
, 1)) == CONST_INT
)
3345 value
->un
.addr
.base
= XEXP (x
, 0);
3346 value
->un
.addr
.offset
= - INTVAL (XEXP (x
, 1));
3350 value
->un
.addr
.base
= x
;
3351 value
->un
.addr
.offset
= 0;
3359 if (value
->kind
== RTX_INT
&& value
->un
.addr
.base
!= 0)
3360 switch (GET_CODE (value
->un
.addr
.base
))
3363 /* Use the string's address, not the SYMBOL_REF's address,
3364 for the sake of addresses of library routines. */
3365 value
->un
.addr
.base
= (rtx
) XSTR (value
->un
.addr
.base
, 0);
3369 /* For a LABEL_REF, compare labels. */
3370 value
->un
.addr
.base
= XEXP (value
->un
.addr
.base
, 0);
3377 /* Given a MINUS expression, simplify it if both sides
3378 include the same symbol. */
3381 simplify_subtraction (x
)
3384 struct rtx_const val0
, val1
;
3386 decode_rtx_const (GET_MODE (x
), XEXP (x
, 0), &val0
);
3387 decode_rtx_const (GET_MODE (x
), XEXP (x
, 1), &val1
);
3389 if (val0
.un
.addr
.base
== val1
.un
.addr
.base
)
3390 return GEN_INT (val0
.un
.addr
.offset
- val1
.un
.addr
.offset
);
3394 /* Compute a hash code for a constant RTL expression. */
3397 const_hash_rtx (mode
, x
)
3398 enum machine_mode mode
;
3404 struct rtx_const value
;
3405 decode_rtx_const (mode
, x
, &value
);
3407 /* Compute hashing function */
3409 for (i
= 0; i
< sizeof value
/ sizeof (int); i
++)
3410 hi
+= ((int *) &value
)[i
];
3412 hi
&= (1 << HASHBITS
) - 1;
3413 hi
%= MAX_RTX_HASH_TABLE
;
3417 /* Compare a constant rtl object X with a constant-descriptor DESC.
3418 Return 1 if DESC describes a constant with the same value as X. */
3421 compare_constant_rtx (mode
, x
, desc
)
3422 enum machine_mode mode
;
3424 struct constant_descriptor
*desc
;
3426 register int *p
= (int *) desc
->u
.contents
;
3429 struct rtx_const value
;
3431 decode_rtx_const (mode
, x
, &value
);
3432 strp
= (int *) &value
;
3433 len
= sizeof value
/ sizeof (int);
3435 /* Compare constant contents. */
3437 if (*p
++ != *strp
++)
3443 /* Construct a constant descriptor for the rtl-expression X.
3444 It is up to the caller to enter the descriptor in the hash table. */
3446 static struct constant_descriptor
*
3447 record_constant_rtx (mode
, x
)
3448 enum machine_mode mode
;
3451 struct constant_descriptor
*ptr
;
3453 ptr
= ((struct constant_descriptor
*)
3454 xcalloc (1, (offsetof (struct constant_descriptor
, u
)
3455 + sizeof (struct rtx_const
))));
3456 decode_rtx_const (mode
, x
, (struct rtx_const
*) ptr
->u
.contents
);
3461 /* Given a constant rtx X, make (or find) a memory constant for its value
3462 and return a MEM rtx to refer to it in memory. */
3465 force_const_mem (mode
, x
)
3466 enum machine_mode mode
;
3470 register struct constant_descriptor
*desc
;
3472 const char *found
= 0;
3475 /* If we want this CONST_DOUBLE in the same mode as it is in memory
3476 (this will always be true for floating CONST_DOUBLEs that have been
3477 placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs),
3478 use the previous copy. Otherwise, make a new one. Note that in
3479 the unlikely event that this same CONST_DOUBLE is used in two different
3480 modes in an alternating fashion, we will allocate a lot of different
3481 memory locations, but this should be extremely rare. */
3483 if (GET_CODE (x
) == CONST_DOUBLE
3484 && GET_CODE (CONST_DOUBLE_MEM (x
)) == MEM
3485 && GET_MODE (CONST_DOUBLE_MEM (x
)) == mode
)
3486 return CONST_DOUBLE_MEM (x
);
3488 /* Compute hash code of X. Search the descriptors for that hash code
3489 to see if any of them describes X. If yes, the descriptor records
3490 the label number already assigned. */
3492 hash
= const_hash_rtx (mode
, x
);
3494 for (desc
= const_rtx_hash_table
[hash
]; desc
; desc
= desc
->next
)
3495 if (compare_constant_rtx (mode
, x
, desc
))
3497 found
= desc
->label
;
3503 register struct pool_constant
*pool
;
3506 /* No constant equal to X is known to have been output.
3507 Make a constant descriptor to enter X in the hash table.
3508 Assign the label number and record it in the descriptor for
3509 future calls to this function to find. */
3511 desc
= record_constant_rtx (mode
, x
);
3512 desc
->next
= const_rtx_hash_table
[hash
];
3513 const_rtx_hash_table
[hash
] = desc
;
3515 /* Align the location counter as required by EXP's data type. */
3516 align
= GET_MODE_ALIGNMENT (mode
== VOIDmode
? word_mode
: mode
);
3517 #ifdef CONSTANT_ALIGNMENT
3518 align
= CONSTANT_ALIGNMENT (make_tree (type_for_mode (mode
, 0), x
),
3522 pool_offset
+= (align
/ BITS_PER_UNIT
) - 1;
3523 pool_offset
&= ~ ((align
/ BITS_PER_UNIT
) - 1);
3525 if (GET_CODE (x
) == LABEL_REF
)
3526 LABEL_PRESERVE_P (XEXP (x
, 0)) = 1;
3528 /* Allocate a pool constant descriptor, fill it in, and chain it in. */
3530 pool
= (struct pool_constant
*) ggc_alloc (sizeof (struct pool_constant
));
3534 pool
->labelno
= const_labelno
;
3535 pool
->align
= align
;
3536 pool
->offset
= pool_offset
;
3543 last_pool
->next
= pool
;
3546 pool_offset
+= GET_MODE_SIZE (mode
);
3548 /* Create a string containing the label name, in LABEL. */
3549 ASM_GENERATE_INTERNAL_LABEL (label
, "LC", const_labelno
);
3553 desc
->label
= found
= ggc_strdup (label
);
3555 /* Add label to symbol hash table. */
3556 hash
= SYMHASH (found
);
3557 pool
->label
= found
;
3558 pool
->next_sym
= const_rtx_sym_hash_table
[hash
];
3559 const_rtx_sym_hash_table
[hash
] = pool
;
3562 /* We have a symbol name; construct the SYMBOL_REF and the MEM. */
3564 def
= gen_rtx_MEM (mode
, gen_rtx_SYMBOL_REF (Pmode
, found
));
3565 set_mem_attributes (def
, type_for_mode (mode
, 0), 1);
3566 RTX_UNCHANGING_P (def
) = 1;
3568 /* Mark the symbol_ref as belonging to this constants pool. */
3569 CONSTANT_POOL_ADDRESS_P (XEXP (def
, 0)) = 1;
3570 current_function_uses_const_pool
= 1;
3572 if (GET_CODE (x
) == CONST_DOUBLE
)
3574 if (CONST_DOUBLE_MEM (x
) == cc0_rtx
)
3576 CONST_DOUBLE_CHAIN (x
) = const_double_chain
;
3577 const_double_chain
= x
;
3579 CONST_DOUBLE_MEM (x
) = def
;
3585 /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to
3586 the corresponding pool_constant structure. */
3588 static struct pool_constant
*
3589 find_pool_constant (f
, addr
)
3593 struct pool_constant
*pool
;
3594 const char *label
= XSTR (addr
, 0);
3596 for (pool
= f
->varasm
->x_const_rtx_sym_hash_table
[SYMHASH (label
)]; pool
;
3597 pool
= pool
->next_sym
)
3598 if (pool
->label
== label
)
3604 /* Given a constant pool SYMBOL_REF, return the corresponding constant. */
3607 get_pool_constant (addr
)
3610 return (find_pool_constant (cfun
, addr
))->constant
;
3613 /* Likewise, but for the constant pool of a specific function. */
3616 get_pool_constant_for_function (f
, addr
)
3620 return (find_pool_constant (f
, addr
))->constant
;
3623 /* Similar, return the mode. */
3626 get_pool_mode (addr
)
3629 return (find_pool_constant (cfun
, addr
))->mode
;
3633 get_pool_mode_for_function (f
, addr
)
3637 return (find_pool_constant (f
, addr
))->mode
;
3640 /* Similar, return the offset in the constant pool. */
3643 get_pool_offset (addr
)
3646 return (find_pool_constant (cfun
, addr
))->offset
;
3649 /* Return the size of the constant pool. */
3657 /* Write all the constants in the constant pool. */
3660 output_constant_pool (fnname
, fndecl
)
3661 const char *fnname ATTRIBUTE_UNUSED
;
3662 tree fndecl ATTRIBUTE_UNUSED
;
3664 struct pool_constant
*pool
;
3666 union real_extract u
;
3668 /* It is possible for gcc to call force_const_mem and then to later
3669 discard the instructions which refer to the constant. In such a
3670 case we do not need to output the constant. */
3671 mark_constant_pool ();
3673 #ifdef ASM_OUTPUT_POOL_PROLOGUE
3674 ASM_OUTPUT_POOL_PROLOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3677 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3686 /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF)
3687 whose CODE_LABEL has been deleted. This can occur if a jump table
3688 is eliminated by optimization. If so, write a constant of zero
3689 instead. Note that this can also happen by turning the
3690 CODE_LABEL into a NOTE. */
3691 /* ??? This seems completely and utterly wrong. Certainly it's
3692 not true for NOTE_INSN_DELETED_LABEL, but I disbelieve proper
3693 functioning even with INSN_DELETED_P and friends. */
3696 switch (GET_CODE (x
))
3699 if (GET_CODE (XEXP (x
, 0)) != PLUS
3700 || GET_CODE (XEXP (XEXP (x
, 0), 0)) != LABEL_REF
)
3702 tmp
= XEXP (XEXP (x
, 0), 0);
3707 if (INSN_DELETED_P (tmp
)
3708 || (GET_CODE (tmp
) == NOTE
3709 && NOTE_LINE_NUMBER (tmp
) == NOTE_INSN_DELETED
))
3720 /* First switch to correct section. */
3721 #ifdef SELECT_RTX_SECTION
3722 SELECT_RTX_SECTION (pool
->mode
, x
);
3724 readonly_data_section ();
3727 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3728 ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file
, x
, pool
->mode
,
3729 pool
->align
, pool
->labelno
, done
);
3732 assemble_align (pool
->align
);
3734 /* Output the label. */
3735 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file
, "LC", pool
->labelno
);
3737 /* Output the value of the constant itself. */
3738 switch (GET_MODE_CLASS (pool
->mode
))
3741 if (GET_CODE (x
) != CONST_DOUBLE
)
3744 memcpy ((char *) &u
, (char *) &CONST_DOUBLE_LOW (x
), sizeof u
);
3745 assemble_real (u
.d
, pool
->mode
);
3749 case MODE_PARTIAL_INT
:
3750 assemble_integer (x
, GET_MODE_SIZE (pool
->mode
), 1);
3757 #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
3763 #ifdef ASM_OUTPUT_POOL_EPILOGUE
3764 ASM_OUTPUT_POOL_EPILOGUE (asm_out_file
, fnname
, fndecl
, pool_offset
);
3767 /* Done with this pool. */
3768 first_pool
= last_pool
= 0;
3771 /* Look through the instructions for this function, and mark all the
3772 entries in the constant pool which are actually being used.
3773 Emit used deferred strings. */
3776 mark_constant_pool ()
3779 struct pool_constant
*pool
;
3781 if (first_pool
== 0 && htab_elements (const_str_htab
) == 0)
3784 for (pool
= first_pool
; pool
; pool
= pool
->next
)
3787 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
3789 mark_constants (PATTERN (insn
));
3791 for (insn
= current_function_epilogue_delay_list
;
3793 insn
= XEXP (insn
, 1))
3795 mark_constants (PATTERN (insn
));
3798 /* Look through appropriate parts of X, marking all entries in the
3799 constant pool which are actually being used. Entries that are only
3800 referenced by other constants are also marked as used. Emit
3801 deferred strings that are used. */
3808 register const char *format_ptr
;
3813 if (GET_CODE (x
) == SYMBOL_REF
)
3815 mark_constant (&x
, NULL
);
3818 /* Never search inside a CONST_DOUBLE, because CONST_DOUBLE_MEM may be
3819 a MEM, but does not constitute a use of that MEM. */
3820 else if (GET_CODE (x
) == CONST_DOUBLE
)
3823 /* Insns may appear inside a SEQUENCE. Only check the patterns of
3824 insns, not any notes that may be attached. We don't want to mark
3825 a constant just because it happens to appear in a REG_EQUIV note. */
3828 mark_constants (PATTERN (x
));
3832 format_ptr
= GET_RTX_FORMAT (GET_CODE (x
));
3834 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (x
)); i
++)
3836 switch (*format_ptr
++)
3839 mark_constants (XEXP (x
, i
));
3843 if (XVEC (x
, i
) != 0)
3847 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3848 mark_constants (XVECEXP (x
, i
, j
));
3867 /* Given a SYMBOL_REF CURRENT_RTX, mark it and all constants it refers
3868 to as used. Emit referenced deferred strings. This function can
3869 be used with for_each_rtx () to mark all SYMBOL_REFs in an rtx. */
3872 mark_constant (current_rtx
, data
)
3874 void *data ATTRIBUTE_UNUSED
;
3876 rtx x
= *current_rtx
;
3880 else if (GET_CODE(x
) == CONST_DOUBLE
)
3881 /* Never search inside a CONST_DOUBLE because CONST_DOUBLE_MEM may
3882 be a MEM but does not constitute a use of that MEM. */
3884 else if (GET_CODE (x
) == SYMBOL_REF
)
3886 if (CONSTANT_POOL_ADDRESS_P (x
))
3888 struct pool_constant
*pool
= find_pool_constant (cfun
, x
);
3889 if (pool
->mark
== 0) {
3891 for_each_rtx (&(pool
->constant
), &mark_constant
, NULL
);
3896 else if (STRING_POOL_ADDRESS_P (x
))
3898 struct deferred_string
**defstr
;
3900 defstr
= (struct deferred_string
**)
3901 htab_find_slot_with_hash (const_str_htab
, XSTR (x
, 0),
3902 STRHASH (XSTR (x
, 0)), NO_INSERT
);
3905 struct deferred_string
*p
= *defstr
;
3907 STRING_POOL_ADDRESS_P (x
) = 0;
3908 output_constant_def_contents (p
->exp
, 0, p
->labelno
);
3909 htab_clear_slot (const_str_htab
, (void **) defstr
);
3916 /* Find all the constants whose addresses are referenced inside of EXP,
3917 and make sure assembler code with a label has been output for each one.
3918 Indicate whether an ADDR_EXPR has been encountered. */
3921 output_addressed_constants (exp
)
3926 /* Give the front-end a chance to convert VALUE to something that
3927 looks more like a constant to the back-end. */
3928 if (lang_expand_constant
)
3929 exp
= (*lang_expand_constant
) (exp
);
3931 switch (TREE_CODE (exp
))
3935 register tree constant
= TREE_OPERAND (exp
, 0);
3937 while (TREE_CODE (constant
) == COMPONENT_REF
)
3939 constant
= TREE_OPERAND (constant
, 0);
3942 if (TREE_CODE_CLASS (TREE_CODE (constant
)) == 'c'
3943 || TREE_CODE (constant
) == CONSTRUCTOR
)
3944 /* No need to do anything here
3945 for addresses of variables or functions. */
3946 output_constant_def (constant
, 0);
3953 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3954 reloc
|= output_addressed_constants (TREE_OPERAND (exp
, 1));
3959 case NON_LVALUE_EXPR
:
3960 reloc
= output_addressed_constants (TREE_OPERAND (exp
, 0));
3966 for (link
= CONSTRUCTOR_ELTS (exp
); link
; link
= TREE_CHAIN (link
))
3967 if (TREE_VALUE (link
) != 0)
3968 reloc
|= output_addressed_constants (TREE_VALUE (link
));
3978 /* Return nonzero if VALUE is a valid constant-valued expression
3979 for use in initializing a static variable; one that can be an
3980 element of a "constant" initializer.
3982 Return null_pointer_node if the value is absolute;
3983 if it is relocatable, return the variable that determines the relocation.
3984 We assume that VALUE has been folded as much as possible;
3985 therefore, we do not need to check for such things as
3986 arithmetic-combinations of integers. */
3989 initializer_constant_valid_p (value
, endtype
)
3993 /* Give the front-end a chance to convert VALUE to something that
3994 looks more like a constant to the back-end. */
3995 if (lang_expand_constant
)
3996 value
= (*lang_expand_constant
) (value
);
3998 switch (TREE_CODE (value
))
4001 if ((TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
4002 || TREE_CODE (TREE_TYPE (value
)) == RECORD_TYPE
)
4003 && TREE_CONSTANT (value
)
4004 && CONSTRUCTOR_ELTS (value
))
4006 initializer_constant_valid_p (TREE_VALUE (CONSTRUCTOR_ELTS (value
)),
4009 return TREE_STATIC (value
) ? null_pointer_node
: 0;
4015 return null_pointer_node
;
4018 return staticp (TREE_OPERAND (value
, 0)) ? TREE_OPERAND (value
, 0) : 0;
4020 case NON_LVALUE_EXPR
:
4021 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4025 /* Allow conversions between pointer types. */
4026 if (POINTER_TYPE_P (TREE_TYPE (value
))
4027 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4028 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4030 /* Allow conversions between real types. */
4031 if (FLOAT_TYPE_P (TREE_TYPE (value
))
4032 && FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4033 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4035 /* Allow length-preserving conversions between integer types. */
4036 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4037 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4038 && (TYPE_PRECISION (TREE_TYPE (value
))
4039 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4040 return initializer_constant_valid_p (TREE_OPERAND (value
, 0), endtype
);
4042 /* Allow conversions between other integer types only if
4044 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4045 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4047 tree inner
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4049 if (inner
== null_pointer_node
)
4050 return null_pointer_node
;
4054 /* Allow (int) &foo provided int is as wide as a pointer. */
4055 if (INTEGRAL_TYPE_P (TREE_TYPE (value
))
4056 && POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0)))
4057 && (TYPE_PRECISION (TREE_TYPE (value
))
4058 >= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0)))))
4059 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4062 /* Likewise conversions from int to pointers, but also allow
4063 conversions from 0. */
4064 if (POINTER_TYPE_P (TREE_TYPE (value
))
4065 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (value
, 0))))
4067 if (integer_zerop (TREE_OPERAND (value
, 0)))
4068 return null_pointer_node
;
4069 else if (TYPE_PRECISION (TREE_TYPE (value
))
4070 <= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (value
, 0))))
4071 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4075 /* Allow conversions to union types if the value inside is okay. */
4076 if (TREE_CODE (TREE_TYPE (value
)) == UNION_TYPE
)
4077 return initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4082 if (! INTEGRAL_TYPE_P (endtype
)
4083 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4085 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4087 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4089 /* If either term is absolute, use the other terms relocation. */
4090 if (valid0
== null_pointer_node
)
4092 if (valid1
== null_pointer_node
)
4098 if (! INTEGRAL_TYPE_P (endtype
)
4099 || TYPE_PRECISION (endtype
) >= POINTER_SIZE
)
4101 tree valid0
= initializer_constant_valid_p (TREE_OPERAND (value
, 0),
4103 tree valid1
= initializer_constant_valid_p (TREE_OPERAND (value
, 1),
4105 /* Win if second argument is absolute. */
4106 if (valid1
== null_pointer_node
)
4108 /* Win if both arguments have the same relocation.
4109 Then the value is absolute. */
4110 if (valid0
== valid1
&& valid0
!= 0)
4111 return null_pointer_node
;
4113 /* Since GCC guarantees that string constants are unique in the
4114 generated code, a subtraction between two copies of the same
4115 constant string is absolute. */
4116 if (valid0
&& TREE_CODE (valid0
) == STRING_CST
&&
4117 valid1
&& TREE_CODE (valid1
) == STRING_CST
&&
4118 TREE_STRING_POINTER (valid0
) == TREE_STRING_POINTER (valid1
))
4119 return null_pointer_node
;
4122 /* Support differences between labels. */
4123 if (INTEGRAL_TYPE_P (endtype
))
4126 op0
= TREE_OPERAND (value
, 0);
4127 op1
= TREE_OPERAND (value
, 1);
4131 if (TREE_CODE (op0
) == ADDR_EXPR
4132 && TREE_CODE (TREE_OPERAND (op0
, 0)) == LABEL_DECL
4133 && TREE_CODE (op1
) == ADDR_EXPR
4134 && TREE_CODE (TREE_OPERAND (op1
, 0)) == LABEL_DECL
)
4135 return null_pointer_node
;
4146 /* Output assembler code for constant EXP to FILE, with no label.
4147 This includes the pseudo-op such as ".int" or ".byte", and a newline.
4148 Assumes output_addressed_constants has been done on EXP already.
4150 Generate exactly SIZE bytes of assembler data, padding at the end
4151 with zeros if necessary. SIZE must always be specified.
4153 SIZE is important for structure constructors,
4154 since trailing members may have been omitted from the constructor.
4155 It is also important for initialization of arrays from string constants
4156 since the full length of the string constant might not be wanted.
4157 It is also needed for initialization of unions, where the initializer's
4158 type is just one member, and that may not be as long as the union.
4160 There a case in which we would fail to output exactly SIZE bytes:
4161 for a structure constructor that wants to produce more than SIZE bytes.
4162 But such constructors will never be generated for any possible input. */
4165 output_constant (exp
, size
)
4169 register enum tree_code code
= TREE_CODE (TREE_TYPE (exp
));
4171 /* Some front-ends use constants other than the standard
4172 language-indepdent varieties, but which may still be output
4173 directly. Give the front-end a chance to convert EXP to a
4174 language-independent representation. */
4175 if (lang_expand_constant
)
4177 exp
= (*lang_expand_constant
) (exp
);
4178 code
= TREE_CODE (TREE_TYPE (exp
));
4181 if (size
== 0 || flag_syntax_only
)
4184 /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue.
4185 That way we get the constant (we hope) inside it. Also, strip off any
4186 NOP_EXPR that converts between two record, union, array, or set types
4187 or a CONVERT_EXPR that converts to a union TYPE. */
4188 while ((TREE_CODE (exp
) == NOP_EXPR
4189 && (TREE_TYPE (exp
) == TREE_TYPE (TREE_OPERAND (exp
, 0))
4190 || AGGREGATE_TYPE_P (TREE_TYPE (exp
))))
4191 || (TREE_CODE (exp
) == CONVERT_EXPR
4192 && code
== UNION_TYPE
)
4193 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4195 exp
= TREE_OPERAND (exp
, 0);
4196 code
= TREE_CODE (TREE_TYPE (exp
));
4199 /* Allow a constructor with no elements for any data type.
4200 This means to fill the space with zeros. */
4201 if (TREE_CODE (exp
) == CONSTRUCTOR
&& CONSTRUCTOR_ELTS (exp
) == 0)
4203 assemble_zeros (size
);
4214 case REFERENCE_TYPE
:
4215 /* ??? What about (int)((float)(int)&foo + 4) */
4216 while (TREE_CODE (exp
) == NOP_EXPR
|| TREE_CODE (exp
) == CONVERT_EXPR
4217 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
4218 exp
= TREE_OPERAND (exp
, 0);
4220 if (! assemble_integer (expand_expr (exp
, NULL_RTX
, VOIDmode
,
4221 EXPAND_INITIALIZER
),
4223 error ("initializer for integer value is too complicated");
4228 if (TREE_CODE (exp
) != REAL_CST
)
4229 error ("initializer for floating value is not a floating constant");
4231 assemble_real (TREE_REAL_CST (exp
),
4232 mode_for_size (size
* BITS_PER_UNIT
, MODE_FLOAT
, 0));
4237 output_constant (TREE_REALPART (exp
), size
/ 2);
4238 output_constant (TREE_IMAGPART (exp
), size
/ 2);
4239 size
-= (size
/ 2) * 2;
4243 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4245 output_constructor (exp
, size
);
4248 else if (TREE_CODE (exp
) == STRING_CST
)
4252 if (size
> TREE_STRING_LENGTH (exp
))
4254 excess
= size
- TREE_STRING_LENGTH (exp
);
4255 size
= TREE_STRING_LENGTH (exp
);
4258 assemble_string (TREE_STRING_POINTER (exp
), size
);
4267 if (TREE_CODE (exp
) == CONSTRUCTOR
)
4268 output_constructor (exp
, size
);
4274 if (TREE_CODE (exp
) == INTEGER_CST
)
4275 assemble_integer (expand_expr (exp
, NULL_RTX
,
4276 VOIDmode
, EXPAND_INITIALIZER
),
4278 else if (TREE_CODE (exp
) == CONSTRUCTOR
)
4280 unsigned char *buffer
= (unsigned char *) alloca (size
);
4281 if (get_set_constructor_bytes (exp
, buffer
, size
))
4283 assemble_string ((char *) buffer
, size
);
4286 error ("unknown set constructor type");
4294 assemble_zeros (size
);
4298 /* Subroutine of output_constructor, used for computing the size of
4299 arrays of unspecified length. VAL must be a CONSTRUCTOR of an array
4300 type with an unspecified upper bound. */
4302 static unsigned HOST_WIDE_INT
4303 array_size_for_constructor (val
)
4308 max_index
= NULL_TREE
;
4309 for (i
= CONSTRUCTOR_ELTS (val
); i
; i
= TREE_CHAIN (i
))
4311 tree index
= TREE_PURPOSE (i
);
4313 if (TREE_CODE (index
) == RANGE_EXPR
)
4314 index
= TREE_OPERAND (index
, 1);
4315 if (max_index
== NULL_TREE
|| tree_int_cst_lt (max_index
, index
))
4319 if (max_index
== NULL_TREE
)
4322 /* Compute the total number of array elements. */
4323 i
= size_binop (MINUS_EXPR
, convert (sizetype
, max_index
),
4325 TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val
)))));
4326 i
= size_binop (PLUS_EXPR
, i
, convert (sizetype
, integer_one_node
));
4328 /* Multiply by the array element unit size to find number of bytes. */
4329 i
= size_binop (MULT_EXPR
, i
, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val
))));
4331 return tree_low_cst (i
, 1);
4334 /* Subroutine of output_constant, used for CONSTRUCTORs (aggregate constants).
4335 Generate at least SIZE bytes, padding if necessary. */
4338 output_constructor (exp
, size
)
4342 tree type
= TREE_TYPE (exp
);
4343 register tree link
, field
= 0;
4345 /* Number of bytes output or skipped so far.
4346 In other words, current position within the constructor. */
4347 HOST_WIDE_INT total_bytes
= 0;
4348 /* Non-zero means BYTE contains part of a byte, to be output. */
4349 int byte_buffer_in_use
= 0;
4350 register int byte
= 0;
4352 if (HOST_BITS_PER_WIDE_INT
< BITS_PER_UNIT
)
4355 if (TREE_CODE (type
) == RECORD_TYPE
)
4356 field
= TYPE_FIELDS (type
);
4358 if (TREE_CODE (type
) == ARRAY_TYPE
4359 && TYPE_DOMAIN (type
) != 0)
4360 min_index
= TYPE_MIN_VALUE (TYPE_DOMAIN (type
));
4362 /* As LINK goes through the elements of the constant,
4363 FIELD goes through the structure fields, if the constant is a structure.
4364 if the constant is a union, then we override this,
4365 by getting the field from the TREE_LIST element.
4366 But the constant could also be an array. Then FIELD is zero.
4368 There is always a maximum of one element in the chain LINK for unions
4369 (even if the initializer in a source program incorrectly contains
4371 for (link
= CONSTRUCTOR_ELTS (exp
);
4373 link
= TREE_CHAIN (link
),
4374 field
= field
? TREE_CHAIN (field
) : 0)
4376 tree val
= TREE_VALUE (link
);
4379 /* The element in a union constructor specifies the proper field
4381 if ((TREE_CODE (type
) == RECORD_TYPE
|| TREE_CODE (type
) == UNION_TYPE
4382 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4383 && TREE_PURPOSE (link
) != 0)
4384 field
= TREE_PURPOSE (link
);
4386 else if (TREE_CODE (type
) == ARRAY_TYPE
)
4387 index
= TREE_PURPOSE (link
);
4389 /* Eliminate the marker that makes a cast not be an lvalue. */
4393 if (index
&& TREE_CODE (index
) == RANGE_EXPR
)
4395 unsigned HOST_WIDE_INT fieldsize
4396 = int_size_in_bytes (TREE_TYPE (type
));
4397 HOST_WIDE_INT lo_index
= tree_low_cst (TREE_OPERAND (index
, 0), 0);
4398 HOST_WIDE_INT hi_index
= tree_low_cst (TREE_OPERAND (index
, 1), 0);
4399 HOST_WIDE_INT index
;
4401 for (index
= lo_index
; index
<= hi_index
; index
++)
4403 /* Output the element's initial value. */
4405 assemble_zeros (fieldsize
);
4407 output_constant (val
, fieldsize
);
4409 /* Count its size. */
4410 total_bytes
+= fieldsize
;
4413 else if (field
== 0 || !DECL_BIT_FIELD (field
))
4415 /* An element that is not a bit-field. */
4417 unsigned HOST_WIDE_INT fieldsize
;
4418 /* Since this structure is static,
4419 we know the positions are constant. */
4420 HOST_WIDE_INT pos
= field
? int_byte_position (field
) : 0;
4423 pos
= (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val
)), 1)
4424 * (tree_low_cst (index
, 0) - tree_low_cst (min_index
, 0)));
4426 /* Output any buffered-up bit-fields preceding this element. */
4427 if (byte_buffer_in_use
)
4429 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4431 byte_buffer_in_use
= 0;
4434 /* Advance to offset of this element.
4435 Note no alignment needed in an array, since that is guaranteed
4436 if each element has the proper size. */
4437 if ((field
!= 0 || index
!= 0) && pos
!= total_bytes
)
4439 assemble_zeros (pos
- total_bytes
);
4443 else if (field
!= 0 && DECL_PACKED (field
))
4444 /* Some assemblers automaticallly align a datum according to its
4445 size if no align directive is specified. The datum, however,
4446 may be declared with 'packed' attribute, so we have to disable
4448 ASM_OUTPUT_ALIGN (asm_out_file
, 0);
4450 /* Determine size this element should occupy. */
4455 /* If this is an array with an unspecified upper bound,
4456 the initializer determines the size. */
4457 /* ??? This ought to only checked if DECL_SIZE_UNIT is NULL,
4458 but we cannot do this until the deprecated support for
4459 initializing zero-length array members is removed. */
4460 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
4461 && TYPE_DOMAIN (TREE_TYPE (field
))
4462 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field
))))
4464 fieldsize
= array_size_for_constructor (val
);
4465 /* Given a non-empty initialization, this field had
4467 if (fieldsize
!= 0 && TREE_CHAIN (field
) != NULL_TREE
)
4470 else if (DECL_SIZE_UNIT (field
))
4472 /* ??? This can't be right. If the decl size overflows
4473 a host integer we will silently emit no data. */
4474 if (host_integerp (DECL_SIZE_UNIT (field
), 1))
4475 fieldsize
= tree_low_cst (DECL_SIZE_UNIT (field
), 1);
4479 fieldsize
= int_size_in_bytes (TREE_TYPE (type
));
4481 /* Output the element's initial value. */
4483 assemble_zeros (fieldsize
);
4485 output_constant (val
, fieldsize
);
4487 /* Count its size. */
4488 total_bytes
+= fieldsize
;
4490 else if (val
!= 0 && TREE_CODE (val
) != INTEGER_CST
)
4491 error ("invalid initial value for member `%s'",
4492 IDENTIFIER_POINTER (DECL_NAME (field
)));
4495 /* Element that is a bit-field. */
4497 HOST_WIDE_INT next_offset
= int_bit_position (field
);
4498 HOST_WIDE_INT end_offset
4499 = (next_offset
+ tree_low_cst (DECL_SIZE (field
), 1));
4502 val
= integer_zero_node
;
4504 /* If this field does not start in this (or, next) byte,
4506 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4508 /* Output remnant of any bit field in previous bytes. */
4509 if (byte_buffer_in_use
)
4511 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4513 byte_buffer_in_use
= 0;
4516 /* If still not at proper byte, advance to there. */
4517 if (next_offset
/ BITS_PER_UNIT
!= total_bytes
)
4519 assemble_zeros (next_offset
/ BITS_PER_UNIT
- total_bytes
);
4520 total_bytes
= next_offset
/ BITS_PER_UNIT
;
4524 if (! byte_buffer_in_use
)
4527 /* We must split the element into pieces that fall within
4528 separate bytes, and combine each byte with previous or
4529 following bit-fields. */
4531 /* next_offset is the offset n fbits from the beginning of
4532 the structure to the next bit of this element to be processed.
4533 end_offset is the offset of the first bit past the end of
4535 while (next_offset
< end_offset
)
4539 HOST_WIDE_INT value
;
4540 HOST_WIDE_INT next_byte
= next_offset
/ BITS_PER_UNIT
;
4541 HOST_WIDE_INT next_bit
= next_offset
% BITS_PER_UNIT
;
4543 /* Advance from byte to byte
4544 within this element when necessary. */
4545 while (next_byte
!= total_bytes
)
4547 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4552 /* Number of bits we can process at once
4553 (all part of the same byte). */
4554 this_time
= MIN (end_offset
- next_offset
,
4555 BITS_PER_UNIT
- next_bit
);
4556 if (BYTES_BIG_ENDIAN
)
4558 /* On big-endian machine, take the most significant bits
4559 first (of the bits that are significant)
4560 and put them into bytes from the most significant end. */
4561 shift
= end_offset
- next_offset
- this_time
;
4563 /* Don't try to take a bunch of bits that cross
4564 the word boundary in the INTEGER_CST. We can
4565 only select bits from the LOW or HIGH part
4567 if (shift
< HOST_BITS_PER_WIDE_INT
4568 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4570 this_time
= shift
+ this_time
- HOST_BITS_PER_WIDE_INT
;
4571 shift
= HOST_BITS_PER_WIDE_INT
;
4574 /* Now get the bits from the appropriate constant word. */
4575 if (shift
< HOST_BITS_PER_WIDE_INT
)
4576 value
= TREE_INT_CST_LOW (val
);
4577 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4579 value
= TREE_INT_CST_HIGH (val
);
4580 shift
-= HOST_BITS_PER_WIDE_INT
;
4585 /* Get the result. This works only when:
4586 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4587 byte
|= (((value
>> shift
)
4588 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4589 << (BITS_PER_UNIT
- this_time
- next_bit
));
4593 /* On little-endian machines,
4594 take first the least significant bits of the value
4595 and pack them starting at the least significant
4596 bits of the bytes. */
4597 shift
= next_offset
- int_bit_position (field
);
4599 /* Don't try to take a bunch of bits that cross
4600 the word boundary in the INTEGER_CST. We can
4601 only select bits from the LOW or HIGH part
4603 if (shift
< HOST_BITS_PER_WIDE_INT
4604 && shift
+ this_time
> HOST_BITS_PER_WIDE_INT
)
4605 this_time
= (HOST_BITS_PER_WIDE_INT
- shift
);
4607 /* Now get the bits from the appropriate constant word. */
4608 if (shift
< HOST_BITS_PER_WIDE_INT
)
4609 value
= TREE_INT_CST_LOW (val
);
4610 else if (shift
< 2 * HOST_BITS_PER_WIDE_INT
)
4612 value
= TREE_INT_CST_HIGH (val
);
4613 shift
-= HOST_BITS_PER_WIDE_INT
;
4618 /* Get the result. This works only when:
4619 1 <= this_time <= HOST_BITS_PER_WIDE_INT. */
4620 byte
|= (((value
>> shift
)
4621 & (((HOST_WIDE_INT
) 2 << (this_time
- 1)) - 1))
4625 next_offset
+= this_time
;
4626 byte_buffer_in_use
= 1;
4631 if (byte_buffer_in_use
)
4633 ASM_OUTPUT_BYTE (asm_out_file
, byte
);
4637 if (total_bytes
< size
)
4638 assemble_zeros (size
- total_bytes
);
4641 #ifdef HANDLE_PRAGMA_WEAK
4642 /* Add function NAME to the weak symbols list. VALUE is a weak alias
4643 associatd with NAME. */
4646 add_weak (name
, value
)
4650 struct weak_syms
*weak
;
4652 weak
= (struct weak_syms
*) permalloc (sizeof (struct weak_syms
));
4657 weak
->next
= weak_decls
;
4659 weak
->value
= value
;
4664 #endif /* HANDLE_PRAGMA_WEAK */
4666 /* Declare DECL to be a weak symbol. */
4672 if (! TREE_PUBLIC (decl
))
4673 error_with_decl (decl
, "weak declaration of `%s' must be public");
4674 else if (TREE_ASM_WRITTEN (decl
))
4675 error_with_decl (decl
, "weak declaration of `%s' must precede definition");
4676 else if (SUPPORTS_WEAK
)
4677 DECL_WEAK (decl
) = 1;
4678 #ifdef HANDLE_PRAGMA_WEAK
4679 add_weak (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), NULL
);
4683 /* Emit any pending weak declarations. */
4685 #ifdef HANDLE_PRAGMA_WEAK
4686 struct weak_syms
* weak_decls
;
4692 #ifdef HANDLE_PRAGMA_WEAK
4693 if (HANDLE_PRAGMA_WEAK
)
4695 struct weak_syms
*t
;
4696 for (t
= weak_decls
; t
; t
= t
->next
)
4699 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, t
->name
, t
->value
);
4705 /* Remove NAME from the pending list of weak symbols. This prevents
4706 the compiler from emitting multiple .weak directives which confuses
4708 #ifdef ASM_WEAKEN_LABEL
4710 remove_from_pending_weak_list (name
)
4711 const char *name ATTRIBUTE_UNUSED
;
4713 #ifdef HANDLE_PRAGMA_WEAK
4714 if (HANDLE_PRAGMA_WEAK
)
4716 struct weak_syms
*t
;
4717 for (t
= weak_decls
; t
; t
= t
->next
)
4719 if (t
->name
&& strcmp (name
, t
->name
) == 0)
4728 assemble_alias (decl
, target
)
4729 tree decl
, target ATTRIBUTE_UNUSED
;
4733 /* We must force creation of DECL_RTL for debug info generation, even though
4734 we don't use it here. */
4735 make_decl_rtl (decl
, NULL
);
4737 name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4739 #ifdef ASM_OUTPUT_DEF
4740 /* Make name accessible from other files, if appropriate. */
4742 if (TREE_PUBLIC (decl
))
4744 #ifdef ASM_WEAKEN_LABEL
4745 if (DECL_WEAK (decl
))
4747 ASM_WEAKEN_LABEL (asm_out_file
, name
);
4748 /* Remove this function from the pending weak list so that
4749 we do not emit multiple .weak directives for it. */
4750 remove_from_pending_weak_list
4751 (IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)));
4755 ASM_GLOBALIZE_LABEL (asm_out_file
, name
);
4758 #ifdef ASM_OUTPUT_DEF_FROM_DECLS
4759 ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file
, decl
, target
);
4761 ASM_OUTPUT_DEF (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4763 TREE_ASM_WRITTEN (decl
) = 1;
4765 #ifdef ASM_OUTPUT_WEAK_ALIAS
4766 if (! DECL_WEAK (decl
))
4767 warning ("only weak aliases are supported in this configuration");
4769 ASM_OUTPUT_WEAK_ALIAS (asm_out_file
, name
, IDENTIFIER_POINTER (target
));
4770 TREE_ASM_WRITTEN (decl
) = 1;
4772 warning ("alias definitions not supported in this configuration; ignored");
4777 /* Returns 1 if the target configuration supports defining public symbols
4778 so that one of them will be chosen at link time instead of generating a
4779 multiply-defined symbol error, whether through the use of weak symbols or
4780 a target-specific mechanism for having duplicates discarded. */
4783 supports_one_only ()
4785 if (SUPPORTS_ONE_ONLY
)
4787 return SUPPORTS_WEAK
;
4790 /* Set up DECL as a public symbol that can be defined in multiple
4791 translation units without generating a linker error. */
4794 make_decl_one_only (decl
)
4797 if (TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
4800 TREE_PUBLIC (decl
) = 1;
4802 if (TREE_CODE (decl
) == VAR_DECL
4803 && (DECL_INITIAL (decl
) == 0 || DECL_INITIAL (decl
) == error_mark_node
))
4804 DECL_COMMON (decl
) = 1;
4805 else if (SUPPORTS_ONE_ONLY
)
4807 #ifdef MAKE_DECL_ONE_ONLY
4808 MAKE_DECL_ONE_ONLY (decl
);
4810 DECL_ONE_ONLY (decl
) = 1;
4812 else if (SUPPORTS_WEAK
)
4813 DECL_WEAK (decl
) = 1;
4821 const_str_htab
= htab_create (128, const_str_htab_hash
, const_str_htab_eq
,
4822 const_str_htab_del
);
4823 ggc_add_root (const_hash_table
, MAX_HASH_TABLE
, sizeof const_hash_table
[0],
4824 mark_const_hash_entry
);
4825 ggc_add_root (&const_str_htab
, 1, sizeof const_str_htab
,
4826 mark_const_str_htab
);
4829 /* Select a set of attributes for section NAME based on the properties
4830 of DECL and whether or not RELOC indicates that DECL's initializer
4831 might contain runtime relocations.
4833 We make the section read-only and executable for a function decl,
4834 read-only for a const data decl, and writable for a non-const data decl.
4836 If the section has already been defined, to not allow it to have
4837 different attributes, as (1) this is ambiguous since we're not seeing
4838 all the declarations up front and (2) some assemblers (e.g. SVR4)
4839 do not recoginize section redefinitions. */
4842 default_section_type_flags (decl
, name
, reloc
)
4849 unsigned int **slot
;
4851 /* The names we put in the hashtable will always be the unique
4852 versions gived to us by the stringtable, so we can just use
4853 their addresses as the keys. */
4855 htab
= htab_create (31, htab_hash_pointer
, htab_eq_pointer
, NULL
);
4857 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
4858 flags
= SECTION_CODE
;
4859 else if (decl
&& DECL_READONLY_SECTION (decl
, reloc
))
4862 flags
= SECTION_WRITE
;
4864 if (decl
&& DECL_ONE_ONLY (decl
))
4865 flags
|= SECTION_LINKONCE
;
4867 if (strcmp (name
, ".bss") == 0
4868 || strncmp (name
, ".bss.", 5) == 0
4869 || strncmp (name
, ".gnu.linkonce.b.", 16) == 0
4870 || strcmp (name
, ".sbss") == 0
4871 || strncmp (name
, ".sbss.", 6) == 0
4872 || strncmp (name
, ".gnu.linkonce.sb.", 17) == 0)
4873 flags
|= SECTION_BSS
;
4875 /* See if we already have an entry for this section. */
4876 slot
= (unsigned int **) htab_find_slot (htab
, name
, INSERT
);
4879 *slot
= (unsigned int *) xmalloc (sizeof (unsigned int));
4884 if (decl
&& **slot
!= flags
)
4885 error_with_decl (decl
, "%s causes a section type conflict");
4891 /* Output assembly to switch to section NAME with attribute FLAGS.
4892 Four variants for common object file formats. */
4895 default_no_named_section (name
, flags
, align
)
4896 const char *name ATTRIBUTE_UNUSED
;
4897 unsigned int flags ATTRIBUTE_UNUSED
;
4898 unsigned int align ATTRIBUTE_UNUSED
;
4900 /* Some object formats don't support named sections at all. The
4901 front-end should already have flagged this as an error. */
4906 default_elf_asm_named_section (name
, flags
, align
)
4909 unsigned int align ATTRIBUTE_UNUSED
;
4911 char flagchars
[8], *f
= flagchars
;
4914 if (!(flags
& SECTION_DEBUG
))
4916 if (flags
& SECTION_WRITE
)
4918 if (flags
& SECTION_CODE
)
4920 if (flags
& SECTION_SMALL
)
4924 if (flags
& SECTION_BSS
)
4929 fprintf (asm_out_file
, "\t.section\t%s,\"%s\",@%s\n",
4930 name
, flagchars
, type
);
4934 default_coff_asm_named_section (name
, flags
, align
)
4937 unsigned int align ATTRIBUTE_UNUSED
;
4939 char flagchars
[8], *f
= flagchars
;
4941 if (flags
& SECTION_WRITE
)
4943 if (flags
& SECTION_CODE
)
4947 fprintf (asm_out_file
, "\t.section\t%s,\"%s\"\n", name
, flagchars
);
4951 default_pe_asm_named_section (name
, flags
, align
)
4954 unsigned int align ATTRIBUTE_UNUSED
;
4956 default_coff_asm_named_section (name
, flags
, align
);
4958 if (flags
& SECTION_LINKONCE
)
4960 /* Functions may have been compiled at various levels of
4961 optimization so we can't use `same_size' here.
4962 Instead, have the linker pick one. */
4963 fprintf (asm_out_file
, "\t.linkonce %s\n",
4964 (flags
& SECTION_CODE
? "discard" : "same_size"));