#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"
#include "basic-block.h"
#ifdef XCOFF_DEBUGGING_INFO
#include "xcoffout.h"
#endif
extern GTY(()) const char *first_global_object_name;
extern GTY(()) const char *weak_global_object_name;
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(())
{
struct rtx_constant_pool *pool;
unsigned int deferred_constants;
};
#define n_deferred_constants (cfun->varasm->deferred_constants)
static GTY(()) int const_labelno;
int size_directive_output;
tree last_assemble_variable_decl;
bool first_function_block_is_cold;
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);
#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
static void mark_weak (tree);
static void output_constant_pool (const char *, tree);
section *text_section;
section *data_section;
section *readonly_data_section;
section *sdata_section;
section *ctors_section;
section *dtors_section;
section *bss_section;
section *sbss_section;
section *tls_comm_section;
section *comm_section;
section *lcomm_section;
section *bss_noswitch_section;
section *exception_section;
section *eh_frame_section;
section *in_section;
bool in_cold_section_p;
static GTY(()) section *unnamed_sections;
#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
static GTY((param_is (section))) htab_t section_htab;
static GTY((param_is (struct object_block))) htab_t object_block_htab;
static GTY(()) int anchor_labelno;
static GTY(()) struct rtx_constant_pool *shared_constant_pool;
static int
section_entry_eq (const void *p1, const void *p2)
{
const section *old = p1;
const char *new = p2;
return strcmp (old->named.name, new) == 0;
}
static hashval_t
section_entry_hash (const void *p)
{
const section *old = p;
return htab_hash_string (old->named.name);
}
static hashval_t
hash_section (section *sect)
{
if (sect->common.flags & SECTION_NAMED)
return htab_hash_string (sect->named.name);
return sect->common.flags;
}
static int
object_block_entry_eq (const void *p1, const void *p2)
{
const struct object_block *old = p1;
const section *new = p2;
return old->sect == new;
}
static hashval_t
object_block_entry_hash (const void *p)
{
const struct object_block *old = p;
return hash_section (old->sect);
}
section *
get_unnamed_section (unsigned int flags, void (*callback) (const void *),
const void *data)
{
section *sect;
sect = ggc_alloc (sizeof (struct unnamed_section));
sect->unnamed.common.flags = flags | SECTION_UNNAMED;
sect->unnamed.callback = callback;
sect->unnamed.data = data;
sect->unnamed.next = unnamed_sections;
unnamed_sections = sect;
return sect;
}
static section *
get_noswitch_section (unsigned int flags, noswitch_section_callback callback)
{
section *sect;
sect = ggc_alloc (sizeof (struct unnamed_section));
sect->noswitch.common.flags = flags | SECTION_NOSWITCH;
sect->noswitch.callback = callback;
return sect;
}
section *
get_section (const char *name, unsigned int flags, tree decl)
{
section *sect, **slot;
slot = (section **)
htab_find_slot_with_hash (section_htab, name,
htab_hash_string (name), INSERT);
flags |= SECTION_NAMED;
if (*slot == NULL)
{
sect = ggc_alloc (sizeof (struct named_section));
sect->named.common.flags = flags;
sect->named.name = ggc_strdup (name);
sect->named.decl = decl;
*slot = sect;
}
else
{
sect = *slot;
if ((sect->common.flags & ~SECTION_DECLARED) != flags
&& ((sect->common.flags | flags) & SECTION_OVERRIDE) == 0)
{
if (decl == 0)
decl = sect->named.decl;
gcc_assert (decl);
error ("%+D causes a section type conflict", decl);
}
}
return sect;
}
static bool
use_object_blocks_p (void)
{
return flag_section_anchors;
}
static struct object_block *
get_block_for_section (section *sect)
{
struct object_block *block;
void **slot;
if (sect == NULL)
return NULL;
slot = htab_find_slot_with_hash (object_block_htab, sect,
hash_section (sect), INSERT);
block = (struct object_block *) *slot;
if (block == NULL)
{
block = (struct object_block *)
ggc_alloc_cleared (sizeof (struct object_block));
block->sect = sect;
*slot = block;
}
return block;
}
static rtx
create_block_symbol (const char *label, struct object_block *block,
HOST_WIDE_INT offset)
{
rtx symbol;
unsigned int size;
size = RTX_HDR_SIZE + sizeof (struct block_symbol);
symbol = ggc_alloc_zone (size, &rtl_zone);
memset (symbol, 0, size);
PUT_CODE (symbol, SYMBOL_REF);
PUT_MODE (symbol, Pmode);
XSTR (symbol, 0) = label;
SYMBOL_REF_FLAGS (symbol) = SYMBOL_FLAG_HAS_BLOCK_INFO;
SYMBOL_REF_BLOCK (symbol) = block;
SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
return symbol;
}
static void
initialize_cold_section_name (void)
{
const char *stripped_name;
char *name, *buffer;
tree dsn;
gcc_assert (cfun && current_function_decl);
if (cfun->unlikely_text_section_name)
return;
dsn = DECL_SECTION_NAME (current_function_decl);
if (flag_function_sections && dsn)
{
name = alloca (TREE_STRING_LENGTH (dsn) + 1);
memcpy (name, TREE_STRING_POINTER (dsn), TREE_STRING_LENGTH (dsn) + 1);
stripped_name = targetm.strip_name_encoding (name);
buffer = ACONCAT ((stripped_name, "_unlikely", NULL));
cfun->unlikely_text_section_name = ggc_strdup (buffer);
}
else
cfun->unlikely_text_section_name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
}
section *
unlikely_text_section (void)
{
if (cfun)
{
if (!cfun->unlikely_text_section_name)
initialize_cold_section_name ();
return get_named_section (NULL, cfun->unlikely_text_section_name, 0);
}
else
return get_named_section (NULL, UNLIKELY_EXECUTED_TEXT_SECTION_NAME, 0);
}
bool
unlikely_text_section_p (section *sect)
{
const char *name;
if (cfun)
name = cfun->unlikely_text_section_name;
else
name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
return (name
&& sect
&& SECTION_STYLE (sect) == SECTION_NAMED
&& strcmp (name, sect->named.name) == 0);
}
section *
get_named_section (tree decl, const char *name, int reloc)
{
unsigned int flags;
gcc_assert (!decl || DECL_P (decl));
if (name == NULL)
name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
flags = targetm.section_type_flags (decl, name, reloc);
return get_section (name, flags, decl);
}
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
#ifdef ASM_OUTPUT_BSS
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);
switch_to_section (bss_section);
#ifdef ASM_DECLARE_OBJECT_NAME
last_assemble_variable_decl = decl;
ASM_DECLARE_OBJECT_NAME (file, name, decl);
#else
ASM_OUTPUT_LABEL (file, name);
#endif
ASM_OUTPUT_SKIP (file, rounded ? rounded : 1);
}
#endif
#ifdef ASM_OUTPUT_ALIGNED_BSS
static void
asm_output_aligned_bss (FILE *file, tree decl ATTRIBUTE_UNUSED,
const char *name, unsigned HOST_WIDE_INT size,
int align)
{
switch_to_section (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
ASM_OUTPUT_LABEL (file, name);
#endif
ASM_OUTPUT_SKIP (file, size ? size : 1);
}
#endif
#endif
#ifndef USE_SELECT_SECTION_FOR_FUNCTIONS
static section *
hot_function_section (tree decl)
{
if (decl != NULL_TREE
&& DECL_SECTION_NAME (decl) != NULL_TREE
&& targetm.have_named_sections)
return get_named_section (decl, NULL, 0);
else
return text_section;
}
#endif
section *
function_section (tree decl)
{
int reloc = 0;
if (first_function_block_is_cold)
reloc = 1;
#ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
if (decl != NULL_TREE
&& DECL_SECTION_NAME (decl) != NULL_TREE)
return reloc ? unlikely_text_section ()
: get_named_section (decl, NULL, 0);
else
return targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
#else
return reloc ? unlikely_text_section () : hot_function_section (decl);
#endif
}
section *
current_function_section (void)
{
#ifdef USE_SELECT_SECTION_FOR_FUNCTIONS
if (current_function_decl != NULL_TREE
&& DECL_SECTION_NAME (current_function_decl) != NULL_TREE)
return in_cold_section_p ? unlikely_text_section ()
: get_named_section (current_function_decl,
NULL, 0);
else
return targetm.asm_out.select_section (current_function_decl,
in_cold_section_p,
DECL_ALIGN (current_function_decl));
#else
return (in_cold_section_p
? unlikely_text_section ()
: hot_function_section (current_function_decl));
#endif
}
section *
default_function_rodata_section (tree decl)
{
if (decl != NULL_TREE && DECL_SECTION_NAME (decl))
{
const char *name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl));
if (DECL_ONE_ONLY (decl) && HAVE_COMDAT_GROUP)
{
size_t len = strlen (name) + 3;
char* rname = alloca (len);
strcpy (rname, ".rodata");
strcat (rname, name + 5);
return get_section (rname, SECTION_LINKONCE, decl);
}
else 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';
return get_section (rname, SECTION_LINKONCE, decl);
}
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);
return get_section (rname, 0, decl);
}
}
return readonly_data_section;
}
section *
default_no_function_rodata_section (tree decl ATTRIBUTE_UNUSED)
{
return readonly_data_section;
}
static section *
mergeable_string_section (tree decl ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED,
unsigned int flags ATTRIBUTE_UNUSED)
{
HOST_WIDE_INT len;
if (HAVE_GAS_SHF_MERGE && flag_merge_constants
&& TREE_CODE (decl) == STRING_CST
&& TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
&& align <= 256
&& (len = int_size_in_bytes (TREE_TYPE (decl))) > 0
&& TREE_STRING_LENGTH (decl) >= len)
{
enum machine_mode mode;
unsigned int modesize;
const char *str;
HOST_WIDE_INT i;
int j, 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);
unit = GET_MODE_SIZE (mode);
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;
return get_section (name, flags, NULL);
}
}
}
return readonly_data_section;
}
section *
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;
return get_section (name, flags, NULL);
}
return readonly_data_section;
}
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;
}
void
set_user_assembler_name (tree decl, const char *name)
{
char *starred = alloca (strlen (name) + 2);
starred[0] = '*';
strcpy (starred + 1, name);
change_decl_assembler_name (decl, get_identifier (starred));
SET_DECL_RTL (decl, NULL_RTX);
}
int
decode_reg_name (const char *asmspec)
{
if (asmspec != 0)
{
int i;
asmspec = strip_reg_name (asmspec);
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 (table[i].name[0]
&& ! strcmp (asmspec, table[i].name))
return table[i].number;
}
#endif
if (!strcmp (asmspec, "memory"))
return -4;
if (!strcmp (asmspec, "cc"))
return -3;
return -2;
}
return -1;
}
static bool
bss_initializer_p (tree decl)
{
return (DECL_INITIAL (decl) == NULL
|| DECL_INITIAL (decl) == error_mark_node
|| (flag_zero_initialized_in_bss
&& !TREE_READONLY (decl)
&& initializer_zerop (DECL_INITIAL (decl))));
}
void
align_variable (tree decl, bool dont_output_data)
{
unsigned int align = DECL_ALIGN (decl);
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))));
if (align > MAX_OFILE_ALIGNMENT)
{
warning (0, "alignment of %q+D is greater than maximum object "
"file alignment. Using %d", decl,
MAX_OFILE_ALIGNMENT/BITS_PER_UNIT);
align = MAX_OFILE_ALIGNMENT;
}
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
}
DECL_ALIGN (decl) = align;
}
static section *
get_variable_section (tree decl, bool prefer_noswitch_p)
{
int reloc;
if (DECL_COMMON (decl) && DECL_SECTION_NAME (decl) == NULL)
{
if (DECL_THREAD_LOCAL_P (decl))
return tls_comm_section;
if (TREE_PUBLIC (decl) && bss_initializer_p (decl))
return comm_section;
}
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));
else
reloc = 0;
resolve_unique_section (decl, reloc, flag_data_sections);
if (IN_NAMED_SECTION (decl))
return get_named_section (decl, NULL, reloc);
if (!DECL_THREAD_LOCAL_P (decl)
&& !(prefer_noswitch_p && targetm.have_switchable_bss_sections)
&& bss_initializer_p (decl))
{
if (!TREE_PUBLIC (decl))
return lcomm_section;
if (bss_noswitch_section)
return bss_noswitch_section;
}
return targetm.asm_out.select_section (decl, reloc, DECL_ALIGN (decl));
}
static struct object_block *
get_block_for_decl (tree decl)
{
section *sect;
if (TREE_CODE (decl) == VAR_DECL)
{
if (DECL_EXTERNAL (decl))
return NULL;
if (DECL_ONE_ONLY (decl))
return NULL;
}
if (DECL_SIZE_UNIT (decl) == NULL)
return NULL;
if (!host_integerp (DECL_SIZE_UNIT (decl), 1))
return NULL;
if (TREE_CODE (decl) == VAR_DECL)
align_variable (decl, 0);
sect = get_variable_section (decl, true);
if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
return NULL;
return get_block_for_section (sect);
}
static void
change_symbol_block (rtx symbol, struct object_block *block)
{
if (block != SYMBOL_REF_BLOCK (symbol))
{
gcc_assert (SYMBOL_REF_BLOCK_OFFSET (symbol) < 0);
SYMBOL_REF_BLOCK (symbol) = block;
}
}
static bool
use_blocks_for_decl_p (tree decl)
{
if (TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != CONST_DECL)
return false;
if (DECL_INITIAL (decl) == decl)
return false;
if (lookup_attribute ("alias", DECL_ATTRIBUTES (decl)))
return false;
return true;
}
void
make_decl_rtl (tree decl)
{
const char *name = 0;
int reg_number;
rtx x;
gcc_assert (TREE_CODE (decl) != PARM_DECL
&& TREE_CODE (decl) != RESULT_DECL);
gcc_assert (TREE_CODE (decl) != VAR_DECL
|| TREE_STATIC (decl)
|| TREE_PUBLIC (decl)
|| DECL_EXTERNAL (decl)
|| DECL_REGISTER (decl));
gcc_assert (TREE_CODE (decl) != TYPE_DECL
&& TREE_CODE (decl) != LABEL_DECL);
if (DECL_RTL_SET_P (decl))
{
x = DECL_RTL (decl);
if (GET_MODE (x) != DECL_MODE (decl))
SET_DECL_RTL (decl, adjust_address_nv (x, DECL_MODE (decl), 0));
if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
return;
targetm.encode_section_info (decl, DECL_RTL (decl), false);
if (MEM_P (x)
&& GET_CODE (XEXP (x, 0)) == SYMBOL_REF
&& SYMBOL_REF_HAS_BLOCK_INFO_P (XEXP (x, 0)))
change_symbol_block (XEXP (x, 0), get_block_for_decl (decl));
if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
mudflap_enqueue_decl (decl);
return;
}
name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
if (name[0] != '*' && TREE_CODE (decl) != FUNCTION_DECL
&& DECL_REGISTER (decl))
{
error ("register name not specified for %q+D", decl);
}
else if (TREE_CODE (decl) != FUNCTION_DECL && DECL_REGISTER (decl))
{
const char *asmspec = name+1;
reg_number = decode_reg_name (asmspec);
if (reg_number == -1)
error ("register name not specified for %q+D", decl);
else if (reg_number < 0)
error ("invalid register name for %q+D", decl);
else if (TYPE_MODE (TREE_TYPE (decl)) == BLKmode)
error ("data type of %q+D isn%'t suitable for a register",
decl);
else if (! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl))))
error ("register specified for %q+D isn%'t suitable for data type",
decl);
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 (OPT_Wvolatile_register_var,
"optimization may eliminate reads and/or "
"writes to register variables");
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))
{
#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);
}
return;
}
}
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 ("register name given for non-register variable %q+D", decl);
}
#endif
}
if (TREE_CODE (decl) == VAR_DECL
&& DECL_SECTION_NAME (decl) != NULL_TREE
&& DECL_INITIAL (decl) == NULL_TREE
&& DECL_COMMON (decl))
DECL_COMMON (decl) = 0;
if (TREE_CODE (decl) == VAR_DECL && DECL_WEAK (decl))
DECL_COMMON (decl) = 0;
if (use_object_blocks_p () && use_blocks_for_decl_p (decl))
x = create_block_symbol (name, get_block_for_decl (decl), -1);
else
x = gen_rtx_SYMBOL_REF (Pmode, name);
SYMBOL_REF_WEAK (x) = DECL_WEAK (decl);
SET_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);
targetm.encode_section_info (decl, DECL_RTL (decl), true);
if (flag_mudflap && TREE_CODE (decl) == VAR_DECL)
mudflap_enqueue_decl (decl);
}
void
assemble_asm (tree string)
{
app_enable ();
if (TREE_CODE (string) == ADDR_EXPR)
string = TREE_OPERAND (string, 0);
fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string));
}
void
default_stabs_asm_out_destructor (rtx symbol ATTRIBUTE_UNUSED,
int priority ATTRIBUTE_UNUSED)
{
#if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
dbxout_begin_simple_stabs ("___DTOR_LIST__", 22 );
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];
if (priority != DEFAULT_INIT_PRIORITY)
{
sprintf (buf, ".dtors.%.5u",
MAX_INIT_PRIORITY - priority);
section = buf;
}
switch_to_section (get_section (section, SECTION_WRITE, NULL));
assemble_align (POINTER_SIZE);
assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
}
#ifdef DTORS_SECTION_ASM_OP
void
default_dtor_section_asm_out_destructor (rtx symbol,
int priority ATTRIBUTE_UNUSED)
{
switch_to_section (dtors_section);
assemble_align (POINTER_SIZE);
assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
}
#endif
void
default_stabs_asm_out_constructor (rtx symbol ATTRIBUTE_UNUSED,
int priority ATTRIBUTE_UNUSED)
{
#if defined DBX_DEBUGGING_INFO || defined XCOFF_DEBUGGING_INFO
dbxout_begin_simple_stabs ("___CTOR_LIST__", 22 );
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];
if (priority != DEFAULT_INIT_PRIORITY)
{
sprintf (buf, ".ctors.%.5u",
MAX_INIT_PRIORITY - priority);
section = buf;
}
switch_to_section (get_section (section, SECTION_WRITE, NULL));
assemble_align (POINTER_SIZE);
assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
}
#ifdef CTORS_SECTION_ASM_OP
void
default_ctor_section_asm_out_constructor (rtx symbol,
int priority ATTRIBUTE_UNUSED)
{
switch_to_section (ctors_section);
assemble_align (POINTER_SIZE);
assemble_integer (symbol, POINTER_SIZE / BITS_PER_UNIT, POINTER_SIZE, 1);
}
#endif
#ifndef CONSTANT_POOL_BEFORE_FUNCTION
#define CONSTANT_POOL_BEFORE_FUNCTION 1
#endif
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))))
|| !MEM_P (DECL_RTL (decl)))
return;
if (DECL_WEAK (decl) || DECL_ONE_ONLY (decl))
type = &weak_global_object_name;
if (!*type)
{
const char *p;
const char *name;
rtx decl_rtl = DECL_RTL (decl);
p = targetm.strip_name_encoding (XSTR (XEXP (decl_rtl, 0), 0));
name = ggc_strdup (p);
*type = name;
}
}
void
assemble_start_function (tree decl, const char *fnname)
{
int align;
char tmp_label[100];
bool hot_label_written = false;
cfun->unlikely_text_section_name = NULL;
first_function_block_is_cold = false;
if (flag_reorder_blocks_and_partition)
{
ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTB", const_labelno);
cfun->hot_section_label = ggc_strdup (tmp_label);
ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDB", const_labelno);
cfun->cold_section_label = ggc_strdup (tmp_label);
ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LHOTE", const_labelno);
cfun->hot_section_end_label = ggc_strdup (tmp_label);
ASM_GENERATE_INTERNAL_LABEL (tmp_label, "LCOLDE", const_labelno);
cfun->cold_section_end_label = ggc_strdup (tmp_label);
const_labelno++;
}
else
{
cfun->hot_section_label = NULL;
cfun->cold_section_label = NULL;
cfun->hot_section_end_label = NULL;
cfun->cold_section_end_label = NULL;
}
app_disable ();
if (CONSTANT_POOL_BEFORE_FUNCTION)
output_constant_pool (fnname, decl);
resolve_unique_section (decl, 0, flag_function_sections);
if (flag_reorder_blocks_and_partition)
{
switch_to_section (unlikely_text_section ());
\
assemble_align (DECL_ALIGN (decl));
\
ASM_OUTPUT_LABEL (asm_out_file, cfun->cold_section_label);
if (!current_function_is_thunk
&& BB_PARTITION (ENTRY_BLOCK_PTR->next_bb) == BB_COLD_PARTITION)
{
switch_to_section (text_section);
\
assemble_align (DECL_ALIGN (decl));
\
ASM_OUTPUT_LABEL (asm_out_file, cfun->hot_section_label);
hot_label_written = true;
first_function_block_is_cold = true;
}
}
else if (DECL_SECTION_NAME (decl))
{
initialize_cold_section_name ();
if (cfun->unlikely_text_section_name
&& strcmp (TREE_STRING_POINTER (DECL_SECTION_NAME (decl)),
cfun->unlikely_text_section_name) == 0)
first_function_block_is_cold = true;
}
in_cold_section_p = first_function_block_is_cold;
switch_to_section (function_section (decl));
if (flag_reorder_blocks_and_partition
&& !hot_label_written)
ASM_OUTPUT_LABEL (asm_out_file, cfun->hot_section_label);
align = floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT);
if (align > 0)
{
ASM_OUTPUT_ALIGN (asm_out_file, align);
}
if (! DECL_USER_ALIGN (decl)
&& 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);
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);
#ifdef ASM_DECLARE_FUNCTION_NAME
ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl);
#else
ASM_OUTPUT_LABEL (asm_out_file, fnname);
#endif
}
void
assemble_end_function (tree decl, const char *fnname ATTRIBUTE_UNUSED)
{
#ifdef ASM_DECLARE_FUNCTION_SIZE
if (flag_reorder_blocks_and_partition)
switch_to_section (function_section (decl));
ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl);
#endif
if (! CONSTANT_POOL_BEFORE_FUNCTION)
{
output_constant_pool (fnname, decl);
switch_to_section (function_section (decl));
}
if (flag_reorder_blocks_and_partition)
{
section *save_text_section;
save_text_section = in_section;
switch_to_section (unlikely_text_section ());
ASM_OUTPUT_LABEL (asm_out_file, cfun->cold_section_end_label);
if (first_function_block_is_cold)
switch_to_section (text_section);
else
switch_to_section (function_section (decl));
ASM_OUTPUT_LABEL (asm_out_file, cfun->hot_section_end_label);
switch_to_section (save_text_section);
}
}
void
assemble_zeros (unsigned HOST_WIDE_INT size)
{
if (flag_syntax_only)
return;
#ifdef ASM_NO_SKIP_IN_TEXT
if (ASM_NO_SKIP_IN_TEXT && (in_section->common.flags & SECTION_CODE) != 0)
{
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);
}
void
assemble_align (int align)
{
if (align > BITS_PER_UNIT)
{
ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
}
}
void
assemble_string (const char *p, int size)
{
int pos = 0;
int maximum = 2000;
while (pos < size)
{
int thissize = size - pos;
if (thissize > maximum)
thissize = maximum;
ASM_OUTPUT_ASCII (asm_out_file, p, thissize);
pos += thissize;
p += thissize;
}
}
static bool
emit_local (tree decl ATTRIBUTE_UNUSED,
const char *name ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
{
#if defined ASM_OUTPUT_ALIGNED_DECL_LOCAL
ASM_OUTPUT_ALIGNED_DECL_LOCAL (asm_out_file, decl, name,
size, DECL_ALIGN (decl));
return true;
#elif defined ASM_OUTPUT_ALIGNED_LOCAL
ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, DECL_ALIGN (decl));
return true;
#else
ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded);
return false;
#endif
}
#if defined ASM_OUTPUT_ALIGNED_BSS || defined ASM_OUTPUT_BSS
static bool
emit_bss (tree decl ATTRIBUTE_UNUSED,
const char *name ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
{
#if defined ASM_OUTPUT_ALIGNED_BSS
ASM_OUTPUT_ALIGNED_BSS (asm_out_file, decl, name, size, DECL_ALIGN (decl));
return true;
#else
ASM_OUTPUT_BSS (asm_out_file, decl, name, size, rounded);
return false;
#endif
}
#endif
static bool
emit_common (tree decl ATTRIBUTE_UNUSED,
const char *name ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
{
#if defined ASM_OUTPUT_ALIGNED_DECL_COMMON
ASM_OUTPUT_ALIGNED_DECL_COMMON (asm_out_file, decl, name,
size, DECL_ALIGN (decl));
return true;
#elif defined ASM_OUTPUT_ALIGNED_COMMON
ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, DECL_ALIGN (decl));
return true;
#else
ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded);
return false;
#endif
}
static bool
emit_tls_common (tree decl ATTRIBUTE_UNUSED,
const char *name ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT size ATTRIBUTE_UNUSED,
unsigned HOST_WIDE_INT rounded ATTRIBUTE_UNUSED)
{
#ifdef ASM_OUTPUT_TLS_COMMON
ASM_OUTPUT_TLS_COMMON (asm_out_file, decl, name, size);
return true;
#else
sorry ("thread-local COMMON data not implemented");
return true;
#endif
}
static void
assemble_noswitch_variable (tree decl, const char *name, section *sect)
{
unsigned HOST_WIDE_INT size, rounded;
size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
rounded = size;
if (size == 0)
rounded = 1;
rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1;
rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT)
* (BIGGEST_ALIGNMENT / BITS_PER_UNIT));
if (!sect->noswitch.callback (decl, name, size, rounded)
&& (unsigned HOST_WIDE_INT) DECL_ALIGN_UNIT (decl) > rounded)
warning (0, "requested alignment for %q+D is greater than "
"implemented alignment of %wu", decl, rounded);
}
static void
assemble_variable_contents (tree decl, const char *name,
bool dont_output_data)
{
#ifdef ASM_DECLARE_OBJECT_NAME
last_assemble_variable_decl = decl;
ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl);
#else
ASM_OUTPUT_LABEL (asm_out_file, name);
#endif
if (!dont_output_data)
{
if (DECL_INITIAL (decl)
&& DECL_INITIAL (decl) != error_mark_node
&& !initializer_zerop (DECL_INITIAL (decl)))
output_constant (DECL_INITIAL (decl),
tree_low_cst (DECL_SIZE_UNIT (decl), 1),
DECL_ALIGN (decl));
else
assemble_zeros (tree_low_cst (DECL_SIZE_UNIT (decl), 1));
}
}
void
assemble_variable (tree decl, int top_level ATTRIBUTE_UNUSED,
int at_end ATTRIBUTE_UNUSED, int dont_output_data)
{
const char *name;
rtx decl_rtl, symbol;
section *sect;
if (lang_hooks.decls.prepare_assemble_variable)
lang_hooks.decls.prepare_assemble_variable (decl);
last_assemble_variable_decl = 0;
if (DECL_EXTERNAL (decl))
return;
if (TREE_CODE (decl) == FUNCTION_DECL)
return;
if (DECL_RTL_SET_P (decl) && REG_P (DECL_RTL (decl)))
{
TREE_ASM_WRITTEN (decl) = 1;
return;
}
if (DECL_SIZE (decl) == 0)
layout_decl (decl, 0);
if (!dont_output_data && DECL_SIZE (decl) == 0)
{
error ("storage size of %q+D isn%'t known", decl);
TREE_ASM_WRITTEN (decl) = 1;
return;
}
if (TREE_ASM_WRITTEN (decl))
return;
decl_rtl = DECL_RTL (decl);
TREE_ASM_WRITTEN (decl) = 1;
if (flag_syntax_only)
return;
if (DECL_DUPLICATE_DECL (decl))
return;
app_disable ();
if (! dont_output_data
&& ! host_integerp (DECL_SIZE_UNIT (decl), 1))
{
error ("size of variable %q+D is too large", decl);
return;
}
gcc_assert (MEM_P (decl_rtl));
gcc_assert (GET_CODE (XEXP (decl_rtl, 0)) == SYMBOL_REF);
symbol = XEXP (decl_rtl, 0);
name = XSTR (symbol, 0);
if (TREE_PUBLIC (decl) && DECL_NAME (decl))
notice_global_symbol (decl);
align_variable (decl, dont_output_data);
set_mem_align (decl_rtl, DECL_ALIGN (decl));
if (TREE_PUBLIC (decl))
maybe_assemble_visibility (decl);
if (DECL_PRESERVE_P (decl))
targetm.asm_out.mark_decl_preserved (name);
sect = get_variable_section (decl, false);
if (TREE_PUBLIC (decl)
&& DECL_NAME (decl)
&& (sect->common.flags & SECTION_COMMON) == 0)
globalize_decl (decl);
if (DECL_INITIAL (decl) && DECL_INITIAL (decl) != error_mark_node)
output_addressed_constants (DECL_INITIAL (decl));
#ifdef ASM_OUTPUT_ZEROFILL
if ((sect->common.flags & SECTION_COMMON) == 0
&& ! 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, sect,
tree_low_cst (DECL_SIZE_UNIT (decl), 1),
floor_log2 (DECL_ALIGN (decl) / BITS_PER_UNIT));
return;
}
#endif
if (sect && (sect->common.flags & SECTION_CODE) != 0)
DECL_IN_TEXT_SECTION (decl) = 1;
if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
{
gcc_assert (!dont_output_data);
place_block_symbol (symbol);
}
else if (SECTION_STYLE (sect) == SECTION_NOSWITCH)
assemble_noswitch_variable (decl, name, sect);
else
{
switch_to_section (sect);
if (DECL_ALIGN (decl) > BITS_PER_UNIT)
ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (DECL_ALIGN_UNIT (decl)));
assemble_variable_contents (decl, name, dont_output_data);
}
}
static int
contains_pointers_p (tree type)
{
switch (TREE_CODE (type))
{
case POINTER_TYPE:
case REFERENCE_TYPE:
case OFFSET_TYPE:
return 1;
case RECORD_TYPE:
case UNION_TYPE:
case QUAL_UNION_TYPE:
{
tree fields;
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:
return contains_pointers_p (TREE_TYPE (type));
default:
return 0;
}
}
static GTY(()) tree pending_assemble_externals;
#ifdef ASM_OUTPUT_EXTERNAL
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;
}
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))
{
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
}
void
assemble_external (tree decl ATTRIBUTE_UNUSED)
{
gcc_assert (asm_out_file);
#ifdef ASM_OUTPUT_EXTERNAL
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
}
void
assemble_external_libcall (rtx fun)
{
if (! SYMBOL_REF_USED (fun))
{
SYMBOL_REF_USED (fun) = 1;
targetm.asm_out.external_libcall (fun);
}
}
void
assemble_label (const char *name)
{
ASM_OUTPUT_LABEL (asm_out_file, name);
}
void
mark_referenced (tree id)
{
TREE_SYMBOL_REFERENCED (id) = 1;
}
void
mark_decl_referenced (tree decl)
{
if (TREE_CODE (decl) == FUNCTION_DECL)
{
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)
{
struct cgraph_varpool_node *node = cgraph_varpool_node (decl);
cgraph_varpool_mark_needed_node (node);
node->force_output = true;
}
}
static inline tree
ultimate_transparent_alias_target (tree *alias)
{
tree target = *alias;
if (IDENTIFIER_TRANSPARENT_ALIAS (target))
{
gcc_assert (TREE_CHAIN (target));
target = ultimate_transparent_alias_target (&TREE_CHAIN (target));
gcc_assert (! IDENTIFIER_TRANSPARENT_ALIAS (target)
&& ! TREE_CHAIN (target));
*alias = target;
}
return target;
}
void
assemble_name_raw (FILE *file, const char *name)
{
if (name[0] == '*')
fputs (&name[1], file);
else
ASM_OUTPUT_LABELREF (file, name);
}
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)
{
tree id_orig = id;
mark_referenced (id);
ultimate_transparent_alias_target (&id);
if (id != id_orig)
name = IDENTIFIER_POINTER (id);
gcc_assert (! TREE_CHAIN (id));
}
assemble_name_raw (file, name);
}
rtx
assemble_static_space (unsigned HOST_WIDE_INT size)
{
char name[12];
const char *namestring;
rtx x;
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
{
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;
}
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;
#ifdef TRAMPOLINE_SECTION
switch_to_section (TRAMPOLINE_SECTION);
#else
switch_to_section (readonly_data_section);
#endif
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);
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
static inline unsigned
min_align (unsigned int a, unsigned int b)
{
return (a | b) & -(a | b);
}
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;
}
}
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);
}
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);
if (size > UNITS_PER_WORD && size > POINTER_SIZE / BITS_PER_UNIT)
return false;
return op && (assemble_integer_with_op (op, x), true);
}
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));
if (targetm.asm_out.integer (x, size, aligned_p))
return true;
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;
gcc_assert (!i);
}
gcc_assert (!force);
return false;
}
void
assemble_real (REAL_VALUE_TYPE d, enum machine_mode mode, unsigned int align)
{
long data[4] = {0, 0, 0, 0};
int i;
int bitsize, nelts, nunits, units_per;
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);
assemble_integer (GEN_INT (data[0]), MIN (nunits, units_per), align, 1);
nunits -= units_per;
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;
}
}
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 = NULL_RTX;
if (TREE_CODE (target) == CONST_DECL)
target = DECL_INITIAL (target);
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 (Pmode, 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:
gcc_unreachable ();
}
gcc_assert (MEM_P (x));
x = XEXP (x, 0);
value->base = x;
value->offset = offset;
}
struct constant_descriptor_tree GTY(())
{
rtx rtl;
tree value;
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);
static hashval_t
const_desc_hash (const void *ptr)
{
return ((struct constant_descriptor_tree *)ptr)->hash;
}
#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
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);
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:
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);
}
break;
case COMPLEX_CST:
return (const_hash_1 (TREE_REALPART (exp)) * 5
+ const_hash_1 (TREE_IMAGPART (exp)));
case CONSTRUCTOR:
{
unsigned HOST_WIDE_INT idx;
tree value;
hi = 5 + int_size_in_bytes (TREE_TYPE (exp));
FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, value)
if (value)
hi = hi * 603 + const_hash_1 (value);
return hi;
}
case ADDR_EXPR:
case FDESC_EXPR:
{
struct addr_const value;
decode_addr_const (exp, &value);
switch (GET_CODE (value.base))
{
case SYMBOL_REF:
hi = value.offset;
p = XSTR (value.base, 0);
for (i = 0; p[i] != 0; i++)
hi = ((hi * 613) + (unsigned) (p[i]));
break;
case LABEL_REF:
hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13;
break;
default:
gcc_unreachable ();
}
}
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:
return code;
}
hi = len;
for (i = 0; i < len; i++)
hi = ((hi * 613) + (unsigned) (p[i]));
return hi;
}
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);
}
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:
if (TYPE_PRECISION (TREE_TYPE (t1)) != TYPE_PRECISION (TREE_TYPE (t2)))
return 0;
if (TYPE_MODE (TREE_TYPE (t1)) != TYPE_MODE (TREE_TYPE (t2)))
return 0;
return tree_int_cst_equal (t1, t2);
case REAL_CST:
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:
if (flag_writable_strings
&& !darwin_constant_cfstring_p (t1)
&& !darwin_constant_cfstring_p (t2))
return t1 == t2;
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:
{
VEC(constructor_elt, gc) *v1, *v2;
unsigned HOST_WIDE_INT idx;
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));
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
{
if (TREE_TYPE (t1) != TREE_TYPE (t2))
return 0;
}
v1 = CONSTRUCTOR_ELTS (t1);
v2 = CONSTRUCTOR_ELTS (t2);
if (VEC_length (constructor_elt, v1)
!= VEC_length (constructor_elt, v2))
return 0;
for (idx = 0; idx < VEC_length (constructor_elt, v1); ++idx)
{
constructor_elt *c1 = VEC_index (constructor_elt, v1, idx);
constructor_elt *c2 = VEC_index (constructor_elt, v2, idx);
if (!compare_constant (c1->value, c2->value))
return 0;
if (typecode == ARRAY_TYPE)
{
if (!compare_constant (c1->index, c2->index))
return 0;
}
else
{
if (c1->index != c2->index)
return 0;
}
}
return 1;
}
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;
}
}
gcc_unreachable ();
}
static tree
copy_constant (tree exp)
{
switch (TREE_CODE (exp))
{
case ADDR_EXPR:
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);
VEC(constructor_elt, gc) *v;
unsigned HOST_WIDE_INT idx;
tree purpose, value;
v = VEC_alloc(constructor_elt, gc, VEC_length(constructor_elt,
CONSTRUCTOR_ELTS (exp)));
FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (exp), idx, purpose, value)
{
constructor_elt *ce = VEC_quick_push (constructor_elt, v, NULL);
ce->index = purpose;
ce->value = copy_constant (value);
}
CONSTRUCTOR_ELTS (copy) = v;
return copy;
}
default:
{
tree t = lang_hooks.expand_constant (exp);
gcc_assert (t != exp);
return copy_constant (t);
}
}
}
static unsigned int
get_constant_alignment (tree exp)
{
unsigned int align;
align = TYPE_ALIGN (TREE_TYPE (exp));
#ifdef CONSTANT_ALIGNMENT
align = CONSTANT_ALIGNMENT (exp, align);
#endif
return align;
}
static section *
get_constant_section (tree exp)
{
if (IN_NAMED_SECTION (exp))
return get_named_section (exp, NULL, compute_reloc_for_constant (exp));
else
return targetm.asm_out.select_section (exp,
compute_reloc_for_constant (exp),
get_constant_alignment (exp));
}
static HOST_WIDE_INT
get_constant_size (tree exp)
{
HOST_WIDE_INT size;
size = int_size_in_bytes (TREE_TYPE (exp));
if (TREE_CODE (exp) == STRING_CST)
size = MAX (TREE_STRING_LENGTH (exp), size);
return size;
}
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));
if (flag_writable_strings && TREE_CODE (exp) == STRING_CST)
desc->value = exp;
else
desc->value = copy_constant (exp);
if (flag_mudflap && mf_marked_p (exp))
mf_mark (desc->value);
labelno = const_labelno++;
if (flag_writable_strings && TREE_CODE (exp) == STRING_CST)
ASM_GENERATE_INTERNAL_LABEL (label, "lC", labelno);
else
ASM_GENERATE_INTERNAL_LABEL (label, "LC", labelno);
if (use_object_blocks_p ())
{
section *sect = get_constant_section (exp);
symbol = create_block_symbol (ggc_strdup (label),
get_block_for_section (sect), -1);
}
else
symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
SET_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);
targetm.encode_section_info (exp, rtl, true);
desc->rtl = rtl;
return desc;
}
rtx
output_constant_def (tree exp, int defer)
{
struct constant_descriptor_tree *desc;
struct constant_descriptor_tree key;
void **loc;
int save_flag_writable_strings = flag_writable_strings;
if (flag_writable_strings && TREE_CODE (exp) == STRING_CST
&& darwin_constant_cfstring_p (exp))
flag_writable_strings = 0;
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);
flag_writable_strings = save_flag_writable_strings;
return desc->rtl;
}
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))
return;
if (defer && (TREE_CODE (exp) != STRING_CST || !flag_writable_strings))
{
if (cfun)
n_deferred_constants++;
return;
}
output_constant_def_contents (symbol);
}
static void
assemble_constant_contents (tree exp, const char *label, unsigned int align)
{
HOST_WIDE_INT size;
size = get_constant_size (exp);
#ifdef ASM_DECLARE_CONSTANT_NAME
ASM_DECLARE_CONSTANT_NAME (asm_out_file, label, exp, size);
#else
ASM_OUTPUT_LABEL (asm_out_file, label);
#endif
output_constant (exp, size, align);
}
static void
output_constant_def_contents (rtx symbol)
{
tree exp = SYMBOL_REF_DECL (symbol);
unsigned int align;
output_addressed_constants (exp);
TREE_ASM_WRITTEN (exp) = 1;
if (SYMBOL_REF_HAS_BLOCK_INFO_P (symbol) && SYMBOL_REF_BLOCK (symbol))
place_block_symbol (symbol);
else
{
switch_to_section (get_constant_section (exp));
align = get_constant_alignment (exp);
if (align > BITS_PER_UNIT)
ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT));
assemble_constant_contents (exp, XSTR (symbol, 0), align);
}
if (flag_mudflap)
mudflap_enqueue_constant (exp);
}
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);
}
struct rtx_constant_pool GTY(())
{
struct constant_descriptor_rtx *first;
struct constant_descriptor_rtx *last;
htab_t GTY((param_is (struct constant_descriptor_rtx))) const_rtx_htab;
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;
};
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);
}
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;
}
static hashval_t
const_rtx_hash (rtx x)
{
hashval_t h = 0;
for_each_rtx (&x, const_rtx_hash_1, &h);
return h;
}
static struct rtx_constant_pool *
create_constant_pool (void)
{
struct rtx_constant_pool *pool;
pool = ggc_alloc (sizeof (struct rtx_constant_pool));
pool->const_rtx_htab = htab_create_ggc (31, const_desc_rtx_hash,
const_desc_rtx_eq, NULL);
pool->first = NULL;
pool->last = NULL;
pool->offset = 0;
return pool;
}
void
init_varasm_status (struct function *f)
{
struct varasm_status *p;
p = ggc_alloc (sizeof (struct varasm_status));
f->varasm = p;
p->pool = create_constant_pool ();
p->deferred_constants = 0;
}
rtx
simplify_subtraction (rtx x)
{
rtx r = simplify_rtx (x);
return r ? r : x;
}
rtx
force_const_mem (enum machine_mode mode, rtx x)
{
struct constant_descriptor_rtx *desc, tmp;
struct rtx_constant_pool *pool;
char label[256];
rtx def, symbol;
hashval_t hash;
unsigned int align;
void **slot;
if (targetm.cannot_force_const_mem (x))
return NULL_RTX;
current_function_uses_const_pool = 1;
pool = (targetm.use_blocks_for_constant_p (mode, x)
? shared_constant_pool
: cfun->varasm->pool);
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 (desc)
return copy_rtx (desc->mem);
desc = ggc_alloc (sizeof (*desc));
*slot = desc;
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;
ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno);
++const_labelno;
if (use_object_blocks_p () && targetm.use_blocks_for_constant_p (mode, x))
{
section *sect = targetm.asm_out.select_rtx_section (mode, x, align);
symbol = create_block_symbol (ggc_strdup (label),
get_block_for_section (sect), -1);
}
else
symbol = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (label));
desc->sym = symbol;
SYMBOL_REF_FLAGS (symbol) |= SYMBOL_FLAG_LOCAL;
CONSTANT_POOL_ADDRESS_P (symbol) = 1;
SET_SYMBOL_REF_CONSTANT (symbol, desc);
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 (GET_CODE (x) == LABEL_REF)
LABEL_PRESERVE_P (XEXP (x, 0)) = 1;
return copy_rtx (def);
}
rtx
get_pool_constant (rtx addr)
{
return SYMBOL_REF_CONSTANT (addr)->constant;
}
rtx
get_pool_constant_mark (rtx addr, bool *pmarked)
{
struct constant_descriptor_rtx *desc;
desc = SYMBOL_REF_CONSTANT (addr);
*pmarked = (desc->mark != 0);
return desc->constant;
}
enum machine_mode
get_pool_mode (rtx addr)
{
return SYMBOL_REF_CONSTANT (addr)->mode;
}
int
get_pool_size (void)
{
return cfun->varasm->pool->offset;
}
static void
output_constant_pool_2 (enum machine_mode mode, rtx x, unsigned int align)
{
switch (GET_MODE_CLASS (mode))
{
case MODE_FLOAT:
case MODE_DECIMAL_FLOAT:
{
REAL_VALUE_TYPE r;
gcc_assert (GET_CODE (x) == CONST_DOUBLE);
REAL_VALUE_FROM_CONST_DOUBLE (r, x);
assemble_real (r, mode, align);
break;
}
case MODE_INT:
case MODE_PARTIAL_INT:
assemble_integer (x, GET_MODE_SIZE (mode), align, 1);
break;
case MODE_VECTOR_FLOAT:
case MODE_VECTOR_INT:
{
int i, units;
enum machine_mode submode = GET_MODE_INNER (mode);
unsigned int subalign = MIN (align, GET_MODE_BITSIZE (submode));
gcc_assert (GET_CODE (x) == CONST_VECTOR);
units = CONST_VECTOR_NUNITS (x);
for (i = 0; i < units; i++)
{
rtx elt = CONST_VECTOR_ELT (x, i);
output_constant_pool_2 (submode, elt, i ? subalign : align);
}
}
break;
default:
gcc_unreachable ();
}
}
static void
output_constant_pool_1 (struct constant_descriptor_rtx *desc,
unsigned int align)
{
rtx x, tmp;
x = desc->constant;
tmp = x;
switch (GET_CODE (x))
{
case CONST:
if (GET_CODE (XEXP (x, 0)) != PLUS
|| GET_CODE (XEXP (XEXP (x, 0), 0)) != LABEL_REF)
break;
tmp = XEXP (XEXP (x, 0), 0);
case LABEL_REF:
tmp = XEXP (x, 0);
gcc_assert (!INSN_DELETED_P (tmp));
gcc_assert (!NOTE_P (tmp)
|| NOTE_LINE_NUMBER (tmp) != NOTE_INSN_DELETED);
break;
default:
break;
}
#ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, desc->mode,
align, desc->labelno, done);
#endif
assemble_align (align);
targetm.asm_out.internal_label (asm_out_file, "LC", desc->labelno);
output_constant_pool_2 (desc->mode, x, align);
if (align > GET_MODE_BITSIZE (desc->mode)
&& in_section
&& (in_section->common.flags & SECTION_MERGE))
assemble_align (align);
#ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY
done:
#endif
return;
}
static int
mark_constant (rtx *current_rtx, void *data ATTRIBUTE_UNUSED)
{
rtx x = *current_rtx;
if (x == NULL_RTX || GET_CODE (x) != SYMBOL_REF)
return 0;
if (CONSTANT_POOL_ADDRESS_P (x))
{
struct constant_descriptor_rtx *desc = SYMBOL_REF_CONSTANT (x);
if (desc->mark == 0)
{
desc->mark = 1;
for_each_rtx (&desc->constant, mark_constant, NULL);
}
}
else if (TREE_CONSTANT_POOL_ADDRESS_P (x))
{
tree exp = SYMBOL_REF_DECL (x);
if (!TREE_ASM_WRITTEN (exp))
{
n_deferred_constants--;
output_constant_def_contents (x);
}
}
return -1;
}
static void
mark_constants (rtx insn)
{
if (!INSN_P (insn))
return;
if (GET_CODE (PATTERN (insn)) == SEQUENCE)
{
rtx seq = PATTERN (insn);
int i, n = XVECLEN (seq, 0);
for (i = 0; i < n; ++i)
{
rtx subinsn = XVECEXP (seq, 0, i);
if (INSN_P (subinsn))
for_each_rtx (&PATTERN (subinsn), mark_constant, NULL);
}
}
else
for_each_rtx (&PATTERN (insn), mark_constant, NULL);
}
static void
mark_constant_pool (void)
{
rtx insn, link;
if (!current_function_uses_const_pool && n_deferred_constants == 0)
return;
for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
mark_constants (insn);
for (link = current_function_epilogue_delay_list;
link;
link = XEXP (link, 1))
mark_constants (XEXP (link, 0));
}
static void
output_constant_pool_contents (struct rtx_constant_pool *pool)
{
struct constant_descriptor_rtx *desc;
for (desc = pool->first; desc ; desc = desc->next)
if (desc->mark)
{
if (SYMBOL_REF_HAS_BLOCK_INFO_P (desc->sym)
&& SYMBOL_REF_BLOCK (desc->sym))
place_block_symbol (desc->sym);
else
{
switch_to_section (targetm.asm_out.select_rtx_section
(desc->mode, desc->constant, desc->align));
output_constant_pool_1 (desc, desc->align);
}
}
}
static void
output_constant_pool (const char *fnname ATTRIBUTE_UNUSED,
tree fndecl ATTRIBUTE_UNUSED)
{
struct rtx_constant_pool *pool = cfun->varasm->pool;
mark_constant_pool ();
#ifdef ASM_OUTPUT_POOL_PROLOGUE
ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool->offset);
#endif
output_constant_pool_contents (pool);
#ifdef ASM_OUTPUT_POOL_EPILOGUE
ASM_OUTPUT_POOL_EPILOGUE (asm_out_file, fnname, fndecl, pool->offset);
#endif
}
void
output_shared_constant_pool (void)
{
output_constant_pool_contents (shared_constant_pool);
}
int
compute_reloc_for_constant (tree exp)
{
int reloc = 0, reloc2;
tree tem;
exp = lang_hooks.expand_constant (exp);
switch (TREE_CODE (exp))
{
case ADDR_EXPR:
case FDESC_EXPR:
for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
tem = TREE_OPERAND (tem, 0))
;
if (TREE_PUBLIC (tem))
reloc |= 2;
else
reloc |= 1;
break;
case PLUS_EXPR:
reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
reloc |= compute_reloc_for_constant (TREE_OPERAND (exp, 1));
break;
case MINUS_EXPR:
reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
reloc2 = compute_reloc_for_constant (TREE_OPERAND (exp, 1));
if (reloc == 1 && reloc2 == 1)
reloc = 0;
else
reloc |= reloc2;
break;
case NOP_EXPR:
case CONVERT_EXPR:
case NON_LVALUE_EXPR:
case VIEW_CONVERT_EXPR:
reloc = compute_reloc_for_constant (TREE_OPERAND (exp, 0));
break;
case CONSTRUCTOR:
{
unsigned HOST_WIDE_INT idx;
FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
if (tem != 0)
reloc |= compute_reloc_for_constant (tem);
}
break;
default:
break;
}
return reloc;
}
static void
output_addressed_constants (tree exp)
{
tree tem;
exp = lang_hooks.expand_constant (exp);
switch (TREE_CODE (exp))
{
case ADDR_EXPR:
case FDESC_EXPR:
for (tem = TREE_OPERAND (exp, 0); handled_component_p (tem);
tem = TREE_OPERAND (tem, 0))
;
if (TREE_CODE (tem) == CONST_DECL && DECL_INITIAL (tem))
tem = DECL_INITIAL (tem);
if (CONSTANT_CLASS_P (tem) || TREE_CODE (tem) == CONSTRUCTOR)
output_constant_def (tem, 0);
break;
case PLUS_EXPR:
case MINUS_EXPR:
output_addressed_constants (TREE_OPERAND (exp, 1));
case NOP_EXPR:
case CONVERT_EXPR:
case NON_LVALUE_EXPR:
case VIEW_CONVERT_EXPR:
output_addressed_constants (TREE_OPERAND (exp, 0));
break;
case CONSTRUCTOR:
{
unsigned HOST_WIDE_INT idx;
FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (exp), idx, tem)
if (tem != 0)
output_addressed_constants (tem);
}
break;
default:
break;
}
}
bool
constructor_static_from_elts_p (tree ctor)
{
return (TREE_CONSTANT (ctor)
&& (TREE_CODE (TREE_TYPE (ctor)) == UNION_TYPE
|| TREE_CODE (TREE_TYPE (ctor)) == VECTOR_TYPE
|| TREE_CODE (TREE_TYPE (ctor)) == RECORD_TYPE)
&& !VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (ctor)));
}
tree
initializer_constant_valid_p (tree value, tree endtype)
{
value = lang_hooks.expand_constant (value);
switch (TREE_CODE (value))
{
case CONSTRUCTOR:
if (constructor_static_from_elts_p (value))
{
unsigned HOST_WIDE_INT idx;
tree elt;
bool absolute = true;
FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (value), idx, elt)
{
tree reloc;
reloc = initializer_constant_valid_p (elt, TREE_TYPE (elt));
if (!reloc)
return NULL_TREE;
if (reloc != null_pointer_node)
absolute = false;
}
return absolute ? null_pointer_node : error_mark_node;
}
return TREE_STATIC (value) ? null_pointer_node : NULL_TREE;
case INTEGER_CST:
case VECTOR_CST:
case REAL_CST:
case STRING_CST:
case COMPLEX_CST:
return null_pointer_node;
case ADDR_EXPR:
case FDESC_EXPR:
value = staticp (TREE_OPERAND (value, 0));
if (value)
{
if (TREE_CODE (value) == INDIRECT_REF
&& TREE_CONSTANT (TREE_OPERAND (value, 0)))
return null_pointer_node;
if (TREE_CODE (value) == FUNCTION_DECL
&& ((decl_function_context (value)
&& !DECL_NO_STATIC_CHAIN (value))
|| DECL_DLLIMPORT_P (value)))
return NULL_TREE;
if (TREE_CODE (value) == CONSTRUCTOR)
return NULL_TREE;
}
return value;
case VIEW_CONVERT_EXPR:
case NON_LVALUE_EXPR:
return initializer_constant_valid_p (TREE_OPERAND (value, 0), endtype);
case CONVERT_EXPR:
case NOP_EXPR:
{
tree src;
tree src_type;
tree dest_type;
src = TREE_OPERAND (value, 0);
src_type = TREE_TYPE (src);
dest_type = TREE_TYPE (value);
if ((POINTER_TYPE_P (dest_type) && POINTER_TYPE_P (src_type))
|| (FLOAT_TYPE_P (dest_type) && FLOAT_TYPE_P (src_type))
|| (TREE_CODE (dest_type) == OFFSET_TYPE
&& TREE_CODE (src_type) == OFFSET_TYPE))
return initializer_constant_valid_p (src, endtype);
if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type)
&& (TYPE_PRECISION (dest_type) == TYPE_PRECISION (src_type)))
return initializer_constant_valid_p (src, endtype);
if (INTEGRAL_TYPE_P (dest_type) && INTEGRAL_TYPE_P (src_type))
{
tree inner = initializer_constant_valid_p (src, endtype);
if (inner == null_pointer_node)
return null_pointer_node;
break;
}
if (INTEGRAL_TYPE_P (dest_type) && POINTER_TYPE_P (src_type)
&& (TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type)))
return initializer_constant_valid_p (src, endtype);
if ((POINTER_TYPE_P (dest_type)
|| TREE_CODE (dest_type) == OFFSET_TYPE)
&& INTEGRAL_TYPE_P (src_type))
{
if (TREE_CODE (src) == INTEGER_CST
&& TYPE_PRECISION (dest_type) >= TYPE_PRECISION (src_type))
return null_pointer_node;
if (integer_zerop (src))
return null_pointer_node;
else if (TYPE_PRECISION (dest_type) <= TYPE_PRECISION (src_type))
return initializer_constant_valid_p (src, endtype);
}
if (TREE_CODE (dest_type) == RECORD_TYPE
|| TREE_CODE (dest_type) == UNION_TYPE)
return initializer_constant_valid_p (src, endtype);
}
break;
case PLUS_EXPR:
if (! INTEGRAL_TYPE_P (endtype)
|| TYPE_PRECISION (endtype) >= POINTER_SIZE)
{
tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
endtype);
tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
endtype);
if (valid0 == null_pointer_node)
return valid1;
if (valid1 == null_pointer_node)
return valid0;
}
break;
case MINUS_EXPR:
if (! INTEGRAL_TYPE_P (endtype)
|| TYPE_PRECISION (endtype) >= POINTER_SIZE)
{
tree valid0 = initializer_constant_valid_p (TREE_OPERAND (value, 0),
endtype);
tree valid1 = initializer_constant_valid_p (TREE_OPERAND (value, 1),
endtype);
if (valid1 == null_pointer_node)
return valid0;
if (valid0 == valid1 && valid0 != 0)
return null_pointer_node;
if (valid0 && TREE_CODE (valid0) == STRING_CST
&& valid1 && TREE_CODE (valid1) == STRING_CST
&& operand_equal_p (valid0, valid1, 1))
return null_pointer_node;
}
if (INTEGRAL_TYPE_P (endtype))
{
tree op0, op1;
op0 = TREE_OPERAND (value, 0);
op1 = TREE_OPERAND (value, 1);
while (TREE_CODE (op0) == NOP_EXPR
|| TREE_CODE (op0) == CONVERT_EXPR
|| TREE_CODE (op0) == NON_LVALUE_EXPR)
{
tree inner = TREE_OPERAND (op0, 0);
if (inner == error_mark_node
|| ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
|| (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0)))
> GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
break;
op0 = inner;
}
while (TREE_CODE (op1) == NOP_EXPR
|| TREE_CODE (op1) == CONVERT_EXPR
|| TREE_CODE (op1) == NON_LVALUE_EXPR)
{
tree inner = TREE_OPERAND (op1, 0);
if (inner == error_mark_node
|| ! INTEGRAL_MODE_P (TYPE_MODE (TREE_TYPE (inner)))
|| (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op1)))
> GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (inner)))))
break;
op1 = inner;
}
op0 = initializer_constant_valid_p (op0, endtype);
op1 = initializer_constant_valid_p (op1, endtype);
if (op0 && op1)
{
if (op0 == op1)
return null_pointer_node;
if (TREE_CODE (op0) == LABEL_DECL
&& TREE_CODE (op1) == LABEL_DECL)
return null_pointer_node;
if (TREE_CODE (op0) == STRING_CST
&& TREE_CODE (op1) == STRING_CST
&& operand_equal_p (op0, op1, 1))
return null_pointer_node;
}
}
break;
default:
break;
}
return 0;
}
void
output_constant (tree exp, unsigned HOST_WIDE_INT size, unsigned int align)
{
enum tree_code code;
unsigned HOST_WIDE_INT thissize;
exp = lang_hooks.expand_constant (exp);
if (size == 0 || flag_syntax_only)
return;
if (TREE_CODE (exp) == NOP_EXPR
&& POINTER_TYPE_P (TREE_TYPE (exp))
&& targetm.valid_pointer_mode (TYPE_MODE (TREE_TYPE (exp))))
{
tree saved_type = TREE_TYPE (exp);
while (TREE_CODE (exp) == NOP_EXPR
&& POINTER_TYPE_P (TREE_TYPE (exp))
&& targetm.valid_pointer_mode (TYPE_MODE (TREE_TYPE (exp))))
exp = TREE_OPERAND (exp, 0);
if (TREE_CODE (exp) == ADDR_EXPR)
exp = build1 (ADDR_EXPR, saved_type, TREE_OPERAND (exp, 0));
else if (TREE_CODE (exp) == INTEGER_CST)
exp = build_int_cst_wide (saved_type, TREE_INT_CST_LOW (exp),
TREE_INT_CST_HIGH (exp));
}
while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR
|| TREE_CODE (exp) == NON_LVALUE_EXPR
|| TREE_CODE (exp) == VIEW_CONVERT_EXPR)
{
HOST_WIDE_INT type_size = int_size_in_bytes (TREE_TYPE (exp));
HOST_WIDE_INT op_size = int_size_in_bytes (TREE_TYPE (TREE_OPERAND (exp, 0)));
if (type_size > op_size
&& TREE_CODE (exp) != VIEW_CONVERT_EXPR
&& TREE_CODE (TREE_TYPE (exp)) != UNION_TYPE)
break;
else
exp = TREE_OPERAND (exp, 0);
}
code = TREE_CODE (TREE_TYPE (exp));
thissize = int_size_in_bytes (TREE_TYPE (exp));
exp = lang_hooks.expand_constant (exp);
if (TREE_CODE (exp) == CONSTRUCTOR
&& VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (exp)))
{
assemble_zeros (size);
return;
}
if (TREE_CODE (exp) == FDESC_EXPR)
{
#ifdef ASM_OUTPUT_FDESC
HOST_WIDE_INT part = tree_low_cst (TREE_OPERAND (exp, 1), 0);
tree decl = TREE_OPERAND (exp, 0);
ASM_OUTPUT_FDESC (asm_out_file, decl, part);
#else
gcc_unreachable ();
#endif
return;
}
switch (code)
{
case BOOLEAN_TYPE:
case INTEGER_TYPE:
case ENUMERAL_TYPE:
case POINTER_TYPE:
case REFERENCE_TYPE:
case BLOCK_POINTER_TYPE:
case OFFSET_TYPE:
if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode,
EXPAND_INITIALIZER),
MIN (size, thissize), align, 0))
error ("initializer for integer value is too complicated");
break;
case REAL_TYPE:
if (TREE_CODE (exp) != REAL_CST)
error ("initializer for floating value is not a floating constant");
assemble_real (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp)), align);
break;
case COMPLEX_TYPE:
output_constant (TREE_REALPART (exp), thissize / 2, align);
output_constant (TREE_IMAGPART (exp), thissize / 2,
min_align (align, BITS_PER_UNIT * (thissize / 2)));
break;
case ARRAY_TYPE:
case VECTOR_TYPE:
switch (TREE_CODE (exp))
{
case CONSTRUCTOR:
output_constructor (exp, size, align);
return;
case STRING_CST:
thissize = MIN ((unsigned HOST_WIDE_INT)TREE_STRING_LENGTH (exp),
size);
assemble_string (TREE_STRING_POINTER (exp), thissize);
break;
case VECTOR_CST:
{
int elt_size;
tree link;
unsigned int nalign;
enum machine_mode inner;
inner = TYPE_MODE (TREE_TYPE (TREE_TYPE (exp)));
nalign = MIN (align, GET_MODE_ALIGNMENT (inner));
elt_size = GET_MODE_SIZE (inner);
link = TREE_VECTOR_CST_ELTS (exp);
output_constant (TREE_VALUE (link), elt_size, align);
thissize = elt_size;
while ((link = TREE_CHAIN (link)) != NULL)
{
output_constant (TREE_VALUE (link), elt_size, nalign);
thissize += elt_size;
}
break;
}
default:
gcc_unreachable ();
}
break;
case RECORD_TYPE:
case UNION_TYPE:
gcc_assert (TREE_CODE (exp) == CONSTRUCTOR);
output_constructor (exp, size, align);
return;
case ERROR_MARK:
return;
default:
gcc_unreachable ();
}
if (size > thissize)
assemble_zeros (size - thissize);
}
static unsigned HOST_WIDE_INT
array_size_for_constructor (tree val)
{
tree max_index, i;
unsigned HOST_WIDE_INT cnt;
tree index, value, tmp;
if (TREE_CODE (val) == STRING_CST)
return TREE_STRING_LENGTH (val);
max_index = NULL_TREE;
FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (val), cnt, index, value)
{
if (TREE_CODE (index) == RANGE_EXPR)
index = TREE_OPERAND (index, 1);
if (max_index == NULL_TREE || tree_int_cst_lt (max_index, index))
max_index = index;
}
if (max_index == NULL_TREE)
return 0;
tmp = TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (val)));
i = size_binop (MINUS_EXPR, fold_convert (sizetype, max_index),
fold_convert (sizetype, tmp));
i = size_binop (PLUS_EXPR, i, build_int_cst (sizetype, 1));
i = size_binop (MULT_EXPR, i, TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (val))));
return tree_low_cst (i, 1);
}
static void
output_constructor (tree exp, unsigned HOST_WIDE_INT size,
unsigned int align)
{
tree type = TREE_TYPE (exp);
tree field = 0;
tree min_index = 0;
HOST_WIDE_INT total_bytes = 0;
int byte_buffer_in_use = 0;
int byte = 0;
unsigned HOST_WIDE_INT cnt;
constructor_elt *ce;
gcc_assert (HOST_BITS_PER_WIDE_INT >= BITS_PER_UNIT);
if (TREE_CODE (type) == RECORD_TYPE && TYPE_FIELDS (type))
{
unsigned head = 0, last;
VEC(constructor_elt, gc) *elts = CONSTRUCTOR_ELTS (exp);
unsigned elt_count = VEC_length (constructor_elt, elts);
while (head < elt_count)
{
constructor_elt *head_elt;
head_elt = VEC_index (constructor_elt, elts, head);
if (head_elt->index)
{
HOST_WIDE_INT pos = int_bit_position (head_elt->index);
unsigned afterlast;
for (afterlast = head + 1;
afterlast < elt_count;
afterlast++)
{
tree field_decl = VEC_index (constructor_elt,
elts, afterlast)->index;
if (field_decl
&& int_bit_position (field_decl) >= pos)
break;
}
last = afterlast - 1;
while (head < last)
{
VEC_swap (constructor_elt, elts, head, last);
head++;
last--;
}
head = afterlast;
}
else
head++;
}
field = TYPE_FIELDS (type);
}
if (TREE_CODE (type) == ARRAY_TYPE
&& TYPE_DOMAIN (type) != 0)
min_index = TYPE_MIN_VALUE (TYPE_DOMAIN (type));
for (cnt = 0;
VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (exp), cnt, ce);
cnt++, field = field ? TREE_CHAIN (field) : 0)
{
tree val = ce->value;
tree index = 0;
if ((TREE_CODE (type) == RECORD_TYPE || TREE_CODE (type) == UNION_TYPE
|| TREE_CODE (type) == QUAL_UNION_TYPE)
&& ce->index != 0)
field = ce->index;
else if (TREE_CODE (type) == ARRAY_TYPE)
index = ce->index;
#ifdef ASM_COMMENT_START
if (field && flag_verbose_asm)
fprintf (asm_out_file, "%s %s:\n",
ASM_COMMENT_START,
DECL_NAME (field)
? IDENTIFIER_POINTER (DECL_NAME (field))
: "<anonymous>");
#endif
if (val != 0)
STRIP_NOPS (val);
if (index && TREE_CODE (index) == RANGE_EXPR)
{
unsigned HOST_WIDE_INT fieldsize
= int_size_in_bytes (TREE_TYPE (type));
HOST_WIDE_INT lo_index = tree_low_cst (TREE_OPERAND (index, 0), 0);
HOST_WIDE_INT hi_index = tree_low_cst (TREE_OPERAND (index, 1), 0);
HOST_WIDE_INT index;
unsigned int align2 = min_align (align, fieldsize * BITS_PER_UNIT);
for (index = lo_index; index <= hi_index; index++)
{
if (val == 0)
assemble_zeros (fieldsize);
else
output_constant (val, fieldsize, align2);
total_bytes += fieldsize;
}
}
else if (field == 0 || !DECL_BIT_FIELD (field))
{
unsigned HOST_WIDE_INT fieldsize;
HOST_WIDE_INT pos = field ? int_byte_position (field) : 0;
unsigned int align2;
if (index != 0)
pos = (tree_low_cst (TYPE_SIZE_UNIT (TREE_TYPE (val)), 1)
* (tree_low_cst (index, 0) - tree_low_cst (min_index, 0)));
if (byte_buffer_in_use)
{
assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
total_bytes++;
byte_buffer_in_use = 0;
}
if ((field != 0 || index != 0) && pos != total_bytes)
{
gcc_assert (pos >= total_bytes);
assemble_zeros (pos - total_bytes);
total_bytes = pos;
}
align2 = min_align (align, BITS_PER_UNIT * pos);
if (field)
{
fieldsize = 0;
if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE
&& TYPE_DOMAIN (TREE_TYPE (field))
&& ! TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (field))))
{
fieldsize = array_size_for_constructor (val);
gcc_assert (!fieldsize || !TREE_CHAIN (field));
}
else if (DECL_SIZE_UNIT (field))
{
if (host_integerp (DECL_SIZE_UNIT (field), 1))
fieldsize = tree_low_cst (DECL_SIZE_UNIT (field), 1);
}
}
else
fieldsize = int_size_in_bytes (TREE_TYPE (type));
if (val == 0)
assemble_zeros (fieldsize);
else
output_constant (val, fieldsize, align2);
total_bytes += fieldsize;
}
else if (val != 0 && TREE_CODE (val) != INTEGER_CST)
error ("invalid initial value for member %qs",
IDENTIFIER_POINTER (DECL_NAME (field)));
else
{
HOST_WIDE_INT next_offset = int_bit_position (field);
HOST_WIDE_INT end_offset
= (next_offset + tree_low_cst (DECL_SIZE (field), 1));
if (val == 0)
val = integer_zero_node;
if (next_offset / BITS_PER_UNIT != total_bytes)
{
if (byte_buffer_in_use)
{
assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
total_bytes++;
byte_buffer_in_use = 0;
}
if (next_offset / BITS_PER_UNIT != total_bytes)
{
gcc_assert (next_offset / BITS_PER_UNIT >= total_bytes);
assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes);
total_bytes = next_offset / BITS_PER_UNIT;
}
}
if (! byte_buffer_in_use)
byte = 0;
while (next_offset < end_offset)
{
int this_time;
int shift;
HOST_WIDE_INT value;
HOST_WIDE_INT next_byte = next_offset / BITS_PER_UNIT;
HOST_WIDE_INT next_bit = next_offset % BITS_PER_UNIT;
while (next_byte != total_bytes)
{
assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
total_bytes++;
byte = 0;
}
this_time = MIN (end_offset - next_offset,
BITS_PER_UNIT - next_bit);
if (BYTES_BIG_ENDIAN)
{
shift = end_offset - next_offset - this_time;
if (shift < HOST_BITS_PER_WIDE_INT
&& shift + this_time > HOST_BITS_PER_WIDE_INT)
{
this_time = shift + this_time - HOST_BITS_PER_WIDE_INT;
shift = HOST_BITS_PER_WIDE_INT;
}
if (shift < HOST_BITS_PER_WIDE_INT)
value = TREE_INT_CST_LOW (val);
else
{
gcc_assert (shift < 2 * HOST_BITS_PER_WIDE_INT);
value = TREE_INT_CST_HIGH (val);
shift -= HOST_BITS_PER_WIDE_INT;
}
byte |= (((value >> shift)
& (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
<< (BITS_PER_UNIT - this_time - next_bit));
}
else
{
shift = next_offset - int_bit_position (field);
if (shift < HOST_BITS_PER_WIDE_INT
&& shift + this_time > HOST_BITS_PER_WIDE_INT)
this_time = (HOST_BITS_PER_WIDE_INT - shift);
if (shift < HOST_BITS_PER_WIDE_INT)
value = TREE_INT_CST_LOW (val);
else
{
gcc_assert (shift < 2 * HOST_BITS_PER_WIDE_INT);
value = TREE_INT_CST_HIGH (val);
shift -= HOST_BITS_PER_WIDE_INT;
}
byte |= (((value >> shift)
& (((HOST_WIDE_INT) 2 << (this_time - 1)) - 1))
<< next_bit);
}
next_offset += this_time;
byte_buffer_in_use = 1;
}
}
}
if (byte_buffer_in_use)
{
assemble_integer (GEN_INT (byte), 1, BITS_PER_UNIT, 1);
total_bytes++;
}
if ((unsigned HOST_WIDE_INT)total_bytes < size)
assemble_zeros (size - total_bytes);
}
static GTY(()) tree weak_decls;
static void
mark_weak (tree decl)
{
DECL_WEAK (decl) = 1;
if (DECL_RTL_SET_P (decl)
&& MEM_P (DECL_RTL (decl))
&& XEXP (DECL_RTL (decl), 0)
&& GET_CODE (XEXP (DECL_RTL (decl), 0)) == SYMBOL_REF)
SYMBOL_REF_WEAK (XEXP (DECL_RTL (decl), 0)) = 1;
}
void
merge_weak (tree newdecl, tree olddecl)
{
if (DECL_WEAK (newdecl) == DECL_WEAK (olddecl))
{
if (DECL_WEAK (newdecl) && SUPPORTS_WEAK)
{
tree *pwd;
for (pwd = &weak_decls; *pwd; pwd = &TREE_CHAIN (*pwd))
if (TREE_VALUE (*pwd) == newdecl)
{
*pwd = TREE_CHAIN (*pwd);
break;
}
}
return;
}
if (DECL_WEAK (newdecl))
{
tree wd;
if (TREE_ASM_WRITTEN (olddecl))
error ("weak declaration of %q+D must precede definition",
newdecl);
else if (TREE_USED (olddecl)
&& TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (olddecl)))
warning (0, "weak declaration of %q+D after first use results "
"in unspecified behavior", newdecl);
if (SUPPORTS_WEAK)
{
for (wd = weak_decls; wd; wd = TREE_CHAIN (wd))
if (TREE_VALUE (wd) == newdecl)
{
TREE_VALUE (wd) = olddecl;
break;
}
}
mark_weak (olddecl);
}
else
mark_weak (newdecl);
}
void
declare_weak (tree decl)
{
if (! TREE_PUBLIC (decl))
error ("weak declaration of %q+D must be public", decl);
else if (TREE_CODE (decl) == FUNCTION_DECL && TREE_ASM_WRITTEN (decl))
error ("weak declaration of %q+D must precede definition", decl);
else if (SUPPORTS_WEAK)
{
if (! DECL_WEAK (decl))
weak_decls = tree_cons (NULL, decl, weak_decls);
}
else
warning (0, "weak declaration of %q+D not supported", decl);
mark_weak (decl);
}
static void
weak_finish_1 (tree decl)
{
#if defined (ASM_WEAKEN_DECL) || defined (ASM_WEAKEN_LABEL)
const char *const name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
#endif
if (! TREE_USED (decl))
return;
#ifdef ASM_WEAKEN_DECL
ASM_WEAKEN_DECL (asm_out_file, decl, name, NULL);
#else
#ifdef ASM_WEAKEN_LABEL
ASM_WEAKEN_LABEL (asm_out_file, name);
#else
#ifdef ASM_OUTPUT_WEAK_ALIAS
{
static bool warn_once = 0;
if (! warn_once)
{
warning (0, "only weak aliases are supported in this configuration");
warn_once = 1;
}
return;
}
#endif
#endif
#endif
}
static GTY(()) tree weakref_targets;
static tree find_decl_and_mark_needed (tree decl, tree target);
void
weak_finish (void)
{
tree t;
for (t = weakref_targets; t; t = TREE_CHAIN (t))
{
tree alias_decl = TREE_PURPOSE (t);
tree target = ultimate_transparent_alias_target (&TREE_VALUE (t));
if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (alias_decl)))
target = NULL_TREE;
#ifndef ASM_OUTPUT_WEAKREF
else if (! TREE_SYMBOL_REFERENCED (target))
{
# if defined ASM_WEAKEN_LABEL && ! defined ASM_WEAKEN_DECL
ASM_WEAKEN_LABEL (asm_out_file, IDENTIFIER_POINTER (target));
# else
tree decl = find_decl_and_mark_needed (alias_decl, target);
if (! decl)
{
decl = build_decl (TREE_CODE (alias_decl), target,
TREE_TYPE (alias_decl));
DECL_EXTERNAL (decl) = 1;
TREE_PUBLIC (decl) = 1;
DECL_ARTIFICIAL (decl) = 1;
TREE_NOTHROW (decl) = TREE_NOTHROW (alias_decl);
TREE_USED (decl) = 1;
}
weak_finish_1 (decl);
# endif
}
#endif
{
tree *p;
tree t2;
for (p = &weak_decls; (t2 = *p) ; )
{
if (TREE_VALUE (t2) == alias_decl
|| target == DECL_ASSEMBLER_NAME (TREE_VALUE (t2)))
*p = TREE_CHAIN (t2);
else
p = &TREE_CHAIN (t2);
}
for (p = &TREE_CHAIN (t); (t2 = *p) ; )
{
if (target == ultimate_transparent_alias_target (&TREE_VALUE (t2)))
*p = TREE_CHAIN (t2);
else
p = &TREE_CHAIN (t2);
}
}
}
for (t = weak_decls; t; t = TREE_CHAIN (t))
{
tree decl = TREE_VALUE (t);
weak_finish_1 (decl);
}
}
static void
globalize_decl (tree decl)
{
const char *name = XSTR (XEXP (DECL_RTL (decl), 0), 0);
#if defined (ASM_WEAKEN_LABEL) || defined (ASM_WEAKEN_DECL)
if (DECL_WEAK (decl))
{
tree *p, t;
#ifdef ASM_WEAKEN_DECL
ASM_WEAKEN_DECL (asm_out_file, decl, name, 0);
#else
ASM_WEAKEN_LABEL (asm_out_file, name);
#endif
for (p = &weak_decls; (t = *p) ; )
{
if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
*p = TREE_CHAIN (t);
else
p = &TREE_CHAIN (t);
}
for (p = &weakref_targets; (t = *p) ; )
{
if (DECL_ASSEMBLER_NAME (decl)
== ultimate_transparent_alias_target (&TREE_VALUE (t)))
*p = TREE_CHAIN (t);
else
p = &TREE_CHAIN (t);
}
return;
}
#elif defined(ASM_MAKE_LABEL_LINKONCE)
if (DECL_ONE_ONLY (decl))
ASM_MAKE_LABEL_LINKONCE (asm_out_file, name);
#endif
targetm.asm_out.globalize_label (asm_out_file, name);
}
typedef struct alias_pair GTY(())
{
tree decl;
tree target;
} alias_pair;
DEF_VEC_O(alias_pair);
DEF_VEC_ALLOC_O(alias_pair,gc);
static GTY(()) VEC(alias_pair,gc) *alias_pairs;
static tree
find_decl_and_mark_needed (tree decl, tree target)
{
struct cgraph_node *fnode = NULL;
struct cgraph_varpool_node *vnode = NULL;
if (TREE_CODE (decl) == FUNCTION_DECL)
{
fnode = cgraph_node_for_asm (target);
if (fnode == NULL)
vnode = cgraph_varpool_node_for_asm (target);
}
else
{
vnode = cgraph_varpool_node_for_asm (target);
if (vnode == NULL)
fnode = cgraph_node_for_asm (target);
}
if (fnode)
{
if (! cgraph_global_info_ready)
cgraph_mark_needed_node (fnode);
return fnode->decl;
}
else if (vnode)
{
cgraph_varpool_mark_needed_node (vnode);
return vnode->decl;
}
else
return NULL_TREE;
}
static void
do_assemble_alias (tree decl, tree target)
{
if (TREE_ASM_WRITTEN (decl))
return;
TREE_ASM_WRITTEN (decl) = 1;
TREE_ASM_WRITTEN (DECL_ASSEMBLER_NAME (decl)) = 1;
if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
{
ultimate_transparent_alias_target (&target);
if (!TREE_SYMBOL_REFERENCED (target))
weakref_targets = tree_cons (decl, target, weakref_targets);
#ifdef ASM_OUTPUT_WEAKREF
ASM_OUTPUT_WEAKREF (asm_out_file, decl,
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
IDENTIFIER_POINTER (target));
#else
if (!SUPPORTS_WEAK)
{
error ("%Jweakref is not supported in this configuration", decl);
return;
}
#endif
return;
}
#ifdef ASM_OUTPUT_DEF
if (TREE_PUBLIC (decl))
{
globalize_decl (decl);
maybe_assemble_visibility (decl);
}
# ifdef ASM_OUTPUT_DEF_FROM_DECLS
ASM_OUTPUT_DEF_FROM_DECLS (asm_out_file, decl, target);
# else
ASM_OUTPUT_DEF (asm_out_file,
IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)),
IDENTIFIER_POINTER (target));
# endif
#elif defined (ASM_OUTPUT_WEAK_ALIAS) || defined (ASM_WEAKEN_DECL)
{
const char *name;
tree *p, t;
name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
# ifdef ASM_WEAKEN_DECL
ASM_WEAKEN_DECL (asm_out_file, decl, name, IDENTIFIER_POINTER (target));
# else
ASM_OUTPUT_WEAK_ALIAS (asm_out_file, name, IDENTIFIER_POINTER (target));
# endif
for (p = &weak_decls; (t = *p) ; )
if (DECL_ASSEMBLER_NAME (decl) == DECL_ASSEMBLER_NAME (TREE_VALUE (t)))
*p = TREE_CHAIN (t);
else
p = &TREE_CHAIN (t);
for (p = &weakref_targets; (t = *p) ; )
{
if (DECL_ASSEMBLER_NAME (decl)
== ultimate_transparent_alias_target (&TREE_VALUE (t)))
*p = TREE_CHAIN (t);
else
p = &TREE_CHAIN (t);
}
}
#endif
}
void
finish_aliases_1 (void)
{
unsigned i;
alias_pair *p;
for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
{
tree target_decl;
target_decl = find_decl_and_mark_needed (p->decl, p->target);
if (target_decl == NULL)
{
if (! lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)))
error ("%q+D aliased to undefined symbol %qs",
p->decl, IDENTIFIER_POINTER (p->target));
}
else if (DECL_EXTERNAL (target_decl)
&& ! lookup_attribute ("weakref", DECL_ATTRIBUTES (p->decl)))
error ("%q+D aliased to external symbol %qs",
p->decl, IDENTIFIER_POINTER (p->target));
}
}
void
finish_aliases_2 (void)
{
unsigned i;
alias_pair *p;
for (i = 0; VEC_iterate (alias_pair, alias_pairs, i, p); i++)
do_assemble_alias (p->decl, p->target);
VEC_truncate (alias_pair, alias_pairs, 0);
}
void
assemble_alias (tree decl, tree target)
{
tree target_decl;
bool is_weakref = false;
if (lookup_attribute ("weakref", DECL_ATTRIBUTES (decl)))
{
tree alias = DECL_ASSEMBLER_NAME (decl);
is_weakref = true;
ultimate_transparent_alias_target (&target);
if (alias == target)
error ("weakref %q+D ultimately targets itself", decl);
else
{
#ifndef ASM_OUTPUT_WEAKREF
IDENTIFIER_TRANSPARENT_ALIAS (alias) = 1;
TREE_CHAIN (alias) = target;
#endif
}
if (TREE_PUBLIC (decl))
error ("weakref %q+D must have static linkage", decl);
}
else
{
#if !defined (ASM_OUTPUT_DEF)
# if !defined(ASM_OUTPUT_WEAK_ALIAS) && !defined (ASM_WEAKEN_DECL)
error ("%Jalias definitions not supported in this configuration", decl);
return;
# else
if (!DECL_WEAK (decl))
{
error ("%Jonly weak aliases are supported in this configuration", decl);
return;
}
# endif
#endif
}
make_decl_rtl (decl);
TREE_USED (decl) = 1;
if (! is_weakref)
DECL_EXTERNAL (decl) = 0;
if (TREE_CODE (decl) == FUNCTION_DECL)
cgraph_node (decl)->alias = true;
else
cgraph_varpool_node (decl)->alias = true;
target_decl = find_decl_and_mark_needed (decl, target);
if (target_decl && TREE_ASM_WRITTEN (target_decl))
do_assemble_alias (decl, target);
else
{
alias_pair *p = VEC_safe_push (alias_pair, gc, alias_pairs, NULL);
p->decl = decl;
p->target = target;
}
}
void
default_assemble_visibility (tree decl, int vis)
{
static const char * const visibility_types[] = {
NULL, "protected", "hidden", "internal"
};
const char *name, *type;
name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
type = visibility_types[vis];
#ifdef HAVE_GAS_HIDDEN
fprintf (asm_out_file, "\t.%s\t", type);
assemble_name (asm_out_file, name);
fprintf (asm_out_file, "\n");
#else
warning (OPT_Wattributes, "visibility attribute not supported "
"in this configuration; ignored");
#endif
}
static void
maybe_assemble_visibility (tree decl)
{
enum symbol_visibility vis = DECL_VISIBILITY (decl);
if (vis != VISIBILITY_DEFAULT)
targetm.asm_out.visibility (decl, vis);
}
int
supports_one_only (void)
{
if (SUPPORTS_ONE_ONLY)
return 1;
return SUPPORTS_WEAK;
}
void
make_decl_one_only (tree decl)
{
gcc_assert (TREE_CODE (decl) == VAR_DECL
|| TREE_CODE (decl) == FUNCTION_DECL);
TREE_PUBLIC (decl) = 1;
if (SUPPORTS_ONE_ONLY)
{
#ifdef MAKE_DECL_ONE_ONLY
MAKE_DECL_ONE_ONLY (decl);
#endif
DECL_ONE_ONLY (decl) = 1;
}
else if (TREE_CODE (decl) == VAR_DECL
&& (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node))
DECL_COMMON (decl) = 1;
else
{
gcc_assert (SUPPORTS_WEAK);
DECL_WEAK (decl) = 1;
}
}
void
init_varasm_once (void)
{
section_htab = htab_create_ggc (31, section_entry_hash,
section_entry_eq, NULL);
object_block_htab = htab_create_ggc (31, object_block_entry_hash,
object_block_entry_eq, NULL);
const_desc_htab = htab_create_ggc (1009, const_desc_hash,
const_desc_eq, NULL);
const_alias_set = new_alias_set ();
shared_constant_pool = create_constant_pool ();
#ifdef TEXT_SECTION_ASM_OP
text_section = get_unnamed_section (SECTION_CODE, output_section_asm_op,
TEXT_SECTION_ASM_OP);
#endif
#ifdef DATA_SECTION_ASM_OP
data_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
DATA_SECTION_ASM_OP);
#endif
#ifdef SDATA_SECTION_ASM_OP
sdata_section = get_unnamed_section (SECTION_WRITE, output_section_asm_op,
SDATA_SECTION_ASM_OP);
#endif
#ifdef READONLY_DATA_SECTION_ASM_OP
readonly_data_section = get_unnamed_section (0, output_section_asm_op,
READONLY_DATA_SECTION_ASM_OP);
#endif
#ifdef CTORS_SECTION_ASM_OP
ctors_section = get_unnamed_section (0, output_section_asm_op,
CTORS_SECTION_ASM_OP);
#endif
#ifdef DTORS_SECTION_ASM_OP
dtors_section = get_unnamed_section (0, output_section_asm_op,
DTORS_SECTION_ASM_OP);
#endif
#ifdef BSS_SECTION_ASM_OP
bss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
output_section_asm_op,
BSS_SECTION_ASM_OP);
#endif
#ifdef SBSS_SECTION_ASM_OP
sbss_section = get_unnamed_section (SECTION_WRITE | SECTION_BSS,
output_section_asm_op,
SBSS_SECTION_ASM_OP);
#endif
tls_comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
| SECTION_COMMON, emit_tls_common);
lcomm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
| SECTION_COMMON, emit_local);
comm_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS
| SECTION_COMMON, emit_common);
#if defined ASM_OUTPUT_ALIGNED_BSS || defined ASM_OUTPUT_BSS
bss_noswitch_section = get_noswitch_section (SECTION_WRITE | SECTION_BSS,
emit_bss);
#endif
targetm.asm_out.init_sections ();
if (readonly_data_section == NULL)
readonly_data_section = text_section;
}
enum tls_model
decl_default_tls_model (tree decl)
{
enum tls_model kind;
bool is_local;
is_local = targetm.binds_local_p (decl);
if (!flag_shlib)
{
if (is_local)
kind = TLS_MODEL_LOCAL_EXEC;
else
kind = TLS_MODEL_INITIAL_EXEC;
}
else if (optimize && is_local)
kind = TLS_MODEL_LOCAL_DYNAMIC;
else
kind = TLS_MODEL_GLOBAL_DYNAMIC;
if (kind < flag_tls_default)
kind = flag_tls_default;
return kind;
}
unsigned int
default_section_type_flags (tree decl, const char *name, int reloc)
{
unsigned int flags;
if (decl && TREE_CODE (decl) == FUNCTION_DECL)
flags = SECTION_CODE;
else if (decl && decl_readonly_section (decl, reloc))
flags = 0;
else if (current_function_decl
&& cfun
&& cfun->unlikely_text_section_name
&& strcmp (name, cfun->unlikely_text_section_name) == 0)
flags = SECTION_CODE;
else if (!decl
&& (!current_function_decl || !cfun)
&& strcmp (name, UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
flags = SECTION_CODE;
else
flags = SECTION_WRITE;
if (decl && DECL_ONE_ONLY (decl))
flags |= SECTION_LINKONCE;
if (decl && TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL_P (decl))
flags |= SECTION_TLS | SECTION_WRITE;
if (strcmp (name, ".bss") == 0
|| strncmp (name, ".bss.", 5) == 0
|| strncmp (name, ".gnu.linkonce.b.", 16) == 0
|| strcmp (name, ".sbss") == 0
|| strncmp (name, ".sbss.", 6) == 0
|| strncmp (name, ".gnu.linkonce.sb.", 17) == 0)
flags |= SECTION_BSS;
if (strcmp (name, ".tdata") == 0
|| strncmp (name, ".tdata.", 7) == 0
|| strncmp (name, ".gnu.linkonce.td.", 17) == 0)
flags |= SECTION_TLS;
if (strcmp (name, ".tbss") == 0
|| strncmp (name, ".tbss.", 6) == 0
|| strncmp (name, ".gnu.linkonce.tb.", 17) == 0)
flags |= SECTION_TLS | SECTION_BSS;
if (!(flags & (SECTION_CODE | SECTION_BSS | SECTION_TLS))
&& (strcmp (name, ".init_array") == 0
|| strcmp (name, ".fini_array") == 0
|| strcmp (name, ".preinit_array") == 0))
flags |= SECTION_NOTYPE;
return flags;
}
bool
have_global_bss_p (void)
{
return bss_noswitch_section || targetm.have_switchable_bss_sections;
}
void
default_no_named_section (const char *name ATTRIBUTE_UNUSED,
unsigned int flags ATTRIBUTE_UNUSED,
tree decl ATTRIBUTE_UNUSED)
{
gcc_unreachable ();
}
void
default_elf_asm_named_section (const char *name, unsigned int flags,
tree decl ATTRIBUTE_UNUSED)
{
char flagchars[10], *f = flagchars;
if (!(HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
&& (flags & SECTION_DECLARED))
{
fprintf (asm_out_file, "\t.section\t%s\n", name);
return;
}
if (!(flags & SECTION_DEBUG))
*f++ = 'a';
if (flags & SECTION_WRITE)
*f++ = 'w';
if (flags & SECTION_CODE)
*f++ = 'x';
if (flags & SECTION_SMALL)
*f++ = 's';
if (flags & SECTION_MERGE)
*f++ = 'M';
if (flags & SECTION_STRINGS)
*f++ = 'S';
if (flags & SECTION_TLS)
*f++ = 'T';
if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
*f++ = 'G';
*f = '\0';
fprintf (asm_out_file, "\t.section\t%s,\"%s\"", name, flagchars);
if (!(flags & SECTION_NOTYPE))
{
const char *type;
const char *format;
if (flags & SECTION_BSS)
type = "nobits";
else
type = "progbits";
format = ",@%s";
#ifdef ASM_COMMENT_START
if (strcmp (ASM_COMMENT_START, "@") == 0)
format = ",%%%s";
#endif
fprintf (asm_out_file, format, type);
if (flags & SECTION_ENTSIZE)
fprintf (asm_out_file, ",%d", flags & SECTION_ENTSIZE);
if (HAVE_COMDAT_GROUP && (flags & SECTION_LINKONCE))
fprintf (asm_out_file, ",%s,comdat",
lang_hooks.decls.comdat_group (decl));
}
putc ('\n', asm_out_file);
}
void
default_coff_asm_named_section (const char *name, unsigned int flags,
tree decl ATTRIBUTE_UNUSED)
{
char flagchars[8], *f = flagchars;
if (flags & SECTION_WRITE)
*f++ = 'w';
if (flags & SECTION_CODE)
*f++ = 'x';
*f = '\0';
fprintf (asm_out_file, "\t.section\t%s,\"%s\"\n", name, flagchars);
}
void
default_pe_asm_named_section (const char *name, unsigned int flags,
tree decl)
{
default_coff_asm_named_section (name, flags, decl);
if (flags & SECTION_LINKONCE)
{
fprintf (asm_out_file, "\t.linkonce %s\n",
(flags & SECTION_CODE ? "discard" : "same_size"));
}
}
section *
default_select_section (tree decl, int reloc,
unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
{
if (DECL_P (decl))
{
if (decl_readonly_section (decl, reloc))
return readonly_data_section;
}
else if (TREE_CODE (decl) == CONSTRUCTOR)
{
if (! ((flag_pic && reloc)
|| !TREE_READONLY (decl)
|| TREE_SIDE_EFFECTS (decl)
|| !TREE_CONSTANT (decl)))
return readonly_data_section;
}
else if (TREE_CODE (decl) == STRING_CST)
{
if (! flag_writable_strings)
return readonly_data_section;
}
else if (! (flag_pic && reloc))
return readonly_data_section;
return data_section;
}
enum section_category
categorize_decl_for_section (tree decl, int reloc)
{
enum section_category ret;
if (TREE_CODE (decl) == FUNCTION_DECL)
return SECCAT_TEXT;
else if (TREE_CODE (decl) == STRING_CST)
{
if (flag_writable_strings)
return SECCAT_DATA;
if (flag_mudflap)
return SECCAT_RODATA;
else
return SECCAT_RODATA_MERGE_STR;
}
else if (TREE_CODE (decl) == VAR_DECL)
{
if (bss_initializer_p (decl))
ret = SECCAT_BSS;
else if (! TREE_READONLY (decl)
|| TREE_SIDE_EFFECTS (decl)
|| ! TREE_CONSTANT (DECL_INITIAL (decl)))
{
if (reloc & targetm.asm_out.reloc_rw_mask ())
ret = reloc == 1 ? SECCAT_DATA_REL_LOCAL : SECCAT_DATA_REL;
else
ret = SECCAT_DATA;
}
else if (reloc & targetm.asm_out.reloc_rw_mask ())
ret = reloc == 1 ? SECCAT_DATA_REL_RO_LOCAL : SECCAT_DATA_REL_RO;
else if (reloc || flag_merge_constants < 2)
ret = SECCAT_RODATA;
else if (TREE_CODE (DECL_INITIAL (decl)) == STRING_CST)
ret = SECCAT_RODATA_MERGE_STR_INIT;
else
ret = SECCAT_RODATA_MERGE_CONST;
}
else if (TREE_CODE (decl) == CONSTRUCTOR)
{
if ((reloc & targetm.asm_out.reloc_rw_mask ())
|| TREE_SIDE_EFFECTS (decl)
|| ! TREE_CONSTANT (decl))
ret = SECCAT_DATA;
else
ret = SECCAT_RODATA;
}
else
ret = SECCAT_RODATA;
if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL_P (decl))
{
if (ret == SECCAT_BSS
|| (flag_zero_initialized_in_bss
&& initializer_zerop (DECL_INITIAL (decl))))
ret = SECCAT_TBSS;
else
ret = SECCAT_TDATA;
}
else if (targetm.in_small_data_p (decl))
{
if (ret == SECCAT_BSS)
ret = SECCAT_SBSS;
else if (targetm.have_srodata_section && ret == SECCAT_RODATA)
ret = SECCAT_SRODATA;
else
ret = SECCAT_SDATA;
}
return ret;
}
bool
decl_readonly_section (tree decl, int reloc)
{
switch (categorize_decl_for_section (decl, reloc))
{
case SECCAT_RODATA:
case SECCAT_RODATA_MERGE_STR:
case SECCAT_RODATA_MERGE_STR_INIT:
case SECCAT_RODATA_MERGE_CONST:
case SECCAT_SRODATA:
return true;
break;
default:
return false;
break;
}
}
section *
default_elf_select_section (tree decl, int reloc,
unsigned HOST_WIDE_INT align)
{
const char *sname;
switch (categorize_decl_for_section (decl, reloc))
{
case SECCAT_TEXT:
gcc_unreachable ();
case SECCAT_RODATA:
return readonly_data_section;
case SECCAT_RODATA_MERGE_STR:
return mergeable_string_section (decl, align, 0);
case SECCAT_RODATA_MERGE_STR_INIT:
return mergeable_string_section (DECL_INITIAL (decl), align, 0);
case SECCAT_RODATA_MERGE_CONST:
return mergeable_constant_section (DECL_MODE (decl), align, 0);
case SECCAT_SRODATA:
sname = ".sdata2";
break;
case SECCAT_DATA:
return data_section;
case SECCAT_DATA_REL:
sname = ".data.rel";
break;
case SECCAT_DATA_REL_LOCAL:
sname = ".data.rel.local";
break;
case SECCAT_DATA_REL_RO:
sname = ".data.rel.ro";
break;
case SECCAT_DATA_REL_RO_LOCAL:
sname = ".data.rel.ro.local";
break;
case SECCAT_SDATA:
sname = ".sdata";
break;
case SECCAT_TDATA:
sname = ".tdata";
break;
case SECCAT_BSS:
if (bss_section)
return bss_section;
sname = ".bss";
break;
case SECCAT_SBSS:
sname = ".sbss";
break;
case SECCAT_TBSS:
sname = ".tbss";
break;
default:
gcc_unreachable ();
}
if (!DECL_P (decl))
decl = NULL_TREE;
return get_named_section (decl, sname, reloc);
}
void
default_unique_section (tree decl, int reloc)
{
bool one_only = DECL_ONE_ONLY (decl) && !HAVE_COMDAT_GROUP;
const char *prefix, *name;
size_t nlen, plen;
char *string;
switch (categorize_decl_for_section (decl, reloc))
{
case SECCAT_TEXT:
prefix = one_only ? ".gnu.linkonce.t." : ".text.";
break;
case SECCAT_RODATA:
case SECCAT_RODATA_MERGE_STR:
case SECCAT_RODATA_MERGE_STR_INIT:
case SECCAT_RODATA_MERGE_CONST:
prefix = one_only ? ".gnu.linkonce.r." : ".rodata.";
break;
case SECCAT_SRODATA:
prefix = one_only ? ".gnu.linkonce.s2." : ".sdata2.";
break;
case SECCAT_DATA:
prefix = one_only ? ".gnu.linkonce.d." : ".data.";
break;
case SECCAT_DATA_REL:
prefix = one_only ? ".gnu.linkonce.d.rel." : ".data.rel.";
break;
case SECCAT_DATA_REL_LOCAL:
prefix = one_only ? ".gnu.linkonce.d.rel.local." : ".data.rel.local.";
break;
case SECCAT_DATA_REL_RO:
prefix = one_only ? ".gnu.linkonce.d.rel.ro." : ".data.rel.ro.";
break;
case SECCAT_DATA_REL_RO_LOCAL:
prefix = one_only ? ".gnu.linkonce.d.rel.ro.local."
: ".data.rel.ro.local.";
break;
case SECCAT_SDATA:
prefix = one_only ? ".gnu.linkonce.s." : ".sdata.";
break;
case SECCAT_BSS:
prefix = one_only ? ".gnu.linkonce.b." : ".bss.";
break;
case SECCAT_SBSS:
prefix = one_only ? ".gnu.linkonce.sb." : ".sbss.";
break;
case SECCAT_TDATA:
prefix = one_only ? ".gnu.linkonce.td." : ".tdata.";
break;
case SECCAT_TBSS:
prefix = one_only ? ".gnu.linkonce.tb." : ".tbss.";
break;
default:
gcc_unreachable ();
}
plen = strlen (prefix);
name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
name = targetm.strip_name_encoding (name);
nlen = strlen (name);
string = alloca (nlen + plen + 1);
memcpy (string, prefix, plen);
memcpy (string + plen, name, nlen + 1);
DECL_SECTION_NAME (decl) = build_string (nlen + plen, string);
}
static int
compute_reloc_for_rtx_1 (rtx *xp, void *data)
{
int *preloc = data;
rtx x = *xp;
switch (GET_CODE (x))
{
case SYMBOL_REF:
*preloc |= SYMBOL_REF_LOCAL_P (x) ? 1 : 2;
break;
case LABEL_REF:
*preloc |= 1;
break;
default:
break;
}
return 0;
}
static int
compute_reloc_for_rtx (rtx x)
{
int reloc;
switch (GET_CODE (x))
{
case CONST:
case SYMBOL_REF:
case LABEL_REF:
reloc = 0;
for_each_rtx (&x, compute_reloc_for_rtx_1, &reloc);
return reloc;
default:
return 0;
}
}
section *
default_select_rtx_section (enum machine_mode mode ATTRIBUTE_UNUSED,
rtx x,
unsigned HOST_WIDE_INT align ATTRIBUTE_UNUSED)
{
if (compute_reloc_for_rtx (x) & targetm.asm_out.reloc_rw_mask ())
return data_section;
else
return readonly_data_section;
}
section *
default_elf_select_rtx_section (enum machine_mode mode, rtx x,
unsigned HOST_WIDE_INT align)
{
int reloc = compute_reloc_for_rtx (x);
if (reloc & targetm.asm_out.reloc_rw_mask ())
{
if (reloc == 1)
return get_named_section (NULL, ".data.rel.ro.local", 1);
else
return get_named_section (NULL, ".data.rel.ro", 3);
}
return mergeable_constant_section (mode, align, 0);
}
void
default_encode_section_info (tree decl, rtx rtl, int first ATTRIBUTE_UNUSED)
{
rtx symbol;
int flags;
if (!MEM_P (rtl))
return;
symbol = XEXP (rtl, 0);
if (GET_CODE (symbol) != SYMBOL_REF)
return;
flags = SYMBOL_REF_FLAGS (symbol) & SYMBOL_FLAG_HAS_BLOCK_INFO;
if (TREE_CODE (decl) == FUNCTION_DECL)
flags |= SYMBOL_FLAG_FUNCTION;
if (targetm.binds_local_p (decl))
flags |= SYMBOL_FLAG_LOCAL;
if (TREE_CODE (decl) == VAR_DECL && DECL_THREAD_LOCAL_P (decl))
flags |= DECL_TLS_MODEL (decl) << SYMBOL_FLAG_TLS_SHIFT;
else if (targetm.in_small_data_p (decl))
flags |= SYMBOL_FLAG_SMALL;
if (DECL_P (decl) && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl))
flags |= SYMBOL_FLAG_EXTERNAL;
SYMBOL_REF_FLAGS (symbol) = flags;
}
const char *
default_strip_name_encoding (const char *str)
{
return str + (*str == '*');
}
#ifdef ASM_OUTPUT_DEF
void
default_asm_output_anchor (rtx symbol)
{
char buffer[100];
sprintf (buffer, ". + " HOST_WIDE_INT_PRINT_DEC,
SYMBOL_REF_BLOCK_OFFSET (symbol));
ASM_OUTPUT_DEF (asm_out_file, XSTR (symbol, 0), buffer);
}
#endif
bool
default_use_anchors_for_symbol_p (rtx symbol)
{
section *sect;
tree decl;
sect = SYMBOL_REF_BLOCK (symbol)->sect;
if (sect->common.flags & SECTION_MERGE)
return false;
if (sect->common.flags & SECTION_SMALL)
return false;
decl = SYMBOL_REF_DECL (symbol);
if (decl && DECL_P (decl))
{
if (!targetm.binds_local_p (decl))
return false;
if (targetm.in_small_data_p (decl))
return false;
}
return true;
}
bool
default_binds_local_p (tree exp)
{
return default_binds_local_p_1 (exp, flag_shlib);
}
bool
default_binds_local_p_1 (tree exp, int shlib)
{
bool local_p;
if (!DECL_P (exp))
local_p = true;
else if (lookup_attribute ("weakref", DECL_ATTRIBUTES (exp)))
local_p = false;
else if (! TREE_PUBLIC (exp))
local_p = true;
else if (DECL_VISIBILITY_SPECIFIED (exp)
&& DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
local_p = true;
else if (DECL_EXTERNAL (exp))
local_p = false;
else if (DECL_VISIBILITY (exp) != VISIBILITY_DEFAULT)
local_p = true;
else if (DECL_WEAK (exp))
local_p = false;
else if (shlib)
local_p = false;
else if (DECL_COMMON (exp)
&& (DECL_INITIAL (exp) == NULL
|| DECL_INITIAL (exp) == error_mark_node))
local_p = false;
else
local_p = true;
return local_p;
}
bool
default_valid_pointer_mode (enum machine_mode mode)
{
return (mode == ptr_mode || mode == Pmode);
}
#ifdef GLOBAL_ASM_OP
void
default_globalize_label (FILE * stream, const char *name)
{
fputs (GLOBAL_ASM_OP, stream);
assemble_name (stream, name);
putc ('\n', stream);
}
#endif
void
default_emit_unwind_label (FILE * stream ATTRIBUTE_UNUSED,
tree decl ATTRIBUTE_UNUSED,
int for_eh ATTRIBUTE_UNUSED,
int empty ATTRIBUTE_UNUSED)
{
}
void
default_emit_except_table_label (FILE * stream ATTRIBUTE_UNUSED)
{
}
void
default_internal_label (FILE *stream, const char *prefix,
unsigned long labelno)
{
char *const buf = alloca (40 + strlen (prefix));
ASM_GENERATE_INTERNAL_LABEL (buf, prefix, labelno);
ASM_OUTPUT_INTERNAL_LABEL (stream, buf);
}
void
default_file_start (void)
{
if (targetm.file_start_app_off && !flag_verbose_asm)
fputs (ASM_APP_OFF, asm_out_file);
if (targetm.file_start_file_directive)
output_file_directive (asm_out_file, main_input_filename);
}
int trampolines_created;
void
file_end_indicate_exec_stack (void)
{
unsigned int flags = SECTION_DEBUG;
if (trampolines_created)
flags |= SECTION_CODE;
switch_to_section (get_section (".note.GNU-stack", flags, NULL));
}
void
output_section_asm_op (const void *directive)
{
fprintf (asm_out_file, "%s\n", (const char *) directive);
}
void
switch_to_section (section *new_section)
{
if (in_section == new_section)
return;
if (new_section->common.flags & SECTION_FORGET)
in_section = NULL;
else
in_section = new_section;
switch (SECTION_STYLE (new_section))
{
case SECTION_NAMED:
if (cfun
&& !cfun->unlikely_text_section_name
&& strcmp (new_section->named.name,
UNLIKELY_EXECUTED_TEXT_SECTION_NAME) == 0)
cfun->unlikely_text_section_name = UNLIKELY_EXECUTED_TEXT_SECTION_NAME;
targetm.asm_out.named_section (new_section->named.name,
new_section->named.common.flags,
new_section->named.decl);
break;
case SECTION_UNNAMED:
new_section->unnamed.callback (new_section->unnamed.data);
break;
case SECTION_NOSWITCH:
gcc_unreachable ();
break;
}
new_section->common.flags |= SECTION_DECLARED;
}
void
place_block_symbol (rtx symbol)
{
unsigned HOST_WIDE_INT size, mask, offset;
struct constant_descriptor_rtx *desc;
unsigned int alignment;
struct object_block *block;
tree decl;
gcc_assert (SYMBOL_REF_BLOCK (symbol));
if (SYMBOL_REF_BLOCK_OFFSET (symbol) >= 0)
return;
if (CONSTANT_POOL_ADDRESS_P (symbol))
{
desc = SYMBOL_REF_CONSTANT (symbol);
alignment = desc->align;
size = GET_MODE_SIZE (desc->mode);
}
else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
{
decl = SYMBOL_REF_DECL (symbol);
alignment = get_constant_alignment (decl);
size = get_constant_size (decl);
}
else
{
decl = SYMBOL_REF_DECL (symbol);
alignment = DECL_ALIGN (decl);
size = tree_low_cst (DECL_SIZE_UNIT (decl), 1);
}
block = SYMBOL_REF_BLOCK (symbol);
mask = alignment / BITS_PER_UNIT - 1;
offset = (block->size + mask) & ~mask;
SYMBOL_REF_BLOCK_OFFSET (symbol) = offset;
block->alignment = MAX (block->alignment, alignment);
block->size = offset + size;
VEC_safe_push (rtx, gc, block->objects, symbol);
}
rtx
get_section_anchor (struct object_block *block, HOST_WIDE_INT offset,
enum tls_model model)
{
char label[100];
unsigned int begin, middle, end;
unsigned HOST_WIDE_INT min_offset, max_offset, range, bias, delta;
rtx anchor;
max_offset = (unsigned HOST_WIDE_INT) targetm.max_anchor_offset;
min_offset = (unsigned HOST_WIDE_INT) targetm.min_anchor_offset;
range = max_offset - min_offset + 1;
if (range == 0)
offset = 0;
else
{
bias = 1 << (GET_MODE_BITSIZE (ptr_mode) - 1);
if (offset < 0)
{
delta = -(unsigned HOST_WIDE_INT) offset + max_offset;
delta -= delta % range;
if (delta > bias)
delta = bias;
offset = (HOST_WIDE_INT) (-delta);
}
else
{
delta = (unsigned HOST_WIDE_INT) offset - min_offset;
delta -= delta % range;
if (delta > bias - 1)
delta = bias - 1;
offset = (HOST_WIDE_INT) delta;
}
}
begin = 0;
end = VEC_length (rtx, block->anchors);
while (begin != end)
{
middle = (end + begin) / 2;
anchor = VEC_index (rtx, block->anchors, middle);
if (SYMBOL_REF_BLOCK_OFFSET (anchor) > offset)
end = middle;
else if (SYMBOL_REF_BLOCK_OFFSET (anchor) < offset)
begin = middle + 1;
else if (SYMBOL_REF_TLS_MODEL (anchor) > model)
end = middle;
else if (SYMBOL_REF_TLS_MODEL (anchor) < model)
begin = middle + 1;
else
return anchor;
}
ASM_GENERATE_INTERNAL_LABEL (label, "LANCHOR", anchor_labelno++);
anchor = create_block_symbol (ggc_strdup (label), block, offset);
SYMBOL_REF_FLAGS (anchor) |= SYMBOL_FLAG_LOCAL | SYMBOL_FLAG_ANCHOR;
SYMBOL_REF_FLAGS (anchor) |= model << SYMBOL_FLAG_TLS_SHIFT;
VEC_safe_insert (rtx, gc, block->anchors, begin, anchor);
return anchor;
}
static void
output_object_block (struct object_block *block)
{
struct constant_descriptor_rtx *desc;
unsigned int i;
HOST_WIDE_INT offset;
tree decl;
rtx symbol;
if (block->objects == NULL)
return;
switch_to_section (block->sect);
assemble_align (block->alignment);
for (i = 0; VEC_iterate (rtx, block->anchors, i, symbol); i++)
targetm.asm_out.output_anchor (symbol);
offset = 0;
for (i = 0; VEC_iterate (rtx, block->objects, i, symbol); i++)
{
assemble_zeros (SYMBOL_REF_BLOCK_OFFSET (symbol) - offset);
offset = SYMBOL_REF_BLOCK_OFFSET (symbol);
if (CONSTANT_POOL_ADDRESS_P (symbol))
{
desc = SYMBOL_REF_CONSTANT (symbol);
output_constant_pool_1 (desc, 1);
offset += GET_MODE_SIZE (desc->mode);
}
else if (TREE_CONSTANT_POOL_ADDRESS_P (symbol))
{
decl = SYMBOL_REF_DECL (symbol);
assemble_constant_contents (decl, XSTR (symbol, 0),
get_constant_alignment (decl));
offset += get_constant_size (decl);
}
else
{
decl = SYMBOL_REF_DECL (symbol);
assemble_variable_contents (decl, XSTR (symbol, 0), false);
offset += tree_low_cst (DECL_SIZE_UNIT (decl), 1);
}
}
}
static int
output_object_block_htab (void **slot, void *data ATTRIBUTE_UNUSED)
{
output_object_block ((struct object_block *) (*slot));
return 1;
}
void
output_object_blocks (void)
{
htab_traverse (object_block_htab, output_object_block_htab, NULL);
}
#include "gt-varasm.h"