osprey/cygnus/bfd/elflink.c

Go to the documentation of this file.

/*
 * Copyright 2003, 2004, 2005, 2006 PathScale, Inc.  All Rights Reserved.
 */

/* ELF linking support for BFD.
   Copyright 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
   Free Software Foundation, Inc.

   This file is part of BFD, the Binary File Descriptor library.

   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
   the Free Software Foundation; either version 2 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.  */

#include "bfd.h"
#include "sysdep.h"
#include "bfdlink.h"
#include "libbfd.h"
#define ARCH_SIZE 0
#include "elf-bfd.h"
#include "safe-ctype.h"
#include "libiberty.h"

#ifdef IPA_LINK
#include "ipa_ld.h"

#define SHN_IPA_TEXT  0xff01    /* Allocated text symbols.  */
#define SHN_IPA_DATA  0xff02    /* Allocated data symbols.  */

int ld_set_ndx (bfd *abfd) __attribute__((weak));

int
ld_set_ndx (bfd *abfd)
{
  (void) abfd;
  return 0;
}
#endif

bfd_boolean
_bfd_elf_create_got_section (bfd *abfd, struct bfd_link_info *info)
{
  flagword flags;
  asection *s;
  struct elf_link_hash_entry *h;
  struct bfd_link_hash_entry *bh;
  const struct elf_backend_data *bed = get_elf_backend_data (abfd);
  int ptralign;

  /* This function may be called more than once.  */
  s = bfd_get_section_by_name (abfd, ".got");
  if (s != NULL && (s->flags & SEC_LINKER_CREATED) != 0)
    return TRUE;

  switch (bed->s->arch_size)
    {
    case 32:
      ptralign = 2;
      break;

    case 64:
      ptralign = 3;
      break;

    default:
      bfd_set_error (bfd_error_bad_value);
      return FALSE;
    }

  flags = bed->dynamic_sec_flags;

  s = bfd_make_section (abfd, ".got");
  if (s == NULL
      || !bfd_set_section_flags (abfd, s, flags)
      || !bfd_set_section_alignment (abfd, s, ptralign))
    return FALSE;

  if (bed->want_got_plt)
    {
      s = bfd_make_section (abfd, ".got.plt");
      if (s == NULL
    || !bfd_set_section_flags (abfd, s, flags)
    || !bfd_set_section_alignment (abfd, s, ptralign))
  return FALSE;
    }

  if (bed->want_got_sym)
    {
      /* Define the symbol _GLOBAL_OFFSET_TABLE_ at the start of the .got
   (or .got.plt) section.  We don't do this in the linker script
   because we don't want to define the symbol if we are not creating
   a global offset table.  */
      bh = NULL;
      if (!(_bfd_generic_link_add_one_symbol
      (info, abfd, "_GLOBAL_OFFSET_TABLE_", BSF_GLOBAL, s,
       bed->got_symbol_offset, NULL, FALSE, bed->collect, &bh)))
  return FALSE;
      h = (struct elf_link_hash_entry *) bh;
      h->def_regular = 1;
      h->type = STT_OBJECT;
      h->other = STV_HIDDEN;

      if (! info->executable
    && ! bfd_elf_link_record_dynamic_symbol (info, h))
  return FALSE;

      elf_hash_table (info)->hgot = h;
    }

  /* The first bit of the global offset table is the header.  */
  s->size += bed->got_header_size + bed->got_symbol_offset;

  return TRUE;
}

/* Create a strtab to hold the dynamic symbol names.  */
static bfd_boolean
_bfd_elf_link_create_dynstrtab (bfd *abfd, struct bfd_link_info *info)
{
  struct elf_link_hash_table *hash_table;

  hash_table = elf_hash_table (info);
  if (hash_table->dynobj == NULL)
    hash_table->dynobj = abfd;

  if (hash_table->dynstr == NULL)
    {
      hash_table->dynstr = _bfd_elf_strtab_init ();
      if (hash_table->dynstr == NULL)
  return FALSE;
    }
  return TRUE;
}

/* Create some sections which will be filled in with dynamic linking
   information.  ABFD is an input file which requires dynamic sections
   to be created.  The dynamic sections take up virtual memory space
   when the final executable is run, so we need to create them before
   addresses are assigned to the output sections.  We work out the
   actual contents and size of these sections later.  */

bfd_boolean
_bfd_elf_link_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info)
{
  flagword flags;
  register asection *s;
  struct elf_link_hash_entry *h;
  struct bfd_link_hash_entry *bh;
  const struct elf_backend_data *bed;

  if (! is_elf_hash_table (info->hash))
    return FALSE;

  if (elf_hash_table (info)->dynamic_sections_created)
    return TRUE;

  if (!_bfd_elf_link_create_dynstrtab (abfd, info))
    return FALSE;

  abfd = elf_hash_table (info)->dynobj;
  bed = get_elf_backend_data (abfd);

  flags = bed->dynamic_sec_flags;

  /* A dynamically linked executable has a .interp section, but a
     shared library does not.  */
  if (info->executable)
    {
      s = bfd_make_section (abfd, ".interp");
      if (s == NULL
    || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY))
  return FALSE;
    }

  if (! info->traditional_format)
    {
      s = bfd_make_section (abfd, ".eh_frame_hdr");
      if (s == NULL
    || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
    || ! bfd_set_section_alignment (abfd, s, 2))
  return FALSE;
      elf_hash_table (info)->eh_info.hdr_sec = s;
    }

  /* Create sections to hold version informations.  These are removed
     if they are not needed.  */
  s = bfd_make_section (abfd, ".gnu.version_d");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;

  s = bfd_make_section (abfd, ".gnu.version");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, 1))
    return FALSE;

  s = bfd_make_section (abfd, ".gnu.version_r");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;

  s = bfd_make_section (abfd, ".dynsym");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;

  s = bfd_make_section (abfd, ".dynstr");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY))
    return FALSE;

  s = bfd_make_section (abfd, ".dynamic");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;

  /* The special symbol _DYNAMIC is always set to the start of the
     .dynamic section.  We could set _DYNAMIC in a linker script, but we
     only want to define it if we are, in fact, creating a .dynamic
     section.  We don't want to define it if there is no .dynamic
     section, since on some ELF platforms the start up code examines it
     to decide how to initialize the process.  */
  h = elf_link_hash_lookup (elf_hash_table (info), "_DYNAMIC",
          FALSE, FALSE, FALSE);
  if (h != NULL)
    {
      /* Zap symbol defined in an as-needed lib that wasn't linked.
   This is a symptom of a larger problem:  Absolute symbols
   defined in shared libraries can't be overridden, because we
   lose the link to the bfd which is via the symbol section.  */
      h->root.type = bfd_link_hash_new;
    }
  bh = &h->root;
  if (! (_bfd_generic_link_add_one_symbol
   (info, abfd, "_DYNAMIC", BSF_GLOBAL, s, 0, NULL, FALSE,
    get_elf_backend_data (abfd)->collect, &bh)))
    return FALSE;
  h = (struct elf_link_hash_entry *) bh;
  h->def_regular = 1;
  h->type = STT_OBJECT;

  if (! info->executable
      && ! bfd_elf_link_record_dynamic_symbol (info, h))
    return FALSE;

  s = bfd_make_section (abfd, ".hash");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;
  elf_section_data (s)->this_hdr.sh_entsize = bed->s->sizeof_hash_entry;

  /* Let the backend create the rest of the sections.  This lets the
     backend set the right flags.  The backend will normally create
     the .got and .plt sections.  */
  if (! (*bed->elf_backend_create_dynamic_sections) (abfd, info))
    return FALSE;

  elf_hash_table (info)->dynamic_sections_created = TRUE;

  return TRUE;
}

/* Create dynamic sections when linking against a dynamic object.  */

bfd_boolean
_bfd_elf_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info)
{
  flagword flags, pltflags;
  asection *s;
  const struct elf_backend_data *bed = get_elf_backend_data (abfd);

  /* We need to create .plt, .rel[a].plt, .got, .got.plt, .dynbss, and
     .rel[a].bss sections.  */
  flags = bed->dynamic_sec_flags;

  pltflags = flags;
  if (bed->plt_not_loaded)
    /* We do not clear SEC_ALLOC here because we still want the OS to
       allocate space for the section; it's just that there's nothing
       to read in from the object file.  */
    pltflags &= ~ (SEC_CODE | SEC_LOAD | SEC_HAS_CONTENTS);
  else
    pltflags |= SEC_ALLOC | SEC_CODE | SEC_LOAD;
  if (bed->plt_readonly)
    pltflags |= SEC_READONLY;

  s = bfd_make_section (abfd, ".plt");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, pltflags)
      || ! bfd_set_section_alignment (abfd, s, bed->plt_alignment))
    return FALSE;

  if (bed->want_plt_sym)
    {
      /* Define the symbol _PROCEDURE_LINKAGE_TABLE_ at the start of the
   .plt section.  */
      struct elf_link_hash_entry *h;
      struct bfd_link_hash_entry *bh = NULL;

      if (! (_bfd_generic_link_add_one_symbol
       (info, abfd, "_PROCEDURE_LINKAGE_TABLE_", BSF_GLOBAL, s, 0, NULL,
        FALSE, get_elf_backend_data (abfd)->collect, &bh)))
  return FALSE;
      h = (struct elf_link_hash_entry *) bh;
      h->def_regular = 1;
      h->type = STT_OBJECT;

      if (! info->executable
    && ! bfd_elf_link_record_dynamic_symbol (info, h))
  return FALSE;
    }

  s = bfd_make_section (abfd,
      bed->default_use_rela_p ? ".rela.plt" : ".rel.plt");
  if (s == NULL
      || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
      || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
    return FALSE;

  if (! _bfd_elf_create_got_section (abfd, info))
    return FALSE;

  if (bed->want_dynbss)
    {
      /* The .dynbss section is a place to put symbols which are defined
   by dynamic objects, are referenced by regular objects, and are
   not functions.  We must allocate space for them in the process
   image and use a R_*_COPY reloc to tell the dynamic linker to
   initialize them at run time.  The linker script puts the .dynbss
   section into the .bss section of the final image.  */
      s = bfd_make_section (abfd, ".dynbss");
      if (s == NULL
    || ! bfd_set_section_flags (abfd, s, SEC_ALLOC | SEC_LINKER_CREATED))
  return FALSE;

      /* The .rel[a].bss section holds copy relocs.  This section is not
   normally needed.  We need to create it here, though, so that the
   linker will map it to an output section.  We can't just create it
   only if we need it, because we will not know whether we need it
   until we have seen all the input files, and the first time the
   main linker code calls BFD after examining all the input files
   (size_dynamic_sections) the input sections have already been
   mapped to the output sections.  If the section turns out not to
   be needed, we can discard it later.  We will never need this
   section when generating a shared object, since they do not use
   copy relocs.  */
      if (! info->shared)
  {
    s = bfd_make_section (abfd,
        (bed->default_use_rela_p
         ? ".rela.bss" : ".rel.bss"));
    if (s == NULL
        || ! bfd_set_section_flags (abfd, s, flags | SEC_READONLY)
        || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align))
      return FALSE;
  }
    }

  return TRUE;
}

/* Record a new dynamic symbol.  We record the dynamic symbols as we
   read the input files, since we need to have a list of all of them
   before we can determine the final sizes of the output sections.
   Note that we may actually call this function even though we are not
   going to output any dynamic symbols; in some cases we know that a
   symbol should be in the dynamic symbol table, but only if there is
   one.  */

bfd_boolean
bfd_elf_link_record_dynamic_symbol (struct bfd_link_info *info,
            struct elf_link_hash_entry *h)
{
  if (h->dynindx == -1)
    {
      struct elf_strtab_hash *dynstr;
      char *p;
      const char *name;
      bfd_size_type indx;

      /* XXX: The ABI draft says the linker must turn hidden and
   internal symbols into STB_LOCAL symbols when producing the
   DSO. However, if ld.so honors st_other in the dynamic table,
   this would not be necessary.  */
      switch (ELF_ST_VISIBILITY (h->other))
  {
  case STV_INTERNAL:
  case STV_HIDDEN:
    if (h->root.type != bfd_link_hash_undefined
        && h->root.type != bfd_link_hash_undefweak)
      {
        h->forced_local = 1;
        if (!elf_hash_table (info)->is_relocatable_executable)
    return TRUE;
      }

  default:
    break;
  }

      h->dynindx = elf_hash_table (info)->dynsymcount;
      ++elf_hash_table (info)->dynsymcount;

      dynstr = elf_hash_table (info)->dynstr;
      if (dynstr == NULL)
  {
    /* Create a strtab to hold the dynamic symbol names.  */
    elf_hash_table (info)->dynstr = dynstr = _bfd_elf_strtab_init ();
    if (dynstr == NULL)
      return FALSE;
  }

      /* We don't put any version information in the dynamic string
   table.  */
      name = h->root.root.string;
      p = strchr (name, ELF_VER_CHR);
      if (p != NULL)
  /* We know that the p points into writable memory.  In fact,
     there are only a few symbols that have read-only names, being
     those like _GLOBAL_OFFSET_TABLE_ that are created specially
     by the backends.  Most symbols will have names pointing into
     an ELF string table read from a file, or to objalloc memory.  */
  *p = 0;

      indx = _bfd_elf_strtab_add (dynstr, name, p != NULL);

      if (p != NULL)
  *p = ELF_VER_CHR;

      if (indx == (bfd_size_type) -1)
  return FALSE;
      h->dynstr_index = indx;
    }

  return TRUE;
}

/* Record an assignment to a symbol made by a linker script.  We need
   this in case some dynamic object refers to this symbol.  */

bfd_boolean
bfd_elf_record_link_assignment (bfd *output_bfd ATTRIBUTE_UNUSED,
        struct bfd_link_info *info,
        const char *name,
        bfd_boolean provide)
{
  struct elf_link_hash_entry *h;
  struct elf_link_hash_table *htab;

  if (!is_elf_hash_table (info->hash))
    return TRUE;

  htab = elf_hash_table (info);
  h = elf_link_hash_lookup (htab, name, !provide, TRUE, FALSE);
  if (h == NULL)
    return provide;

  /* Since we're defining the symbol, don't let it seem to have not
     been defined.  record_dynamic_symbol and size_dynamic_sections
     may depend on this.  */
  if (h->root.type == bfd_link_hash_undefweak
      || h->root.type == bfd_link_hash_undefined)
    {
      h->root.type = bfd_link_hash_new;
      if (h->root.u.undef.next != NULL || htab->root.undefs_tail == &h->root)
  bfd_link_repair_undef_list (&htab->root);
    }

  if (h->root.type == bfd_link_hash_new)
    h->non_elf = 0;

  /* If this symbol is being provided by the linker script, and it is
     currently defined by a dynamic object, but not by a regular
     object, then mark it as undefined so that the generic linker will
     force the correct value.  */
  if (provide
      && h->def_dynamic
      && !h->def_regular)
    h->root.type = bfd_link_hash_undefined;

  /* If this symbol is not being provided by the linker script, and it is
     currently defined by a dynamic object, but not by a regular object,
     then clear out any version information because the symbol will not be
     associated with the dynamic object any more.  */
  if (!provide
      && h->def_dynamic
      && !h->def_regular)
    h->verinfo.verdef = NULL;

  h->def_regular = 1;

  /* STV_HIDDEN and STV_INTERNAL symbols must be STB_LOCAL in shared objects
     and executables.  */
  if (!info->relocatable
      && h->dynindx != -1
      && (ELF_ST_VISIBILITY (h->other) == STV_HIDDEN
    || ELF_ST_VISIBILITY (h->other) == STV_INTERNAL))
    h->forced_local = 1;

  if ((h->def_dynamic
       || h->ref_dynamic
       || info->shared
       || (info->executable && elf_hash_table (info)->is_relocatable_executable))
      && h->dynindx == -1)
    {
      if (! bfd_elf_link_record_dynamic_symbol (info, h))
  return FALSE;

      /* If this is a weak defined symbol, and we know a corresponding
   real symbol from the same dynamic object, make sure the real
   symbol is also made into a dynamic symbol.  */
      if (h->u.weakdef != NULL
    && h->u.weakdef->dynindx == -1)
  {
    if (! bfd_elf_link_record_dynamic_symbol (info, h->u.weakdef))
      return FALSE;
  }
    }

  return TRUE;
}

/* Record a new local dynamic symbol.  Returns 0 on failure, 1 on
   success, and 2 on a failure caused by attempting to record a symbol
   in a discarded section, eg. a discarded link-once section symbol.  */

int
bfd_elf_link_record_local_dynamic_symbol (struct bfd_link_info *info,
            bfd *input_bfd,
            long input_indx)
{
  bfd_size_type amt;
  struct elf_link_local_dynamic_entry *entry;
  struct elf_link_hash_table *eht;
  struct elf_strtab_hash *dynstr;
  unsigned long dynstr_index;
  char *name;
  Elf_External_Sym_Shndx eshndx;
  char esym[sizeof (Elf64_External_Sym)];

  if (! is_elf_hash_table (info->hash))
    return 0;

  /* See if the entry exists already.  */
  for (entry = elf_hash_table (info)->dynlocal; entry ; entry = entry->next)
    if (entry->input_bfd == input_bfd && entry->input_indx == input_indx)
      return 1;

  amt = sizeof (*entry);
  entry = bfd_alloc (input_bfd, amt);
  if (entry == NULL)
    return 0;

  /* Go find the symbol, so that we can find it's name.  */
  if (!bfd_elf_get_elf_syms (input_bfd, &elf_tdata (input_bfd)->symtab_hdr,
           1, input_indx, &entry->isym, esym, &eshndx))
    {
      bfd_release (input_bfd, entry);
      return 0;
    }

  if (entry->isym.st_shndx != SHN_UNDEF
      && (entry->isym.st_shndx < SHN_LORESERVE
    || entry->isym.st_shndx > SHN_HIRESERVE))
    {
      asection *s;

      s = bfd_section_from_elf_index (input_bfd, entry->isym.st_shndx);
      if (s == NULL || bfd_is_abs_section (s->output_section))
  {
    /* We can still bfd_release here as nothing has done another
       bfd_alloc.  We can't do this later in this function.  */
    bfd_release (input_bfd, entry);
    return 2;
  }
    }

  name = (bfd_elf_string_from_elf_section
    (input_bfd, elf_tdata (input_bfd)->symtab_hdr.sh_link,
     entry->isym.st_name));

  dynstr = elf_hash_table (info)->dynstr;
  if (dynstr == NULL)
    {
      /* Create a strtab to hold the dynamic symbol names.  */
      elf_hash_table (info)->dynstr = dynstr = _bfd_elf_strtab_init ();
      if (dynstr == NULL)
  return 0;
    }

  dynstr_index = _bfd_elf_strtab_add (dynstr, name, FALSE);
  if (dynstr_index == (unsigned long) -1)
    return 0;
  entry->isym.st_name = dynstr_index;

  eht = elf_hash_table (info);

  entry->next = eht->dynlocal;
  eht->dynlocal = entry;
  entry->input_bfd = input_bfd;
  entry->input_indx = input_indx;
  eht->dynsymcount++;

  /* Whatever binding the symbol had before, it's now local.  */
  entry->isym.st_info
    = ELF_ST_INFO (STB_LOCAL, ELF_ST_TYPE (entry->isym.st_info));

  /* The dynindx will be set at the end of size_dynamic_sections.  */

  return 1;
}

/* Return the dynindex of a local dynamic symbol.  */

long
_bfd_elf_link_lookup_local_dynindx (struct bfd_link_info *info,
            bfd *input_bfd,
            long input_indx)
{
  struct elf_link_local_dynamic_entry *e;

  for (e = elf_hash_table (info)->dynlocal; e ; e = e->next)
    if (e->input_bfd == input_bfd && e->input_indx == input_indx)
      return e->dynindx;
  return -1;
}

/* This function is used to renumber the dynamic symbols, if some of
   them are removed because they are marked as local.  This is called
   via elf_link_hash_traverse.  */

static bfd_boolean
elf_link_renumber_hash_table_dynsyms (struct elf_link_hash_entry *h,
              void *data)
{
  size_t *count = data;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  if (h->forced_local)
    return TRUE;

  if (h->dynindx != -1)
    h->dynindx = ++(*count);

  return TRUE;
}


/* Like elf_link_renumber_hash_table_dynsyms, but just number symbols with
   STB_LOCAL binding.  */

static bfd_boolean
elf_link_renumber_local_hash_table_dynsyms (struct elf_link_hash_entry *h,
              void *data)
{
  size_t *count = data;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  if (!h->forced_local)
    return TRUE;

  if (h->dynindx != -1)
    h->dynindx = ++(*count);

  return TRUE;
}

/* Return true if the dynamic symbol for a given section should be
   omitted when creating a shared library.  */
bfd_boolean
_bfd_elf_link_omit_section_dynsym (bfd *output_bfd ATTRIBUTE_UNUSED,
           struct bfd_link_info *info,
           asection *p)
{
  switch (elf_section_data (p)->this_hdr.sh_type)
    {
    case SHT_PROGBITS:
    case SHT_NOBITS:
      /* If sh_type is yet undecided, assume it could be
   SHT_PROGBITS/SHT_NOBITS.  */
    case SHT_NULL:
      if (strcmp (p->name, ".got") == 0
    || strcmp (p->name, ".got.plt") == 0
    || strcmp (p->name, ".plt") == 0)
  {
    asection *ip;
    bfd *dynobj = elf_hash_table (info)->dynobj;

    if (dynobj != NULL
        && (ip = bfd_get_section_by_name (dynobj, p->name)) != NULL
        && (ip->flags & SEC_LINKER_CREATED)
        && ip->output_section == p)
      return TRUE;
  }
      return FALSE;

      /* There shouldn't be section relative relocations
   against any other section.  */
    default:
      return TRUE;
    }
}

/* Assign dynsym indices.  In a shared library we generate a section
   symbol for each output section, which come first.  Next come symbols
   which have been forced to local binding.  Then all of the back-end
   allocated local dynamic syms, followed by the rest of the global
   symbols.  */

unsigned long
_bfd_elf_link_renumber_dynsyms (bfd *output_bfd, struct bfd_link_info *info)
{
  unsigned long dynsymcount = 0;

  if (info->shared || elf_hash_table (info)->is_relocatable_executable)
    {
      const struct elf_backend_data *bed = get_elf_backend_data (output_bfd);
      asection *p;
      for (p = output_bfd->sections; p ; p = p->next)
  if ((p->flags & SEC_EXCLUDE) == 0
      && (p->flags & SEC_ALLOC) != 0
      && !(*bed->elf_backend_omit_section_dynsym) (output_bfd, info, p))
    elf_section_data (p)->dynindx = ++dynsymcount;
    }

  elf_link_hash_traverse (elf_hash_table (info),
        elf_link_renumber_local_hash_table_dynsyms,
        &dynsymcount);

  if (elf_hash_table (info)->dynlocal)
    {
      struct elf_link_local_dynamic_entry *p;
      for (p = elf_hash_table (info)->dynlocal; p ; p = p->next)
  p->dynindx = ++dynsymcount;
    }

  elf_link_hash_traverse (elf_hash_table (info),
        elf_link_renumber_hash_table_dynsyms,
        &dynsymcount);

  /* There is an unused NULL entry at the head of the table which
     we must account for in our count.  Unless there weren't any
     symbols, which means we'll have no table at all.  */
  if (dynsymcount != 0)
    ++dynsymcount;

  return elf_hash_table (info)->dynsymcount = dynsymcount;
}

/* This function is called when we want to define a new symbol.  It
   handles the various cases which arise when we find a definition in
   a dynamic object, or when there is already a definition in a
   dynamic object.  The new symbol is described by NAME, SYM, PSEC,
   and PVALUE.  We set SYM_HASH to the hash table entry.  We set
   OVERRIDE if the old symbol is overriding a new definition.  We set
   TYPE_CHANGE_OK if it is OK for the type to change.  We set
   SIZE_CHANGE_OK if it is OK for the size to change.  By OK to
   change, we mean that we shouldn't warn if the type or size does
   change.  We set POLD_ALIGNMENT if an old common symbol in a dynamic
   object is overridden by a regular object.  */

bfd_boolean
_bfd_elf_merge_symbol (bfd *abfd,
           struct bfd_link_info *info,
           const char *name,
           Elf_Internal_Sym *sym,
           asection **psec,
           bfd_vma *pvalue,
           unsigned int *pold_alignment,
           struct elf_link_hash_entry **sym_hash,
           bfd_boolean *skip,
           bfd_boolean *override,
           bfd_boolean *type_change_ok,
           bfd_boolean *size_change_ok)
{
  asection *sec, *oldsec;
  struct elf_link_hash_entry *h;
  struct elf_link_hash_entry *flip;
  int bind;
  bfd *oldbfd;
  bfd_boolean newdyn, olddyn, olddef, newdef, newdyncommon, olddyncommon;
  bfd_boolean newweak, oldweak;

  *skip = FALSE;
  *override = FALSE;

  sec = *psec;
  bind = ELF_ST_BIND (sym->st_info);

  if (! bfd_is_und_section (sec))
    h = elf_link_hash_lookup (elf_hash_table (info), name, TRUE, FALSE, FALSE);
  else
    h = ((struct elf_link_hash_entry *)
   bfd_wrapped_link_hash_lookup (abfd, info, name, TRUE, FALSE, FALSE));
  if (h == NULL)
    return FALSE;
  *sym_hash = h;

  /* This code is for coping with dynamic objects, and is only useful
     if we are doing an ELF link.  */
  if (info->hash->creator != abfd->xvec)
    return TRUE;

  /* For merging, we only care about real symbols.  */

  while (h->root.type == bfd_link_hash_indirect
   || h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  /* If we just created the symbol, mark it as being an ELF symbol.
     Other than that, there is nothing to do--there is no merge issue
     with a newly defined symbol--so we just return.  */

  if (h->root.type == bfd_link_hash_new)
    {
#ifdef IPA_LINK
      extern int ld_set_ndx(bfd *);
      /* For SGI intermediate WHIRL format we need to mark the symbol. */
      h->ipa_indx = ld_set_ndx (abfd);
#endif
      h->non_elf = 0;
      return TRUE;
    }

  /* OLDBFD and OLDSEC are a BFD and an ASECTION associated with the
     existing symbol.  */

  switch (h->root.type)
    {
    default:
      oldbfd = NULL;
      oldsec = NULL;
      break;

    case bfd_link_hash_undefined:
    case bfd_link_hash_undefweak:
      oldbfd = h->root.u.undef.abfd;
      oldsec = NULL;
      break;

    case bfd_link_hash_defined:
    case bfd_link_hash_defweak:
      oldbfd = h->root.u.def.section->owner;
      oldsec = h->root.u.def.section;
      break;

    case bfd_link_hash_common:
      oldbfd = h->root.u.c.p->section->owner;
      oldsec = h->root.u.c.p->section;
      break;
    }

  /* In cases involving weak versioned symbols, we may wind up trying
     to merge a symbol with itself.  Catch that here, to avoid the
     confusion that results if we try to override a symbol with
     itself.  The additional tests catch cases like
     _GLOBAL_OFFSET_TABLE_, which are regular symbols defined in a
     dynamic object, which we do want to handle here.  */
#ifdef KEY
  /* Don't test for "abfd == oldbfd" if oldbfd is not valid. */
  if (! h->root.u.def.section_is_invalid)
#endif
  if (abfd == oldbfd
      && ((abfd->flags & DYNAMIC) == 0
    || !h->def_regular))
    return TRUE;

  /* NEWDYN and OLDDYN indicate whether the new or old symbol,
     respectively, is from a dynamic object.  */

  if ((abfd->flags & DYNAMIC) != 0)
    newdyn = TRUE;
  else
    newdyn = FALSE;

  if (oldbfd != NULL)
    olddyn = (oldbfd->flags & DYNAMIC) != 0;
  else
    {
      asection *hsec;

      /* This code handles the special SHN_MIPS_{TEXT,DATA} section
   indices used by MIPS ELF.  */
      switch (h->root.type)
  {
  default:
    hsec = NULL;
    break;

  case bfd_link_hash_defined:
  case bfd_link_hash_defweak:
#ifdef KEY
    hsec = NULL;
    if (! h->root.u.def.section_is_invalid)
#endif
    hsec = h->root.u.def.section;
    break;

  case bfd_link_hash_common:
    hsec = h->root.u.c.p->section;
    break;
  }

      if (hsec == NULL)
  olddyn = FALSE;
      else
  olddyn = (hsec->symbol->flags & BSF_DYNAMIC) != 0;
    }

  /* NEWDEF and OLDDEF indicate whether the new or old symbol,
     respectively, appear to be a definition rather than reference.  */

  if (bfd_is_und_section (sec) || bfd_is_com_section (sec))
    newdef = FALSE;
  else
    newdef = TRUE;

  if (h->root.type == bfd_link_hash_undefined
      || h->root.type == bfd_link_hash_undefweak
      || h->root.type == bfd_link_hash_common)
    olddef = FALSE;
  else
    olddef = TRUE;

  /* Check TLS symbol.  */
  if ((ELF_ST_TYPE (sym->st_info) == STT_TLS || h->type == STT_TLS)
      && ELF_ST_TYPE (sym->st_info) != h->type)
    {
      bfd *ntbfd, *tbfd;
      bfd_boolean ntdef, tdef;
      asection *ntsec, *tsec;

      if (h->type == STT_TLS)
  {
    ntbfd = abfd; 
    ntsec = sec;
    ntdef = newdef;
    tbfd = oldbfd;
    tsec = oldsec;
    tdef = olddef;
  }
      else
  {
    ntbfd = oldbfd;
    ntsec = oldsec;
    ntdef = olddef;
    tbfd = abfd;
    tsec = sec;
    tdef = newdef;
  }

      if (tdef && ntdef)
  (*_bfd_error_handler)
    (_("%s: TLS definition in %B section %A mismatches non-TLS definition in %B section %A"),
     tbfd, tsec, ntbfd, ntsec, h->root.root.string);
      else if (!tdef && !ntdef)
  (*_bfd_error_handler)
    (_("%s: TLS reference in %B mismatches non-TLS reference in %B"),
     tbfd, ntbfd, h->root.root.string);
      else if (tdef)
  (*_bfd_error_handler)
    (_("%s: TLS definition in %B section %A mismatches non-TLS reference in %B"),
     tbfd, tsec, ntbfd, h->root.root.string);
      else
  (*_bfd_error_handler)
    (_("%s: TLS reference in %B mismatches non-TLS definition in %B section %A"),
     tbfd, ntbfd, ntsec, h->root.root.string);

      bfd_set_error (bfd_error_bad_value);
      return FALSE;
    }

  /* We need to remember if a symbol has a definition in a dynamic
     object or is weak in all dynamic objects. Internal and hidden
     visibility will make it unavailable to dynamic objects.  */
  if (newdyn && !h->dynamic_def)
    {
      if (!bfd_is_und_section (sec))
  h->dynamic_def = 1;
      else
  {
    /* Check if this symbol is weak in all dynamic objects. If it
       is the first time we see it in a dynamic object, we mark
       if it is weak. Otherwise, we clear it.  */
    if (!h->ref_dynamic)
      {
        if (bind == STB_WEAK)
    h->dynamic_weak = 1;
      }
    else if (bind != STB_WEAK)
      h->dynamic_weak = 0;
  }
    }

  /* If the old symbol has non-default visibility, we ignore the new
     definition from a dynamic object.  */
  if (newdyn
      && ELF_ST_VISIBILITY (h->other) != STV_DEFAULT
      && !bfd_is_und_section (sec))
    {
      *skip = TRUE;
      /* Make sure this symbol is dynamic.  */
      h->ref_dynamic = 1;
      /* A protected symbol has external availability. Make sure it is
   recorded as dynamic.

   FIXME: Should we check type and size for protected symbol?  */
      if (ELF_ST_VISIBILITY (h->other) == STV_PROTECTED)
  return bfd_elf_link_record_dynamic_symbol (info, h);
      else
  return TRUE;
    }
  else if (!newdyn
     && ELF_ST_VISIBILITY (sym->st_other) != STV_DEFAULT
     && h->def_dynamic)
    {
      /* If the new symbol with non-default visibility comes from a
   relocatable file and the old definition comes from a dynamic
   object, we remove the old definition.  */
      if ((*sym_hash)->root.type == bfd_link_hash_indirect)
  h = *sym_hash;

      if ((h->root.u.undef.next || info->hash->undefs_tail == &h->root)
    && bfd_is_und_section (sec))
  {
    /* If the new symbol is undefined and the old symbol was
       also undefined before, we need to make sure
       _bfd_generic_link_add_one_symbol doesn't mess
       up the linker hash table undefs list.  Since the old
       definition came from a dynamic object, it is still on the
       undefs list.  */
    h->root.type = bfd_link_hash_undefined;
    h->root.u.undef.abfd = abfd;
  }
      else
  {
    h->root.type = bfd_link_hash_new;
    h->root.u.undef.abfd = NULL;
  }

      if (h->def_dynamic)
  {
    h->def_dynamic = 0;
    h->ref_dynamic = 1;
    h->dynamic_def = 1;
  }
      /* FIXME: Should we check type and size for protected symbol?  */
      h->size = 0;
      h->type = 0;
      return TRUE;
    }

  /* Differentiate strong and weak symbols.  */
  newweak = bind == STB_WEAK;
  oldweak = (h->root.type == bfd_link_hash_defweak
       || h->root.type == bfd_link_hash_undefweak);

  /* If a new weak symbol definition comes from a regular file and the
     old symbol comes from a dynamic library, we treat the new one as
     strong.  Similarly, an old weak symbol definition from a regular
     file is treated as strong when the new symbol comes from a dynamic
     library.  Further, an old weak symbol from a dynamic library is
     treated as strong if the new symbol is from a dynamic library.
     This reflects the way glibc's ld.so works.

     Do this before setting *type_change_ok or *size_change_ok so that
     we warn properly when dynamic library symbols are overridden.  */

  if (newdef && !newdyn && olddyn)
    newweak = FALSE;
  if (olddef && newdyn)
    oldweak = FALSE;

  /* It's OK to change the type if either the existing symbol or the
     new symbol is weak.  A type change is also OK if the old symbol
     is undefined and the new symbol is defined.  */

  if (oldweak
      || newweak
      || (newdef
    && h->root.type == bfd_link_hash_undefined))
    *type_change_ok = TRUE;

  /* It's OK to change the size if either the existing symbol or the
     new symbol is weak, or if the old symbol is undefined.  */

  if (*type_change_ok
      || h->root.type == bfd_link_hash_undefined)
    *size_change_ok = TRUE;

  /* NEWDYNCOMMON and OLDDYNCOMMON indicate whether the new or old
     symbol, respectively, appears to be a common symbol in a dynamic
     object.  If a symbol appears in an uninitialized section, and is
     not weak, and is not a function, then it may be a common symbol
     which was resolved when the dynamic object was created.  We want
     to treat such symbols specially, because they raise special
     considerations when setting the symbol size: if the symbol
     appears as a common symbol in a regular object, and the size in
     the regular object is larger, we must make sure that we use the
     larger size.  This problematic case can always be avoided in C,
     but it must be handled correctly when using Fortran shared
     libraries.

     Note that if NEWDYNCOMMON is set, NEWDEF will be set, and
     likewise for OLDDYNCOMMON and OLDDEF.

     Note that this test is just a heuristic, and that it is quite
     possible to have an uninitialized symbol in a shared object which
     is really a definition, rather than a common symbol.  This could
     lead to some minor confusion when the symbol really is a common
     symbol in some regular object.  However, I think it will be
     harmless.  */

  if (newdyn
      && newdef
      && !newweak
      && (sec->flags & SEC_ALLOC) != 0
      && (sec->flags & SEC_LOAD) == 0
      && sym->st_size > 0
      && ELF_ST_TYPE (sym->st_info) != STT_FUNC)
    newdyncommon = TRUE;
  else
    newdyncommon = FALSE;

  if (olddyn
      && olddef
      && h->root.type == bfd_link_hash_defined
      && h->def_dynamic
      && (h->root.u.def.section->flags & SEC_ALLOC) != 0
      && (h->root.u.def.section->flags & SEC_LOAD) == 0
      && h->size > 0
      && h->type != STT_FUNC)
    olddyncommon = TRUE;
  else
    olddyncommon = FALSE;

  /* If both the old and the new symbols look like common symbols in a
     dynamic object, set the size of the symbol to the larger of the
     two.  */

  if (olddyncommon
      && newdyncommon
      && sym->st_size != h->size)
    {
      /* Since we think we have two common symbols, issue a multiple
   common warning if desired.  Note that we only warn if the
   size is different.  If the size is the same, we simply let
   the old symbol override the new one as normally happens with
   symbols defined in dynamic objects.  */

      if (! ((*info->callbacks->multiple_common)
       (info, h->root.root.string, oldbfd, bfd_link_hash_common,
        h->size, abfd, bfd_link_hash_common, sym->st_size)))
  return FALSE;

      if (sym->st_size > h->size)
  h->size = sym->st_size;

      *size_change_ok = TRUE;
    }

  /* If we are looking at a dynamic object, and we have found a
     definition, we need to see if the symbol was already defined by
     some other object.  If so, we want to use the existing
     definition, and we do not want to report a multiple symbol
     definition error; we do this by clobbering *PSEC to be
     bfd_und_section_ptr.

     We treat a common symbol as a definition if the symbol in the
     shared library is a function, since common symbols always
     represent variables; this can cause confusion in principle, but
     any such confusion would seem to indicate an erroneous program or
     shared library.  We also permit a common symbol in a regular
     object to override a weak symbol in a shared object.  */

  if (newdyn
      && newdef
      && (olddef
    || (h->root.type == bfd_link_hash_common
        && (newweak
      || ELF_ST_TYPE (sym->st_info) == STT_FUNC))))
    {
      *override = TRUE;
      newdef = FALSE;
      newdyncommon = FALSE;

      *psec = sec = bfd_und_section_ptr;
      *size_change_ok = TRUE;

      /* If we get here when the old symbol is a common symbol, then
   we are explicitly letting it override a weak symbol or
   function in a dynamic object, and we don't want to warn about
   a type change.  If the old symbol is a defined symbol, a type
   change warning may still be appropriate.  */

      if (h->root.type == bfd_link_hash_common)
  *type_change_ok = TRUE;
    }

  /* Handle the special case of an old common symbol merging with a
     new symbol which looks like a common symbol in a shared object.
     We change *PSEC and *PVALUE to make the new symbol look like a
     common symbol, and let _bfd_generic_link_add_one_symbol will do
     the right thing.  */

  if (newdyncommon
      && h->root.type == bfd_link_hash_common)
    {
      *override = TRUE;
      newdef = FALSE;
      newdyncommon = FALSE;
      *pvalue = sym->st_size;
      *psec = sec = bfd_com_section_ptr;
      *size_change_ok = TRUE;
    }

  /* If the old symbol is from a dynamic object, and the new symbol is
     a definition which is not from a dynamic object, then the new
     symbol overrides the old symbol.  Symbols from regular files
     always take precedence over symbols from dynamic objects, even if
     they are defined after the dynamic object in the link.

     As above, we again permit a common symbol in a regular object to
     override a definition in a shared object if the shared object
     symbol is a function or is weak.  */

  flip = NULL;
  if (!newdyn
      && (newdef
    || (bfd_is_com_section (sec)
        && (oldweak
      || h->type == STT_FUNC)))
      && olddyn
      && olddef
      && h->def_dynamic)
    {
      /* Change the hash table entry to undefined, and let
   _bfd_generic_link_add_one_symbol do the right thing with the
   new definition.  */

      h->root.type = bfd_link_hash_undefined;
      h->root.u.undef.abfd = h->root.u.def.section->owner;
      *size_change_ok = TRUE;

      olddef = FALSE;
      olddyncommon = FALSE;

      /* We again permit a type change when a common symbol may be
   overriding a function.  */

      if (bfd_is_com_section (sec))
  *type_change_ok = TRUE;

      if ((*sym_hash)->root.type == bfd_link_hash_indirect)
  flip = *sym_hash;
      else
  /* This union may have been set to be non-NULL when this symbol
     was seen in a dynamic object.  We must force the union to be
     NULL, so that it is correct for a regular symbol.  */
  h->verinfo.vertree = NULL;
    }

  /* Handle the special case of a new common symbol merging with an
     old symbol that looks like it might be a common symbol defined in
     a shared object.  Note that we have already handled the case in
     which a new common symbol should simply override the definition
     in the shared library.  */

  if (! newdyn
      && bfd_is_com_section (sec)
      && olddyncommon)
    {
      /* It would be best if we could set the hash table entry to a
   common symbol, but we don't know what to use for the section
   or the alignment.  */
      if (! ((*info->callbacks->multiple_common)
       (info, h->root.root.string, oldbfd, bfd_link_hash_common,
        h->size, abfd, bfd_link_hash_common, sym->st_size)))
  return FALSE;

      /* If the presumed common symbol in the dynamic object is
   larger, pretend that the new symbol has its size.  */

      if (h->size > *pvalue)
  *pvalue = h->size;

      /* We need to remember the alignment required by the symbol
   in the dynamic object.  */
      BFD_ASSERT (pold_alignment);
      *pold_alignment = h->root.u.def.section->alignment_power;

      olddef = FALSE;
      olddyncommon = FALSE;

      h->root.type = bfd_link_hash_undefined;
      h->root.u.undef.abfd = h->root.u.def.section->owner;

      *size_change_ok = TRUE;
      *type_change_ok = TRUE;

      if ((*sym_hash)->root.type == bfd_link_hash_indirect)
  flip = *sym_hash;
      else
  h->verinfo.vertree = NULL;
    }

  if (flip != NULL)
    {
      /* Handle the case where we had a versioned symbol in a dynamic
   library and now find a definition in a normal object.  In this
   case, we make the versioned symbol point to the normal one.  */
      const struct elf_backend_data *bed = get_elf_backend_data (abfd);
      flip->root.type = h->root.type;
      h->root.type = bfd_link_hash_indirect;
      h->root.u.i.link = (struct bfd_link_hash_entry *) flip;
      (*bed->elf_backend_copy_indirect_symbol) (bed, flip, h);
      flip->root.u.undef.abfd = h->root.u.undef.abfd;
      if (h->def_dynamic)
  {
    h->def_dynamic = 0;
    flip->ref_dynamic = 1;
  }
    }

  return TRUE;
}

/* This function is called to create an indirect symbol from the
   default for the symbol with the default version if needed. The
   symbol is described by H, NAME, SYM, PSEC, VALUE, and OVERRIDE.  We
   set DYNSYM if the new indirect symbol is dynamic.  */

bfd_boolean
_bfd_elf_add_default_symbol (bfd *abfd,
           struct bfd_link_info *info,
           struct elf_link_hash_entry *h,
           const char *name,
           Elf_Internal_Sym *sym,
           asection **psec,
           bfd_vma *value,
           bfd_boolean *dynsym,
           bfd_boolean override)
{
  bfd_boolean type_change_ok;
  bfd_boolean size_change_ok;
  bfd_boolean skip;
  char *shortname;
  struct elf_link_hash_entry *hi;
  struct bfd_link_hash_entry *bh;
  const struct elf_backend_data *bed;
  bfd_boolean collect;
  bfd_boolean dynamic;
  char *p;
  size_t len, shortlen;
  asection *sec;

  /* If this symbol has a version, and it is the default version, we
     create an indirect symbol from the default name to the fully
     decorated name.  This will cause external references which do not
     specify a version to be bound to this version of the symbol.  */
  p = strchr (name, ELF_VER_CHR);
  if (p == NULL || p[1] != ELF_VER_CHR)
    return TRUE;

  if (override)
    {
      /* We are overridden by an old definition. We need to check if we
   need to create the indirect symbol from the default name.  */
      hi = elf_link_hash_lookup (elf_hash_table (info), name, TRUE,
         FALSE, FALSE);
      BFD_ASSERT (hi != NULL);
      if (hi == h)
  return TRUE;
      while (hi->root.type == bfd_link_hash_indirect
       || hi->root.type == bfd_link_hash_warning)
  {
    hi = (struct elf_link_hash_entry *) hi->root.u.i.link;
    if (hi == h)
      return TRUE;
  }
    }

  bed = get_elf_backend_data (abfd);
  collect = bed->collect;
  dynamic = (abfd->flags & DYNAMIC) != 0;

  shortlen = p - name;
  shortname = bfd_hash_allocate (&info->hash->table, shortlen + 1);
  if (shortname == NULL)
    return FALSE;
  memcpy (shortname, name, shortlen);
  shortname[shortlen] = '\0';

  /* We are going to create a new symbol.  Merge it with any existing
     symbol with this name.  For the purposes of the merge, act as
     though we were defining the symbol we just defined, although we
     actually going to define an indirect symbol.  */
  type_change_ok = FALSE;
  size_change_ok = FALSE;
  sec = *psec;
  if (!_bfd_elf_merge_symbol (abfd, info, shortname, sym, &sec, value,
            NULL, &hi, &skip, &override,
            &type_change_ok, &size_change_ok))
    return FALSE;

  if (skip)
    goto nondefault;

  if (! override)
    {
      bh = &hi->root;
      if (! (_bfd_generic_link_add_one_symbol
       (info, abfd, shortname, BSF_INDIRECT, bfd_ind_section_ptr,
        0, name, FALSE, collect, &bh)))
  return FALSE;
      hi = (struct elf_link_hash_entry *) bh;
    }
  else
    {
      /* In this case the symbol named SHORTNAME is overriding the
   indirect symbol we want to add.  We were planning on making
   SHORTNAME an indirect symbol referring to NAME.  SHORTNAME
   is the name without a version.  NAME is the fully versioned
   name, and it is the default version.

   Overriding means that we already saw a definition for the
   symbol SHORTNAME in a regular object, and it is overriding
   the symbol defined in the dynamic object.

   When this happens, we actually want to change NAME, the
   symbol we just added, to refer to SHORTNAME.  This will cause
   references to NAME in the shared object to become references
   to SHORTNAME in the regular object.  This is what we expect
   when we override a function in a shared object: that the
   references in the shared object will be mapped to the
   definition in the regular object.  */

      while (hi->root.type == bfd_link_hash_indirect
       || hi->root.type == bfd_link_hash_warning)
  hi = (struct elf_link_hash_entry *) hi->root.u.i.link;

      h->root.type = bfd_link_hash_indirect;
      h->root.u.i.link = (struct bfd_link_hash_entry *) hi;
      if (h->def_dynamic)
  {
    h->def_dynamic = 0;
    hi->ref_dynamic = 1;
    if (hi->ref_regular
        || hi->def_regular)
      {
        if (! bfd_elf_link_record_dynamic_symbol (info, hi))
    return FALSE;
      }
  }

      /* Now set HI to H, so that the following code will set the
   other fields correctly.  */
      hi = h;
    }

  /* If there is a duplicate definition somewhere, then HI may not
     point to an indirect symbol.  We will have reported an error to
     the user in that case.  */

  if (hi->root.type == bfd_link_hash_indirect)
    {
      struct elf_link_hash_entry *ht;

      ht = (struct elf_link_hash_entry *) hi->root.u.i.link;
      (*bed->elf_backend_copy_indirect_symbol) (bed, ht, hi);

      /* See if the new flags lead us to realize that the symbol must
   be dynamic.  */
      if (! *dynsym)
  {
    if (! dynamic)
      {
        if (info->shared
      || hi->ref_dynamic)
    *dynsym = TRUE;
      }
    else
      {
        if (hi->ref_regular)
    *dynsym = TRUE;
      }
  }
    }

  /* We also need to define an indirection from the nondefault version
     of the symbol.  */

nondefault:
  len = strlen (name);
  shortname = bfd_hash_allocate (&info->hash->table, len);
  if (shortname == NULL)
    return FALSE;
  memcpy (shortname, name, shortlen);
  memcpy (shortname + shortlen, p + 1, len - shortlen);

  /* Once again, merge with any existing symbol.  */
  type_change_ok = FALSE;
  size_change_ok = FALSE;
  sec = *psec;
  if (!_bfd_elf_merge_symbol (abfd, info, shortname, sym, &sec, value,
            NULL, &hi, &skip, &override,
            &type_change_ok, &size_change_ok))
    return FALSE;

  if (skip)
    return TRUE;

  if (override)
    {
      /* Here SHORTNAME is a versioned name, so we don't expect to see
   the type of override we do in the case above unless it is
   overridden by a versioned definition.  */
      if (hi->root.type != bfd_link_hash_defined
    && hi->root.type != bfd_link_hash_defweak)
  (*_bfd_error_handler)
    (_("%B: unexpected redefinition of indirect versioned symbol `%s'"),
     abfd, shortname);
    }
  else
    {
      bh = &hi->root;
      if (! (_bfd_generic_link_add_one_symbol
       (info, abfd, shortname, BSF_INDIRECT,
        bfd_ind_section_ptr, 0, name, FALSE, collect, &bh)))
  return FALSE;
      hi = (struct elf_link_hash_entry *) bh;

      /* If there is a duplicate definition somewhere, then HI may not
   point to an indirect symbol.  We will have reported an error
   to the user in that case.  */

      if (hi->root.type == bfd_link_hash_indirect)
  {
    (*bed->elf_backend_copy_indirect_symbol) (bed, h, hi);

    /* See if the new flags lead us to realize that the symbol
       must be dynamic.  */
    if (! *dynsym)
      {
        if (! dynamic)
    {
      if (info->shared
          || hi->ref_dynamic)
        *dynsym = TRUE;
    }
        else
    {
      if (hi->ref_regular)
        *dynsym = TRUE;
    }
      }
  }
    }

  return TRUE;
}

/* This routine is used to export all defined symbols into the dynamic
   symbol table.  It is called via elf_link_hash_traverse.  */

bfd_boolean
_bfd_elf_export_symbol (struct elf_link_hash_entry *h, void *data)
{
  struct elf_info_failed *eif = data;

  /* Ignore indirect symbols.  These are added by the versioning code.  */
  if (h->root.type == bfd_link_hash_indirect)
    return TRUE;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  if (h->dynindx == -1
      && (h->def_regular
    || h->ref_regular))
    {
      struct bfd_elf_version_tree *t;
      struct bfd_elf_version_expr *d;

      for (t = eif->verdefs; t != NULL; t = t->next)
  {
    if (t->globals.list != NULL)
      {
        d = (*t->match) (&t->globals, NULL, h->root.root.string);
        if (d != NULL)
    goto doit;
      }

    if (t->locals.list != NULL)
      {
        d = (*t->match) (&t->locals, NULL, h->root.root.string);
        if (d != NULL)
    return TRUE;
      }
  }

      if (!eif->verdefs)
  {
  doit:
    if (! bfd_elf_link_record_dynamic_symbol (eif->info, h))
      {
        eif->failed = TRUE;
        return FALSE;
      }
  }
    }

  return TRUE;
}

/* Look through the symbols which are defined in other shared
   libraries and referenced here.  Update the list of version
   dependencies.  This will be put into the .gnu.version_r section.
   This function is called via elf_link_hash_traverse.  */

bfd_boolean
_bfd_elf_link_find_version_dependencies (struct elf_link_hash_entry *h,
           void *data)
{
  struct elf_find_verdep_info *rinfo = data;
  Elf_Internal_Verneed *t;
  Elf_Internal_Vernaux *a;
  bfd_size_type amt;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  /* We only care about symbols defined in shared objects with version
     information.  */
  if (!h->def_dynamic
      || h->def_regular
      || h->dynindx == -1
      || h->verinfo.verdef == NULL)
    return TRUE;

  /* See if we already know about this version.  */
  for (t = elf_tdata (rinfo->output_bfd)->verref; t != NULL; t = t->vn_nextref)
    {
      if (t->vn_bfd != h->verinfo.verdef->vd_bfd)
  continue;

      for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr)
  if (a->vna_nodename == h->verinfo.verdef->vd_nodename)
    return TRUE;

      break;
    }

  /* This is a new version.  Add it to tree we are building.  */

  if (t == NULL)
    {
      amt = sizeof *t;
      t = bfd_zalloc (rinfo->output_bfd, amt);
      if (t == NULL)
  {
    rinfo->failed = TRUE;
    return FALSE;
  }

      t->vn_bfd = h->verinfo.verdef->vd_bfd;
      t->vn_nextref = elf_tdata (rinfo->output_bfd)->verref;
      elf_tdata (rinfo->output_bfd)->verref = t;
    }

  amt = sizeof *a;
  a = bfd_zalloc (rinfo->output_bfd, amt);

  /* Note that we are copying a string pointer here, and testing it
     above.  If bfd_elf_string_from_elf_section is ever changed to
     discard the string data when low in memory, this will have to be
     fixed.  */
  a->vna_nodename = h->verinfo.verdef->vd_nodename;

  a->vna_flags = h->verinfo.verdef->vd_flags;
  a->vna_nextptr = t->vn_auxptr;

  h->verinfo.verdef->vd_exp_refno = rinfo->vers;
  ++rinfo->vers;

  a->vna_other = h->verinfo.verdef->vd_exp_refno + 1;

  t->vn_auxptr = a;

  return TRUE;
}

/* Figure out appropriate versions for all the symbols.  We may not
   have the version number script until we have read all of the input
   files, so until that point we don't know which symbols should be
   local.  This function is called via elf_link_hash_traverse.  */

bfd_boolean
_bfd_elf_link_assign_sym_version (struct elf_link_hash_entry *h, void *data)
{
  struct elf_assign_sym_version_info *sinfo;
  struct bfd_link_info *info;
  const struct elf_backend_data *bed;
  struct elf_info_failed eif;
  char *p;
  bfd_size_type amt;

  sinfo = data;
  info = sinfo->info;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  /* Fix the symbol flags.  */
  eif.failed = FALSE;
  eif.info = info;
  if (! _bfd_elf_fix_symbol_flags (h, &eif))
    {
      if (eif.failed)
  sinfo->failed = TRUE;
      return FALSE;
    }

  /* We only need version numbers for symbols defined in regular
     objects.  */
  if (!h->def_regular)
    return TRUE;

  bed = get_elf_backend_data (sinfo->output_bfd);
  p = strchr (h->root.root.string, ELF_VER_CHR);
  if (p != NULL && h->verinfo.vertree == NULL)
    {
      struct bfd_elf_version_tree *t;
      bfd_boolean hidden;

      hidden = TRUE;

      /* There are two consecutive ELF_VER_CHR characters if this is
   not a hidden symbol.  */
      ++p;
      if (*p == ELF_VER_CHR)
  {
    hidden = FALSE;
    ++p;
  }

      /* If there is no version string, we can just return out.  */
      if (*p == '\0')
  {
    if (hidden)
      h->hidden = 1;
    return TRUE;
  }

      /* Look for the version.  If we find it, it is no longer weak.  */
      for (t = sinfo->verdefs; t != NULL; t = t->next)
  {
    if (strcmp (t->name, p) == 0)
      {
        size_t len;
        char *alc;
        struct bfd_elf_version_expr *d;

        len = p - h->root.root.string;
        alc = bfd_malloc (len);
        if (alc == NULL)
    return FALSE;
        memcpy (alc, h->root.root.string, len - 1);
        alc[len - 1] = '\0';
        if (alc[len - 2] == ELF_VER_CHR)
    alc[len - 2] = '\0';

        h->verinfo.vertree = t;
        t->used = TRUE;
        d = NULL;

        if (t->globals.list != NULL)
    d = (*t->match) (&t->globals, NULL, alc);

        /* See if there is anything to force this symbol to
     local scope.  */
        if (d == NULL && t->locals.list != NULL)
    {
      d = (*t->match) (&t->locals, NULL, alc);
      if (d != NULL
          && h->dynindx != -1
          && info->shared
          && ! info->export_dynamic)
        (*bed->elf_backend_hide_symbol) (info, h, TRUE);
    }

        free (alc);
        break;
      }
  }

      /* If we are building an application, we need to create a
   version node for this version.  */
      if (t == NULL && info->executable)
  {
    struct bfd_elf_version_tree **pp;
    int version_index;

    /* If we aren't going to export this symbol, we don't need
       to worry about it.  */
    if (h->dynindx == -1)
      return TRUE;

    amt = sizeof *t;
    t = bfd_zalloc (sinfo->output_bfd, amt);
    if (t == NULL)
      {
        sinfo->failed = TRUE;
        return FALSE;
      }

    t->name = p;
    t->name_indx = (unsigned int) -1;
    t->used = TRUE;

    version_index = 1;
    /* Don't count anonymous version tag.  */
    if (sinfo->verdefs != NULL && sinfo->verdefs->vernum == 0)
      version_index = 0;
    for (pp = &sinfo->verdefs; *pp != NULL; pp = &(*pp)->next)
      ++version_index;
    t->vernum = version_index;

    *pp = t;

    h->verinfo.vertree = t;
  }
      else if (t == NULL)
  {
    /* We could not find the version for a symbol when
       generating a shared archive.  Return an error.  */
    (*_bfd_error_handler)
      (_("%B: undefined versioned symbol name %s"),
       sinfo->output_bfd, h->root.root.string);
    bfd_set_error (bfd_error_bad_value);
    sinfo->failed = TRUE;
    return FALSE;
  }

      if (hidden)
  h->hidden = 1;
    }

  /* If we don't have a version for this symbol, see if we can find
     something.  */
  if (h->verinfo.vertree == NULL && sinfo->verdefs != NULL)
    {
      struct bfd_elf_version_tree *t;
      struct bfd_elf_version_tree *local_ver;
      struct bfd_elf_version_expr *d;

      /* See if can find what version this symbol is in.  If the
   symbol is supposed to be local, then don't actually register
   it.  */
      local_ver = NULL;
      for (t = sinfo->verdefs; t != NULL; t = t->next)
  {
    if (t->globals.list != NULL)
      {
        bfd_boolean matched;

        matched = FALSE;
        d = NULL;
        while ((d = (*t->match) (&t->globals, d,
               h->root.root.string)) != NULL)
    if (d->symver)
      matched = TRUE;
    else
      {
        /* There is a version without definition.  Make
           the symbol the default definition for this
           version.  */
        h->verinfo.vertree = t;
        local_ver = NULL;
        d->script = 1;
        break;
      }
        if (d != NULL)
    break;
        else if (matched)
    /* There is no undefined version for this symbol. Hide the
       default one.  */
    (*bed->elf_backend_hide_symbol) (info, h, TRUE);
      }

    if (t->locals.list != NULL)
      {
        d = NULL;
        while ((d = (*t->match) (&t->locals, d,
               h->root.root.string)) != NULL)
    {
      local_ver = t;
      /* If the match is "*", keep looking for a more
         explicit, perhaps even global, match.
         XXX: Shouldn't this be !d->wildcard instead?  */
      if (d->pattern[0] != '*' || d->pattern[1] != '\0')
        break;
    }

        if (d != NULL)
    break;
      }
  }

      if (local_ver != NULL)
  {
    h->verinfo.vertree = local_ver;
    if (h->dynindx != -1
        && info->shared
        && ! info->export_dynamic)
      {
        (*bed->elf_backend_hide_symbol) (info, h, TRUE);
      }
  }
    }

  return TRUE;
}

/* Read and swap the relocs from the section indicated by SHDR.  This
   may be either a REL or a RELA section.  The relocations are
   translated into RELA relocations and stored in INTERNAL_RELOCS,
   which should have already been allocated to contain enough space.
   The EXTERNAL_RELOCS are a buffer where the external form of the
   relocations should be stored.

   Returns FALSE if something goes wrong.  */

static bfd_boolean
elf_link_read_relocs_from_section (bfd *abfd,
           asection *sec,
           Elf_Internal_Shdr *shdr,
           void *external_relocs,
           Elf_Internal_Rela *internal_relocs)
{
  const struct elf_backend_data *bed;
  void (*swap_in) (bfd *, const bfd_byte *, Elf_Internal_Rela *);
  const bfd_byte *erela;
  const bfd_byte *erelaend;
  Elf_Internal_Rela *irela;
  Elf_Internal_Shdr *symtab_hdr;
  size_t nsyms;

  /* Position ourselves at the start of the section.  */
  if (bfd_seek (abfd, shdr->sh_offset, SEEK_SET) != 0)
    return FALSE;

  /* Read the relocations.  */
  if (bfd_bread (external_relocs, shdr->sh_size, abfd) != shdr->sh_size)
    return FALSE;

  symtab_hdr = &elf_tdata (abfd)->symtab_hdr;
  nsyms = symtab_hdr->sh_size / symtab_hdr->sh_entsize;

  bed = get_elf_backend_data (abfd);

  /* Convert the external relocations to the internal format.  */
  if (shdr->sh_entsize == bed->s->sizeof_rel)
    swap_in = bed->s->swap_reloc_in;
  else if (shdr->sh_entsize == bed->s->sizeof_rela)
    swap_in = bed->s->swap_reloca_in;
  else
    {
      bfd_set_error (bfd_error_wrong_format);
      return FALSE;
    }

  erela = external_relocs;
  erelaend = erela + shdr->sh_size;
  irela = internal_relocs;
  while (erela < erelaend)
    {
      bfd_vma r_symndx;

      (*swap_in) (abfd, erela, irela);
      r_symndx = ELF32_R_SYM (irela->r_info);
      if (bed->s->arch_size == 64)
  r_symndx >>= 24;
      if ((size_t) r_symndx >= nsyms)
  {
    (*_bfd_error_handler)
      (_("%B: bad reloc symbol index (0x%lx >= 0x%lx)"
         " for offset 0x%lx in section `%A'"),
       abfd, sec,
       (unsigned long) r_symndx, (unsigned long) nsyms, irela->r_offset);
    bfd_set_error (bfd_error_bad_value);
    return FALSE;
  }
      irela += bed->s->int_rels_per_ext_rel;
      erela += shdr->sh_entsize;
    }

  return TRUE;
}

/* Read and swap the relocs for a section O.  They may have been
   cached.  If the EXTERNAL_RELOCS and INTERNAL_RELOCS arguments are
   not NULL, they are used as buffers to read into.  They are known to
   be large enough.  If the INTERNAL_RELOCS relocs argument is NULL,
   the return value is allocated using either malloc or bfd_alloc,
   according to the KEEP_MEMORY argument.  If O has two relocation
   sections (both REL and RELA relocations), then the REL_HDR
   relocations will appear first in INTERNAL_RELOCS, followed by the
   REL_HDR2 relocations.  */

Elf_Internal_Rela *
_bfd_elf_link_read_relocs (bfd *abfd,
         asection *o,
         void *external_relocs,
         Elf_Internal_Rela *internal_relocs,
         bfd_boolean keep_memory)
{
  Elf_Internal_Shdr *rel_hdr;
  void *alloc1 = NULL;
  Elf_Internal_Rela *alloc2 = NULL;
  const struct elf_backend_data *bed = get_elf_backend_data (abfd);

  if (elf_section_data (o)->relocs != NULL)
    return elf_section_data (o)->relocs;

  if (o->reloc_count == 0)
    return NULL;

  rel_hdr = &elf_section_data (o)->rel_hdr;

  if (internal_relocs == NULL)
    {
      bfd_size_type size;

      size = o->reloc_count;
      size *= bed->s->int_rels_per_ext_rel * sizeof (Elf_Internal_Rela);
      if (keep_memory)
  internal_relocs = bfd_alloc (abfd, size);
      else
  internal_relocs = alloc2 = bfd_malloc (size);
      if (internal_relocs == NULL)
  goto error_return;
    }

  if (external_relocs == NULL)
    {
      bfd_size_type size = rel_hdr->sh_size;

      if (elf_section_data (o)->rel_hdr2)
  size += elf_section_data (o)->rel_hdr2->sh_size;
      alloc1 = bfd_malloc (size);
      if (alloc1 == NULL)
  goto error_return;
      external_relocs = alloc1;
    }

  if (!elf_link_read_relocs_from_section (abfd, o, rel_hdr,
            external_relocs,
            internal_relocs))
    goto error_return;
  if (elf_section_data (o)->rel_hdr2
      && (!elf_link_read_relocs_from_section
    (abfd, o,
     elf_section_data (o)->rel_hdr2,
     ((bfd_byte *) external_relocs) + rel_hdr->sh_size,
     internal_relocs + (NUM_SHDR_ENTRIES (rel_hdr)
            * bed->s->int_rels_per_ext_rel))))
    goto error_return;

  /* Cache the results for next time, if we can.  */
  if (keep_memory)
    elf_section_data (o)->relocs = internal_relocs;

  if (alloc1 != NULL)
    free (alloc1);

  /* Don't free alloc2, since if it was allocated we are passing it
     back (under the name of internal_relocs).  */

  return internal_relocs;

 error_return:
  if (alloc1 != NULL)
    free (alloc1);
  if (alloc2 != NULL)
    free (alloc2);
  return NULL;
}

/* Compute the size of, and allocate space for, REL_HDR which is the
   section header for a section containing relocations for O.  */

bfd_boolean
_bfd_elf_link_size_reloc_section (bfd *abfd,
          Elf_Internal_Shdr *rel_hdr,
          asection *o)
{
  bfd_size_type reloc_count;
  bfd_size_type num_rel_hashes;

  /* Figure out how many relocations there will be.  */
  if (rel_hdr == &elf_section_data (o)->rel_hdr)
    reloc_count = elf_section_data (o)->rel_count;
  else
    reloc_count = elf_section_data (o)->rel_count2;

  num_rel_hashes = o->reloc_count;
  if (num_rel_hashes < reloc_count)
    num_rel_hashes = reloc_count;

  /* That allows us to calculate the size of the section.  */
  rel_hdr->sh_size = rel_hdr->sh_entsize * reloc_count;

  /* The contents field must last into write_object_contents, so we
     allocate it with bfd_alloc rather than malloc.  Also since we
     cannot be sure that the contents will actually be filled in,
     we zero the allocated space.  */
  rel_hdr->contents = bfd_zalloc (abfd, rel_hdr->sh_size);
  if (rel_hdr->contents == NULL && rel_hdr->sh_size != 0)
    return FALSE;

  /* We only allocate one set of hash entries, so we only do it the
     first time we are called.  */
  if (elf_section_data (o)->rel_hashes == NULL
      && num_rel_hashes)
    {
      struct elf_link_hash_entry **p;

      p = bfd_zmalloc (num_rel_hashes * sizeof (struct elf_link_hash_entry *));
      if (p == NULL)
  return FALSE;

      elf_section_data (o)->rel_hashes = p;
    }

  return TRUE;
}

/* Copy the relocations indicated by the INTERNAL_RELOCS (which
   originated from the section given by INPUT_REL_HDR) to the
   OUTPUT_BFD.  */

bfd_boolean
_bfd_elf_link_output_relocs (bfd *output_bfd,
           asection *input_section,
           Elf_Internal_Shdr *input_rel_hdr,
           Elf_Internal_Rela *internal_relocs)
{
  Elf_Internal_Rela *irela;
  Elf_Internal_Rela *irelaend;
  bfd_byte *erel;
  Elf_Internal_Shdr *output_rel_hdr;
  asection *output_section;
  unsigned int *rel_countp = NULL;
  const struct elf_backend_data *bed;
  void (*swap_out) (bfd *, const Elf_Internal_Rela *, bfd_byte *);

  output_section = input_section->output_section;
  output_rel_hdr = NULL;

  if (elf_section_data (output_section)->rel_hdr.sh_entsize
      == input_rel_hdr->sh_entsize)
    {
      output_rel_hdr = &elf_section_data (output_section)->rel_hdr;
      rel_countp = &elf_section_data (output_section)->rel_count;
    }
  else if (elf_section_data (output_section)->rel_hdr2
     && (elf_section_data (output_section)->rel_hdr2->sh_entsize
         == input_rel_hdr->sh_entsize))
    {
      output_rel_hdr = elf_section_data (output_section)->rel_hdr2;
      rel_countp = &elf_section_data (output_section)->rel_count2;
    }
  else
    {
      (*_bfd_error_handler)
  (_("%B: relocation size mismatch in %B section %A"),
   output_bfd, input_section->owner, input_section);
      bfd_set_error (bfd_error_wrong_object_format);
      return FALSE;
    }

  bed = get_elf_backend_data (output_bfd);
  if (input_rel_hdr->sh_entsize == bed->s->sizeof_rel)
    swap_out = bed->s->swap_reloc_out;
  else if (input_rel_hdr->sh_entsize == bed->s->sizeof_rela)
    swap_out = bed->s->swap_reloca_out;
  else
    abort ();

  erel = output_rel_hdr->contents;
  erel += *rel_countp * input_rel_hdr->sh_entsize;
  irela = internal_relocs;
  irelaend = irela + (NUM_SHDR_ENTRIES (input_rel_hdr)
          * bed->s->int_rels_per_ext_rel);
  while (irela < irelaend)
    {
      (*swap_out) (output_bfd, irela, erel);
      irela += bed->s->int_rels_per_ext_rel;
      erel += input_rel_hdr->sh_entsize;
    }

  /* Bump the counter, so that we know where to add the next set of
     relocations.  */
  *rel_countp += NUM_SHDR_ENTRIES (input_rel_hdr);

  return TRUE;
}

/* Fix up the flags for a symbol.  This handles various cases which
   can only be fixed after all the input files are seen.  This is
   currently called by both adjust_dynamic_symbol and
   assign_sym_version, which is unnecessary but perhaps more robust in
   the face of future changes.  */

bfd_boolean
_bfd_elf_fix_symbol_flags (struct elf_link_hash_entry *h,
         struct elf_info_failed *eif)
{
  /* If this symbol was mentioned in a non-ELF file, try to set
     DEF_REGULAR and REF_REGULAR correctly.  This is the only way to
     permit a non-ELF file to correctly refer to a symbol defined in
     an ELF dynamic object.  */
  if (h->non_elf)
    {
      while (h->root.type == bfd_link_hash_indirect)
  h = (struct elf_link_hash_entry *) h->root.u.i.link;

      if (h->root.type != bfd_link_hash_defined
    && h->root.type != bfd_link_hash_defweak)
  {
    h->ref_regular = 1;
    h->ref_regular_nonweak = 1;
  }
      else
  {
    if (h->root.u.def.section->owner != NULL
        && (bfd_get_flavour (h->root.u.def.section->owner)
      == bfd_target_elf_flavour))
      {
        h->ref_regular = 1;
        h->ref_regular_nonweak = 1;
      }
    else
      h->def_regular = 1;
  }

      if (h->dynindx == -1
    && (h->def_dynamic
        || h->ref_dynamic))
  {
    if (! bfd_elf_link_record_dynamic_symbol (eif->info, h))
      {
        eif->failed = TRUE;
        return FALSE;
      }
  }
    }
  else
    {
      /* Unfortunately, NON_ELF is only correct if the symbol
   was first seen in a non-ELF file.  Fortunately, if the symbol
   was first seen in an ELF file, we're probably OK unless the
   symbol was defined in a non-ELF file.  Catch that case here.
   FIXME: We're still in trouble if the symbol was first seen in
   a dynamic object, and then later in a non-ELF regular object.  */
      if ((h->root.type == bfd_link_hash_defined
     || h->root.type == bfd_link_hash_defweak)
    && !h->def_regular
    && (h->root.u.def.section->owner != NULL
        ? (bfd_get_flavour (h->root.u.def.section->owner)
     != bfd_target_elf_flavour)
        : (bfd_is_abs_section (h->root.u.def.section)
     && !h->def_dynamic)))
  h->def_regular = 1;
    }

  /* If this is a final link, and the symbol was defined as a common
     symbol in a regular object file, and there was no definition in
     any dynamic object, then the linker will have allocated space for
     the symbol in a common section but the DEF_REGULAR
     flag will not have been set.  */
  if (h->root.type == bfd_link_hash_defined
      && !h->def_regular
      && h->ref_regular
      && !h->def_dynamic
      && (h->root.u.def.section->owner->flags & DYNAMIC) == 0)
    h->def_regular = 1;

  /* If -Bsymbolic was used (which means to bind references to global
     symbols to the definition within the shared object), and this
     symbol was defined in a regular object, then it actually doesn't
     need a PLT entry.  Likewise, if the symbol has non-default
     visibility.  If the symbol has hidden or internal visibility, we
     will force it local.  */
  if (h->needs_plt
      && eif->info->shared
      && is_elf_hash_table (eif->info->hash)
      && (eif->info->symbolic
    || ELF_ST_VISIBILITY (h->other) != STV_DEFAULT)
      && h->def_regular)
    {
      const struct elf_backend_data *bed;
      bfd_boolean force_local;

      bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj);

      force_local = (ELF_ST_VISIBILITY (h->other) == STV_INTERNAL
         || ELF_ST_VISIBILITY (h->other) == STV_HIDDEN);
      (*bed->elf_backend_hide_symbol) (eif->info, h, force_local);
    }

  /* If a weak undefined symbol has non-default visibility, we also
     hide it from the dynamic linker.  */
  if (ELF_ST_VISIBILITY (h->other) != STV_DEFAULT
      && h->root.type == bfd_link_hash_undefweak)
    {
      const struct elf_backend_data *bed;
      bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj);
      (*bed->elf_backend_hide_symbol) (eif->info, h, TRUE);
    }

  /* If this is a weak defined symbol in a dynamic object, and we know
     the real definition in the dynamic object, copy interesting flags
     over to the real definition.  */
  if (h->u.weakdef != NULL)
    {
      struct elf_link_hash_entry *weakdef;

      weakdef = h->u.weakdef;
      if (h->root.type == bfd_link_hash_indirect)
  h = (struct elf_link_hash_entry *) h->root.u.i.link;

      BFD_ASSERT (h->root.type == bfd_link_hash_defined
      || h->root.type == bfd_link_hash_defweak);
      BFD_ASSERT (weakdef->root.type == bfd_link_hash_defined
      || weakdef->root.type == bfd_link_hash_defweak);
      BFD_ASSERT (weakdef->def_dynamic);

      /* If the real definition is defined by a regular object file,
   don't do anything special.  See the longer description in
   _bfd_elf_adjust_dynamic_symbol, below.  */
      if (weakdef->def_regular)
  h->u.weakdef = NULL;
      else
  {
    const struct elf_backend_data *bed;

    bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj);
    (*bed->elf_backend_copy_indirect_symbol) (bed, weakdef, h);
  }
    }

  return TRUE;
}

/* Make the backend pick a good value for a dynamic symbol.  This is
   called via elf_link_hash_traverse, and also calls itself
   recursively.  */

bfd_boolean
_bfd_elf_adjust_dynamic_symbol (struct elf_link_hash_entry *h, void *data)
{
  struct elf_info_failed *eif = data;
  bfd *dynobj;
  const struct elf_backend_data *bed;

  if (! is_elf_hash_table (eif->info->hash))
    return FALSE;

  if (h->root.type == bfd_link_hash_warning)
    {
      h->plt = elf_hash_table (eif->info)->init_offset;
      h->got = elf_hash_table (eif->info)->init_offset;

      /* When warning symbols are created, they **replace** the "real"
   entry in the hash table, thus we never get to see the real
   symbol in a hash traversal.  So look at it now.  */
      h = (struct elf_link_hash_entry *) h->root.u.i.link;
    }

  /* Ignore indirect symbols.  These are added by the versioning code.  */
  if (h->root.type == bfd_link_hash_indirect)
    return TRUE;

  /* Fix the symbol flags.  */
  if (! _bfd_elf_fix_symbol_flags (h, eif))
    return FALSE;

  /* If this symbol does not require a PLT entry, and it is not
     defined by a dynamic object, or is not referenced by a regular
     object, ignore it.  We do have to handle a weak defined symbol,
     even if no regular object refers to it, if we decided to add it
     to the dynamic symbol table.  FIXME: Do we normally need to worry
     about symbols which are defined by one dynamic object and
     referenced by another one?  */
  if (!h->needs_plt
      && (h->def_regular
    || !h->def_dynamic
    || (!h->ref_regular
        && (h->u.weakdef == NULL || h->u.weakdef->dynindx == -1))))
    {
      h->plt = elf_hash_table (eif->info)->init_offset;
      return TRUE;
    }

  /* If we've already adjusted this symbol, don't do it again.  This
     can happen via a recursive call.  */
  if (h->dynamic_adjusted)
    return TRUE;

  /* Don't look at this symbol again.  Note that we must set this
     after checking the above conditions, because we may look at a
     symbol once, decide not to do anything, and then get called
     recursively later after REF_REGULAR is set below.  */
  h->dynamic_adjusted = 1;

  /* If this is a weak definition, and we know a real definition, and
     the real symbol is not itself defined by a regular object file,
     then get a good value for the real definition.  We handle the
     real symbol first, for the convenience of the backend routine.

     Note that there is a confusing case here.  If the real definition
     is defined by a regular object file, we don't get the real symbol
     from the dynamic object, but we do get the weak symbol.  If the
     processor backend uses a COPY reloc, then if some routine in the
     dynamic object changes the real symbol, we will not see that
     change in the corresponding weak symbol.  This is the way other
     ELF linkers work as well, and seems to be a result of the shared
     library model.

     I will clarify this issue.  Most SVR4 shared libraries define the
     variable _timezone and define timezone as a weak synonym.  The
     tzset call changes _timezone.  If you write
       extern int timezone;
       int _timezone = 5;
       int main () { tzset (); printf ("%d %d\n", timezone, _timezone); }
     you might expect that, since timezone is a synonym for _timezone,
     the same number will print both times.  However, if the processor
     backend uses a COPY reloc, then actually timezone will be copied
     into your process image, and, since you define _timezone
     yourself, _timezone will not.  Thus timezone and _timezone will
     wind up at different memory locations.  The tzset call will set
     _timezone, leaving timezone unchanged.  */

  if (h->u.weakdef != NULL)
    {
      /* If we get to this point, we know there is an implicit
   reference by a regular object file via the weak symbol H.
   FIXME: Is this really true?  What if the traversal finds
   H->U.WEAKDEF before it finds H?  */
      h->u.weakdef->ref_regular = 1;

      if (! _bfd_elf_adjust_dynamic_symbol (h->u.weakdef, eif))
  return FALSE;
    }

  /* If a symbol has no type and no size and does not require a PLT
     entry, then we are probably about to do the wrong thing here: we
     are probably going to create a COPY reloc for an empty object.
     This case can arise when a shared object is built with assembly
     code, and the assembly code fails to set the symbol type.  */
  if (h->size == 0
      && h->type == STT_NOTYPE
      && !h->needs_plt)
    (*_bfd_error_handler)
      (_("warning: type and size of dynamic symbol `%s' are not defined"),
       h->root.root.string);

  dynobj = elf_hash_table (eif->info)->dynobj;
  bed = get_elf_backend_data (dynobj);
  if (! (*bed->elf_backend_adjust_dynamic_symbol) (eif->info, h))
    {
      eif->failed = TRUE;
      return FALSE;
    }

  return TRUE;
}

/* Adjust all external symbols pointing into SEC_MERGE sections
   to reflect the object merging within the sections.  */

bfd_boolean
_bfd_elf_link_sec_merge_syms (struct elf_link_hash_entry *h, void *data)
{
  asection *sec;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  if ((h->root.type == bfd_link_hash_defined
       || h->root.type == bfd_link_hash_defweak)
      && ((sec = h->root.u.def.section)->flags & SEC_MERGE)
      && sec->sec_info_type == ELF_INFO_TYPE_MERGE)
    {
      bfd *output_bfd = data;

      h->root.u.def.value =
  _bfd_merged_section_offset (output_bfd,
            &h->root.u.def.section,
            elf_section_data (sec)->sec_info,
            h->root.u.def.value);
    }

  return TRUE;
}

/* Returns false if the symbol referred to by H should be considered
   to resolve local to the current module, and true if it should be
   considered to bind dynamically.  */

bfd_boolean
_bfd_elf_dynamic_symbol_p (struct elf_link_hash_entry *h,
         struct bfd_link_info *info,
         bfd_boolean ignore_protected)
{
  bfd_boolean binding_stays_local_p;

  if (h == NULL)
    return FALSE;

  while (h->root.type == bfd_link_hash_indirect
   || h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  /* If it was forced local, then clearly it's not dynamic.  */
  if (h->dynindx == -1)
    return FALSE;
  if (h->forced_local)
    return FALSE;

  /* Identify the cases where name binding rules say that a
     visible symbol resolves locally.  */
  binding_stays_local_p = info->executable || info->symbolic;

  switch (ELF_ST_VISIBILITY (h->other))
    {
    case STV_INTERNAL:
    case STV_HIDDEN:
      return FALSE;

    case STV_PROTECTED:
      /* Proper resolution for function pointer equality may require
   that these symbols perhaps be resolved dynamically, even though
   we should be resolving them to the current module.  */
      if (!ignore_protected || h->type != STT_FUNC)
  binding_stays_local_p = TRUE;
      break;

    default:
      break;
    }

  /* If it isn't defined locally, then clearly it's dynamic.  */
  if (!h->def_regular)
    return TRUE;

  /* Otherwise, the symbol is dynamic if binding rules don't tell
     us that it remains local.  */
  return !binding_stays_local_p;
}

/* Return true if the symbol referred to by H should be considered
   to resolve local to the current module, and false otherwise.  Differs
   from (the inverse of) _bfd_elf_dynamic_symbol_p in the treatment of
   undefined symbols and weak symbols.  */

bfd_boolean
_bfd_elf_symbol_refs_local_p (struct elf_link_hash_entry *h,
            struct bfd_link_info *info,
            bfd_boolean local_protected)
{
  /* If it's a local sym, of course we resolve locally.  */
  if (h == NULL)
    return TRUE;

  /* Common symbols that become definitions don't get the DEF_REGULAR
     flag set, so test it first, and don't bail out.  */
  if (ELF_COMMON_DEF_P (h))
    /* Do nothing.  */;
  /* If we don't have a definition in a regular file, then we can't
     resolve locally.  The sym is either undefined or dynamic.  */
  else if (!h->def_regular)
    return FALSE;

  /* Forced local symbols resolve locally.  */
  if (h->forced_local)
    return TRUE;

  /* As do non-dynamic symbols.  */
  if (h->dynindx == -1)
    return TRUE;

  /* At this point, we know the symbol is defined and dynamic.  In an
     executable it must resolve locally, likewise when building symbolic
     shared libraries.  */
  if (info->executable || info->symbolic)
    return TRUE;

  /* Now deal with defined dynamic symbols in shared libraries.  Ones
     with default visibility might not resolve locally.  */
  if (ELF_ST_VISIBILITY (h->other) == STV_DEFAULT)
    return FALSE;

  /* However, STV_HIDDEN or STV_INTERNAL ones must be local.  */
  if (ELF_ST_VISIBILITY (h->other) != STV_PROTECTED)
    return TRUE;

  /* STV_PROTECTED non-function symbols are local.  */
  if (h->type != STT_FUNC)
    return TRUE;

  /* Function pointer equality tests may require that STV_PROTECTED
     symbols be treated as dynamic symbols, even when we know that the
     dynamic linker will resolve them locally.  */
  return local_protected;
}

/* Caches some TLS segment info, and ensures that the TLS segment vma is
   aligned.  Returns the first TLS output section.  */

struct bfd_section *
_bfd_elf_tls_setup (bfd *obfd, struct bfd_link_info *info)
{
  struct bfd_section *sec, *tls;
  unsigned int align = 0;

  for (sec = obfd->sections; sec != NULL; sec = sec->next)
    if ((sec->flags & SEC_THREAD_LOCAL) != 0)
      break;
  tls = sec;

  for (; sec != NULL && (sec->flags & SEC_THREAD_LOCAL) != 0; sec = sec->next)
    if (sec->alignment_power > align)
      align = sec->alignment_power;

  elf_hash_table (info)->tls_sec = tls;

  /* Ensure the alignment of the first section is the largest alignment,
     so that the tls segment starts aligned.  */
  if (tls != NULL)
    tls->alignment_power = align;

  return tls;
}

/* Return TRUE iff this is a non-common, definition of a non-function symbol.  */
static bfd_boolean
is_global_data_symbol_definition (bfd *abfd ATTRIBUTE_UNUSED,
          Elf_Internal_Sym *sym)
{
  /* Local symbols do not count, but target specific ones might.  */
  if (ELF_ST_BIND (sym->st_info) != STB_GLOBAL
      && ELF_ST_BIND (sym->st_info) < STB_LOOS)
    return FALSE;

  /* Function symbols do not count.  */
  if (ELF_ST_TYPE (sym->st_info) == STT_FUNC)
    return FALSE;

  /* If the section is undefined, then so is the symbol.  */
  if (sym->st_shndx == SHN_UNDEF)
    return FALSE;

  /* If the symbol is defined in the common section, then
     it is a common definition and so does not count.  */
  if (sym->st_shndx == SHN_COMMON)
    return FALSE;

  /* If the symbol is in a target specific section then we
     must rely upon the backend to tell us what it is.  */
  if (sym->st_shndx >= SHN_LORESERVE && sym->st_shndx < SHN_ABS)
    /* FIXME - this function is not coded yet:

       return _bfd_is_global_symbol_definition (abfd, sym);

       Instead for now assume that the definition is not global,
       Even if this is wrong, at least the linker will behave
       in the same way that it used to do.  */
    return FALSE;

  return TRUE;
}

/* Search the symbol table of the archive element of the archive ABFD
   whose archive map contains a mention of SYMDEF, and determine if
   the symbol is defined in this element.  */
static bfd_boolean
elf_link_is_defined_archive_symbol (bfd * abfd, carsym * symdef)
{
  Elf_Internal_Shdr * hdr;
  bfd_size_type symcount;
  bfd_size_type extsymcount;
  bfd_size_type extsymoff;
  Elf_Internal_Sym *isymbuf;
  Elf_Internal_Sym *isym;
  Elf_Internal_Sym *isymend;
  bfd_boolean result;

  abfd = _bfd_get_elt_at_filepos (abfd, symdef->file_offset);
  if (abfd == NULL)
    return FALSE;

  if (! bfd_check_format (abfd, bfd_object))
    return FALSE;

  /* If we have already included the element containing this symbol in the
     link then we do not need to include it again.  Just claim that any symbol
     it contains is not a definition, so that our caller will not decide to
     (re)include this element.  */
  if (abfd->archive_pass)
    return FALSE;

  /* Select the appropriate symbol table.  */
  if ((abfd->flags & DYNAMIC) == 0 || elf_dynsymtab (abfd) == 0)
    hdr = &elf_tdata (abfd)->symtab_hdr;
  else
    hdr = &elf_tdata (abfd)->dynsymtab_hdr;

  symcount = hdr->sh_size / get_elf_backend_data (abfd)->s->sizeof_sym;

  /* The sh_info field of the symtab header tells us where the
     external symbols start.  We don't care about the local symbols.  */
  if (elf_bad_symtab (abfd))
    {
      extsymcount = symcount;
      extsymoff = 0;
    }
  else
    {
      extsymcount = symcount - hdr->sh_info;
      extsymoff = hdr->sh_info;
    }

  if (extsymcount == 0)
    return FALSE;

  /* Read in the symbol table.  */
  isymbuf = bfd_elf_get_elf_syms (abfd, hdr, extsymcount, extsymoff,
          NULL, NULL, NULL);
  if (isymbuf == NULL)
    return FALSE;

  /* Scan the symbol table looking for SYMDEF.  */
  result = FALSE;
  for (isym = isymbuf, isymend = isymbuf + extsymcount; isym < isymend; isym++)
    {
      const char *name;

      name = bfd_elf_string_from_elf_section (abfd, hdr->sh_link,
                isym->st_name);
      if (name == NULL)
  break;

      if (strcmp (name, symdef->name) == 0)
  {
    result = is_global_data_symbol_definition (abfd, isym);
    break;
  }
    }

  free (isymbuf);

  return result;
}

/* Add an entry to the .dynamic table.  */

bfd_boolean
_bfd_elf_add_dynamic_entry (struct bfd_link_info *info,
          bfd_vma tag,
          bfd_vma val)
{
  struct elf_link_hash_table *hash_table;
  const struct elf_backend_data *bed;
  asection *s;
  bfd_size_type newsize;
  bfd_byte *newcontents;
  Elf_Internal_Dyn dyn;

  hash_table = elf_hash_table (info);
  if (! is_elf_hash_table (hash_table))
    return FALSE;

  if (info->warn_shared_textrel && info->shared && tag == DT_TEXTREL)
    _bfd_error_handler
      (_("warning: creating a DT_TEXTREL in a shared object."));

  bed = get_elf_backend_data (hash_table->dynobj);
  s = bfd_get_section_by_name (hash_table->dynobj, ".dynamic");
  BFD_ASSERT (s != NULL);

  newsize = s->size + bed->s->sizeof_dyn;
  newcontents = bfd_realloc (s->contents, newsize);
  if (newcontents == NULL)
    return FALSE;

  dyn.d_tag = tag;
  dyn.d_un.d_val = val;
  bed->s->swap_dyn_out (hash_table->dynobj, &dyn, newcontents + s->size);

  s->size = newsize;
  s->contents = newcontents;

  return TRUE;
}

/* Add a DT_NEEDED entry for this dynamic object if DO_IT is true,
   otherwise just check whether one already exists.  Returns -1 on error,
   1 if a DT_NEEDED tag already exists, and 0 on success.  */

static int
elf_add_dt_needed_tag (bfd *abfd,
           struct bfd_link_info *info,
           const char *soname,
           bfd_boolean do_it)
{
  struct elf_link_hash_table *hash_table;
  bfd_size_type oldsize;
  bfd_size_type strindex;

  if (!_bfd_elf_link_create_dynstrtab (abfd, info))
    return -1;

  hash_table = elf_hash_table (info);
  oldsize = _bfd_elf_strtab_size (hash_table->dynstr);
  strindex = _bfd_elf_strtab_add (hash_table->dynstr, soname, FALSE);
  if (strindex == (bfd_size_type) -1)
    return -1;

  if (oldsize == _bfd_elf_strtab_size (hash_table->dynstr))
    {
      asection *sdyn;
      const struct elf_backend_data *bed;
      bfd_byte *extdyn;

      bed = get_elf_backend_data (hash_table->dynobj);
      sdyn = bfd_get_section_by_name (hash_table->dynobj, ".dynamic");
      if (sdyn != NULL)
  for (extdyn = sdyn->contents;
       extdyn < sdyn->contents + sdyn->size;
       extdyn += bed->s->sizeof_dyn)
    {
      Elf_Internal_Dyn dyn;

      bed->s->swap_dyn_in (hash_table->dynobj, extdyn, &dyn);
      if (dyn.d_tag == DT_NEEDED
    && dyn.d_un.d_val == strindex)
        {
    _bfd_elf_strtab_delref (hash_table->dynstr, strindex);
    return 1;
        }
    }
    }

  if (do_it)
    {
      if (!_bfd_elf_link_create_dynamic_sections (hash_table->dynobj, info))
  return -1;

      if (!_bfd_elf_add_dynamic_entry (info, DT_NEEDED, strindex))
  return -1;
    }
  else
    /* We were just checking for existence of the tag.  */
    _bfd_elf_strtab_delref (hash_table->dynstr, strindex);

  return 0;
}

/* Called via elf_link_hash_traverse, elf_smash_syms sets all symbols
   belonging to NOT_NEEDED to bfd_link_hash_new.  We know there are no
   references from regular objects to these symbols.

   ??? Should we do something about references from other dynamic
   obects?  If not, we potentially lose some warnings about undefined
   symbols.  But how can we recover the initial undefined / undefweak
   state?  */

struct elf_smash_syms_data
{
  bfd *not_needed;
  struct elf_link_hash_table *htab;
  bfd_boolean twiddled;
};

static bfd_boolean
elf_smash_syms (struct elf_link_hash_entry *h, void *data)
{
  struct elf_smash_syms_data *inf = (struct elf_smash_syms_data *) data;
  struct bfd_link_hash_entry *bh;

  switch (h->root.type)
    {
    default:
    case bfd_link_hash_new:
      return TRUE;

    case bfd_link_hash_undefined:
      if (h->root.u.undef.abfd != inf->not_needed)
  return TRUE;
      if (h->root.u.undef.weak != NULL
    && h->root.u.undef.weak != inf->not_needed)
  {
    /* Symbol was undefweak in u.undef.weak bfd, and has become
       undefined in as-needed lib.  Restore weak.  */
    h->root.type = bfd_link_hash_undefweak;
    h->root.u.undef.abfd = h->root.u.undef.weak;
    if (h->root.u.undef.next != NULL
        || inf->htab->root.undefs_tail == &h->root)
      inf->twiddled = TRUE;
    return TRUE;
  }
      break;

    case bfd_link_hash_undefweak:
      if (h->root.u.undef.abfd != inf->not_needed)
  return TRUE;
      break;

    case bfd_link_hash_defined:
    case bfd_link_hash_defweak:
      if (h->root.u.def.section->owner != inf->not_needed)
  return TRUE;
      break;

    case bfd_link_hash_common:
      if (h->root.u.c.p->section->owner != inf->not_needed)
  return TRUE;
      break;

    case bfd_link_hash_warning:
    case bfd_link_hash_indirect:
      elf_smash_syms ((struct elf_link_hash_entry *) h->root.u.i.link, data);
      if (h->root.u.i.link->type != bfd_link_hash_new)
  return TRUE;
      if (h->root.u.i.link->u.undef.abfd != inf->not_needed)
  return TRUE;
      break;
    }

  /* There is no way we can undo symbol table state from defined or
     defweak back to undefined.  */
  if (h->ref_regular)
    abort ();

  /* Set sym back to newly created state, but keep undef.next if it is
     being used as a list pointer.  */
  bh = h->root.u.undef.next;
  if (bh == &h->root)
    bh = NULL;
  if (bh != NULL || inf->htab->root.undefs_tail == &h->root)
    inf->twiddled = TRUE;
  (*inf->htab->root.table.newfunc) (&h->root.root,
            &inf->htab->root.table,
            h->root.root.string);
  h->root.u.undef.next = bh;
  h->root.u.undef.abfd = inf->not_needed;
  h->non_elf = 0;
  return TRUE;
}

/* Sort symbol by value and section.  */
static int
elf_sort_symbol (const void *arg1, const void *arg2)
{
  const struct elf_link_hash_entry *h1;
  const struct elf_link_hash_entry *h2;
  bfd_signed_vma vdiff;

  h1 = *(const struct elf_link_hash_entry **) arg1;
  h2 = *(const struct elf_link_hash_entry **) arg2;
  vdiff = h1->root.u.def.value - h2->root.u.def.value;
  if (vdiff != 0)
    return vdiff > 0 ? 1 : -1;
  else
    {
#ifdef KEY /* bug 9484 */
      long sdiff = h1->root.u.def.section - h2->root.u.def.section;
#else
      long sdiff = h1->root.u.def.section->id - h2->root.u.def.section->id;
#endif
      if (sdiff != 0)
  return sdiff > 0 ? 1 : -1;
    }
  return 0;
}

/* This function is used to adjust offsets into .dynstr for
   dynamic symbols.  This is called via elf_link_hash_traverse.  */

static bfd_boolean
elf_adjust_dynstr_offsets (struct elf_link_hash_entry *h, void *data)
{
  struct elf_strtab_hash *dynstr = data;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  if (h->dynindx != -1)
    h->dynstr_index = _bfd_elf_strtab_offset (dynstr, h->dynstr_index);
  return TRUE;
}

/* Assign string offsets in .dynstr, update all structures referencing
   them.  */

static bfd_boolean
elf_finalize_dynstr (bfd *output_bfd, struct bfd_link_info *info)
{
  struct elf_link_hash_table *hash_table = elf_hash_table (info);
  struct elf_link_local_dynamic_entry *entry;
  struct elf_strtab_hash *dynstr = hash_table->dynstr;
  bfd *dynobj = hash_table->dynobj;
  asection *sdyn;
  bfd_size_type size;
  const struct elf_backend_data *bed;
  bfd_byte *extdyn;

  _bfd_elf_strtab_finalize (dynstr);
  size = _bfd_elf_strtab_size (dynstr);

  bed = get_elf_backend_data (dynobj);
  sdyn = bfd_get_section_by_name (dynobj, ".dynamic");
  BFD_ASSERT (sdyn != NULL);

  /* Update all .dynamic entries referencing .dynstr strings.  */
  for (extdyn = sdyn->contents;
       extdyn < sdyn->contents + sdyn->size;
       extdyn += bed->s->sizeof_dyn)
    {
      Elf_Internal_Dyn dyn;

      bed->s->swap_dyn_in (dynobj, extdyn, &dyn);
      switch (dyn.d_tag)
  {
  case DT_STRSZ:
    dyn.d_un.d_val = size;
    break;
  case DT_NEEDED:
  case DT_SONAME:
  case DT_RPATH:
  case DT_RUNPATH:
  case DT_FILTER:
  case DT_AUXILIARY:
    dyn.d_un.d_val = _bfd_elf_strtab_offset (dynstr, dyn.d_un.d_val);
    break;
  default:
    continue;
  }
      bed->s->swap_dyn_out (dynobj, &dyn, extdyn);
    }

  /* Now update local dynamic symbols.  */
  for (entry = hash_table->dynlocal; entry ; entry = entry->next)
    entry->isym.st_name = _bfd_elf_strtab_offset (dynstr,
              entry->isym.st_name);

  /* And the rest of dynamic symbols.  */
  elf_link_hash_traverse (hash_table, elf_adjust_dynstr_offsets, dynstr);

  /* Adjust version definitions.  */
  if (elf_tdata (output_bfd)->cverdefs)
    {
      asection *s;
      bfd_byte *p;
      bfd_size_type i;
      Elf_Internal_Verdef def;
      Elf_Internal_Verdaux defaux;

      s = bfd_get_section_by_name (dynobj, ".gnu.version_d");
      p = s->contents;
      do
  {
    _bfd_elf_swap_verdef_in (output_bfd, (Elf_External_Verdef *) p,
           &def);
    p += sizeof (Elf_External_Verdef);
    if (def.vd_aux != sizeof (Elf_External_Verdef))
      continue;
    for (i = 0; i < def.vd_cnt; ++i)
      {
        _bfd_elf_swap_verdaux_in (output_bfd,
          (Elf_External_Verdaux *) p, &defaux);
        defaux.vda_name = _bfd_elf_strtab_offset (dynstr,
              defaux.vda_name);
        _bfd_elf_swap_verdaux_out (output_bfd,
           &defaux, (Elf_External_Verdaux *) p);
        p += sizeof (Elf_External_Verdaux);
      }
  }
      while (def.vd_next);
    }

  /* Adjust version references.  */
  if (elf_tdata (output_bfd)->verref)
    {
      asection *s;
      bfd_byte *p;
      bfd_size_type i;
      Elf_Internal_Verneed need;
      Elf_Internal_Vernaux needaux;

      s = bfd_get_section_by_name (dynobj, ".gnu.version_r");
      p = s->contents;
      do
  {
    _bfd_elf_swap_verneed_in (output_bfd, (Elf_External_Verneed *) p,
            &need);
    need.vn_file = _bfd_elf_strtab_offset (dynstr, need.vn_file);
    _bfd_elf_swap_verneed_out (output_bfd, &need,
             (Elf_External_Verneed *) p);
    p += sizeof (Elf_External_Verneed);
    for (i = 0; i < need.vn_cnt; ++i)
      {
        _bfd_elf_swap_vernaux_in (output_bfd,
          (Elf_External_Vernaux *) p, &needaux);
        needaux.vna_name = _bfd_elf_strtab_offset (dynstr,
               needaux.vna_name);
        _bfd_elf_swap_vernaux_out (output_bfd,
           &needaux,
           (Elf_External_Vernaux *) p);
        p += sizeof (Elf_External_Vernaux);
      }
  }
      while (need.vn_next);
    }

  return TRUE;
}

/* Add symbols from an ELF object file to the linker hash table.  */

static bfd_boolean
elf_link_add_object_symbols (bfd *abfd, struct bfd_link_info *info)
{
  bfd_boolean (*add_symbol_hook)
    (bfd *, struct bfd_link_info *, Elf_Internal_Sym *,
     const char **, flagword *, asection **, bfd_vma *);
  bfd_boolean (*check_relocs)
    (bfd *, struct bfd_link_info *, asection *, const Elf_Internal_Rela *);
  bfd_boolean (*check_directives)
    (bfd *, struct bfd_link_info *);
  bfd_boolean collect;
  Elf_Internal_Shdr *hdr;
  bfd_size_type symcount;
  bfd_size_type extsymcount;
  bfd_size_type extsymoff;
  struct elf_link_hash_entry **sym_hash;
  bfd_boolean dynamic;
  Elf_External_Versym *extversym = NULL;
  Elf_External_Versym *ever;
  struct elf_link_hash_entry *weaks;
  struct elf_link_hash_entry **nondeflt_vers = NULL;
  bfd_size_type nondeflt_vers_cnt = 0;
  Elf_Internal_Sym *isymbuf = NULL;
  Elf_Internal_Sym *isym;
  Elf_Internal_Sym *isymend;
  const struct elf_backend_data *bed;
  bfd_boolean add_needed;
  struct elf_link_hash_table * hash_table;
  bfd_size_type amt;

  hash_table = elf_hash_table (info);

  bed = get_elf_backend_data (abfd);
  add_symbol_hook = bed->elf_add_symbol_hook;
  collect = bed->collect;

  if ((abfd->flags & DYNAMIC) == 0)
    dynamic = FALSE;
  else
    {
      dynamic = TRUE;

      /* You can't use -r against a dynamic object.  Also, there's no
   hope of using a dynamic object which does not exactly match
   the format of the output file.  */
      if (info->relocatable
    || !is_elf_hash_table (hash_table)
    || hash_table->root.creator != abfd->xvec)
  {
    if (info->relocatable)
      bfd_set_error (bfd_error_invalid_operation);
    else
      bfd_set_error (bfd_error_wrong_format);
    goto error_return;
  }
    }

  /* As a GNU extension, any input sections which are named
     .gnu.warning.SYMBOL are treated as warning symbols for the given
     symbol.  This differs from .gnu.warning sections, which generate
     warnings when they are included in an output file.  */
  if (info->executable)
    {
      asection *s;

      for (s = abfd->sections; s != NULL; s = s->next)
  {
    const char *name;

    name = bfd_get_section_name (abfd, s);
    if (strncmp (name, ".gnu.warning.", sizeof ".gnu.warning." - 1) == 0)
      {
        char *msg;
        bfd_size_type sz;

        name += sizeof ".gnu.warning." - 1;

        /* If this is a shared object, then look up the symbol
     in the hash table.  If it is there, and it is already
     been defined, then we will not be using the entry
     from this shared object, so we don't need to warn.
     FIXME: If we see the definition in a regular object
     later on, we will warn, but we shouldn't.  The only
     fix is to keep track of what warnings we are supposed
     to emit, and then handle them all at the end of the
     link.  */
        if (dynamic)
    {
      struct elf_link_hash_entry *h;

      h = elf_link_hash_lookup (hash_table, name,
              FALSE, FALSE, TRUE);

      /* FIXME: What about bfd_link_hash_common?  */
      if (h != NULL
          && (h->root.type == bfd_link_hash_defined
        || h->root.type == bfd_link_hash_defweak))
        {
          /* We don't want to issue this warning.  Clobber
       the section size so that the warning does not
       get copied into the output file.  */
          s->size = 0;
          continue;
        }
    }

        sz = s->size;
        msg = bfd_alloc (abfd, sz + 1);
        if (msg == NULL)
    goto error_return;

        if (! bfd_get_section_contents (abfd, s, msg, 0, sz))
    goto error_return;

        msg[sz] = '\0';

        if (! (_bfd_generic_link_add_one_symbol
         (info, abfd, name, BSF_WARNING, s, 0, msg,
          FALSE, collect, NULL)))
    goto error_return;

        if (! info->relocatable)
    {
      /* Clobber the section size so that the warning does
         not get copied into the output file.  */
      s->size = 0;

      /* Also set SEC_EXCLUDE, so that symbols defined in
         the warning section don't get copied to the output.  */
      s->flags |= SEC_EXCLUDE;
    }
      }
  }
    }

  add_needed = TRUE;
  if (! dynamic)
    {
      /* If we are creating a shared library, create all the dynamic
   sections immediately.  We need to attach them to something,
   so we attach them to this BFD, provided it is the right
   format.  FIXME: If there are no input BFD's of the same
   format as the output, we can't make a shared library.  */
      if (info->shared
    && is_elf_hash_table (hash_table)
    && hash_table->root.creator == abfd->xvec
    && ! hash_table->dynamic_sections_created)
  {
    if (! _bfd_elf_link_create_dynamic_sections (abfd, info))
      goto error_return;
  }
    }
  else if (!is_elf_hash_table (hash_table))
    goto error_return;
  else
    {
      asection *s;
      const char *soname = NULL;
      struct bfd_link_needed_list *rpath = NULL, *runpath = NULL;
      int ret;

      /* ld --just-symbols and dynamic objects don't mix very well.
   Test for --just-symbols by looking at info set up by
   _bfd_elf_link_just_syms.  */
      if ((s = abfd->sections) != NULL
    && s->sec_info_type == ELF_INFO_TYPE_JUST_SYMS)
  goto error_return;

      /* If this dynamic lib was specified on the command line with
   --as-needed in effect, then we don't want to add a DT_NEEDED
   tag unless the lib is actually used.  Similary for libs brought
   in by another lib's DT_NEEDED.  When --no-add-needed is used
   on a dynamic lib, we don't want to add a DT_NEEDED entry for
   any dynamic library in DT_NEEDED tags in the dynamic lib at
   all.  */
      add_needed = (elf_dyn_lib_class (abfd)
        & (DYN_AS_NEEDED | DYN_DT_NEEDED
           | DYN_NO_NEEDED)) == 0;

      s = bfd_get_section_by_name (abfd, ".dynamic");
      if (s != NULL)
  {
    bfd_byte *dynbuf;
    bfd_byte *extdyn;
    int elfsec;
    unsigned long shlink;

    if (!bfd_malloc_and_get_section (abfd, s, &dynbuf))
      goto error_free_dyn;

    elfsec = _bfd_elf_section_from_bfd_section (abfd, s);
    if (elfsec == -1)
      goto error_free_dyn;
    shlink = elf_elfsections (abfd)[elfsec]->sh_link;

    for (extdyn = dynbuf;
         extdyn < dynbuf + s->size;
         extdyn += bed->s->sizeof_dyn)
      {
        Elf_Internal_Dyn dyn;

        bed->s->swap_dyn_in (abfd, extdyn, &dyn);
        if (dyn.d_tag == DT_SONAME)
    {
      unsigned int tagv = dyn.d_un.d_val;
      soname = bfd_elf_string_from_elf_section (abfd, shlink, tagv);
      if (soname == NULL)
        goto error_free_dyn;
    }
        if (dyn.d_tag == DT_NEEDED)
    {
      struct bfd_link_needed_list *n, **pn;
      char *fnm, *anm;
      unsigned int tagv = dyn.d_un.d_val;

      amt = sizeof (struct bfd_link_needed_list);
      n = bfd_alloc (abfd, amt);
      fnm = bfd_elf_string_from_elf_section (abfd, shlink, tagv);
      if (n == NULL || fnm == NULL)
        goto error_free_dyn;
      amt = strlen (fnm) + 1;
      anm = bfd_alloc (abfd, amt);
      if (anm == NULL)
        goto error_free_dyn;
      memcpy (anm, fnm, amt);
      n->name = anm;
      n->by = abfd;
      n->next = NULL;
      for (pn = & hash_table->needed;
           *pn != NULL;
           pn = &(*pn)->next)
        ;
      *pn = n;
    }
        if (dyn.d_tag == DT_RUNPATH)
    {
      struct bfd_link_needed_list *n, **pn;
      char *fnm, *anm;
      unsigned int tagv = dyn.d_un.d_val;

      amt = sizeof (struct bfd_link_needed_list);
      n = bfd_alloc (abfd, amt);
      fnm = bfd_elf_string_from_elf_section (abfd, shlink, tagv);
      if (n == NULL || fnm == NULL)
        goto error_free_dyn;
      amt = strlen (fnm) + 1;
      anm = bfd_alloc (abfd, amt);
      if (anm == NULL)
        goto error_free_dyn;
      memcpy (anm, fnm, amt);
      n->name = anm;
      n->by = abfd;
      n->next = NULL;
      for (pn = & runpath;
           *pn != NULL;
           pn = &(*pn)->next)
        ;
      *pn = n;
    }
        /* Ignore DT_RPATH if we have seen DT_RUNPATH.  */
        if (!runpath && dyn.d_tag == DT_RPATH)
    {
      struct bfd_link_needed_list *n, **pn;
      char *fnm, *anm;
      unsigned int tagv = dyn.d_un.d_val;

      amt = sizeof (struct bfd_link_needed_list);
      n = bfd_alloc (abfd, amt);
      fnm = bfd_elf_string_from_elf_section (abfd, shlink, tagv);
      if (n == NULL || fnm == NULL)
        goto error_free_dyn;
      amt = strlen (fnm) + 1;
      anm = bfd_alloc (abfd, amt);
      if (anm == NULL)
        {
        error_free_dyn:
          free (dynbuf);
          goto error_return;
        }
      memcpy (anm, fnm, amt);
      n->name = anm;
      n->by = abfd;
      n->next = NULL;
      for (pn = & rpath;
           *pn != NULL;
           pn = &(*pn)->next)
        ;
      *pn = n;
    }
      }

    free (dynbuf);
  }

      /* DT_RUNPATH overrides DT_RPATH.  Do _NOT_ bfd_release, as that
   frees all more recently bfd_alloc'd blocks as well.  */
      if (runpath)
  rpath = runpath;

      if (rpath)
  {
    struct bfd_link_needed_list **pn;
    for (pn = & hash_table->runpath;
         *pn != NULL;
         pn = &(*pn)->next)
      ;
    *pn = rpath;
  }

      /* We do not want to include any of the sections in a dynamic
   object in the output file.  We hack by simply clobbering the
   list of sections in the BFD.  This could be handled more
   cleanly by, say, a new section flag; the existing
   SEC_NEVER_LOAD flag is not the one we want, because that one
   still implies that the section takes up space in the output
   file.  */
      bfd_section_list_clear (abfd);

      /* Find the name to use in a DT_NEEDED entry that refers to this
   object.  If the object has a DT_SONAME entry, we use it.
   Otherwise, if the generic linker stuck something in
   elf_dt_name, we use that.  Otherwise, we just use the file
   name.  */
      if (soname == NULL || *soname == '\0')
  {
    soname = elf_dt_name (abfd);
    if (soname == NULL || *soname == '\0')
      soname = bfd_get_filename (abfd);
  }

      /* Save the SONAME because sometimes the linker emulation code
   will need to know it.  */
      elf_dt_name (abfd) = soname;

      ret = elf_add_dt_needed_tag (abfd, info, soname, add_needed);
      if (ret < 0)
  goto error_return;

      /* If we have already included this dynamic object in the
   link, just ignore it.  There is no reason to include a
   particular dynamic object more than once.  */
      if (ret > 0)
  return TRUE;
    }

  /* If this is a dynamic object, we always link against the .dynsym
     symbol table, not the .symtab symbol table.  The dynamic linker
     will only see the .dynsym symbol table, so there is no reason to
     look at .symtab for a dynamic object.  */

  if (! dynamic || elf_dynsymtab (abfd) == 0)
    hdr = &elf_tdata (abfd)->symtab_hdr;
  else
    hdr = &elf_tdata (abfd)->dynsymtab_hdr;

  symcount = hdr->sh_size / bed->s->sizeof_sym;

  /* The sh_info field of the symtab header tells us where the
     external symbols start.  We don't care about the local symbols at
     this point.  */
  if (elf_bad_symtab (abfd))
    {
      extsymcount = symcount;
      extsymoff = 0;
    }
  else
    {
      extsymcount = symcount - hdr->sh_info;
      extsymoff = hdr->sh_info;
    }

  sym_hash = NULL;
  if (extsymcount != 0)
    {
      isymbuf = bfd_elf_get_elf_syms (abfd, hdr, extsymcount, extsymoff,
              NULL, NULL, NULL);
      if (isymbuf == NULL)
  goto error_return;

      /* We store a pointer to the hash table entry for each external
   symbol.  */
      amt = extsymcount * sizeof (struct elf_link_hash_entry *);
      sym_hash = bfd_alloc (abfd, amt);
      if (sym_hash == NULL)
  goto error_free_sym;
      elf_sym_hashes (abfd) = sym_hash;
    }

  if (dynamic)
    {
      /* Read in any version definitions.  */
      if (!_bfd_elf_slurp_version_tables (abfd,
            info->default_imported_symver))
  goto error_free_sym;

      /* Read in the symbol versions, but don't bother to convert them
   to internal format.  */
      if (elf_dynversym (abfd) != 0)
  {
    Elf_Internal_Shdr *versymhdr;

    versymhdr = &elf_tdata (abfd)->dynversym_hdr;
    extversym = bfd_malloc (versymhdr->sh_size);
    if (extversym == NULL)
      goto error_free_sym;
    amt = versymhdr->sh_size;
    if (bfd_seek (abfd, versymhdr->sh_offset, SEEK_SET) != 0
        || bfd_bread (extversym, amt, abfd) != amt)
      goto error_free_vers;
  }
    }

  weaks = NULL;

  ever = extversym != NULL ? extversym + extsymoff : NULL;
  for (isym = isymbuf, isymend = isymbuf + extsymcount;
       isym < isymend;
       isym++, sym_hash++, ever = (ever != NULL ? ever + 1 : NULL))
    {
      int bind;
      bfd_vma value;
      asection *sec, *new_sec;
      flagword flags;
      const char *name;
      struct elf_link_hash_entry *h;
      bfd_boolean definition;
      bfd_boolean size_change_ok;
      bfd_boolean type_change_ok;
      bfd_boolean new_weakdef;
      bfd_boolean override;
      unsigned int old_alignment;
      bfd *old_bfd;

      override = FALSE;

      flags = BSF_NO_FLAGS;
      sec = NULL;
      value = isym->st_value;
      *sym_hash = NULL;

      bind = ELF_ST_BIND (isym->st_info);
      if (bind == STB_LOCAL)
  {
    /* This should be impossible, since ELF requires that all
       global symbols follow all local symbols, and that sh_info
       point to the first global symbol.  Unfortunately, Irix 5
       screws this up.  */
    continue;
  }
      else if (bind == STB_GLOBAL)
  {
    if (isym->st_shndx != SHN_UNDEF
        && isym->st_shndx != SHN_COMMON)
      flags = BSF_GLOBAL;
  }
      else if (bind == STB_WEAK)
  flags = BSF_WEAK;
      else
  {
    /* Leave it up to the processor backend.  */
  }

      if (isym->st_shndx == SHN_UNDEF)
  sec = bfd_und_section_ptr;
      else if (isym->st_shndx < SHN_LORESERVE || isym->st_shndx > SHN_HIRESERVE)
  {
    sec = bfd_section_from_elf_index (abfd, isym->st_shndx);
    if (sec == NULL)
      sec = bfd_abs_section_ptr;
    else if (sec->kept_section)
      {
        /* Symbols from discarded section are undefined, and have
           default visibility.  */
        sec = bfd_und_section_ptr;
        isym->st_shndx = SHN_UNDEF;
        isym->st_other = STV_DEFAULT
             | (isym->st_other & ~ ELF_ST_VISIBILITY(-1));
      }
    else if ((abfd->flags & (EXEC_P | DYNAMIC)) != 0)
      value -= sec->vma;
  }
      else if (isym->st_shndx == SHN_ABS)
  sec = bfd_abs_section_ptr;
      else if (isym->st_shndx == SHN_COMMON)
  {
    sec = bfd_com_section_ptr;
    /* What ELF calls the size we call the value.  What ELF
       calls the value we call the alignment.  */
    value = isym->st_size;
  }
#ifdef IPA_LINK
      else if (isym->st_shndx == SHN_IPA_TEXT)
  sec = bfd_whirl_text_section_ptr;
      else if (isym->st_shndx == SHN_IPA_DATA)
  sec = bfd_whirl_data_section_ptr;
#endif
      else
  {
    /* Leave it up to the processor backend.  */
  }

      name = bfd_elf_string_from_elf_section (abfd, hdr->sh_link,
                isym->st_name);
      if (name == NULL)
  goto error_free_vers;

      if (isym->st_shndx == SHN_COMMON
    && ELF_ST_TYPE (isym->st_info) == STT_TLS)
  {
    asection *tcomm = bfd_get_section_by_name (abfd, ".tcommon");

    if (tcomm == NULL)
      {
        tcomm = bfd_make_section (abfd, ".tcommon");
        if (tcomm == NULL
      || !bfd_set_section_flags (abfd, tcomm, (SEC_ALLOC
                 | SEC_IS_COMMON
                 | SEC_LINKER_CREATED
                 | SEC_THREAD_LOCAL)))
    goto error_free_vers;
      }
    sec = tcomm;
  }
      else if (add_symbol_hook)
  {
    if (! (*add_symbol_hook) (abfd, info, isym, &name, &flags, &sec,
            &value))
      goto error_free_vers;

    /* The hook function sets the name to NULL if this symbol
       should be skipped for some reason.  */
    if (name == NULL)
      continue;
  }

      /* Sanity check that all possibilities were handled.  */
      if (sec == NULL)
  {
    bfd_set_error (bfd_error_bad_value);
    goto error_free_vers;
  }

      if (bfd_is_und_section (sec)
    || bfd_is_com_section (sec))
  definition = FALSE;
      else
  definition = TRUE;

      size_change_ok = FALSE;
      type_change_ok = get_elf_backend_data (abfd)->type_change_ok;
      old_alignment = 0;
      old_bfd = NULL;
      new_sec = sec;

      if (is_elf_hash_table (hash_table))
  {
    Elf_Internal_Versym iver;
    unsigned int vernum = 0;
    bfd_boolean skip;

    if (ever == NULL)
      {
        if (info->default_imported_symver)
    /* Use the default symbol version created earlier.  */
    iver.vs_vers = elf_tdata (abfd)->cverdefs;
        else
    iver.vs_vers = 0;
      }
    else
      _bfd_elf_swap_versym_in (abfd, ever, &iver);

    vernum = iver.vs_vers & VERSYM_VERSION;

    /* If this is a hidden symbol, or if it is not version
       1, we append the version name to the symbol name.
       However, we do not modify a non-hidden absolute
       symbol, because it might be the version symbol
       itself.  FIXME: What if it isn't?  */
    if ((iver.vs_vers & VERSYM_HIDDEN) != 0
        || (vernum > 1 && ! bfd_is_abs_section (sec)))
      {
        const char *verstr;
        size_t namelen, verlen, newlen;
        char *newname, *p;

        if (isym->st_shndx != SHN_UNDEF)
    {
      if (vernum > elf_tdata (abfd)->cverdefs)
        verstr = NULL;
      else if (vernum > 1)
        verstr =
          elf_tdata (abfd)->verdef[vernum - 1].vd_nodename;
      else
        verstr = "";

      if (verstr == NULL)
        {
          (*_bfd_error_handler)
      (_("%B: %s: invalid version %u (max %d)"),
       abfd, name, vernum,
       elf_tdata (abfd)->cverdefs);
          bfd_set_error (bfd_error_bad_value);
          goto error_free_vers;
        }
    }
        else
    {
      /* We cannot simply test for the number of
         entries in the VERNEED section since the
         numbers for the needed versions do not start
         at 0.  */
      Elf_Internal_Verneed *t;

      verstr = NULL;
      for (t = elf_tdata (abfd)->verref;
           t != NULL;
           t = t->vn_nextref)
        {
          Elf_Internal_Vernaux *a;

          for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr)
      {
        if (a->vna_other == vernum)
          {
            verstr = a->vna_nodename;
            break;
          }
      }
          if (a != NULL)
      break;
        }
      if (verstr == NULL)
        {
          (*_bfd_error_handler)
      (_("%B: %s: invalid needed version %d"),
       abfd, name, vernum);
          bfd_set_error (bfd_error_bad_value);
          goto error_free_vers;
        }
    }

        namelen = strlen (name);
        verlen = strlen (verstr);
        newlen = namelen + verlen + 2;
        if ((iver.vs_vers & VERSYM_HIDDEN) == 0
      && isym->st_shndx != SHN_UNDEF)
    ++newlen;

        newname = bfd_alloc (abfd, newlen);
        if (newname == NULL)
    goto error_free_vers;
        memcpy (newname, name, namelen);
        p = newname + namelen;
        *p++ = ELF_VER_CHR;
        /* If this is a defined non-hidden version symbol,
     we add another @ to the name.  This indicates the
     default version of the symbol.  */
        if ((iver.vs_vers & VERSYM_HIDDEN) == 0
      && isym->st_shndx != SHN_UNDEF)
    *p++ = ELF_VER_CHR;
        memcpy (p, verstr, verlen + 1);

        name = newname;
      }

    if (!_bfd_elf_merge_symbol (abfd, info, name, isym, &sec,
              &value, &old_alignment,
              sym_hash, &skip, &override,
              &type_change_ok, &size_change_ok))
      goto error_free_vers;

    if (skip)
      continue;

    if (override)
      definition = FALSE;

    h = *sym_hash;
    while (h->root.type == bfd_link_hash_indirect
     || h->root.type == bfd_link_hash_warning)
      h = (struct elf_link_hash_entry *) h->root.u.i.link;

    /* Remember the old alignment if this is a common symbol, so
       that we don't reduce the alignment later on.  We can't
       check later, because _bfd_generic_link_add_one_symbol
       will set a default for the alignment which we want to
       override. We also remember the old bfd where the existing
       definition comes from.  */
    switch (h->root.type)
      {
      default:
        break;

      case bfd_link_hash_defined:
      case bfd_link_hash_defweak:
#ifdef KEY
              /* section_is_invalid: section field is the bfd */
              if ( h->root.u.def.section_is_invalid )
                old_bfd = (bfd*)h->root.u.def.section;
              else
#endif
        old_bfd = h->root.u.def.section->owner;
        break;

      case bfd_link_hash_common:
#ifdef KEY
              /* section_is_invalid: section field is the bfd */
              if ( h->root.u.def.section_is_invalid )
                old_bfd = (bfd*)h->root.u.def.section;
              else
#endif
        old_bfd = h->root.u.c.p->section->owner;
        old_alignment = h->root.u.c.p->alignment_power;
        break;
      }

    if (elf_tdata (abfd)->verdef != NULL
        && ! override
        && vernum > 1
        && definition)
      h->verinfo.verdef = &elf_tdata (abfd)->verdef[vernum - 1];
  }

      if (! (_bfd_generic_link_add_one_symbol
       (info, abfd, name, flags, sec, value, NULL, FALSE, collect,
        (struct bfd_link_hash_entry **) sym_hash)))
  goto error_free_vers;

      h = *sym_hash;
      while (h->root.type == bfd_link_hash_indirect
       || h->root.type == bfd_link_hash_warning)
  h = (struct elf_link_hash_entry *) h->root.u.i.link;
      *sym_hash = h;

      new_weakdef = FALSE;
      if (dynamic
    && definition
    && (flags & BSF_WEAK) != 0
    && ELF_ST_TYPE (isym->st_info) != STT_FUNC
    && is_elf_hash_table (hash_table)
    && h->u.weakdef == NULL)
  {
    /* Keep a list of all weak defined non function symbols from
       a dynamic object, using the weakdef field.  Later in this
       function we will set the weakdef field to the correct
       value.  We only put non-function symbols from dynamic
       objects on this list, because that happens to be the only
       time we need to know the normal symbol corresponding to a
       weak symbol, and the information is time consuming to
       figure out.  If the weakdef field is not already NULL,
       then this symbol was already defined by some previous
       dynamic object, and we will be using that previous
       definition anyhow.  */

    h->u.weakdef = weaks;
    weaks = h;
    new_weakdef = TRUE;
  }

      /* Set the alignment of a common symbol.  */
      if ((isym->st_shndx == SHN_COMMON
     || bfd_is_com_section (sec))
    && h->root.type == bfd_link_hash_common)
  {
    unsigned int align;

    if (isym->st_shndx == SHN_COMMON)
      align = bfd_log2 (isym->st_value);
    else
      {
        /* The new symbol is a common symbol in a shared object.
     We need to get the alignment from the section.  */
        align = new_sec->alignment_power;
      }
    if (align > old_alignment
        /* Permit an alignment power of zero if an alignment of one
     is specified and no other alignments have been specified.  */
        || (isym->st_value == 1 && old_alignment == 0))
      h->root.u.c.p->alignment_power = align;
    else
      h->root.u.c.p->alignment_power = old_alignment;
  }

      if (is_elf_hash_table (hash_table))
  {
    bfd_boolean dynsym;

    /* Check the alignment when a common symbol is involved. This
       can change when a common symbol is overridden by a normal
       definition or a common symbol is ignored due to the old
       normal definition. We need to make sure the maximum
       alignment is maintained.  */
    if ((old_alignment || isym->st_shndx == SHN_COMMON)
        && h->root.type != bfd_link_hash_common)
      {
        unsigned int common_align;
        unsigned int normal_align;
        unsigned int symbol_align;
        bfd *normal_bfd;
        bfd *common_bfd;

        symbol_align = ffs (h->root.u.def.value) - 1;
        if (h->root.u.def.section->owner != NULL
      && (h->root.u.def.section->owner->flags & DYNAMIC) == 0)
    {
      normal_align = h->root.u.def.section->alignment_power;
      if (normal_align > symbol_align)
        normal_align = symbol_align;
    }
        else
    normal_align = symbol_align;

        if (old_alignment)
    {
      common_align = old_alignment;
      common_bfd = old_bfd;
      normal_bfd = abfd;
    }
        else
    {
      common_align = bfd_log2 (isym->st_value);
      common_bfd = abfd;
      normal_bfd = old_bfd;
    }

        if (normal_align < common_align)
    (*_bfd_error_handler)
      (_("Warning: alignment %u of symbol `%s' in %B"
         " is smaller than %u in %B"),
       normal_bfd, common_bfd,
       1 << normal_align, name, 1 << common_align);
      }

    /* Remember the symbol size and type.  */
    if (isym->st_size != 0
        && (definition || h->size == 0))
      {
#ifndef KEY   // bug 2051
        if (h->size != 0 && h->size != isym->st_size && ! size_change_ok)
    (*_bfd_error_handler)
      (_("Warning: size of symbol `%s' changed"
         " from %lu in %B to %lu in %B"),
       old_bfd, abfd,
       name, (unsigned long) h->size,
       (unsigned long) isym->st_size);
#endif
        h->size = isym->st_size;
      }

    /* If this is a common symbol, then we always want H->SIZE
       to be the size of the common symbol.  The code just above
       won't fix the size if a common symbol becomes larger.  We
       don't warn about a size change here, because that is
       covered by --warn-common.  */
    if (h->root.type == bfd_link_hash_common)
      h->size = h->root.u.c.size;

    if (ELF_ST_TYPE (isym->st_info) != STT_NOTYPE
        && (definition || h->type == STT_NOTYPE))
      {
        if (h->type != STT_NOTYPE
      && h->type != ELF_ST_TYPE (isym->st_info)
      && ! type_change_ok)
    (*_bfd_error_handler)
      (_("Warning: type of symbol `%s' changed"
         " from %d to %d in %B"),
       abfd, name, h->type, ELF_ST_TYPE (isym->st_info));

        h->type = ELF_ST_TYPE (isym->st_info);
      }

    /* If st_other has a processor-specific meaning, specific
       code might be needed here. We never merge the visibility
       attribute with the one from a dynamic object.  */
    if (bed->elf_backend_merge_symbol_attribute)
      (*bed->elf_backend_merge_symbol_attribute) (h, isym, definition,
              dynamic);

    /* If this symbol has default visibility and the user has requested
       we not re-export it, then mark it as hidden.  */
    if (definition && !dynamic
        && (abfd->no_export
      || (abfd->my_archive && abfd->my_archive->no_export))
        && ELF_ST_VISIBILITY (isym->st_other) != STV_INTERNAL)
      isym->st_other = STV_HIDDEN | (isym->st_other & ~ ELF_ST_VISIBILITY (-1));

    if (isym->st_other != 0 && !dynamic)
      {
        unsigned char hvis, symvis, other, nvis;

        /* Take the balance of OTHER from the definition.  */
        other = (definition ? isym->st_other : h->other);
        other &= ~ ELF_ST_VISIBILITY (-1);

        /* Combine visibilities, using the most constraining one.  */
        hvis   = ELF_ST_VISIBILITY (h->other);
        symvis = ELF_ST_VISIBILITY (isym->st_other);
        if (! hvis)
    nvis = symvis;
        else if (! symvis)
    nvis = hvis;
        else
    nvis = hvis < symvis ? hvis : symvis;

        h->other = other | nvis;
      }

    /* Set a flag in the hash table entry indicating the type of
       reference or definition we just found.  Keep a count of
       the number of dynamic symbols we find.  A dynamic symbol
       is one which is referenced or defined by both a regular
       object and a shared object.  */
    dynsym = FALSE;
    if (! dynamic)
      {
        if (! definition)
    {
#ifdef IPA_LINK
      if (!ipa_is_whirl(abfd))
#endif
      h->ref_regular = 1;
      if (bind != STB_WEAK)
        h->ref_regular_nonweak = 1;
    }
        else
          {
#ifdef IPA_LINK
      if (!ipa_is_whirl(abfd))
#endif
      h->def_regular = 1;
          }
        if (! info->executable
      || h->def_dynamic
      || h->ref_dynamic)
    dynsym = TRUE;
      }
    else
      {
        if (! definition)
    h->ref_dynamic = 1;
        else
    h->def_dynamic = 1;
        if (h->def_regular
      || h->ref_regular
      || (h->u.weakdef != NULL
          && ! new_weakdef
          && h->u.weakdef->dynindx != -1))
    dynsym = TRUE;
      }

    /* Check to see if we need to add an indirect symbol for
       the default name.  */
    if (definition || h->root.type == bfd_link_hash_common)
      if (!_bfd_elf_add_default_symbol (abfd, info, h, name, isym,
                &sec, &value, &dynsym,
                override))
        goto error_free_vers;

    if (definition && !dynamic)
      {
        char *p = strchr (name, ELF_VER_CHR);
        if (p != NULL && p[1] != ELF_VER_CHR)
    {
      /* Queue non-default versions so that .symver x, x@FOO
         aliases can be checked.  */
      if (! nondeflt_vers)
        {
          amt = (isymend - isym + 1)
          * sizeof (struct elf_link_hash_entry *);
          nondeflt_vers = bfd_malloc (amt);
        }
      nondeflt_vers [nondeflt_vers_cnt++] = h;
    }
      }

    if (dynsym && h->dynindx == -1)
      {
        if (! bfd_elf_link_record_dynamic_symbol (info, h))
    goto error_free_vers;
        if (h->u.weakdef != NULL
      && ! new_weakdef
      && h->u.weakdef->dynindx == -1)
    {
      if (! bfd_elf_link_record_dynamic_symbol (info, h->u.weakdef))
        goto error_free_vers;
    }
      }
    else if (dynsym && h->dynindx != -1)
      /* If the symbol already has a dynamic index, but
         visibility says it should not be visible, turn it into
         a local symbol.  */
      switch (ELF_ST_VISIBILITY (h->other))
        {
        case STV_INTERNAL:
        case STV_HIDDEN:
    (*bed->elf_backend_hide_symbol) (info, h, TRUE);
    dynsym = FALSE;
    break;
        }

    if (!add_needed
        && definition
        && dynsym
        && h->ref_regular)
      {
        int ret;
        const char *soname = elf_dt_name (abfd);

        /* A symbol from a library loaded via DT_NEEDED of some
     other library is referenced by a regular object.
     Add a DT_NEEDED entry for it.  Issue an error if
     --no-add-needed is used.  */
        if ((elf_dyn_lib_class (abfd) & DYN_NO_NEEDED) != 0)
    {
      (*_bfd_error_handler)
        (_("%s: invalid DSO for symbol `%s' definition"),
         abfd, name);
      bfd_set_error (bfd_error_bad_value);
      goto error_free_vers;
    }

        elf_dyn_lib_class (abfd) &= ~DYN_AS_NEEDED;

        add_needed = TRUE;
        ret = elf_add_dt_needed_tag (abfd, info, soname, add_needed);
        if (ret < 0)
    goto error_free_vers;

        BFD_ASSERT (ret == 0);
      }
  }
    }

  /* Now that all the symbols from this input file are created, handle
     .symver foo, foo@BAR such that any relocs against foo become foo@BAR.  */
  if (nondeflt_vers != NULL)
    {
      bfd_size_type cnt, symidx;

      for (cnt = 0; cnt < nondeflt_vers_cnt; ++cnt)
  {
    struct elf_link_hash_entry *h = nondeflt_vers[cnt], *hi;
    char *shortname, *p;

    p = strchr (h->root.root.string, ELF_VER_CHR);
    if (p == NULL
        || (h->root.type != bfd_link_hash_defined
      && h->root.type != bfd_link_hash_defweak))
      continue;

    amt = p - h->root.root.string;
    shortname = bfd_malloc (amt + 1);
    memcpy (shortname, h->root.root.string, amt);
    shortname[amt] = '\0';

    hi = (struct elf_link_hash_entry *)
         bfd_link_hash_lookup (&hash_table->root, shortname,
             FALSE, FALSE, FALSE);
    if (hi != NULL
        && hi->root.type == h->root.type
        && hi->root.u.def.value == h->root.u.def.value
        && hi->root.u.def.section == h->root.u.def.section)
      {
        (*bed->elf_backend_hide_symbol) (info, hi, TRUE);
        hi->root.type = bfd_link_hash_indirect;
        hi->root.u.i.link = (struct bfd_link_hash_entry *) h;
        (*bed->elf_backend_copy_indirect_symbol) (bed, h, hi);
        sym_hash = elf_sym_hashes (abfd);
        if (sym_hash)
    for (symidx = 0; symidx < extsymcount; ++symidx)
      if (sym_hash[symidx] == hi)
        {
          sym_hash[symidx] = h;
          break;
        }
      }
    free (shortname);
  }
      free (nondeflt_vers);
      nondeflt_vers = NULL;
    }

  if (extversym != NULL)
    {
      free (extversym);
      extversym = NULL;
    }

  if (isymbuf != NULL)
    free (isymbuf);
  isymbuf = NULL;

  if (!add_needed
      && (elf_dyn_lib_class (abfd) & DYN_AS_NEEDED) != 0)
    {
      /* Remove symbols defined in an as-needed shared lib that wasn't
   needed.  */
      struct elf_smash_syms_data inf;
      inf.not_needed = abfd;
      inf.htab = hash_table;
      inf.twiddled = FALSE;
      elf_link_hash_traverse (hash_table, elf_smash_syms, &inf);
      if (inf.twiddled)
  bfd_link_repair_undef_list (&hash_table->root);
      weaks = NULL;
    }

  /* Now set the weakdefs field correctly for all the weak defined
     symbols we found.  The only way to do this is to search all the
     symbols.  Since we only need the information for non functions in
     dynamic objects, that's the only time we actually put anything on
     the list WEAKS.  We need this information so that if a regular
     object refers to a symbol defined weakly in a dynamic object, the
     real symbol in the dynamic object is also put in the dynamic
     symbols; we also must arrange for both symbols to point to the
     same memory location.  We could handle the general case of symbol
     aliasing, but a general symbol alias can only be generated in
     assembler code, handling it correctly would be very time
     consuming, and other ELF linkers don't handle general aliasing
     either.  */
  if (weaks != NULL)
    {
      struct elf_link_hash_entry **hpp;
      struct elf_link_hash_entry **hppend;
      struct elf_link_hash_entry **sorted_sym_hash;
      struct elf_link_hash_entry *h;
      size_t sym_count;

      /* Since we have to search the whole symbol list for each weak
   defined symbol, search time for N weak defined symbols will be
   O(N^2). Binary search will cut it down to O(NlogN).  */
      amt = extsymcount * sizeof (struct elf_link_hash_entry *);
      sorted_sym_hash = bfd_malloc (amt);
      if (sorted_sym_hash == NULL)
  goto error_return;
      sym_hash = sorted_sym_hash;
      hpp = elf_sym_hashes (abfd);
      hppend = hpp + extsymcount;
      sym_count = 0;
      for (; hpp < hppend; hpp++)
  {
    h = *hpp;
    if (h != NULL
        && h->root.type == bfd_link_hash_defined
        && h->type != STT_FUNC)
      {
        *sym_hash = h;
        sym_hash++;
        sym_count++;
      }
  }

      qsort (sorted_sym_hash, sym_count,
       sizeof (struct elf_link_hash_entry *),
       elf_sort_symbol);

      while (weaks != NULL)
  {
    struct elf_link_hash_entry *hlook;
    asection *slook;
    bfd_vma vlook;
    long ilook;
    size_t i, j, idx;

    hlook = weaks;
    weaks = hlook->u.weakdef;
    hlook->u.weakdef = NULL;
#ifndef KEY
    BFD_ASSERT (hlook->root.type == bfd_link_hash_defined
          || hlook->root.type == bfd_link_hash_defweak
          || hlook->root.type == bfd_link_hash_common
          || hlook->root.type == bfd_link_hash_indirect);
#endif
    slook = hlook->root.u.def.section;
    vlook = hlook->root.u.def.value;

    ilook = -1;
    i = 0;
    j = sym_count;
    while (i < j)
      {
        bfd_signed_vma vdiff;
        idx = (i + j) / 2;
        h = sorted_sym_hash [idx];
        vdiff = vlook - h->root.u.def.value;
        if (vdiff < 0)
    j = idx;
        else if (vdiff > 0)
    i = idx + 1;
        else
    {
#ifdef KEY /* bug 9484: slook may be null */
      long sdiff = slook - h->root.u.def.section;
#else
      long sdiff = slook->id - h->root.u.def.section->id;
#endif
      if (sdiff < 0)
        j = idx;
      else if (sdiff > 0)
        i = idx + 1;
      else
        {
          ilook = idx;
          break;
        }
    }
      }

    /* We didn't find a value/section match.  */
    if (ilook == -1)
      continue;

    for (i = ilook; i < sym_count; i++)
      {
        h = sorted_sym_hash [i];

        /* Stop if value or section doesn't match.  */
        if (h->root.u.def.value != vlook
      || h->root.u.def.section != slook)
    break;
        else if (h != hlook)
    {
      hlook->u.weakdef = h;

      /* If the weak definition is in the list of dynamic
         symbols, make sure the real definition is put
         there as well.  */
      if (hlook->dynindx != -1 && h->dynindx == -1)
        {
          if (! bfd_elf_link_record_dynamic_symbol (info, h))
      goto error_return;
        }

      /* If the real definition is in the list of dynamic
         symbols, make sure the weak definition is put
         there as well.  If we don't do this, then the
         dynamic loader might not merge the entries for the
         real definition and the weak definition.  */
      if (h->dynindx != -1 && hlook->dynindx == -1)
        {
          if (! bfd_elf_link_record_dynamic_symbol (info, hlook))
      goto error_return;
        }
      break;
    }
      }
  }

      free (sorted_sym_hash);
    }

  check_directives = get_elf_backend_data (abfd)->check_directives;
  if (check_directives)
    check_directives (abfd, info);

  /* If this object is the same format as the output object, and it is
     not a shared library, then let the backend look through the
     relocs.

     This is required to build global offset table entries and to
     arrange for dynamic relocs.  It is not required for the
     particular common case of linking non PIC code, even when linking
     against shared libraries, but unfortunately there is no way of
     knowing whether an object file has been compiled PIC or not.
     Looking through the relocs is not particularly time consuming.
     The problem is that we must either (1) keep the relocs in memory,
     which causes the linker to require additional runtime memory or
     (2) read the relocs twice from the input file, which wastes time.
     This would be a good case for using mmap.

     I have no idea how to handle linking PIC code into a file of a
     different format.  It probably can't be done.  */
  check_relocs = get_elf_backend_data (abfd)->check_relocs;
  if (! dynamic
      && is_elf_hash_table (hash_table)
      && hash_table->root.creator == abfd->xvec
      && check_relocs != NULL)
    {
      asection *o;

      for (o = abfd->sections; o != NULL; o = o->next)
  {
    Elf_Internal_Rela *internal_relocs;
    bfd_boolean ok;

    if ((o->flags & SEC_RELOC) == 0
        || o->reloc_count == 0
        || ((info->strip == strip_all || info->strip == strip_debugger)
      && (o->flags & SEC_DEBUGGING) != 0)
        || bfd_is_abs_section (o->output_section))
      continue;

    internal_relocs = _bfd_elf_link_read_relocs (abfd, o, NULL, NULL,
                   info->keep_memory);
    if (internal_relocs == NULL)
      goto error_return;

    ok = (*check_relocs) (abfd, info, o, internal_relocs);

    if (elf_section_data (o)->relocs != internal_relocs)
      free (internal_relocs);

    if (! ok)
      goto error_return;
  }
    }

  /* If this is a non-traditional link, try to optimize the handling
     of the .stab/.stabstr sections.  */
  if (! dynamic
      && ! info->traditional_format
      && is_elf_hash_table (hash_table)
      && (info->strip != strip_all && info->strip != strip_debugger))
    {
      asection *stabstr;

      stabstr = bfd_get_section_by_name (abfd, ".stabstr");
      if (stabstr != NULL)
  {
    bfd_size_type string_offset = 0;
    asection *stab;

    for (stab = abfd->sections; stab; stab = stab->next)
      if (strncmp (".stab", stab->name, 5) == 0
    && (!stab->name[5] ||
        (stab->name[5] == '.' && ISDIGIT (stab->name[6])))
    && (stab->flags & SEC_MERGE) == 0
    && !bfd_is_abs_section (stab->output_section))
        {
    struct bfd_elf_section_data *secdata;

    secdata = elf_section_data (stab);
    if (! _bfd_link_section_stabs (abfd,
                 &hash_table->stab_info,
                 stab, stabstr,
                 &secdata->sec_info,
                 &string_offset))
      goto error_return;
    if (secdata->sec_info)
      stab->sec_info_type = ELF_INFO_TYPE_STABS;
      }
  }
    }

  if (is_elf_hash_table (hash_table) && add_needed)
    {
      /* Add this bfd to the loaded list.  */
      struct elf_link_loaded_list *n;

      n = bfd_alloc (abfd, sizeof (struct elf_link_loaded_list));
      if (n == NULL)
  goto error_return;
      n->abfd = abfd;
      n->next = hash_table->loaded;
      hash_table->loaded = n;
    }

  return TRUE;

 error_free_vers:
  if (nondeflt_vers != NULL)
    free (nondeflt_vers);
  if (extversym != NULL)
    free (extversym);
 error_free_sym:
  if (isymbuf != NULL)
    free (isymbuf);
 error_return:
  return FALSE;
}

/* Return the linker hash table entry of a symbol that might be
   satisfied by an archive symbol.  Return -1 on error.  */

struct elf_link_hash_entry *
_bfd_elf_archive_symbol_lookup (bfd *abfd,
        struct bfd_link_info *info,
        const char *name)
{
  struct elf_link_hash_entry *h;
  char *p, *copy;
  size_t len, first;

  h = elf_link_hash_lookup (elf_hash_table (info), name, FALSE, FALSE, FALSE);
  if (h != NULL)
    return h;

  /* If this is a default version (the name contains @@), look up the
     symbol again with only one `@' as well as without the version.
     The effect is that references to the symbol with and without the
     version will be matched by the default symbol in the archive.  */

  p = strchr (name, ELF_VER_CHR);
  if (p == NULL || p[1] != ELF_VER_CHR)
    return h;

  /* First check with only one `@'.  */
  len = strlen (name);
  copy = bfd_alloc (abfd, len);
  if (copy == NULL)
    return (struct elf_link_hash_entry *) 0 - 1;

  first = p - name + 1;
  memcpy (copy, name, first);
  memcpy (copy + first, name + first + 1, len - first);

  h = elf_link_hash_lookup (elf_hash_table (info), copy, FALSE, FALSE, FALSE);
  if (h == NULL)
    {
      /* We also need to check references to the symbol without the
   version.  */
      copy[first - 1] = '\0';
      h = elf_link_hash_lookup (elf_hash_table (info), copy,
        FALSE, FALSE, FALSE);
    }

  bfd_release (abfd, copy);
  return h;
}

/* Add symbols from an ELF archive file to the linker hash table.  We
   don't use _bfd_generic_link_add_archive_symbols because of a
   problem which arises on UnixWare.  The UnixWare libc.so is an
   archive which includes an entry libc.so.1 which defines a bunch of
   symbols.  The libc.so archive also includes a number of other
   object files, which also define symbols, some of which are the same
   as those defined in libc.so.1.  Correct linking requires that we
   consider each object file in turn, and include it if it defines any
   symbols we need.  _bfd_generic_link_add_archive_symbols does not do
   this; it looks through the list of undefined symbols, and includes
   any object file which defines them.  When this algorithm is used on
   UnixWare, it winds up pulling in libc.so.1 early and defining a
   bunch of symbols.  This means that some of the other objects in the
   archive are not included in the link, which is incorrect since they
   precede libc.so.1 in the archive.

   Fortunately, ELF archive handling is simpler than that done by
   _bfd_generic_link_add_archive_symbols, which has to allow for a.out
   oddities.  In ELF, if we find a symbol in the archive map, and the
   symbol is currently undefined, we know that we must pull in that
   object file.

   Unfortunately, we do have to make multiple passes over the symbol
   table until nothing further is resolved.  */

static bfd_boolean
elf_link_add_archive_symbols (bfd *abfd, struct bfd_link_info *info)
{
  symindex c;
  bfd_boolean *defined = NULL;
  bfd_boolean *included = NULL;
  carsym *symdefs;
  bfd_boolean loop;
  bfd_size_type amt;
  const struct elf_backend_data *bed;
  struct elf_link_hash_entry * (*archive_symbol_lookup)
    (bfd *, struct bfd_link_info *, const char *);

  if (! bfd_has_map (abfd))
    {
      /* An empty archive is a special case.  */
      if (bfd_openr_next_archived_file (abfd, NULL) == NULL)
  return TRUE;
      bfd_set_error (bfd_error_no_armap);
      return FALSE;
    }

  /* Keep track of all symbols we know to be already defined, and all
     files we know to be already included.  This is to speed up the
     second and subsequent passes.  */
  c = bfd_ardata (abfd)->symdef_count;
  if (c == 0)
    return TRUE;
  amt = c;
  amt *= sizeof (bfd_boolean);
  defined = bfd_zmalloc (amt);
  included = bfd_zmalloc (amt);
  if (defined == NULL || included == NULL)
    goto error_return;

  symdefs = bfd_ardata (abfd)->symdefs;
  bed = get_elf_backend_data (abfd);
  archive_symbol_lookup = bed->elf_backend_archive_symbol_lookup;

  do
    {
      file_ptr last;
      symindex i;
      carsym *symdef;
      carsym *symdefend;

      loop = FALSE;
      last = -1;

      symdef = symdefs;
      symdefend = symdef + c;
      for (i = 0; symdef < symdefend; symdef++, i++)
  {
    struct elf_link_hash_entry *h;
    bfd *element;
    struct bfd_link_hash_entry *undefs_tail;
    symindex mark;

    if (defined[i] || included[i])
      continue;
    if (symdef->file_offset == last)
      {
        included[i] = TRUE;
        continue;
      }

    h = archive_symbol_lookup (abfd, info, symdef->name);
    if (h == (struct elf_link_hash_entry *) 0 - 1)
      goto error_return;

    if (h == NULL)
      continue;

    if (h->root.type == bfd_link_hash_common)
      {
        /* We currently have a common symbol.  The archive map contains
     a reference to this symbol, so we may want to include it.  We
     only want to include it however, if this archive element
     contains a definition of the symbol, not just another common
     declaration of it.

     Unfortunately some archivers (including GNU ar) will put
     declarations of common symbols into their archive maps, as
     well as real definitions, so we cannot just go by the archive
     map alone.  Instead we must read in the element's symbol
     table and check that to see what kind of symbol definition
     this is.  */
        if (! elf_link_is_defined_archive_symbol (abfd, symdef))
    continue;
      }
    else if (h->root.type != bfd_link_hash_undefined)
      {
        if (h->root.type != bfd_link_hash_undefweak)
    defined[i] = TRUE;
        continue;
      }

    /* We need to include this archive member.  */
    element = _bfd_get_elt_at_filepos (abfd, symdef->file_offset);
    if (element == NULL)
      goto error_return;

    if (! bfd_check_format (element, bfd_object))
      goto error_return;

    /* Doublecheck that we have not included this object
       already--it should be impossible, but there may be
       something wrong with the archive.  */
    if (element->archive_pass != 0)
      {
#ifdef KEY    // TODO:  In binutils 2.14, the code continues rather than
        //  generating an error.  Do what 2.14 does until we find
        //  out why IPA execution reaches here.

        /* Already got this obj, skip it and continue */
        continue;
#endif
        bfd_set_error (bfd_error_bad_value);
        goto error_return;
      }
    element->archive_pass = 1;

    undefs_tail = info->hash->undefs_tail;

    if (! (*info->callbacks->add_archive_element) (info, element,
               symdef->name))
      goto error_return;
    if (! bfd_link_add_symbols (element, info))
      goto error_return;

#ifdef IPA_LINK
      /* mixed archive*/
    if (ipa_is_whirl(element)) {
      ipa_process_whirl_in_archive(abfd, element);
    }
#endif

    /* If there are any new undefined symbols, we need to make
       another pass through the archive in order to see whether
       they can be defined.  FIXME: This isn't perfect, because
       common symbols wind up on undefs_tail and because an
       undefined symbol which is defined later on in this pass
       does not require another pass.  This isn't a bug, but it
       does make the code less efficient than it could be.  */
    if (undefs_tail != info->hash->undefs_tail)
      loop = TRUE;

    /* Look backward to mark all symbols from this object file
       which we have already seen in this pass.  */
    mark = i;
    do
      {
        included[mark] = TRUE;
        if (mark == 0)
    break;
        --mark;
      }
    while (symdefs[mark].file_offset == symdef->file_offset);

    /* We mark subsequent symbols from this object file as we go
       on through the loop.  */
    last = symdef->file_offset;
  }
    }
  while (loop);

  free (defined);
  free (included);

  return TRUE;

 error_return:
  if (defined != NULL)
    free (defined);
  if (included != NULL)
    free (included);
  return FALSE;
}

/* Given an ELF BFD, add symbols to the global hash table as
   appropriate.  */

bfd_boolean
bfd_elf_link_add_symbols (bfd *abfd, struct bfd_link_info *info)
{
  switch (bfd_get_format (abfd))
    {
    case bfd_object:
      return elf_link_add_object_symbols (abfd, info);
    case bfd_archive:
      return elf_link_add_archive_symbols (abfd, info);
    default:
      bfd_set_error (bfd_error_wrong_format);
      return FALSE;
    }
}

/* This function will be called though elf_link_hash_traverse to store
   all hash value of the exported symbols in an array.  */

static bfd_boolean
elf_collect_hash_codes (struct elf_link_hash_entry *h, void *data)
{
  unsigned long **valuep = data;
  const char *name;
  char *p;
  unsigned long ha;
  char *alc = NULL;

  if (h->root.type == bfd_link_hash_warning)
    h = (struct elf_link_hash_entry *) h->root.u.i.link;

  /* Ignore indirect symbols.  These are added by the versioning code.  */
  if (h->dynindx == -1)
    return TRUE;

  name = h->root.root.string;
  p = strchr (name, ELF_VER_CHR);
  if (p != NULL)
    {
      alc = bfd_malloc (p - name + 1);
      memcpy (alc, name, p - name);
      alc[p - name] = '\0';
      name = alc;
    }

  /* Compute the hash value.  */
  ha = bfd_elf_hash (name);

  /* Store the found hash value in the array given as the argument.  */
  *(*valuep)++ = ha;

  /* And store it in the struct so that we can put it in the hash table
     later.  */
  h->u.elf_hash_value = ha;

  if (alc != NULL)
    free (alc);

  return TRUE;
}

/* Array used to determine the number of hash table buckets to use
   based on the number of symbols there are.  If there are fewer than
   3 symbols we use 1 bucket, fewer than 17 symbols we use 3 buckets,
   fewer than 37 we use 17 buckets, and so forth.  We never use more
   than 32771 buckets.  */

static const size_t elf_buckets[] =
{
  1, 3, 17, 37, 67, 97, 131, 197, 263, 521, 1031, 2053, 4099, 8209,
  16411, 32771, 0
};

/* Compute bucket count for hashing table.  We do not use a static set
   of possible tables sizes anymore.  Instead we determine for all
   possible reasonable sizes of the table the outcome (i.e., the
   number of collisions etc) and choose the best solution.  The
   weighting functions are not too simple to allow the table to grow
   without bounds.  Instead one of the weighting factors is the size.
   Therefore the result is always a good payoff between few collisions
   (= short chain lengths) and table size.  */
static size_t
compute_bucket_count (struct bfd_link_info *info)
{
  size_t dynsymcount = elf_hash_table (info)->dynsymcount;
  size_t best_size = 0;
  unsigned long int *hashcodes;
  unsigned long int *hashcodesp;
  unsigned long int i;
  bfd_size_type amt;

  /* Compute the hash values for all exported symbols.  At the same
     time store the values in an array so that we could use them for
     optimizations.  */
  amt = dynsymcount;
  amt *= sizeof (unsigned long int);
  hashcodes = bfd_malloc (amt);
  if (hashcodes == NULL)
    return 0;
  hashcodesp = hashcodes;

  /* Put all hash values in HASHCODES.  */
  elf_link_hash_traverse (elf_hash_table (info),
        elf_collect_hash_codes, &hashcodesp);

  /* We have a problem here.  The following code to optimize the table
     size requires an integer type with more the 32 bits.  If
     BFD_HOST_U_64_BIT is set we know about such a type.  */
#ifdef BFD_HOST_U_64_BIT
  if (info->optimize)
    {
      unsigned long int nsyms = hashcodesp - hashcodes;
      size_t minsize;
      size_t maxsize;
      BFD_HOST_U_64_BIT best_chlen = ~((BFD_HOST_U_64_BIT) 0);
      unsigned long int *counts ;
      bfd *dynobj = elf_hash_table (info)->dynobj;
      const struct elf_backend_data *bed = get_elf_backend_data (dynobj);

      /* Possible optimization parameters: if we have NSYMS symbols we say
   that the hashing table must at least have NSYMS/4 and at most
   2*NSYMS buckets.  */
      minsize = nsyms / 4;
      if (minsize == 0)
  minsize = 1;
      best_size = maxsize = nsyms * 2;

      /* Create array where we count the collisions in.  We must use bfd_malloc
   since the size could be large.  */
      amt = maxsize;
      amt *= sizeof (unsigned long int);
      counts = bfd_malloc (amt);
      if (counts == NULL)
  {
    free (hashcodes);
    return 0;
  }

      /* Compute the "optimal" size for the hash table.  The criteria is a
   minimal chain length.  The minor criteria is (of course) the size
   of the table.  */
      for (i = minsize; i < maxsize; ++i)
  {
    /* Walk through the array of hashcodes and count the collisions.  */
    BFD_HOST_U_64_BIT max;
    unsigned long int j;
    unsigned long int fact;

    memset (counts, '\0', i * sizeof (unsigned long int));

    /* Determine how often each hash bucket is used.  */
    for (j = 0; j < nsyms; ++j)
      ++counts[hashcodes[j] % i];

    /* For the weight function we need some information about the
       pagesize on the target.  This is information need not be 100%
       accurate.  Since this information is not available (so far) we
       define it here to a reasonable default value.  If it is crucial
       to have a better value some day simply define this value.  */
# ifndef BFD_TARGET_PAGESIZE
#  define BFD_TARGET_PAGESIZE (4096)
# endif

    /* We in any case need 2 + NSYMS entries for the size values and
       the chains.  */
    max = (2 + nsyms) * (bed->s->arch_size / 8);

# if 1
    /* Variant 1: optimize for short chains.  We add the squares
       of all the chain lengths (which favors many small chain
       over a few long chains).  */
    for (j = 0; j < i; ++j)
      max += counts[j] * counts[j];

    /* This adds penalties for the overall size of the table.  */
    fact = i / (BFD_TARGET_PAGESIZE / (bed->s->arch_size / 8)) + 1;
    max *= fact * fact;
# else
    /* Variant 2: Optimize a lot more for small table.  Here we
       also add squares of the size but we also add penalties for
       empty slots (the +1 term).  */
    for (j = 0; j < i; ++j)
      max += (1 + counts[j]) * (1 + counts[j]);

    /* The overall size of the table is considered, but not as
       strong as in variant 1, where it is squared.  */
    fact = i / (BFD_TARGET_PAGESIZE / (bed->s->arch_size / 8)) + 1;
    max *= fact;
# endif

    /* Compare with current best results.  */
    if (max < best_chlen)
      {
        best_chlen = max;
        best_size = i;
      }
  }

      free (counts);
    }
  else
#endif /* defined (BFD_HOST_U_64_BIT) */
    {
      /* This is the fallback solution if no 64bit type is available or if we
   are not supposed to spend much time on optimizations.  We select the
   bucket count using a fixed set of numbers.  */
      for (i = 0; elf_buckets[i] != 0; i++)
  {
    best_size = elf_buckets[i];
    if (dynsymcount < elf_buckets[i + 1])
      break;
  }
    }

  /* Free the arrays we needed.  */
  free (hashcodes);

  return best_size;
}

/* Set up the sizes and contents of the ELF dynamic sections.  This is
   called by the ELF linker emulation before_allocation routine.  We
   must set the sizes of the sections before the linker sets the
   addresses of the various sections.  */

bfd_boolean
bfd_elf_size_dynamic_sections (bfd *output_bfd,
             const char *soname,
             const char *rpath,
             const char *filter_shlib,
             const char * const *auxiliary_filters,
             struct bfd_link_info *info,
             asection **sinterpptr,
             struct bfd_elf_version_tree *verdefs)
{
  bfd_size_type soname_indx;
  bfd *dynobj;
  const struct elf_backend_data *bed;
  struct elf_assign_sym_version_info asvinfo;

  *sinterpptr = NULL;

  soname_indx = (bfd_size_type) -1;

  if (!is_elf_hash_table (info->hash))
    return TRUE;

  elf_tdata (output_bfd)->relro = info->relro;
  if (info->execstack)
    elf_tdata (output_bfd)->stack_flags = PF_R | PF_W | PF_X;
  else if (info->noexecstack)
    elf_tdata (output_bfd)->stack_flags = PF_R | PF_W;
  else
    {
      bfd *inputobj;
      asection *notesec = NULL;
      int exec = 0;

      for (inputobj = info->input_bfds;
     inputobj;
     inputobj = inputobj->link_next)
  {
    asection *s;

    if (inputobj->flags & (DYNAMIC | BFD_LINKER_CREATED))
      continue;
    s = bfd_get_section_by_name (inputobj, ".note.GNU-stack");
    if (s)
      {
        if (s->flags & SEC_CODE)
    exec = PF_X;
        notesec = s;
      }
    else
      exec = PF_X;
  }
      if (notesec)
  {
    elf_tdata (output_bfd)->stack_flags = PF_R | PF_W | exec;
    if (exec && info->relocatable
        && notesec->output_section != bfd_abs_section_ptr)
      notesec->output_section->flags |= SEC_CODE;
  }
    }

  /* Any syms created from now on start with -1 in
     got.refcount/offset and plt.refcount/offset.  */
  elf_hash_table (info)->init_refcount = elf_hash_table (info)->init_offset;

  /* The backend may have to create some sections regardless of whether
     we're dynamic or not.  */
  bed = get_elf_backend_data (output_bfd);
  if (bed->elf_backend_always_size_sections
      && ! (*bed->elf_backend_always_size_sections) (output_bfd, info))
    return FALSE;

  dynobj = elf_hash_table (info)->dynobj;

  /* If there were no dynamic objects in the link, there is nothing to
     do here.  */
  if (dynobj == NULL)
    return TRUE;

  if (! _bfd_elf_maybe_strip_eh_frame_hdr (info))
    return FALSE;

  if (elf_hash_table (info)->dynamic_sections_created)
    {
      struct elf_info_failed eif;
      struct elf_link_hash_entry *h;
      asection *dynstr;
      struct bfd_elf_version_tree *t;
      struct bfd_elf_version_expr *d;
      bfd_boolean all_defined;

      *sinterpptr = bfd_get_section_by_name (dynobj, ".interp");
      BFD_ASSERT (*sinterpptr != NULL || !info->executable);

      if (soname != NULL)
  {
    soname_indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
               soname, TRUE);
    if (soname_indx == (bfd_size_type) -1
        || !_bfd_elf_add_dynamic_entry (info, DT_SONAME, soname_indx))
      return FALSE;
  }

      if (info->symbolic)
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_SYMBOLIC, 0))
      return FALSE;
    info->flags |= DF_SYMBOLIC;
  }

      if (rpath != NULL)
  {
    bfd_size_type indx;

    indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr, rpath,
              TRUE);
    if (indx == (bfd_size_type) -1
        || !_bfd_elf_add_dynamic_entry (info, DT_RPATH, indx))
      return FALSE;

    if  (info->new_dtags)
      {
        _bfd_elf_strtab_addref (elf_hash_table (info)->dynstr, indx);
        if (!_bfd_elf_add_dynamic_entry (info, DT_RUNPATH, indx))
    return FALSE;
      }
  }

      if (filter_shlib != NULL)
  {
    bfd_size_type indx;

    indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
              filter_shlib, TRUE);
    if (indx == (bfd_size_type) -1
        || !_bfd_elf_add_dynamic_entry (info, DT_FILTER, indx))
      return FALSE;
  }

      if (auxiliary_filters != NULL)
  {
    const char * const *p;

    for (p = auxiliary_filters; *p != NULL; p++)
      {
        bfd_size_type indx;

        indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
            *p, TRUE);
        if (indx == (bfd_size_type) -1
      || !_bfd_elf_add_dynamic_entry (info, DT_AUXILIARY, indx))
    return FALSE;
      }
  }

      eif.info = info;
      eif.verdefs = verdefs;
      eif.failed = FALSE;

      /* If we are supposed to export all symbols into the dynamic symbol
   table (this is not the normal case), then do so.  */
      if (info->export_dynamic)
  {
    elf_link_hash_traverse (elf_hash_table (info),
          _bfd_elf_export_symbol,
          &eif);
    if (eif.failed)
      return FALSE;
  }

      /* Make all global versions with definition.  */
      for (t = verdefs; t != NULL; t = t->next)
  for (d = t->globals.list; d != NULL; d = d->next)
    if (!d->symver && d->symbol)
      {
        const char *verstr, *name;
        size_t namelen, verlen, newlen;
        char *newname, *p;
        struct elf_link_hash_entry *newh;

        name = d->symbol;
        namelen = strlen (name);
        verstr = t->name;
        verlen = strlen (verstr);
        newlen = namelen + verlen + 3;

        newname = bfd_malloc (newlen);
        if (newname == NULL)
    return FALSE;
        memcpy (newname, name, namelen);

        /* Check the hidden versioned definition.  */
        p = newname + namelen;
        *p++ = ELF_VER_CHR;
        memcpy (p, verstr, verlen + 1);
        newh = elf_link_hash_lookup (elf_hash_table (info),
             newname, FALSE, FALSE,
             FALSE);
        if (newh == NULL
      || (newh->root.type != bfd_link_hash_defined
          && newh->root.type != bfd_link_hash_defweak))
    {
      /* Check the default versioned definition.  */
      *p++ = ELF_VER_CHR;
      memcpy (p, verstr, verlen + 1);
      newh = elf_link_hash_lookup (elf_hash_table (info),
                 newname, FALSE, FALSE,
                 FALSE);
    }
        free (newname);

        /* Mark this version if there is a definition and it is
     not defined in a shared object.  */
        if (newh != NULL
      && !newh->def_dynamic
      && (newh->root.type == bfd_link_hash_defined
          || newh->root.type == bfd_link_hash_defweak))
    d->symver = 1;
      }

      /* Attach all the symbols to their version information.  */
      asvinfo.output_bfd = output_bfd;
      asvinfo.info = info;
      asvinfo.verdefs = verdefs;
      asvinfo.failed = FALSE;

      elf_link_hash_traverse (elf_hash_table (info),
            _bfd_elf_link_assign_sym_version,
            &asvinfo);
      if (asvinfo.failed)
  return FALSE;

      if (!info->allow_undefined_version)
  {
    /* Check if all global versions have a definition.  */
    all_defined = TRUE;
    for (t = verdefs; t != NULL; t = t->next)
      for (d = t->globals.list; d != NULL; d = d->next)
        if (!d->symver && !d->script)
    {
      (*_bfd_error_handler)
        (_("%s: undefined version: %s"),
         d->pattern, t->name);
      all_defined = FALSE;
    }

    if (!all_defined)
      {
        bfd_set_error (bfd_error_bad_value);
        return FALSE;
      }
  }

      /* Find all symbols which were defined in a dynamic object and make
   the backend pick a reasonable value for them.  */
      elf_link_hash_traverse (elf_hash_table (info),
            _bfd_elf_adjust_dynamic_symbol,
            &eif);
      if (eif.failed)
  return FALSE;

      /* Add some entries to the .dynamic section.  We fill in some of the
   values later, in bfd_elf_final_link, but we must add the entries
   now so that we know the final size of the .dynamic section.  */

      /* If there are initialization and/or finalization functions to
   call then add the corresponding DT_INIT/DT_FINI entries.  */
      h = (info->init_function
     ? elf_link_hash_lookup (elf_hash_table (info),
           info->init_function, FALSE,
           FALSE, FALSE)
     : NULL);
      if (h != NULL
    && (h->ref_regular
        || h->def_regular))
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_INIT, 0))
      return FALSE;
  }
      h = (info->fini_function
     ? elf_link_hash_lookup (elf_hash_table (info),
           info->fini_function, FALSE,
           FALSE, FALSE)
     : NULL);
      if (h != NULL
    && (h->ref_regular
        || h->def_regular))
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_FINI, 0))
      return FALSE;
  }

      if (bfd_get_section_by_name (output_bfd, ".preinit_array") != NULL)
  {
    /* DT_PREINIT_ARRAY is not allowed in shared library.  */
    if (! info->executable)
      {
        bfd *sub;
        asection *o;

        for (sub = info->input_bfds; sub != NULL;
       sub = sub->link_next)
    for (o = sub->sections; o != NULL; o = o->next)
      if (elf_section_data (o)->this_hdr.sh_type
          == SHT_PREINIT_ARRAY)
        {
          (*_bfd_error_handler)
      (_("%B: .preinit_array section is not allowed in DSO"),
       sub);
          break;
        }

        bfd_set_error (bfd_error_nonrepresentable_section);
        return FALSE;
      }

    if (!_bfd_elf_add_dynamic_entry (info, DT_PREINIT_ARRAY, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_PREINIT_ARRAYSZ, 0))
      return FALSE;
  }
      if (bfd_get_section_by_name (output_bfd, ".init_array") != NULL)
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_INIT_ARRAY, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_INIT_ARRAYSZ, 0))
      return FALSE;
  }
      if (bfd_get_section_by_name (output_bfd, ".fini_array") != NULL)
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_FINI_ARRAY, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_FINI_ARRAYSZ, 0))
      return FALSE;
  }

      dynstr = bfd_get_section_by_name (dynobj, ".dynstr");
      /* If .dynstr is excluded from the link, we don't want any of
   these tags.  Strictly, we should be checking each section
   individually;  This quick check covers for the case where
   someone does a /DISCARD/ : { *(*) }.  */
      if (dynstr != NULL && dynstr->output_section != bfd_abs_section_ptr)
  {
    bfd_size_type strsize;

    strsize = _bfd_elf_strtab_size (elf_hash_table (info)->dynstr);
    if (!_bfd_elf_add_dynamic_entry (info, DT_HASH, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_STRTAB, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_SYMTAB, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_STRSZ, strsize)
        || !_bfd_elf_add_dynamic_entry (info, DT_SYMENT,
                bed->s->sizeof_sym))
      return FALSE;
  }
    }

  /* The backend must work out the sizes of all the other dynamic
     sections.  */
  if (bed->elf_backend_size_dynamic_sections
      && ! (*bed->elf_backend_size_dynamic_sections) (output_bfd, info))
    return FALSE;

  if (elf_hash_table (info)->dynamic_sections_created)
    {
      bfd_size_type dynsymcount;
      asection *s;
      size_t bucketcount = 0;
      size_t hash_entry_size;
      unsigned int dtagcount;

      /* Set up the version definition section.  */
      s = bfd_get_section_by_name (dynobj, ".gnu.version_d");
      BFD_ASSERT (s != NULL);

      /* We may have created additional version definitions if we are
   just linking a regular application.  */
      verdefs = asvinfo.verdefs;

      /* Skip anonymous version tag.  */
      if (verdefs != NULL && verdefs->vernum == 0)
  verdefs = verdefs->next;

      if (verdefs == NULL && !info->create_default_symver)
  _bfd_strip_section_from_output (info, s);
      else
  {
    unsigned int cdefs;
    bfd_size_type size;
    struct bfd_elf_version_tree *t;
    bfd_byte *p;
    Elf_Internal_Verdef def;
    Elf_Internal_Verdaux defaux;
    struct bfd_link_hash_entry *bh;
    struct elf_link_hash_entry *h;
    const char *name;

    cdefs = 0;
    size = 0;

    /* Make space for the base version.  */
    size += sizeof (Elf_External_Verdef);
    size += sizeof (Elf_External_Verdaux);
    ++cdefs;

    /* Make space for the default version.  */
    if (info->create_default_symver)
      {
        size += sizeof (Elf_External_Verdef);
        ++cdefs;
      }

    for (t = verdefs; t != NULL; t = t->next)
      {
        struct bfd_elf_version_deps *n;

        size += sizeof (Elf_External_Verdef);
        size += sizeof (Elf_External_Verdaux);
        ++cdefs;

        for (n = t->deps; n != NULL; n = n->next)
    size += sizeof (Elf_External_Verdaux);
      }

    s->size = size;
    s->contents = bfd_alloc (output_bfd, s->size);
    if (s->contents == NULL && s->size != 0)
      return FALSE;

    /* Fill in the version definition section.  */

    p = s->contents;

    def.vd_version = VER_DEF_CURRENT;
    def.vd_flags = VER_FLG_BASE;
    def.vd_ndx = 1;
    def.vd_cnt = 1;
    if (info->create_default_symver)
      {
        def.vd_aux = 2 * sizeof (Elf_External_Verdef);
        def.vd_next = sizeof (Elf_External_Verdef);
      }
    else
      {
        def.vd_aux = sizeof (Elf_External_Verdef);
        def.vd_next = (sizeof (Elf_External_Verdef)
           + sizeof (Elf_External_Verdaux));
      }

    if (soname_indx != (bfd_size_type) -1)
      {
        _bfd_elf_strtab_addref (elf_hash_table (info)->dynstr,
              soname_indx);
        def.vd_hash = bfd_elf_hash (soname);
        defaux.vda_name = soname_indx;
        name = soname;
      }
    else
      {
        bfd_size_type indx;

        name = basename (output_bfd->filename);
        def.vd_hash = bfd_elf_hash (name);
        indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
            name, FALSE);
        if (indx == (bfd_size_type) -1)
    return FALSE;
        defaux.vda_name = indx;
      }
    defaux.vda_next = 0;

    _bfd_elf_swap_verdef_out (output_bfd, &def,
            (Elf_External_Verdef *) p);
    p += sizeof (Elf_External_Verdef);
    if (info->create_default_symver)
      {
        /* Add a symbol representing this version.  */
        bh = NULL;
        if (! (_bfd_generic_link_add_one_symbol
         (info, dynobj, name, BSF_GLOBAL, bfd_abs_section_ptr,
          0, NULL, FALSE,
          get_elf_backend_data (dynobj)->collect, &bh)))
    return FALSE;
        h = (struct elf_link_hash_entry *) bh;
        h->non_elf = 0;
        h->def_regular = 1;
        h->type = STT_OBJECT;
        h->verinfo.vertree = NULL;

        if (! bfd_elf_link_record_dynamic_symbol (info, h))
    return FALSE;

        /* Create a duplicate of the base version with the same
     aux block, but different flags.  */
        def.vd_flags = 0;
        def.vd_ndx = 2;
        def.vd_aux = sizeof (Elf_External_Verdef);
        if (verdefs)
    def.vd_next = (sizeof (Elf_External_Verdef)
             + sizeof (Elf_External_Verdaux));
        else
    def.vd_next = 0;
        _bfd_elf_swap_verdef_out (output_bfd, &def,
          (Elf_External_Verdef *) p);
        p += sizeof (Elf_External_Verdef);
      }
    _bfd_elf_swap_verdaux_out (output_bfd, &defaux,
             (Elf_External_Verdaux *) p);
    p += sizeof (Elf_External_Verdaux);

    for (t = verdefs; t != NULL; t = t->next)
      {
        unsigned int cdeps;
        struct bfd_elf_version_deps *n;

        cdeps = 0;
        for (n = t->deps; n != NULL; n = n->next)
    ++cdeps;

        /* Add a symbol representing this version.  */
        bh = NULL;
        if (! (_bfd_generic_link_add_one_symbol
         (info, dynobj, t->name, BSF_GLOBAL, bfd_abs_section_ptr,
          0, NULL, FALSE,
          get_elf_backend_data (dynobj)->collect, &bh)))
    return FALSE;
        h = (struct elf_link_hash_entry *) bh;
        h->non_elf = 0;
        h->def_regular = 1;
        h->type = STT_OBJECT;
        h->verinfo.vertree = t;

        if (! bfd_elf_link_record_dynamic_symbol (info, h))
    return FALSE;

        def.vd_version = VER_DEF_CURRENT;
        def.vd_flags = 0;
        if (t->globals.list == NULL
      && t->locals.list == NULL
      && ! t->used)
    def.vd_flags |= VER_FLG_WEAK;
        def.vd_ndx = t->vernum + (info->create_default_symver ? 2 : 1);
        def.vd_cnt = cdeps + 1;
        def.vd_hash = bfd_elf_hash (t->name);
        def.vd_aux = sizeof (Elf_External_Verdef);
        def.vd_next = 0;
        if (t->next != NULL)
    def.vd_next = (sizeof (Elf_External_Verdef)
             + (cdeps + 1) * sizeof (Elf_External_Verdaux));

        _bfd_elf_swap_verdef_out (output_bfd, &def,
          (Elf_External_Verdef *) p);
        p += sizeof (Elf_External_Verdef);

        defaux.vda_name = h->dynstr_index;
        _bfd_elf_strtab_addref (elf_hash_table (info)->dynstr,
              h->dynstr_index);
        defaux.vda_next = 0;
        if (t->deps != NULL)
    defaux.vda_next = sizeof (Elf_External_Verdaux);
        t->name_indx = defaux.vda_name;

        _bfd_elf_swap_verdaux_out (output_bfd, &defaux,
           (Elf_External_Verdaux *) p);
        p += sizeof (Elf_External_Verdaux);

        for (n = t->deps; n != NULL; n = n->next)
    {
      if (n->version_needed == NULL)
        {
          /* This can happen if there was an error in the
       version script.  */
          defaux.vda_name = 0;
        }
      else
        {
          defaux.vda_name = n->version_needed->name_indx;
          _bfd_elf_strtab_addref (elf_hash_table (info)->dynstr,
                defaux.vda_name);
        }
      if (n->next == NULL)
        defaux.vda_next = 0;
      else
        defaux.vda_next = sizeof (Elf_External_Verdaux);

      _bfd_elf_swap_verdaux_out (output_bfd, &defaux,
               (Elf_External_Verdaux *) p);
      p += sizeof (Elf_External_Verdaux);
    }
      }

    if (!_bfd_elf_add_dynamic_entry (info, DT_VERDEF, 0)
        || !_bfd_elf_add_dynamic_entry (info, DT_VERDEFNUM, cdefs))
      return FALSE;

    elf_tdata (output_bfd)->cverdefs = cdefs;
  }

      if ((info->new_dtags && info->flags) || (info->flags & DF_STATIC_TLS))
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_FLAGS, info->flags))
      return FALSE;
  }
      else if (info->flags & DF_BIND_NOW)
  {
    if (!_bfd_elf_add_dynamic_entry (info, DT_BIND_NOW, 0))
      return FALSE;
  }

      if (info->flags_1)
  {
    if (info->executable)
      info->flags_1 &= ~ (DF_1_INITFIRST
        | DF_1_NODELETE
        | DF_1_NOOPEN);
    if (!_bfd_elf_add_dynamic_entry (info, DT_FLAGS_1, info->flags_1))
      return FALSE;
  }

      /* Work out the size of the version reference section.  */

      s = bfd_get_section_by_name (dynobj, ".gnu.version_r");
      BFD_ASSERT (s != NULL);
      {
  struct elf_find_verdep_info sinfo;

  sinfo.output_bfd = output_bfd;
  sinfo.info = info;
  sinfo.vers = elf_tdata (output_bfd)->cverdefs;
  if (sinfo.vers == 0)
    sinfo.vers = 1;
  sinfo.failed = FALSE;

  elf_link_hash_traverse (elf_hash_table (info),
        _bfd_elf_link_find_version_dependencies,
        &sinfo);

  if (elf_tdata (output_bfd)->verref == NULL)
    _bfd_strip_section_from_output (info, s);
  else
    {
      Elf_Internal_Verneed *t;
      unsigned int size;
      unsigned int crefs;
      bfd_byte *p;

      /* Build the version definition section.  */
      size = 0;
      crefs = 0;
      for (t = elf_tdata (output_bfd)->verref;
     t != NULL;
     t = t->vn_nextref)
        {
    Elf_Internal_Vernaux *a;

    size += sizeof (Elf_External_Verneed);
    ++crefs;
    for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr)
      size += sizeof (Elf_External_Vernaux);
        }

      s->size = size;
      s->contents = bfd_alloc (output_bfd, s->size);
      if (s->contents == NULL)
        return FALSE;

      p = s->contents;
      for (t = elf_tdata (output_bfd)->verref;
     t != NULL;
     t = t->vn_nextref)
        {
    unsigned int caux;
    Elf_Internal_Vernaux *a;
    bfd_size_type indx;

    caux = 0;
    for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr)
      ++caux;

    t->vn_version = VER_NEED_CURRENT;
    t->vn_cnt = caux;
    indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
              elf_dt_name (t->vn_bfd) != NULL
              ? elf_dt_name (t->vn_bfd)
              : basename (t->vn_bfd->filename),
              FALSE);
    if (indx == (bfd_size_type) -1)
      return FALSE;
    t->vn_file = indx;
    t->vn_aux = sizeof (Elf_External_Verneed);
    if (t->vn_nextref == NULL)
      t->vn_next = 0;
    else
      t->vn_next = (sizeof (Elf_External_Verneed)
        + caux * sizeof (Elf_External_Vernaux));

    _bfd_elf_swap_verneed_out (output_bfd, t,
             (Elf_External_Verneed *) p);
    p += sizeof (Elf_External_Verneed);

    for (a = t->vn_auxptr; a != NULL; a = a->vna_nextptr)
      {
        a->vna_hash = bfd_elf_hash (a->vna_nodename);
        indx = _bfd_elf_strtab_add (elf_hash_table (info)->dynstr,
            a->vna_nodename, FALSE);
        if (indx == (bfd_size_type) -1)
          return FALSE;
        a->vna_name = indx;
        if (a->vna_nextptr == NULL)
          a->vna_next = 0;
        else
          a->vna_next = sizeof (Elf_External_Vernaux);

        _bfd_elf_swap_vernaux_out (output_bfd, a,
                 (Elf_External_Vernaux *) p);
        p += sizeof (Elf_External_Vernaux);
      }
        }

      if (!_bfd_elf_add_dynamic_entry (info, DT_VERNEED, 0)
    || !_bfd_elf_add_dynamic_entry (info, DT_VERNEEDNUM, crefs))
        return FALSE;

      elf_tdata (output_bfd)->cverrefs = crefs;
    }
      }

      /* Assign dynsym indicies.  In a shared library we generate a
   section symbol for each output section, which come first.
   Next come all of the back-end allocated local dynamic syms,
   followed by the rest of the global symbols.  */

      dynsymcount = _bfd_elf_link_renumber_dynsyms (output_bfd, info);

      /* Work out the size of the symbol version section.  */
      s = bfd_get_section_by_name (dynobj, ".gnu.version");
      BFD_ASSERT (s != NULL);
      if (dynsymcount == 0
    || (verdefs == NULL && elf_tdata (output_bfd)->verref == NULL
        && !info->create_default_symver))
  {
    _bfd_strip_section_from_output (info, s);
    /* The DYNSYMCOUNT might have changed if we were going to
       output a dynamic symbol table entry for S.  */
    dynsymcount = _bfd_elf_link_renumber_dynsyms (output_bfd, info);
  }
      else
  {
    s->size = dynsymcount * sizeof (Elf_External_Versym);
    s->contents = bfd_zalloc (output_bfd, s->size);
    if (s->contents == NULL)
      return FALSE;

    if (!_bfd_elf_add_dynamic_entry (info, DT_VERSYM, 0))
      return FALSE;
  }

      /* Set the size of the .dynsym and .hash sections.  We counted
   the number of dynamic symbols in elf_link_add_object_symbols.
   We will build the contents of .dynsym and .hash when we build
   the final symbol table, because until then we do not know the
   correct value to give the symbols.  We built the .dynstr
   section as we went along in elf_link_add_object_symbols.  */
      s = bfd_get_section_by_name (dynobj, ".dynsym");
      BFD_ASSERT (s != NULL);
      s->size = dynsymcount * bed->s->sizeof_sym;
      s->contents = bfd_alloc (output_bfd, s->size);
      if (s->contents == NULL && s->size != 0)
  return FALSE;

      if (dynsymcount != 0)
  {
    Elf_Internal_Sym isym;

    /* The first entry in .dynsym is a dummy symbol.  */
    isym.st_value = 0;
    isym.st_size = 0;
    isym.st_name = 0;
    isym.st_info = 0;
    isym.st_other = 0;
    isym.st_shndx = 0;
    bed->s->swap_symbol_out (output_bfd, &isym, s->contents, 0);
  }

      /* Compute the size of the hashing table.  As a side effect this
   computes the hash values for all the names we export.  */
      bucketcount = compute_bucket_count (info);

      s = bfd_get_section_by_name (dynobj, ".hash");
      BFD_ASSERT (s != NULL);
      hash_entry_size = elf_section_data (s)->this_hdr.sh_entsize;
      s->size = ((2 + bucketcount + dynsymcount) * hash_entry_size);
      s->contents = bfd_zalloc (output_bfd, s->size);
      if (s->contents == NULL)
  return FALSE;

      bfd_put (8 * hash_entry_size, output_bfd, bucketcount, s->contents);
      bfd_put (8 * hash_entry_size, output_bfd, dynsymcount,
         s->contents + hash_entry_size);

      elf_hash_table (info)->bucketcount = bucketcount;

      s = bfd_get_section_by_name (dynobj, ".dynstr");
      BFD_ASSERT (s != NULL);

      elf_finalize_dynstr (output_bfd, info);

      s->size = _bfd_elf_strtab_size (elf_hash_table (info)->dynstr);

      for (dtagcount = 0; dtagcount <= info->spare_dynamic_tags; ++dtagcount)
  if (!_bfd_elf_add_dynamic_entry (info, DT_NULL, 0))
    return FALSE;
    }

  return TRUE;
}

/* Final phase of ELF linker.  */

/* A structure we use to avoid passing large numbers of arguments.  */

struct elf_final_link_info
{
  /* General link information.  */
  struct bfd_link_info *info;
  /* Output BFD.  */
  bfd *output_bfd;
  /* Symbol string table.  */
  struct bfd_strtab_hash *symstrtab;
  /* .dynsym section.  */
  asection *dynsym_sec;
  /* .hash section.  */
  asection *hash_sec;
  /* symbol version section (.gnu.version).  */
  asection *symver_sec;
  /* Buffer large enough to hold contents of any section.  */
  bfd_byte *contents;
  /* Buffer large enough to hold external relocs of any section.  */
  void *external_relocs;
  /* Buffer large enough to hold internal relocs of any section.  */
  Elf_Internal_Rela *internal_relocs;
  /* Buffer large enough to hold external local symbols of any input
     BFD.  */
  bfd_byte *external_syms;
  /* And a buffer for symbol section indices.  */
  Elf_External_Sym_Shndx *locsym_shndx;
  /* Buffer large enough to hold internal local symbols of any input
     BFD.  */
  Elf_Internal_Sym *internal_syms;
  /* Array large enough to hold a symbol index for each local symbol
     of any input BFD.  */
  long *indices;
  /* Array large enough to hold a section pointer for each local
     symbol of any input BFD.  */
  asection **sections;
  /* Buffer to hold swapped out symbols.  */
  bfd_byte *symbuf;
  /* And one for symbol section indices.  */
  Elf_External_Sym_Shndx *symshndxbuf;
  /* Number of swapped out symbols in buffer.  */
  size_t symbuf_count;
  /* Number of symbols which fit in symbuf.  */
  size_t symbuf_size;
  /* And same for symshndxbuf.  */
  size_t shndxbuf_size;
};

/* This struct is used to pass information to elf_link_output_extsym.  */

struct elf_outext_info
{
  bfd_boolean failed;
  bfd_boolean localsyms;
  struct elf_final_link_info *finfo;
};

/* When performing a relocatable link, the input relocations are
   preserved.  But, if they reference global symbols, the indices
   referenced must be updated.  Update all the relocations in
   REL_HDR (there are COUNT of them), using the data in REL_HASH.  */

static void
elf_link_adjust_relocs (bfd *abfd,
      Elf_Internal_Shdr *rel_hdr,
      unsigned int count,
      struct elf_link_hash_entry **rel_hash)
{
  unsigned int i;
  const struct elf_backend_data *bed = get_elf_backend_data (abfd);
  bfd_byte *erela;
  void (*swap_in) (bfd *, const bfd_byte *, Elf_Internal_Rela *);
  void (*swap_out) (bfd *, const Elf_Internal_Rela *, bfd_byte *);
  bfd_vma r_type_mask;
  int r_sym_shift;

  if (rel_hdr->sh_entsize == bed->s->sizeof_rel)
    {
      swap_in = bed->s->swap_reloc_in;
      swap_out = bed->s->swap_reloc_out;
    }
  else if (rel_hdr->sh_entsize == bed->s->sizeof_rela)
    {
      swap_in = bed->s->swap_reloca_in;
      swap_out = bed->s->swap_reloca_out;
    }
  else
    abort ();

  if (bed->s->int_rels_per_ext_rel > MAX_INT_RELS_PER_EXT_REL)
    abort ();

  if (bed->s->arch_size == 32)
    {
      r_type_mask = 0xff;
      r_sym_shift = 8;
    }
  else
    {
      r_type_mask = 0xffffffff;
      r_sym_shift = 32;
    }

  erela = rel_hdr->contents;
  for (i = 0; i < count; i++, rel_hash++, erela += rel_hdr->sh_entsize)
    {
      Elf_Internal_Rela irela[MAX_INT_RELS_PER_EXT_REL];
      unsigned int j;

      if (*rel_hash == NULL)
  continue;

      BFD_ASSERT ((*rel_hash)->indx >= 0);

      (*swap_in) (abfd, erela, irela);
      for (j = 0; j < bed->s->int_rels_per_ext_rel; j++)
  irela[j].r_info = ((bfd_vma) (*rel_hash)->indx << r_sym_shift
         | (irela[j].r_info & r_type_mask));
      (*swap_out) (abfd, irela, erela);
    }
}

struct elf_link_sort_rela
{
  union {
    bfd_vma offset;
    bfd_vma sym_mask;
  } u;
  enum elf_reloc_type_class type;
  /* We use this as an array of size int_rels_per_ext_rel.  */
  Elf_Internal_Rela rela[1];
};

static int
elf_link_sort_cmp1 (const void *A, const void *B)
{
  const struct elf_link_sort_rela *a = A;
  const struct elf_link_sort_rela *b = B;
  int relativea, relativeb;

  relativea = a->type == reloc_class_relative;
  relativeb = b->type == reloc_class_relative;

  if (relativea < relativeb)
    return 1;
  if (relativea > relativeb)
    return -1;
  if ((a->rela->r_info & a->u.sym_mask) < (b->rela->r_info & b->u.sym_mask))
    return -1;
  if ((a->rela->r_info & a->u.sym_mask) > (b->rela->r_info & b->u.sym_mask))
    return 1;
  if (a->rela->r_offset < b->rela->r_offset)
    return -1;
  if (a->rela->r_offset > b->rela->r_offset)
    return 1;
  return 0;
}

static int
elf_link_sort_cmp2 (const void *A, const void *B)
{
  const struct elf_link_sort_rela *a = A;
  const struct elf_link_sort_rela *b = B;
  int copya, copyb;

  if (a->u.offset < b->u.offset)
    return -1;
  if (a->u.offset > b->u.offset)
    return 1;
  copya = (a->type == reloc_class_copy) * 2 + (a->type == reloc_class_plt);
  copyb = (b->type == reloc_class_copy) * 2 + (b->type == reloc_class_plt);
  if (copya < copyb)
    return -1;
  if (copya > copyb)
    return 1;
  if (a->rela->r_offset < b->rela->r_offset)
    return -1;
  if (a->rela->r_offset > b->rela->r_offset)
    return 1;
  return 0;
}

static size_t
elf_link_sort_relocs (bfd *abfd, struct bfd_link_info *info, asection **psec)
{
  asection *reldyn;
  bfd_size_type count, size;
  size_t i, ret, sort_elt, ext_size;
  bfd_byte *sort, *s_non_relative, *p;
  struct elf_link_sort_rela *sq;
  const struct elf_backend_data *bed = get_elf_backend_data (abfd);
  int i2e = bed->s->int_rels_per_ext_rel;
  void (*swap_in) (bfd *, const bfd_byte *, Elf_Internal_Rela *);
  void (*swap_out) (bfd *, const Elf_Internal_Rela *, bfd_byte *);
  struct bfd_link_order *lo;
  bfd_vma r_sym_mask;

  reldyn = bfd_get_section_by_name (abfd, ".rela.dyn");
  if (reldyn == NULL || reldyn->size == 0)
    {
      reldyn = bfd_get_section_by_name (abfd, ".rel.dyn");
      if (reldyn == NULL || reldyn->size == 0)
  return 0;
      ext_size = bed->s->sizeof_rel;
      swap_in = bed->s->swap_reloc_in;
      swap_out = bed->s->swap_reloc_out;
    }
  else
    {
      ext_size = bed->s->sizeof_rela;
      swap_in = bed->s->swap_reloca_in;
      swap_out = bed->s->swap_reloca_out;
    }
  count = reldyn->size / ext_size;

  size = 0;
  for (lo = reldyn->link_order_head; lo != NULL; lo = lo->next)
    if (lo->type == bfd_indirect_link_order)
      {
  asection *o = lo->u.indirect.section;
  size += o->size;
      }

  if (size != reldyn->size)
    return 0;

  sort_elt = (sizeof (struct elf_link_sort_rela)
        + (i2e - 1) * sizeof (Elf_Internal_Rela));
  sort = bfd_zmalloc (sort_elt * count);
  if (sort == NULL)
    {
      (*info->callbacks->warning)
  (info, _("Not enough memory to sort relocations"), 0, abfd, 0, 0);
      return 0;
    }

  if (bed->s->arch_size == 32)
    r_sym_mask = ~(bfd_vma) 0xff;
  else
    r_sym_mask = ~(bfd_vma) 0xffffffff;

  for (lo = reldyn->link_order_head; lo != NULL; lo = lo->next)
    if (lo->type == bfd_indirect_link_order)
      {
  bfd_byte *erel, *erelend;
  asection *o = lo->u.indirect.section;

  if (o->contents == NULL && o->size != 0)
    {
      /* This is a reloc section that is being handled as a normal
         section.  See bfd_section_from_shdr.  We can't combine
         relocs in this case.  */
      free (sort);
      return 0;
    }
  erel = o->contents;
  erelend = o->contents + o->size;
  p = sort + o->output_offset / ext_size * sort_elt;
  while (erel < erelend)
    {
      struct elf_link_sort_rela *s = (struct elf_link_sort_rela *) p;
      (*swap_in) (abfd, erel, s->rela);
      s->type = (*bed->elf_backend_reloc_type_class) (s->rela);
      s->u.sym_mask = r_sym_mask;
      p += sort_elt;
      erel += ext_size;
    }
      }

  qsort (sort, count, sort_elt, elf_link_sort_cmp1);

  for (i = 0, p = sort; i < count; i++, p += sort_elt)
    {
      struct elf_link_sort_rela *s = (struct elf_link_sort_rela *) p;
      if (s->type != reloc_class_relative)
  break;
    }
  ret = i;
  s_non_relative = p;

  sq = (struct elf_link_sort_rela *) s_non_relative;
  for (; i < count; i++, p += sort_elt)
    {
      struct elf_link_sort_rela *sp = (struct elf_link_sort_rela *) p;
      if (((sp->rela->r_info ^ sq->rela->r_info) & r_sym_mask) != 0)
  sq = sp;
      sp->u.offset = sq->rela->r_offset;
    }

  qsort (s_non_relative, count - ret, sort_elt, elf_link_sort_cmp2);

  for (lo = reldyn->link_order_head; lo != NULL; lo = lo->next)
    if (lo->type == bfd_indirect_link_order)
      {
  bfd_byte *erel, *erelend;
  asection *o = lo->u.indirect.section;

  erel = o->contents;
  erelend = o->contents + o->size;
  p = sort + o->output_offset / ext_size * sort_elt;
  while (erel < erelend)
    {
      struct elf_link_sort_rela *s = (struct elf_link_sort_rela *) p;
      (*swap_out) (abfd, s->rela, erel);
      p += sort_elt;
      erel += ext_size;
    }
      }

  free (sort);
  *psec = reldyn;
  return ret;
}

/* Flush the output symbols to the file.  */

static bfd_boolean
elf_link_flush_output_syms (struct elf_final_link_info *finfo,
          const struct elf_backend_data *bed)
{
  if (finfo->symbuf_count > 0)
    {
      Elf_Internal_Shdr *hdr;
      file_ptr pos;
      bfd_size_type amt;

      hdr = &elf_tdata (finfo->output_bfd)->symtab_hdr;
      pos = hdr->sh_offset + hdr->sh_size;
      amt = finfo->symbuf_count * bed->s->sizeof_sym;
      if (bfd_seek (finfo->output_bfd, pos, SEEK_SET) != 0
    || bfd_bwrite (finfo->symbuf, amt, finfo->output_bfd) != amt)
  return FALSE;

      hdr->sh_size += amt;
      finfo->symbuf_count = 0;
    }

  return TRUE;
}

/* Add a symbol to the output symbol table.  */

static bfd_boolean
elf_link_output_sym (struct elf_final_link_info *finfo,
         const char *name,
         Elf_Internal_Sym *elfsym,
         asection *input_sec,
         struct elf_link_hash_entry *h)
{
  bfd_byte *dest;
  Elf_External_Sym_Shndx *destshndx;
  bfd_boolean (*output_symbol_hook)
    (struct bfd_link_info *, const char *, Elf_Internal_Sym *, asection *,
     struct elf_link_hash_entry *);
  const struct elf_backend_data *bed;

  bed = get_elf_backend_data (finfo->output_bfd);
  output_symbol_hook = bed->elf_backend_link_output_symbol_hook;
  if (output_symbol_hook != NULL)
    {
      if (! (*output_symbol_hook) (finfo->info, name, elfsym, input_sec, h))
  return FALSE;
    }

  if (name == NULL || *name == '\0')
    elfsym->st_name = 0;
  else if (input_sec->flags & SEC_EXCLUDE)
    elfsym->st_name = 0;
  else
    {
      elfsym->st_name = (unsigned long) _bfd_stringtab_add (finfo->symstrtab,
                  name, TRUE, FALSE);
      if (elfsym->st_name == (unsigned long) -1)
  return FALSE;
    }

  if (finfo->symbuf_count >= finfo->symbuf_size)
    {
      if (! elf_link_flush_output_syms (finfo, bed))
  return FALSE;
    }

  dest = finfo->symbuf + finfo->symbuf_count * bed->s->sizeof_sym;
  destshndx = finfo->symshndxbuf;
  if (destshndx != NULL)
    {
      if (bfd_get_symcount (finfo->output_bfd) >= finfo->shndxbuf_size)
  {
    bfd_size_type amt;

    amt = finfo->shndxbuf_size * sizeof (Elf_External_Sym_Shndx);
    finfo->symshndxbuf = destshndx = bfd_realloc (destshndx, amt * 2);
    if (destshndx == NULL)
      return FALSE;
    memset ((char *) destshndx + amt, 0, amt);
    finfo->shndxbuf_size *= 2;
  }
      destshndx += bfd_get_symcount (finfo->output_bfd);
    }

  bed->s->swap_symbol_out (finfo->output_bfd, elfsym, dest, destshndx);
  finfo->symbuf_count += 1;
  bfd_get_symcount (finfo->output_bfd) += 1;

  return TRUE;
}

/* For DSOs loaded in via a DT_NEEDED entry, emulate ld.so in
   allowing an unsatisfied unversioned symbol in the DSO to match a
   versioned symbol that would normally require an explicit version.
   We also handle the case that a DSO references a hidden symbol
   which may be satisfied by a versioned symbol in another DSO.  */

static bfd_boolean
elf_link_check_versioned_symbol (struct bfd_link_info *info,
         const struct elf_backend_data *bed,
         struct elf_link_hash_entry *h)
{
  bfd *abfd;
  struct elf_link_loaded_list *loaded;

  if (!is_elf_hash_table (info->hash))
    return FALSE;

  switch (h->root.type)
    {
    default:
      abfd = NULL;
      break;

    case bfd_link_hash_undefined:
    case bfd_link_hash_undefweak:
      abfd = h->root.u.undef.abfd;
      if ((abfd->flags & DYNAMIC) == 0
    || (elf_dyn_lib_class (abfd) & DYN_DT_NEEDED) == 0)
  return FALSE;
      break;

    case bfd_link_hash_defined:
    case bfd_link_hash_defweak:
      abfd = h->root.u.def.section->owner;
      break;

    case bfd_link_hash_common:
      abfd = h->root.u.c.p->section->owner;
      break;
    }
  BFD_ASSERT (abfd != NULL);

  for (loaded = elf_hash_table (info)->loaded;
       loaded != NULL;
       loaded = loaded->next)
    {
      bfd *input;
      Elf_Internal_Shdr *hdr;
      bfd_size_type symcount;
      bfd_size_type extsymcount;
      bfd_size_type extsymoff;
      Elf_Internal_Shdr *versymhdr;
      Elf_Internal_Sym *isym;
      Elf_Internal_Sym *isymend;
      Elf_Internal_Sym *isymbuf;
      Elf_External_Versym *ever;
      Elf_External_Versym *extversym;

      input = loaded->abfd;

      /* We check each DSO for a possible hidden versioned definition.  */
      if (input == abfd
    || (input->flags & DYNAMIC) == 0
    || elf_dynversym (input) == 0)
  continue;

      hdr = &elf_tdata (input)->dynsymtab_hdr;

      symcount = hdr->sh_size / bed->s->sizeof_sym;
      if (elf_bad_symtab (input))
  {
    extsymcount = symcount;
    extsymoff = 0;
  }
      else
  {
    extsymcount = symcount - hdr->sh_info;
    extsymoff = hdr->sh_info;
  }

      if (extsymcount == 0)
  continue;

      isymbuf = bfd_elf_get_elf_syms (input, hdr, extsymcount, extsymoff,
              NULL, NULL, NULL);
      if (isymbuf == NULL)
  return FALSE;

      /* Read in any version definitions.  */
      versymhdr = &elf_tdata (input)->dynversym_hdr;
      extversym = bfd_malloc (versymhdr->sh_size);
      if (extversym == NULL)
  goto error_ret;

      if (bfd_seek (input, versymhdr->sh_offset, SEEK_SET) != 0
    || (bfd_bread (extversym, versymhdr->sh_size, input)
        != versymhdr->sh_size))
  {
    free (extversym);
  error_ret:
    free (isymbuf);
    return FALSE;
  }

      ever = extversym + extsymoff;
      isymend = isymbuf + extsymcount;
      for (isym = isymbuf; isym < isymend; isym++, ever++)
  {
    const char *name;
    Elf_Internal_Versym iver;
    unsigned short version_index;

    if (ELF_ST_BIND (isym->st_info) == STB_LOCAL
        || isym->st_shndx == SHN_UNDEF)
      continue;

    name = bfd_elf_string_from_elf_section (input,
              hdr->sh_link,
              isym->st_name);
    if (strcmp (name, h->root.root.string) != 0)
      continue;

    _bfd_elf_swap_versym_in (input, ever, &iver);

    if ((iver.vs_vers & VERSYM_HIDDEN) == 0)
      {
        /* If we have a non-hidden versioned sym, then it should
     have provided a definition for the undefined sym.  */
        abort ();
      }

    version_index = iver.vs_vers & VERSYM_VERSION;
    if (version_index == 1 || version_index == 2)
      {
        /* This is the base or first version.  We can use it.  */
        free (extversym);
        free (isymbuf);
        return TRUE;
      }
  }

      free (extversym);
      free (isymbuf);
    }

  return FALSE;
}

/* Add an external symbol to the symbol table.  This is called from
   the hash table traversal routine.  When generating a shared object,
   we go through the symbol table twice.  The first time we output
   anything that might have been forced to local scope in a version
   script.  The second time we output the symbols that are still
   global symbols.  */

static bfd_boolean
elf_link_output_extsym (struct elf_link_hash_entry *h, void *data)
{
  struct elf_outext_info *eoinfo = data;
  struct elf_final_link_info *finfo = eoinfo->finfo;
  bfd_boolean strip;
  Elf_Internal_Sym sym;
  asection *input_sec;
  const struct elf_backend_data *bed;

  if (h->root.type == bfd_link_hash_warning)
    {
      h = (struct elf_link_hash_entry *) h->root.u.i.link;
      if (h->root.type == bfd_link_hash_new)
  return TRUE;
    }

  /* Decide whether to output this symbol in this pass.  */
  if (eoinfo->localsyms)
    {
      if (!h->forced_local)
  return TRUE;
    }
  else
    {
      if (h->forced_local)
  return TRUE;
    }

  bed = get_elf_backend_data (finfo->output_bfd);

  /* If we have an undefined symbol reference here then it must have
     come from a shared library that is being linked in.  (Undefined
     references in regular files have already been handled).  If we
     are reporting errors for this situation then do so now.  */
  if (h->root.type == bfd_link_hash_undefined
      && h->ref_dynamic
      && !h->ref_regular
      && ! elf_link_check_versioned_symbol (finfo->info, bed, h)
      && finfo->info->unresolved_syms_in_shared_libs != RM_IGNORE)
    {
      if (! ((*finfo->info->callbacks->undefined_symbol)
       (finfo->info, h->root.root.string, h->root.u.undef.abfd,
        NULL, 0, finfo->info->unresolved_syms_in_shared_libs == RM_GENERATE_ERROR)))
  {
    eoinfo->failed = TRUE;
    return FALSE;
  }
    }

  /* We should also warn if a forced local symbol is referenced from
     shared libraries.  */
  if (! finfo->info->relocatable
      && (! finfo->info->shared)
      && h->forced_local
      && h->ref_dynamic
      && !h->dynamic_def
      && !h->dynamic_weak
      && ! elf_link_check_versioned_symbol (finfo->info, bed, h))
    {
      (*_bfd_error_handler)
  (_("%B: %s symbol `%s' in %B is referenced by DSO"),
   finfo->output_bfd, h->root.u.def.section->owner,
   ELF_ST_VISIBILITY (h->other) == STV_INTERNAL
   ? "internal"
   : ELF_ST_VISIBILITY (h->other) == STV_HIDDEN
   ? "hidden" : "local",
   h->root.root.string);
      eoinfo->failed = TRUE;
      return FALSE;
    }

  /* We don't want to output symbols that have never been mentioned by
     a regular file, or that we have been told to strip.  However, if
     h->indx is set to -2, the symbol is used by a reloc and we must
     output it.  */
  if (h->indx == -2)
    strip = FALSE;
  else if ((h->def_dynamic
      || h->ref_dynamic
      || h->root.type == bfd_link_hash_new)
     && !h->def_regular
     && !h->ref_regular)
    strip = TRUE;
  else if (finfo->info->strip == strip_all)
    strip = TRUE;
  else if (finfo->info->strip == strip_some
     && bfd_hash_lookup (finfo->info->keep_hash,
             h->root.root.string, FALSE, FALSE) == NULL)
    strip = TRUE;
  else if (finfo->info->strip_discarded
     && (h->root.type == bfd_link_hash_defined
         || h->root.type == bfd_link_hash_defweak)
     && elf_discarded_section (h->root.u.def.section))
    strip = TRUE;
  else
    strip = FALSE;

  /* If we're stripping it, and it's not a dynamic symbol, there's
     nothing else to do unless it is a forced local symbol.  */
  if (strip
      && h->dynindx == -1
      && !h->forced_local)
    return TRUE;

  sym.st_value = 0;
  sym.st_size = h->size;
  sym.st_other = h->other;
  if (h->forced_local)
    sym.st_info = ELF_ST_INFO (STB_LOCAL, h->type);
  else if (h->root.type == bfd_link_hash_undefweak
     || h->root.type == bfd_link_hash_defweak)
    sym.st_info = ELF_ST_INFO (STB_WEAK, h->type);
  else
    sym.st_info = ELF_ST_INFO (STB_GLOBAL, h->type);

  switch (h->root.type)
    {
    default:
    case bfd_link_hash_new:
    case bfd_link_hash_warning:
      abort ();
      return FALSE;

    case bfd_link_hash_undefined:
    case bfd_link_hash_undefweak:
      input_sec = bfd_und_section_ptr;
      sym.st_shndx = SHN_UNDEF;
      break;

    case bfd_link_hash_defined:
    case bfd_link_hash_defweak:
      {
  input_sec = h->root.u.def.section;
  if (input_sec->output_section != NULL)
    {
      sym.st_shndx =
        _bfd_elf_section_from_bfd_section (finfo->output_bfd,
             input_sec->output_section);
      if (sym.st_shndx == SHN_BAD)
        {
    (*_bfd_error_handler)
      (_("%B: could not find output section %A for input section %A"),
       finfo->output_bfd, input_sec->output_section, input_sec);
    eoinfo->failed = TRUE;
    return FALSE;
        }

      /* ELF symbols in relocatable files are section relative,
         but in nonrelocatable files they are virtual
         addresses.  */
      sym.st_value = h->root.u.def.value + input_sec->output_offset;
      if (! finfo->info->relocatable)
        {
    sym.st_value += input_sec->output_section->vma;
    if (h->type == STT_TLS)
      {
        /* STT_TLS symbols are relative to PT_TLS segment
           base.  */
        BFD_ASSERT (elf_hash_table (finfo->info)->tls_sec != NULL);
        sym.st_value -= elf_hash_table (finfo->info)->tls_sec->vma;
      }
        }
    }
  else
    {
      BFD_ASSERT (input_sec->owner == NULL
      || (input_sec->owner->flags & DYNAMIC) != 0);
      sym.st_shndx = SHN_UNDEF;
      input_sec = bfd_und_section_ptr;
    }
      }
      break;

    case bfd_link_hash_common:
      input_sec = h->root.u.c.p->section;
      sym.st_shndx = SHN_COMMON;
      sym.st_value = 1 << h->root.u.c.p->alignment_power;
      break;

    case bfd_link_hash_indirect:
      /* These symbols are created by symbol versioning.  They point
   to the decorated version of the name.  For example, if the
   symbol foo@@GNU_1.2 is the default, which should be used when
   foo is used with no version, then we add an indirect symbol
   foo which points to foo@@GNU_1.2.  We ignore these symbols,
   since the indirected symbol is already in the hash table.  */
      return TRUE;
    }

  /* Give the processor backend a chance to tweak the symbol value,
     and also to finish up anything that needs to be done for this
     symbol.  FIXME: Not calling elf_backend_finish_dynamic_symbol for
     forced local syms when non-shared is due to a historical quirk.  */
  if ((h->dynindx != -1
       || h->forced_local)
      && ((finfo->info->shared
     && (ELF_ST_VISIBILITY (h->other) == STV_DEFAULT
         || h->root.type != bfd_link_hash_undefweak))
    || !h->forced_local)
      && elf_hash_table (finfo->info)->dynamic_sections_created)
    {
      if (! ((*bed->elf_backend_finish_dynamic_symbol)
       (finfo->output_bfd, finfo->info, h, &sym)))
  {
    eoinfo->failed = TRUE;
    return FALSE;
  }
    }

  /* If we are marking the symbol as undefined, and there are no
     non-weak references to this symbol from a regular object, then
     mark the symbol as weak undefined; if there are non-weak
     references, mark the symbol as strong.  We can't do this earlier,
     because it might not be marked as undefined until the
     finish_dynamic_symbol routine gets through with it.  */
  if (sym.st_shndx == SHN_UNDEF
      && h->ref_regular
      && (ELF_ST_BIND (sym.st_info) == STB_GLOBAL
    || ELF_ST_BIND (sym.st_info) == STB_WEAK))
    {
      int bindtype;

      if (h->ref_regular_nonweak)
  bindtype = STB_GLOBAL;
      else
  bindtype = STB_WEAK;
      sym.st_info = ELF_ST_INFO (bindtype, ELF_ST_TYPE (sym.st_info));
    }

  /* If a non-weak symbol with non-default visibility is not defined
     locally, it is a fatal error.  */
  if (! finfo->info->relocatable
      && ELF_ST_VISIBILITY (sym.st_other) != STV_DEFAULT
      && ELF_ST_BIND (sym.st_info) != STB_WEAK
      && h->root.type == bfd_link_hash_undefined
      && !h->def_regular)
    {
      (*_bfd_error_handler)
  (_("%B: %s symbol `%s' isn't defined"),
   finfo->output_bfd,
   ELF_ST_VISIBILITY (sym.st_other) == STV_PROTECTED
   ? "protected"
   : ELF_ST_VISIBILITY (sym.st_other) == STV_INTERNAL
   ? "internal" : "hidden",
   h->root.root.string);
      eoinfo->failed = TRUE;
      return FALSE;
    }

  /* If this symbol should be put in the .dynsym section, then put it
     there now.  We already know the symbol index.  We also fill in
     the entry in the .hash section.  */
  if (h->dynindx != -1
      && elf_hash_table (finfo->info)->dynamic_sections_created)
    {
      size_t bucketcount;
      size_t bucket;
      size_t hash_entry_size;
      bfd_byte *bucketpos;
      bfd_vma chain;
      bfd_byte *esym;

      sym.st_name = h->dynstr_index;
      esym = finfo->dynsym_sec->contents + h->dynindx * bed->s->sizeof_sym;
      bed->s->swap_symbol_out (finfo->output_bfd, &sym, esym, 0);

      bucketcount = elf_hash_table (finfo->info)->bucketcount;
      bucket = h->u.elf_hash_value % bucketcount;
      hash_entry_size
  = elf_section_data (finfo->hash_sec)->this_hdr.sh_entsize;
      bucketpos = ((bfd_byte *) finfo->hash_sec->contents
       + (bucket + 2) * hash_entry_size);
      chain = bfd_get (8 * hash_entry_size, finfo->output_bfd, bucketpos);
      bfd_put (8 * hash_entry_size, finfo->output_bfd, h->dynindx, bucketpos);
      bfd_put (8 * hash_entry_size, finfo->output_bfd, chain,
         ((bfd_byte *) finfo->hash_sec->contents
    + (bucketcount + 2 + h->dynindx) * hash_entry_size));

      if (finfo->symver_sec != NULL && finfo->symver_sec->contents != NULL)
  {
    Elf_Internal_Versym iversym;
    Elf_External_Versym *eversym;

    if (!h->def_regular)
      {
        if (h->verinfo.verdef == NULL)
    iversym.vs_vers = 0;
        else
    iversym.vs_vers = h->verinfo.verdef->vd_exp_refno + 1;
      }
    else
      {
        if (h->verinfo.vertree == NULL)
    iversym.vs_vers = 1;
        else
    iversym.vs_vers = h->verinfo.vertree->vernum + 1;
        if (finfo->info->create_default_symver)
    iversym.vs_vers++;
      }

    if (h->hidden)
      iversym.vs_vers |= VERSYM_HIDDEN;

    eversym = (Elf_External_Versym *) finfo->symver_sec->contents;
    eversym += h->dynindx;
    _bfd_elf_swap_versym_out (finfo->output_bfd, &iversym, eversym);
  }
    }

  /* If we're stripping it, then it was just a dynamic symbol, and
     there's nothing else to do.  */
  if (strip || (input_sec->flags & SEC_EXCLUDE) != 0)
    return TRUE;

  h->indx = bfd_get_symcount (finfo->output_bfd);

  if (! elf_link_output_sym (finfo, h->root.root.string, &sym, input_sec, h))
    {
      eoinfo->failed = TRUE;
      return FALSE;
    }

  return TRUE;
}

/* Return TRUE if special handling is done for relocs in SEC against
   symbols defined in discarded sections.  */

static bfd_boolean
elf_section_ignore_discarded_relocs (asection *sec)
{
  const struct elf_backend_data *bed;

  switch (sec->sec_info_type)
    {
    case ELF_INFO_TYPE_STABS:
    case ELF_INFO_TYPE_EH_FRAME:
      return TRUE;
    default:
      break;
    }

  bed = get_elf_backend_data (sec->owner);
  if (bed->elf_backend_ignore_discarded_relocs != NULL
      && (*bed->elf_backend_ignore_discarded_relocs) (sec))
    return TRUE;

  return FALSE;
}

enum action_discarded
  {
    COMPLAIN = 1,
    PRETEND = 2
  };

/* Return a mask saying how ld should treat relocations in SEC against
   symbols defined in discarded sections.  If this function returns
   COMPLAIN set, ld will issue a warning message.  If this function
   returns PRETEND set, and the discarded section was link-once and the
   same size as the kept link-once section, ld will pretend that the
   symbol was actually defined in the kept section.  Otherwise ld will
   zero the reloc (at least that is the intent, but some cooperation by
   the target dependent code is needed, particularly for REL targets).  */

static unsigned int
elf_action_discarded (asection *sec)
{
  if (sec->flags & SEC_DEBUGGING)
    return PRETEND;

  if (strcmp (".eh_frame", sec->name) == 0)
    return 0;

  if (strcmp (".gcc_except_table", sec->name) == 0)
    return 0;

  if (strcmp (".PARISC.unwind", sec->name) == 0)
    return 0;

  if (strcmp (".fixup", sec->name) == 0)
    return 0;

  return COMPLAIN | PRETEND;
}

/* Find a match between a section and a member of a section group.  */

static asection *
match_group_member (asection *sec, asection *group)
{
  asection *first = elf_next_in_group (group);
  asection *s = first;

  while (s != NULL)
    {
      if (bfd_elf_match_symbols_in_sections (s, sec))
  return s;

      if (s == first)
  break;
    }

  return NULL;
}

/* Link an input file into the linker output file.  This function
   handles all the sections and relocations of the input file at once.
   This is so that we only have to read the local symbols once, and
   don't have to keep them in memory.  */

static bfd_boolean
elf_link_input_bfd (struct elf_final_link_info *finfo, bfd *input_bfd)
{
  bfd_boolean (*relocate_section)
    (bfd *, struct bfd_link_info *, bfd *, asection *, bfd_byte *,
     Elf_Internal_Rela *, Elf_Internal_Sym *, asection **);
  bfd *output_bfd;
  Elf_Internal_Shdr *symtab_hdr;
  size_t locsymcount;
  size_t extsymoff;
  Elf_Internal_Sym *isymbuf;
  Elf_Internal_Sym *isym;
  Elf_Internal_Sym *isymend;
  long *pindex;
  asection **ppsection;
  asection *o;
  const struct elf_backend_data *bed;
  bfd_boolean emit_relocs;
  struct elf_link_hash_entry **sym_hashes;

  output_bfd = finfo->output_bfd;
  bed = get_elf_backend_data (output_bfd);
  relocate_section = bed->elf_backend_relocate_section;

  /* If this is a dynamic object, we don't want to do anything here:
     we don't want the local symbols, and we don't want the section
     contents.  */
  if ((input_bfd->flags & DYNAMIC) != 0)
    return TRUE;

  emit_relocs = (finfo->info->relocatable
     || finfo->info->emitrelocations
     || bed->elf_backend_emit_relocs);

  symtab_hdr = &elf_tdata (input_bfd)->symtab_hdr;
  if (elf_bad_symtab (input_bfd))
    {
      locsymcount = symtab_hdr->sh_size / bed->s->sizeof_sym;
      extsymoff = 0;
    }
  else
    {
      locsymcount = symtab_hdr->sh_info;
      extsymoff = symtab_hdr->sh_info;
    }

  /* Read the local symbols.  */
  isymbuf = (Elf_Internal_Sym *) symtab_hdr->contents;
  if (isymbuf == NULL && locsymcount != 0)
    {
      isymbuf = bfd_elf_get_elf_syms (input_bfd, symtab_hdr, locsymcount, 0,
              finfo->internal_syms,
              finfo->external_syms,
              finfo->locsym_shndx);
      if (isymbuf == NULL)
  return FALSE;
    }

  /* Find local symbol sections and adjust values of symbols in
     SEC_MERGE sections.  Write out those local symbols we know are
     going into the output file.  */
  isymend = isymbuf + locsymcount;
  for (isym = isymbuf, pindex = finfo->indices, ppsection = finfo->sections;
       isym < isymend;
       isym++, pindex++, ppsection++)
    {
      asection *isec;
      const char *name;
      Elf_Internal_Sym osym;

      *pindex = -1;

      if (elf_bad_symtab (input_bfd))
  {
    if (ELF_ST_BIND (isym->st_info) != STB_LOCAL)
      {
        *ppsection = NULL;
        continue;
      }
  }

      if (isym->st_shndx == SHN_UNDEF)
  isec = bfd_und_section_ptr;
      else if (isym->st_shndx < SHN_LORESERVE
         || isym->st_shndx > SHN_HIRESERVE)
  {
    isec = bfd_section_from_elf_index (input_bfd, isym->st_shndx);
    if (isec
        && isec->sec_info_type == ELF_INFO_TYPE_MERGE
        && ELF_ST_TYPE (isym->st_info) != STT_SECTION)
      isym->st_value =
        _bfd_merged_section_offset (output_bfd, &isec,
            elf_section_data (isec)->sec_info,
            isym->st_value);
  }
      else if (isym->st_shndx == SHN_ABS)
  isec = bfd_abs_section_ptr;
      else if (isym->st_shndx == SHN_COMMON)
  isec = bfd_com_section_ptr;
      else
  {
    /* Who knows?  */
    isec = NULL;
  }

      *ppsection = isec;

      /* Don't output the first, undefined, symbol.  */
      if (ppsection == finfo->sections)
  continue;

      if (ELF_ST_TYPE (isym->st_info) == STT_SECTION)
  {
    /* We never output section symbols.  Instead, we use the
       section symbol of the corresponding section in the output
       file.  */
    continue;
  }

      /* If we are stripping all symbols, we don't want to output this
   one.  */
      if (finfo->info->strip == strip_all)
  continue;

      /* If we are discarding all local symbols, we don't want to
   output this one.  If we are generating a relocatable output
   file, then some of the local symbols may be required by
   relocs; we output them below as we discover that they are
   needed.  */
      if (finfo->info->discard == discard_all)
  continue;

      /* If this symbol is defined in a section which we are
   discarding, we don't need to keep it, but note that
   linker_mark is only reliable for sections that have contents.
   For the benefit of the MIPS ELF linker, we check SEC_EXCLUDE
   as well as linker_mark.  */
      if ((isym->st_shndx < SHN_LORESERVE || isym->st_shndx > SHN_HIRESERVE)
    && (isec == NULL
        || (! isec->linker_mark && (isec->flags & SEC_HAS_CONTENTS) != 0)
        || (! finfo->info->relocatable
      && (isec->flags & SEC_EXCLUDE) != 0)))
  continue;

      /* Get the name of the symbol.  */
      name = bfd_elf_string_from_elf_section (input_bfd, symtab_hdr->sh_link,
                isym->st_name);
      if (name == NULL)
  return FALSE;

      /* See if we are discarding symbols with this name.  */
      if ((finfo->info->strip == strip_some
     && (bfd_hash_lookup (finfo->info->keep_hash, name, FALSE, FALSE)
         == NULL))
    || (((finfo->info->discard == discard_sec_merge
    && (isec->flags & SEC_MERGE) && ! finfo->info->relocatable)
         || finfo->info->discard == discard_l)
        && bfd_is_local_label_name (input_bfd, name)))
  continue;

      /* If we get here, we are going to output this symbol.  */

      osym = *isym;

      /* Adjust the section index for the output file.  */
      osym.st_shndx = _bfd_elf_section_from_bfd_section (output_bfd,
               isec->output_section);
      if (osym.st_shndx == SHN_BAD)
  return FALSE;

      *pindex = bfd_get_symcount (output_bfd);

      /* ELF symbols in relocatable files are section relative, but
   in executable files they are virtual addresses.  Note that
   this code assumes that all ELF sections have an associated
   BFD section with a reasonable value for output_offset; below
   we assume that they also have a reasonable value for
   output_section.  Any special sections must be set up to meet
   these requirements.  */
      osym.st_value += isec->output_offset;
      if (! finfo->info->relocatable)
  {
    osym.st_value += isec->output_section->vma;
    if (ELF_ST_TYPE (osym.st_info) == STT_TLS)
      {
        /* STT_TLS symbols are relative to PT_TLS segment base.  */
        BFD_ASSERT (elf_hash_table (finfo->info)->tls_sec != NULL);
        osym.st_value -= elf_hash_table (finfo->info)->tls_sec->vma;
      }
  }

      if (! elf_link_output_sym (finfo, name, &osym, isec, NULL))
  return FALSE;
    }

  /* Relocate the contents of each section.  */
  sym_hashes = elf_sym_hashes (input_bfd);
  for (o = input_bfd->sections; o != NULL; o = o->next)
    {
      bfd_byte *contents;

      if (! o->linker_mark)
  {
    /* This section was omitted from the link.  */
    continue;
  }

      if ((o->flags & SEC_HAS_CONTENTS) == 0
    || (o->size == 0 && (o->flags & SEC_RELOC) == 0))
  continue;

      if ((o->flags & SEC_LINKER_CREATED) != 0)
  {
    /* Section was created by _bfd_elf_link_create_dynamic_sections
       or somesuch.  */
    continue;
  }

      /* Get the contents of the section.  They have been cached by a
   relaxation routine.  Note that o is a section in an input
   file, so the contents field will not have been set by any of
   the routines which work on output files.  */
      if (elf_section_data (o)->this_hdr.contents != NULL)
  contents = elf_section_data (o)->this_hdr.contents;
      else
  {
    bfd_size_type amt = o->rawsize ? o->rawsize : o->size;

    contents = finfo->contents;
    if (! bfd_get_section_contents (input_bfd, o, contents, 0, amt))
      return FALSE;
  }

      if ((o->flags & SEC_RELOC) != 0)
  {
    Elf_Internal_Rela *internal_relocs;
    bfd_vma r_type_mask;
    int r_sym_shift;

    /* Get the swapped relocs.  */
    internal_relocs
      = _bfd_elf_link_read_relocs (input_bfd, o, finfo->external_relocs,
           finfo->internal_relocs, FALSE);
    if (internal_relocs == NULL
        && o->reloc_count > 0)
      return FALSE;

    if (bed->s->arch_size == 32)
      {
        r_type_mask = 0xff;
        r_sym_shift = 8;
      }
    else
      {
        r_type_mask = 0xffffffff;
        r_sym_shift = 32;
      }

    /* Run through the relocs looking for any against symbols
       from discarded sections and section symbols from
       removed link-once sections.  Complain about relocs
       against discarded sections.  Zero relocs against removed
       link-once sections.  Preserve debug information as much
       as we can.  */
    if (!elf_section_ignore_discarded_relocs (o))
      {
        Elf_Internal_Rela *rel, *relend;
        unsigned int action = elf_action_discarded (o);

        rel = internal_relocs;
        relend = rel + o->reloc_count * bed->s->int_rels_per_ext_rel;
        for ( ; rel < relend; rel++)
    {
      unsigned long r_symndx = rel->r_info >> r_sym_shift;
      asection **ps, *sec;
      struct elf_link_hash_entry *h = NULL;
      const char *sym_name