.struct orl {* Output ranlib. *}
.{
. char **name; {* Symbol name. *}
-. union
-. {
-. file_ptr pos;
-. bfd *abfd;
-. } u; {* bfd* or file position. *}
+. bfd *abfd; {* Containing BFD. *}
. int namidx; {* Index into string table. *}
.};
.
if (*(map[orl_count].name) == NULL)
goto error_return;
strcpy (*(map[orl_count].name), syms[src_count]->name);
- map[orl_count].u.abfd = current;
+ map[orl_count].abfd = current;
map[orl_count].namidx = stridx;
stridx += namelen + 1;
{
unsigned int offset;
- if (map[count].u.abfd != last_elt)
+ if (map[count].abfd != last_elt)
{
do
{
firstreal += firstreal % 2;
current = current->archive_next;
}
- while (current != map[count].u.abfd);
+ while (current != map[count].abfd);
}
/* The archive file format only has 4 bytes to store the offset
unsigned int offset;
bfd_byte buf[BSD_SYMDEF_SIZE];
- if (map[count].u.abfd != last_elt)
+ if (map[count].abfd != last_elt)
{
do
{
firstreal += firstreal % 2;
current = current->archive_next;
}
- while (current != map[count].u.abfd);
+ while (current != map[count].abfd);
}
/* The archive file format only has 4 bytes to store the offset
/* For each symbol which is used defined in this object, write
out the object file's address in the archive. */
- while (count < symbol_count && map[count].u.abfd == current)
+ while (count < symbol_count && map[count].abfd == current)
{
unsigned int offset = (unsigned int) archive_member_file_ptr;
/* For each symbol which is used defined in this object, write
out the object file's address in the archive. */
- while (count < symbol_count && map[count].u.abfd == current)
+ while (count < symbol_count && map[count].abfd == current)
{
unsigned int offset = (unsigned int) archive_member_file_ptr;
the object file's address in the archive. */
for (;
- count < symbol_count && map[count].u.abfd == current;
+ count < symbol_count && map[count].abfd == current;
count++)
{
bfd_putb64 ((bfd_vma) archive_member_file_ptr, buf);
i = 0;
archive_iterator_begin (&iterator, abfd);
while (i < orl_count && archive_iterator_next (&iterator))
- while (map[i].u.abfd == iterator.current.member)
+ while (map[i].abfd == iterator.current.member)
{
H_PUT_32 (abfd, iterator.current.offset, buf);
if (bfd_write (buf, 4, abfd) != 4)
current_bfd = current_bfd->archive_next)
{
arch_info = bfd_get_arch_info (current_bfd);
- while (map[i].u.abfd == current_bfd)
+ while (map[i].abfd == current_bfd)
{
string_length = strlen (*map[i].name) + 1;
if (arch_info->bits_per_address == 64)
while (i < orl_count && archive_iterator_next (&iterator))
{
arch_info = bfd_get_arch_info (iterator.current.member);
- while (map[i].u.abfd == iterator.current.member)
+ while (map[i].abfd == iterator.current.member)
{
if (arch_info->bits_per_address == 32)
{
current_bfd = current_bfd->archive_next)
{
arch_info = bfd_get_arch_info (current_bfd);
- while (map[i].u.abfd == current_bfd)
+ while (map[i].abfd == current_bfd)
{
if (arch_info->bits_per_address == 32)
{
while (i < orl_count && archive_iterator_next (&iterator))
{
arch_info = bfd_get_arch_info (iterator.current.member);
- while (map[i].u.abfd == iterator.current.member)
+ while (map[i].abfd == iterator.current.member)
{
if (arch_info->bits_per_address == 64)
{
current_bfd = current_bfd->archive_next)
{
arch_info = bfd_get_arch_info (current_bfd);
- while (map[i].u.abfd == current_bfd)
+ while (map[i].abfd == current_bfd)
{
if (arch_info->bits_per_address == 64)
{
/* Advance firstreal to the file position of this archive
element. */
- if (map[i].u.abfd != last_elt)
+ if (map[i].abfd != last_elt)
{
do
{
firstreal += firstreal % 2;
current = current->archive_next;
}
- while (current != map[i].u.abfd);
+ while (current != map[i].abfd);
}
last_elt = current;
struct orl /* Output ranlib. */
{
char **name; /* Symbol name. */
- union
- {
- file_ptr pos;
- bfd *abfd;
- } u; /* bfd* or file position. */
+ bfd *abfd; /* Containing BFD. */
int namidx; /* Index into string table. */
};