/* SEC_MERGE support.
|
/* SEC_MERGE support.
|
Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Copyright 2001, 2002, 2003, 2004, 2005, 2006, 2007
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
Written by Jakub Jelinek <jakub@redhat.com>.
|
Written by Jakub Jelinek <jakub@redhat.com>.
|
|
|
This file is part of BFD, the Binary File Descriptor library.
|
This file is part of BFD, the Binary File Descriptor library.
|
|
|
This program is free software; you can redistribute it and/or modify
|
This program is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
|
MA 02110-1301, USA. */
|
MA 02110-1301, USA. */
|
|
|
|
|
/* This file contains support for merging duplicate entities within sections,
|
/* This file contains support for merging duplicate entities within sections,
|
as used in ELF SHF_MERGE. */
|
as used in ELF SHF_MERGE. */
|
|
|
#include "sysdep.h"
|
#include "sysdep.h"
|
#include "bfd.h"
|
#include "bfd.h"
|
#include "libbfd.h"
|
#include "libbfd.h"
|
#include "hashtab.h"
|
#include "hashtab.h"
|
#include "libiberty.h"
|
#include "libiberty.h"
|
|
|
struct sec_merge_sec_info;
|
struct sec_merge_sec_info;
|
|
|
/* An entry in the section merge hash table. */
|
/* An entry in the section merge hash table. */
|
|
|
struct sec_merge_hash_entry
|
struct sec_merge_hash_entry
|
{
|
{
|
struct bfd_hash_entry root;
|
struct bfd_hash_entry root;
|
/* Length of this entry. This includes the zero terminator. */
|
/* Length of this entry. This includes the zero terminator. */
|
unsigned int len;
|
unsigned int len;
|
/* Start of this string needs to be aligned to
|
/* Start of this string needs to be aligned to
|
alignment octets (not 1 << align). */
|
alignment octets (not 1 << align). */
|
unsigned int alignment;
|
unsigned int alignment;
|
union
|
union
|
{
|
{
|
/* Index within the merged section. */
|
/* Index within the merged section. */
|
bfd_size_type index;
|
bfd_size_type index;
|
/* Entry this is a suffix of (if alignment is 0). */
|
/* Entry this is a suffix of (if alignment is 0). */
|
struct sec_merge_hash_entry *suffix;
|
struct sec_merge_hash_entry *suffix;
|
} u;
|
} u;
|
/* Which section is it in. */
|
/* Which section is it in. */
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_sec_info *secinfo;
|
/* Next entity in the hash table. */
|
/* Next entity in the hash table. */
|
struct sec_merge_hash_entry *next;
|
struct sec_merge_hash_entry *next;
|
};
|
};
|
|
|
/* The section merge hash table. */
|
/* The section merge hash table. */
|
|
|
struct sec_merge_hash
|
struct sec_merge_hash
|
{
|
{
|
struct bfd_hash_table table;
|
struct bfd_hash_table table;
|
/* Next available index. */
|
/* Next available index. */
|
bfd_size_type size;
|
bfd_size_type size;
|
/* First entity in the SEC_MERGE sections of this type. */
|
/* First entity in the SEC_MERGE sections of this type. */
|
struct sec_merge_hash_entry *first;
|
struct sec_merge_hash_entry *first;
|
/* Last entity in the SEC_MERGE sections of this type. */
|
/* Last entity in the SEC_MERGE sections of this type. */
|
struct sec_merge_hash_entry *last;
|
struct sec_merge_hash_entry *last;
|
/* Entity size. */
|
/* Entity size. */
|
unsigned int entsize;
|
unsigned int entsize;
|
/* Are entries fixed size or zero terminated strings? */
|
/* Are entries fixed size or zero terminated strings? */
|
bfd_boolean strings;
|
bfd_boolean strings;
|
};
|
};
|
|
|
struct sec_merge_info
|
struct sec_merge_info
|
{
|
{
|
/* Chain of sec_merge_infos. */
|
/* Chain of sec_merge_infos. */
|
struct sec_merge_info *next;
|
struct sec_merge_info *next;
|
/* Chain of sec_merge_sec_infos. */
|
/* Chain of sec_merge_sec_infos. */
|
struct sec_merge_sec_info *chain;
|
struct sec_merge_sec_info *chain;
|
/* A hash table used to hold section content. */
|
/* A hash table used to hold section content. */
|
struct sec_merge_hash *htab;
|
struct sec_merge_hash *htab;
|
};
|
};
|
|
|
struct sec_merge_sec_info
|
struct sec_merge_sec_info
|
{
|
{
|
/* Chain of sec_merge_sec_infos. */
|
/* Chain of sec_merge_sec_infos. */
|
struct sec_merge_sec_info *next;
|
struct sec_merge_sec_info *next;
|
/* The corresponding section. */
|
/* The corresponding section. */
|
asection *sec;
|
asection *sec;
|
/* Pointer to merge_info pointing to us. */
|
/* Pointer to merge_info pointing to us. */
|
void **psecinfo;
|
void **psecinfo;
|
/* A hash table used to hold section content. */
|
/* A hash table used to hold section content. */
|
struct sec_merge_hash *htab;
|
struct sec_merge_hash *htab;
|
/* First string in this section. */
|
/* First string in this section. */
|
struct sec_merge_hash_entry *first_str;
|
struct sec_merge_hash_entry *first_str;
|
/* Original section content. */
|
/* Original section content. */
|
unsigned char contents[1];
|
unsigned char contents[1];
|
};
|
};
|
|
|
|
|
/* Routine to create an entry in a section merge hashtab. */
|
/* Routine to create an entry in a section merge hashtab. */
|
|
|
static struct bfd_hash_entry *
|
static struct bfd_hash_entry *
|
sec_merge_hash_newfunc (struct bfd_hash_entry *entry,
|
sec_merge_hash_newfunc (struct bfd_hash_entry *entry,
|
struct bfd_hash_table *table, const char *string)
|
struct bfd_hash_table *table, const char *string)
|
{
|
{
|
/* Allocate the structure if it has not already been allocated by a
|
/* Allocate the structure if it has not already been allocated by a
|
subclass. */
|
subclass. */
|
if (entry == NULL)
|
if (entry == NULL)
|
entry = bfd_hash_allocate (table, sizeof (struct sec_merge_hash_entry));
|
entry = bfd_hash_allocate (table, sizeof (struct sec_merge_hash_entry));
|
if (entry == NULL)
|
if (entry == NULL)
|
return NULL;
|
return NULL;
|
|
|
/* Call the allocation method of the superclass. */
|
/* Call the allocation method of the superclass. */
|
entry = bfd_hash_newfunc (entry, table, string);
|
entry = bfd_hash_newfunc (entry, table, string);
|
|
|
if (entry != NULL)
|
if (entry != NULL)
|
{
|
{
|
/* Initialize the local fields. */
|
/* Initialize the local fields. */
|
struct sec_merge_hash_entry *ret = (struct sec_merge_hash_entry *) entry;
|
struct sec_merge_hash_entry *ret = (struct sec_merge_hash_entry *) entry;
|
|
|
ret->u.suffix = NULL;
|
ret->u.suffix = NULL;
|
ret->alignment = 0;
|
ret->alignment = 0;
|
ret->secinfo = NULL;
|
ret->secinfo = NULL;
|
ret->next = NULL;
|
ret->next = NULL;
|
}
|
}
|
|
|
return entry;
|
return entry;
|
}
|
}
|
|
|
/* Look up an entry in a section merge hash table. */
|
/* Look up an entry in a section merge hash table. */
|
|
|
static struct sec_merge_hash_entry *
|
static struct sec_merge_hash_entry *
|
sec_merge_hash_lookup (struct sec_merge_hash *table, const char *string,
|
sec_merge_hash_lookup (struct sec_merge_hash *table, const char *string,
|
unsigned int alignment, bfd_boolean create)
|
unsigned int alignment, bfd_boolean create)
|
{
|
{
|
register const unsigned char *s;
|
register const unsigned char *s;
|
register unsigned long hash;
|
register unsigned long hash;
|
register unsigned int c;
|
register unsigned int c;
|
struct sec_merge_hash_entry *hashp;
|
struct sec_merge_hash_entry *hashp;
|
unsigned int len, i;
|
unsigned int len, i;
|
unsigned int index;
|
unsigned int index;
|
|
|
hash = 0;
|
hash = 0;
|
len = 0;
|
len = 0;
|
s = (const unsigned char *) string;
|
s = (const unsigned char *) string;
|
if (table->strings)
|
if (table->strings)
|
{
|
{
|
if (table->entsize == 1)
|
if (table->entsize == 1)
|
{
|
{
|
while ((c = *s++) != '\0')
|
while ((c = *s++) != '\0')
|
{
|
{
|
hash += c + (c << 17);
|
hash += c + (c << 17);
|
hash ^= hash >> 2;
|
hash ^= hash >> 2;
|
++len;
|
++len;
|
}
|
}
|
hash += len + (len << 17);
|
hash += len + (len << 17);
|
}
|
}
|
else
|
else
|
{
|
{
|
for (;;)
|
for (;;)
|
{
|
{
|
for (i = 0; i < table->entsize; ++i)
|
for (i = 0; i < table->entsize; ++i)
|
if (s[i] != '\0')
|
if (s[i] != '\0')
|
break;
|
break;
|
if (i == table->entsize)
|
if (i == table->entsize)
|
break;
|
break;
|
for (i = 0; i < table->entsize; ++i)
|
for (i = 0; i < table->entsize; ++i)
|
{
|
{
|
c = *s++;
|
c = *s++;
|
hash += c + (c << 17);
|
hash += c + (c << 17);
|
hash ^= hash >> 2;
|
hash ^= hash >> 2;
|
}
|
}
|
++len;
|
++len;
|
}
|
}
|
hash += len + (len << 17);
|
hash += len + (len << 17);
|
len *= table->entsize;
|
len *= table->entsize;
|
}
|
}
|
hash ^= hash >> 2;
|
hash ^= hash >> 2;
|
len += table->entsize;
|
len += table->entsize;
|
}
|
}
|
else
|
else
|
{
|
{
|
for (i = 0; i < table->entsize; ++i)
|
for (i = 0; i < table->entsize; ++i)
|
{
|
{
|
c = *s++;
|
c = *s++;
|
hash += c + (c << 17);
|
hash += c + (c << 17);
|
hash ^= hash >> 2;
|
hash ^= hash >> 2;
|
}
|
}
|
len = table->entsize;
|
len = table->entsize;
|
}
|
}
|
|
|
index = hash % table->table.size;
|
index = hash % table->table.size;
|
for (hashp = (struct sec_merge_hash_entry *) table->table.table[index];
|
for (hashp = (struct sec_merge_hash_entry *) table->table.table[index];
|
hashp != NULL;
|
hashp != NULL;
|
hashp = (struct sec_merge_hash_entry *) hashp->root.next)
|
hashp = (struct sec_merge_hash_entry *) hashp->root.next)
|
{
|
{
|
if (hashp->root.hash == hash
|
if (hashp->root.hash == hash
|
&& len == hashp->len
|
&& len == hashp->len
|
&& memcmp (hashp->root.string, string, len) == 0)
|
&& memcmp (hashp->root.string, string, len) == 0)
|
{
|
{
|
/* If the string we found does not have at least the required
|
/* If the string we found does not have at least the required
|
alignment, we need to insert another copy. */
|
alignment, we need to insert another copy. */
|
if (hashp->alignment < alignment)
|
if (hashp->alignment < alignment)
|
{
|
{
|
if (create)
|
if (create)
|
{
|
{
|
/* Mark the less aligned copy as deleted. */
|
/* Mark the less aligned copy as deleted. */
|
hashp->len = 0;
|
hashp->len = 0;
|
hashp->alignment = 0;
|
hashp->alignment = 0;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
return hashp;
|
return hashp;
|
}
|
}
|
}
|
}
|
|
|
if (! create)
|
if (! create)
|
return NULL;
|
return NULL;
|
|
|
hashp = ((struct sec_merge_hash_entry *)
|
hashp = ((struct sec_merge_hash_entry *)
|
bfd_hash_insert (&table->table, string, hash));
|
bfd_hash_insert (&table->table, string, hash));
|
if (hashp == NULL)
|
if (hashp == NULL)
|
return NULL;
|
return NULL;
|
hashp->len = len;
|
hashp->len = len;
|
hashp->alignment = alignment;
|
hashp->alignment = alignment;
|
return hashp;
|
return hashp;
|
}
|
}
|
|
|
/* Create a new hash table. */
|
/* Create a new hash table. */
|
|
|
static struct sec_merge_hash *
|
static struct sec_merge_hash *
|
sec_merge_init (unsigned int entsize, bfd_boolean strings)
|
sec_merge_init (unsigned int entsize, bfd_boolean strings)
|
{
|
{
|
struct sec_merge_hash *table;
|
struct sec_merge_hash *table;
|
|
|
table = bfd_malloc (sizeof (struct sec_merge_hash));
|
table = bfd_malloc (sizeof (struct sec_merge_hash));
|
if (table == NULL)
|
if (table == NULL)
|
return NULL;
|
return NULL;
|
|
|
if (! bfd_hash_table_init_n (&table->table, sec_merge_hash_newfunc,
|
if (! bfd_hash_table_init_n (&table->table, sec_merge_hash_newfunc,
|
sizeof (struct sec_merge_hash_entry), 16699))
|
sizeof (struct sec_merge_hash_entry), 16699))
|
{
|
{
|
free (table);
|
free (table);
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
table->size = 0;
|
table->size = 0;
|
table->first = NULL;
|
table->first = NULL;
|
table->last = NULL;
|
table->last = NULL;
|
table->entsize = entsize;
|
table->entsize = entsize;
|
table->strings = strings;
|
table->strings = strings;
|
|
|
return table;
|
return table;
|
}
|
}
|
|
|
/* Get the index of an entity in a hash table, adding it if it is not
|
/* Get the index of an entity in a hash table, adding it if it is not
|
already present. */
|
already present. */
|
|
|
static struct sec_merge_hash_entry *
|
static struct sec_merge_hash_entry *
|
sec_merge_add (struct sec_merge_hash *tab, const char *str,
|
sec_merge_add (struct sec_merge_hash *tab, const char *str,
|
unsigned int alignment, struct sec_merge_sec_info *secinfo)
|
unsigned int alignment, struct sec_merge_sec_info *secinfo)
|
{
|
{
|
register struct sec_merge_hash_entry *entry;
|
register struct sec_merge_hash_entry *entry;
|
|
|
entry = sec_merge_hash_lookup (tab, str, alignment, TRUE);
|
entry = sec_merge_hash_lookup (tab, str, alignment, TRUE);
|
if (entry == NULL)
|
if (entry == NULL)
|
return NULL;
|
return NULL;
|
|
|
if (entry->secinfo == NULL)
|
if (entry->secinfo == NULL)
|
{
|
{
|
tab->size++;
|
tab->size++;
|
entry->secinfo = secinfo;
|
entry->secinfo = secinfo;
|
if (tab->first == NULL)
|
if (tab->first == NULL)
|
tab->first = entry;
|
tab->first = entry;
|
else
|
else
|
tab->last->next = entry;
|
tab->last->next = entry;
|
tab->last = entry;
|
tab->last = entry;
|
}
|
}
|
|
|
return entry;
|
return entry;
|
}
|
}
|
|
|
static bfd_boolean
|
static bfd_boolean
|
sec_merge_emit (bfd *abfd, struct sec_merge_hash_entry *entry)
|
sec_merge_emit (bfd *abfd, struct sec_merge_hash_entry *entry)
|
{
|
{
|
struct sec_merge_sec_info *secinfo = entry->secinfo;
|
struct sec_merge_sec_info *secinfo = entry->secinfo;
|
asection *sec = secinfo->sec;
|
asection *sec = secinfo->sec;
|
char *pad = NULL;
|
char *pad = NULL;
|
bfd_size_type off = 0;
|
bfd_size_type off = 0;
|
int alignment_power = sec->output_section->alignment_power;
|
int alignment_power = sec->output_section->alignment_power;
|
|
|
if (alignment_power)
|
if (alignment_power)
|
{
|
{
|
pad = bfd_zmalloc ((bfd_size_type) 1 << alignment_power);
|
pad = bfd_zmalloc ((bfd_size_type) 1 << alignment_power);
|
if (pad == NULL)
|
if (pad == NULL)
|
return FALSE;
|
return FALSE;
|
}
|
}
|
|
|
for (; entry != NULL && entry->secinfo == secinfo; entry = entry->next)
|
for (; entry != NULL && entry->secinfo == secinfo; entry = entry->next)
|
{
|
{
|
const char *str;
|
const char *str;
|
bfd_size_type len;
|
bfd_size_type len;
|
|
|
len = -off & (entry->alignment - 1);
|
len = -off & (entry->alignment - 1);
|
if (len != 0)
|
if (len != 0)
|
{
|
{
|
if (bfd_bwrite (pad, len, abfd) != len)
|
if (bfd_bwrite (pad, len, abfd) != len)
|
goto err;
|
goto err;
|
off += len;
|
off += len;
|
}
|
}
|
|
|
str = entry->root.string;
|
str = entry->root.string;
|
len = entry->len;
|
len = entry->len;
|
|
|
if (bfd_bwrite (str, len, abfd) != len)
|
if (bfd_bwrite (str, len, abfd) != len)
|
goto err;
|
goto err;
|
|
|
off += len;
|
off += len;
|
}
|
}
|
|
|
/* Trailing alignment needed? */
|
/* Trailing alignment needed? */
|
off = sec->size - off;
|
off = sec->size - off;
|
if (off != 0
|
if (off != 0
|
&& bfd_bwrite (pad, off, abfd) != off)
|
&& bfd_bwrite (pad, off, abfd) != off)
|
goto err;
|
goto err;
|
|
|
if (pad != NULL)
|
if (pad != NULL)
|
free (pad);
|
free (pad);
|
return TRUE;
|
return TRUE;
|
|
|
err:
|
err:
|
if (pad != NULL)
|
if (pad != NULL)
|
free (pad);
|
free (pad);
|
return FALSE;
|
return FALSE;
|
}
|
}
|
|
|
/* Register a SEC_MERGE section as a candidate for merging.
|
/* Register a SEC_MERGE section as a candidate for merging.
|
This function is called for all non-dynamic SEC_MERGE input sections. */
|
This function is called for all non-dynamic SEC_MERGE input sections. */
|
|
|
bfd_boolean
|
bfd_boolean
|
_bfd_add_merge_section (bfd *abfd, void **psinfo, asection *sec,
|
_bfd_add_merge_section (bfd *abfd, void **psinfo, asection *sec,
|
void **psecinfo)
|
void **psecinfo)
|
{
|
{
|
struct sec_merge_info *sinfo;
|
struct sec_merge_info *sinfo;
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_sec_info *secinfo;
|
unsigned int align;
|
unsigned int align;
|
bfd_size_type amt;
|
bfd_size_type amt;
|
|
|
if ((abfd->flags & DYNAMIC) != 0
|
if ((abfd->flags & DYNAMIC) != 0
|
|| (sec->flags & SEC_MERGE) == 0)
|
|| (sec->flags & SEC_MERGE) == 0)
|
abort ();
|
abort ();
|
|
|
if (sec->size == 0
|
if (sec->size == 0
|
|| (sec->flags & SEC_EXCLUDE) != 0
|
|| (sec->flags & SEC_EXCLUDE) != 0
|
|| sec->entsize == 0)
|
|| sec->entsize == 0)
|
return TRUE;
|
return TRUE;
|
|
|
if ((sec->flags & SEC_RELOC) != 0)
|
if ((sec->flags & SEC_RELOC) != 0)
|
{
|
{
|
/* We aren't prepared to handle relocations in merged sections. */
|
/* We aren't prepared to handle relocations in merged sections. */
|
return TRUE;
|
return TRUE;
|
}
|
}
|
|
|
align = sec->alignment_power;
|
align = sec->alignment_power;
|
if ((sec->entsize < (unsigned) 1 << align
|
if ((sec->entsize < (unsigned) 1 << align
|
&& ((sec->entsize & (sec->entsize - 1))
|
&& ((sec->entsize & (sec->entsize - 1))
|
|| !(sec->flags & SEC_STRINGS)))
|
|| !(sec->flags & SEC_STRINGS)))
|
|| (sec->entsize > (unsigned) 1 << align
|
|| (sec->entsize > (unsigned) 1 << align
|
&& (sec->entsize & (((unsigned) 1 << align) - 1))))
|
&& (sec->entsize & (((unsigned) 1 << align) - 1))))
|
{
|
{
|
/* Sanity check. If string character size is smaller than
|
/* Sanity check. If string character size is smaller than
|
alignment, then we require character size to be a power
|
alignment, then we require character size to be a power
|
of 2, otherwise character size must be integer multiple
|
of 2, otherwise character size must be integer multiple
|
of alignment. For non-string constants, alignment must
|
of alignment. For non-string constants, alignment must
|
be smaller than or equal to entity size and entity size
|
be smaller than or equal to entity size and entity size
|
must be integer multiple of alignment. */
|
must be integer multiple of alignment. */
|
return TRUE;
|
return TRUE;
|
}
|
}
|
|
|
for (sinfo = (struct sec_merge_info *) *psinfo; sinfo; sinfo = sinfo->next)
|
for (sinfo = (struct sec_merge_info *) *psinfo; sinfo; sinfo = sinfo->next)
|
if ((secinfo = sinfo->chain)
|
if ((secinfo = sinfo->chain)
|
&& ! ((secinfo->sec->flags ^ sec->flags) & (SEC_MERGE | SEC_STRINGS))
|
&& ! ((secinfo->sec->flags ^ sec->flags) & (SEC_MERGE | SEC_STRINGS))
|
&& secinfo->sec->entsize == sec->entsize
|
&& secinfo->sec->entsize == sec->entsize
|
&& secinfo->sec->alignment_power == sec->alignment_power
|
&& secinfo->sec->alignment_power == sec->alignment_power
|
&& secinfo->sec->output_section == sec->output_section)
|
&& secinfo->sec->output_section == sec->output_section)
|
break;
|
break;
|
|
|
if (sinfo == NULL)
|
if (sinfo == NULL)
|
{
|
{
|
/* Initialize the information we need to keep track of. */
|
/* Initialize the information we need to keep track of. */
|
sinfo = bfd_alloc (abfd, sizeof (struct sec_merge_info));
|
sinfo = bfd_alloc (abfd, sizeof (struct sec_merge_info));
|
if (sinfo == NULL)
|
if (sinfo == NULL)
|
goto error_return;
|
goto error_return;
|
sinfo->next = (struct sec_merge_info *) *psinfo;
|
sinfo->next = (struct sec_merge_info *) *psinfo;
|
sinfo->chain = NULL;
|
sinfo->chain = NULL;
|
*psinfo = sinfo;
|
*psinfo = sinfo;
|
sinfo->htab = sec_merge_init (sec->entsize, (sec->flags & SEC_STRINGS));
|
sinfo->htab = sec_merge_init (sec->entsize, (sec->flags & SEC_STRINGS));
|
if (sinfo->htab == NULL)
|
if (sinfo->htab == NULL)
|
goto error_return;
|
goto error_return;
|
}
|
}
|
|
|
/* Read the section from abfd. */
|
/* Read the section from abfd. */
|
|
|
amt = sizeof (struct sec_merge_sec_info) - 1 + sec->size;
|
amt = sizeof (struct sec_merge_sec_info) - 1 + sec->size;
|
if (sec->flags & SEC_STRINGS)
|
if (sec->flags & SEC_STRINGS)
|
/* Some versions of gcc may emit a string without a zero terminator.
|
/* Some versions of gcc may emit a string without a zero terminator.
|
See http://gcc.gnu.org/ml/gcc-patches/2006-06/msg01004.html
|
See http://gcc.gnu.org/ml/gcc-patches/2006-06/msg01004.html
|
Allocate space for an extra zero. */
|
Allocate space for an extra zero. */
|
amt += sec->entsize;
|
amt += sec->entsize;
|
*psecinfo = bfd_alloc (abfd, amt);
|
*psecinfo = bfd_alloc (abfd, amt);
|
if (*psecinfo == NULL)
|
if (*psecinfo == NULL)
|
goto error_return;
|
goto error_return;
|
|
|
secinfo = (struct sec_merge_sec_info *) *psecinfo;
|
secinfo = (struct sec_merge_sec_info *) *psecinfo;
|
if (sinfo->chain)
|
if (sinfo->chain)
|
{
|
{
|
secinfo->next = sinfo->chain->next;
|
secinfo->next = sinfo->chain->next;
|
sinfo->chain->next = secinfo;
|
sinfo->chain->next = secinfo;
|
}
|
}
|
else
|
else
|
secinfo->next = secinfo;
|
secinfo->next = secinfo;
|
sinfo->chain = secinfo;
|
sinfo->chain = secinfo;
|
secinfo->sec = sec;
|
secinfo->sec = sec;
|
secinfo->psecinfo = psecinfo;
|
secinfo->psecinfo = psecinfo;
|
secinfo->htab = sinfo->htab;
|
secinfo->htab = sinfo->htab;
|
secinfo->first_str = NULL;
|
secinfo->first_str = NULL;
|
|
|
sec->rawsize = sec->size;
|
sec->rawsize = sec->size;
|
if (sec->flags & SEC_STRINGS)
|
if (sec->flags & SEC_STRINGS)
|
memset (secinfo->contents + sec->size, 0, sec->entsize);
|
memset (secinfo->contents + sec->size, 0, sec->entsize);
|
if (! bfd_get_section_contents (sec->owner, sec, secinfo->contents,
|
if (! bfd_get_section_contents (sec->owner, sec, secinfo->contents,
|
0, sec->size))
|
0, sec->size))
|
goto error_return;
|
goto error_return;
|
|
|
return TRUE;
|
return TRUE;
|
|
|
error_return:
|
error_return:
|
*psecinfo = NULL;
|
*psecinfo = NULL;
|
return FALSE;
|
return FALSE;
|
}
|
}
|
|
|
/* Record one section into the hash table. */
|
/* Record one section into the hash table. */
|
static bfd_boolean
|
static bfd_boolean
|
record_section (struct sec_merge_info *sinfo,
|
record_section (struct sec_merge_info *sinfo,
|
struct sec_merge_sec_info *secinfo)
|
struct sec_merge_sec_info *secinfo)
|
{
|
{
|
asection *sec = secinfo->sec;
|
asection *sec = secinfo->sec;
|
struct sec_merge_hash_entry *entry;
|
struct sec_merge_hash_entry *entry;
|
bfd_boolean nul;
|
bfd_boolean nul;
|
unsigned char *p, *end;
|
unsigned char *p, *end;
|
bfd_vma mask, eltalign;
|
bfd_vma mask, eltalign;
|
unsigned int align, i;
|
unsigned int align, i;
|
|
|
align = sec->alignment_power;
|
align = sec->alignment_power;
|
end = secinfo->contents + sec->size;
|
end = secinfo->contents + sec->size;
|
nul = FALSE;
|
nul = FALSE;
|
mask = ((bfd_vma) 1 << align) - 1;
|
mask = ((bfd_vma) 1 << align) - 1;
|
if (sec->flags & SEC_STRINGS)
|
if (sec->flags & SEC_STRINGS)
|
{
|
{
|
for (p = secinfo->contents; p < end; )
|
for (p = secinfo->contents; p < end; )
|
{
|
{
|
eltalign = p - secinfo->contents;
|
eltalign = p - secinfo->contents;
|
eltalign = ((eltalign ^ (eltalign - 1)) + 1) >> 1;
|
eltalign = ((eltalign ^ (eltalign - 1)) + 1) >> 1;
|
if (!eltalign || eltalign > mask)
|
if (!eltalign || eltalign > mask)
|
eltalign = mask + 1;
|
eltalign = mask + 1;
|
entry = sec_merge_add (sinfo->htab, (char *) p, (unsigned) eltalign,
|
entry = sec_merge_add (sinfo->htab, (char *) p, (unsigned) eltalign,
|
secinfo);
|
secinfo);
|
if (! entry)
|
if (! entry)
|
goto error_return;
|
goto error_return;
|
p += entry->len;
|
p += entry->len;
|
if (sec->entsize == 1)
|
if (sec->entsize == 1)
|
{
|
{
|
while (p < end && *p == 0)
|
while (p < end && *p == 0)
|
{
|
{
|
if (!nul && !((p - secinfo->contents) & mask))
|
if (!nul && !((p - secinfo->contents) & mask))
|
{
|
{
|
nul = TRUE;
|
nul = TRUE;
|
entry = sec_merge_add (sinfo->htab, "",
|
entry = sec_merge_add (sinfo->htab, "",
|
(unsigned) mask + 1, secinfo);
|
(unsigned) mask + 1, secinfo);
|
if (! entry)
|
if (! entry)
|
goto error_return;
|
goto error_return;
|
}
|
}
|
p++;
|
p++;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
while (p < end)
|
while (p < end)
|
{
|
{
|
for (i = 0; i < sec->entsize; i++)
|
for (i = 0; i < sec->entsize; i++)
|
if (p[i] != '\0')
|
if (p[i] != '\0')
|
break;
|
break;
|
if (i != sec->entsize)
|
if (i != sec->entsize)
|
break;
|
break;
|
if (!nul && !((p - secinfo->contents) & mask))
|
if (!nul && !((p - secinfo->contents) & mask))
|
{
|
{
|
nul = TRUE;
|
nul = TRUE;
|
entry = sec_merge_add (sinfo->htab, (char *) p,
|
entry = sec_merge_add (sinfo->htab, (char *) p,
|
(unsigned) mask + 1, secinfo);
|
(unsigned) mask + 1, secinfo);
|
if (! entry)
|
if (! entry)
|
goto error_return;
|
goto error_return;
|
}
|
}
|
p += sec->entsize;
|
p += sec->entsize;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
for (p = secinfo->contents; p < end; p += sec->entsize)
|
for (p = secinfo->contents; p < end; p += sec->entsize)
|
{
|
{
|
entry = sec_merge_add (sinfo->htab, (char *) p, 1, secinfo);
|
entry = sec_merge_add (sinfo->htab, (char *) p, 1, secinfo);
|
if (! entry)
|
if (! entry)
|
goto error_return;
|
goto error_return;
|
}
|
}
|
}
|
}
|
|
|
return TRUE;
|
return TRUE;
|
|
|
error_return:
|
error_return:
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
*secinfo->psecinfo = NULL;
|
*secinfo->psecinfo = NULL;
|
return FALSE;
|
return FALSE;
|
}
|
}
|
|
|
static int
|
static int
|
strrevcmp (const void *a, const void *b)
|
strrevcmp (const void *a, const void *b)
|
{
|
{
|
struct sec_merge_hash_entry *A = *(struct sec_merge_hash_entry **) a;
|
struct sec_merge_hash_entry *A = *(struct sec_merge_hash_entry **) a;
|
struct sec_merge_hash_entry *B = *(struct sec_merge_hash_entry **) b;
|
struct sec_merge_hash_entry *B = *(struct sec_merge_hash_entry **) b;
|
unsigned int lenA = A->len;
|
unsigned int lenA = A->len;
|
unsigned int lenB = B->len;
|
unsigned int lenB = B->len;
|
const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
|
const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
|
const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
|
const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
|
int l = lenA < lenB ? lenA : lenB;
|
int l = lenA < lenB ? lenA : lenB;
|
|
|
while (l)
|
while (l)
|
{
|
{
|
if (*s != *t)
|
if (*s != *t)
|
return (int) *s - (int) *t;
|
return (int) *s - (int) *t;
|
s--;
|
s--;
|
t--;
|
t--;
|
l--;
|
l--;
|
}
|
}
|
return lenA - lenB;
|
return lenA - lenB;
|
}
|
}
|
|
|
/* Like strrevcmp, but for the case where all strings have the same
|
/* Like strrevcmp, but for the case where all strings have the same
|
alignment > entsize. */
|
alignment > entsize. */
|
|
|
static int
|
static int
|
strrevcmp_align (const void *a, const void *b)
|
strrevcmp_align (const void *a, const void *b)
|
{
|
{
|
struct sec_merge_hash_entry *A = *(struct sec_merge_hash_entry **) a;
|
struct sec_merge_hash_entry *A = *(struct sec_merge_hash_entry **) a;
|
struct sec_merge_hash_entry *B = *(struct sec_merge_hash_entry **) b;
|
struct sec_merge_hash_entry *B = *(struct sec_merge_hash_entry **) b;
|
unsigned int lenA = A->len;
|
unsigned int lenA = A->len;
|
unsigned int lenB = B->len;
|
unsigned int lenB = B->len;
|
const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
|
const unsigned char *s = (const unsigned char *) A->root.string + lenA - 1;
|
const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
|
const unsigned char *t = (const unsigned char *) B->root.string + lenB - 1;
|
int l = lenA < lenB ? lenA : lenB;
|
int l = lenA < lenB ? lenA : lenB;
|
int tail_align = (lenA & (A->alignment - 1)) - (lenB & (A->alignment - 1));
|
int tail_align = (lenA & (A->alignment - 1)) - (lenB & (A->alignment - 1));
|
|
|
if (tail_align != 0)
|
if (tail_align != 0)
|
return tail_align;
|
return tail_align;
|
|
|
while (l)
|
while (l)
|
{
|
{
|
if (*s != *t)
|
if (*s != *t)
|
return (int) *s - (int) *t;
|
return (int) *s - (int) *t;
|
s--;
|
s--;
|
t--;
|
t--;
|
l--;
|
l--;
|
}
|
}
|
return lenA - lenB;
|
return lenA - lenB;
|
}
|
}
|
|
|
static inline int
|
static inline int
|
is_suffix (const struct sec_merge_hash_entry *A,
|
is_suffix (const struct sec_merge_hash_entry *A,
|
const struct sec_merge_hash_entry *B)
|
const struct sec_merge_hash_entry *B)
|
{
|
{
|
if (A->len <= B->len)
|
if (A->len <= B->len)
|
/* B cannot be a suffix of A unless A is equal to B, which is guaranteed
|
/* B cannot be a suffix of A unless A is equal to B, which is guaranteed
|
not to be equal by the hash table. */
|
not to be equal by the hash table. */
|
return 0;
|
return 0;
|
|
|
return memcmp (A->root.string + (A->len - B->len),
|
return memcmp (A->root.string + (A->len - B->len),
|
B->root.string, B->len) == 0;
|
B->root.string, B->len) == 0;
|
}
|
}
|
|
|
/* This is a helper function for _bfd_merge_sections. It attempts to
|
/* This is a helper function for _bfd_merge_sections. It attempts to
|
merge strings matching suffixes of longer strings. */
|
merge strings matching suffixes of longer strings. */
|
static void
|
static void
|
merge_strings (struct sec_merge_info *sinfo)
|
merge_strings (struct sec_merge_info *sinfo)
|
{
|
{
|
struct sec_merge_hash_entry **array, **a, *e;
|
struct sec_merge_hash_entry **array, **a, *e;
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_sec_info *secinfo;
|
bfd_size_type size, amt;
|
bfd_size_type size, amt;
|
unsigned int alignment = 0;
|
unsigned int alignment = 0;
|
|
|
/* Now sort the strings */
|
/* Now sort the strings */
|
amt = sinfo->htab->size * sizeof (struct sec_merge_hash_entry *);
|
amt = sinfo->htab->size * sizeof (struct sec_merge_hash_entry *);
|
array = bfd_malloc (amt);
|
array = bfd_malloc (amt);
|
if (array == NULL)
|
if (array == NULL)
|
goto alloc_failure;
|
goto alloc_failure;
|
|
|
for (e = sinfo->htab->first, a = array; e; e = e->next)
|
for (e = sinfo->htab->first, a = array; e; e = e->next)
|
if (e->alignment)
|
if (e->alignment)
|
{
|
{
|
*a++ = e;
|
*a++ = e;
|
/* Adjust the length to not include the zero terminator. */
|
/* Adjust the length to not include the zero terminator. */
|
e->len -= sinfo->htab->entsize;
|
e->len -= sinfo->htab->entsize;
|
if (alignment != e->alignment)
|
if (alignment != e->alignment)
|
{
|
{
|
if (alignment == 0)
|
if (alignment == 0)
|
alignment = e->alignment;
|
alignment = e->alignment;
|
else
|
else
|
alignment = (unsigned) -1;
|
alignment = (unsigned) -1;
|
}
|
}
|
}
|
}
|
|
|
sinfo->htab->size = a - array;
|
sinfo->htab->size = a - array;
|
if (sinfo->htab->size != 0)
|
if (sinfo->htab->size != 0)
|
{
|
{
|
qsort (array, (size_t) sinfo->htab->size,
|
qsort (array, (size_t) sinfo->htab->size,
|
sizeof (struct sec_merge_hash_entry *),
|
sizeof (struct sec_merge_hash_entry *),
|
(alignment != (unsigned) -1 && alignment > sinfo->htab->entsize
|
(alignment != (unsigned) -1 && alignment > sinfo->htab->entsize
|
? strrevcmp_align : strrevcmp));
|
? strrevcmp_align : strrevcmp));
|
|
|
/* Loop over the sorted array and merge suffixes */
|
/* Loop over the sorted array and merge suffixes */
|
e = *--a;
|
e = *--a;
|
e->len += sinfo->htab->entsize;
|
e->len += sinfo->htab->entsize;
|
while (--a >= array)
|
while (--a >= array)
|
{
|
{
|
struct sec_merge_hash_entry *cmp = *a;
|
struct sec_merge_hash_entry *cmp = *a;
|
|
|
cmp->len += sinfo->htab->entsize;
|
cmp->len += sinfo->htab->entsize;
|
if (e->alignment >= cmp->alignment
|
if (e->alignment >= cmp->alignment
|
&& !((e->len - cmp->len) & (cmp->alignment - 1))
|
&& !((e->len - cmp->len) & (cmp->alignment - 1))
|
&& is_suffix (e, cmp))
|
&& is_suffix (e, cmp))
|
{
|
{
|
cmp->u.suffix = e;
|
cmp->u.suffix = e;
|
cmp->alignment = 0;
|
cmp->alignment = 0;
|
}
|
}
|
else
|
else
|
e = cmp;
|
e = cmp;
|
}
|
}
|
}
|
}
|
|
|
alloc_failure:
|
alloc_failure:
|
if (array)
|
if (array)
|
free (array);
|
free (array);
|
|
|
/* Now assign positions to the strings we want to keep. */
|
/* Now assign positions to the strings we want to keep. */
|
size = 0;
|
size = 0;
|
secinfo = sinfo->htab->first->secinfo;
|
secinfo = sinfo->htab->first->secinfo;
|
for (e = sinfo->htab->first; e; e = e->next)
|
for (e = sinfo->htab->first; e; e = e->next)
|
{
|
{
|
if (e->secinfo != secinfo)
|
if (e->secinfo != secinfo)
|
{
|
{
|
secinfo->sec->size = size;
|
secinfo->sec->size = size;
|
secinfo = e->secinfo;
|
secinfo = e->secinfo;
|
}
|
}
|
if (e->alignment)
|
if (e->alignment)
|
{
|
{
|
if (e->secinfo->first_str == NULL)
|
if (e->secinfo->first_str == NULL)
|
{
|
{
|
e->secinfo->first_str = e;
|
e->secinfo->first_str = e;
|
size = 0;
|
size = 0;
|
}
|
}
|
size = (size + e->alignment - 1) & ~((bfd_vma) e->alignment - 1);
|
size = (size + e->alignment - 1) & ~((bfd_vma) e->alignment - 1);
|
e->u.index = size;
|
e->u.index = size;
|
size += e->len;
|
size += e->len;
|
}
|
}
|
}
|
}
|
secinfo->sec->size = size;
|
secinfo->sec->size = size;
|
if (secinfo->sec->alignment_power != 0)
|
if (secinfo->sec->alignment_power != 0)
|
{
|
{
|
bfd_size_type align = (bfd_size_type) 1 << secinfo->sec->alignment_power;
|
bfd_size_type align = (bfd_size_type) 1 << secinfo->sec->alignment_power;
|
secinfo->sec->size = (secinfo->sec->size + align - 1) & -align;
|
secinfo->sec->size = (secinfo->sec->size + align - 1) & -align;
|
}
|
}
|
|
|
/* And now adjust the rest, removing them from the chain (but not hashtable)
|
/* And now adjust the rest, removing them from the chain (but not hashtable)
|
at the same time. */
|
at the same time. */
|
for (a = &sinfo->htab->first, e = *a; e; e = e->next)
|
for (a = &sinfo->htab->first, e = *a; e; e = e->next)
|
if (e->alignment)
|
if (e->alignment)
|
a = &e->next;
|
a = &e->next;
|
else
|
else
|
{
|
{
|
*a = e->next;
|
*a = e->next;
|
if (e->len)
|
if (e->len)
|
{
|
{
|
e->secinfo = e->u.suffix->secinfo;
|
e->secinfo = e->u.suffix->secinfo;
|
e->alignment = e->u.suffix->alignment;
|
e->alignment = e->u.suffix->alignment;
|
e->u.index = e->u.suffix->u.index + (e->u.suffix->len - e->len);
|
e->u.index = e->u.suffix->u.index + (e->u.suffix->len - e->len);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* This function is called once after all SEC_MERGE sections are registered
|
/* This function is called once after all SEC_MERGE sections are registered
|
with _bfd_merge_section. */
|
with _bfd_merge_section. */
|
|
|
bfd_boolean
|
bfd_boolean
|
_bfd_merge_sections (bfd *abfd,
|
_bfd_merge_sections (bfd *abfd,
|
struct bfd_link_info *info ATTRIBUTE_UNUSED,
|
struct bfd_link_info *info ATTRIBUTE_UNUSED,
|
void *xsinfo,
|
void *xsinfo,
|
void (*remove_hook) (bfd *, asection *))
|
void (*remove_hook) (bfd *, asection *))
|
{
|
{
|
struct sec_merge_info *sinfo;
|
struct sec_merge_info *sinfo;
|
|
|
for (sinfo = (struct sec_merge_info *) xsinfo; sinfo; sinfo = sinfo->next)
|
for (sinfo = (struct sec_merge_info *) xsinfo; sinfo; sinfo = sinfo->next)
|
{
|
{
|
struct sec_merge_sec_info * secinfo;
|
struct sec_merge_sec_info * secinfo;
|
|
|
if (! sinfo->chain)
|
if (! sinfo->chain)
|
continue;
|
continue;
|
|
|
/* Move sinfo->chain to head of the chain, terminate it. */
|
/* Move sinfo->chain to head of the chain, terminate it. */
|
secinfo = sinfo->chain;
|
secinfo = sinfo->chain;
|
sinfo->chain = secinfo->next;
|
sinfo->chain = secinfo->next;
|
secinfo->next = NULL;
|
secinfo->next = NULL;
|
|
|
/* Record the sections into the hash table. */
|
/* Record the sections into the hash table. */
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
if (secinfo->sec->flags & SEC_EXCLUDE)
|
if (secinfo->sec->flags & SEC_EXCLUDE)
|
{
|
{
|
*secinfo->psecinfo = NULL;
|
*secinfo->psecinfo = NULL;
|
if (remove_hook)
|
if (remove_hook)
|
(*remove_hook) (abfd, secinfo->sec);
|
(*remove_hook) (abfd, secinfo->sec);
|
}
|
}
|
else if (! record_section (sinfo, secinfo))
|
else if (! record_section (sinfo, secinfo))
|
break;
|
break;
|
|
|
if (secinfo)
|
if (secinfo)
|
continue;
|
continue;
|
|
|
if (sinfo->htab->first == NULL)
|
if (sinfo->htab->first == NULL)
|
continue;
|
continue;
|
|
|
if (sinfo->htab->strings)
|
if (sinfo->htab->strings)
|
merge_strings (sinfo);
|
merge_strings (sinfo);
|
else
|
else
|
{
|
{
|
struct sec_merge_hash_entry *e;
|
struct sec_merge_hash_entry *e;
|
bfd_size_type size = 0;
|
bfd_size_type size = 0;
|
|
|
/* Things are much simpler for non-strings.
|
/* Things are much simpler for non-strings.
|
Just assign them slots in the section. */
|
Just assign them slots in the section. */
|
secinfo = NULL;
|
secinfo = NULL;
|
for (e = sinfo->htab->first; e; e = e->next)
|
for (e = sinfo->htab->first; e; e = e->next)
|
{
|
{
|
if (e->secinfo->first_str == NULL)
|
if (e->secinfo->first_str == NULL)
|
{
|
{
|
if (secinfo)
|
if (secinfo)
|
secinfo->sec->size = size;
|
secinfo->sec->size = size;
|
e->secinfo->first_str = e;
|
e->secinfo->first_str = e;
|
size = 0;
|
size = 0;
|
}
|
}
|
size = (size + e->alignment - 1)
|
size = (size + e->alignment - 1)
|
& ~((bfd_vma) e->alignment - 1);
|
& ~((bfd_vma) e->alignment - 1);
|
e->u.index = size;
|
e->u.index = size;
|
size += e->len;
|
size += e->len;
|
secinfo = e->secinfo;
|
secinfo = e->secinfo;
|
}
|
}
|
secinfo->sec->size = size;
|
secinfo->sec->size = size;
|
}
|
}
|
|
|
/* Finally remove all input sections which have not made it into
|
/* Finally remove all input sections which have not made it into
|
the hash table at all. */
|
the hash table at all. */
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
for (secinfo = sinfo->chain; secinfo; secinfo = secinfo->next)
|
if (secinfo->first_str == NULL)
|
if (secinfo->first_str == NULL)
|
secinfo->sec->flags |= SEC_EXCLUDE | SEC_KEEP;
|
secinfo->sec->flags |= SEC_EXCLUDE | SEC_KEEP;
|
}
|
}
|
|
|
return TRUE;
|
return TRUE;
|
}
|
}
|
|
|
/* Write out the merged section. */
|
/* Write out the merged section. */
|
|
|
bfd_boolean
|
bfd_boolean
|
_bfd_write_merged_section (bfd *output_bfd, asection *sec, void *psecinfo)
|
_bfd_write_merged_section (bfd *output_bfd, asection *sec, void *psecinfo)
|
{
|
{
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_sec_info *secinfo;
|
file_ptr pos;
|
file_ptr pos;
|
|
|
secinfo = (struct sec_merge_sec_info *) psecinfo;
|
secinfo = (struct sec_merge_sec_info *) psecinfo;
|
|
|
if (!secinfo)
|
if (!secinfo)
|
return FALSE;
|
return FALSE;
|
|
|
if (secinfo->first_str == NULL)
|
if (secinfo->first_str == NULL)
|
return TRUE;
|
return TRUE;
|
|
|
pos = sec->output_section->filepos + sec->output_offset;
|
pos = sec->output_section->filepos + sec->output_offset;
|
if (bfd_seek (output_bfd, pos, SEEK_SET) != 0)
|
if (bfd_seek (output_bfd, pos, SEEK_SET) != 0)
|
return FALSE;
|
return FALSE;
|
|
|
if (! sec_merge_emit (output_bfd, secinfo->first_str))
|
if (! sec_merge_emit (output_bfd, secinfo->first_str))
|
return FALSE;
|
return FALSE;
|
|
|
return TRUE;
|
return TRUE;
|
}
|
}
|
|
|
/* Adjust an address in the SEC_MERGE section. Given OFFSET within
|
/* Adjust an address in the SEC_MERGE section. Given OFFSET within
|
*PSEC, this returns the new offset in the adjusted SEC_MERGE
|
*PSEC, this returns the new offset in the adjusted SEC_MERGE
|
section and writes the new section back into *PSEC. */
|
section and writes the new section back into *PSEC. */
|
|
|
bfd_vma
|
bfd_vma
|
_bfd_merged_section_offset (bfd *output_bfd ATTRIBUTE_UNUSED, asection **psec,
|
_bfd_merged_section_offset (bfd *output_bfd ATTRIBUTE_UNUSED, asection **psec,
|
void *psecinfo, bfd_vma offset)
|
void *psecinfo, bfd_vma offset)
|
{
|
{
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_sec_info *secinfo;
|
struct sec_merge_hash_entry *entry;
|
struct sec_merge_hash_entry *entry;
|
unsigned char *p;
|
unsigned char *p;
|
asection *sec = *psec;
|
asection *sec = *psec;
|
|
|
secinfo = (struct sec_merge_sec_info *) psecinfo;
|
secinfo = (struct sec_merge_sec_info *) psecinfo;
|
|
|
if (!secinfo)
|
if (!secinfo)
|
return offset;
|
return offset;
|
|
|
if (offset >= sec->rawsize)
|
if (offset >= sec->rawsize)
|
{
|
{
|
if (offset > sec->rawsize)
|
if (offset > sec->rawsize)
|
{
|
{
|
(*_bfd_error_handler)
|
(*_bfd_error_handler)
|
(_("%s: access beyond end of merged section (%ld)"),
|
(_("%s: access beyond end of merged section (%ld)"),
|
bfd_get_filename (sec->owner), (long) offset);
|
bfd_get_filename (sec->owner), (long) offset);
|
}
|
}
|
return secinfo->first_str ? sec->size : 0;
|
return secinfo->first_str ? sec->size : 0;
|
}
|
}
|
|
|
if (secinfo->htab->strings)
|
if (secinfo->htab->strings)
|
{
|
{
|
if (sec->entsize == 1)
|
if (sec->entsize == 1)
|
{
|
{
|
p = secinfo->contents + offset - 1;
|
p = secinfo->contents + offset - 1;
|
while (p >= secinfo->contents && *p)
|
while (p >= secinfo->contents && *p)
|
--p;
|
--p;
|
++p;
|
++p;
|
}
|
}
|
else
|
else
|
{
|
{
|
p = secinfo->contents + (offset / sec->entsize) * sec->entsize;
|
p = secinfo->contents + (offset / sec->entsize) * sec->entsize;
|
p -= sec->entsize;
|
p -= sec->entsize;
|
while (p >= secinfo->contents)
|
while (p >= secinfo->contents)
|
{
|
{
|
unsigned int i;
|
unsigned int i;
|
|
|
for (i = 0; i < sec->entsize; ++i)
|
for (i = 0; i < sec->entsize; ++i)
|
if (p[i] != '\0')
|
if (p[i] != '\0')
|
break;
|
break;
|
if (i == sec->entsize)
|
if (i == sec->entsize)
|
break;
|
break;
|
p -= sec->entsize;
|
p -= sec->entsize;
|
}
|
}
|
p += sec->entsize;
|
p += sec->entsize;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
p = secinfo->contents + (offset / sec->entsize) * sec->entsize;
|
p = secinfo->contents + (offset / sec->entsize) * sec->entsize;
|
}
|
}
|
entry = sec_merge_hash_lookup (secinfo->htab, (char *) p, 0, FALSE);
|
entry = sec_merge_hash_lookup (secinfo->htab, (char *) p, 0, FALSE);
|
if (!entry)
|
if (!entry)
|
{
|
{
|
if (! secinfo->htab->strings)
|
if (! secinfo->htab->strings)
|
abort ();
|
abort ();
|
/* This should only happen if somebody points into the padding
|
/* This should only happen if somebody points into the padding
|
after a NUL character but before next entity. */
|
after a NUL character but before next entity. */
|
if (*p)
|
if (*p)
|
abort ();
|
abort ();
|
if (! secinfo->htab->first)
|
if (! secinfo->htab->first)
|
abort ();
|
abort ();
|
entry = secinfo->htab->first;
|
entry = secinfo->htab->first;
|
p = (secinfo->contents + (offset / sec->entsize + 1) * sec->entsize
|
p = (secinfo->contents + (offset / sec->entsize + 1) * sec->entsize
|
- entry->len);
|
- entry->len);
|
}
|
}
|
|
|
*psec = entry->secinfo->sec;
|
*psec = entry->secinfo->sec;
|
return entry->u.index + (secinfo->contents + offset - p);
|
return entry->u.index + (secinfo->contents + offset - p);
|
}
|
}
|
|
|
