| /* Output variables, constants and external declarations, for GNU compiler. |
| Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, |
| 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 |
| Free Software Foundation, Inc. |
| |
| This file is part of GCC. |
| |
| GCC is free software; you can redistribute it and/or modify it under |
| the terms of the GNU General Public License as published by the Free |
| Software Foundation; either version 2, or (at your option) any later |
| version. |
| |
| GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
| WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with GCC; see the file COPYING. If not, write to the Free |
| Software Foundation, 59 Temple Place - Suite 330, Boston, MA |
| 02111-1307, USA. */ |
| |
| |
| /* This file handles generation of all the assembler code |
| *except* the instructions of a function. |
| This includes declarations of variables and their initial values. |
| |
| We also output the assembler code for constants stored in memory |
| and are responsible for combining constants with the same value. */ |
| |
| #include "config.h" |
| #include "system.h" |
| #include "coretypes.h" |
| #include "tm.h" |
| #include "rtl.h" |
| #include "tree.h" |
| #include "flags.h" |
| #include "function.h" |
| #include "expr.h" |
| #include "hard-reg-set.h" |
| #include "regs.h" |
| #include "real.h" |
| #include "output.h" |
| #include "toplev.h" |
| #include "hashtab.h" |
| #include "c-pragma.h" |
| #include "ggc.h" |
| #include "langhooks.h" |
| #include "tm_p.h" |
| #include "debug.h" |
| #include "target.h" |
| #include "tree-mudflap.h" |
| #include "cgraph.h" |
| #include "cfglayout.h" |
| /* APPLE LOCAL begin LLVM */ |
| #include "llvm.h" |
| /* APPLE LOCAL end LLVM */ |
| |
| #ifdef XCOFF_DEBUGGING_INFO |
| #include "xcoffout.h" /* Needed for external data |
| declarations for e.g. AIX 4.x. */ |
| #endif |
| |
| /* The (assembler) name of the first globally-visible object output. */ |
| const char *first_global_object_name; |
| const char *weak_global_object_name; |
| |
| struct addr_const; |
| struct constant_descriptor_rtx; |
| struct rtx_constant_pool; |
| |
| struct varasm_status GTY(()) |
| { |
| /* If we're using a per-function constant pool, this is it. */ |
| struct rtx_constant_pool *pool; |
| |
| /* Number of tree-constants deferred during the expansion of this |
| function. */ |
| unsigned int deferred_constants; |
| }; |
| |
| #define n_deferred_constants (cfun->varasm->deferred_constants) |
| |
| /* Number for making the label on the next |
| constant that is stored in memory. */ |
| |
| static GTY(()) int const_labelno; |
| |
| /* Carry information from ASM_DECLARE_OBJECT_NAME |
| to ASM_FINISH_DECLARE_OBJECT. */ |
| |
| int size_directive_output; |
| |
| /* The last decl for which assemble_variable was called, |
| if it did ASM_DECLARE_OBJECT_NAME. |
| If the last call to assemble_variable didn't do that, |
| this holds 0. */ |
| |
| tree last_assemble_variable_decl; |
| |
| /* The following global variable indicates if the section label for the |
| "cold" section of code has been output yet to the assembler. The |
| label is useful when running gdb. This is part of the optimization that |
| partitions hot and cold basic blocks into separate sections of the .o |
| file. */ |
| |
| static bool unlikely_section_label_printed = false; |
| |
| /* The following global variable indicates the label name to be put at |
| the start of the first cold section within each function, when |
| partitioning basic blocks into hot and cold sections. */ |
| |
| static char *unlikely_section_label = NULL; |
| |
| /* The following global variable indicates the section name to be used |
| for the current cold section, when partitioning hot and cold basic |
| blocks into separate sections. */ |
| |
| static char *unlikely_text_section_name = NULL; |
| |
| /* We give all constants their own alias set. Perhaps redundant with |
| MEM_READONLY_P, but pre-dates it. */ |
| |
| static HOST_WIDE_INT const_alias_set; |
| |
| static const char *strip_reg_name (const char *); |
| static int contains_pointers_p (tree); |
| #ifdef ASM_OUTPUT_EXTERNAL |
| static bool incorporeal_function_p (tree); |
| #endif |
| static void decode_addr_const (tree, struct addr_const *); |
| static hashval_t const_desc_hash (const void *); |
| static int const_desc_eq (const void *, const void *); |
| static hashval_t const_hash_1 (const tree); |
| static int compare_constant (const tree, const tree); |
| static tree copy_constant (tree); |
| static void output_constant_def_contents (rtx); |
| static void output_addressed_constants (tree); |
| static unsigned HOST_WIDE_INT array_size_for_constructor (tree); |
| static unsigned min_align (unsigned, unsigned); |
| static void output_constructor (tree, unsigned HOST_WIDE_INT, unsigned int); |
| static void globalize_decl (tree); |
| static void maybe_assemble_visibility (tree); |
| static int in_named_entry_eq (const void *, const void *); |
| static hashval_t in_named_entry_hash (const void *); |
| #ifdef BSS_SECTION_ASM_OP |
| #ifdef ASM_OUTPUT_BSS |
| static void asm_output_bss (FILE *, tree, const char *, |
| unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT); |
| #endif |
| #ifdef ASM_OUTPUT_ALIGNED_BSS |
| static void asm_output_aligned_bss (FILE *, tree, const char *, |
| unsigned HOST_WIDE_INT, int) |
| ATTRIBUTE_UNUSED; |
| #endif |
| #endif /* BSS_SECTION_ASM_OP */ |
| static bool asm_emit_uninitialised (tree, const char*, |
| unsigned HOST_WIDE_INT, |
| unsigned HOST_WIDE_INT); |
| static void mark_weak (tree); |
| |
| enum in_section { no_section, in_text, in_unlikely_executed_text, in_data, |
| in_named |
| #ifdef BSS_SECTION_ASM_OP |
| , in_bss |
| #endif |
| #ifdef CTORS_SECTION_ASM_OP |
| , in_ctors |
| #endif |
| #ifdef DTORS_SECTION_ASM_OP |
| , in_dtors |
| #endif |
| #ifdef READONLY_DATA_SECTION_ASM_OP |
| , in_readonly_data |
| #endif |
| #ifdef EXTRA_SECTIONS |
| , EXTRA_SECTIONS |
| #endif |
| }; |
| static GTY(()) enum in_section in_section = no_section; |
| |
| /* Return a nonzero value if DECL has a section attribute. */ |
| #ifndef IN_NAMED_SECTION |
| #define IN_NAMED_SECTION(DECL) \ |
| ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \ |
| && DECL_SECTION_NAME (DECL) != NULL_TREE) |
| #endif |
| |
| /* Text of section name when in_section == in_named. */ |
| static GTY(()) const char *in_named_name; |
| |
| /* Hash table of flags that have been used for a particular named section. */ |
| |
| struct in_named_entry GTY(()) |
| { |
| const char *name; |
| unsigned int flags; |
| bool declared; |
| }; |
| |
| static GTY((param_is (struct in_named_entry))) htab_t in_named_htab; |
| |
| /* Define functions like text_section for any extra sections. */ |
| #ifdef EXTRA_SECTION_FUNCTIONS |
| EXTRA_SECTION_FUNCTIONS |
| #endif |
| |
| /* Tell assembler to switch to text section. */ |
| |
| void |
| text_section (void) |
| { |
| if (in_section != in_text) |
| { |
| in_section = in_text; |
| fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP); |
| } |
| } |
| |
| /* Tell assembler to switch to unlikely-to-be-executed text section. */ |
| |
| void |
| unlikely_text_section (void) |
| { |
| const char *name; |
| int len; |
| |
| if (! unlikely_text_section_name) |
| { |
| if (DECL_SECTION_NAME (current_function_decl) |
| && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME |
| (current_function_decl)), |
| HOT_TEXT_SECTION_NAME) != 0) |
| && (strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME |
| (current_function_decl)), |
| UNLIKELY_EXECUTED_TEXT_SECTION_NAME) != 0)) |
| { |
| name = TREE_STRING_POINTER (DECL_SECTION_NAME |
| (current_function_decl)); |
| len = strlen (name); |
| unlikely_text_section_name = xmalloc ((len + 10) * sizeof (char)); |
| strcpy (unlikely_text_section_name, name); |
| strcat (unlikely_text_section_name, "_unlikely"); |
| } |
| else |
| { |
| len = strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME); |
| unlikely_text_section_name = xmalloc (len+1 * sizeof (char)); |
| strcpy (unlikely_text_section_name, |
| UNLIKELY_EXECUTED_TEXT_SECTION_NAME); |
| } |
| } |
| |
| if ((in_section != in_unlikely_executed_text) |
| && (in_section != in_named |
| || strcmp (in_named_name, unlikely_text_section_name) != 0)) |
| { |
| named_section (NULL_TREE, unlikely_text_section_name, 0); |
| in_section = in_unlikely_executed_text; |
| |
| if (!unlikely_section_label_printed) |
| { |
| ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label); |
| unlikely_section_label_printed = true; |
| } |
| } |
| } |
| |
| /* Tell assembler to switch to data section. */ |
| |
| void |
| data_section (void) |
| { |
| if (in_section != in_data) |
| { |
| in_section = in_data; |
| fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP); |
| } |
| } |
| |
| /* Tell assembler to switch to read-only data section. This is normally |
| the text section. */ |
| |
| void |
| readonly_data_section (void) |
| { |
| #ifdef READONLY_DATA_SECTION |
| READONLY_DATA_SECTION (); /* Note this can call data_section. */ |
| #else |
| #ifdef READONLY_DATA_SECTION_ASM_OP |
| if (in_section != in_readonly_data) |
| { |
| in_section = in_readonly_data; |
| fputs (READONLY_DATA_SECTION_ASM_OP, asm_out_file); |
| fputc ('\n', asm_out_file); |
| } |
| #else |
| text_section (); |
| #endif |
| #endif |
| } |
| |
| /* Determine if we're in the text section. */ |
| |
| int |
| in_text_section (void) |
| { |
| return in_section == in_text; |
| } |
| |
| /* Determine if we're in the unlikely-to-be-executed text section. */ |
| |
| int |
| in_unlikely_text_section (void) |
| { |
| bool ret_val; |
| |
| ret_val = ((in_section == in_unlikely_executed_text) |
| || (in_section == in_named |
| && unlikely_text_section_name |
| && strcmp (in_named_name, unlikely_text_section_name) == 0)); |
| |
| return ret_val; |
| } |
| |
| /* Determine if we're in the data section. */ |
| |
| int |
| in_data_section (void) |
| { |
| return in_section == in_data; |
| } |
| |
| /* Helper routines for maintaining in_named_htab. */ |
| |
| static int |
| in_named_entry_eq (const void *p1, const void *p2) |
| { |
| const struct in_named_entry *old = p1; |
| const char *new = p2; |
| |
| return strcmp (old->name, new) == 0; |
| } |
| |
| static hashval_t |
| in_named_entry_hash (const void *p) |
| { |
| const struct in_named_entry *old = p; |
| return htab_hash_string (old->name); |
| } |
| |
| /* If SECTION has been seen before as a named section, return the flags |
| that were used. Otherwise, return 0. Note, that 0 is a perfectly valid |
| set of flags for a section to have, so 0 does not mean that the section |
| has not been seen. */ |
| |
| static unsigned int |
| get_named_section_flags (const char *section) |
| { |
| struct in_named_entry **slot; |
| |
| slot = (struct in_named_entry **) |
| htab_find_slot_with_hash (in_named_htab, section, |
| htab_hash_string (section), NO_INSERT); |
| |
| return slot ? (*slot)->flags : 0; |
| } |
| |
| /* Returns true if the section has been declared before. Sets internal |
| flag on this section in in_named_hash so subsequent calls on this |
| section will return false. */ |
| |
| bool |
| named_section_first_declaration (const char *name) |
| { |
| struct in_named_entry **slot; |
| |
| slot = (struct in_named_entry **) |
| htab_find_slot_with_hash (in_named_htab, name, |
| htab_hash_string (name), NO_INSERT); |
| if (! (*slot)->declared) |
| { |
| (*slot)->declared = true; |
| return true; |
| } |
| else |
| { |
| return false; |
| } |
| } |
| |
| |
| /* Record FLAGS for SECTION. If SECTION was previously recorded with a |
| different set of flags, return false. */ |
| |
| bool |
| set_named_section_flags (const char *section, unsigned int flags) |
| { |
| struct in_named_entry **slot, *entry; |
| |
| slot = (struct in_named_entry **) |
| htab_find_slot_with_hash (in_named_htab, section, |
| htab_hash_string (section), INSERT); |
| entry = *slot; |
| |
| if (!entry) |
| { |
| entry = ggc_alloc (sizeof (*entry)); |
| *slot = entry; |
| entry->name = ggc_strdup (section); |
| entry->flags = flags; |
| entry->declared = false; |
| } |
| else if (entry->flags != flags) |
| return false; |
| |
| return true; |
| } |
| |
| /* Tell assembler to change to section NAME with attributes FLAGS. If |
| DECL is non-NULL, it is the VAR_DECL or FUNCTION_DECL with which |
| this section is associated. */ |
| |
| void |
| named_section_real (const char *name, unsigned int flags, tree decl) |
| { |
| if (in_section != in_named || strcmp (name, in_named_name) != 0) |
| { |
| if (! set_named_section_flags (name, flags)) |
| abort (); |
| |
| targetm.asm_out.named_section (name, flags, decl); |
| |
| if (flags & SECTION_FORGET) |
| in_section = no_section; |
| else |
| { |
| in_named_name = ggc_strdup (name); |
| in_section = in_named; |
| } |
| } |
| } |
| |
| /* Tell assembler to change to section NAME for DECL. |
| If DECL is NULL, just switch to section NAME. |
| If NAME is NULL, get the name from DECL. |
| If RELOC is 1, the initializer for DECL contains relocs. */ |
| |
| void |
| named_section (tree decl, const char *name, int reloc) |
| { |
| unsigned int flags; |
| |
| if (decl != NULL_TREE && !DECL_P (decl)) |
| abort (); |
| if (name == NULL) |
| name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl)); |
| |
| if (strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0 |
| && !unlikely_text_section_name) |
| { |
| unlikely_text_section_name = xmalloc |
| (strlen (UNLIKELY_EXECUTED_TEXT_SECTION_NAME) + 1 |
| * sizeof (char)); |
| strcpy (unlikely_text_section_name, |
| UNLIKELY_EXECUTED_TEXT_SECTION_NAME); |
| } |
| |
| flags = targetm.section_type_flags (decl, name, reloc); |
| |
| /* Sanity check user variables for flag changes. Non-user |
| section flag changes will abort in named_section_flags. |
| However, don't complain if SECTION_OVERRIDE is set. |
| We trust that the setter knows that it is safe to ignore |
| the default flags for this decl. */ |
| if (decl && ! set_named_section_flags (name, flags)) |
| { |
| flags = get_named_section_flags (name); |
| if ((flags & SECTION_OVERRIDE) == 0) |
| error ("%J%D causes a section type conflict", decl, decl); |
| } |
| |
| named_section_real (name, flags, decl); |
| } |
| |
| /* If required, set DECL_SECTION_NAME to a unique name. */ |
| |
| void |
| resolve_unique_section (tree decl, int reloc ATTRIBUTE_UNUSED, |
| int flag_function_or_data_sections) |
| { |
| if (DECL_SECTION_NAME (decl) == NULL_TREE |
| && targetm.have_named_sections |
| && (flag_function_or_data_sections |
| || DECL_ONE_ONLY (decl))) |
| targetm.asm_out.unique_section (decl, reloc); |
| } |
| |
| #ifdef BSS_SECTION_ASM_OP |
| |
| /* Tell the assembler to switch to the bss section. */ |
| |
| void |
| bss_section (void) |
| { |
| if (in_section != in_bss) |
| { |
| fprintf (asm_out_file, "%s\n", BSS_SECTION_ASM_OP); |
| in_section = in_bss; |
| } |
| } |
| |
| #ifdef ASM_OUTPUT_BSS |
| |
| /* Utility function for ASM_OUTPUT_BSS for targets to use if |
| they don't support alignments in .bss. |
| ??? It is believed that this function will work in most cases so such |
| support is localized here. */ |
| |
| static void |
| asm_output_bss (FILE *file, tree decl ATTRIBUTE_UNUSED, |
| const char *name, |
| unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED, |
| unsigned HOST_WIDE_INT rounded) |
| { |
| targetm.asm_out.globalize_label (file, name); |
| bss_section (); |
| #ifdef ASM_DECLARE_OBJECT_NAME |
| last_assemble_variable_decl = decl; |
| ASM_DECLARE_OBJECT_NAME (file, name, decl); |
| #else |
| /* Standard thing is just output label for the object. */ |
| ASM_OUTPUT_LABEL (file, name); |
| #endif /* ASM_DECLARE_OBJECT_NAME */ |
| ASM_OUTPUT_SKIP (file, rounded ? rounded : 1); |
| } |
| |
| #endif |
| |
| #ifdef ASM_OUTPUT_ALIGNED_BSS |
| |
| /* Utility function for targets to use in implementing |
| ASM_OUTPUT_ALIGNED_BSS. |
| ??? It is believed that this function will work in most cases so such |
| support is localized here. */ |
| |
| static void |
| asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED, |
| const char *name, unsigned HOST_WIDE_INT size, |
| int align) |
| { |
| bss_section (); |
| ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT)); |
| #ifdef ASM_DECLARE_OBJECT_NAME |
| last_assemble_variable_decl = decl; |
| ASM_DECLARE_OBJECT_NAME (file, name, decl); |
| #else |
| /* Standard thing is just output label for the object. */ |
| ASM_OUTPUT_LABEL (file, name); |
| #endif /* ASM_DECLARE_OBJECT_NAME */ |
| ASM_OUTPUT_SKIP (file, size ? size : 1); |
| } |
| |
| #endif |
| |
| #endif /* BSS_SECTION_ASM_OP */ |
| |
| /* Switch to the section for function DECL. |
| |
| If DECL is NULL_TREE, switch to the text section. We can be passed |
| NULL_TREE under some circumstances by dbxout.c at least. */ |
| |
| void |
| function_section (tree decl) |
| { |
| if (decl == NULL_TREE) |
| text_section (); |
| else |
| { |
| /* ??? Typical use of this function maybe shouldn't be looking |
| for unlikely blocks at all - in the event that an entire |
| function is going into the unlikely-execute section, that |
| should be reflected in its DECL_SECTION_NAME. */ |
| rtx insns = cfun && cfun->emit ? get_insns () : 0; |
| bool unlikely = insns && scan_ahead_for_unlikely_executed_note (insns); |
| |
| #ifdef USE_SELECT_SECTION_FOR_FUNCTIONS |
| /* APPLE LOCAL begin mainline 2006-02-13 radar 4373419 */ |
| if (DECL_SECTION_NAME (decl)) |
| { |
| if (unlikely) |
| unlikely_text_section (); |
| else |
| named_section (decl, 0, 0); |
| } |
| else |
| targetm.asm_out.select_section (decl, unlikely, DECL_ALIGN (decl)); |
| /* APPLE LOCAL end mainline 2006-02-13 radar 4373419 */ |
| #else |
| if (unlikely) |
| unlikely_text_section (); |
| else if (DECL_SECTION_NAME (decl)) |
| named_section (decl, 0, 0); |
| else |
| text_section (); |
| #endif |
| } |
| } |
| |
| /* Switch to read-only data section associated with function DECL. */ |
| |
| void |
| default_function_rodata_section (tree decl) |
| { |
| if (decl != NULL_TREE && DECL_SECTION_NAME (decl)) |
| { |
| const char *name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl)); |
| |
| /* For .gnu.linkonce.t.foo we want to use .gnu.linkonce.r.foo. */ |
| if (DECL_ONE_ONLY (decl) && strncmp (name, ".gnu.linkonce.t.", 16) == 0) |
| { |
| size_t len = strlen (name) + 1; |
| char *rname = alloca (len); |
| |
| memcpy (rname, name, len); |
| rname[14] = 'r'; |
| named_section_real (rname, SECTION_LINKONCE, decl); |
| return; |
| } |
| /* For .text.foo we want to use .rodata.foo. */ |
| else if (flag_function_sections && flag_data_sections |
| && strncmp (name, ".text.", 6) == 0) |
| { |
| size_t len = strlen (name) + 1; |
| char *rname = alloca (len + 2); |
| |
| memcpy (rname, ".rodata", 7); |
| memcpy (rname + 7, name + 5, len - 5); |
| named_section_flags (rname, 0); |
| return; |
| } |
| } |
| |
| readonly_data_section (); |
| } |
| |
| /* Switch to read-only data section associated with function DECL |
| for targets where that section should be always the single |
| readonly data section. */ |
| |
| void |
| default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED) |
| { |
| readonly_data_section (); |
| } |
| |
| /* Switch to section for variable DECL. RELOC is the same as the |
| argument to SELECT_SECTION. */ |
| |
| void |
| variable_section (tree decl, int reloc) |
| { |
| if (IN_NAMED_SECTION (decl)) |
| named_section (decl, NULL, reloc); |
| else |
| targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl)); |
| } |
| |
| /* Tell assembler to switch to the section for string merging. */ |
| |
| void |
| mergeable_string_section (tree decl ATTRIBUTE_UNUSED, |
| unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED, |
| unsigned int flags ATTRIBUTE_UNUSED) |
| { |
| if (HAVE_GAS_SHF_MERGE && flag_merge_constants |
| && TREE_CODE (decl) == STRING_CST |
| && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE |
| && align <= 256 |
| && TREE_STRING_LENGTH (decl) >= int_size_in_bytes (TREE_TYPE (decl))) |
| { |
| enum machine_mode mode; |
| unsigned int modesize; |
| const char *str; |
| int i, j, len, unit; |
| char name[30]; |
| |
| mode = TYPE_MODE (TREE_TYPE (TREE_TYPE (decl))); |
| modesize = GET_MODE_BITSIZE (mode); |
| if (modesize >= 8 && modesize <= 256 |
| && (modesize & (modesize - 1)) == 0) |
| { |
| if (align < modesize) |
| align = modesize; |
| |
| str = TREE_STRING_POINTER (decl); |
| len = TREE_STRING_LENGTH (decl); |
| unit = GET_MODE_SIZE (mode); |
| |
| /* Check for embedded NUL characters. */ |
| for (i = 0; i < len; i += unit) |
| { |
| for (j = 0; j < unit; j++) |
| if (str[i + j] != '\0') |
| break; |
| if (j == unit) |
| break; |
| } |
| if (i == len - unit) |
| { |
| sprintf (name, ".rodata.str%d.%d", modesize / 8, |
| (int) (align / 8)); |
| flags |= (modesize / 8) | SECTION_MERGE | SECTION_STRINGS; |
| if (!i && modesize < align) |
| { |
| /* A "" string with requested alignment greater than |
| character size might cause a problem: |
| if some other string required even bigger |
| alignment than "", then linker might think the |
| "" is just part of padding after some other string |
| and not put it into the hash table initially. |
| But this means "" could have smaller alignment |
| than requested. */ |
| #ifdef ASM_OUTPUT_SECTION_START |
| named_section_flags (name, flags); |
| ASM_OUTPUT_SECTION_START (asm_out_file); |
| #else |
| readonly_data_section (); |
| #endif |
| return; |
| } |
| |
| named_section_flags (name, flags); |
| return; |
| } |
| } |
| } |
| |
| readonly_data_section (); |
| } |
| |
| /* Tell assembler to switch to the section for constant merging. */ |
| |
| void |
| mergeable_constant_section (enum machine_mode mode ATTRIBUTE_UNUSED, |
| unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED, |
| unsigned int flags ATTRIBUTE_UNUSED) |
| { |
| unsigned int modesize = GET_MODE_BITSIZE (mode); |
| |
| if (HAVE_GAS_SHF_MERGE && flag_merge_constants |
| && mode != VOIDmode |
| && mode != BLKmode |
| && modesize <= align |
| && align >= 8 |
| && align <= 256 |
| && (align & (align - 1)) == 0) |
| { |
| char name[24]; |
| |
| sprintf (name, ".rodata.cst%d", (int) (align / 8)); |
| flags |= (align / 8) | SECTION_MERGE; |
| named_section_flags (name, flags); |
| return; |
| } |
| |
| readonly_data_section (); |
| } |
| |
| /* Given NAME, a putative register name, discard any customary prefixes. */ |
| |
| static const char * |
| strip_reg_name (const char *name) |
| { |
| #ifdef REGISTER_PREFIX |
| if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX))) |
| name += strlen (REGISTER_PREFIX); |
| #endif |
| if (name[0] == '%' || name[0] == '#') |
| name++; |
| return name; |
| } |
| |
| /* The user has asked for a DECL to have a particular name. Set (or |
| change) it in such a way that we don't prefix an underscore to |
| it. */ |
| void |
| set_user_assembler_name (tree decl, const char *name) |
| { |
| char *starred = alloca (strlen (name) + 2); |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM |
| starred[0] = '*'; |
| strcpy (starred + 1, name); |
| #else |
| /* If the name isn't an LLVM intrinsic, add a starting '\1' character to |
| * indicate that the target assembler shouldn't modify the name. If it *is* |
| * an LLVM intrinsic name, just set the name, to support code like this: |
| * unsigned bswap(unsigned) __asm__("llvm.bswap"); |
| */ |
| if (name[0] != 'l' || name[1] != 'l' || name[2] != 'v' || name[3] != 'm' |
| || name[4] != '.') { |
| starred[0] = 1; |
| strcpy (starred + 1, name); |
| } else { |
| strcpy (starred, name); |
| } |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| change_decl_assembler_name (decl, get_identifier (starred)); |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM |
| SET_DECL_RTL (decl, NULL_RTX); |
| #else |
| SET_DECL_LLVM (decl, NULL_RTX); |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| } |
| |
| /* Decode an `asm' spec for a declaration as a register name. |
| Return the register number, or -1 if nothing specified, |
| or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized, |
| or -3 if ASMSPEC is `cc' and is not recognized, |
| or -4 if ASMSPEC is `memory' and is not recognized. |
| Accept an exact spelling or a decimal number. |
| Prefixes such as % are optional. */ |
| |
| int |
| decode_reg_name (const char *asmspec) |
| { |
| if (asmspec != 0) |
| { |
| int i; |
| |
| /* Get rid of confusing prefixes. */ |
| asmspec = strip_reg_name (asmspec); |
| |
| /* Allow a decimal number as a "register name". */ |
| for (i = strlen (asmspec) - 1; i >= 0; i--) |
| if (! ISDIGIT (asmspec[i])) |
| break; |
| if (asmspec[0] != 0 && i < 0) |
| { |
| i = atoi (asmspec); |
| if (i < FIRST_PSEUDO_REGISTER && i >= 0) |
| return i; |
| else |
| return -2; |
| } |
| |
| for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
| if (reg_names[i][0] |
| && ! strcmp (asmspec, strip_reg_name (reg_names[i]))) |
| return i; |
| |
| #ifdef ADDITIONAL_REGISTER_NAMES |
| { |
| static const struct { const char *const name; const int number; } table[] |
| = ADDITIONAL_REGISTER_NAMES; |
| |
| for (i = 0; i < (int) ARRAY_SIZE (table); i++) |
| if (! strcmp (asmspec, table[i].name)) |
| return table[i].number; |
| } |
| #endif /* ADDITIONAL_REGISTER_NAMES */ |
| |
| if (!strcmp (asmspec, "memory")) |
| return -4; |
| |
| if (!strcmp (asmspec, "cc")) |
| return -3; |
| |
| return -2; |
| } |
| |
| return -1; |
| } |
| |
| /* Create the DECL_RTL for a VAR_DECL or FUNCTION_DECL. DECL should |
| have static storage duration. In other words, it should not be an |
| automatic variable, including PARM_DECLs. |
| |
| There is, however, one exception: this function handles variables |
| explicitly placed in a particular register by the user. |
| |
| This is never called for PARM_DECL nodes. */ |
| |
| void |
| make_decl_rtl (tree decl) |
| { |
| const char *name = 0; |
| int reg_number; |
| rtx x; |
| |
| /* Check that we are not being given an automatic variable. */ |
| /* A weak alias has TREE_PUBLIC set but not the other bits. */ |
| if (TREE_CODE (decl) == PARM_DECL |
| || TREE_CODE (decl) == RESULT_DECL |
| || (TREE_CODE (decl) == VAR_DECL |
| && !TREE_STATIC (decl) |
| && !TREE_PUBLIC (decl) |
| && !DECL_EXTERNAL (decl) |
| && !DECL_REGISTER (decl))) |
| abort (); |
| /* And that we were not given a type or a label. */ |
| else if (TREE_CODE (decl) == TYPE_DECL |
| || TREE_CODE (decl) == LABEL_DECL) |
| abort (); |
| |
| /* For a duplicate declaration, we can be called twice on the |
| same DECL node. Don't discard the RTL already made. */ |
| if (DECL_RTL_SET_P (decl)) |
| { |
| /* If the old RTL had the wrong mode, fix the mode. */ |
| if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl)) |
| SET_DECL_RTL (decl, adjust_address_nv (DECL_RTL (decl), |
| DECL_MODE (decl), 0)); |
| |
| if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)) |
| return; |
| |
| /* ??? Another way to do this would be to maintain a hashed |
| table of such critters. Instead of adding stuff to a DECL |
| to give certain attributes to it, we could use an external |
| hash map from DECL to set of attributes. */ |
| |
| /* Let the target reassign the RTL if it wants. |
| This is necessary, for example, when one machine specific |
| decl attribute overrides another. */ |
| targetm.encode_section_info (decl, DECL_RTL (decl), false); |
| |
| /* Make this function static known to the mudflap runtime. */ |
| if (flag_mudflap && TREE_CODE (decl) == VAR_DECL) |
| mudflap_enqueue_decl (decl); |
| |
| return; |
| } |
| |
| name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
| |
| if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl)) |
| { |
| reg_number = decode_reg_name (name); |
| /* First detect errors in declaring global registers. */ |
| if (reg_number == -1) |
| error ("%Jregister name not specified for %qD", decl, decl); |
| else if (reg_number < 0) |
| error ("%Jinvalid register name for %qD", decl, decl); |
| else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode) |
| error ("%Jdata type of %qD isn%'t suitable for a register", |
| decl, decl); |
| else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl)))) |
| error ("%Jregister specified for %qD isn%'t suitable for data type", |
| decl, decl); |
| /* Now handle properly declared static register variables. */ |
| else |
| { |
| int nregs; |
| |
| if (DECL_INITIAL (decl) != 0 && TREE_STATIC (decl)) |
| { |
| DECL_INITIAL (decl) = 0; |
| error ("global register variable has initial value"); |
| } |
| if (TREE_THIS_VOLATILE (decl)) |
| warning ("volatile register variables don%'t " |
| "work as you might wish"); |
| |
| /* If the user specified one of the eliminables registers here, |
| e.g., FRAME_POINTER_REGNUM, we don't want to get this variable |
| confused with that register and be eliminated. This usage is |
| somewhat suspect... */ |
| |
| SET_DECL_RTL (decl, gen_rtx_raw_REG (DECL_MODE (decl), reg_number)); |
| ORIGINAL_REGNO (DECL_RTL (decl)) = reg_number; |
| REG_USERVAR_P (DECL_RTL (decl)) = 1; |
| |
| if (TREE_STATIC (decl)) |
| { |
| /* Make this register global, so not usable for anything |
| else. */ |
| #ifdef ASM_DECLARE_REGISTER_GLOBAL |
| name = IDENTIFIER_POINTER (DECL_NAME (decl)); |
| ASM_DECLARE_REGISTER_GLOBAL (asm_out_file, decl, reg_number, name); |
| #endif |
| nregs = hard_regno_nregs[reg_number][DECL_MODE (decl)]; |
| while (nregs > 0) |
| globalize_reg (reg_number + --nregs); |
| } |
| |
| /* As a register variable, it has no section. */ |
| return; |
| } |
| } |
| /* Now handle ordinary static variables and functions (in memory). |
| Also handle vars declared register invalidly. */ |
| else if (name[0] == '*') |
| { |
| #ifdef REGISTER_PREFIX |
| if (strlen (REGISTER_PREFIX) != 0) |
| { |
| reg_number = decode_reg_name (name); |
| if (reg_number >= 0 || reg_number == -3) |
| error ("%Jregister name given for non-register variable %qD", decl, decl); |
| } |
| #endif |
| } |
| |
| /* Specifying a section attribute on a variable forces it into a |
| non-.bss section, and thus it cannot be common. */ |
| if (TREE_CODE (decl) == VAR_DECL |
| && DECL_SECTION_NAME (decl) != NULL_TREE |
| && DECL_INITIAL (decl) == NULL_TREE |
| && DECL_COMMON (decl)) |
| DECL_COMMON (decl) = 0; |
| |
| /* Variables can't be both common and weak. */ |
| if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl)) |
| DECL_COMMON (decl) = 0; |
| |
| x = gen_rtx_SYMBOL_REF (Pmode, name); |
| SYMBOL_REF_WEAK (x) = DECL_WEAK (decl); |
| SYMBOL_REF_DECL (x) = decl; |
| |
| x = gen_rtx_MEM (DECL_MODE (decl), x); |
| if (TREE_CODE (decl) != FUNCTION_DECL) |
| set_mem_attributes (x, decl, 1); |
| SET_DECL_RTL (decl, x); |
| |
| /* Optionally set flags or add text to the name to record information |
| such as that it is a function name. |
| If the name is changed, the macro ASM_OUTPUT_LABELREF |
| will have to know how to strip this information. */ |
| targetm.encode_section_info (decl, DECL_RTL (decl), true); |
| |
| /* Make this function static known to the mudflap runtime. */ |
| if (flag_mudflap && TREE_CODE (decl) == VAR_DECL) |
| mudflap_enqueue_decl (decl); |
| } |
| |
| /* Make the rtl for variable VAR be volatile. |
| Use this only for static variables. */ |
| |
| void |
| make_var_volatile (tree var) |
| { |
| /* APPLE LOCAL begin LLVM */ |
| #ifdef ENABLE_LLVM |
| return; |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| |
| if (!MEM_P (DECL_RTL (var))) |
| abort (); |
| |
| MEM_VOLATILE_P (DECL_RTL (var)) = 1; |
| } |
| |
| /* Output a string of literal assembler code |
| for an `asm' keyword used between functions. */ |
| |
| void |
| assemble_asm (tree string) |
| { |
| /* APPLE LOCAL begin LLVM */ |
| #ifdef ENABLE_LLVM |
| if (TREE_CODE(string) == ADDR_EXPR) |
| string = TREE_OPERAND(string, 0); |
| llvm_emit_file_scope_asm(TREE_STRING_POINTER(string)); |
| return; |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| |
| app_enable (); |
| |
| if (TREE_CODE (string) == ADDR_EXPR) |
| string = TREE_OPERAND (string, 0); |
| |
| fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string)); |
| } |
| |
| /* Record an element in the table of global destructors. SYMBOL is |
| a SYMBOL_REF of the function to be called; PRIORITY is a number |
| between 0 and MAX_INIT_PRIORITY. */ |
| |
| void |
| default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED, |
| int priority ATTRIBUTE_UNUSED) |
| { |
| #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO |
| /* Tell GNU LD that this is part of the static destructor set. |
| This will work for any system that uses stabs, most usefully |
| aout systems. */ |
| dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 /* N_SETT */); |
| dbxout_stab_value_label (XSTR (symbol, 0)); |
| #else |
| sorry ("global destructors not supported on this target"); |
| #endif |
| } |
| |
| void |
| default_named_section_asm_out_destructor (rtx symbol, int priority) |
| { |
| const char *section = ".dtors"; |
| char buf[16]; |
| |
| /* ??? This only works reliably with the GNU linker. */ |
| if (priority != DEFAULT_INIT_PRIORITY) |
| { |
| sprintf (buf, ".dtors.%.5u", |
| /* Invert the numbering so the linker puts us in the proper |
| order; constructors are run from right to left, and the |
| linker sorts in increasing order. */ |
| MAX_INIT_PRIORITY - priority); |
| section = buf; |
| } |
| |
| named_section_flags (section, SECTION_WRITE); |
| assemble_align (POINTER_SIZE); |
| assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1); |
| } |
| |
| #ifdef DTORS_SECTION_ASM_OP |
| void |
| dtors_section (void) |
| { |
| if (in_section != in_dtors) |
| { |
| in_section = in_dtors; |
| fputs (DTORS_SECTION_ASM_OP, asm_out_file); |
| fputc ('\n', asm_out_file); |
| } |
| } |
| |
| void |
| default_dtor_section_asm_out_destructor (rtx symbol, |
| int priority ATTRIBUTE_UNUSED) |
| { |
| dtors_section (); |
| assemble_align (POINTER_SIZE); |
| assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1); |
| } |
| #endif |
| |
| /* Likewise for global constructors. */ |
| |
| void |
| default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED, |
| int priority ATTRIBUTE_UNUSED) |
| { |
| #if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO |
| /* Tell GNU LD that this is part of the static destructor set. |
| This will work for any system that uses stabs, most usefully |
| aout systems. */ |
| dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 /* N_SETT */); |
| dbxout_stab_value_label (XSTR (symbol, 0)); |
| #else |
| sorry ("global constructors not supported on this target"); |
| #endif |
| } |
| |
| void |
| default_named_section_asm_out_constructor (rtx symbol, int priority) |
| { |
| const char *section = ".ctors"; |
| char buf[16]; |
| |
| /* ??? This only works reliably with the GNU linker. */ |
| if (priority != DEFAULT_INIT_PRIORITY) |
| { |
| sprintf (buf, ".ctors.%.5u", |
| /* Invert the numbering so the linker puts us in the proper |
| order; constructors are run from right to left, and the |
| linker sorts in increasing order. */ |
| MAX_INIT_PRIORITY - priority); |
| section = buf; |
| } |
| |
| named_section_flags (section, SECTION_WRITE); |
| assemble_align (POINTER_SIZE); |
| assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1); |
| } |
| |
| #ifdef CTORS_SECTION_ASM_OP |
| void |
| ctors_section (void) |
| { |
| if (in_section != in_ctors) |
| { |
| in_section = in_ctors; |
| fputs (CTORS_SECTION_ASM_OP, asm_out_file); |
| fputc ('\n', asm_out_file); |
| } |
| } |
| |
| void |
| default_ctor_section_asm_out_constructor (rtx symbol, |
| int priority ATTRIBUTE_UNUSED) |
| { |
| ctors_section (); |
| assemble_align (POINTER_SIZE); |
| assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1); |
| } |
| #endif |
| |
| /* CONSTANT_POOL_BEFORE_FUNCTION may be defined as an expression with |
| a nonzero value if the constant pool should be output before the |
| start of the function, or a zero value if the pool should output |
| after the end of the function. The default is to put it before the |
| start. */ |
| |
| #ifndef CONSTANT_POOL_BEFORE_FUNCTION |
| #define CONSTANT_POOL_BEFORE_FUNCTION 1 |
| #endif |
| |
| /* DECL is an object (either VAR_DECL or FUNCTION_DECL) which is going |
| to be output to assembler. |
| Set first_global_object_name and weak_global_object_name as appropriate. */ |
| |
| void |
| notice_global_symbol (tree decl) |
| { |
| const char **type = &first_global_object_name; |
| |
| if (first_global_object_name |
| || !TREE_PUBLIC (decl) || DECL_EXTERNAL (decl) |
| || !DECL_NAME (decl) |
| || (TREE_CODE (decl) != FUNCTION_DECL |
| && (TREE_CODE (decl) != VAR_DECL |
| || (DECL_COMMON (decl) |
| && (DECL_INITIAL (decl) == 0 |
| || DECL_INITIAL (decl) == error_mark_node)))) |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM |
| || !MEM_P (DECL_RTL (decl)) |
| #else |
| || (DECL_LLVM (decl), 0) |
| #endif |
| ) |
| /* APPLE LOCAL end LLVM */ |
| return; |
| |
| /* We win when global object is found, but it is useful to know about weak |
| symbol as well so we can produce nicer unique names. */ |
| if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl)) |
| type = &weak_global_object_name; |
| |
| if (!*type) |
| { |
| const char *p; |
| char *name; |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM |
| rtx decl_rtl = DECL_RTL (decl); |
| name = (char*)XSTR (XEXP (decl_rtl, 0), 0); |
| #else |
| void *decl_llvm = DECL_LLVM (decl); |
| name = (char*)llvm_get_decl_name(decl_llvm); |
| #endif |
| p = targetm.strip_name_encoding (name); |
| /* APPLE LOCAL end LLVM */ |
| |
| name = xstrdup (p); |
| |
| *type = name; |
| } |
| } |
| |
| /* Output assembler code for the constant pool of a function and associated |
| with defining the name of the function. DECL describes the function. |
| NAME is the function's name. For the constant pool, we use the current |
| constant pool data. */ |
| |
| void |
| assemble_start_function (tree decl, const char *fnname) |
| { |
| int align; |
| |
| if (unlikely_text_section_name) |
| free (unlikely_text_section_name); |
| |
| unlikely_section_label_printed = false; |
| unlikely_text_section_name = NULL; |
| |
| unlikely_section_label = reconcat (unlikely_section_label, |
| fnname, ".unlikely_section", NULL); |
| |
| /* The following code does not need preprocessing in the assembler. */ |
| |
| app_disable (); |
| |
| if (CONSTANT_POOL_BEFORE_FUNCTION) |
| output_constant_pool (fnname, decl); |
| |
| /* Make sure the cold text (code) section is properly aligned. This |
| is necessary here in the case where the function has both hot and |
| cold sections, because we don't want to re-set the alignment when the |
| section switch happens mid-function. We don't need to set the hot |
| section alignment here, because code further down in this function |
| sets the alignment for whichever section comes first, and if there |
| is a hot section it is guaranteed to be first. */ |
| |
| if (flag_reorder_blocks_and_partition) |
| { |
| /* APPLE LOCAL begin hot/cold partitioning */ |
| /* We don't want to print out the label for the cold section here, |
| just fix the alignment. Therefore play games with |
| unlikely_section_label_printed to get this behavior. */ |
| |
| unlikely_section_label_printed = true; |
| /* APPLE LOCAL end hot/cold partitioning */ |
| unlikely_text_section (); |
| assemble_align (FUNCTION_BOUNDARY); |
| /* APPLE LOCAL begin hot/cold partitioning */ |
| unlikely_section_label_printed = false; |
| /* APPLE LOCAL end hot/cold partitioning */ |
| } |
| |
| resolve_unique_section (decl, 0, flag_function_sections); |
| function_section (decl); |
| |
| /* Tell assembler to move to target machine's alignment for functions. */ |
| align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT); |
| if (align < force_align_functions_log) |
| align = force_align_functions_log; |
| if (align > 0) |
| { |
| ASM_OUTPUT_ALIGN (asm_out_file, align); |
| } |
| |
| /* Handle a user-specified function alignment. |
| Note that we still need to align to FUNCTION_BOUNDARY, as above, |
| because ASM_OUTPUT_MAX_SKIP_ALIGN might not do any alignment at all. */ |
| if (align_functions_log > align |
| && cfun->function_frequency != FUNCTION_FREQUENCY_UNLIKELY_EXECUTED) |
| { |
| #ifdef ASM_OUTPUT_MAX_SKIP_ALIGN |
| ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file, |
| align_functions_log, align_functions - 1); |
| #else |
| ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log); |
| #endif |
| } |
| |
| #ifdef ASM_OUTPUT_FUNCTION_PREFIX |
| ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname); |
| #endif |
| |
| (*debug_hooks->begin_function) (decl); |
| |
| /* Make function name accessible from other files, if appropriate. */ |
| |
| if (TREE_PUBLIC (decl)) |
| { |
| notice_global_symbol (decl); |
| |
| globalize_decl (decl); |
| |
| maybe_assemble_visibility (decl); |
| } |
| |
| if (DECL_PRESERVE_P (decl)) |
| targetm.asm_out.mark_decl_preserved (fnname); |
| |
| /* Do any machine/system dependent processing of the function name. */ |
| #ifdef ASM_DECLARE_FUNCTION_NAME |
| ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl); |
| #else |
| /* Standard thing is just output label for the function. */ |
| ASM_OUTPUT_LABEL (asm_out_file, fnname); |
| #endif /* ASM_DECLARE_FUNCTION_NAME */ |
| |
| if (in_unlikely_text_section () |
| && !unlikely_section_label_printed) |
| { |
| ASM_OUTPUT_LABEL (asm_out_file, unlikely_section_label); |
| unlikely_section_label_printed = true; |
| } |
| } |
| |
| /* Output assembler code associated with defining the size of the |
| function. DECL describes the function. NAME is the function's name. */ |
| |
| void |
| assemble_end_function (tree decl, const char *fnname) |
| { |
| #ifdef ASM_DECLARE_FUNCTION_SIZE |
| ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl); |
| #endif |
| if (! CONSTANT_POOL_BEFORE_FUNCTION) |
| { |
| output_constant_pool (fnname, decl); |
| function_section (decl); /* need to switch back */ |
| } |
| } |
| |
| /* Assemble code to leave SIZE bytes of zeros. */ |
| |
| void |
| assemble_zeros (unsigned HOST_WIDE_INT size) |
| { |
| /* Do no output if -fsyntax-only. */ |
| if (flag_syntax_only) |
| return; |
| |
| #ifdef ASM_NO_SKIP_IN_TEXT |
| /* The `space' pseudo in the text section outputs nop insns rather than 0s, |
| so we must output 0s explicitly in the text section. */ |
| if ((ASM_NO_SKIP_IN_TEXT && in_text_section ()) |
| || (ASM_NO_SKIP_IN_TEXT && in_unlikely_text_section ())) |
| { |
| unsigned HOST_WIDE_INT i; |
| for (i = 0; i < size; i++) |
| assemble_integer (const0_rtx, 1, BITS_PER_UNIT, 1); |
| } |
| else |
| #endif |
| if (size > 0) |
| ASM_OUTPUT_SKIP (asm_out_file, size); |
| } |
| |
| /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */ |
| |
| void |
| assemble_align (int align) |
| { |
| if (align > BITS_PER_UNIT) |
| { |
| ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); |
| } |
| } |
| |
| /* Assemble a string constant with the specified C string as contents. */ |
| |
| void |
| assemble_string (const char *p, int size) |
| { |
| int pos = 0; |
| int maximum = 2000; |
| |
| /* If the string is very long, split it up. */ |
| |
| while (pos < size) |
| { |
| int thissize = size - pos; |
| if (thissize > maximum) |
| thissize = maximum; |
| |
| ASM_OUTPUT_ASCII (asm_out_file, p, thissize); |
| |
| pos += thissize; |
| p += thissize; |
| } |
| } |
| |
| |
| #if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL |
| #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ |
| ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name, size, DECL_ALIGN (decl)) |
| #else |
| #if defined ASM_OUTPUT_ALIGNED_LOCAL |
| #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ |
| ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl)) |
| #else |
| #define ASM_EMIT_LOCAL(decl, name, size, rounded) \ |
| ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded) |
| #endif |
| #endif |
| |
| #if defined ASM_OUTPUT_ALIGNED_BSS |
| #define ASM_EMIT_BSS(decl, name, size, rounded) \ |
| ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl)) |
| #else |
| #if defined ASM_OUTPUT_BSS |
| #define ASM_EMIT_BSS(decl, name, size, rounded) \ |
| ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded) |
| #else |
| #undef ASM_EMIT_BSS |
| #endif |
| #endif |
| |
| #if defined ASM_OUTPUT_ALIGNED_DECL_COMMON |
| #define ASM_EMIT_COMMON(decl, name, size, rounded) \ |
| ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name, size, DECL_ALIGN (decl)) |
| #else |
| #if defined ASM_OUTPUT_ALIGNED_COMMON |
| #define ASM_EMIT_COMMON(decl, name, size, rounded) \ |
| ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl)) |
| #else |
| #define ASM_EMIT_COMMON(decl, name, size, rounded) \ |
| ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded) |
| #endif |
| #endif |
| |
| static bool |
| asm_emit_uninitialised (tree decl, const char *name, |
| unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED, |
| unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED) |
| { |
| enum |
| { |
| asm_dest_common, |
| asm_dest_bss, |
| asm_dest_local |
| } |
| destination = asm_dest_local; |
| |
| /* ??? We should handle .bss via select_section mechanisms rather than |
| via special target hooks. That would eliminate this special case. */ |
| if (TREE_PUBLIC (decl)) |
| { |
| if (!DECL_COMMON (decl)) |
| #ifdef ASM_EMIT_BSS |
| destination = asm_dest_bss; |
| #else |
| return false; |
| #endif |
| else |
| destination = asm_dest_common; |
| } |
| |
| if (destination != asm_dest_common) |
| { |
| resolve_unique_section (decl, 0, flag_data_sections); |
| /* Custom sections don't belong here. */ |
| if (DECL_SECTION_NAME (decl)) |
| return false; |
| } |
| |
| if (destination == asm_dest_bss) |
| globalize_decl (decl); |
| |
| if (flag_shared_data) |
| { |
| switch (destination) |
| { |
| #ifdef ASM_OUTPUT_SHARED_BSS |
| case asm_dest_bss: |
| ASM_OUTPUT_SHARED_BSS (asm_out_file, decl, name, size, rounded); |
| return; |
| #endif |
| #ifdef ASM_OUTPUT_SHARED_COMMON |
| case asm_dest_common: |
| ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded); |
| return; |
| #endif |
| #ifdef ASM_OUTPUT_SHARED_LOCAL |
| case asm_dest_local: |
| ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded); |
| return; |
| #endif |
| default: |
| break; |
| } |
| } |
| |
| switch (destination) |
| { |
| #ifdef ASM_EMIT_BSS |
| case asm_dest_bss: |
| ASM_EMIT_BSS (decl, name, size, rounded); |
| break; |
| #endif |
| case asm_dest_common: |
| ASM_EMIT_COMMON (decl, name, size, rounded); |
| break; |
| case asm_dest_local: |
| ASM_EMIT_LOCAL (decl, name, size, rounded); |
| break; |
| default: |
| abort (); |
| } |
| |
| return true; |
| } |
| |
| /* Assemble everything that is needed for a variable or function declaration. |
| Not used for automatic variables, and not used for function definitions. |
| Should not be called for variables of incomplete structure type. |
| |
| TOP_LEVEL is nonzero if this variable has file scope. |
| AT_END is nonzero if this is the special handling, at end of compilation, |
| to define things that have had only tentative definitions. |
| DONT_OUTPUT_DATA if nonzero means don't actually output the |
| initial value (that will be done by the caller). */ |
| |
| void |
| assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED, |
| int at_end ATTRIBUTE_UNUSED, int dont_output_data) |
| { |
| const char *name; |
| unsigned int align; |
| int reloc = 0; |
| rtx decl_rtl; |
| /* APPLE LOCAL begin LLVM */ |
| #ifdef ENABLE_LLVM |
| void *decl_llvm; |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| |
| |
| if (lang_hooks.decls.prepare_assemble_variable) |
| lang_hooks.decls.prepare_assemble_variable (decl); |
| |
| last_assemble_variable_decl = 0; |
| |
| /* Normally no need to say anything here for external references, |
| since assemble_external is called by the language-specific code |
| when a declaration is first seen. */ |
| |
| if (DECL_EXTERNAL (decl)) |
| return; |
| |
| /* Output no assembler code for a function declaration. |
| Only definitions of functions output anything. */ |
| |
| if (TREE_CODE (decl) == FUNCTION_DECL) |
| return; |
| |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM /* register globals are not supported */ |
| /* Do nothing for global register variables. */ |
| if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl))) |
| { |
| TREE_ASM_WRITTEN (decl) = 1; |
| return; |
| } |
| #endif |
| /* APPLE LOCAL begin LLVM */ |
| |
| /* If type was incomplete when the variable was declared, |
| see if it is complete now. */ |
| |
| if (DECL_SIZE (decl) == 0) |
| layout_decl (decl, 0); |
| |
| /* Still incomplete => don't allocate it; treat the tentative defn |
| (which is what it must have been) as an `extern' reference. */ |
| |
| if (!dont_output_data && DECL_SIZE (decl) == 0) |
| { |
| error ("%Jstorage size of %qD isn%'t known", decl, decl); |
| TREE_ASM_WRITTEN (decl) = 1; |
| return; |
| } |
| |
| /* The first declaration of a variable that comes through this function |
| decides whether it is global (in C, has external linkage) |
| or local (in C, has internal linkage). So do nothing more |
| if this function has already run. */ |
| |
| if (TREE_ASM_WRITTEN (decl)) |
| return; |
| |
| /* Make sure targetm.encode_section_info is invoked before we set |
| ASM_WRITTEN. */ |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM /* register globals are not supported */ |
| decl_rtl = DECL_RTL (decl); |
| #else |
| decl_llvm = DECL_LLVM (decl); |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| |
| TREE_ASM_WRITTEN (decl) = 1; |
| |
| /* Do no output if -fsyntax-only. */ |
| if (flag_syntax_only) |
| return; |
| |
| /* APPLE LOCAL begin duplicate decls in multiple files. */ |
| if (DECL_DUPLICATE_DECL (decl)) |
| return; |
| /* APPLE LOCAL end duplicate decls in multiple files. */ |
| |
| app_disable (); |
| |
| if (! dont_output_data |
| && ! host_integerp (DECL_SIZE_UNIT (decl), 1)) |
| { |
| error ("%Jsize of variable %qD is too large", decl, decl); |
| return; |
| } |
| |
| /* APPLE LOCAL begin LLVM */ |
| #ifndef ENABLE_LLVM /* register globals are not supported */ |
| name = XSTR (XEXP (decl_rtl, 0), 0); |
| #else |
| name = llvm_get_decl_name (decl_llvm); |
| #endif |
| if (TREE_PUBLIC (decl) && DECL_NAME (decl)) |
| notice_global_symbol (decl); |
| |
| /* Compute the alignment of this data. */ |
| |
| align = DECL_ALIGN (decl); |
| |
| /* In the case for initialing an array whose length isn't specified, |
| where we have not yet been able to do the layout, |
| figure out the proper alignment now. */ |
| if (dont_output_data && DECL_SIZE (decl) == 0 |
| && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) |
| align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl)))); |
| |
| /* Some object file formats have a maximum alignment which they support. |
| In particular, a.out format supports a maximum alignment of 4. */ |
| if (align > MAX_OFILE_ALIGNMENT) |
| { |
| warning ("%Jalignment of %qD is greater than maximum object " |
| "file alignment. Using %d", decl, decl, |
| MAX_OFILE_ALIGNMENT/BITS_PER_UNIT); |
| align = MAX_OFILE_ALIGNMENT; |
| } |
| |
| /* On some machines, it is good to increase alignment sometimes. */ |
| if (! DECL_USER_ALIGN (decl)) |
| { |
| #ifdef DATA_ALIGNMENT |
| align = DATA_ALIGNMENT (TREE_TYPE (decl), align); |
| #endif |
| #ifdef CONSTANT_ALIGNMENT |
| if (DECL_INITIAL (decl) != 0 && DECL_INITIAL (decl) != error_mark_node) |
| align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align); |
| #endif |
| } |
| |
| /* Reset the alignment in case we have made it tighter, so we can benefit |
| from it in get_pointer_alignment. */ |
| DECL_ALIGN (decl) = align; |
| /* APPLE LOCAL begin LLVM */ |
| #ifdef ENABLE_LLVM |
| if (dont_output_data) { |
| fprintf(stderr, "LLVM must emit the data!"); |
| abort(); |
| } |
| emit_global_to_llvm(decl); |
| return; |
| #endif |
| /* APPLE LOCAL end LLVM */ |
| |
| set_mem_align (decl_rtl, align); |
| |
| if (TREE_PUBLIC (decl)) |
| maybe_assemble_visibility (decl); |
| |
| if (DECL_PRESERVE_P (decl)) |
| targetm.asm_out.mark_decl_preserved (name); |
| |
| /* Handle uninitialized definitions. */ |
| |
| /* If the decl has been given an explicit section name, then it |
| isn't common, and shouldn't be handled as such. */ |
| if (DECL_SECTION_NAME (decl) || dont_output_data) |
| ; |
| /* We don't implement common thread-local data at present. */ |
| else if (DECL_THREAD_LOCAL (decl)) |
| { |
| if (DECL_COMMON (decl)) |
| sorry ("thread-local COMMON data not implemented"); |
| } |
| else if (DECL_INITIAL (decl) == 0 |
| || DECL_INITIAL (decl) == error_mark_node |
| || (flag_zero_initialized_in_bss |
| /* Leave constant zeroes in .rodata so they can be shared. */ |
| && !TREE_READONLY (decl) |
| && initializer_zerop (DECL_INITIAL (decl)))) |
| { |
| unsigned HOST_WIDE_INT size = tree_low_cst (DECL_SIZE_UNIT (decl), 1); |
| unsigned HOST_WIDE_INT rounded = size; |
| |
| /* Don't allocate zero bytes of common, |
| since that means "undefined external" in the linker. */ |
| if (size == 0) |
| rounded = 1; |
| |
| /* Round size up to multiple of BIGGEST_ALIGNMENT bits |
| so that each uninitialized object starts on such a boundary. */ |
| rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1; |
| rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) |
| * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); |
| |
| #if !defined(ASM_OUTPUT_ALIGNED_COMMON) && !defined(ASM_OUTPUT_ALIGNED_DECL_COMMON) && !defined(ASM_OUTPUT_ALIGNED_BSS) |
| if ((unsigned HOST_WIDE_INT) DECL_ALIGN_UNIT (decl) > rounded) |
| warning ("%Jrequested alignment for %qD is greater than " |
| "implemented alignment of %d", decl, decl, rounded); |
| #endif |
| |
| /* If the target cannot output uninitialized but not common global data |
| in .bss, then we have to use .data, so fall through. */ |
| if (asm_emit_uninitialised (decl, name, size, rounded)) |
| return; |
| } |
| |
| /* Handle initialized definitions. |
| Also handle uninitialized global definitions if -fno-common and the |
| target doesn't support ASM_OUTPUT_BSS. */ |
| |
| /* First make the assembler name(s) global if appropriate. */ |
| if (TREE_PUBLIC (decl) && DECL_NAME (decl)) |
| globalize_decl (decl); |
| |
| /* Output any data that we will need to use the address of. */ |
| if (DECL_INITIAL (decl) == error_mark_node) |
| reloc = contains_pointers_p (TREE_TYPE (decl)) ? 3 : 0; |
| else if (DECL_INITIAL (decl)) |
| { |
| reloc = compute_reloc_for_constant (DECL_INITIAL (decl)); |
| output_addressed_constants (DECL_INITIAL (decl)); |
| } |
| |
| /* Switch to the appropriate section. */ |
| resolve_unique_section (decl, reloc, flag_data_sections); |
| variable_section (decl, reloc); |
| |
| /* APPLE LOCAL begin zerofill 20020218 --turly */ |
| #ifdef ASM_OUTPUT_ZEROFILL |
| /* We need a ZEROFILL COALESCED option! */ |
| if (!DECL_COMMON (decl) |
| && ! dont_output_data |
| && ! DECL_ONE_ONLY (decl) |
| && ! DECL_WEAK (decl) |
| && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)) |
| { |
| ASM_OUTPUT_ZEROFILL (asm_out_file, name, |
| tree_low_cst (DECL_SIZE_UNIT (decl), 1), |
| floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT)); |
| |
| /********************************/ |
| /* NOTE THE EARLY RETURN HERE!! */ |
| /********************************/ |
| return; |
| } |
| #endif |
| /* APPLE LOCAL end zerofill 20020218 --turly */ |
| |
| /* dbxout.c needs to know this. */ |
| if (in_text_section () || in_unlikely_text_section ()) |
| DECL_IN_TEXT_SECTION (decl) = 1; |
| |
| /* Output the alignment of this data. */ |
| if (align > BITS_PER_UNIT) |
| ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (DECL_ALIGN_UNIT (decl))); |
| |
| /* Do any machine/system dependent processing of the object. */ |
| #ifdef ASM_DECLARE_OBJECT_NAME |
| last_assemble_variable_decl = decl; |
| ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl); |
| #else |
| /* Standard thing is just output label for the object. */ |
| ASM_OUTPUT_LABEL (asm_out_file, name); |
| #endif /* ASM_DECLARE_OBJECT_NAME */ |
| |
| if (!dont_output_data) |
| { |
| if (DECL_INITIAL (decl) |
| && DECL_INITIAL (decl) != error_mark_node |
| && !initializer_zerop (DECL_INITIAL (decl))) |
| /* Output the actual data. */ |
| output_constant (DECL_INITIAL (decl), |
| tree_low_cst (DECL_SIZE_UNIT (decl), 1), |
| align); |
| else |
| /* Leave space for it. */ |
| assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1)); |
| } |
| } |
| |
| /* Return 1 if type TYPE contains any pointers. */ |
| |
| static int |
| contains_pointers_p (tree type) |
| { |
| switch (TREE_CODE (type)) |
| { |
| case POINTER_TYPE: |
| case REFERENCE_TYPE: |
| /* I'm not sure whether OFFSET_TYPE needs this treatment, |
| so I'll play safe and return 1. */ |
| case OFFSET_TYPE: |
| return 1; |
| |
| case RECORD_TYPE: |
| case UNION_TYPE: |
| case QUAL_UNION_TYPE: |
| { |
| tree fields; |
| /* For a type that has fields, see if the fields have pointers. */ |
| for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields)) |
| if (TREE_CODE (fields) == FIELD_DECL |
| && contains_pointers_p (TREE_TYPE (fields))) |
| return 1; |
| return 0; |
| } |
| |
| case ARRAY_TYPE: |
| /* An array type contains pointers if its element type does. */ |
| return contains_pointers_p (TREE_TYPE (type)); |
| |
| default: |
| return 0; |
| } |
| } |
| |
| /* In unit-at-a-time mode, we delay assemble_external processing until |
| the compilation unit is finalized. This is the best we can do for |
| right now (i.e. stage 3 of GCC 4.0) - the right thing is to delay |
| it all the way to final. See PR 17982 for further discussion. */ |
| static GTY(()) tree pending_assemble_externals; |
| |
| #ifdef ASM_OUTPUT_EXTERNAL |
| /* True if DECL is a function decl for which no out-of-line copy exists. |
| It is assumed that DECL's assembler name has been set. */ |
| |
| static bool |
| incorporeal_function_p (tree decl) |
| { |
| if (TREE_CODE (decl) == FUNCTION_DECL && DECL_BUILT_IN (decl)) |
| { |
| const char *name; |
| |
| if (DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL |
| && DECL_FUNCTION_CODE (decl) == BUILT_IN_ALLOCA) |
| return true; |
| |
| name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); |
| if (strncmp (name, "__builtin_", strlen ("__builtin_")) == 0) |
| return true; |
| } |
| return false; |
| } |
| |
| /* Actually do the tests to determine if this is necessary, and invoke |
| ASM_OUTPUT_EXTERNAL. */ |
| static void |
| assemble_external_real (tree decl) |
| { |
| rtx rtl = DECL_RTL (decl); |
| |
| if (MEM_P (rtl) && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF |
| && !SYMBOL_REF_USED (XEXP (rtl, 0)) |
| && !incorporeal_function_p (decl)) |
| { |
| /* Some systems do require some output. */ |
| SYMBOL_REF_USED (XEXP (rtl, 0)) = 1; |
| ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0)); |
| } |
| } |
| #endif |
| |
| void |
| process_pending_assemble_externals (void) |
| { |
| #ifdef ASM_OUTPUT_EXTERNAL |
| tree list; |
| for (list = pending_assemble_externals; list; list = TREE_CHAIN (list)) |
| assemble_external_real (TREE_VALUE (list)); |
| |
| pending_assemble_externals = 0; |
| #endif |
| } |
| |
| /* Output something to declare an external symbol to the assembler. |
| (Most assemblers don't need this, so we normally output nothing.) |
| Do nothing if DECL is not external. */ |
| |
| void |
| assemble_external (tree decl ATTRIBUTE_UNUSED) |
| { |
| /* Because most platforms do not define ASM_OUTPUT_EXTERNAL, the |
| main body of this code is only rarely exercised. To provide some |
| testing, on all platforms, we make sure that the ASM_OUT_FILE is |
| open. If it's not, we should not be calling this function. */ |
| gcc_assert (asm_out_file); |
| |
| /* APPLE LOCAL llvm */ |
| #if defined(ASM_OUTPUT_EXTERNAL) && !defined(ENABLE_LLVM) |
| if (!DECL_P (decl) || !DECL_EXTERNAL (decl) || !TREE_PUBLIC (decl)) |
| return; |
| |
| if (flag_unit_at_a_time) |
| pending_assemble_externals = tree_cons (0, decl, |
| pending_assemble_externals); |
| else |
| assemble_external_real (decl); |
| #endif |
| } |
| |
| /* Similar, for calling a library function FUN. */ |
| |
| void |
| assemble_external_libcall (rtx fun) |
| { |
| /* Declare library function name external when first used, if nec. */ |
| if (! SYMBOL_REF_USED (fun)) |
| { |
| SYMBOL_REF_USED (fun) = 1; |
| targetm.asm_out.external_libcall (fun); |
| } |
| } |
| |
| /* Assemble a label named NAME. */ |
| |
| void |
| assemble_label (const char *name) |
| { |
| ASM_OUTPUT_LABEL (asm_out_file, name); |
| } |
| |
| /* Set the symbol_referenced flag for ID. */ |
| void |
| mark_referenced (tree id) |
| { |
| TREE_SYMBOL_REFERENCED (id) = 1; |
| } |
| |
| /* Set the symbol_referenced flag for DECL and notify callgraph. */ |
| void |
| mark_decl_referenced (tree decl) |
| { |
| if (TREE_CODE (decl) == FUNCTION_DECL) |
| { |
| /* Extern inline functions don't become needed when referenced. |
| If we know a method will be emitted in other TU and no new |
| functions can be marked reachable, just use the external |
| definition. */ |
| struct cgraph_node *node = cgraph_node (decl); |
| if (!DECL_EXTERNAL (decl) |
| && (!node->local.vtable_method || !cgraph_global_info_ready |
| || !node->local.finalized)) |
| cgraph_mark_needed_node (node); |
| } |
| else if (TREE_CODE (decl) == VAR_DECL) |
| cgraph_varpool_mark_needed_node (cgraph_varpool_node (decl)); |
| /* else do nothing - we can get various sorts of CST nodes here, |
| which do not need to be marked. */ |
| } |
| |
| /* Output to FILE (an assembly file) a reference to NAME. If NAME |
| starts with a *, the rest of NAME is output verbatim. Otherwise |
| NAME is transformed in a target-specific way (usually by the |
| addition of an underscore). */ |
| |
| void |
| assemble_name_raw (FILE *file, const char *name) |
| { |
| if (name[0] == '*') |
| fputs (&name[1], file); |
| else |
| ASM_OUTPUT_LABELREF (file, name); |
| } |
| |
| /* Like assemble_name_raw, but should be used when NAME might refer to |
| an entity that is also represented as a tree (like a function or |
| variable). If NAME does refer to such an entity, that entity will |
| be marked as referenced. */ |
| |
| void |
| assemble_name (FILE *file, const char *name) |
| { |
| const char *real_name; |
| tree id; |
| |
| real_name = targetm.strip_name_encoding (name); |
| |
| id = maybe_get_identifier (real_name); |
| if (id) |
| mark_referenced (id); |
| |
| assemble_name_raw (file, name); |
| } |
| |
| /* Allocate SIZE bytes writable static space with a gensym name |
| and return an RTX to refer to its address. */ |
| |
| rtx |
| assemble_static_space (unsigned HOST_WIDE_INT size) |
| { |
| char name[12]; |
| const char *namestring; |
| rtx x; |
| |
| #if 0 |
| if (flag_shared_data) |
| data_section (); |
| #endif |
| |
| ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno); |
| ++const_labelno; |
| namestring = ggc_strdup (name); |
| |
| x = gen_rtx_SYMBOL_REF (Pmode, namestring); |
| SYMBOL_REF_FLAGS (x) = SYMBOL_FLAG_LOCAL; |
| |
| #ifdef ASM_OUTPUT_ALIGNED_DECL_LOCAL |
| ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, NULL_TREE, name, size, |
| BIGGEST_ALIGNMENT); |
| #else |
| #ifdef ASM_OUTPUT_ALIGNED_LOCAL |
| ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT); |
| #else |
| { |
| /* Round size up to multiple of BIGGEST_ALIGNMENT bits |
| so that each uninitialized object starts on such a boundary. */ |
| /* Variable `rounded' might or might not be used in ASM_OUTPUT_LOCAL. */ |
| unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED |
| = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1) |
| / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) |
| * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); |
| ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded); |
| } |
| #endif |
| #endif |
| return x; |
| } |
| |
| /* Assemble the static constant template for function entry trampolines. |
| This is done at most once per compilation. |
| Returns an RTX for the address of the template. */ |
| |
| static GTY(()) rtx initial_trampoline; |
| |
| #ifdef TRAMPOLINE_TEMPLATE |
| rtx |
| assemble_trampoline_template (void) |
| { |
| char label[256]; |
| const char *name; |
| int align; |
| rtx symbol; |
| |
| if (initial_trampoline) |
| return initial_trampoline; |
| |
| /* By default, put trampoline templates in read-only data section. */ |
| |
| #ifdef TRAMPOLINE_SECTION |
| TRAMPOLINE_SECTION (); |
| #else |
| readonly_data_section (); |
| #endif |
| |
| /* Write the assembler code to define one. */ |
| align = floor_log2 (TRAMPOLINE_ALIGNMENT / BITS_PER_UNIT); |
| if (align > 0) |
| { |
| ASM_OUTPUT_ALIGN (asm_out_file, align); |
| } |
| |
| targetm.asm_out.internal_label (asm_out_file, "LTRAMP", 0); |
| TRAMPOLINE_TEMPLATE (asm_out_file); |
| |
| /* Record the rtl to refer to it. */ |
| ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0); |
| name = ggc_strdup (label); |
| symbol = gen_rtx_SYMBOL_REF (Pmode, name); |
| SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL; |
| |
| initial_trampoline = gen_rtx_MEM (BLKmode, symbol); |
| set_mem_align (initial_trampoline, TRAMPOLINE_ALIGNMENT); |
| |
| return initial_trampoline; |
| } |
| #endif |
| |
| /* A and B are either alignments or offsets. Return the minimum alignment |
| that may be assumed after adding the two together. */ |
| |
| static inline unsigned |
| min_align (unsigned int a, unsigned int b) |
| { |
| return (a | b) & -(a | b); |
| } |
| |
| /* Return the assembler directive for creating a given kind of integer |
| object. SIZE is the number of bytes in the object and ALIGNED_P |
| indicates whether it is known to be aligned. Return NULL if the |
| assembly dialect has no such directive. |
| |
| The returned string should be printed at the start of a new line and |
| be followed immediately by the object's initial value. */ |
| |
| const char * |
| integer_asm_op (int size, int aligned_p) |
| { |
| struct asm_int_op *ops; |
| |
| if (aligned_p) |
| ops = &targetm.asm_out.aligned_op; |
| else |
| ops = &targetm.asm_out.unaligned_op; |
| |
| switch (size) |
| { |
| case 1: |
| return targetm.asm_out.byte_op; |
| case 2: |
| return ops->hi; |
| case 4: |
| return ops->si; |
| case 8: |
| return ops->di; |
| case 16: |
| return ops->ti; |
| default: |
| return NULL; |
| } |
| } |
| |
| /* Use directive OP to assemble an integer object X. Print OP at the |
| start of the line, followed immediately by the value of X. */ |
| |
| void |
| assemble_integer_with_op (const char *op, rtx x) |
| { |
| fputs (op, asm_out_file); |
| output_addr_const (asm_out_file, x); |
| fputc ('\n', asm_out_file); |
| } |
| |
| /* The default implementation of the asm_out.integer target hook. */ |
| |
| bool |
| default_assemble_integer (rtx x ATTRIBUTE_UNUSED, |
| unsigned int size ATTRIBUTE_UNUSED, |
| int aligned_p ATTRIBUTE_UNUSED) |
| { |
| const char *op = integer_asm_op (size, aligned_p); |
| /* Avoid GAS bugs for large values. Specifically negative values whose |
| absolute value fits in a bfd_vma, but not in a bfd_signed_vma. */ |
| if (size > UNITS_PER_WORD && size > POINTER_SIZE / BITS_PER_UNIT) |
| return false; |
| return op && (assemble_integer_with_op (op, x), true); |
| } |
| |
| /* Assemble the integer constant X into an object of SIZE bytes. ALIGN is |
| the alignment of the integer in bits. Return 1 if we were able to output |
| the constant, otherwise 0. If FORCE is nonzero, abort if we can't output |
| the constant. */ |
| |
| bool |
| assemble_integer (rtx x, unsigned int size, unsigned int align, int force) |
| { |
| int aligned_p; |
| |
| aligned_p = (align >= MIN (size * BITS_PER_UNIT, BIGGEST_ALIGNMENT)); |
| |
| /* See if the target hook can handle this kind of object. */ |
| if (targetm.asm_out.integer (x, size, aligned_p)) |
| return true; |
| |
| /* If the object is a multi-byte one, try splitting it up. Split |
| it into words it if is multi-word, otherwise split it into bytes. */ |
| if (size > 1) |
| { |
| enum machine_mode omode, imode; |
| unsigned int subalign; |
| unsigned int subsize, i; |
| |
| subsize = size > UNITS_PER_WORD? UNITS_PER_WORD : 1; |
| subalign = MIN (align, subsize * BITS_PER_UNIT); |
| omode = mode_for_size (subsize * BITS_PER_UNIT, MODE_INT, 0); |
| imode = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0); |
| |
| for (i = 0; i < size; i += subsize) |
| { |
| rtx partial = simplify_subreg (omode, x, imode, i); |
| if (!partial || !assemble_integer (partial, subsize, subalign, 0)) |
| break; |
| } |
| if (i == size) |
| return true; |
| |
| /* If we've printed some of it, but not all of it, there's no going |
| back now. */ |
| if (i > 0) |
| abort (); |
| } |
| |
| if (force) |
| abort (); |
| |
| return false; |
| } |
| |
| void |
| assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align) |
| { |
| long data[4]; |
| int i; |
| int bitsize, nelts, nunits, units_per; |
| |
| /* This is hairy. We have a quantity of known size. real_to_target |
| will put it into an array of *host* longs, 32 bits per element |
| (even if long is more than 32 bits). We need to determine the |
| number of array elements that are occupied (nelts) and the number |
| of *target* min-addressable units that will be occupied in the |
| object file (nunits). We cannot assume that 32 divides the |
| mode's bitsize (size * BITS_PER_UNIT) evenly. |
| |
| size * BITS_PER_UNIT is used here to make sure that padding bits |
| (which might appear at either end of the value; real_to_target |
| will include the padding bits in its output array) are included. */ |
| |
| nunits = GET_MODE_SIZE (mode); |
| bitsize = nunits * BITS_PER_UNIT; |
| nelts = CEIL (bitsize, 32); |
| units_per = 32 / BITS_PER_UNIT; |
| |
| real_to_target (data, &d, mode); |
| |
| /* Put out the first word with the specified alignment. */ |
| assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1); |
| nunits -= units_per; |
| |
| /* Subsequent words need only 32-bit alignment. */ |
| align = min_align (align, 32); |
| |
| for (i = 1; i < nelts; i++) |
| { |
| assemble_integer (GEN_INT (data[i]), MIN (nunits, units_per), align, 1); |
| nunits -= units_per; |
| } |
| } |
| |
| /* Given an expression EXP with a constant value, |
| reduce it to the sum of an assembler symbol and an integer. |
| Store them both in the structure *VALUE. |
| Abort if EXP does not reduce. */ |
| |
| struct addr_const GTY(()) |
| { |
| rtx base; |
| HOST_WIDE_INT offset; |
| }; |
| |
| static void |
| decode_addr_const (tree exp, struct addr_const *value) |
| { |
| tree target = TREE_OPERAND (exp, 0); |
| int offset = 0; |
| rtx x; |
| |
| while (1) |
| { |
| if (TREE_CODE (target) == COMPONENT_REF |
| && host_integerp (byte_position (TREE_OPERAND (target, 1)), 0)) |
| |
| { |
| offset += int_byte_position (TREE_OPERAND (target, 1)); |
| target = TREE_OPERAND (target, 0); |
| } |
| else if (TREE_CODE (target) == ARRAY_REF |
| || TREE_CODE (target) == ARRAY_RANGE_REF) |
| { |
| offset += (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (target)), 1) |
| * tree_low_cst (TREE_OPERAND (target, 1), 0)); |
| target = TREE_OPERAND (target, 0); |
| } |
| else |
| break; |
| } |
| |
| switch (TREE_CODE (target)) |
| { |
| case VAR_DECL: |
| case FUNCTION_DECL: |
| x = DECL_RTL (target); |
| break; |
| |
| case LABEL_DECL: |
| x = gen_rtx_MEM (FUNCTION_MODE, |
| gen_rtx_LABEL_REF (VOIDmode, force_label_rtx (target))); |
| break; |
| |
| case REAL_CST: |
| case STRING_CST: |
| case COMPLEX_CST: |
| case CONSTRUCTOR: |
| case INTEGER_CST: |
| x = output_constant_def (target, 1); |
| break; |
| |
| default: |
| abort (); |
| } |
| |
| if (!MEM_P (x)) |
| abort (); |
| x = XEXP (x, 0); |
| |
| value->base = x; |
| value->offset = offset; |
| } |
| |
| /* Uniquize all constants that appear in memory. |
| Each constant in memory thus far output is recorded |
| in `const_desc_table'. */ |
| |
| struct constant_descriptor_tree GTY(()) |
| { |
| /* A MEM for the constant. */ |
| rtx rtl; |
| |
| /* The value of the constant. */ |
| tree value; |
| |
| /* Hash of value. Computing the hash from value each time |
| hashfn is called can't work properly, as that means recursive |
| use of the hash table during hash table expansion. */ |
| hashval_t hash; |
| }; |
| |
| static GTY((param_is (struct constant_descriptor_tree))) |
| htab_t const_desc_htab; |
| |
| static struct constant_descriptor_tree * build_constant_desc (tree); |
| static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int); |
| |
| /* Compute a hash code for a constant expression. */ |
| |
| static hashval_t |
| const_desc_hash (const void *ptr) |
| { |
| return ((struct constant_descriptor_tree *)ptr)->hash; |
| } |
| |
| /* APPLE LOCAL begin fwritable strings */ |
| #if defined(TARGET_MACHO) |
| #if (TARGET_MACHO == 0) |
| #define darwin_constant_cfstring_p(X) (0) |
| #endif |
| #else |
| #define darwin_constant_cfstring_p(X) (0) |
| #endif |
| /* APPLE LOCAL end fwritable strings */ |
| |
| |
| static hashval_t |
| const_hash_1 (const tree exp) |
| { |
| const char *p; |
| hashval_t hi; |
| int len, i; |
| enum tree_code code = TREE_CODE (exp); |
| |
| /* Either set P and LEN to the address and len of something to hash and |
| exit the switch or return a value. */ |
| |
| switch (code) |
| { |
| case INTEGER_CST: |
| p = (char *) &TREE_INT_CST (exp); |
| len = sizeof TREE_INT_CST (exp); |
| break; |
| |
| case REAL_CST: |
| return real_hash (TREE_REAL_CST_PTR (exp)); |
| |
| case STRING_CST: |
| /* APPLE LOCAL begin fwritable strings */ |
| if (flag_writable_strings |
| && !darwin_constant_cfstring_p (exp)) |
| { |
| p = (char *) &exp; |
| len = sizeof exp; |
| } |
| else |
| { |
| p = TREE_STRING_POINTER (exp); |
| len = TREE_STRING_LENGTH (exp); |
| } |
| /* APPLE LOCAL end fwritable strings */ |
| break; |
| |
| case COMPLEX_CST: |
| return (const_hash_1 (TREE_REALPART (exp)) * 5 |
| + const_hash_1 (TREE_IMAGPART (exp))); |
| |
| case CONSTRUCTOR: |
| { |
| tree link; |
| |
| hi = 5 + int_size_in_bytes (TREE_TYPE (exp)); |
| |
| for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) |
| if (TREE_VALUE (link)) |
| hi = hi * 603 + const_hash_1 (TREE_VALUE (link)); |
| |
| return hi; |
| } |
| |
| case ADDR_EXPR: |
| case FDESC_EXPR: |
| { |
| struct addr_const value; |
| |
| decode_addr_const (exp, &value); |
| if (GET_CODE (value.base) == SYMBOL_REF) |
| { |
| /* Don't hash the address of the SYMBOL_REF; |
| only use the offset and the symbol name. */ |
| hi = value.offset; |
| p = XSTR (value.base, 0); |
| for (i = 0; p[i] != 0; i++) |
| hi = ((hi * 613) + (unsigned) (p[i])); |
| } |
| else if (GET_CODE (value.base) == LABEL_REF) |
| hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13; |
| else |
| abort (); |
| } |
| return hi; |
| |
| case PLUS_EXPR: |
| case MINUS_EXPR: |
| return (const_hash_1 (TREE_OPERAND (exp, 0)) * 9 |
| + const_hash_1 (TREE_OPERAND (exp, 1))); |
| |
| case NOP_EXPR: |
| case CONVERT_EXPR: |
| case NON_LVALUE_EXPR: |
| return const_hash_1 (TREE_OPERAND (exp, 0)) * 7 + 2; |
| |
| default: |
| /* A language specific constant. Just hash the code. */ |
| return code; |
| } |
| |
| /* Compute hashing function. */ |
| hi = len; |
| for (i = 0; i < len; i++) |
| hi = ((hi * 613) + (unsigned) (p[i])); |
| |
| return hi; |
| } |
| |
| /* Wrapper of compare_constant, for the htab interface. */ |
| static int |
| const_desc_eq (const void *p1, const void *p2) |
| { |
| const struct constant_descriptor_tree *c1 = p1; |
| const struct constant_descriptor_tree *c2 = p2; |
| if (c1->hash != c2->hash) |
| return 0; |
| return compare_constant (c1->value, c2->value); |
| } |
| |
| /* Compare t1 and t2, and return 1 only if they are known to result in |
| the same bit pattern on output. */ |
| |
| static int |
| compare_constant (const tree t1, const tree t2) |
| { |
| enum tree_code typecode; |
| |
| if (t1 == NULL_TREE) |
| return t2 == NULL_TREE; |
| if (t2 == NULL_TREE) |
| return 0; |
| |
| if (TREE_CODE (t1) != TREE_CODE (t2)) |
| return 0; |
| |
| switch (TREE_CODE (t1)) |
| { |
| case INTEGER_CST: |
| /* Integer constants are the same only if the same width of type. */ |
| if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2))) |
| return 0; |
| return tree_int_cst_equal (t1, t2); |
| |
| case REAL_CST: |
| /* Real constants are the same only if the same width of type. */ |
| if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2))) |
| return 0; |
| |
| return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1), TREE_REAL_CST (t2)); |
| |
| case STRING_CST: |
| /* APPLE LOCAL begin fwritable strings */ |
| if (flag_writable_strings |
| && !darwin_constant_cfstring_p (t1) |
| && !darwin_constant_cfstring_p (t2)) |
| return t1 == t2; |
| /* APPLE LOCAL end fwritable strings */ |
| |
| if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2))) |
| return 0; |
| |
| return (TREE_STRING_LENGTH (t1) == TREE_STRING_LENGTH (t2) |
| && ! memcmp (TREE_STRING_POINTER (t1), TREE_STRING_POINTER (t2), |
| TREE_STRING_LENGTH (t1))); |
| |
| case COMPLEX_CST: |
| return (compare_constant (TREE_REALPART (t1), TREE_REALPART (t2)) |
| && compare_constant (TREE_IMAGPART (t1), TREE_IMAGPART (t2))); |
| |
| case CONSTRUCTOR: |
| { |
| tree l1, l2; |
| |
| typecode = TREE_CODE (TREE_TYPE (t1)); |
| if (typecode != TREE_CODE (TREE_TYPE (t2))) |
| return 0; |
| |
| if (typecode == ARRAY_TYPE) |
| { |
| HOST_WIDE_INT size_1 = int_size_in_bytes (TREE_TYPE (t1)); |
| /* For arrays, check that the sizes all match. */ |
| if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)) |
| || size_1 == -1 |
| || size_1 != int_size_in_bytes (TREE_TYPE (t2))) |
| return 0; |
| } |
| else |
| { |
| /* For record and union constructors, require exact type |
| equality. */ |
| if (TREE_TYPE (t1) != TREE_TYPE (t2)) |
| return 0; |
| } |
| |
| for (l1 = CONSTRUCTOR_ELTS (t1), l2 = CONSTRUCTOR_ELTS (t2); |
| l1 && l2; |
| l1 = TREE_CHAIN (l1), l2 = TREE_CHAIN (l2)) |
| { |
| /* Check that each value is the same... */ |
| if (! compare_constant (TREE_VALUE (l1), TREE_VALUE (l2))) |
| return 0; |
| /* ... and that they apply to the same fields! */ |
| if (typecode == ARRAY_TYPE) |
| { |
| if (! compare_constant (TREE_PURPOSE (l1), |
| TREE_PURPOSE (l2))) |
| return 0; |
| } |
| else |
| { |
| if (TREE_PURPOSE (l1) != TREE_PURPOSE (l2)) |
| return 0; |
| } |
| } |
| |
| return l1 == NULL_TREE && l2 == NULL_TREE; |
| } |
| |
| case ADDR_EXPR: |
| case FDESC_EXPR: |
| { |
| struct addr_const value1, value2; |
| |
| decode_addr_const (t1, &value1); |
| decode_addr_const (t2, &value2); |
| return (value1.offset == value2.offset |
| && strcmp (XSTR (value1.base, 0), XSTR (value2.base, 0)) == 0); |
| } |
| |
| case PLUS_EXPR: |
| case MINUS_EXPR: |
| case RANGE_EXPR: |
| return (compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)) |
| && compare_constant(TREE_OPERAND (t1, 1), TREE_OPERAND (t2, 1))); |
| |
| case NOP_EXPR: |
| case CONVERT_EXPR: |
| case NON_LVALUE_EXPR: |
| case VIEW_CONVERT_EXPR: |
| return compare_constant (TREE_OPERAND (t1, 0), TREE_OPERAND (t2, 0)); |
| |
| default: |
| { |
| tree nt1, nt2; |
| nt1 = lang_hooks.expand_constant (t1); |
| nt2 = lang_hooks.expand_constant (t2); |
| if (nt1 != t1 || nt2 != t2) |
| return compare_constant (nt1, nt2); |
| else |
| return 0; |
| } |
| } |
| |
| /* Should not get here. */ |
| abort (); |
| } |
| |
| /* Make a copy of the whole tree structure for a constant. This |
| handles the same types of nodes that compare_constant handles. */ |
| |
| static tree |
| copy_constant (tree exp) |
| { |
| switch (TREE_CODE (exp)) |
| { |
| case ADDR_EXPR: |
| /* For ADDR_EXPR, we do not want to copy the decl whose address |
| is requested. We do want to copy constants though. */ |
| if (CONSTANT_CLASS_P (TREE_OPERAND (exp, 0))) |
| return build1 (TREE_CODE (exp), TREE_TYPE (exp), |
| copy_constant (TREE_OPERAND (exp, 0))); |
| else |
| return copy_node (exp); |
| |
| case INTEGER_CST: |
| case REAL_CST: |
| case STRING_CST: |
| return copy_node (exp); |
| |
| case COMPLEX_CST: |
| return build_complex (TREE_TYPE (exp), |
| copy_constant (TREE_REALPART (exp)), |
| copy_constant (TREE_IMAGPART (exp))); |
| |
| case PLUS_EXPR: |
| case MINUS_EXPR: |
| return build2 (TREE_CODE (exp), TREE_TYPE (exp), |
| copy_constant (TREE_OPERAND (exp, 0)), |
| copy_constant (TREE_OPERAND (exp, 1))); |
| |
| case NOP_EXPR: |
| case CONVERT_EXPR: |
| case NON_LVALUE_EXPR: |
| case VIEW_CONVERT_EXPR: |
| return build1 (TREE_CODE (exp), TREE_TYPE (exp), |
| copy_constant (TREE_OPERAND (exp, 0))); |
| |
| case CONSTRUCTOR: |
| { |
| tree copy = copy_node (exp); |
| tree list = copy_list (CONSTRUCTOR_ELTS (exp)); |
| tree tail; |
| |
| CONSTRUCTOR_ELTS (copy) = list; |
| for (tail = list; tail; tail = TREE_CHAIN (tail)) |
| TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail)); |
| |
| return copy; |
| } |
| |
| default: |
| { |
| tree t; |
| t = lang_hooks.expand_constant (exp); |
| if (t != exp) |
| return copy_constant (t); |
| else |
| abort (); |
| } |
| } |
| } |
| |
| /* Subroutine of output_constant_def: |
| No constant equal to EXP is known to have been output. |
| Make a constant descriptor to enter EXP in the hash table. |
| Assign the label number and construct RTL to refer to the |
| constant's location in memory. |
| Caller is responsible for updating the hash table. */ |
| |
| static struct constant_descriptor_tree * |
| build_constant_desc (tree exp) |
| { |
| rtx symbol; |
| rtx rtl; |
| char label[256]; |
| int labelno; |
| struct constant_descriptor_tree *desc; |
| |
| desc = ggc_alloc (sizeof (*desc)); |
| /* APPLE LOCAL begin fwritable strings */ |
| if (flag_writable_strings && TREE_CODE (exp) == STRING_CST) |
| desc->value = exp; |
| else |
| desc->value = copy_constant (exp); |
| /* APPLE LOCAL end fwritable strings */ |
| |
| /* Propagate marked-ness to copied constant. */ |
| if (flag_mudflap && mf_marked_p (exp)) |
| mf_mark (desc->value); |
| |
| /* Create a string containing the label name, in LABEL. */ |
| labelno = const_labelno++; |
| ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno); |
| |
| /* We have a symbol name; construct the SYMBOL_REF and the MEM. */ |
| symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)); |
| SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL; |
| SYMBOL_REF_DECL (symbol) = desc->value; |
| TREE_CONSTANT_POOL_ADDRESS_P (symbol) = 1; |
| |
| rtl = gen_rtx_MEM (TYPE_MODE (TREE_TYPE (exp)), symbol); |
| set_mem_attributes (rtl, exp, 1); |
| set_mem_alias_set (rtl, 0); |
| set_mem_alias_set (rtl, const_alias_set); |
| |
| /* Set flags or add text to the name to record information, such as |
| that it is a local symbol. If the name is changed, the macro |
| ASM_OUTPUT_LABELREF will have to know how to strip this |
| information. This call might invalidate our local variable |
| SYMBOL; we can't use it afterward. */ |
| |
| targetm.encode_section_info (exp, rtl, true); |
| |
| desc->rtl = rtl; |
| |
| return desc; |
| } |
| |
| /* Return an rtx representing a reference to constant data in memory |
| for the constant expression EXP. |
| |
| If assembler code for such a constant has already been output, |
| return an rtx to refer to it. |
| Otherwise, output such a constant in memory |
| and generate an rtx for it. |
| |
| If DEFER is nonzero, this constant can be deferred and output only |
| if referenced in the function after all optimizations. |
| |
| `const_desc_table' records which constants already have label strings. */ |
| |
| rtx |
| output_constant_def (tree exp, int defer) |
| { |
| struct constant_descriptor_tree *desc; |
| struct constant_descriptor_tree key; |
| void **loc; |
| |
| /* Look up EXP in the table of constant descriptors. If we didn't find |
| it, create a new one. */ |
| key.value = exp; |
| key.hash = const_hash_1 (exp); |
| loc = htab_find_slot_with_hash (const_desc_htab, &key, key.hash, INSERT); |
| |
| desc = *loc; |
| if (desc == 0) |
| { |
| desc = build_constant_desc (exp); |
| desc->hash = key.hash; |
| *loc = desc; |
| } |
| |
| maybe_output_constant_def_contents (desc, defer); |
| return desc->rtl; |
| } |
| |
| /* Subroutine of output_constant_def: Decide whether or not we need to |
| output the constant DESC now, and if so, do it. */ |
| static void |
| maybe_output_constant_def_contents (struct constant_descriptor_tree *desc, |
| int defer) |
| { |
| rtx symbol = XEXP (desc->rtl, 0); |
| tree exp = desc->value; |
| |
| if (flag_syntax_only) |
| return; |
| |
| if (TREE_ASM_WRITTEN (exp)) |
| /* Already output; don't do it again. */ |
| return; |
| |
| /* APPLE LOCAL begin fwritable strings */ |
| /* The only constants that cannot safely be deferred, assuming the |
| context allows it, are strings under flag_writable_strings. */ |
| if (defer && (TREE_CODE (exp) != STRING_CST || !flag_writable_strings)) |
| /* APPLE LOCAL end fwritable strings */ |
| { |
| /* Increment n_deferred_constants if it exists. It needs to be at |
| least as large as the number of constants actually referred to |
| by the function. If it's too small we'll stop looking too early |
| and fail to emit constants; if it's too large we'll only look |
| through the entire function when we could have stopped earlier. */ |
| if (cfun) |
| n_deferred_constants++; |
| return; |
| } |
| |
| output_constant_def_contents (symbol); |
| } |
| |
| /* We must output the constant data referred to by SYMBOL; do so. */ |
| |
| static void |
| output_constant_def_contents (rtx symbol) |
| { |
| tree exp = SYMBOL_REF_DECL (symbol); |
| const char *label = XSTR (symbol, 0); |
| HOST_WIDE_INT size; |
| |
| /* Make sure any other constants whose addresses appear in EXP |
| are assigned label numbers. */ |
| int reloc = compute_reloc_for_constant (exp); |
| |
| /* Align the location counter as required by EXP's data type. */ |
| unsigned int align = TYPE_ALIGN (TREE_TYPE (exp)); |
| #ifdef CONSTANT_ALIGNMENT |
| align = CONSTANT_ALIGNMENT (exp, align); |
| #endif |
| |
| output_addressed_constants (exp); |
| |
| /* We are no longer deferring this constant. */ |
| TREE_ASM_WRITTEN (exp) = 1; |
| |
| if (IN_NAMED_SECTION (exp)) |
| named_section (exp, NULL, reloc); |
| else |
| targetm.asm_out.select_section (exp, reloc, align); |
| |
| if (align > BITS_PER_UNIT) |
| { |
| ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); |
| } |
| |
| size = int_size_in_bytes (TREE_TYPE (exp)); |
| if (TREE_CODE (exp) == STRING_CST) |
| size = MAX (TREE_STRING_LENGTH (exp), size); |
| |
| /* Do any machine/system dependent processing of the constant. */ |
| #ifdef ASM_DECLARE_CONSTANT_NAME |
| ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size); |
| #else |
| /* Standard thing is just output label for the constant. */ |
| ASM_OUTPUT_LABEL (asm_out_file, label); |
| #endif /* ASM_DECLARE_CONSTANT_NAME */ |
| |
| /* Output the value of EXP. */ |
| output_constant (exp, size, align); |
| if (flag_mudflap) |
| mudflap_enqueue_constant (exp); |
| } |
| |
| /* Look up EXP in the table of constant descriptors. Return the rtl |
| if it has been emitted, else null. */ |
| |
| rtx |
| lookup_constant_def (tree exp) |
| { |
| struct constant_descriptor_tree *desc; |
| struct constant_descriptor_tree key; |
| |
| key.value = exp; |
| key.hash = const_hash_1 (exp); |
| desc = htab_find_with_hash (const_desc_htab, &key, key.hash); |
| |
| return (desc ? desc->rtl : NULL_RTX); |
| } |
| |
| /* Used in the hash tables to avoid outputting the same constant |
| twice. Unlike 'struct constant_descriptor_tree', RTX constants |
| are output once per function, not once per file. */ |
| /* ??? Only a few targets need per-function constant pools. Most |
| can use one per-file pool. Should add a targetm bit to tell the |
| difference. */ |
| |
| struct rtx_constant_pool GTY(()) |
| { |
| /* Pointers to first and last constant in pool, as ordered by offset. */ |
| struct constant_descriptor_rtx *first; |
| struct constant_descriptor_rtx *last; |
| |
| /* Hash facility for making memory-constants from constant rtl-expressions. |
| It is used on RISC machines where immediate integer arguments and |
| constant addresses are restricted so that such constants must be stored |
| in memory. */ |
| htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab; |
| htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_sym_htab; |
| |
| /* Current offset in constant pool (does not include any |
| machine-specific header). */ |
| HOST_WIDE_INT offset; |
| }; |
| |
| struct constant_descriptor_rtx GTY((chain_next ("%h.next"))) |
| { |
| struct constant_descriptor_rtx *next; |
| rtx mem; |
| rtx sym; |
| rtx constant; |
| HOST_WIDE_INT offset; |
| hashval_t hash; |
| enum machine_mode mode; |
| unsigned int align; |
| int labelno; |
| int mark; |
| }; |
| |
| /* Hash and compare functions for const_rtx_htab. */ |
| |
| static hashval_t |
| const_desc_rtx_hash (const void *ptr) |
| { |
| const struct constant_descriptor_rtx *desc = ptr; |
| return desc->hash; |
| } |
| |
| static int |
| const_desc_rtx_eq (const void *a, const void *b) |
| { |
| const struct constant_descriptor_rtx *x = a; |
| const struct constant_descriptor_rtx *y = b; |
| |
| if (x->mode != y->mode) |
| return 0; |
| return rtx_equal_p (x->constant, y->constant); |
| } |
| |
| /* Hash and compare functions for const_rtx_sym_htab. */ |
| |
| static hashval_t |
| const_desc_rtx_sym_hash (const void *ptr) |
| { |
| const struct constant_descriptor_rtx *desc = ptr; |
| return htab_hash_string (XSTR (desc->sym, 0)); |
| } |
| |
| static int |
| const_desc_rtx_sym_eq (const void *a, const void *b) |
| { |
| const struct constant_descriptor_rtx *x = a; |
| const struct constant_descriptor_rtx *y = b; |
| return XSTR (x->sym, 0) == XSTR (y->sym, 0); |
| } |
| |
| /* This is the worker function for const_rtx_hash, called via for_each_rtx. */ |
| |
| static int |
| const_rtx_hash_1 (rtx *xp, void *data) |
| { |
| unsigned HOST_WIDE_INT hwi; |
| enum machine_mode mode; |
| enum rtx_code code; |
| hashval_t h, *hp; |
| rtx x; |
| |
| x = *xp; |
| code = GET_CODE (x); |
| mode = GET_MODE (x); |
| h = (hashval_t) code * 1048573 + mode; |
| |
| switch (code) |
| { |
| case CONST_INT: |
| hwi = INTVAL (x); |
| fold_hwi: |
| { |
| const int shift = sizeof (hashval_t) * CHAR_BIT; |
| const int n = sizeof (HOST_WIDE_INT) / sizeof (hashval_t); |
| int i; |
| |
| h ^= (hashval_t) hwi; |
| for (i = 1; i < n; ++i) |
| { |
| hwi >>= shift; |
| h ^= (hashval_t) hwi; |
| } |
| } |
| break; |
| |
| case CONST_DOUBLE: |
| if (mode == VOIDmode) |
| { |
| hwi = CONST_DOUBLE_LOW (x) ^ CONST_DOUBLE_HIGH (x); |
| goto fold_hwi; |
| } |
| else |
| h ^= real_hash (CONST_DOUBLE_REAL_VALUE (x)); |
| break; |
| |
| case CONST_VECTOR: |
| { |
| int i; |
| for (i = XVECLEN (x, 0); i-- > 0; ) |
| h = h * 251 + const_rtx_hash_1 (&XVECEXP (x, 0, i), data); |
| } |
| break; |
| |
| case SYMBOL_REF: |
| h ^= htab_hash_string (XSTR (x, 0)); |
| break; |
| |
| case LABEL_REF: |
| h = h * 251 + CODE_LABEL_NUMBER (XEXP (x, 0)); |
| break; |
| |
| case UNSPEC: |
| case UNSPEC_VOLATILE: |
| h = h * 251 + XINT (x, 1); |
| break; |
| |
| default: |
| break; |
| } |
| |
| hp = data; |
| *hp = *hp * 509 + h; |
| return 0; |
| } |
| |
| /* Compute a hash value for X, which should be a constant. */ |
| |
| static hashval_t |
| const_rtx_hash (rtx x) |
| { |
| hashval_t h = 0; |
| for_each_rtx (&x, const_rtx_hash_1, &h); |
| return h; |
| } |
| |
| |
| /* Initialize constant pool hashing for a new function. */ |
| |
| void |
| init_varasm_status (struct function *f) |
| { |
| struct varasm_status *p; |
| struct rtx_constant_pool *pool; |
| |
| p = ggc_alloc (sizeof (struct varasm_status)); |
| f->varasm = p; |
| |
| pool = ggc_alloc (sizeof (struct rtx_constant_pool)); |
| p->pool = pool; |
| p->deferred_constants = 0; |
| |
| pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash, |
| const_desc_rtx_eq, NULL); |
| pool->const_rtx_sym_htab = htab_create_ggc (31, const_desc_rtx_sym_hash, |
| const_desc_rtx_sym_eq, NULL); |
| pool->first = pool->last = NULL; |
| pool->offset = 0; |
| } |
| |
| /* Given a MINUS expression, simplify it if both sides |
| include the same symbol. */ |
| |
| rtx |
| simplify_subtraction (rtx x) |
| { |
| rtx r = simplify_rtx (x); |
| return r ? r : x; |
| } |
| |
| /* Given a constant rtx X, make (or find) a memory constant for its value |
| and return a MEM rtx to refer to it in memory. */ |
| |
| rtx |
| force_const_mem (enum machine_mode mode, rtx x) |
| { |
| struct constant_descriptor_rtx *desc, tmp; |
| struct rtx_constant_pool *pool = cfun->varasm->pool; |
| char label[256]; |
| rtx def, symbol; |
| hashval_t hash; |
| unsigned int align; |
| void **slot; |
| |
| /* If we're not allowed to drop X into the constant pool, don't. */ |
| if (targetm.cannot_force_const_mem (x)) |
| return NULL_RTX; |
| |
| /* Lookup the value in the hashtable. */ |
| tmp.constant = x; |
| tmp.mode = mode; |
| hash = const_rtx_hash (x); |
| slot = htab_find_slot_with_hash (pool->const_rtx_htab, &tmp, hash, INSERT); |
| desc = *slot; |
| |
| /* If the constant was already present, return its memory. */ |
| if (desc) |
| return copy_rtx (desc->mem); |
| |
| /* Otherwise, create a new descriptor. */ |
| desc = ggc_alloc (sizeof (*desc)); |
| *slot = desc; |
| |
| /* Align the location counter as required by EXP's data type. */ |
| align = GET_MODE_ALIGNMENT (mode == VOIDmode ? word_mode : mode); |
| #ifdef CONSTANT_ALIGNMENT |
| { |
| tree type = lang_hooks.types.type_for_mode (mode, 0); |
| if (type != NULL_TREE) |
| align = CONSTANT_ALIGNMENT (make_tree (type, x), align); |
| } |
| #endif |
| |
| pool->offset += (align / BITS_PER_UNIT) - 1; |
| pool->offset &= ~ ((align / BITS_PER_UNIT) - 1); |
| |
| desc->next = NULL; |
| desc->constant = tmp.constant; |
| desc->offset = pool->offset; |
| desc->hash = hash; |
| desc->mode = mode; |
| desc->align = align; |
| desc->labelno = const_labelno; |
| desc->mark = 0; |
| |
| pool->offset += GET_MODE_SIZE (mode); |
| if (pool->last) |
| pool->last->next = desc; |
| else |
| pool->first = pool->last = desc; |
| pool->last = desc; |
| |
| /* Create a string containing the label name, in LABEL. */ |
| ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno); |
| ++const_labelno; |
| |
| /* Construct the SYMBOL_REF. Make sure to mark it as belonging to |
| the constants pool. */ |
| desc->sym = symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label)); |
| SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_LOCAL; |
| CONSTANT_POOL_ADDRESS_P (symbol) = 1; |
| current_function_uses_const_pool = 1; |
| |
| /* Insert the descriptor into the symbol cross-reference table too. */ |
| slot = htab_find_slot (pool->const_rtx_sym_htab, desc, INSERT); |
| if (*slot) |
| abort (); |
| *slot = desc; |
| |
| /* Construct the MEM. */ |
| desc->mem = def = gen_const_mem (mode, symbol); |
| set_mem_attributes (def, lang_hooks.types.type_for_mode (mode, 0), 1); |
| set_mem_align (def, align); |
| |
| /* If we're dropping a label to the constant pool, make sure we |
| don't delete it. */ |
| if (GET_CODE (x) == LABEL_REF) |
| LABEL_PRESERVE_P (XEXP (x, 0)) = 1; |
| |
| return copy_rtx (def); |
| } |
| |
| /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to |
| the corresponding constant_descriptor_rtx structure. */ |
| |
| static struct constant_descriptor_rtx * |
| find_pool_constant (struct rtx_constant_pool *pool, rtx sym) |
| { |
| struct constant_descriptor_rtx tmp; |
| tmp.sym = sym; |
| return htab_find (pool->const_rtx_sym_htab, &tmp); |
| } |
| |
| /* Given a constant pool SYMBOL_REF, return the corresponding constant. */ |
| |
| rtx |
| get_pool_constant (rtx addr) |
| { |
| return find_pool_constant (cfun->varasm->pool, addr)->constant; |
| } |
| |
| /* Given a constant pool SYMBOL_REF, return the corresponding constant |
| and whether it has been output or not. */ |
| |
| rtx |
| get_pool_constant_mark (rtx addr, bool *pmarked) |
| { |
| struct constant_descriptor_rtx *desc; |
| |
| desc = find_pool_constant (cfun->varasm->pool, addr); |
| *pmarked = (desc->mark != 0); |
| return desc->constant; |
| } |
| |
| /* Likewise, but for the constant pool of a specific function. */ |
| |
| rtx |
| get_pool_constant_for_function (struct function *f, rtx addr) |
| { |
| return find_pool_constant (f->varasm->pool, addr)->constant; |
| } |
| |
| /* Similar, return the mode. */ |
| |
| enum machine_mode |
| get_pool_mode (rtx addr) |
| { |
| return find_pool_constant (cfun->varasm->pool, addr)->mode; |
| } |
| |
| /* Return the size of the constant pool. */ |
| |
| int |
| get_pool_size (void) |
| { |
| return cfun->varasm->pool->offset; |
| } |
| |
| /* Worker function for output_constant_pool_1. Emit assembly for X |
| in MODE with known alignment ALIGN. */ |
| |
| static void |
| output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align) |
| { |
| switch (GET_MODE_CLASS (mode)) |
| { |
| case MODE_FLOAT: |
| if (GET_CODE (x) != CONST_DOUBLE) |
| abort (); |
| else |
| { |
| REAL_VALUE_TYPE r
|