/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c

Bug Summary

File:	src/gnu/usr.bin/binutils-2.17/bfd/elflink.c
Warning:	line 5470, column 15 Assigned value is garbage or undefined
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name elflink.c -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -pic-is-pie -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/binutils-2.17/obj/bfd -resource-dir /usr/local/lib/clang/13.0.0 -D HAVE_CONFIG_H -I . -I /usr/src/gnu/usr.bin/binutils-2.17/bfd -I . -D NETBSD_CORE -I . -I /usr/src/gnu/usr.bin/binutils-2.17/bfd -I /usr/src/gnu/usr.bin/binutils-2.17/bfd/../include -I /usr/src/gnu/usr.bin/binutils-2.17/bfd/../intl -I ../intl -D PIE_DEFAULT=1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/gnu/usr.bin/binutils-2.17/obj/bfd -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c /usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c
1/* ELF linking support for BFD.
 Copyright 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
 2005, 2006 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., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.  */

21#include "bfd.h"
22#include "sysdep.h"
23#include "bfdlink.h"
24#include "libbfd.h"
25#define ARCH_SIZE0 0
26#include "elf-bfd.h"
27#include "safe-ctype.h"
28#include "libiberty.h"
29#include "objalloc.h"

31/* Define a symbol in a dynamic linkage section.  */

33struct elf_link_hash_entry *
34_bfd_elf_define_linkage_sym (bfd *abfd,
	     struct bfd_link_info *info,
	     asection *sec,
	     const char *name)
38{
struct elf_link_hash_entry *h;
struct bfd_link_hash_entry *bh;
const struct elf_backend_data *bed;

h = elf_link_hash_lookup (elf_hash_table (info), name, FALSE, FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (0), (0), (0)));
if (h != NULL((void*)0))
  {
    /* 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, name, BSF_GLOBAL0x02,
			 sec, 0, NULL((void*)0), FALSE0,
			 get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
)->collect,
			 &bh))
  return NULL((void*)0);
h = (struct elf_link_hash_entry *) bh;
h->def_regular = 1;
h->type = STT_OBJECT1;
h->other = (h->other & ~ELF_ST_VISIBILITY (-1)((-1) & 0x3)) | STV_HIDDEN2;

bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
(*bed->elf_backend_hide_symbol) (info, h, TRUE1);
return h;
67}

69bfd_boolean
70_bfd_elf_create_got_section (bfd *abfd, struct bfd_link_info *info)
71{
flagword flags;
asection *s;
struct elf_link_hash_entry *h;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
int ptralign;

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

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

  case 64:
    ptralign = 3;
    break;

  default:
    bfd_set_error (bfd_error_bad_value);
    return FALSE0;
  }

flags = bed->dynamic_sec_flags;

s = bfd_make_section_with_flags (abfd, ".got", flags);
if (s == NULL((void*)0)
    || !bfd_set_section_alignment (abfd, s, ptralign)(((s)->alignment_power = (ptralign)),1))
  return FALSE0;

if (bed->want_got_plt)
  {
    s = bfd_make_section_with_flags (abfd, ".got.plt", flags);
    if (s == NULL((void*)0)
 || !bfd_set_section_alignment (abfd, s, ptralign)(((s)->alignment_power = (ptralign)),1))
return FALSE0;
  }

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.  */
    h = _bfd_elf_define_linkage_sym (abfd, info, s, "_GLOBAL_OFFSET_TABLE_");
    elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->hgot = h;
    if (h == NULL((void*)0))
return FALSE0;
  }

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

return TRUE1;
129}
130
131/* Create a strtab to hold the dynamic symbol names.  */
132static bfd_boolean
133_bfd_elf_link_create_dynstrtab (bfd *abfd, struct bfd_link_info *info)
134{
struct elf_link_hash_table *hash_table;

hash_table = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash));
if (hash_table->dynobj == NULL((void*)0))
  hash_table->dynobj = abfd;

if (hash_table->dynstr == NULL((void*)0))
  {
    hash_table->dynstr = _bfd_elf_strtab_init ();
    if (hash_table->dynstr == NULL((void*)0))
return FALSE0;
  }
return TRUE1;
148}

150/* 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.  */

157bfd_boolean
158_bfd_elf_link_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info)
159{
flagword flags;
register asection *s;
const struct elf_backend_data *bed;

if (! is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return FALSE0;

if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created)
  return TRUE1;

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

abfd = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynobj;
bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

flags = bed->dynamic_sec_flags;

/* A dynamically linked executable has a .interp section, but a
   shared library does not.  */
if (info->executable && !info->static_link)
  {
    s = bfd_make_section_with_flags (abfd, ".interp",
		       flags | SEC_READONLY0x008);
    if (s == NULL((void*)0))
return FALSE0;
  }

if (! info->traditional_format)
  {
    s = bfd_make_section_with_flags (abfd, ".eh_frame_hdr",
		       flags | SEC_READONLY0x008);
    if (s == NULL((void*)0)
 || ! bfd_set_section_alignment (abfd, s, 2)(((s)->alignment_power = (2)),1))
return FALSE0;
    elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->eh_info.hdr_sec = s;
  }

/* Create sections to hold version informations.  These are removed
   if they are not needed.  */
s = bfd_make_section_with_flags (abfd, ".gnu.version_d",
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
  return FALSE0;

s = bfd_make_section_with_flags (abfd, ".gnu.version",
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, 1)(((s)->alignment_power = (1)),1))
  return FALSE0;

s = bfd_make_section_with_flags (abfd, ".gnu.version_r",
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
  return FALSE0;

s = bfd_make_section_with_flags (abfd, ".dynsym",
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
  return FALSE0;

s = bfd_make_section_with_flags (abfd, ".dynstr",
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0))
  return FALSE0;

s = bfd_make_section_with_flags (abfd, ".dynamic", flags);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
  return FALSE0;

/* 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.  */
if (!_bfd_elf_define_linkage_sym (abfd, info, s, "_DYNAMIC"))
  return FALSE0;

if (info->emit_hash)
  {
    s = bfd_make_section_with_flags (abfd, ".hash", flags | SEC_READONLY0x008);
    if (s == NULL((void*)0)
 || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
return FALSE0;
    elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->this_hdr.sh_entsize = bed->s->sizeof_hash_entry;
  }

if (info->emit_gnu_hash)
  {
    s = bfd_make_section_with_flags (abfd, ".gnu.hash",
		       flags | SEC_READONLY0x008);
    if (s == NULL((void*)0)
 || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
return FALSE0;
    /* For 64-bit ELF, .gnu.hash is a non-uniform entity size section:
4 32-bit words followed by variable count of 64-bit words, then
variable count of 32-bit words.  */
    if (bed->s->arch_size == 64)
elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->this_hdr.sh_entsize = 0;
    else
elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->this_hdr.sh_entsize = 4;
  }

/* 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 FALSE0;

elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created = TRUE1;

return TRUE1;
277}

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

281bfd_boolean
282_bfd_elf_create_dynamic_sections (bfd *abfd, struct bfd_link_info *info)
283{
flagword flags, pltflags;
struct elf_link_hash_entry *h;
asection *s;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

/* 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_CODE0x010 | SEC_LOAD0x002 | SEC_HAS_CONTENTS0x100);
else
  pltflags |= SEC_ALLOC0x001 | SEC_CODE0x010 | SEC_LOAD0x002;
if (bed->plt_readonly)
  pltflags |= SEC_READONLY0x008;

s = bfd_make_section_with_flags (abfd, ".plt", pltflags);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->plt_alignment)(((s)->alignment_power = (bed->plt_alignment)),1))
  return FALSE0;

/* Define the symbol _PROCEDURE_LINKAGE_TABLE_ at the start of the
   .plt section.  */
if (bed->want_plt_sym)
  {
    h = _bfd_elf_define_linkage_sym (abfd, info, s,
		       "_PROCEDURE_LINKAGE_TABLE_");
    elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->hplt = h;
    if (h == NULL((void*)0))
return FALSE0;
  }

s = bfd_make_section_with_flags (abfd,
		   (bed->default_use_rela_p
		    ? ".rela.plt" : ".rel.plt"),
		   flags | SEC_READONLY0x008);
if (s == NULL((void*)0)
    || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
  return FALSE0;

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

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_with_flags (abfd, ".dynbss",
		       (SEC_ALLOC0x001
			| SEC_LINKER_CREATED0x200000));
    if (s == NULL((void*)0))
return FALSE0;

    /* 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_with_flags (abfd,
			   (bed->default_use_rela_p
			    ? ".rela.bss" : ".rel.bss"),
			   flags | SEC_READONLY0x008);
 if (s == NULL((void*)0)
     || ! bfd_set_section_alignment (abfd, s, bed->s->log_file_align)(((s)->alignment_power = (bed->s->log_file_align)),1
))
   return FALSE0;
}
  }

return TRUE1;
369}
370
371/* 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.  */

379bfd_boolean
380bfd_elf_link_record_dynamic_symbol (struct bfd_link_info *info,
		    struct elf_link_hash_entry *h)
382{
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)((h->other) & 0x3))
{
case STV_INTERNAL1:
case STV_HIDDEN2:
 if (h->root.type != bfd_link_hash_undefined
     && h->root.type != bfd_link_hash_undefweak)
   {
     h->forced_local = 1;
     if (!elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->is_relocatable_executable)
return TRUE1;
   }

default:
 break;
}

    h->dynindx = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynsymcount;
    ++elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynsymcount;

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

    /* 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((void*)0))
/* 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((void*)0));

    if (p != NULL((void*)0))
*p = ELF_VER_CHR'@';

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

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

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

if (!is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return TRUE1;

htab = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash));
h = elf_link_hash_lookup (htab, name, !provide, TRUE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&(htab
)->root, (name), (!provide), (1), (0)));
if (h == NULL((void*)0))
  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((void*)0) || 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((void*)0);

h->def_regular = 1;

if (provide && hidden)
  {
    const struct elf_backend_data *bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);

    h->other = (h->other & ~ELF_ST_VISIBILITY (-1)((-1) & 0x3)) | STV_HIDDEN2;
    (*bed->elf_backend_hide_symbol) (info, h, TRUE1);
  }

/* 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)((h->other) & 0x3) == STV_HIDDEN2
 || ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) == STV_INTERNAL1))
  h->forced_local = 1;

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

    /* 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((void*)0)
 && h->u.weakdef->dynindx == -1)
{
 if (! bfd_elf_link_record_dynamic_symbol (info, h->u.weakdef))
   return FALSE0;
}
  }

return TRUE1;
539}

541/* 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.  */

545int
546bfd_elf_link_record_local_dynamic_symbol (struct bfd_link_info *info,
			  bfd *input_bfd,
			  long input_indx)
549{
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)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return 0;

/* See if the entry exists already.  */
for (entry = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->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((void*)0))
  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)((input_bfd) -> tdata.elf_obj_data)->symtab_hdr,
	     1, input_indx, &entry->isym, esym, &eshndx))
  {
    bfd_release (input_bfd, entry);
    return 0;
  }

if (entry->isym.st_shndx != SHN_UNDEF0
    && (entry->isym.st_shndx < SHN_LORESERVE0xFF00
 || entry->isym.st_shndx > SHN_HIRESERVE0xFFFF))
  {
    asection *s;

    s = bfd_section_from_elf_index (input_bfd, entry->isym.st_shndx);
    if (s == NULL((void*)0) || bfd_is_abs_section (s->output_section)((s->output_section) == ((asection *) &bfd_abs_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)((input_bfd) -> tdata.elf_obj_data)->symtab_hdr.sh_link,
  entry->isym.st_name));

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

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

eht = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash));

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))(((0) << 4) + ((((entry->isym.st_info) & 0xF)) &
 0xF));

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

return 1;
629}

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

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

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

646/* 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.  */

650static bfd_boolean
651elf_link_renumber_hash_table_dynsyms (struct elf_link_hash_entry *h,
		      void *data)
653{
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 TRUE1;

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

return TRUE1;
666}


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

672static bfd_boolean
673elf_link_renumber_local_hash_table_dynsyms (struct elf_link_hash_entry *h,
			    void *data)
675{
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 TRUE1;

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

return TRUE1;
688}

690/* Return true if the dynamic symbol for a given section should be
 omitted when creating a shared library.  */
692bfd_boolean
693_bfd_elf_link_omit_section_dynsym (bfd *output_bfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
		   struct bfd_link_info *info,
		   asection *p)
696{
switch (elf_section_data (p)((struct bfd_elf_section_data*)(p)->used_by_bfd)->this_hdr.sh_type)
  {
  case SHT_PROGBITS1:
  case SHT_NOBITS8:
    /* If sh_type is yet undecided, assume it could be
SHT_PROGBITS/SHT_NOBITS.  */
  case SHT_NULL0:
    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)((struct elf_link_hash_table *) ((info)->hash))->dynobj;

 if (dynobj != NULL((void*)0)
     && (ip = bfd_get_section_by_name (dynobj, p->name)) != NULL((void*)0)
     && (ip->flags & SEC_LINKER_CREATED0x200000)
     && ip->output_section == p)
   return TRUE1;
}
    return FALSE0;

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

726/* 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.  */

732static unsigned long
733_bfd_elf_link_renumber_dynsyms (bfd *output_bfd,
		struct bfd_link_info *info,
		unsigned long *section_sym_count)
736{
unsigned long dynsymcount = 0;

if (info->shared || elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->is_relocatable_executable)
  {
    const struct elf_backend_data *bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
    asection *p;
    for (p = output_bfd->sections; p ; p = p->next)
if ((p->flags & SEC_EXCLUDE0x8000) == 0
   && (p->flags & SEC_ALLOC0x001) != 0
   && !(*bed->elf_backend_omit_section_dynsym) (output_bfd, info, p))
 elf_section_data (p)((struct bfd_elf_section_data*)(p)->used_by_bfd)->dynindx = ++dynsymcount;
  }
*section_sym_count = dynsymcount;

elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_renumber_local_hash_table_dynsyms), (&
dynsymcount)))
	  elf_link_renumber_local_hash_table_dynsyms,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_renumber_local_hash_table_dynsyms), (&
dynsymcount)))
	  &dynsymcount)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_renumber_local_hash_table_dynsyms), (&
dynsymcount)));

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

elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_renumber_hash_table_dynsyms), (&dynsymcount
)))
	  elf_link_renumber_hash_table_dynsyms,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_renumber_hash_table_dynsyms), (&dynsymcount
)))
	  &dynsymcount)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (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;

elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynsymcount = dynsymcount;
return dynsymcount;
774}

776/* 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.  */

788bfd_boolean
789_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)
801{
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;
const struct elf_backend_data *bed;

*skip = FALSE0;
*override = FALSE0;

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

if (! bfd_is_und_section (sec)((sec) == ((asection *) &bfd_und_section)))
  h = elf_link_hash_lookup (elf_hash_table (info), name, TRUE, FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (1), (0), (0)));
else
  h = ((struct elf_link_hash_entry *)
bfd_wrapped_link_hash_lookup (abfd, info, name, TRUE1, FALSE0, FALSE0));
if (h == NULL((void*)0))
  return FALSE0;
*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 TRUE1;

/* 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)
  {
    h->non_elf = 0;
    return TRUE1;
  }

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

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

  case bfd_link_hash_undefined:
  case bfd_link_hash_undefweak:
    oldbfd = h->root.u.undef.abfd;
    oldsec = NULL((void*)0);
    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.  */
if (abfd == oldbfd
    && ((abfd->flags & DYNAMIC0x40) == 0
 || !h->def_regular))
  return TRUE1;

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

newdyn = (abfd->flags & DYNAMIC0x40) != 0;

olddyn = FALSE0;
if (oldbfd != NULL((void*)0))
  olddyn = (oldbfd->flags & DYNAMIC0x40) != 0;
else if (oldsec != NULL((void*)0))
  {
    /* This handles the special SHN_MIPS_{TEXT,DATA} section
indices used by MIPS ELF.  */
    olddyn = (oldsec->symbol->flags & BSF_DYNAMIC0x8000) != 0;
  }

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

newdef = !bfd_is_und_section (sec)((sec) == ((asection *) &bfd_und_section)) && !bfd_is_com_section (sec)(((sec)->flags & 0x1000) != 0);

olddef = (h->root.type != bfd_link_hash_undefined
   && h->root.type != bfd_link_hash_undefweak
   && h->root.type != bfd_link_hash_common);

/* When we try to create a default indirect symbol from the dynamic
   definition with the default version, we skip it if its type and
   the type of existing regular definition mismatch.  We only do it
   if the existing regular definition won't be dynamic.  */
if (pold_alignment == NULL((void*)0)
    && !info->shared
    && !info->export_dynamic
    && !h->ref_dynamic
    && newdyn
    && newdef
    && !olddyn
    && (olddef || h->root.type == bfd_link_hash_common)
    && ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) != h->type
    && ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) != STT_NOTYPE0
    && h->type != STT_NOTYPE0)
  {
    *skip = TRUE1;
    return TRUE1;
  }

/* Check TLS symbol.  We don't check undefined symbol introduced by
   "ld -u".  */
if ((ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) == STT_TLS6 || h->type == STT_TLS6)
    && ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) != h->type
    && oldbfd != NULL((void*)0))
  {
    bfd *ntbfd, *tbfd;
    bfd_boolean ntdef, tdef;
    asection *ntsec, *tsec;

    if (h->type == STT_TLS6)
{
 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")("%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")("%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")("%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")("%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 FALSE0;
  }

/* 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)((sec) == ((asection *) &bfd_und_section)))
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_WEAK2)
h->dynamic_weak = 1;
   }
 else if (bind != STB_WEAK2)
   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)((h->other) & 0x3) != STV_DEFAULT0
    && !bfd_is_und_section (sec)((sec) == ((asection *) &bfd_und_section)))
  {
    *skip = TRUE1;
    /* 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)((h->other) & 0x3) == STV_PROTECTED3)
return bfd_elf_link_record_dynamic_symbol (info, h);
    else
return TRUE1;
  }
else if (!newdyn
  && ELF_ST_VISIBILITY (sym->st_other)((sym->st_other) & 0x3) != STV_DEFAULT0
  && 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)((sec) == ((asection *) &bfd_und_section)))
{
 /* 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((void*)0);
}

    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 TRUE1;
  }

/* Differentiate strong and weak symbols.  */
newweak = bind == STB_WEAK2;
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 = FALSE0;
if (olddef && newdyn)
  oldweak = FALSE0;

/* 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 = TRUE1;

/* 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 = TRUE1;

/* 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_ALLOC0x001) != 0
    && (sec->flags & SEC_LOAD0x002) == 0
    && sym->st_size > 0
    && ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) != STT_FUNC2)
  newdyncommon = TRUE1;
else
  newdyncommon = FALSE0;

if (olddyn
    && olddef
    && h->root.type == bfd_link_hash_defined
    && h->def_dynamic
    && (h->root.u.def.section->flags & SEC_ALLOC0x001) != 0
    && (h->root.u.def.section->flags & SEC_LOAD0x002) == 0
    && h->size > 0
    && h->type != STT_FUNC2)
  olddyncommon = TRUE1;
else
  olddyncommon = FALSE0;

/* We now know everything about the old and new symbols.  We ask the
   backend to check if we can merge them.  */
bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
if (bed->merge_symbol
    && !bed->merge_symbol (info, sym_hash, h, sym, psec, pvalue,
	     pold_alignment, skip, override,
	     type_change_ok, size_change_ok,
	     &newdyn, &newdef, &newdyncommon, &newweak,
	     abfd, &sec,
	     &olddyn, &olddef, &olddyncommon, &oldweak,
	     oldbfd, &oldsec))
  return FALSE0;

/* 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 FALSE0;

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

    *size_change_ok = TRUE1;
  }

/* 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)((sym->st_info) & 0xF) == STT_FUNC2
  || (!olddyn && info->executable)))))
  {
    *override = TRUE1;
    newdef = FALSE0;
    newdyncommon = FALSE0;

    *psec = sec = bfd_und_section_ptr((asection *) &bfd_und_section);
    *size_change_ok = TRUE1;

    /* 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 = TRUE1;
  }

/* 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 do the
   right thing.  */

if (newdyncommon
    && h->root.type == bfd_link_hash_common)
  {
    *override = TRUE1;
    newdef = FALSE0;
    newdyncommon = FALSE0;
    *pvalue = sym->st_size;
    *psec = sec = bed->common_section (oldsec);
    *size_change_ok = TRUE1;
  }

/* Skip weak definitions of symbols that are already defined.  */
if (newdef && olddef && newweak)
  *skip = TRUE1;

/* 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((void*)0);
if (!newdyn
    && (newdef
 || (bfd_is_com_section (sec)(((sec)->flags & 0x1000) != 0)
     && (oldweak
  || h->type == STT_FUNC2)))
    && 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 = TRUE1;

    olddef = FALSE0;
    olddyncommon = FALSE0;

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

    if (bfd_is_com_section (sec)(((sec)->flags & 0x1000) != 0))
*type_change_ok = TRUE1;

    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((void*)0);
  }

/* 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)(((sec)->flags & 0x1000) != 0)
    && 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 FALSE0;

    /* 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)do { if (!(pold_alignment)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,1314); } while (0);
    *pold_alignment = h->root.u.def.section->alignment_power;

    olddef = FALSE0;
    olddyncommon = FALSE0;

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

    *size_change_ok = TRUE1;
    *type_change_ok = TRUE1;

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

if (flip != NULL((void*)0))
  {
    /* 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)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
    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) (info, 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 TRUE1;
1351}

1353/* 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.  */

1358bfd_boolean
1359_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)
1368{
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((void*)0) || p[1] != ELF_VER_CHR'@')
  return TRUE1;

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,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (1), (0), (0)))
		 FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (1), (0), (0)));
    BFD_ASSERT (hi != NULL)do { if (!(hi != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,1396); } while (0);
    if (hi == h)
return TRUE1;
    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 TRUE1;
}
  }

bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
collect = bed->collect;
dynamic = (abfd->flags & DYNAMIC0x40) != 0;

shortlen = p - name;
shortname = bfd_hash_allocate (&info->hash->table, shortlen + 1);
if (shortname == NULL((void*)0))
  return FALSE0;
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 = FALSE0;
size_change_ok = FALSE0;
sec = *psec;
if (!_bfd_elf_merge_symbol (abfd, info, shortname, sym, &sec, value,
	      NULL((void*)0), &hi, &skip, &override,
	      &type_change_ok, &size_change_ok))
  return FALSE0;

if (skip)
  goto nondefault;

if (! override)
  {
    bh = &hi->root;
    if (! (_bfd_generic_link_add_one_symbol
    (info, abfd, shortname, BSF_INDIRECT0x2000, bfd_ind_section_ptr((asection *) &bfd_ind_section),
     0, name, FALSE0, collect, &bh)))
return FALSE0;
    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 FALSE0;
   }
}

    /* 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) (info, 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 = TRUE1;
   }
 else
   {
     if (hi->ref_regular)
*dynsym = TRUE1;
   }
}
  }

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

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

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

if (skip)
  return TRUE1;

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'")("%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_INDIRECT0x2000,
     bfd_ind_section_ptr((asection *) &bfd_ind_section), 0, name, FALSE0, collect, &bh)))
return FALSE0;
    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) (info, 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 = TRUE1;
}
     else
{
  if (hi->ref_regular)
    *dynsym = TRUE1;
}
   }
}
  }

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

1591bfd_boolean
1592_bfd_elf_export_symbol (struct elf_link_hash_entry *h, void *data)
1593{
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 TRUE1;

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((void*)0); t = t->next)
{
 if (t->globals.list != NULL((void*)0))
   {
     d = (*t->match) (&t->globals, NULL((void*)0), h->root.root.string);
     if (d != NULL((void*)0))
goto doit;
   }

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

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

return TRUE1;
1639}
1640
1641/* 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.  */

1646bfd_boolean
1647_bfd_elf_link_find_version_dependencies (struct elf_link_hash_entry *h,
			 void *data)
1649{
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((void*)0))
  return TRUE1;

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

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

    break;
  }

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

if (t == NULL((void*)0))
  {
    amt = sizeof *t;
    t = bfd_zalloc (rinfo->output_bfd, amt);
    if (t == NULL((void*)0))
{
 rinfo->failed = TRUE1;
 return FALSE0;
}

    t->vn_bfd = h->verinfo.verdef->vd_bfd;
    t->vn_nextref = elf_tdata (rinfo->output_bfd)((rinfo->output_bfd) -> tdata.elf_obj_data)->verref;
    elf_tdata (rinfo->output_bfd)((rinfo->output_bfd) -> tdata.elf_obj_data)->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 TRUE1;
1716}

1718/* 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.  */

1723bfd_boolean
1724_bfd_elf_link_assign_sym_version (struct elf_link_hash_entry *h, void *data)
1725{
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 = FALSE0;
eif.info = info;
if (! _bfd_elf_fix_symbol_flags (h, &eif))
  {
    if (eif.failed)
sinfo->failed = TRUE1;
    return FALSE0;
  }

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

bed = get_elf_backend_data (sinfo->output_bfd)((const struct elf_backend_data *) (sinfo->output_bfd)->
xvec->backend_data);
p = strchr (h->root.root.string, ELF_VER_CHR'@');
if (p != NULL((void*)0) && h->verinfo.vertree == NULL((void*)0))
  {
    struct bfd_elf_version_tree *t;
    bfd_boolean hidden;

    hidden = TRUE1;

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

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

    /* Look for the version.  If we find it, it is no longer weak.  */
    for (t = sinfo->verdefs; t != NULL((void*)0); 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((void*)0))
return FALSE0;
     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 = TRUE1;
     d = NULL((void*)0);

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

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

     free (alc);
     break;
   }
}

    /* If we are building an application, we need to create a
version node for this version.  */
    if (t == NULL((void*)0) && 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 TRUE1;

 amt = sizeof *t;
 t = bfd_zalloc (sinfo->output_bfd, amt);
 if (t == NULL((void*)0))
   {
     sinfo->failed = TRUE1;
     return FALSE0;
   }

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

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

 *pp = t;

 h->verinfo.vertree = t;
}
    else if (t == NULL((void*)0))
{
 /* 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")("%B: undefined versioned symbol name %s"),
    sinfo->output_bfd, h->root.root.string);
 bfd_set_error (bfd_error_bad_value);
 sinfo->failed = TRUE1;
 return FALSE0;
}

    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((void*)0) && sinfo->verdefs != NULL((void*)0))
  {
    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((void*)0);
    for (t = sinfo->verdefs; t != NULL((void*)0); t = t->next)
{
 if (t->globals.list != NULL((void*)0))
   {
     bfd_boolean matched;

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

 if (t->locals.list != NULL((void*)0))
   {
     d = NULL((void*)0);
     while ((d = (*t->match) (&t->locals, d,
		       h->root.root.string)) != NULL((void*)0))
{
  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((void*)0))
break;
   }
}

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

return TRUE1;
1946}
1947
1948/* 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.  */

1957static bfd_boolean
1958elf_link_read_relocs_from_section (bfd *abfd,
		   asection *sec,
		   Elf_Internal_Shdr *shdr,
		   void *external_relocs,
		   Elf_Internal_Rela *internal_relocs)
1963{
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_SET0) != 0)
  return FALSE0;

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

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

bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

/* 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 FALSE0;
  }

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)((irela->r_info) >> 8);
    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)"("%B: bad reloc symbol index (0x%lx >= 0x%lx)" " for offset 0x%lx in section `%A'"
)
      " for offset 0x%lx in section `%A'")("%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 FALSE0;
}
    irela += bed->s->int_rels_per_ext_rel;
    erela += shdr->sh_entsize;
  }

return TRUE1;
2022}

2024/* 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.  */

2034Elf_Internal_Rela *
2035_bfd_elf_link_read_relocs (bfd *abfd,
	   asection *o,
	   void *external_relocs,
	   Elf_Internal_Rela *internal_relocs,
	   bfd_boolean keep_memory)
2040{
Elf_Internal_Shdr *rel_hdr;
void *alloc1 = NULL((void*)0);
Elf_Internal_Rela *alloc2 = NULL((void*)0);
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->relocs != NULL((void*)0))
  return elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->relocs;

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

rel_hdr = &elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr;

if (internal_relocs == NULL((void*)0))
  {
    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((void*)0))
goto error_return;
  }

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

    if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2)
size += elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2->sh_size;
    alloc1 = bfd_malloc (size);
    if (alloc1 == NULL((void*)0))
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)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2
    && (!elf_link_read_relocs_from_section
 (abfd, o,
  elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2,
  ((bfd_byte *) external_relocs) + rel_hdr->sh_size,
  internal_relocs + (NUM_SHDR_ENTRIES (rel_hdr)((rel_hdr)->sh_size / (rel_hdr)->sh_entsize)
	      * 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)((struct bfd_elf_section_data*)(o)->used_by_bfd)->relocs = internal_relocs;

if (alloc1 != NULL((void*)0))
  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((void*)0))
  free (alloc1);
if (alloc2 != NULL((void*)0))
  free (alloc2);
return NULL((void*)0);
2111}

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

2116bfd_boolean
2117_bfd_elf_link_size_reloc_section (bfd *abfd,
		  Elf_Internal_Shdr *rel_hdr,
		  asection *o)
2120{
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)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr)
  reloc_count = elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count;
else
  reloc_count = elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->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((void*)0) && rel_hdr->sh_size != 0)
  return FALSE0;

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

    p = bfd_zmalloc (num_rel_hashes * sizeof (struct elf_link_hash_entry *));
    if (p == NULL((void*)0))
return FALSE0;

    elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes = p;
  }

return TRUE1;
2160}

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

2166bfd_boolean
2167_bfd_elf_link_output_relocs (bfd *output_bfd,
	     asection *input_section,
	     Elf_Internal_Shdr *input_rel_hdr,
	     Elf_Internal_Rela *internal_relocs,
	     struct elf_link_hash_entry **rel_hash
	       ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
2173{
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((void*)0);
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((void*)0);

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

bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
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 ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 2214, __PRETTY_FUNCTION__);

erel = output_rel_hdr->contents;
erel += *rel_countp * input_rel_hdr->sh_entsize;
irela = internal_relocs;
irelaend = irela + (NUM_SHDR_ENTRIES (input_rel_hdr)((input_rel_hdr)->sh_size / (input_rel_hdr)->sh_entsize
)
      * 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)((input_rel_hdr)->sh_size / (input_rel_hdr)->sh_entsize
);

return TRUE1;
2233}
2234
2235/* Make weak undefined symbols in PIE dynamic.  */

2237bfd_boolean
2238_bfd_elf_link_hash_fixup_symbol (struct bfd_link_info *info,
		 struct elf_link_hash_entry *h)
2240{
if (info->pie
    && h->dynindx == -1
    && h->root.type == bfd_link_hash_undefweak)
  return bfd_elf_link_record_dynamic_symbol (info, h);

return TRUE1;
2247}

2249/* 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.  */

2255bfd_boolean
2256_bfd_elf_fix_symbol_flags (struct elf_link_hash_entry *h,
	   struct elf_info_failed *eif)
2258{
const struct elf_backend_data *bed = NULL((void*)0);

/* 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((void*)0)
     && (bfd_get_flavour (h->root.u.def.section->owner)((h->root.u.def.section->owner)->xvec->flavour)
  == 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 = TRUE1;
     return FALSE0;
   }
}
  }
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((void*)0)
     ? (bfd_get_flavour (h->root.u.def.section->owner)((h->root.u.def.section->owner)->xvec->flavour)
 != bfd_target_elf_flavour)
     : (bfd_is_abs_section (h->root.u.def.section)((h->root.u.def.section) == ((asection *) &bfd_abs_section
))
 && !h->def_dynamic)))
h->def_regular = 1;
  }

/* Backend specific symbol fixup.  */
if (elf_hash_table (eif->info)((struct elf_link_hash_table *) ((eif->info)->hash))->dynobj)
  {
    bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj)((const struct elf_backend_data *) (((struct elf_link_hash_table
 *) ((eif->info)->hash))->dynobj)->xvec->backend_data
);
    if (bed->elf_backend_fixup_symbol
 && !(*bed->elf_backend_fixup_symbol) (eif->info, h))
return FALSE0;
  }

/* 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 & DYNAMIC0x40) == 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)(((struct bfd_link_hash_table *) (eif->info->hash))->
type == bfd_link_elf_hash_table)
    && (eif->info->symbolic || eif->info->static_link
 || ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) != STV_DEFAULT0)
    && h->def_regular)
  {
    bfd_boolean force_local;

    force_local = (ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) == STV_INTERNAL1
     || ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) == STV_HIDDEN2);
    (*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)((h->other) & 0x3) != STV_DEFAULT0
    && h->root.type == bfd_link_hash_undefweak)
  {
    const struct elf_backend_data *bed;
    bed = get_elf_backend_data (elf_hash_table (eif->info)->dynobj)((const struct elf_backend_data *) (((struct elf_link_hash_table
 *) ((eif->info)->hash))->dynobj)->xvec->backend_data
);
    (*bed->elf_backend_hide_symbol) (eif->info, h, TRUE1);
  }

/* 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((void*)0))
  {
    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_defineddo { if (!(h->root.type == bfd_link_hash_defined || h->
root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2382); } while (0)
  || h->root.type == bfd_link_hash_defweak)do { if (!(h->root.type == bfd_link_hash_defined || h->
root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2382); } while (0);
    BFD_ASSERT (weakdef->root.type == bfd_link_hash_defineddo { if (!(weakdef->root.type == bfd_link_hash_defined || weakdef
->root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2384); } while (0)
  || weakdef->root.type == bfd_link_hash_defweak)do { if (!(weakdef->root.type == bfd_link_hash_defined || weakdef
->root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2384); } while (0);
    BFD_ASSERT (weakdef->def_dynamic)do { if (!(weakdef->def_dynamic)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2385); } while (0);

    /* 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((void*)0);
    else
(*bed->elf_backend_copy_indirect_symbol) (eif->info, weakdef,
				  h);
  }

return TRUE1;
2398}

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

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

if (! is_elf_hash_table (eif->info->hash)(((struct bfd_link_hash_table *) (eif->info->hash))->
type == bfd_link_elf_hash_table))
  return FALSE0;

if (h->root.type == bfd_link_hash_warning)
  {
    h->got = elf_hash_table (eif->info)((struct elf_link_hash_table *) ((eif->info)->hash))->init_got_offset;
    h->plt = elf_hash_table (eif->info)((struct elf_link_hash_table *) ((eif->info)->hash))->init_plt_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 TRUE1;

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

/* 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((void*)0) || h->u.weakdef->dynindx == -1))))
  {
    h->plt = elf_hash_table (eif->info)((struct elf_link_hash_table *) ((eif->info)->hash))->init_plt_offset;
    return TRUE1;
  }

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

/* 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((void*)0))
  {
    /* 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 FALSE0;
  }

/* 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_NOTYPE0
    && !h->needs_plt)
  (*_bfd_error_handler)
    (_("warning: type and size of dynamic symbol `%s' are not defined")("warning: type and size of dynamic symbol `%s' are not defined"
),
     h->root.root.string);

dynobj = elf_hash_table (eif->info)((struct elf_link_hash_table *) ((eif->info)->hash))->dynobj;
bed = get_elf_backend_data (dynobj)((const struct elf_backend_data *) (dynobj)->xvec->backend_data
);
if (! (*bed->elf_backend_adjust_dynamic_symbol) (eif->info, h))
  {
    eif->failed = TRUE1;
    return FALSE0;
  }

return TRUE1;
2522}

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

2527bfd_boolean
2528_bfd_elf_link_sec_merge_syms (struct elf_link_hash_entry *h, void *data)
2529{
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_MERGE0x1000000)
    && sec->sec_info_type == ELF_INFO_TYPE_MERGE2)
  {
    bfd *output_bfd = data;

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

return TRUE1;
2550}

2552/* 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.  */

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

if (h == NULL((void*)0))
  return FALSE0;

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 FALSE0;
if (h->forced_local)
  return FALSE0;

/* 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)((h->other) & 0x3))
  {
  case STV_INTERNAL1:
  case STV_HIDDEN2:
    return FALSE0;

  case STV_PROTECTED3:
    /* 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_FUNC2)
binding_stays_local_p = TRUE1;
    break;

  default:
    break;
  }

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

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

2607/* 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.  */

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

/* 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)(!(h)->def_regular && !(h)->def_dynamic &&
 (h)->root.type == bfd_link_hash_defined))
  /* 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 FALSE0;

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

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

/* 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 TRUE1;

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

/* However, STV_HIDDEN or STV_INTERNAL ones must be local.  */
if (ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) != STV_PROTECTED3)
  return TRUE1;

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

/* 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;
2661}

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

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

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

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

elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->tls_sec = tls;

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

return tls;
2689}

2691/* Return TRUE iff this is a non-common, definition of a non-function symbol.  */
2692static bfd_boolean
2693is_global_data_symbol_definition (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
		  Elf_Internal_Sym *sym)
2695{
const struct elf_backend_data *bed;

/* Local symbols do not count, but target specific ones might.  */
if (ELF_ST_BIND (sym->st_info)(((unsigned int)(sym->st_info)) >> 4) != STB_GLOBAL1
    && ELF_ST_BIND (sym->st_info)(((unsigned int)(sym->st_info)) >> 4) < STB_LOOS10)
  return FALSE0;

/* Function symbols do not count.  */
if (ELF_ST_TYPE (sym->st_info)((sym->st_info) & 0xF) == STT_FUNC2)
  return FALSE0;

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

/* If the symbol is defined in the common section, then
   it is a common definition and so does not count.  */
bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
if (bed->common_definition (sym))
  return FALSE0;

/* 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_LORESERVE0xFF00 && sym->st_shndx < SHN_ABS0xFFF1)
  /* 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 FALSE0;

return TRUE1;
2730}

2732/* 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.  */
2735static bfd_boolean
2736elf_link_is_defined_archive_symbol (bfd * abfd, carsym * symdef)
2737{
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((void*)0))
  return FALSE0;

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

/* 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 FALSE0;

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

symcount = hdr->sh_size / get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
)->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)(((abfd) -> tdata.elf_obj_data) -> bad_symtab))
  {
    extsymcount = symcount;
    extsymoff = 0;
  }
else
  {
    extsymcount = symcount - hdr->sh_info;
    extsymoff = hdr->sh_info;
  }

if (extsymcount == 0)
  return FALSE0;

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

/* Scan the symbol table looking for SYMDEF.  */
result = FALSE0;
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((void*)0))
break;

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

free (isymbuf);

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

2816bfd_boolean
2817_bfd_elf_add_dynamic_entry (struct bfd_link_info *info,
	    bfd_vma tag,
	    bfd_vma val)
2820{
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)((struct elf_link_hash_table *) ((info)->hash));
if (! is_elf_hash_table (hash_table)(((struct bfd_link_hash_table *) (hash_table))->type == bfd_link_elf_hash_table
))
  return FALSE0;

bed = get_elf_backend_data (hash_table->dynobj)((const struct elf_backend_data *) (hash_table->dynobj)->
xvec->backend_data);
s = bfd_get_section_by_name (hash_table->dynobj, ".dynamic");
BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2834); } while (0);

newsize = s->size + bed->s->sizeof_dyn;
newcontents = bfd_realloc (s->contents, newsize);
if (newcontents == NULL((void*)0))
  return FALSE0;

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 TRUE1;
2849}

2851/* 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.  */

2855static int
2856elf_add_dt_needed_tag (bfd *abfd,
       struct bfd_link_info *info,
       const char *soname,
       bfd_boolean do_it)
2860{
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)((struct elf_link_hash_table *) ((info)->hash));
oldsize = _bfd_elf_strtab_size (hash_table->dynstr);
strindex = _bfd_elf_strtab_add (hash_table->dynstr, soname, FALSE0);
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)((const struct elf_backend_data *) (hash_table->dynobj)->
xvec->backend_data);
    sdyn = bfd_get_section_by_name (hash_table->dynobj, ".dynamic");
    if (sdyn != NULL((void*)0))
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_NEEDED1
&& 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_NEEDED1, strindex))
return -1;
  }
else
  /* We were just checking for existence of the tag.  */
  _bfd_elf_strtab_delref (hash_table->dynstr, strindex);

return 0;
2912}

2914/* Sort symbol by value and section.  */
2915static int
2916elf_sort_symbol (const void *arg1, const void *arg2)
2917{
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
  {
    long sdiff = h1->root.u.def.section->id - h2->root.u.def.section->id;
    if (sdiff != 0)
return sdiff > 0 ? 1 : -1;
  }
return 0;
2934}

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

2939static bfd_boolean
2940elf_adjust_dynstr_offsets (struct elf_link_hash_entry *h, void *data)
2941{
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 TRUE1;
2950}

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

2955static bfd_boolean
2956elf_finalize_dynstr (bfd *output_bfd, struct bfd_link_info *info)
2957{
struct elf_link_hash_table *hash_table = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash));
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)((const struct elf_backend_data *) (dynobj)->xvec->backend_data
);
sdyn = bfd_get_section_by_name (dynobj, ".dynamic");
BFD_ASSERT (sdyn != NULL)do { if (!(sdyn != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,2972); } while (0);

/* 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_STRSZ10:
 dyn.d_un.d_val = size;
 break;
case DT_NEEDED1:
case DT_SONAME14:
case DT_RPATH15:
case DT_RUNPATH29:
case DT_FILTER0x7fffffff:
case DT_AUXILIARY0x7ffffffd:
 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)(bfd_link_hash_traverse (&(hash_table)->root, (bfd_boolean
 (*) (struct bfd_link_hash_entry *, void *)) (elf_adjust_dynstr_offsets
), (dynstr)));

/* Adjust version definitions.  */
if (elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->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)((output_bfd) -> tdata.elf_obj_data)->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 TRUE1;
3076}
3077
3078/* Add symbols from an ELF object file to the linker hash table.  */

3080static bfd_boolean
3081elf_link_add_object_symbols (bfd *abfd, struct bfd_link_info *info)
3082{
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((void*)0);
Elf_External_Versym *ever;
struct elf_link_hash_entry *weaks;
struct elf_link_hash_entry **nondeflt_vers = NULL((void*)0);
bfd_size_type nondeflt_vers_cnt = 0;
Elf_Internal_Sym *isymbuf = NULL((void*)0);
Elf_Internal_Sym *isym;
Elf_Internal_Sym *isymend;
const struct elf_backend_data *bed;
bfd_boolean add_needed;
struct elf_link_hash_table *htab;
bfd_size_type amt;
void *alloc_mark = NULL((void*)0);
void *old_tab = NULL((void*)0);
void *old_hash;
void *old_ent;
struct bfd_link_hash_entry *old_undefs = NULL((void*)0);
struct bfd_link_hash_entry *old_undefs_tail = NULL((void*)0);
long old_dynsymcount = 0;
size_t tabsize = 0;
size_t hashsize = 0;

htab = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash));
bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

if ((abfd->flags & DYNAMIC0x40) == 0)
  dynamic = FALSE0;
else
  {
    dynamic = TRUE1;

    /* 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 (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
)
 || htab->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((void*)0); s = s->next)
{
 const char *name;

 name = bfd_get_section_name (abfd, s)((s)->name + 0);
 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 (htab, name, FALSE, FALSE, TRUE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&(htab
)->root, (name), (0), (0), (1)));

  /* FIXME: What about bfd_link_hash_common?  */
  if (h != NULL((void*)0)
      && (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((void*)0))
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_WARNING0x1000, s, 0, msg,
      FALSE0, bed->collect, NULL((void*)0))))
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_EXCLUDE0x8000;
}
   }
}
  }

add_needed = TRUE1;
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 (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
)
 && htab->root.creator == abfd->xvec
 && !htab->dynamic_sections_created)
{
 if (! _bfd_elf_link_create_dynamic_sections (abfd, info))
   goto error_return;
}
  }
else if (!is_elf_hash_table (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
))
  goto error_return;
else
  {
    asection *s;
    const char *soname = NULL((void*)0);
    struct bfd_link_needed_list *rpath = NULL((void*)0), *runpath = NULL((void*)0);
    int ret;

    /* ld --just-symbols and dynamic objects don't mix very well.
ld shouldn't allow it.  */
    if ((s = abfd->sections) != NULL((void*)0)
 && s->sec_info_type == ELF_INFO_TYPE_JUST_SYMS4)
abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 3242, __PRETTY_FUNCTION__);

    /* 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)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class)
    & (DYN_AS_NEEDED | DYN_DT_NEEDED
       | DYN_NO_NEEDED)) == 0;

    s = bfd_get_section_by_name (abfd, ".dynamic");
    if (s != NULL((void*)0))
{
 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)(((abfd) -> tdata.elf_obj_data) -> elf_sect_ptr)[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_SONAME14)
{
  unsigned int tagv = dyn.d_un.d_val;
  soname = bfd_elf_string_from_elf_section (abfd, shlink, tagv);
  if (soname == NULL((void*)0))
    goto error_free_dyn;
}
     if (dyn.d_tag == DT_NEEDED1)
{
  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((void*)0) || fnm == NULL((void*)0))
    goto error_free_dyn;
  amt = strlen (fnm) + 1;
  anm = bfd_alloc (abfd, amt);
  if (anm == NULL((void*)0))
    goto error_free_dyn;
  memcpy (anm, fnm, amt);
  n->name = anm;
  n->by = abfd;
  n->next = NULL((void*)0);
  for (pn = &htab->needed; *pn != NULL((void*)0); pn = &(*pn)->next)
    ;
  *pn = n;
}
     if (dyn.d_tag == DT_RUNPATH29)
{
  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((void*)0) || fnm == NULL((void*)0))
    goto error_free_dyn;
  amt = strlen (fnm) + 1;
  anm = bfd_alloc (abfd, amt);
  if (anm == NULL((void*)0))
    goto error_free_dyn;
  memcpy (anm, fnm, amt);
  n->name = anm;
  n->by = abfd;
  n->next = NULL((void*)0);
  for (pn = & runpath;
       *pn != NULL((void*)0);
       pn = &(*pn)->next)
    ;
  *pn = n;
}
     /* Ignore DT_RPATH if we have seen DT_RUNPATH.  */
     if (!runpath && dyn.d_tag == DT_RPATH15)
{
  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((void*)0) || fnm == NULL((void*)0))
    goto error_free_dyn;
  amt = strlen (fnm) + 1;
  anm = bfd_alloc (abfd, amt);
  if (anm == NULL((void*)0))
    {
    error_free_dyn:
      free (dynbuf);
      goto error_return;
    }
  memcpy (anm, fnm, amt);
  n->name = anm;
  n->by = abfd;
  n->next = NULL((void*)0);
  for (pn = & rpath;
       *pn != NULL((void*)0);
       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 = &htab->runpath; *pn != NULL((void*)0); 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((void*)0) || *soname == '\0')
{
 soname = elf_dt_name (abfd)(((abfd) -> tdata.elf_obj_data) -> dt_name);
 if (soname == NULL((void*)0) || *soname == '\0')
   soname = bfd_get_filename (abfd)((char *) (abfd)->filename);
}

    /* Save the SONAME because sometimes the linker emulation code
will need to know it.  */
    elf_dt_name (abfd)(((abfd) -> tdata.elf_obj_data) -> dt_name) = 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 TRUE1;
  }

/* 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)(((abfd) -> tdata.elf_obj_data) -> dynsymtab_section) == 0)
  hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_hdr;
else
  hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->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)(((abfd) -> tdata.elf_obj_data) -> bad_symtab))
  {
    extsymcount = symcount;
    extsymoff = 0;
  }
else
  {
    extsymcount = symcount - hdr->sh_info;
    extsymoff = hdr->sh_info;
  }

sym_hash = NULL((void*)0);
if (extsymcount != 0)
  {
    isymbuf = bfd_elf_get_elf_syms (abfd, hdr, extsymcount, extsymoff,
		      NULL((void*)0), NULL((void*)0), NULL((void*)0));
    if (isymbuf == NULL((void*)0))
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((void*)0))
goto error_free_sym;
    elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes) = 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)(((abfd) -> tdata.elf_obj_data) -> dynversym_section) != 0)
{
 Elf_Internal_Shdr *versymhdr;

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

/* If we are loading an as-needed shared lib, save the symbol table
   state before we start adding symbols.  If the lib turns out
   to be unneeded, restore the state.  */
if ((elf_dyn_lib_class (abfd)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class) & DYN_AS_NEEDED) != 0)
  {
    unsigned int i;
    size_t entsize;

    for (entsize = 0, i = 0; i < htab->root.table.size; i++)
{
 struct bfd_hash_entry *p;
 struct elf_link_hash_entry *h;

 for (p = htab->root.table.table[i]; p != NULL((void*)0); p = p->next)
   {
     h = (struct elf_link_hash_entry *) p;
     entsize += htab->root.table.entsize;
     if (h->root.type == bfd_link_hash_warning)
entsize += htab->root.table.entsize;
   }
}

    tabsize = htab->root.table.size * sizeof (struct bfd_hash_entry *);
    hashsize = extsymcount * sizeof (struct elf_link_hash_entry *);
    old_tab = bfd_malloc (tabsize + entsize + hashsize);
    if (old_tab == NULL((void*)0))
goto error_free_vers;

    /* Remember the current objalloc pointer, so that all mem for
symbols added can later be reclaimed.  */
    alloc_mark = bfd_hash_allocate (&htab->root.table, 1);
    if (alloc_mark == NULL((void*)0))
goto error_free_vers;

    /* Clone the symbol table and sym hashes.  Remember some
pointers into the symbol table, and dynamic symbol count.  */
    old_hash = (char *) old_tab + tabsize;
    old_ent = (char *) old_hash + hashsize;
    memcpy (old_tab, htab->root.table.table, tabsize);
    memcpy (old_hash, sym_hash, hashsize);
    old_undefs = htab->root.undefs;
    old_undefs_tail = htab->root.undefs_tail;
    old_dynsymcount = htab->dynsymcount;

    for (i = 0; i < htab->root.table.size; i++)
{
 struct bfd_hash_entry *p;
 struct elf_link_hash_entry *h;

 for (p = htab->root.table.table[i]; p != NULL((void*)0); p = p->next)
   {
     memcpy (old_ent, p, htab->root.table.entsize);
     old_ent = (char *) old_ent + htab->root.table.entsize;
     h = (struct elf_link_hash_entry *) p;
     if (h->root.type == bfd_link_hash_warning)
{
  memcpy (old_ent, h->root.u.i.link, htab->root.table.entsize);
  old_ent = (char *) old_ent + htab->root.table.entsize;
}
   }
}
  }

weaks = NULL((void*)0);
ever = extversym != NULL((void*)0) ? extversym + extsymoff : NULL((void*)0);
for (isym = isymbuf, isymend = isymbuf + extsymcount;
     isym < isymend;
     isym++, sym_hash++, ever = (ever != NULL((void*)0) ? ever + 1 : NULL((void*)0)))
  {
    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;
    bfd_boolean common;
    unsigned int old_alignment;
    bfd *old_bfd;

    override = FALSE0;

    flags = BSF_NO_FLAGS0x00;
    sec = NULL((void*)0);
    value = isym->st_value;
    *sym_hash = NULL((void*)0);
    common = bed->common_definition (isym);

    bind = ELF_ST_BIND (isym->st_info)(((unsigned int)(isym->st_info)) >> 4);
    if (bind == STB_LOCAL0)
{
 /* 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_GLOBAL1)
{
 if (isym->st_shndx != SHN_UNDEF0 && !common)
   flags = BSF_GLOBAL0x02;
}
    else if (bind == STB_WEAK2)
flags = BSF_WEAK0x80;
    else
{
 /* Leave it up to the processor backend.  */
}

    if (isym->st_shndx == SHN_UNDEF0)
sec = bfd_und_section_ptr((asection *) &bfd_und_section);
    else if (isym->st_shndx < SHN_LORESERVE0xFF00
      || isym->st_shndx > SHN_HIRESERVE0xFFFF)
{
 sec = bfd_section_from_elf_index (abfd, isym->st_shndx);
 if (sec == NULL((void*)0))
   sec = bfd_abs_section_ptr((asection *) &bfd_abs_section);
 else if (sec->kept_section)
   {
     /* Symbols from discarded section are undefined.  We keep
 its visibility.  */
     sec = bfd_und_section_ptr((asection *) &bfd_und_section);
     isym->st_shndx = SHN_UNDEF0;
   }
 else if ((abfd->flags & (EXEC_P0x02 | DYNAMIC0x40)) != 0)
   value -= sec->vma;
}
    else if (isym->st_shndx == SHN_ABS0xFFF1)
sec = bfd_abs_section_ptr((asection *) &bfd_abs_section);
    else if (isym->st_shndx == SHN_COMMON0xFFF2)
{
 sec = bfd_com_section_ptr((asection *) &bfd_com_section);
 /* What ELF calls the size we call the value.  What ELF
    calls the value we call the alignment.  */
 value = isym->st_size;
}
    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((void*)0))
goto error_free_vers;

    if (isym->st_shndx == SHN_COMMON0xFFF2
 && ELF_ST_TYPE (isym->st_info)((isym->st_info) & 0xF) == STT_TLS6)
{
 asection *tcomm = bfd_get_section_by_name (abfd, ".tcommon");

 if (tcomm == NULL((void*)0))
   {
     tcomm = bfd_make_section_with_flags (abfd, ".tcommon",
				   (SEC_ALLOC0x001
				    | SEC_IS_COMMON0x1000
				    | SEC_LINKER_CREATED0x200000
				    | SEC_THREAD_LOCAL0x400));
     if (tcomm == NULL((void*)0))
goto error_free_vers;
   }
 sec = tcomm;
}
    else if (bed->elf_add_symbol_hook)
{
 if (! (*bed->elf_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((void*)0))
   continue;
}

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

    if (bfd_is_und_section (sec)((sec) == ((asection *) &bfd_und_section))
 || bfd_is_com_section (sec)(((sec)->flags & 0x1000) != 0))
definition = FALSE0;
    else
definition = TRUE1;

    size_change_ok = FALSE0;
    type_change_ok = bed->type_change_ok;
    old_alignment = 0;
    old_bfd = NULL((void*)0);
    new_sec = sec;

    if (is_elf_hash_table (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
))
{
 Elf_Internal_Versym iver;
 unsigned int vernum = 0;
 bfd_boolean skip;

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

 vernum = iver.vs_vers & VERSYM_VERSION0x7fff;

 /* 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
    if it is not a function, because it might be the version
    symbol itself.  FIXME: What if it isn't?  */
 if ((iver.vs_vers & VERSYM_HIDDEN0x8000) != 0
     || (vernum > 1 && (! bfd_is_abs_section (sec)((sec) == ((asection *) &bfd_abs_section))
		 || ELF_ST_TYPE (isym->st_info)((isym->st_info) & 0xF) == STT_FUNC2)))
   {
     const char *verstr;
     size_t namelen, verlen, newlen;
     char *newname, *p;

     if (isym->st_shndx != SHN_UNDEF0)
{
  if (vernum > elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->cverdefs)
    verstr = NULL((void*)0);
  else if (vernum > 1)
    verstr =
      elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->verdef[vernum - 1].vd_nodename;
  else
    verstr = "";

  if (verstr == NULL((void*)0))
    {
      (*_bfd_error_handler)
	(_("%B: %s: invalid version %u (max %d)")("%B: %s: invalid version %u (max %d)"),
	 abfd, name, vernum,
	 elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->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((void*)0);
  for (t = elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->verref;
       t != NULL((void*)0);
       t = t->vn_nextref)
    {
      Elf_Internal_Vernaux *a;

      for (a = t->vn_auxptr; a != NULL((void*)0); a = a->vna_nextptr)
	{
	  if (a->vna_other == vernum)
	    {
	      verstr = a->vna_nodename;
	      break;
	    }
	}
      if (a != NULL((void*)0))
	break;
    }
  if (verstr == NULL((void*)0))
    {
      (*_bfd_error_handler)
	(_("%B: %s: invalid needed version %d")("%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_HIDDEN0x8000) == 0
  && isym->st_shndx != SHN_UNDEF0)
++newlen;

     newname = bfd_hash_allocate (&htab->root.table, newlen);
     if (newname == NULL((void*)0))
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_HIDDEN0x8000) == 0
  && isym->st_shndx != SHN_UNDEF0)
*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 = FALSE0;

 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:
     old_bfd = h->root.u.def.section->owner;
     break;

   case bfd_link_hash_common:
     old_bfd = h->root.u.c.p->section->owner;
     old_alignment = h->root.u.c.p->alignment_power;
     break;
   }

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

    if (! (_bfd_generic_link_add_one_symbol
    (info, abfd, name, flags, sec, value, NULL((void*)0), FALSE0, bed->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 = FALSE0;
    if (dynamic
 && definition
 && (flags & BSF_WEAK0x80) != 0
 && ELF_ST_TYPE (isym->st_info)((isym->st_info) & 0xF) != STT_FUNC2
 && is_elf_hash_table (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
)
 && h->u.weakdef == NULL((void*)0))
{
 /* 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 = TRUE1;
}

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

 if (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 (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_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 || 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((void*)0)
  && (h->root.u.def.section->owner->flags & DYNAMIC0x40) == 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"("Warning: alignment %u of symbol `%s' in %B" " is smaller than %u in %B"
)
     " is smaller than %u in %B")("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))
   {
     if (h->size != 0 && h->size != isym->st_size && ! size_change_ok)
(*_bfd_error_handler)
  (_("Warning: size of symbol `%s' changed"("Warning: size of symbol `%s' changed" " from %lu in %B to %lu in %B"
)
     " from %lu in %B to %lu in %B")("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);

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

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

 /* 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)((isym->st_other) & 0x3) != STV_INTERNAL1)
   isym->st_other = (STV_HIDDEN2
	      | (isym->st_other & ~ELF_ST_VISIBILITY (-1)((-1) & 0x3)));

 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)((-1) & 0x3);

     /* Combine visibilities, using the most constraining one.  */
     hvis   = ELF_ST_VISIBILITY (h->other)((h->other) & 0x3);
     symvis = ELF_ST_VISIBILITY (isym->st_other)((isym->st_other) & 0x3);
     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 = FALSE0;
 if (! dynamic)
   {
     if (! definition)
{
  h->ref_regular = 1;
  if (bind != STB_WEAK2)
    h->ref_regular_nonweak = 1;
}
     else
h->def_regular = 1;
     if (! info->executable
  || h->def_dynamic
  || h->ref_dynamic)
dynsym = TRUE1;
   }
 else
   {
     if (! definition)
h->ref_dynamic = 1;
     else
h->def_dynamic = 1;
     if (h->def_regular
  || h->ref_regular
  || (h->u.weakdef != NULL((void*)0)
      && ! new_weakdef
      && h->u.weakdef->dynindx != -1))
dynsym = TRUE1;
   }

 /* 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((void*)0) && 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((void*)0)
  && ! 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)((h->other) & 0x3))
     {
     case STV_INTERNAL1:
     case STV_HIDDEN2:
(*bed->elf_backend_hide_symbol) (info, h, TRUE1);
dynsym = FALSE0;
break;
     }

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

     /* 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)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class) & DYN_NO_NEEDED) != 0)
{
  (*_bfd_error_handler)
    (_("%s: invalid DSO for symbol `%s' definition")("%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)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class) &= ~DYN_AS_NEEDED;

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

     BFD_ASSERT (ret == 0)do { if (!(ret == 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,4136); } while (0);
   }
}
  }

if (extversym != NULL((void*)0))
  {
    free (extversym);
    extversym = NULL((void*)0);
  }

if (isymbuf != NULL((void*)0))
  {
    free (isymbuf);
    isymbuf = NULL((void*)0);
  }

if ((elf_dyn_lib_class (abfd)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class) & DYN_AS_NEEDED) != 0)
  {
    unsigned int i;

    /* Restore the symbol table.  */
    old_hash = (char *) old_tab + tabsize;
    old_ent = (char *) old_hash + hashsize;
    sym_hash = elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes);
    memcpy (htab->root.table.table, old_tab, tabsize);
    memcpy (sym_hash, old_hash, hashsize);
    htab->root.undefs = old_undefs;
    htab->root.undefs_tail = old_undefs_tail;
    for (i = 0; i < htab->root.table.size; i++)
{
 struct bfd_hash_entry *p;
 struct elf_link_hash_entry *h;

 for (p = htab->root.table.table[i]; p != NULL((void*)0); p = p->next)
   {
     h = (struct elf_link_hash_entry *) p;
     if (h->root.type == bfd_link_hash_warning)
h = (struct elf_link_hash_entry *) h->root.u.i.link;
     if (h->dynindx >= old_dynsymcount)
_bfd_elf_strtab_delref (htab->dynstr, h->dynstr_index);

     memcpy (p, old_ent, htab->root.table.entsize);
     old_ent = (char *) old_ent + htab->root.table.entsize;
     h = (struct elf_link_hash_entry *) p;
     if (h->root.type == bfd_link_hash_warning)
{
  memcpy (h->root.u.i.link, old_ent, htab->root.table.entsize);
  old_ent = (char *) old_ent + htab->root.table.entsize;
}
   }
}

    free (old_tab);
    objalloc_free_block ((struct objalloc *) htab->root.table.memory,
	   alloc_mark);
    if (nondeflt_vers != NULL((void*)0))
free (nondeflt_vers);
    return TRUE1;
  }

if (old_tab != NULL((void*)0))
  {
    free (old_tab);
    old_tab = NULL((void*)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((void*)0))
  {
    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((void*)0)
     || (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 (&htab->root, shortname,
		     FALSE0, FALSE0, FALSE0);
 if (hi != NULL((void*)0)
     && 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, TRUE1);
     hi->root.type = bfd_link_hash_indirect;
     hi->root.u.i.link = (struct bfd_link_hash_entry *) h;
     (*bed->elf_backend_copy_indirect_symbol) (info, h, hi);
     sym_hash = elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes);
     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((void*)0);
  }

/* 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((void*)0))
  {
    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((void*)0))
goto error_return;
    sym_hash = sorted_sym_hash;
    hpp = elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes);
    hppend = hpp + extsymcount;
    sym_count = 0;
    for (; hpp < hppend; hpp++)
{
 h = *hpp;
 if (h != NULL((void*)0)
     && h->root.type == bfd_link_hash_defined
     && h->type != STT_FUNC2)
   {
     *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((void*)0))
{
 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((void*)0);

 BFD_ASSERT (hlook->root.type == bfd_link_hash_defineddo { if (!(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
)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,4316); } while (0)
      || hlook->root.type == bfd_link_hash_defweakdo { if (!(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
)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,4316); } while (0)
      || hlook->root.type == bfd_link_hash_commondo { if (!(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
)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,4316); } while (0)
      || hlook->root.type == bfd_link_hash_indirect)do { if (!(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
)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,4316); } while (0);
 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
{
  long sdiff = slook->id - h->root.u.def.section->id;
  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);
  }

if (bed->check_directives)
  (*bed->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.  */
if (! dynamic
    && is_elf_hash_table (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
)
    && htab->root.creator == abfd->xvec
    && bed->check_relocs != NULL((void*)0))
  {
    asection *o;

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

 if ((o->flags & SEC_RELOC0x004) == 0
     || o->reloc_count == 0
     || ((info->strip == strip_all || info->strip == strip_debugger)
  && (o->flags & SEC_DEBUGGING0x2000) != 0)
     || bfd_is_abs_section (o->output_section)((o->output_section) == ((asection *) &bfd_abs_section
)))
   continue;

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

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

 if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->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 (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_hash_table
)
    && (info->strip != strip_all && info->strip != strip_debugger))
  {
    asection *stabstr;

    stabstr = bfd_get_section_by_name (abfd, ".stabstr");
    if (stabstr != NULL((void*)0))
{
 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])(_sch_istable[(stab->name[6]) & 0xff] & (unsigned short
)(_sch_isdigit))))
&& (stab->flags & SEC_MERGE0x1000000) == 0
&& !bfd_is_abs_section (stab->output_section)((stab->output_section) == ((asection *) &bfd_abs_section
)))
     {
struct bfd_elf_section_data *secdata;

secdata = elf_section_data (stab)((struct bfd_elf_section_data*)(stab)->used_by_bfd);
if (! _bfd_link_section_stabs (abfd, &htab->stab_info, stab,
			       stabstr, &secdata->sec_info,
			       &string_offset))
  goto error_return;
if (secdata->sec_info)
  stab->sec_info_type = ELF_INFO_TYPE_STABS1;
   }
}
  }

if (is_elf_hash_table (htab)(((struct bfd_link_hash_table *) (htab))->type == bfd_link_elf_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((void*)0))
goto error_return;
    n->abfd = abfd;
    n->next = htab->loaded;
    htab->loaded = n;
  }

return TRUE1;

error_free_vers:
if (old_tab != NULL((void*)0))
  free (old_tab);
if (nondeflt_vers != NULL((void*)0))
  free (nondeflt_vers);
if (extversym != NULL((void*)0))
  free (extversym);
error_free_sym:
if (isymbuf != NULL((void*)0))
  free (isymbuf);
error_return:
return FALSE0;
4507}

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

4512struct elf_link_hash_entry *
4513_bfd_elf_archive_symbol_lookup (bfd *abfd,
		struct bfd_link_info *info,
		const char *name)
4516{
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)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (0), (0), (0)));
if (h != NULL((void*)0))
  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((void*)0) || p[1] != ELF_VER_CHR'@')
  return h;

/* First check with only one `@'.  */
len = strlen (name);
copy = bfd_alloc (abfd, len);
if (copy == NULL((void*)0))
  return (struct elf_link_hash_entry *) -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)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
copy), (0), (0), (0)));
if (h == NULL((void*)0))
  {
    /* 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,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
copy), (0), (0), (0)))
		FALSE, FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
copy), (0), (0), (0)));
  }

bfd_release (abfd, copy);
return h;
4556}

4558/* 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.  */

4583static bfd_boolean
4584elf_link_add_archive_symbols (bfd *abfd, struct bfd_link_info *info)
4585{
symindex c;
bfd_boolean *defined = NULL((void*)0);
bfd_boolean *included = NULL((void*)0);
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)((abfd)->has_armap))
  {
    /* An empty archive is a special case.  */
    if (bfd_openr_next_archived_file (abfd, NULL((void*)0)) == NULL((void*)0))
return TRUE1;
    bfd_set_error (bfd_error_no_armap);
    return FALSE0;
  }

/* 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)((abfd)->tdata.aout_ar_data)->symdef_count;
if (c == 0)
  return TRUE1;
amt = c;
amt *= sizeof (bfd_boolean);
defined = bfd_zmalloc (amt);
included = bfd_zmalloc (amt);
if (defined == NULL((void*)0) || included == NULL((void*)0))
  goto error_return;

symdefs = bfd_ardata (abfd)((abfd)->tdata.aout_ar_data)->symdefs;
bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
archive_symbol_lookup = bed->elf_backend_archive_symbol_lookup;

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

    loop = FALSE0;
    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] = TRUE1;
     continue;
   }

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

 if (h == NULL((void*)0))
   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] = TRUE1;
     continue;
   }

 /* We need to include this archive member.  */
 element = _bfd_get_elt_at_filepos (abfd, symdef->file_offset);
 if (element == NULL((void*)0))
   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)
   {
     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)((*((element)->xvec->_bfd_link_add_symbols)) (element, info
)))
   goto error_return;

 /* 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 = TRUE1;

 /* Look backward to mark all symbols from this object file
    which we have already seen in this pass.  */
 mark = i;
 do
   {
     included[mark] = TRUE1;
     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 TRUE1;

error_return:
if (defined != NULL((void*)0))
  free (defined);
if (included != NULL((void*)0))
  free (included);
return FALSE0;
4746}

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

4751bfd_boolean
4752bfd_elf_link_add_symbols (bfd *abfd, struct bfd_link_info *info)
4753{
switch (bfd_get_format (abfd)((abfd)->format))
  {
  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 FALSE0;
  }
4764}
4765
4766/* This function will be called though elf_link_hash_traverse to store
 all hash value of the exported symbols in an array.  */

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

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 TRUE1;

name = h->root.root.string;
p = strchr (name, ELF_VER_CHR'@');
if (p != NULL((void*)0))
  {
    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((void*)0))
  free (alc);

return TRUE1;
4809}

4811struct collect_gnu_hash_codes
4812{
bfd *output_bfd;
const struct elf_backend_data *bed;
unsigned long int nsyms;
unsigned long int maskbits;
unsigned long int *hashcodes;
unsigned long int *hashval;
unsigned long int *indx;
unsigned long int *counts;
bfd_vma *bitmask;
bfd_byte *contents;
long int min_dynindx;
unsigned long int bucketcount;
unsigned long int symindx;
long int local_indx;
long int shift1, shift2;
unsigned long int mask;
4829};

4831/* This function will be called though elf_link_hash_traverse to store
 all hash value of the exported symbols in an array.  */

4834static bfd_boolean
4835elf_collect_gnu_hash_codes (struct elf_link_hash_entry *h, void *data)
4836{
struct collect_gnu_hash_codes *s = data;
const char *name;
char *p;
unsigned long ha;
char *alc = NULL((void*)0);

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 TRUE1;

/* Ignore also local symbols and undefined symbols.  */
if (! (*s->bed->elf_hash_symbol) (h))
  return TRUE1;

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

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

/* Store the found hash value in the array for compute_bucket_count,
   and also for .dynsym reordering purposes.  */
s->hashcodes[s->nsyms] = ha;
s->hashval[h->dynindx] = ha;
++s->nsyms;
if (s->min_dynindx < 0 || s->min_dynindx > h->dynindx)
  s->min_dynindx = h->dynindx;

if (alc != NULL((void*)0))
  free (alc);

return TRUE1;
4879}

4881/* This function will be called though elf_link_hash_traverse to do
 final dynaminc symbol renumbering.  */

4884static bfd_boolean
4885elf_renumber_gnu_hash_syms (struct elf_link_hash_entry *h, void *data)
4886{
struct collect_gnu_hash_codes *s = data;
unsigned long int bucket;
unsigned long int val;

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

/* Ignore indirect symbols.  */
if (h->dynindx == -1)
  return TRUE1;

/* Ignore also local symbols and undefined symbols.  */
if (! (*s->bed->elf_hash_symbol) (h))
  {
    if (h->dynindx >= s->min_dynindx)
h->dynindx = s->local_indx++;
    return TRUE1;
  }

bucket = s->hashval[h->dynindx] % s->bucketcount;
val = (s->hashval[h->dynindx] >> s->shift1)
& ((s->maskbits >> s->shift1) - 1);
s->bitmask[val] |= ((bfd_vma) 1) << (s->hashval[h->dynindx] & s->mask);
s->bitmask[val]
  |= ((bfd_vma) 1) << ((s->hashval[h->dynindx] >> s->shift2) & s->mask);
val = s->hashval[h->dynindx] & ~(unsigned long int) 1;
if (s->counts[bucket] == 1)
  /* Last element terminates the chain.  */
  val |= 1;
bfd_put_32 (s->output_bfd, val,((*((s->output_bfd)->xvec->bfd_putx32)) ((val),(s->
contents + (s->indx[bucket] - s->symindx) * 4)))
     s->contents + (s->indx[bucket] - s->symindx) * 4)((*((s->output_bfd)->xvec->bfd_putx32)) ((val),(s->
contents + (s->indx[bucket] - s->symindx) * 4)));
--s->counts[bucket];
h->dynindx = s->indx[bucket]++;
return TRUE1;
4921}

4923/* Return TRUE if symbol should be hashed in the `.gnu.hash' section.  */

4925bfd_boolean
4926_bfd_elf_hash_symbol (struct elf_link_hash_entry *h)
4927{
return !(h->forced_local
  || h->root.type == bfd_link_hash_undefined
  || h->root.type == bfd_link_hash_undefweak
  || ((h->root.type == bfd_link_hash_defined
|| h->root.type == bfd_link_hash_defweak)
      && h->root.u.def.section->output_section == NULL((void*)0)));
4934}

4936/* 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.  */

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

4948/* 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.  */
4956static size_t
4957compute_bucket_count (struct bfd_link_info *info, unsigned long int *hashcodes,
      unsigned long int nsyms, int gnu_hash)
4959{
size_t dynsymcount = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynsymcount;
size_t best_size = 0;
unsigned long int i;
bfd_size_type amt;

/* 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.  */
4968#ifdef BFD_HOST_U_64_BITunsigned long
if (info->optimize)
  {
    size_t minsize;
    size_t maxsize;
    BFD_HOST_U_64_BITunsigned long best_chlen = ~((BFD_HOST_U_64_BITunsigned long) 0);
    bfd *dynobj = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynobj;
    const struct elf_backend_data *bed = get_elf_backend_data (dynobj)((const struct elf_backend_data *) (dynobj)->xvec->backend_data
);
    unsigned long int *counts;

    /* 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;
    if (gnu_hash)
{
 if (minsize < 2)
   minsize = 2;
 if ((best_size & 31) == 0)
   ++best_size;
}

    /* 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((void*)0))
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_BITunsigned long max;
 unsigned long int j;
 unsigned long int fact;

 if (gnu_hash && (i & 31) == 0)
   continue;

 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.  */
5025# ifndef BFD_TARGET_PAGESIZE(4096)
5026#  define BFD_TARGET_PAGESIZE(4096)	(4096)
5027# endif

 /* We in any case need 2 + DYNSYMCOUNT entries for the size values
    and the chains.  */
 max = (2 + dynsymcount) * bed->s->sizeof_hash_entry;

5033# 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(4096) / bed->s->sizeof_hash_entry) + 1;
 max *= fact * fact;
5043# 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(4096) / bed->s->sizeof_hash_entry) + 1;
 max *= fact;
5054# endif

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

    free (counts);
  }
else
5067#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 (nsyms < elf_buckets[i + 1])
   break;
}
    if (gnu_hash && best_size < 2)
best_size = 2;
  }

return best_size;
5083}

5085/* 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.  */

5090bfd_boolean
5091bfd_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)
5099{
bfd_size_type soname_indx;
bfd *dynobj;
const struct elf_backend_data *bed;
struct elf_assign_sym_version_info asvinfo;

*sinterpptr = NULL((void*)0);

soname_indx = (bfd_size_type) -1;

if (!is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
1
Assuming field 'type' is equal to bfd_link_elf_hash_table→
2
←
Taking false branch→
  return TRUE1;

elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->relro = info->relro;
elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->wxneeded = info->wxneeded;
elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->executable = info->executable;
if (info->execstack)
3
←
Assuming field 'execstack' is not equal to 0→
4
←
Taking true branch→
  elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->stack_flags = PF_R(1 << 2) | PF_W(1 << 1) | PF_X(1 << 0);
else if (info->noexecstack)
  elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->stack_flags = PF_R(1 << 2) | PF_W(1 << 1);
else
  {
    bfd *inputobj;
    asection *notesec = NULL((void*)0);
    int exec = 0;

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

 if (inputobj->flags & (DYNAMIC0x40 | BFD_LINKER_CREATED0x2000))
   continue;
 s = bfd_get_section_by_name (inputobj, ".note.GNU-stack");
 if (s)
   {
     if (s->flags & SEC_CODE0x010)
exec = PF_X(1 << 0);
     notesec = s;
   }
 else
   exec = PF_X(1 << 0);
}
    if (notesec)
{
 elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->stack_flags = PF_R(1 << 2) | PF_W(1 << 1) | exec;
 if (exec && info->relocatable
     && notesec->output_section != bfd_abs_section_ptr((asection *) &bfd_abs_section))
   notesec->output_section->flags |= SEC_CODE0x010;
}
  }

/* Any syms created from now on start with -1 in
   got.refcount/offset and plt.refcount/offset.  */
elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->init_got_refcount
  = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->init_got_offset;
elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->init_plt_refcount
  = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->init_plt_offset;

/* The backend may have to create some sections regardless of whether
   we're dynamic or not.  */
bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
if (bed->elf_backend_always_size_sections
5
←
Assuming field 'elf_backend_always_size_sections' is null→
    && ! (*bed->elf_backend_always_size_sections) (output_bfd, info))
  return FALSE0;

dynobj = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynobj;

/* If there were no dynamic objects in the link, there is nothing to
   do here.  */
if (dynobj == NULL((void*)0))
6
←
Assuming 'dynobj' is not equal to NULL→
7
←
Taking false branch→
  return TRUE1;

if (! _bfd_elf_maybe_strip_eh_frame_hdr (info))
8
←
Assuming the condition is false→
9
←
Taking false branch→
  return FALSE0;

if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created)
10
←
Assuming field 'dynamic_sections_created' is 0→
11
←
Taking false branch→
  {
    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;
    asection *s;
    bfd_boolean all_defined;

    *sinterpptr = bfd_get_section_by_name (dynobj, ".interp");

    if (soname != NULL((void*)0))
{
 soname_indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
			     soname, TRUE1);
 if (soname_indx == (bfd_size_type) -1
     || !_bfd_elf_add_dynamic_entry (info, DT_SONAME14, soname_indx))
   return FALSE0;
}

    if (info->symbolic)
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_SYMBOLIC16, 0))
   return FALSE0;
 info->flags |= DF_SYMBOLIC(1 << 1);
}

    if (rpath != NULL((void*)0))
{
 bfd_size_type indx;

 indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr, rpath,
		      TRUE1);
 if (indx == (bfd_size_type) -1
     || !_bfd_elf_add_dynamic_entry (info, DT_RPATH15, indx))
   return FALSE0;

 if  (info->new_dtags)
   {
     _bfd_elf_strtab_addref (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr, indx);
     if (!_bfd_elf_add_dynamic_entry (info, DT_RUNPATH29, indx))
return FALSE0;
   }
}

    if (filter_shlib != NULL((void*)0))
{
 bfd_size_type indx;

 indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
		      filter_shlib, TRUE1);
 if (indx == (bfd_size_type) -1
     || !_bfd_elf_add_dynamic_entry (info, DT_FILTER0x7fffffff, indx))
   return FALSE0;
}

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

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

     indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
			  *p, TRUE1);
     if (indx == (bfd_size_type) -1
  || !_bfd_elf_add_dynamic_entry (info, DT_AUXILIARY0x7ffffffd, indx))
return FALSE0;
   }
}

    eif.info = info;
    eif.verdefs = verdefs;
    eif.failed = FALSE0;

    /* 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_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_export_symbol), (&eif)))
		  _bfd_elf_export_symbol,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_export_symbol), (&eif)))
		  &eif)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_export_symbol), (&eif)));
 if (eif.failed)
   return FALSE0;
}

    /* Make all global versions with definition.  */
    for (t = verdefs; t != NULL((void*)0); t = t->next)
for (d = t->globals.list; d != NULL((void*)0); 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((void*)0))
return FALSE0;
     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),((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)))
			   newname, FALSE, FALSE,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)))
			   FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)));
     if (newh == NULL((void*)0)
  || (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),((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)))
			       newname, FALSE, FALSE,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)))
			       FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
newname), (0), (0), (0)));
}
     free (newname);

     /* Mark this version if there is a definition and it is
 not defined in a shared object.  */
     if (newh != NULL((void*)0)
  && !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 = FALSE0;

    elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_assign_sym_version), (&asvinfo
)))
	      _bfd_elf_link_assign_sym_version,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_assign_sym_version), (&asvinfo
)))
	      &asvinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_assign_sym_version), (&asvinfo
)));
    if (asvinfo.failed)
return FALSE0;

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

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

    /* 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_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_adjust_dynamic_symbol), (&eif)))
	      _bfd_elf_adjust_dynamic_symbol,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_adjust_dynamic_symbol), (&eif)))
	      &eif)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_adjust_dynamic_symbol), (&eif)));
    if (eif.failed)
return FALSE0;

    /* 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),((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->init_function), (0), (0), (0)))
		   info->init_function, FALSE,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->init_function), (0), (0), (0)))
		   FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->init_function), (0), (0), (0)))
  : NULL((void*)0));
    if (h != NULL((void*)0)
 && (h->ref_regular
     || h->def_regular))
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_INIT12, 0))
   return FALSE0;
}
    h = (info->fini_function
  ? elf_link_hash_lookup (elf_hash_table (info),((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->fini_function), (0), (0), (0)))
		   info->fini_function, FALSE,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->fini_function), (0), (0), (0)))
		   FALSE, FALSE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
info->fini_function), (0), (0), (0)))
  : NULL((void*)0));
    if (h != NULL((void*)0)
 && (h->ref_regular
     || h->def_regular))
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_FINI13, 0))
   return FALSE0;
}

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

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

     bfd_set_error (bfd_error_nonrepresentable_section);
     return FALSE0;
   }

 if (!_bfd_elf_add_dynamic_entry (info, DT_PREINIT_ARRAY32, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_PREINIT_ARRAYSZ33, 0))
   return FALSE0;
}
    s = bfd_get_section_by_name (output_bfd, ".init_array");
    if (s != NULL((void*)0) && s->linker_has_input)
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_INIT_ARRAY25, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_INIT_ARRAYSZ27, 0))
   return FALSE0;
}
    s = bfd_get_section_by_name (output_bfd, ".fini_array");
    if (s != NULL((void*)0) && s->linker_has_input)
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_FINI_ARRAY26, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_FINI_ARRAYSZ28, 0))
   return FALSE0;
}

    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((void*)0) && dynstr->output_section != bfd_abs_section_ptr((asection *) &bfd_abs_section))
{
 bfd_size_type strsize;

 strsize = _bfd_elf_strtab_size (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr);
 if ((info->emit_hash
      && !_bfd_elf_add_dynamic_entry (info, DT_HASH4, 0))
     || (info->emit_gnu_hash
  && !_bfd_elf_add_dynamic_entry (info, DT_GNU_HASH0x6ffffef5, 0))
     || !_bfd_elf_add_dynamic_entry (info, DT_STRTAB5, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_SYMTAB6, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_STRSZ10, strsize)
     || !_bfd_elf_add_dynamic_entry (info, DT_SYMENT11,
			      bed->s->sizeof_sym))
   return FALSE0;
}
  }

/* The backend must work out the sizes of all the other dynamic
   sections.  */
if (bed->elf_backend_size_dynamic_sections
12
←
Assuming field 'elf_backend_size_dynamic_sections' is non-null→
14
←
Taking false branch→
    && ! (*bed->elf_backend_size_dynamic_sections) (output_bfd, info))
13
←
Assuming the condition is false→
  return FALSE0;

if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created)
15
←
Assuming field 'dynamic_sections_created' is not equal to 0→
16
←
Taking true branch→
  {
    unsigned long section_sym_count;
    asection *s;

    /* Set up the version definition section.  */
    s = bfd_get_section_by_name (dynobj, ".gnu.version_d");
    BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5466); } while (0);
17
←
Assuming 's' is not equal to null→
18
←
Taking false branch→
19
←
Loop condition is false.  Exiting loop→

    /* We may have created additional version definitions if we are
just linking a regular application.  */
    verdefs = asvinfo.verdefs;
20
←
Assigned value is garbage or undefined

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

    if (verdefs == NULL((void*)0) && !info->create_default_symver)
s->flags |= SEC_EXCLUDE0x8000;
    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((void*)0); 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((void*)0); n = n->next)
size += sizeof (Elf_External_Verdaux);
   }

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

 /* Fill in the version definition section.  */

 p = s->contents;

 def.vd_version = VER_DEF_CURRENT1;
 def.vd_flags = VER_FLG_BASE0x1;
 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)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
		      soname_indx);
     def.vd_hash = bfd_elf_hash (soname);
     defaux.vda_name = soname_indx;
     name = soname;
   }
 else
   {
     bfd_size_type indx;

     name = lbasename (output_bfd->filename);
     def.vd_hash = bfd_elf_hash (name);
     indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
			  name, FALSE0);
     if (indx == (bfd_size_type) -1)
return FALSE0;
     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((void*)0);
     if (! (_bfd_generic_link_add_one_symbol
     (info, dynobj, name, BSF_GLOBAL0x02, bfd_abs_section_ptr((asection *) &bfd_abs_section),
      0, NULL((void*)0), FALSE0,
      get_elf_backend_data (dynobj)((const struct elf_backend_data *) (dynobj)->xvec->backend_data
)->collect, &bh)))
return FALSE0;
     h = (struct elf_link_hash_entry *) bh;
     h->non_elf = 0;
     h->def_regular = 1;
     h->type = STT_OBJECT1;
     h->verinfo.vertree = NULL((void*)0);

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

     /* 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((void*)0); t = t->next)
   {
     unsigned int cdeps;
     struct bfd_elf_version_deps *n;

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

     /* Add a symbol representing this version.  */
     bh = NULL((void*)0);
     if (! (_bfd_generic_link_add_one_symbol
     (info, dynobj, t->name, BSF_GLOBAL0x02, bfd_abs_section_ptr((asection *) &bfd_abs_section),
      0, NULL((void*)0), FALSE0,
      get_elf_backend_data (dynobj)((const struct elf_backend_data *) (dynobj)->xvec->backend_data
)->collect, &bh)))
return FALSE0;
     h = (struct elf_link_hash_entry *) bh;
     h->non_elf = 0;
     h->def_regular = 1;
     h->type = STT_OBJECT1;
     h->verinfo.vertree = t;

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

     def.vd_version = VER_DEF_CURRENT1;
     def.vd_flags = 0;
     if (t->globals.list == NULL((void*)0)
  && t->locals.list == NULL((void*)0)
  && ! t->used)
def.vd_flags |= VER_FLG_WEAK0x2;
     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((void*)0))
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)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
		      h->dynstr_index);
     defaux.vda_next = 0;
     if (t->deps != NULL((void*)0))
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((void*)0); n = n->next)
{
  if (n->version_needed == NULL((void*)0))
    {
      /* 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)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
			      defaux.vda_name);
    }
  if (n->next == NULL((void*)0))
    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_VERDEF0x6ffffffc, 0)
     || !_bfd_elf_add_dynamic_entry (info, DT_VERDEFNUM0x6ffffffd, cdefs))
   return FALSE0;

 elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->cverdefs = cdefs;
}

    if ((info->new_dtags && info->flags) || (info->flags & DF_STATIC_TLS(1 << 4)))
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_FLAGS30, info->flags))
   return FALSE0;
}
    else if (info->flags & DF_BIND_NOW(1 << 3))
{
 if (!_bfd_elf_add_dynamic_entry (info, DT_BIND_NOW24, 0))
   return FALSE0;
}

    if (info->flags_1)
{
 if (info->executable)
   info->flags_1 &= ~ (DF_1_INITFIRST0x00000020
		| DF_1_NODELETE0x00000008
		| DF_1_NOOPEN0x00000040);
 if (!_bfd_elf_add_dynamic_entry (info, DT_FLAGS_10x6ffffffb, info->flags_1))
   return FALSE0;
}

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

    s = bfd_get_section_by_name (dynobj, ".gnu.version_r");
    BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5715); } while (0);
    {
struct elf_find_verdep_info sinfo;

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

elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_find_version_dependencies), (&
sinfo)))
		_bfd_elf_link_find_version_dependencies,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_find_version_dependencies), (&
sinfo)))
		&sinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_find_version_dependencies), (&
sinfo)));

if (elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->verref == NULL((void*)0))
 s->flags |= SEC_EXCLUDE0x8000;
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)((output_bfd) -> tdata.elf_obj_data)->verref;
 t != NULL((void*)0);
 t = t->vn_nextref)
     {
Elf_Internal_Vernaux *a;

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

   s->size = size;
   s->contents = bfd_alloc (output_bfd, s->size);
   if (s->contents == NULL((void*)0))
     return FALSE0;

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

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

t->vn_version = VER_NEED_CURRENT1;
t->vn_cnt = caux;
indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
			    elf_dt_name (t->vn_bfd)(((t->vn_bfd) -> tdata.elf_obj_data) -> dt_name) != NULL((void*)0)
			    ? elf_dt_name (t->vn_bfd)(((t->vn_bfd) -> tdata.elf_obj_data) -> dt_name)
			    : lbasename (t->vn_bfd->filename),
			    FALSE0);
if (indx == (bfd_size_type) -1)
  return FALSE0;
t->vn_file = indx;
t->vn_aux = sizeof (Elf_External_Verneed);
if (t->vn_nextref == NULL((void*)0))
  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((void*)0); a = a->vna_nextptr)
  {
    a->vna_hash = bfd_elf_hash (a->vna_nodename);
    indx = _bfd_elf_strtab_add (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr,
				a->vna_nodename, FALSE0);
    if (indx == (bfd_size_type) -1)
      return FALSE0;
    a->vna_name = indx;
    if (a->vna_nextptr == NULL((void*)0))
      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_VERNEED0x6ffffffe, 0)
|| !_bfd_elf_add_dynamic_entry (info, DT_VERNEEDNUM0x6fffffff, crefs))
     return FALSE0;

   elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->cverrefs = crefs;
 }
    }

    if ((elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->cverrefs == 0
  && elf_tdata (output_bfd)((output_bfd) -> tdata.elf_obj_data)->cverdefs == 0)
 || _bfd_elf_link_renumber_dynsyms (output_bfd, info,
			     &section_sym_count) == 0)
{
 s = bfd_get_section_by_name (dynobj, ".gnu.version");
 s->flags |= SEC_EXCLUDE0x8000;
}
  }
return TRUE1;
5830}

5832bfd_boolean
5833bfd_elf_size_dynsym_hash_dynstr (bfd *output_bfd, struct bfd_link_info *info)
5834{
if (!is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return TRUE1;

if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created)
  {
    bfd *dynobj;
    const struct elf_backend_data *bed;
    asection *s;
    bfd_size_type dynsymcount;
    unsigned long section_sym_count;
    unsigned int dtagcount;

    dynobj = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynobj;

    /* 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,
				    &section_sym_count);

    /* Work out the size of the symbol version section.  */
    s = bfd_get_section_by_name (dynobj, ".gnu.version");
    BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5859); } while (0);
    if (dynsymcount != 0
 && (s->flags & SEC_EXCLUDE0x8000) == 0)
{
 s->size = dynsymcount * sizeof (Elf_External_Versym);
 s->contents = bfd_zalloc (output_bfd, s->size);
 if (s->contents == NULL((void*)0))
   return FALSE0;

 if (!_bfd_elf_add_dynamic_entry (info, DT_VERSYM0x6ffffff0, 0))
   return FALSE0;
}

    /* 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)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5879); } while (0);
    bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
    s->size = dynsymcount * bed->s->sizeof_sym;

    if (dynsymcount != 0)
{
 s->contents = bfd_alloc (output_bfd, s->size);
 if (s->contents == NULL((void*)0))
   return FALSE0;

 /* The first entry in .dynsym is a dummy symbol.
    Clear all the section syms, in case we don't output them all.  */
 ++section_sym_count;
 memset (s->contents, 0, section_sym_count * bed->s->sizeof_sym);
}

    elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->bucketcount = 0;

    /* Compute the size of the hashing table.  As a side effect this
computes the hash values for all the names we export.  */
    if (info->emit_hash)
{
 unsigned long int *hashcodes;
 unsigned long int *hashcodesp;
 bfd_size_type amt;
 unsigned long int nsyms;
 size_t bucketcount;
 size_t hash_entry_size;

 /* 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 * sizeof (unsigned long int);
 hashcodes = bfd_malloc (amt);
 if (hashcodes == NULL((void*)0))
   return FALSE0;
 hashcodesp = hashcodes;

 /* Put all hash values in HASHCODES.  */
 elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_collect_hash_codes), (&hashcodesp)))
		  elf_collect_hash_codes, &hashcodesp)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_collect_hash_codes), (&hashcodesp)));

 nsyms = hashcodesp - hashcodes;
 bucketcount
   = compute_bucket_count (info, hashcodes, nsyms, 0);
 free (hashcodes);

 if (bucketcount == 0)
   return FALSE0;

 elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->bucketcount = bucketcount;

 s = bfd_get_section_by_name (dynobj, ".hash");
 BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5932); } while (0);
 hash_entry_size = elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->this_hdr.sh_entsize;
 s->size = ((2 + bucketcount + dynsymcount) * hash_entry_size);
 s->contents = bfd_zalloc (output_bfd, s->size);
 if (s->contents == NULL((void*)0))
   return FALSE0;

 bfd_put (8 * hash_entry_size, output_bfd, bucketcount, s->contents)((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) (s
->contents)) = (bucketcount) & 0xff)) : (8 * hash_entry_size
) == 16 ? ((*((output_bfd)->xvec->bfd_putx16)) ((bucketcount
),(s->contents))) : (8 * hash_entry_size) == 32 ? ((*((output_bfd
)->xvec->bfd_putx32)) ((bucketcount),(s->contents)))
 : (8 * hash_entry_size) == 64 ? ((*((output_bfd)->xvec->
bfd_putx64)) ((bucketcount), (s->contents))) : (_bfd_abort
 ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c", 5939, __PRETTY_FUNCTION__
), (void) 0));
 bfd_put (8 * hash_entry_size, output_bfd, dynsymcount,((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) (s
->contents + hash_entry_size)) = (dynsymcount) & 0xff)
) : (8 * hash_entry_size) == 16 ? ((*((output_bfd)->xvec->
bfd_putx16)) ((dynsymcount),(s->contents + hash_entry_size
))) : (8 * hash_entry_size) == 32 ? ((*((output_bfd)->xvec
->bfd_putx32)) ((dynsymcount),(s->contents + hash_entry_size
))) : (8 * hash_entry_size) == 64 ? ((*((output_bfd)->xvec
->bfd_putx64)) ((dynsymcount), (s->contents + hash_entry_size
))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 5941, __PRETTY_FUNCTION__), (void) 0))
   s->contents + hash_entry_size)((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) (s
->contents + hash_entry_size)) = (dynsymcount) & 0xff)
) : (8 * hash_entry_size) == 16 ? ((*((output_bfd)->xvec->
bfd_putx16)) ((dynsymcount),(s->contents + hash_entry_size
))) : (8 * hash_entry_size) == 32 ? ((*((output_bfd)->xvec
->bfd_putx32)) ((dynsymcount),(s->contents + hash_entry_size
))) : (8 * hash_entry_size) == 64 ? ((*((output_bfd)->xvec
->bfd_putx64)) ((dynsymcount), (s->contents + hash_entry_size
))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 5941, __PRETTY_FUNCTION__), (void) 0));
}

    if (info->emit_gnu_hash)
{
 size_t i, cnt;
 unsigned char *contents;
 struct collect_gnu_hash_codes cinfo;
 bfd_size_type amt;
 size_t bucketcount;

 memset (&cinfo, 0, sizeof (cinfo));

 /* 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 * 2 * sizeof (unsigned long int);
 cinfo.hashcodes = bfd_malloc (amt);
 if (cinfo.hashcodes == NULL((void*)0))
   return FALSE0;

 cinfo.hashval = cinfo.hashcodes + dynsymcount;
 cinfo.min_dynindx = -1;
 cinfo.output_bfd = output_bfd;
 cinfo.bed = bed;

 /* Put all hash values in HASHCODES.  */
 elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_collect_gnu_hash_codes), (&cinfo)))
		  elf_collect_gnu_hash_codes, &cinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_collect_gnu_hash_codes), (&cinfo)));

 bucketcount
   = compute_bucket_count (info, cinfo.hashcodes, cinfo.nsyms, 1);

 if (bucketcount == 0)
   {
     free (cinfo.hashcodes);
     return FALSE0;
   }

 s = bfd_get_section_by_name (dynobj, ".gnu.hash");
 BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5981); } while (0);

 if (cinfo.nsyms == 0)
   {
     /* Empty .gnu.hash section is special.  */
     BFD_ASSERT (cinfo.min_dynindx == -1)do { if (!(cinfo.min_dynindx == -1)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,5986); } while (0);
     free (cinfo.hashcodes);
     s->size = 5 * 4 + bed->s->arch_size / 8;
     contents = bfd_zalloc (output_bfd, s->size);
     if (contents == NULL((void*)0))
return FALSE0;
     s->contents = contents;
     /* 1 empty bucket.  */
     bfd_put_32 (output_bfd, 1, contents)((*((output_bfd)->xvec->bfd_putx32)) ((1),(contents)));
     /* SYMIDX above the special symbol 0.  */
     bfd_put_32 (output_bfd, 1, contents + 4)((*((output_bfd)->xvec->bfd_putx32)) ((1),(contents + 4
)));
     /* Just one word for bitmask.  */
     bfd_put_32 (output_bfd, 1, contents + 8)((*((output_bfd)->xvec->bfd_putx32)) ((1),(contents + 8
)));
     /* Only hash fn bloom filter.  */
     bfd_put_32 (output_bfd, 0, contents + 12)((*((output_bfd)->xvec->bfd_putx32)) ((0),(contents + 12
)));
     /* No hashes are valid - empty bitmask.  */
     bfd_put (bed->s->arch_size, output_bfd, 0, contents + 16)((bed->s->arch_size) == 8 ? ((void) (*((unsigned char *
) (contents + 16)) = (0) & 0xff)) : (bed->s->arch_size
) == 16 ? ((*((output_bfd)->xvec->bfd_putx16)) ((0),(contents
 + 16))) : (bed->s->arch_size) == 32 ? ((*((output_bfd)
->xvec->bfd_putx32)) ((0),(contents + 16))) : (bed->
s->arch_size) == 64 ? ((*((output_bfd)->xvec->bfd_putx64
)) ((0), (contents + 16))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6002, __PRETTY_FUNCTION__), (void) 0));
     /* No hashes in the only bucket.  */
     bfd_put_32 (output_bfd, 0,((*((output_bfd)->xvec->bfd_putx32)) ((0),(contents + 16
 + bed->s->arch_size / 8)))
	  contents + 16 + bed->s->arch_size / 8)((*((output_bfd)->xvec->bfd_putx32)) ((0),(contents + 16
 + bed->s->arch_size / 8)));
   }
 else
   {
     BFD_ASSERT (cinfo.min_dynindx != -1)do { if (!(cinfo.min_dynindx != -1)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6009); } while (0);
     unsigned long int maskwords, maskbitslog2;

     maskbitslog2 = bfd_log2 (cinfo.nsyms) + 1;
     if (maskbitslog2 < 3)
maskbitslog2 = 5;
     else if ((1 << (maskbitslog2 - 2)) & cinfo.nsyms)
maskbitslog2 = maskbitslog2 + 3;
     else
maskbitslog2 = maskbitslog2 + 2;
     if (bed->s->arch_size == 64)
{
  if (maskbitslog2 == 5)
    maskbitslog2 = 6;
  cinfo.shift1 = 6;
}
     else
cinfo.shift1 = 5;
     cinfo.mask = (1 << cinfo.shift1) - 1;
     cinfo.shift2 = maskbitslog2;
     cinfo.maskbits = 1 << maskbitslog2;
     maskwords = 1 << (maskbitslog2 - cinfo.shift1);
     amt = bucketcount * sizeof (unsigned long int) * 2;
     amt += maskwords * sizeof (bfd_vma);
     cinfo.bitmask = bfd_malloc (amt);
     if (cinfo.bitmask == NULL((void*)0))
{
  free (cinfo.hashcodes);
  return FALSE0;
}

     cinfo.counts = (void *) (cinfo.bitmask + maskwords);
     cinfo.indx = cinfo.counts + bucketcount;
     cinfo.symindx = dynsymcount - cinfo.nsyms;
     memset (cinfo.bitmask, 0, maskwords * sizeof (bfd_vma));

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

     for (i = 0, cnt = cinfo.symindx; i < bucketcount; ++i)
if (cinfo.counts[i] != 0)
  {
    cinfo.indx[i] = cnt;
    cnt += cinfo.counts[i];
  }
     BFD_ASSERT (cnt == dynsymcount)do { if (!(cnt == dynsymcount)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6056); } while (0);
     cinfo.bucketcount = bucketcount;
     cinfo.local_indx = cinfo.min_dynindx;

     s->size = (4 + bucketcount + cinfo.nsyms) * 4;
     s->size += cinfo.maskbits / 8;
     contents = bfd_zalloc (output_bfd, s->size);
     if (contents == NULL((void*)0))
{
  free (cinfo.bitmask);
  free (cinfo.hashcodes);
  return FALSE0;
}

     s->contents = contents;
     bfd_put_32 (output_bfd, bucketcount, contents)((*((output_bfd)->xvec->bfd_putx32)) ((bucketcount),(contents
)));
     bfd_put_32 (output_bfd, cinfo.symindx, contents + 4)((*((output_bfd)->xvec->bfd_putx32)) ((cinfo.symindx),(
contents + 4)));
     bfd_put_32 (output_bfd, maskwords, contents + 8)((*((output_bfd)->xvec->bfd_putx32)) ((maskwords),(contents
 + 8)));
     bfd_put_32 (output_bfd, cinfo.shift2, contents + 12)((*((output_bfd)->xvec->bfd_putx32)) ((cinfo.shift2),(contents
 + 12)));
     contents += 16 + cinfo.maskbits / 8;

     for (i = 0; i < bucketcount; ++i)
{
  if (cinfo.counts[i] == 0)
    bfd_put_32 (output_bfd, 0, contents)((*((output_bfd)->xvec->bfd_putx32)) ((0),(contents)));
  else
    bfd_put_32 (output_bfd, cinfo.indx[i], contents)((*((output_bfd)->xvec->bfd_putx32)) ((cinfo.indx[i]),(
contents)));
  contents += 4;
}

     cinfo.contents = contents;

     /* Renumber dynamic symbols, populate .gnu.hash section.  */
     elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_renumber_gnu_hash_syms), (&cinfo)))
		      elf_renumber_gnu_hash_syms, &cinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_renumber_gnu_hash_syms), (&cinfo)));

     contents = s->contents + 16;
     for (i = 0; i < maskwords; ++i)
{
  bfd_put (bed->s->arch_size, output_bfd, cinfo.bitmask[i],((bed->s->arch_size) == 8 ? ((void) (*((unsigned char *
) (contents)) = (cinfo.bitmask[i]) & 0xff)) : (bed->s->
arch_size) == 16 ? ((*((output_bfd)->xvec->bfd_putx16))
 ((cinfo.bitmask[i]),(contents))) : (bed->s->arch_size)
 == 32 ? ((*((output_bfd)->xvec->bfd_putx32)) ((cinfo.bitmask
[i]),(contents))) : (bed->s->arch_size) == 64 ? ((*((output_bfd
)->xvec->bfd_putx64)) ((cinfo.bitmask[i]), (contents)))
 : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6096, __PRETTY_FUNCTION__), (void) 0))
	   contents)((bed->s->arch_size) == 8 ? ((void) (*((unsigned char *
) (contents)) = (cinfo.bitmask[i]) & 0xff)) : (bed->s->
arch_size) == 16 ? ((*((output_bfd)->xvec->bfd_putx16))
 ((cinfo.bitmask[i]),(contents))) : (bed->s->arch_size)
 == 32 ? ((*((output_bfd)->xvec->bfd_putx32)) ((cinfo.bitmask
[i]),(contents))) : (bed->s->arch_size) == 64 ? ((*((output_bfd
)->xvec->bfd_putx64)) ((cinfo.bitmask[i]), (contents)))
 : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6096, __PRETTY_FUNCTION__), (void) 0));
  contents += bed->s->arch_size / 8;
}

     free (cinfo.bitmask);
     free (cinfo.hashcodes);
   }
}

    s = bfd_get_section_by_name (dynobj, ".dynstr");
    BFD_ASSERT (s != NULL)do { if (!(s != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6106); } while (0);

    elf_finalize_dynstr (output_bfd, info);

    s->size = _bfd_elf_strtab_size (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr);

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

return TRUE1;
6118}

6120/* Final phase of ELF linker.  */

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

6124struct elf_final_link_info
6125{
/* 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;
6168};

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

6172struct elf_outext_info
6173{
bfd_boolean failed;
bfd_boolean localsyms;
struct elf_final_link_info *finfo;
6177};

6179/* 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.  */

6184static void
6185elf_link_adjust_relocs (bfd *abfd,
	Elf_Internal_Shdr *rel_hdr,
	unsigned int count,
	struct elf_link_hash_entry **rel_hash)
6189{
unsigned int i;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
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 ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6209, __PRETTY_FUNCTION__);

if (bed->s->int_rels_per_ext_rel > MAX_INT_RELS_PER_EXT_REL3)
  abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6212, __PRETTY_FUNCTION__);

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_REL3];
    unsigned int j;

    if (*rel_hash == NULL((void*)0))
continue;

    BFD_ASSERT ((*rel_hash)->indx >= 0)do { if (!((*rel_hash)->indx >= 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6234); } while (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);
  }
6242}

6244struct elf_link_sort_rela
6245{
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];
6253};

6255static int
6256elf_link_sort_cmp1 (const void *A, const void *B)
6257{
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;
6278}

6280static int
6281elf_link_sort_cmp2 (const void *A, const void *B)
6282{
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;
6302}

6304static size_t
6305elf_link_sort_relocs (bfd *abfd, struct bfd_link_info *info, asection **psec)
6306{
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)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
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((void*)0) || reldyn->size == 0)
  {
    reldyn = bfd_get_section_by_name (abfd, ".rel.dyn");
    if (reldyn == NULL((void*)0) || 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->map_head.link_order; lo != NULL((void*)0); 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((void*)0))
  {
    (*info->callbacks->warning)
(info, _("Not enough memory to sort relocations")("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->map_head.link_order; lo != NULL((void*)0); lo = lo->next)
  if (lo->type == bfd_indirect_link_order)
    {
bfd_byte *erel, *erelend;
asection *o = lo->u.indirect.section;

if (o->contents == NULL((void*)0) && 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->map_head.link_order; lo != NULL((void*)0); 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;
6434}

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

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

    hdr = &elf_tdata (finfo->output_bfd)((finfo->output_bfd) -> tdata.elf_obj_data)->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_SET0) != 0
 || bfd_bwrite (finfo->symbuf, amt, finfo->output_bfd) != amt)
return FALSE0;

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

return TRUE1;
6460}

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

6464static bfd_boolean
6465elf_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)
6470{
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)((const struct elf_backend_data *) (finfo->output_bfd)->
xvec->backend_data);
output_symbol_hook = bed->elf_backend_link_output_symbol_hook;
if (output_symbol_hook != NULL((void*)0))
  {
    if (! (*output_symbol_hook) (finfo->info, name, elfsym, input_sec, h))
return FALSE0;
  }

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

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

dest = finfo->symbuf + finfo->symbuf_count * bed->s->sizeof_sym;
destshndx = finfo->symshndxbuf;
if (destshndx != NULL((void*)0))
  {
    if (bfd_get_symcount (finfo->output_bfd)((finfo->output_bfd)->symcount) >= 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((void*)0))
   return FALSE0;
 memset ((char *) destshndx + amt, 0, amt);
 finfo->shndxbuf_size *= 2;
}
    destshndx += bfd_get_symcount (finfo->output_bfd)((finfo->output_bfd)->symcount);
  }

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

return TRUE1;
6527}

6529/* Return TRUE if the dynamic symbol SYM in ABFD is supported.  */

6531static bfd_boolean
6532check_dynsym (bfd *abfd, Elf_Internal_Sym *sym)
6533{
if (sym->st_shndx > SHN_HIRESERVE0xFFFF)
  {
    /* The gABI doesn't support dynamic symbols in output sections
       beyond 64k.  */
    (*_bfd_error_handler)
(_("%B: Too many sections: %d (>= %d)")("%B: Too many sections: %d (>= %d)"),
abfd, bfd_count_sections (abfd)((abfd)->section_count), SHN_LORESERVE0xFF00);
    bfd_set_error (bfd_error_nonrepresentable_section);
    return FALSE0;
  }
return TRUE1;
6545}

6547/* 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.  */

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

if (!is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return FALSE0;

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

  case bfd_link_hash_undefined:
  case bfd_link_hash_undefweak:
    abfd = h->root.u.undef.abfd;
    if ((abfd->flags & DYNAMIC0x40) == 0
 || (elf_dyn_lib_class (abfd)(((abfd) -> tdata.elf_obj_data) -> dyn_lib_class) & DYN_DT_NEEDED) == 0)
return FALSE0;
    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)do { if (!(abfd != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6587); } while (0);

for (loaded = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->loaded;
     loaded != NULL((void*)0);
     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 & DYNAMIC0x40) == 0
 || elf_dynversym (input)(((input) -> tdata.elf_obj_data) -> dynversym_section) == 0)
continue;

    hdr = &elf_tdata (input)((input) -> tdata.elf_obj_data)->dynsymtab_hdr;

    symcount = hdr->sh_size / bed->s->sizeof_sym;
    if (elf_bad_symtab (input)(((input) -> tdata.elf_obj_data) -> bad_symtab))
{
 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((void*)0), NULL((void*)0), NULL((void*)0));
    if (isymbuf == NULL((void*)0))
return FALSE0;

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

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

    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)(((unsigned int)(isym->st_info)) >> 4) == STB_LOCAL0
     || isym->st_shndx == SHN_UNDEF0)
   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_HIDDEN0x8000) == 0)
   {
     /* If we have a non-hidden versioned sym, then it should
 have provided a definition for the undefined sym.  */
     abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6675, __PRETTY_FUNCTION__);
   }

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

    free (extversym);
    free (isymbuf);
  }

return FALSE0;
6693}

6695/* 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.  */

6702static bfd_boolean
6703elf_link_output_extsym (struct elf_link_hash_entry *h, void *data)
6704{
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 TRUE1;
  }

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

bed = get_elf_backend_data (finfo->output_bfd)((const struct elf_backend_data *) (finfo->output_bfd)->
xvec->backend_data);

if (h->root.type == bfd_link_hash_undefined)
  {
    /* 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).  */
    bfd_boolean ignore_undef = FALSE0;

    /* Some symbols may be special in that the fact that they're
undefined can be safely ignored - let backend determine that.  */
    if (bed->elf_backend_ignore_undef_symbol)
ignore_undef = bed->elf_backend_ignore_undef_symbol (h);

    /* If we are reporting errors for this situation then do so now.  */
    if (ignore_undef == FALSE0
 && 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((void*)0), 0, finfo->info->unresolved_syms_in_shared_libs == RM_GENERATE_ERROR)))
   {
     eoinfo->failed = TRUE1;
     return FALSE0;
   }
}
  }

/* 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")("%B: %s symbol `%s' in %B is referenced by DSO"),
finfo->output_bfd,
h->root.u.def.section == bfd_abs_section_ptr((asection *) &bfd_abs_section)
? finfo->output_bfd : h->root.u.def.section->owner,
ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) == STV_INTERNAL1
? "internal"
: ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) == STV_HIDDEN2
? "hidden" : "local",
h->root.root.string);
    eoinfo->failed = TRUE1;
    return FALSE0;
  }

/* 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 = FALSE0;
else if ((h->def_dynamic
   || h->ref_dynamic
   || h->root.type == bfd_link_hash_new)
  && !h->def_regular
  && !h->ref_regular)
  strip = TRUE1;
else if (finfo->info->strip == strip_all)
  strip = TRUE1;
else if (finfo->info->strip == strip_some
  && bfd_hash_lookup (finfo->info->keep_hash,
	       h->root.root.string, FALSE0, FALSE0) == NULL((void*)0))
  strip = TRUE1;
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)(!((h->root.u.def.section) == ((asection *) &bfd_abs_section
)) && (((h->root.u.def.section)->output_section
) == ((asection *) &bfd_abs_section)) && (h->root
.u.def.section)->sec_info_type != 2 && (h->root
.u.def.section)->sec_info_type != 4))
  strip = TRUE1;
else
  strip = FALSE0;

/* 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 TRUE1;

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)(((0) << 4) + ((h->type) & 0xF));
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)(((2) << 4) + ((h->type) & 0xF));
else
  sym.st_info = ELF_ST_INFO (STB_GLOBAL, h->type)(((1) << 4) + ((h->type) & 0xF));

switch (h->root.type)
  {
  default:
  case bfd_link_hash_new:
  case bfd_link_hash_warning:
    abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6835, __PRETTY_FUNCTION__);
    return FALSE0;

  case bfd_link_hash_undefined:
  case bfd_link_hash_undefweak:
    input_sec = bfd_und_section_ptr((asection *) &bfd_und_section);
    sym.st_shndx = SHN_UNDEF0;
    break;

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

   /* 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_TLS6)
  {
    /* STT_TLS symbols are relative to PT_TLS segment
       base.  */
    BFD_ASSERT (elf_hash_table (finfo->info)->tls_sec != NULL)do { if (!(((struct elf_link_hash_table *) ((finfo->info)->
hash))->tls_sec != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6873); } while (0);
    sym.st_value -= elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))->tls_sec->vma;
  }
     }
 }
else
 {
   BFD_ASSERT (input_sec->owner == NULLdo { if (!(input_sec->owner == ((void*)0) || (input_sec->
owner->flags & 0x40) != 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6881); } while (0)
	|| (input_sec->owner->flags & DYNAMIC) != 0)do { if (!(input_sec->owner == ((void*)0) || (input_sec->
owner->flags & 0x40) != 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,6881); } while (0);
   sym.st_shndx = SHN_UNDEF0;
   input_sec = bfd_und_section_ptr((asection *) &bfd_und_section);
 }
    }
    break;

  case bfd_link_hash_common:
    input_sec = h->root.u.c.p->section;
    sym.st_shndx = bed->common_section_index (input_sec);
    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 TRUE1;
  }

/* 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)((h->other) & 0x3) == STV_DEFAULT0
      || h->root.type != bfd_link_hash_undefweak))
 || !h->forced_local)
    && elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))->dynamic_sections_created)
  {
    if (! ((*bed->elf_backend_finish_dynamic_symbol)
    (finfo->output_bfd, finfo->info, h, &sym)))
{
 eoinfo->failed = TRUE1;
 return FALSE0;
}
  }

/* 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_UNDEF0
    && h->ref_regular
    && (ELF_ST_BIND (sym.st_info)(((unsigned int)(sym.st_info)) >> 4) == STB_GLOBAL1
 || ELF_ST_BIND (sym.st_info)(((unsigned int)(sym.st_info)) >> 4) == STB_WEAK2))
  {
    int bindtype;

    if (h->ref_regular_nonweak)
bindtype = STB_GLOBAL1;
    else
bindtype = STB_WEAK2;
    sym.st_info = ELF_ST_INFO (bindtype, ELF_ST_TYPE (sym.st_info))(((bindtype) << 4) + ((((sym.st_info) & 0xF)) &
 0xF));
  }

/* 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)((sym.st_other) & 0x3) != STV_DEFAULT0
    && ELF_ST_BIND (sym.st_info)(((unsigned int)(sym.st_info)) >> 4) != STB_WEAK2
    && h->root.type == bfd_link_hash_undefined
    && !h->def_regular)
  {
    (*_bfd_error_handler)
(_("%B: %s symbol `%s' isn't defined")("%B: %s symbol `%s' isn't defined"),
finfo->output_bfd,
ELF_ST_VISIBILITY (sym.st_other)((sym.st_other) & 0x3) == STV_PROTECTED3
? "protected"
: ELF_ST_VISIBILITY (sym.st_other)((sym.st_other) & 0x3) == STV_INTERNAL1
? "internal" : "hidden",
h->root.root.string);
    eoinfo->failed = TRUE1;
    return FALSE0;
  }

/* 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)((struct elf_link_hash_table *) ((finfo->info)->hash))->dynamic_sections_created)
  {
    size_t bucketcount;
    size_t bucket;
    bfd_byte *esym;

    sym.st_name = h->dynstr_index;
    esym = finfo->dynsym_sec->contents + h->dynindx * bed->s->sizeof_sym;
    if (! check_dynsym (finfo->output_bfd, &sym))
{
 eoinfo->failed = TRUE1;
 return FALSE0;
}
    bed->s->swap_symbol_out (finfo->output_bfd, &sym, esym, 0);

    bucketcount = elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))->bucketcount;
    bucket = h->u.elf_hash_value % bucketcount;

    if (finfo->hash_sec != NULL((void*)0))
{
 size_t hash_entry_size;
 bfd_byte *bucketpos;
 bfd_vma chain;

 hash_entry_size
   = elf_section_data (finfo->hash_sec)((struct bfd_elf_section_data*)(finfo->hash_sec)->used_by_bfd
)->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)((8 * hash_entry_size) == 8 ? (bfd_vma) (*(unsigned char *) (
bucketpos) & 0xff) : (8 * hash_entry_size) == 16 ? ((*((finfo
->output_bfd)->xvec->bfd_getx16)) (bucketpos)) : (8 *
 hash_entry_size) == 32 ? ((*((finfo->output_bfd)->xvec
->bfd_getx32)) (bucketpos)) : (8 * hash_entry_size) == 64 ?
 ((*((finfo->output_bfd)->xvec->bfd_getx64)) (bucketpos
)) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6996, __PRETTY_FUNCTION__), (bfd_vma) - 1));
 bfd_put (8 * hash_entry_size, finfo->output_bfd, h->dynindx, bucketpos)((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) (bucketpos
)) = (h->dynindx) & 0xff)) : (8 * hash_entry_size) == 16
 ? ((*((finfo->output_bfd)->xvec->bfd_putx16)) ((h->
dynindx),(bucketpos))) : (8 * hash_entry_size) == 32 ? ((*((finfo
->output_bfd)->xvec->bfd_putx32)) ((h->dynindx),(
bucketpos))) : (8 * hash_entry_size) == 64 ? ((*((finfo->output_bfd
)->xvec->bfd_putx64)) ((h->dynindx), (bucketpos))) :
 (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 6997, __PRETTY_FUNCTION__), (void) 0));
 bfd_put (8 * hash_entry_size, finfo->output_bfd, chain,((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) ((
(bfd_byte *) finfo->hash_sec->contents + (bucketcount +
+ h->dynindx) * hash_entry_size))) = (chain) & 0xff
)) : (8 * hash_entry_size) == 16 ? ((*((finfo->output_bfd)
->xvec->bfd_putx16)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 32 ? ((*((finfo->output_bfd
)->xvec->bfd_putx32)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 64 ? ((*((finfo->output_bfd
)->xvec->bfd_putx64)) ((chain), (((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 7000, __PRETTY_FUNCTION__), (void) 0))
   ((bfd_byte *) finfo->hash_sec->contents((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) ((
(bfd_byte *) finfo->hash_sec->contents + (bucketcount +
+ h->dynindx) * hash_entry_size))) = (chain) & 0xff
)) : (8 * hash_entry_size) == 16 ? ((*((finfo->output_bfd)
->xvec->bfd_putx16)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 32 ? ((*((finfo->output_bfd
)->xvec->bfd_putx32)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 64 ? ((*((finfo->output_bfd
)->xvec->bfd_putx64)) ((chain), (((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 7000, __PRETTY_FUNCTION__), (void) 0))
    + (bucketcount + 2 + h->dynindx) * hash_entry_size))((8 * hash_entry_size) == 8 ? ((void) (*((unsigned char *) ((
(bfd_byte *) finfo->hash_sec->contents + (bucketcount +
+ h->dynindx) * hash_entry_size))) = (chain) & 0xff
)) : (8 * hash_entry_size) == 16 ? ((*((finfo->output_bfd)
->xvec->bfd_putx16)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 32 ? ((*((finfo->output_bfd
)->xvec->bfd_putx32)) ((chain),(((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (8 * hash_entry_size) == 64 ? ((*((finfo->output_bfd
)->xvec->bfd_putx64)) ((chain), (((bfd_byte *) finfo->
hash_sec->contents + (bucketcount + 2 + h->dynindx) * hash_entry_size
)))) : (_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 7000, __PRETTY_FUNCTION__), (void) 0));
}

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

 if (!h->def_regular)
   {
     if (h->verinfo.verdef == NULL((void*)0))
iversym.vs_vers = 0;
     else
iversym.vs_vers = h->verinfo.verdef->vd_exp_refno + 1;
   }
 else
   {
     if (h->verinfo.vertree == NULL((void*)0))
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_HIDDEN0x8000;

 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_EXCLUDE0x8000) != 0)
  return TRUE1;

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

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

return TRUE1;
7048}

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

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

switch (sec->sec_info_type)
  {
  case ELF_INFO_TYPE_STABS1:
  case ELF_INFO_TYPE_EH_FRAME3:
    return TRUE1;
  default:
    break;
  }

bed = get_elf_backend_data (sec->owner)((const struct elf_backend_data *) (sec->owner)->xvec->
backend_data);
if (bed->elf_backend_ignore_discarded_relocs != NULL((void*)0)
    && (*bed->elf_backend_ignore_discarded_relocs) (sec))
  return TRUE1;

return FALSE0;
7073}

7075/* 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).  */

7084unsigned int
7085_bfd_elf_default_action_discarded (asection *sec)
7086{
if (sec->flags & SEC_DEBUGGING0x2000)
  return PRETEND;

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

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

return COMPLAIN | PRETEND;
7097}

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

7101static asection *
7102match_group_member (asection *sec, asection *group,
    struct bfd_link_info *info)
7104{
asection *first = elf_next_in_group (group)(((struct bfd_elf_section_data*)(group)->used_by_bfd)->
next_in_group);
asection *s = first;

while (s != NULL((void*)0))
  {
    if (bfd_elf_match_symbols_in_sections (s, sec, info))
return s;

    s = elf_next_in_group (s)(((struct bfd_elf_section_data*)(s)->used_by_bfd)->next_in_group
);
    if (s == first)
break;
  }

return NULL((void*)0);
7119}

7121/* Check if the kept section of a discarded section SEC can be used
 to replace it. Return the replacement if it is OK. Otherwise return
 NULL. */

7125asection *
7126_bfd_elf_check_kept_section (asection *sec, struct bfd_link_info *info)
7127{
asection *kept;

kept = sec->kept_section;
if (kept != NULL((void*)0))
  {
    if (elf_sec_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->sec_group
) != NULL((void*)0))
kept = match_group_member (sec, kept, info);
    if (kept != NULL((void*)0) && sec->size != kept->size)
kept = NULL((void*)0);
  }
return kept;
7139}

7141/* 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.  */

7146static bfd_boolean
7147elf_link_input_bfd (struct elf_final_link_info *finfo, bfd *input_bfd)
7148{
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)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
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 & DYNAMIC0x40) != 0)
  return TRUE1;

emit_relocs = (finfo->info->relocatable
 || finfo->info->emitrelocations);

symtab_hdr = &elf_tdata (input_bfd)((input_bfd) -> tdata.elf_obj_data)->symtab_hdr;
if (elf_bad_symtab (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> bad_symtab))
  {
    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((void*)0) && 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((void*)0))
return FALSE0;
  }

/* 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)(((input_bfd) -> tdata.elf_obj_data) -> bad_symtab))
{
 if (ELF_ST_BIND (isym->st_info)(((unsigned int)(isym->st_info)) >> 4) != STB_LOCAL0)
   {
     *ppsection = NULL((void*)0);
     continue;
   }
}

    if (isym->st_shndx == SHN_UNDEF0)
isec = bfd_und_section_ptr((asection *) &bfd_und_section);
    else if (isym->st_shndx < SHN_LORESERVE0xFF00
      || isym->st_shndx > SHN_HIRESERVE0xFFFF)
{
 isec = bfd_section_from_elf_index (input_bfd, isym->st_shndx);
 if (isec
     && isec->sec_info_type == ELF_INFO_TYPE_MERGE2
     && ELF_ST_TYPE (isym->st_info)((isym->st_info) & 0xF) != STT_SECTION3)
   isym->st_value =
     _bfd_merged_section_offset (output_bfd, &isec,
			  elf_section_data (isec)((struct bfd_elf_section_data*)(isec)->used_by_bfd)->sec_info,
			  isym->st_value);
}
    else if (isym->st_shndx == SHN_ABS0xFFF1)
isec = bfd_abs_section_ptr((asection *) &bfd_abs_section);
    else if (isym->st_shndx == SHN_COMMON0xFFF2)
isec = bfd_com_section_ptr((asection *) &bfd_com_section);
    else
{
 /* Don't attempt to output symbols with st_shnx in the
    reserved range other than SHN_ABS and SHN_COMMON.  */
 *ppsection = NULL((void*)0);
 continue;
}

    *ppsection = isec;

    /* Don't output the first, undefined, symbol.  */
    if (ppsection == finfo->sections)
continue;

    if (ELF_ST_TYPE (isym->st_info)((isym->st_info) & 0xF) == STT_SECTION3)
{
 /* 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.  */
    if (isym->st_shndx != SHN_UNDEF0
 && (isym->st_shndx < SHN_LORESERVE0xFF00 || isym->st_shndx > SHN_HIRESERVE0xFFFF)
 && (isec == NULL((void*)0)
     || bfd_section_removed_from_list (output_bfd,((isec->output_section)->next == ((void*)0) ? (output_bfd
)->section_last != (isec->output_section) : (isec->output_section
)->next->prev != (isec->output_section))
				isec->output_section)((isec->output_section)->next == ((void*)0) ? (output_bfd
)->section_last != (isec->output_section) : (isec->output_section
)->next->prev != (isec->output_section))))
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((void*)0))
return FALSE0;

    /* See if we are discarding symbols with this name.  */
    if ((finfo->info->strip == strip_some
  && (bfd_hash_lookup (finfo->info->keep_hash, name, FALSE0, FALSE0)
      == NULL((void*)0)))
 || (((finfo->info->discard == discard_sec_merge
&& (isec->flags & SEC_MERGE0x1000000) && ! finfo->info->relocatable)
      || finfo->info->discard == discard_l)
     && bfd_is_local_label_name (input_bfd, name)((*((input_bfd)->xvec->_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((unsigned) -1))
return FALSE0;

    *pindex = bfd_get_symcount (output_bfd)((output_bfd)->symcount);

    /* 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)((osym.st_info) & 0xF) == STT_TLS6)
   {
     /* STT_TLS symbols are relative to PT_TLS segment base.  */
     BFD_ASSERT (elf_hash_table (finfo->info)->tls_sec != NULL)do { if (!(((struct elf_link_hash_table *) ((finfo->info)->
hash))->tls_sec != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7330); } while (0);
     osym.st_value -= elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))->tls_sec->vma;
   }
}

    if (! elf_link_output_sym (finfo, name, &osym, isec, NULL((void*)0)))
return FALSE0;
  }

/* Relocate the contents of each section.  */
sym_hashes = elf_sym_hashes (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> sym_hashes);
for (o = input_bfd->sections; o != NULL((void*)0); o = o->next)
  {
    bfd_byte *contents;

    if (! o->linker_mark)
{
 /* This section was omitted from the link.  */
 continue;
}

    if ((o->flags & SEC_HAS_CONTENTS0x100) == 0
 || (o->size == 0 && (o->flags & SEC_RELOC0x004) == 0))
continue;

    if ((o->flags & SEC_LINKER_CREATED0x200000) != 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)((struct bfd_elf_section_data*)(o)->used_by_bfd)->this_hdr.contents != NULL((void*)0))
contents = elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->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 FALSE0;
}

    if ((o->flags & SEC_RELOC0x004) != 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, FALSE0);
 if (internal_relocs == NULL((void*)0)
     && o->reloc_count > 0)
   return FALSE0;

 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.  */
 if (!elf_section_ignore_discarded_relocs (o))
   {
     Elf_Internal_Rela *rel, *relend;
     unsigned int action = (*bed->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((void*)0);
  const char *sym_name;

  if (r_symndx == STN_UNDEF0)
    continue;

  if (r_symndx >= locsymcount
      || (elf_bad_symtab (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> bad_symtab)
	  && finfo->sections[r_symndx] == NULL((void*)0)))
    {
      h = sym_hashes[r_symndx - extsymoff];

      /* Badly formatted input files can contain relocs that
	 reference non-existant symbols.  Check here so that
	 we do not seg fault.  */
      if (h == NULL((void*)0))
	{
	  char buffer [32];

	  sprintf_vma (buffer, rel->r_info)sprintf (buffer, "%016lx", rel->r_info);
	  (*_bfd_error_handler)
	    (_("error: %B contains a reloc (0x%s) for section %A "("error: %B contains a reloc (0x%s) for section %A " "that references a non-existent global symbol"
)
	       "that references a non-existent global symbol")("error: %B contains a reloc (0x%s) for section %A " "that references a non-existent global symbol"
),
	     input_bfd, o, buffer);
	  bfd_set_error (bfd_error_bad_value);
	  return FALSE0;
	}

      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 (h->root.type != bfd_link_hash_defined
	  && h->root.type != bfd_link_hash_defweak)
	continue;

      ps = &h->root.u.def.section;
      sym_name = h->root.root.string;
    }
  else
    {
      Elf_Internal_Sym *sym = isymbuf + r_symndx;
      ps = &finfo->sections[r_symndx];
      sym_name = bfd_elf_sym_name (input_bfd,
				   symtab_hdr,
				   sym, *ps);
    }

  /* Complain if the definition comes from a
     discarded section.  */
  if ((sec = *ps) != NULL((void*)0) && elf_discarded_section (sec)(!((sec) == ((asection *) &bfd_abs_section)) && (
((sec)->output_section) == ((asection *) &bfd_abs_section
)) && (sec)->sec_info_type != 2 && (sec)->
sec_info_type != 4))
    {
      BFD_ASSERT (r_symndx != 0)do { if (!(r_symndx != 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7470); } while (0);
      if (action & COMPLAIN)
	(*finfo->info->callbacks->einfo)
	  (_("%X`%s' referenced in section `%A' of %B: "("%X`%s' referenced in section `%A' of %B: " "defined in discarded section `%A' of %B\n"
)
	     "defined in discarded section `%A' of %B\n")("%X`%s' referenced in section `%A' of %B: " "defined in discarded section `%A' of %B\n"
),
	   sym_name, o, input_bfd, sec, sec->owner);

      /* Try to do the best we can to support buggy old
	 versions of gcc.  Pretend that the symbol is
	 really defined in the kept linkonce section.
	 FIXME: This is quite broken.  Modifying the
	 symbol here means we will be changing all later
	 uses of the symbol, not just in this section.  */
      if (action & PRETEND)
	{
	  asection *kept;

	  kept = _bfd_elf_check_kept_section (sec,
					      finfo->info);
	  if (kept != NULL((void*)0))
	    {
	      *ps = kept;
	      continue;
	    }
	}

      /* Remove the symbol reference from the reloc, but
	 don't kill the reloc completely.  This is so that
	 a zero value will be written into the section,
	 which may have non-zero contents put there by the
	 assembler.  Zero in things like an eh_frame fde
	 pc_begin allows stack unwinders to recognize the
	 fde as bogus.  */
      rel->r_info &= r_type_mask;
      rel->r_addend = 0;
    }
}
   }

 /* Relocate the section by invoking a back end routine.

    The back end routine is responsible for adjusting the
    section contents as necessary, and (if using Rela relocs
    and generating a relocatable output file) adjusting the
    reloc addend as necessary.

    The back end routine does not have to worry about setting
    the reloc address or the reloc symbol index.

    The back end routine is given a pointer to the swapped in
    internal symbols, and can access the hash table entries
    for the external symbols via elf_sym_hashes (input_bfd).

    When generating relocatable output, the back end routine
    must handle STB_LOCAL/STT_SECTION symbols specially.  The
    output symbol is going to be a section symbol
    corresponding to the output section, which will require
    the addend to be adjusted.  */

 if (! (*relocate_section) (output_bfd, finfo->info,
		     input_bfd, o, contents,
		     internal_relocs,
		     isymbuf,
		     finfo->sections))
   return FALSE0;

 if (emit_relocs)
   {
     Elf_Internal_Rela *irela;
     Elf_Internal_Rela *irelaend;
     bfd_vma last_offset;
     struct elf_link_hash_entry **rel_hash;
     struct elf_link_hash_entry **rel_hash_list;
     Elf_Internal_Shdr *input_rel_hdr, *input_rel_hdr2;
     unsigned int next_erel;
     bfd_boolean rela_normal;

     input_rel_hdr = &elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr;
     rela_normal = (bed->rela_normal
	     && (input_rel_hdr->sh_entsize
		 == bed->s->sizeof_rela));

     /* Adjust the reloc addresses and symbol indices.  */

     irela = internal_relocs;
     irelaend = irela + o->reloc_count * bed->s->int_rels_per_ext_rel;
     rel_hash = (elf_section_data (o->output_section)((struct bfd_elf_section_data*)(o->output_section)->used_by_bfd
)->rel_hashes
	  + elf_section_data (o->output_section)((struct bfd_elf_section_data*)(o->output_section)->used_by_bfd
)->rel_count
	  + elf_section_data (o->output_section)((struct bfd_elf_section_data*)(o->output_section)->used_by_bfd
)->rel_count2);
     rel_hash_list = rel_hash;
     last_offset = o->output_offset;
     if (!finfo->info->relocatable)
last_offset += o->output_section->vma;
     for (next_erel = 0; irela < irelaend; irela++, next_erel++)
{
  unsigned long r_symndx;
  asection *sec;
  Elf_Internal_Sym sym;

  if (next_erel == bed->s->int_rels_per_ext_rel)
    {
      rel_hash++;
      next_erel = 0;
    }

  irela->r_offset = _bfd_elf_section_offset (output_bfd,
					     finfo->info, o,
					     irela->r_offset);
  if (irela->r_offset >= (bfd_vma) -2)
    {
      /* This is a reloc for a deleted entry or somesuch.
	 Turn it into an R_*_NONE reloc, at the same
	 offset as the last reloc.  elf_eh_frame.c and
	 elf_bfd_discard_info rely on reloc offsets
	 being ordered.  */
      irela->r_offset = last_offset;
      irela->r_info = 0;
      irela->r_addend = 0;
      continue;
    }

  irela->r_offset += o->output_offset;

  /* Relocs in an executable have to be virtual addresses.  */
  if (!finfo->info->relocatable)
    irela->r_offset += o->output_section->vma;

  last_offset = irela->r_offset;

  r_symndx = irela->r_info >> r_sym_shift;
  if (r_symndx == STN_UNDEF0)
    continue;

  if (r_symndx >= locsymcount
      || (elf_bad_symtab (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> bad_symtab)
	  && finfo->sections[r_symndx] == NULL((void*)0)))
    {
      struct elf_link_hash_entry *rh;
      unsigned long indx;

      /* This is a reloc against a global symbol.  We
	 have not yet output all the local symbols, so
	 we do not know the symbol index of any global
	 symbol.  We set the rel_hash entry for this
	 reloc to point to the global hash table entry
	 for this symbol.  The symbol index is then
	 set at the end of bfd_elf_final_link.  */
      indx = r_symndx - extsymoff;
      rh = elf_sym_hashes (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> sym_hashes)[indx];
      while (rh->root.type == bfd_link_hash_indirect
	     || rh->root.type == bfd_link_hash_warning)
	rh = (struct elf_link_hash_entry *) rh->root.u.i.link;

      /* Setting the index to -2 tells
	 elf_link_output_extsym that this symbol is
	 used by a reloc.  */
      BFD_ASSERT (rh->indx < 0)do { if (!(rh->indx < 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7626); } while (0);
      rh->indx = -2;

      *rel_hash = rh;

      continue;
    }

  /* This is a reloc against a local symbol.  */

  *rel_hash = NULL((void*)0);
  sym = isymbuf[r_symndx];
  sec = finfo->sections[r_symndx];
  if (ELF_ST_TYPE (sym.st_info)((sym.st_info) & 0xF) == STT_SECTION3)
    {
      /* I suppose the backend ought to fill in the
	 section of any STT_SECTION symbol against a
	 processor specific section.  */
      r_symndx = 0;
      if (bfd_is_abs_section (sec)((sec) == ((asection *) &bfd_abs_section)))
	;
      else if (sec == NULL((void*)0) || sec->owner == NULL((void*)0))
	{
	  bfd_set_error (bfd_error_bad_value);
	  return FALSE0;
	}
      else
	{
	  asection *osec = sec->output_section;

	  /* If we have discarded a section, the output
	     section will be the absolute section.  In
	     case of discarded link-once and discarded
	     SEC_MERGE sections, use the kept section.  */
	  if (bfd_is_abs_section (osec)((osec) == ((asection *) &bfd_abs_section))
	      && sec->kept_section != NULL((void*)0)
	      && sec->kept_section->output_section != NULL((void*)0))
	    {
	      osec = sec->kept_section->output_section;
	      irela->r_addend -= osec->vma;
	    }

	  if (!bfd_is_abs_section (osec)((osec) == ((asection *) &bfd_abs_section)))
	    {
	      r_symndx = osec->target_index;
	      BFD_ASSERT (r_symndx != 0)do { if (!(r_symndx != 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7671); } while (0);
	    }
	}

      /* Adjust the addend according to where the
	 section winds up in the output section.  */
      if (rela_normal)
	irela->r_addend += sec->output_offset;
    }
  else
    {
      if (finfo->indices[r_symndx] == -1)
	{
	  unsigned long shlink;
	  const char *name;
	  asection *osec;

	  if (finfo->info->strip == strip_all)
	    {
	      /* You can't do ld -r -s.  */
	      bfd_set_error (bfd_error_invalid_operation);
	      return FALSE0;
	    }

	  /* This symbol was skipped earlier, but
	     since it is needed by a reloc, we
	     must output it now.  */
	  shlink = symtab_hdr->sh_link;
	  name = (bfd_elf_string_from_elf_section
		  (input_bfd, shlink, sym.st_name));
	  if (name == NULL((void*)0))
	    return FALSE0;

	  osec = sec->output_section;
	  sym.st_shndx =
	    _bfd_elf_section_from_bfd_section (output_bfd,
					       osec);
	  if (sym.st_shndx == SHN_BAD((unsigned) -1))
	    return FALSE0;

	  sym.st_value += sec->output_offset;
	  if (! finfo->info->relocatable)
	    {
	      sym.st_value += osec->vma;
	      if (ELF_ST_TYPE (sym.st_info)((sym.st_info) & 0xF) == STT_TLS6)
		{
		  /* STT_TLS symbols are relative to PT_TLS
		     segment base.  */
		  BFD_ASSERT (elf_hash_table (finfo->info)do { if (!(((struct elf_link_hash_table *) ((finfo->info)->
hash)) ->tls_sec != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7720); } while (0)
			      ->tls_sec != NULL)do { if (!(((struct elf_link_hash_table *) ((finfo->info)->
hash)) ->tls_sec != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7720); } while (0);
		  sym.st_value -= (elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))
				   ->tls_sec->vma);
		}
	    }

	  finfo->indices[r_symndx]
	    = bfd_get_symcount (output_bfd)((output_bfd)->symcount);

	  if (! elf_link_output_sym (finfo, name, &sym, sec,
				     NULL((void*)0)))
	    return FALSE0;
	}

      r_symndx = finfo->indices[r_symndx];
    }

  irela->r_info = ((bfd_vma) r_symndx << r_sym_shift
		   | (irela->r_info & r_type_mask));
}

     /* Swap out the relocs.  */
     if (input_rel_hdr->sh_size != 0
  && !bed->elf_backend_emit_relocs (output_bfd, o,
				    input_rel_hdr,
				    internal_relocs,
				    rel_hash_list))
return FALSE0;

     input_rel_hdr2 = elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2;
     if (input_rel_hdr2 && input_rel_hdr2->sh_size != 0)
{
  internal_relocs += (NUM_SHDR_ENTRIES (input_rel_hdr)((input_rel_hdr)->sh_size / (input_rel_hdr)->sh_entsize
)
		      * bed->s->int_rels_per_ext_rel);
  rel_hash_list += NUM_SHDR_ENTRIES (input_rel_hdr)((input_rel_hdr)->sh_size / (input_rel_hdr)->sh_entsize
);
  if (!bed->elf_backend_emit_relocs (output_bfd, o,
				     input_rel_hdr2,
				     internal_relocs,
				     rel_hash_list))
    return FALSE0;
}
   }
}

    /* Write out the modified section contents.  */
    if (bed->elf_backend_write_section
 && (*bed->elf_backend_write_section) (output_bfd, o, contents))
{
 /* Section written out.  */
}
    else switch (o->sec_info_type)
{
case ELF_INFO_TYPE_STABS1:
 if (! (_bfd_write_section_stabs
 (output_bfd,
  &elf_hash_table (finfo->info)((struct elf_link_hash_table *) ((finfo->info)->hash))->stab_info,
  o, &elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->sec_info, contents)))
   return FALSE0;
 break;
case ELF_INFO_TYPE_MERGE2:
 if (! _bfd_write_merged_section (output_bfd, o,
			   elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->sec_info))
   return FALSE0;
 break;
case ELF_INFO_TYPE_EH_FRAME3:
 {
   if (! _bfd_elf_write_section_eh_frame (output_bfd, finfo->info,
				   o, contents))
     return FALSE0;
 }
 break;
default:
 {
   if (! (o->flags & SEC_EXCLUDE0x8000)
&& ! bfd_set_section_contents (output_bfd, o->output_section,
			       contents,
			       (file_ptr) o->output_offset,
			       o->size))
     return FALSE0;
 }
 break;
}
  }

return TRUE1;
7805}

7807/* Generate a reloc when linking an ELF file.  This is a reloc
 requested by the linker, and does not come from any input file.  This
 is used to build constructor and destructor tables when linking
 with -Ur.  */

7812static bfd_boolean
7813elf_reloc_link_order (bfd *output_bfd,
      struct bfd_link_info *info,
      asection *output_section,
      struct bfd_link_order *link_order)
7817{
reloc_howto_type *howto;
long indx;
bfd_vma offset;
bfd_vma addend;
struct elf_link_hash_entry **rel_hash_ptr;
Elf_Internal_Shdr *rel_hdr;
const struct elf_backend_data *bed = get_elf_backend_data (output_bfd)((const struct elf_backend_data *) (output_bfd)->xvec->
backend_data);
Elf_Internal_Rela irel[MAX_INT_RELS_PER_EXT_REL3];
bfd_byte *erel;
unsigned int i;

howto = bfd_reloc_type_lookup (output_bfd, link_order->u.reloc.p->reloc);
if (howto == NULL((void*)0))
  {
    bfd_set_error (bfd_error_bad_value);
    return FALSE0;
  }

addend = link_order->u.reloc.p->addend;

/* Figure out the symbol index.  */
rel_hash_ptr = (elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_hashes
  + elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_count
  + elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_count2);
if (link_order->type == bfd_section_reloc_link_order)
  {
    indx = link_order->u.reloc.p->u.section->target_index;
    BFD_ASSERT (indx != 0)do { if (!(indx != 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,7845); } while (0);
    *rel_hash_ptr = NULL((void*)0);
  }
else
  {
    struct elf_link_hash_entry *h;

    /* Treat a reloc against a defined symbol as though it were
actually against the section.  */
    h = ((struct elf_link_hash_entry *)
  bfd_wrapped_link_hash_lookup (output_bfd, info,
			 link_order->u.reloc.p->u.name,
			 FALSE0, FALSE0, TRUE1));
    if (h != NULL((void*)0)
 && (h->root.type == bfd_link_hash_defined
     || h->root.type == bfd_link_hash_defweak))
{
 asection *section;

 section = h->root.u.def.section;
 indx = section->output_section->target_index;
 *rel_hash_ptr = NULL((void*)0);
 /* It seems that we ought to add the symbol value to the
    addend here, but in practice it has already been added
    because it was passed to constructor_callback.  */
 addend += section->output_section->vma + section->output_offset;
}
    else if (h != NULL((void*)0))
{
 /* Setting the index to -2 tells elf_link_output_extsym that
    this symbol is used by a reloc.  */
 h->indx = -2;
 *rel_hash_ptr = h;
 indx = 0;
}
    else
{
 if (! ((*info->callbacks->unattached_reloc)
 (info, link_order->u.reloc.p->u.name, NULL((void*)0), NULL((void*)0), 0)))
   return FALSE0;
 indx = 0;
}
  }

/* If this is an inplace reloc, we must write the addend into the
   object file.  */
if (howto->partial_inplace && addend != 0)
  {
    bfd_size_type size;
    bfd_reloc_status_type rstat;
    bfd_byte *buf;
    bfd_boolean ok;
    const char *sym_name;

    size = bfd_get_reloc_size (howto);
    buf = bfd_zmalloc (size);
    if (buf == NULL((void*)0))
return FALSE0;
    rstat = _bfd_relocate_contents (howto, output_bfd, addend, buf);
    switch (rstat)
{
case bfd_reloc_ok:
 break;

default:
case bfd_reloc_outofrange:
 abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 7911, __PRETTY_FUNCTION__);

case bfd_reloc_overflow:
 if (link_order->type == bfd_section_reloc_link_order)
   sym_name = bfd_section_name (output_bfd,((link_order->u.reloc.p->u.section)->name)
			 link_order->u.reloc.p->u.section)((link_order->u.reloc.p->u.section)->name);
 else
   sym_name = link_order->u.reloc.p->u.name;
 if (! ((*info->callbacks->reloc_overflow)
 (info, NULL((void*)0), sym_name, howto->name, addend, NULL((void*)0),
  NULL((void*)0), (bfd_vma) 0)))
   {
     free (buf);
     return FALSE0;
   }
 break;
}
    ok = bfd_set_section_contents (output_bfd, output_section, buf,
		     link_order->offset, size);
    free (buf);
    if (! ok)
return FALSE0;
  }

/* The address of a reloc is relative to the section in a
   relocatable file, and is a virtual address in an executable
   file.  */
offset = link_order->offset;
if (! info->relocatable)
  offset += output_section->vma;

for (i = 0; i < bed->s->int_rels_per_ext_rel; i++)
  {
    irel[i].r_offset = offset;
    irel[i].r_info = 0;
    irel[i].r_addend = 0;
  }
if (bed->s->arch_size == 32)
  irel[0].r_info = ELF32_R_INFO (indx, howto->type)(((indx) << 8) + ((howto->type) & 0xff));
else
  irel[0].r_info = ELF64_R_INFO (indx, howto->type)(((bfd_vma) (indx) << 31 << 1) + (bfd_vma) (howto
->type));

rel_hdr = &elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_hdr;
erel = rel_hdr->contents;
if (rel_hdr->sh_type == SHT_REL9)
  {
    erel += (elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_count
      * bed->s->sizeof_rel);
    (*bed->s->swap_reloc_out) (output_bfd, irel, erel);
  }
else
  {
    irel[0].r_addend = addend;
    erel += (elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_count
      * bed->s->sizeof_rela);
    (*bed->s->swap_reloca_out) (output_bfd, irel, erel);
  }

++elf_section_data (output_section)((struct bfd_elf_section_data*)(output_section)->used_by_bfd
)->rel_count;

return TRUE1;
7972}


7975/* Get the output vma of the section pointed to by the sh_link field.  */

7977static bfd_vma
7978elf_get_linked_section_vma (struct bfd_link_order *p)
7979{
Elf_Internal_Shdr **elf_shdrp;
asection *s;
int elfsec;

s = p->u.indirect.section;
elf_shdrp = elf_elfsections (s->owner)(((s->owner) -> tdata.elf_obj_data) -> elf_sect_ptr);
elfsec = _bfd_elf_section_from_bfd_section (s->owner, s);
elfsec = elf_shdrp[elfsec]->sh_link;
/* PR 290:
   The Intel C compiler generates SHT_IA_64_UNWIND with
   SHF_LINK_ORDER.  But it doesn't set the sh_link or
   sh_info fields.  Hence we could get the situation
   where elfsec is 0.  */
if (elfsec == 0)
  {
    const struct elf_backend_data *bed
= get_elf_backend_data (s->owner)((const struct elf_backend_data *) (s->owner)->xvec->
backend_data);
    if (bed->link_order_error_handler)
bed->link_order_error_handler
 (_("%B: warning: sh_link not set for section `%A'")("%B: warning: sh_link not set for section `%A'"), s->owner, s);
    return 0;
  }
else
  {
    s = elf_shdrp[elfsec]->bfd_section;
    return s->output_section->vma + s->output_offset;
  }
8007}


8010/* Compare two sections based on the locations of the sections they are
 linked to.  Used by elf_fixup_link_order.  */

8013static int
8014compare_link_order (const void * a, const void * b)
8015{
bfd_vma apos;
bfd_vma bpos;

apos = elf_get_linked_section_vma (*(struct bfd_link_order **)a);
bpos = elf_get_linked_section_vma (*(struct bfd_link_order **)b);
if (apos < bpos)
  return -1;
return apos > bpos;
8024}


8027/* Looks for sections with SHF_LINK_ORDER set.  Rearranges them into the same
 order as their linked sections.  Returns false if this could not be done
 because an output section includes both ordered and unordered
 sections.  Ideally we'd do this in the linker proper.  */

8032static bfd_boolean
8033elf_fixup_link_order (bfd *abfd, asection *o)
8034{
int seen_linkorder;
int seen_other;
int n;
struct bfd_link_order *p;
bfd *sub;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
unsigned elfsec;
struct bfd_link_order **sections;
asection *s, *other_sec, *linkorder_sec;
bfd_vma offset;

other_sec = NULL((void*)0);
linkorder_sec = NULL((void*)0);
seen_other = 0;
seen_linkorder = 0;
for (p = o->map_head.link_order; p != NULL((void*)0); p = p->next)
  {
    if (p->type == bfd_indirect_link_order)
{
 s = p->u.indirect.section;
 sub = s->owner;
 if (bfd_get_flavour (sub)((sub)->xvec->flavour) == bfd_target_elf_flavour
     && elf_elfheader (sub)(((sub) -> tdata.elf_obj_data) -> elf_header)->e_ident[EI_CLASS4] == bed->s->elfclass
     && (elfsec = _bfd_elf_section_from_bfd_section (sub, s))
     && elfsec < elf_numsections (sub)(((sub) -> tdata.elf_obj_data) -> num_elf_sections)
     && elf_elfsections (sub)(((sub) -> tdata.elf_obj_data) -> elf_sect_ptr)[elfsec]->sh_flags & SHF_LINK_ORDER(1 << 7))
   {
     seen_linkorder++;
     linkorder_sec = s;
   }
 else
   {
     seen_other++;
     other_sec = s;
   }
}
    else
seen_other++;

    if (seen_other && seen_linkorder)
{
 if (other_sec && linkorder_sec)
   (*_bfd_error_handler) (_("%A has both ordered [`%A' in %B] and unordered [`%A' in %B] sections")("%A has both ordered [`%A' in %B] and unordered [`%A' in %B] sections"
),
		   o, linkorder_sec,
		   linkorder_sec->owner, other_sec,
		   other_sec->owner);
 else
   (*_bfd_error_handler) (_("%A has both ordered and unordered sections")("%A has both ordered and unordered sections"),
		   o);
 bfd_set_error (bfd_error_bad_value);
 return FALSE0;
}
  }

if (!seen_linkorder)
  return TRUE1;

sections = (struct bfd_link_order **)
  xmalloc (seen_linkorder * sizeof (struct bfd_link_order *));
seen_linkorder = 0;

for (p = o->map_head.link_order; p != NULL((void*)0); p = p->next)
  {
    sections[seen_linkorder++] = p;
  }
/* Sort the input sections in the order of their linked section.  */
qsort (sections, seen_linkorder, sizeof (struct bfd_link_order *),
compare_link_order);

/* Change the offsets of the sections.  */
offset = 0;
for (n = 0; n < seen_linkorder; n++)
  {
    s = sections[n]->u.indirect.section;
    offset &= ~(bfd_vma)((1 << s->alignment_power) - 1);
    s->output_offset = offset;
    sections[n]->offset = offset;
    offset += sections[n]->size;
  }

return TRUE1;
8116}


8119/* Do the final step of an ELF link.  */

8121bfd_boolean
8122bfd_elf_final_link (bfd *abfd, struct bfd_link_info *info)
8123{
bfd_boolean dynamic;
bfd_boolean emit_relocs;
bfd *dynobj;
struct elf_final_link_info finfo;
register asection *o;
register struct bfd_link_order *p;
register bfd *sub;
bfd_size_type max_contents_size;
bfd_size_type max_external_reloc_size;
bfd_size_type max_internal_reloc_count;
bfd_size_type max_sym_count;
bfd_size_type max_sym_shndx_count;
file_ptr off;
Elf_Internal_Sym elfsym;
unsigned int i;
Elf_Internal_Shdr *symtab_hdr;
Elf_Internal_Shdr *symtab_shndx_hdr;
Elf_Internal_Shdr *symstrtab_hdr;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
struct elf_outext_info eoinfo;
bfd_boolean merged;
size_t relativecount = 0;
asection *reldyn = 0;
bfd_size_type amt;

if (! is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return FALSE0;

if (info->shared)
  abfd->flags |= DYNAMIC0x40;

dynamic = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created;
dynobj = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynobj;

emit_relocs = (info->relocatable
 || info->emitrelocations);

finfo.info = info;
finfo.output_bfd = abfd;
finfo.symstrtab = _bfd_elf_stringtab_init ();
if (finfo.symstrtab == NULL((void*)0))
  return FALSE0;

if (! dynamic)
  {
    finfo.dynsym_sec = NULL((void*)0);
    finfo.hash_sec = NULL((void*)0);
    finfo.symver_sec = NULL((void*)0);
  }
else
  {
    finfo.dynsym_sec = bfd_get_section_by_name (dynobj, ".dynsym");
    finfo.hash_sec = bfd_get_section_by_name (dynobj, ".hash");
    BFD_ASSERT (finfo.dynsym_sec != NULL)do { if (!(finfo.dynsym_sec != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8177); } while (0);
    finfo.symver_sec = bfd_get_section_by_name (dynobj, ".gnu.version");
    /* Note that it is OK if symver_sec is NULL.  */
  }

finfo.contents = NULL((void*)0);
finfo.external_relocs = NULL((void*)0);
finfo.internal_relocs = NULL((void*)0);
finfo.external_syms = NULL((void*)0);
finfo.locsym_shndx = NULL((void*)0);
finfo.internal_syms = NULL((void*)0);
finfo.indices = NULL((void*)0);
finfo.sections = NULL((void*)0);
finfo.symbuf = NULL((void*)0);
finfo.symshndxbuf = NULL((void*)0);
finfo.symbuf_count = 0;
finfo.shndxbuf_size = 0;

/* Count up the number of relocations we will output for each output
   section, so that we know the sizes of the reloc sections.  We
   also figure out some maximum sizes.  */
max_contents_size = 0;
max_external_reloc_size = 0;
max_internal_reloc_count = 0;
max_sym_count = 0;
max_sym_shndx_count = 0;
merged = FALSE0;
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    struct bfd_elf_section_data *esdo = elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd);
    o->reloc_count = 0;

    for (p = o->map_head.link_order; p != NULL((void*)0); p = p->next)
{
 unsigned int reloc_count = 0;
 struct bfd_elf_section_data *esdi = NULL((void*)0);
 unsigned int *rel_count1;

 if (p->type == bfd_section_reloc_link_order
     || p->type == bfd_symbol_reloc_link_order)
   reloc_count = 1;
 else if (p->type == bfd_indirect_link_order)
   {
     asection *sec;

     sec = p->u.indirect.section;
     esdi = elf_section_data (sec)((struct bfd_elf_section_data*)(sec)->used_by_bfd);

     /* Mark all sections which are to be included in the
 link.  This will normally be every section.  We need
 to do this so that we can identify any sections which
 the linker has decided to not include.  */
     sec->linker_mark = TRUE1;

     if (sec->flags & SEC_MERGE0x1000000)
merged = TRUE1;

     if (info->relocatable || info->emitrelocations)
reloc_count = sec->reloc_count;
     else if (bed->elf_backend_count_relocs)
{
  Elf_Internal_Rela * relocs;

  relocs = _bfd_elf_link_read_relocs (abfd, sec, NULL((void*)0), NULL((void*)0),
				      info->keep_memory);

  reloc_count = (*bed->elf_backend_count_relocs) (sec, relocs);

  if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->relocs != relocs)
    free (relocs);
}

     if (sec->rawsize > max_contents_size)
max_contents_size = sec->rawsize;
     if (sec->size > max_contents_size)
max_contents_size = sec->size;

     /* We are interested in just local symbols, not all
 symbols.  */
     if (bfd_get_flavour (sec->owner)((sec->owner)->xvec->flavour) == bfd_target_elf_flavour
  && (sec->owner->flags & DYNAMIC0x40) == 0)
{
  size_t sym_count;

  if (elf_bad_symtab (sec->owner)(((sec->owner) -> tdata.elf_obj_data) -> bad_symtab))
    sym_count = (elf_tdata (sec->owner)((sec->owner) -> tdata.elf_obj_data)->symtab_hdr.sh_size
		 / bed->s->sizeof_sym);
  else
    sym_count = elf_tdata (sec->owner)((sec->owner) -> tdata.elf_obj_data)->symtab_hdr.sh_info;

  if (sym_count > max_sym_count)
    max_sym_count = sym_count;

  if (sym_count > max_sym_shndx_count
      && elf_symtab_shndx (sec->owner)(((sec->owner) -> tdata.elf_obj_data) -> symtab_shndx_section
) != 0)
    max_sym_shndx_count = sym_count;

  if ((sec->flags & SEC_RELOC0x004) != 0)
    {
      size_t ext_size;

      ext_size = elf_section_data (sec)((struct bfd_elf_section_data*)(sec)->used_by_bfd)->rel_hdr.sh_size;
      if (ext_size > max_external_reloc_size)
	max_external_reloc_size = ext_size;
      if (sec->reloc_count > max_internal_reloc_count)
	max_internal_reloc_count = sec->reloc_count;
    }
}
   }

 if (reloc_count == 0)
   continue;

 o->reloc_count += reloc_count;

 /* MIPS may have a mix of REL and RELA relocs on sections.
    To support this curious ABI we keep reloc counts in
    elf_section_data too.  We must be careful to add the
    relocations from the input section to the right output
    count.  FIXME: Get rid of one count.  We have
    o->reloc_count == esdo->rel_count + esdo->rel_count2.  */
 rel_count1 = &esdo->rel_count;
 if (esdi != NULL((void*)0))
   {
     bfd_boolean same_size;
     bfd_size_type entsize1;

     entsize1 = esdi->rel_hdr.sh_entsize;
     BFD_ASSERT (entsize1 == bed->s->sizeof_reldo { if (!(entsize1 == bed->s->sizeof_rel || entsize1 ==
 bed->s->sizeof_rela)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8306); } while (0)
	  || entsize1 == bed->s->sizeof_rela)do { if (!(entsize1 == bed->s->sizeof_rel || entsize1 ==
 bed->s->sizeof_rela)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8306); } while (0);
     same_size = !o->use_rela_p == (entsize1 == bed->s->sizeof_rel);

     if (!same_size)
rel_count1 = &esdo->rel_count2;

     if (esdi->rel_hdr2 != NULL((void*)0))
{
  bfd_size_type entsize2 = esdi->rel_hdr2->sh_entsize;
  unsigned int alt_count;
  unsigned int *rel_count2;

  BFD_ASSERT (entsize2 != entsize1do { if (!(entsize2 != entsize1 && (entsize2 == bed->
s->sizeof_rel || entsize2 == bed->s->sizeof_rela))) bfd_assert
("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c",8320); } while
 (0)
	      && (entsize2 == bed->s->sizeof_reldo { if (!(entsize2 != entsize1 && (entsize2 == bed->
s->sizeof_rel || entsize2 == bed->s->sizeof_rela))) bfd_assert
("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c",8320); } while
 (0)
		  || entsize2 == bed->s->sizeof_rela))do { if (!(entsize2 != entsize1 && (entsize2 == bed->
s->sizeof_rel || entsize2 == bed->s->sizeof_rela))) bfd_assert
("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c",8320); } while
 (0);

  rel_count2 = &esdo->rel_count2;
  if (!same_size)
    rel_count2 = &esdo->rel_count;

  /* The following is probably too simplistic if the
     backend counts output relocs unusually.  */
  BFD_ASSERT (bed->elf_backend_count_relocs == NULL)do { if (!(bed->elf_backend_count_relocs == ((void*)0))) bfd_assert
("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c",8328); } while
 (0);
  alt_count = NUM_SHDR_ENTRIES (esdi->rel_hdr2)((esdi->rel_hdr2)->sh_size / (esdi->rel_hdr2)->sh_entsize
);
  *rel_count2 += alt_count;
  reloc_count -= alt_count;
}
   }
 *rel_count1 += reloc_count;
}

    if (o->reloc_count > 0)
o->flags |= SEC_RELOC0x004;
    else
{
 /* Explicitly clear the SEC_RELOC flag.  The linker tends to
    set it (this is probably a bug) and if it is set
    assign_section_numbers will create a reloc section.  */
 o->flags &=~ SEC_RELOC0x004;
}

    /* If the SEC_ALLOC flag is not set, force the section VMA to
zero.  This is done in elf_fake_sections as well, but forcing
the VMA to 0 here will ensure that relocs against these
sections are handled correctly.  */
    if ((o->flags & SEC_ALLOC0x001) == 0
 && ! o->user_set_vma)
o->vma = 0;
  }

if (! info->relocatable && merged)
  elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_sec_merge_syms), (abfd)))
	    _bfd_elf_link_sec_merge_syms, abfd)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (_bfd_elf_link_sec_merge_syms), (abfd)));

/* Figure out the file positions for everything but the symbol table
   and the relocs.  We set symcount to force assign_section_numbers
   to create a symbol table.  */
bfd_get_symcount (abfd)((abfd)->symcount) = info->strip == strip_all ? 0 : 1;
BFD_ASSERT (! abfd->output_has_begun)do { if (!(! abfd->output_has_begun)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8364); } while (0);
if (! _bfd_elf_compute_section_file_positions (abfd, info))
  goto error_return;

/* Set sizes, and assign file positions for reloc sections.  */
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    if ((o->flags & SEC_RELOC0x004) != 0)
{
 if (!(_bfd_elf_link_size_reloc_section
(abfd, &elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr, o)))
   goto error_return;

 if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2
     && !(_bfd_elf_link_size_reloc_section
   (abfd, elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2, o)))
   goto error_return;
}

    /* Now, reset REL_COUNT and REL_COUNT2 so that we can use them
to count upwards while actually outputting the relocations.  */
    elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count = 0;
    elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count2 = 0;
  }

_bfd_elf_assign_file_positions_for_relocs (abfd);

/* We have now assigned file positions for all the sections except
   .symtab and .strtab.  We start the .symtab section at the current
   file position, and write directly to it.  We build the .strtab
   section in memory.  */
bfd_get_symcount (abfd)((abfd)->symcount) = 0;
symtab_hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_hdr;
/* sh_name is set in prep_headers.  */
symtab_hdr->sh_type = SHT_SYMTAB2;
/* sh_flags, sh_addr and sh_size all start off zero.  */
symtab_hdr->sh_entsize = bed->s->sizeof_sym;
/* sh_link is set in assign_section_numbers.  */
/* sh_info is set below.  */
/* sh_offset is set just below.  */
symtab_hdr->sh_addralign = 1 << bed->s->log_file_align;

off = elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->next_file_pos;
off = _bfd_elf_assign_file_position_for_section (symtab_hdr, off, TRUE1);

/* Note that at this point elf_tdata (abfd)->next_file_pos is
   incorrect.  We do not yet know the size of the .symtab section.
   We correct next_file_pos below, after we do know the size.  */

/* Allocate a buffer to hold swapped out symbols.  This is to avoid
   continuously seeking to the right position in the file.  */
if (! info->keep_memory || max_sym_count < 20)
  finfo.symbuf_size = 20;
else
  finfo.symbuf_size = max_sym_count;
amt = finfo.symbuf_size;
amt *= bed->s->sizeof_sym;
finfo.symbuf = bfd_malloc (amt);
if (finfo.symbuf == NULL((void*)0))
  goto error_return;
if (elf_numsections (abfd)(((abfd) -> tdata.elf_obj_data) -> num_elf_sections) > SHN_LORESERVE0xFF00)
  {
    /* Wild guess at number of output symbols.  realloc'd as needed.  */
    amt = 2 * max_sym_count + elf_numsections (abfd)(((abfd) -> tdata.elf_obj_data) -> num_elf_sections) + 1000;
    finfo.shndxbuf_size = amt;
    amt *= sizeof (Elf_External_Sym_Shndx);
    finfo.symshndxbuf = bfd_zmalloc (amt);
    if (finfo.symshndxbuf == NULL((void*)0))
goto error_return;
  }

/* Start writing out the symbol table.  The first symbol is always a
   dummy symbol.  */
if (info->strip != strip_all
    || emit_relocs)
  {
    elfsym.st_value = 0;
    elfsym.st_size = 0;
    elfsym.st_info = 0;
    elfsym.st_other = 0;
    elfsym.st_shndx = SHN_UNDEF0;
    if (! elf_link_output_sym (&finfo, NULL((void*)0), &elfsym, bfd_und_section_ptr((asection *) &bfd_und_section),
		 NULL((void*)0)))
goto error_return;
  }

/* Output a symbol for each section.  We output these even if we are
   discarding local symbols, since they are used for relocs.  These
   symbols have no names.  We store the index of each one in the
   index field of the section, so that we can find it again when
   outputting relocs.  */
if (info->strip != strip_all
    || emit_relocs)
  {
    elfsym.st_size = 0;
    elfsym.st_info = ELF_ST_INFO (STB_LOCAL, STT_SECTION)(((0) << 4) + ((3) & 0xF));
    elfsym.st_other = 0;
    for (i = 1; i < elf_numsections (abfd)(((abfd) -> tdata.elf_obj_data) -> num_elf_sections); i++)
{
 o = bfd_section_from_elf_index (abfd, i);
 if (o != NULL((void*)0))
   o->target_index = bfd_get_symcount (abfd)((abfd)->symcount);
 elfsym.st_shndx = i;
 if (info->relocatable || o == NULL((void*)0))
   elfsym.st_value = 0;
 else
   elfsym.st_value = o->vma;
 if (! elf_link_output_sym (&finfo, NULL((void*)0), &elfsym, o, NULL((void*)0)))
   goto error_return;
 if (i == SHN_LORESERVE0xFF00 - 1)
   i += SHN_HIRESERVE0xFFFF + 1 - SHN_LORESERVE0xFF00;
}
  }

/* Allocate some memory to hold information read in from the input
   files.  */
if (max_contents_size != 0)
  {
    finfo.contents = bfd_malloc (max_contents_size);
    if (finfo.contents == NULL((void*)0))
goto error_return;
  }

if (max_external_reloc_size != 0)
  {
    finfo.external_relocs = bfd_malloc (max_external_reloc_size);
    if (finfo.external_relocs == NULL((void*)0))
goto error_return;
  }

if (max_internal_reloc_count != 0)
  {
    amt = max_internal_reloc_count * bed->s->int_rels_per_ext_rel;
    amt *= sizeof (Elf_Internal_Rela);
    finfo.internal_relocs = bfd_malloc (amt);
    if (finfo.internal_relocs == NULL((void*)0))
goto error_return;
  }

if (max_sym_count != 0)
  {
    amt = max_sym_count * bed->s->sizeof_sym;
    finfo.external_syms = bfd_malloc (amt);
    if (finfo.external_syms == NULL((void*)0))
goto error_return;

    amt = max_sym_count * sizeof (Elf_Internal_Sym);
    finfo.internal_syms = bfd_malloc (amt);
    if (finfo.internal_syms == NULL((void*)0))
goto error_return;

    amt = max_sym_count * sizeof (long);
    finfo.indices = bfd_malloc (amt);
    if (finfo.indices == NULL((void*)0))
goto error_return;

    amt = max_sym_count * sizeof (asection *);
    finfo.sections = bfd_malloc (amt);
    if (finfo.sections == NULL((void*)0))
goto error_return;
  }

if (max_sym_shndx_count != 0)
  {
    amt = max_sym_shndx_count * sizeof (Elf_External_Sym_Shndx);
    finfo.locsym_shndx = bfd_malloc (amt);
    if (finfo.locsym_shndx == NULL((void*)0))
goto error_return;
  }

if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->tls_sec)
  {
    bfd_vma base, end = 0;
    asection *sec;

    for (sec = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->tls_sec;
  sec && (sec->flags & SEC_THREAD_LOCAL0x400);
  sec = sec->next)
{
 bfd_size_type size = sec->size;

 if (size == 0
     && (sec->flags & SEC_HAS_CONTENTS0x100) == 0)
   {
     struct bfd_link_order *o = sec->map_tail.link_order;
     if (o != NULL((void*)0))
size = o->offset + o->size;
   }
 end = sec->vma + size;
}
    base = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->tls_sec->vma;
    end = align_power (end, elf_hash_table (info)->tls_sec->alignment_power)(((end) + ((bfd_vma) 1 << (((struct elf_link_hash_table
 *) ((info)->hash))->tls_sec->alignment_power)) - 1)
 & ((bfd_vma) -1 << (((struct elf_link_hash_table *
) ((info)->hash))->tls_sec->alignment_power)));
    elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->tls_size = end - base;
  }

/* Reorder SHF_LINK_ORDER sections.  */
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    if (!elf_fixup_link_order (abfd, o))
return FALSE0;
  }

/* Since ELF permits relocations to be against local symbols, we
   must have the local symbols available when we do the relocations.
   Since we would rather only read the local symbols once, and we
   would rather not keep them in memory, we handle all the
   relocations for a single input file at the same time.

   Unfortunately, there is no way to know the total number of local
   symbols until we have seen all of them, and the local symbol
   indices precede the global symbol indices.  This means that when
   we are generating relocatable output, and we see a reloc against
   a global symbol, we can not know the symbol index until we have
   finished examining all the local symbols to see which ones we are
   going to output.  To deal with this, we keep the relocations in
   memory, and don't output them until the end of the link.  This is
   an unfortunate waste of memory, but I don't see a good way around
   it.  Fortunately, it only happens when performing a relocatable
   link, which is not the common case.  FIXME: If keep_memory is set
   we could write the relocs out and then read them again; I don't
   know how bad the memory loss will be.  */

for (sub = info->input_bfds; sub != NULL((void*)0); sub = sub->link_next)
  sub->output_has_begun = FALSE0;
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    for (p = o->map_head.link_order; p != NULL((void*)0); p = p->next)
{
 if (p->type == bfd_indirect_link_order
     && (bfd_get_flavour ((sub = p->u.indirect.section->owner))(((sub = p->u.indirect.section->owner))->xvec->flavour
)
  == bfd_target_elf_flavour)
     && elf_elfheader (sub)(((sub) -> tdata.elf_obj_data) -> elf_header)->e_ident[EI_CLASS4] == bed->s->elfclass)
   {
     if (! sub->output_has_begun)
{
  if (! elf_link_input_bfd (&finfo, sub))
    goto error_return;
  sub->output_has_begun = TRUE1;
}
   }
 else if (p->type == bfd_section_reloc_link_order
   || p->type == bfd_symbol_reloc_link_order)
   {
     if (! elf_reloc_link_order (abfd, info, o, p))
goto error_return;
   }
 else
   {
     if (! _bfd_default_link_order (abfd, info, o, p))
goto error_return;
   }
}
  }

/* Free symbol buffer if needed.  */
if (!info->reduce_memory_overheads)
  {
    for (sub = info->input_bfds; sub != NULL((void*)0); sub = sub->link_next)
      {
        if (bfd_get_flavour (sub)((sub)->xvec->flavour) == bfd_target_elf_flavour)
          {
            free (elf_tdata (sub)((sub) -> tdata.elf_obj_data)->symbuf);
            elf_tdata (sub)((sub) -> tdata.elf_obj_data)->symbuf = NULL((void*)0);
          }
      }
  }

/* Output any global symbols that got converted to local in a
   version script or due to symbol visibility.  We do this in a
   separate step since ELF requires all local symbols to appear
   prior to any global symbols.  FIXME: We should only do this if
   some global symbols were, in fact, converted to become local.
   FIXME: Will this work correctly with the Irix 5 linker?  */
eoinfo.failed = FALSE0;
eoinfo.finfo = &finfo;
eoinfo.localsyms = TRUE1;
elf_link_hash_traverse (elf_hash_table (info), elf_link_output_extsym,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_output_extsym), (&eoinfo)))
	  &eoinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_output_extsym), (&eoinfo)));
if (eoinfo.failed)
  return FALSE0;

/* That wrote out all the local symbols.  Finish up the symbol table
   with the global symbols. Even if we want to strip everything we
   can, we still need to deal with those global symbols that got
   converted to local in a version script.  */

/* The sh_info field records the index of the first non local symbol.  */
symtab_hdr->sh_info = bfd_get_symcount (abfd)((abfd)->symcount);

if (dynamic
    && finfo.dynsym_sec->output_section != bfd_abs_section_ptr((asection *) &bfd_abs_section))
  {
    Elf_Internal_Sym sym;
    bfd_byte *dynsym = finfo.dynsym_sec->contents;
    long last_local = 0;

    /* Write out the section symbols for the output sections.  */
    if (info->shared || elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->is_relocatable_executable)
{
 asection *s;

 sym.st_size = 0;
 sym.st_name = 0;
 sym.st_info = ELF_ST_INFO (STB_LOCAL, STT_SECTION)(((0) << 4) + ((3) & 0xF));
 sym.st_other = 0;

 for (s = abfd->sections; s != NULL((void*)0); s = s->next)
   {
     int indx;
     bfd_byte *dest;
     long dynindx;

     dynindx = elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->dynindx;
     if (dynindx <= 0)
continue;
     indx = elf_section_data (s)((struct bfd_elf_section_data*)(s)->used_by_bfd)->this_idx;
     BFD_ASSERT (indx > 0)do { if (!(indx > 0)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8680); } while (0);
     sym.st_shndx = indx;
     if (! check_dynsym (abfd, &sym))
return FALSE0;
     sym.st_value = s->vma;
     dest = dynsym + dynindx * bed->s->sizeof_sym;
     if (last_local < dynindx)
last_local = dynindx;
     bed->s->swap_symbol_out (abfd, &sym, dest, 0);
   }
}

    /* Write out the local dynsyms.  */
    if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynlocal)
{
 struct elf_link_local_dynamic_entry *e;
 for (e = elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynlocal; e ; e = e->next)
   {
     asection *s;
     bfd_byte *dest;

     sym.st_size = e->isym.st_size;
     sym.st_other = e->isym.st_other;

     /* Copy the internal symbol as is.
 Note that we saved a word of storage and overwrote
 the original st_name with the dynstr_index.  */
     sym = e->isym;

     if (e->isym.st_shndx != SHN_UNDEF0
  && (e->isym.st_shndx < SHN_LORESERVE0xFF00
      || e->isym.st_shndx > SHN_HIRESERVE0xFFFF))
{
  s = bfd_section_from_elf_index (e->input_bfd,
				  e->isym.st_shndx);

  sym.st_shndx =
    elf_section_data (s->output_section)((struct bfd_elf_section_data*)(s->output_section)->used_by_bfd
)->this_idx;
  if (! check_dynsym (abfd, &sym))
    return FALSE0;
  sym.st_value = (s->output_section->vma
		  + s->output_offset
		  + e->isym.st_value);
}

     if (last_local < e->dynindx)
last_local = e->dynindx;

     dest = dynsym + e->dynindx * bed->s->sizeof_sym;
     bed->s->swap_symbol_out (abfd, &sym, dest, 0);
   }
}

    elf_section_data (finfo.dynsym_sec->output_section)((struct bfd_elf_section_data*)(finfo.dynsym_sec->output_section
)->used_by_bfd)->this_hdr.sh_info =
last_local + 1;
  }

/* We get the global symbols from the hash table.  */
eoinfo.failed = FALSE0;
eoinfo.localsyms = FALSE0;
eoinfo.finfo = &finfo;
elf_link_hash_traverse (elf_hash_table (info), elf_link_output_extsym,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_output_extsym), (&eoinfo)))
	  &eoinfo)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_link_output_extsym), (&eoinfo)));
if (eoinfo.failed)
  return FALSE0;

/* If backend needs to output some symbols not present in the hash
   table, do it now.  */
if (bed->elf_backend_output_arch_syms)
  {
    typedef bfd_boolean (*out_sym_func)
(void *, const char *, Elf_Internal_Sym *, asection *,
struct elf_link_hash_entry *);

    if (! ((*bed->elf_backend_output_arch_syms)
    (abfd, info, &finfo, (out_sym_func) elf_link_output_sym)))
return FALSE0;
  }

/* Flush all symbols to the file.  */
if (! elf_link_flush_output_syms (&finfo, bed))
  return FALSE0;

/* Now we know the size of the symtab section.  */
off += symtab_hdr->sh_size;

symtab_shndx_hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_shndx_hdr;
if (symtab_shndx_hdr->sh_name != 0)
  {
    symtab_shndx_hdr->sh_type = SHT_SYMTAB_SHNDX18;
    symtab_shndx_hdr->sh_entsize = sizeof (Elf_External_Sym_Shndx);
    symtab_shndx_hdr->sh_addralign = sizeof (Elf_External_Sym_Shndx);
    amt = bfd_get_symcount (abfd)((abfd)->symcount) * sizeof (Elf_External_Sym_Shndx);
    symtab_shndx_hdr->sh_size = amt;

    off = _bfd_elf_assign_file_position_for_section (symtab_shndx_hdr,
				       off, TRUE1);

    if (bfd_seek (abfd, symtab_shndx_hdr->sh_offset, SEEK_SET0) != 0
 || (bfd_bwrite (finfo.symshndxbuf, amt, abfd) != amt))
return FALSE0;
  }


/* Finish up and write out the symbol string table (.strtab)
   section.  */
symstrtab_hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->strtab_hdr;
/* sh_name was set in prep_headers.  */
symstrtab_hdr->sh_type = SHT_STRTAB3;
symstrtab_hdr->sh_flags = 0;
symstrtab_hdr->sh_addr = 0;
symstrtab_hdr->sh_size = _bfd_stringtab_size (finfo.symstrtab);
symstrtab_hdr->sh_entsize = 0;
symstrtab_hdr->sh_link = 0;
symstrtab_hdr->sh_info = 0;
/* sh_offset is set just below.  */
symstrtab_hdr->sh_addralign = 1;

off = _bfd_elf_assign_file_position_for_section (symstrtab_hdr, off, TRUE1);
elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->next_file_pos = off;

if (bfd_get_symcount (abfd)((abfd)->symcount) > 0)
  {
    if (bfd_seek (abfd, symstrtab_hdr->sh_offset, SEEK_SET0) != 0
 || ! _bfd_stringtab_emit (abfd, finfo.symstrtab))
return FALSE0;
  }

/* Adjust the relocs to have the correct symbol indices.  */
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    if ((o->flags & SEC_RELOC0x004) == 0)
continue;

    elf_link_adjust_relocs (abfd, &elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr,
	      elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count,
	      elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes);
    if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2 != NULL((void*)0))
elf_link_adjust_relocs (abfd, elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hdr2,
		elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count2,
		(elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes
		 + elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_count));

    /* Set the reloc_count field to 0 to prevent write_relocs from
trying to swap the relocs out itself.  */
    o->reloc_count = 0;
  }

if (dynamic && info->combreloc && dynobj != NULL((void*)0))
  relativecount = elf_link_sort_relocs (abfd, info, &reldyn);

/* If we are linking against a dynamic object, or generating a
   shared library, finish up the dynamic linking information.  */
if (dynamic)
  {
    bfd_byte *dyncon, *dynconend;

    /* Fix up .dynamic entries.  */
    o = bfd_get_section_by_name (dynobj, ".dynamic");
    BFD_ASSERT (o != NULL)do { if (!(o != ((void*)0))) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,8839); } while (0);

    dyncon = o->contents;
    dynconend = o->contents + o->size;
    for (; dyncon < dynconend; dyncon += bed->s->sizeof_dyn)
{
 Elf_Internal_Dyn dyn;
 const char *name;
 unsigned int type;

 bed->s->swap_dyn_in (dynobj, dyncon, &dyn);

 switch (dyn.d_tag)
   {
   default:
     continue;
   case DT_NULL0:
     if (relativecount > 0 && dyncon + bed->s->sizeof_dyn < dynconend)
{
  switch (elf_section_data (reldyn)((struct bfd_elf_section_data*)(reldyn)->used_by_bfd)->this_hdr.sh_type)
    {
    case SHT_REL9: dyn.d_tag = DT_RELCOUNT0x6ffffffa; break;
    case SHT_RELA4: dyn.d_tag = DT_RELACOUNT0x6ffffff9; break;
    default: continue;
    }
  dyn.d_un.d_val = relativecount;
  relativecount = 0;
  break;
}
     continue;

   case DT_INIT12:
     name = info->init_function;
     goto get_sym;
   case DT_FINI13:
     name = info->fini_function;
   get_sym:
     {
struct elf_link_hash_entry *h;

h = elf_link_hash_lookup (elf_hash_table (info), name,((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (0), (0), (1)))
			  FALSE, FALSE, TRUE)((struct elf_link_hash_entry *) bfd_link_hash_lookup (&((
(struct elf_link_hash_table *) ((info)->hash)))->root, (
name), (0), (0), (1)));
if (h != NULL((void*)0)
    && (h->root.type == bfd_link_hash_defined
	|| h->root.type == bfd_link_hash_defweak))
  {
    dyn.d_un.d_val = h->root.u.def.value;
    o = h->root.u.def.section;
    if (o->output_section != NULL((void*)0))
      dyn.d_un.d_val += (o->output_section->vma
			 + o->output_offset);
    else
      {
	/* The symbol is imported from another shared
	   library and does not apply to this one.  */
	dyn.d_un.d_val = 0;
      }
    break;
  }
     }
     continue;

   case DT_PREINIT_ARRAYSZ33:
     name = ".preinit_array";
     goto get_size;
   case DT_INIT_ARRAYSZ27:
     name = ".init_array";
     goto get_size;
   case DT_FINI_ARRAYSZ28:
     name = ".fini_array";
   get_size:
     o = bfd_get_section_by_name (abfd, name);
     if (o == NULL((void*)0))
{
  (*_bfd_error_handler)
    (_("%B: could not find output section %s")("%B: could not find output section %s"), abfd, name);
  goto error_return;
}
     if (o->size == 0)
(*_bfd_error_handler)
  (_("warning: %s section has zero size")("warning: %s section has zero size"), name);
     dyn.d_un.d_val = o->size;
     break;

   case DT_PREINIT_ARRAY32:
     name = ".preinit_array";
     goto get_vma;
   case DT_INIT_ARRAY25:
     name = ".init_array";
     goto get_vma;
   case DT_FINI_ARRAY26:
     name = ".fini_array";
     goto get_vma;

   case DT_HASH4:
     name = ".hash";
     goto get_vma;
   case DT_GNU_HASH0x6ffffef5:
     name = ".gnu.hash";
     goto get_vma;
   case DT_STRTAB5:
     name = ".dynstr";
     goto get_vma;
   case DT_SYMTAB6:
     name = ".dynsym";
     goto get_vma;
   case DT_VERDEF0x6ffffffc:
     name = ".gnu.version_d";
     goto get_vma;
   case DT_VERNEED0x6ffffffe:
     name = ".gnu.version_r";
     goto get_vma;
   case DT_VERSYM0x6ffffff0:
     name = ".gnu.version";
   get_vma:
     o = bfd_get_section_by_name (abfd, name);
     if (o == NULL((void*)0))
{
  (*_bfd_error_handler)
    (_("%B: could not find output section %s")("%B: could not find output section %s"), abfd, name);
  goto error_return;
}
     dyn.d_un.d_ptr = o->vma;
     break;

   case DT_REL17:
   case DT_RELA7:
   case DT_RELSZ18:
   case DT_RELASZ8:
     if (dyn.d_tag == DT_REL17 || dyn.d_tag == DT_RELSZ18)
type = SHT_REL9;
     else
type = SHT_RELA4;
     dyn.d_un.d_val = 0;
     for (i = 1; i < elf_numsections (abfd)(((abfd) -> tdata.elf_obj_data) -> num_elf_sections); i++)
{
  Elf_Internal_Shdr *hdr;

  hdr = elf_elfsections (abfd)(((abfd) -> tdata.elf_obj_data) -> elf_sect_ptr)[i];
  if (hdr->sh_type == type
      && (hdr->sh_flags & SHF_ALLOC(1 << 1)) != 0)
    {
      if (dyn.d_tag == DT_RELSZ18 || dyn.d_tag == DT_RELASZ8)
	dyn.d_un.d_val += hdr->sh_size;
      else
	{
	  if (dyn.d_un.d_val == 0
	      || hdr->sh_addr < dyn.d_un.d_val)
	    dyn.d_un.d_val = hdr->sh_addr;
	}
    }
}
     break;
   }
 bed->s->swap_dyn_out (dynobj, &dyn, dyncon);
}
  }

/* If we have created any dynamic sections, then output them.  */
if (dynobj != NULL((void*)0))
  {
    if (! (*bed->elf_backend_finish_dynamic_sections) (abfd, info))
goto error_return;

    /* Check for DT_TEXTREL (late, in case the backend removes it).  */
    if (!info->allow_textrel || (info->warn_shared_textrel && info->shared))
{
 bfd_byte *dyncon, *dynconend;

 /* Fix up .dynamic entries.  */
 o = bfd_get_section_by_name (dynobj, ".dynamic");
 if (o != NULL((void*)0))
   {
     dyncon = o->contents;
     dynconend = o->contents + o->size;
     for (; dyncon < dynconend; dyncon += bed->s->sizeof_dyn)
{
  Elf_Internal_Dyn dyn;

  bed->s->swap_dyn_in (dynobj, dyncon, &dyn);

  if (dyn.d_tag == DT_TEXTREL22)
    {
      _bfd_error_handler
	(_("warning: creating a DT_TEXTREL in a shared object.")("warning: creating a DT_TEXTREL in a shared object."));
9024#if 0
      if (!info->allow_textrel)
	goto error_return;
9027#endif
      break;
    }
}
   }
}

    for (o = dynobj->sections; o != NULL((void*)0); o = o->next)
{
 if ((o->flags & SEC_HAS_CONTENTS0x100) == 0
     || o->size == 0
     || o->output_section == bfd_abs_section_ptr((asection *) &bfd_abs_section))
   continue;
 if ((o->flags & SEC_LINKER_CREATED0x200000) == 0)
   {
     /* At this point, we are only interested in sections
 created by _bfd_elf_link_create_dynamic_sections.  */
     continue;
   }
 if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->stab_info.stabstr == o)
   continue;
 if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->eh_info.hdr_sec == o)
   continue;
 if ((elf_section_data (o->output_section)((struct bfd_elf_section_data*)(o->output_section)->used_by_bfd
)->this_hdr.sh_type
      != SHT_STRTAB3)
     || strcmp (bfd_get_section_name (abfd, o)((o)->name + 0), ".dynstr") != 0)
   {
     if (! bfd_set_section_contents (abfd, o->output_section,
			      o->contents,
			      (file_ptr) o->output_offset,
			      o->size))
goto error_return;
   }
 else
   {
     /* The contents of the .dynstr section are actually in a
 stringtab.  */
     off = elf_section_data (o->output_section)((struct bfd_elf_section_data*)(o->output_section)->used_by_bfd
)->this_hdr.sh_offset;
     if (bfd_seek (abfd, off, SEEK_SET0) != 0
  || ! _bfd_elf_strtab_emit (abfd,
			     elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynstr))
goto error_return;
   }
}
  }

if (info->relocatable)
  {
    bfd_boolean failed = FALSE0;

    bfd_map_over_sections (abfd, bfd_elf_set_group_contents, &failed);
    if (failed)
goto error_return;
  }

/* If we have optimized stabs strings, output them.  */
if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->stab_info.stabstr != NULL((void*)0))
  {
    if (! _bfd_write_stab_strings (abfd, &elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->stab_info))
goto error_return;
  }

if (info->eh_frame_hdr)
  {
    if (! _bfd_elf_write_section_eh_frame_hdr (abfd, info))
goto error_return;
  }

if (finfo.symstrtab != NULL((void*)0))
  _bfd_stringtab_free (finfo.symstrtab);
if (finfo.contents != NULL((void*)0))
  free (finfo.contents);
if (finfo.external_relocs != NULL((void*)0))
  free (finfo.external_relocs);
if (finfo.internal_relocs != NULL((void*)0))
  free (finfo.internal_relocs);
if (finfo.external_syms != NULL((void*)0))
  free (finfo.external_syms);
if (finfo.locsym_shndx != NULL((void*)0))
  free (finfo.locsym_shndx);
if (finfo.internal_syms != NULL((void*)0))
  free (finfo.internal_syms);
if (finfo.indices != NULL((void*)0))
  free (finfo.indices);
if (finfo.sections != NULL((void*)0))
  free (finfo.sections);
if (finfo.symbuf != NULL((void*)0))
  free (finfo.symbuf);
if (finfo.symshndxbuf != NULL((void*)0))
  free (finfo.symshndxbuf);
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    if ((o->flags & SEC_RELOC0x004) != 0
 && elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes != NULL((void*)0))
free (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes);
  }

elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->linker = TRUE1;

return TRUE1;

error_return:
if (finfo.symstrtab != NULL((void*)0))
  _bfd_stringtab_free (finfo.symstrtab);
if (finfo.contents != NULL((void*)0))
  free (finfo.contents);
if (finfo.external_relocs != NULL((void*)0))
  free (finfo.external_relocs);
if (finfo.internal_relocs != NULL((void*)0))
  free (finfo.internal_relocs);
if (finfo.external_syms != NULL((void*)0))
  free (finfo.external_syms);
if (finfo.locsym_shndx != NULL((void*)0))
  free (finfo.locsym_shndx);
if (finfo.internal_syms != NULL((void*)0))
  free (finfo.internal_syms);
if (finfo.indices != NULL((void*)0))
  free (finfo.indices);
if (finfo.sections != NULL((void*)0))
  free (finfo.sections);
if (finfo.symbuf != NULL((void*)0))
  free (finfo.symbuf);
if (finfo.symshndxbuf != NULL((void*)0))
  free (finfo.symshndxbuf);
for (o = abfd->sections; o != NULL((void*)0); o = o->next)
  {
    if ((o->flags & SEC_RELOC0x004) != 0
 && elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes != NULL((void*)0))
free (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->rel_hashes);
  }

return FALSE0;
9159}
9160
9161/* Garbage collect unused sections.  */

9163/* The mark phase of garbage collection.  For a given section, mark
 it and any sections in this section's group, and all the sections
 which define symbols to which it refers.  */

9167typedef asection * (*gc_mark_hook_fn)
(asection *, struct bfd_link_info *, Elf_Internal_Rela *,
 struct elf_link_hash_entry *, Elf_Internal_Sym *);

9171bfd_boolean
9172_bfd_elf_gc_mark (struct bfd_link_info *info,
  asection *sec,
  gc_mark_hook_fn gc_mark_hook)
9175{
bfd_boolean ret;
bfd_boolean is_eh;
asection *group_sec;

sec->gc_mark = 1;

/* Mark all the sections in the group.  */
group_sec = elf_section_data (sec)((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group;
if (group_sec && !group_sec->gc_mark)
  if (!_bfd_elf_gc_mark (info, group_sec, gc_mark_hook))
    return FALSE0;

/* Look through the section relocs.  */
ret = TRUE1;
is_eh = strcmp (sec->name, ".eh_frame") == 0;
if ((sec->flags & SEC_RELOC0x004) != 0 && sec->reloc_count > 0)
  {
    Elf_Internal_Rela *relstart, *rel, *relend;
    Elf_Internal_Shdr *symtab_hdr;
    struct elf_link_hash_entry **sym_hashes;
    size_t nlocsyms;
    size_t extsymoff;
    bfd *input_bfd = sec->owner;
    const struct elf_backend_data *bed = get_elf_backend_data (input_bfd)((const struct elf_backend_data *) (input_bfd)->xvec->backend_data
);
    Elf_Internal_Sym *isym = NULL((void*)0);
    int r_sym_shift;

    symtab_hdr = &elf_tdata (input_bfd)((input_bfd) -> tdata.elf_obj_data)->symtab_hdr;
    sym_hashes = elf_sym_hashes (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> sym_hashes);

    /* Read the local symbols.  */
    if (elf_bad_symtab (input_bfd)(((input_bfd) -> tdata.elf_obj_data) -> bad_symtab))
{
 nlocsyms = symtab_hdr->sh_size / bed->s->sizeof_sym;
 extsymoff = 0;
}
    else
extsymoff = nlocsyms = symtab_hdr->sh_info;

    isym = (Elf_Internal_Sym *) symtab_hdr->contents;
    if (isym == NULL((void*)0) && nlocsyms != 0)
{
 isym = bfd_elf_get_elf_syms (input_bfd, symtab_hdr, nlocsyms, 0,
		       NULL((void*)0), NULL((void*)0), NULL((void*)0));
 if (isym == NULL((void*)0))
   return FALSE0;
}

    /* Read the relocations.  */
    relstart = _bfd_elf_link_read_relocs (input_bfd, sec, NULL((void*)0), NULL((void*)0),
			    info->keep_memory);
    if (relstart == NULL((void*)0))
{
 ret = FALSE0;
 goto out1;
}
    relend = relstart + sec->reloc_count * bed->s->int_rels_per_ext_rel;

    if (bed->s->arch_size == 32)
r_sym_shift = 8;
    else
r_sym_shift = 32;

    for (rel = relstart; rel < relend; rel++)
{
 unsigned long r_symndx;
 asection *rsec;
 struct elf_link_hash_entry *h;

 r_symndx = rel->r_info >> r_sym_shift;
 if (r_symndx == 0)
   continue;

 if (r_symndx >= nlocsyms
     || ELF_ST_BIND (isym[r_symndx].st_info)(((unsigned int)(isym[r_symndx].st_info)) >> 4) != STB_LOCAL0)
   {
     h = sym_hashes[r_symndx - extsymoff];
     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;
     rsec = (*gc_mark_hook) (sec, info, rel, h, NULL((void*)0));
   }
 else
   {
     rsec = (*gc_mark_hook) (sec, info, rel, NULL((void*)0), &isym[r_symndx]);
   }

 if (rsec && !rsec->gc_mark)
   {
     if (bfd_get_flavour (rsec->owner)((rsec->owner)->xvec->flavour) != bfd_target_elf_flavour)
rsec->gc_mark = 1;
     else if (is_eh)
rsec->gc_mark_from_eh = 1;
     else if (!_bfd_elf_gc_mark (info, rsec, gc_mark_hook))
{
  ret = FALSE0;
  goto out2;
}
   }
}

  out2:
    if (elf_section_data (sec)((struct bfd_elf_section_data*)(sec)->used_by_bfd)->relocs != relstart)
free (relstart);
  out1:
    if (isym != NULL((void*)0) && symtab_hdr->contents != (unsigned char *) isym)
{
 if (! info->keep_memory)
   free (isym);
 else
   symtab_hdr->contents = (unsigned char *) isym;
}
  }

return ret;
9291}

9293/* Sweep symbols in swept sections.  Called via elf_link_hash_traverse.  */

9295struct elf_gc_sweep_symbol_info {
struct bfd_link_info *info;
void (*hide_symbol) (struct bfd_link_info *, struct elf_link_hash_entry *,
       bfd_boolean);
9299};

9301static bfd_boolean
9302elf_gc_sweep_symbol (struct elf_link_hash_entry *h, void *data)
9303{
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)
    && !h->root.u.def.section->gc_mark
    && !(h->root.u.def.section->owner->flags & DYNAMIC0x40))
  {
    struct elf_gc_sweep_symbol_info *inf = data;
    (*inf->hide_symbol) (inf->info, h, TRUE1);
  }

return TRUE1;
9317}

9319/* The sweep phase of garbage collection.  Remove all garbage sections.  */

9321typedef bfd_boolean (*gc_sweep_hook_fn)
(bfd *, struct bfd_link_info *, asection *, const Elf_Internal_Rela *);

9324static bfd_boolean
9325elf_gc_sweep (bfd *abfd, struct bfd_link_info *info)
9326{
bfd *sub;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
gc_sweep_hook_fn gc_sweep_hook = bed->gc_sweep_hook;
unsigned long section_sym_count;
struct elf_gc_sweep_symbol_info sweep_info;

for (sub = info->input_bfds; sub != NULL((void*)0); sub = sub->link_next)
  {
    asection *o;

    if (bfd_get_flavour (sub)((sub)->xvec->flavour) != bfd_target_elf_flavour)
continue;

    for (o = sub->sections; o != NULL((void*)0); o = o->next)
{
 /* Keep debug and special sections.  */
 if ((o->flags & (SEC_DEBUGGING0x2000 | SEC_LINKER_CREATED0x200000)) != 0
     || elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->this_hdr.sh_type == SHT_NOTE7
     || (o->flags & (SEC_ALLOC0x001 | SEC_LOAD0x002 | SEC_RELOC0x004)) == 0)
   o->gc_mark = 1;

 if (o->gc_mark)
   continue;

 /* Skip sweeping sections already excluded.  */
 if (o->flags & SEC_EXCLUDE0x8000)
   continue;

 /* Since this is early in the link process, it is simple
    to remove a section from the output.  */
 o->flags |= SEC_EXCLUDE0x8000;

 /* But we also have to update some of the relocation
    info we collected before.  */
 if (gc_sweep_hook
     && (o->flags & SEC_RELOC0x004) != 0
     && o->reloc_count > 0
     && !bfd_is_abs_section (o->output_section)((o->output_section) == ((asection *) &bfd_abs_section
)))
   {
     Elf_Internal_Rela *internal_relocs;
     bfd_boolean r;

     internal_relocs
= _bfd_elf_link_read_relocs (o->owner, o, NULL((void*)0), NULL((void*)0),
			     info->keep_memory);
     if (internal_relocs == NULL((void*)0))
return FALSE0;

     r = (*gc_sweep_hook) (o->owner, info, o, internal_relocs);

     if (elf_section_data (o)((struct bfd_elf_section_data*)(o)->used_by_bfd)->relocs != internal_relocs)
free (internal_relocs);

     if (!r)
return FALSE0;
   }
}
  }

/* Remove the symbols that were in the swept sections from the dynamic
   symbol table.  GCFIXME: Anyone know how to get them out of the
   static symbol table as well?  */
sweep_info.info = info;
sweep_info.hide_symbol = bed->elf_backend_hide_symbol;
elf_link_hash_traverse (elf_hash_table (info), elf_gc_sweep_symbol,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_sweep_symbol), (&sweep_info)))
	  &sweep_info)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_sweep_symbol), (&sweep_info)));

_bfd_elf_link_renumber_dynsyms (abfd, info, &section_sym_count);
return TRUE1;
9396}

9398/* Propagate collected vtable information.  This is called through
 elf_link_hash_traverse.  */

9401static bfd_boolean
9402elf_gc_propagate_vtable_entries_used (struct elf_link_hash_entry *h, void *okp)
9403{
if (h->root.type == bfd_link_hash_warning)
  h = (struct elf_link_hash_entry *) h->root.u.i.link;

/* Those that are not vtables.  */
if (h->vtable == NULL((void*)0) || h->vtable->parent == NULL((void*)0))
  return TRUE1;

/* Those vtables that do not have parents, we cannot merge.  */
if (h->vtable->parent == (struct elf_link_hash_entry *) -1)
  return TRUE1;

/* If we've already been done, exit.  */
if (h->vtable->used && h->vtable->used[-1])
  return TRUE1;

/* Make sure the parent's table is up to date.  */
elf_gc_propagate_vtable_entries_used (h->vtable->parent, okp);

if (h->vtable->used == NULL((void*)0))
  {
    /* None of this table's entries were referenced.  Re-use the
parent's table.  */
    h->vtable->used = h->vtable->parent->vtable->used;
    h->vtable->size = h->vtable->parent->vtable->size;
  }
else
  {
    size_t n;
    bfd_boolean *cu, *pu;

    /* Or the parent's entries into ours.  */
    cu = h->vtable->used;
    cu[-1] = TRUE1;
    pu = h->vtable->parent->vtable->used;
    if (pu != NULL((void*)0))
{
 const struct elf_backend_data *bed;
 unsigned int log_file_align;

 bed = get_elf_backend_data (h->root.u.def.section->owner)((const struct elf_backend_data *) (h->root.u.def.section->
owner)->xvec->backend_data);
 log_file_align = bed->s->log_file_align;
 n = h->vtable->parent->vtable->size >> log_file_align;
 while (n--)
   {
     if (*pu)
*cu = TRUE1;
     pu++;
     cu++;
   }
}
  }

return TRUE1;
9457}

9459static bfd_boolean
9460elf_gc_smash_unused_vtentry_relocs (struct elf_link_hash_entry *h, void *okp)
9461{
asection *sec;
bfd_vma hstart, hend;
Elf_Internal_Rela *relstart, *relend, *rel;
const struct elf_backend_data *bed;
unsigned int log_file_align;

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

/* Take care of both those symbols that do not describe vtables as
   well as those that are not loaded.  */
if (h->vtable == NULL((void*)0) || h->vtable->parent == NULL((void*)0))
  return TRUE1;

BFD_ASSERT (h->root.type == bfd_link_hash_defineddo { if (!(h->root.type == bfd_link_hash_defined || h->
root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,9477); } while (0)
     || h->root.type == bfd_link_hash_defweak)do { if (!(h->root.type == bfd_link_hash_defined || h->
root.type == bfd_link_hash_defweak)) bfd_assert("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
,9477); } while (0);

sec = h->root.u.def.section;
hstart = h->root.u.def.value;
hend = hstart + h->size;

relstart = _bfd_elf_link_read_relocs (sec->owner, sec, NULL((void*)0), NULL((void*)0), TRUE1);
if (!relstart)
  return *(bfd_boolean *) okp = FALSE0;
bed = get_elf_backend_data (sec->owner)((const struct elf_backend_data *) (sec->owner)->xvec->
backend_data);
log_file_align = bed->s->log_file_align;

relend = relstart + sec->reloc_count * bed->s->int_rels_per_ext_rel;

for (rel = relstart; rel < relend; ++rel)
  if (rel->r_offset >= hstart && rel->r_offset < hend)
    {
/* If the entry is in use, do nothing.  */
if (h->vtable->used
   && (rel->r_offset - hstart) < h->vtable->size)
 {
   bfd_vma entry = (rel->r_offset - hstart) >> log_file_align;
   if (h->vtable->used[entry])
     continue;
 }
/* Otherwise, kill it.  */
rel->r_offset = rel->r_info = rel->r_addend = 0;
    }

return TRUE1;
9507}

9509/* Mark sections containing dynamically referenced symbols.  When
 building shared libraries, we must assume that any visible symbol is
 referenced.  */

9513bfd_boolean
9514bfd_elf_gc_mark_dynamic_ref_symbol (struct elf_link_hash_entry *h, void *inf)
9515{
struct bfd_link_info *info = (struct bfd_link_info *) inf;

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)
    && (h->ref_dynamic
 || (!info->executable
     && h->def_regular
     && ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) != STV_INTERNAL1
     && ELF_ST_VISIBILITY (h->other)((h->other) & 0x3) != STV_HIDDEN2)))
  h->root.u.def.section->flags |= SEC_KEEP0x400000;

return TRUE1;
9531}

9533/* Do mark and sweep of unused sections.  */

9535bfd_boolean
9536bfd_elf_gc_sections (bfd *abfd, struct bfd_link_info *info)
9537{
bfd_boolean ok = TRUE1;
bfd *sub;
asection * (*gc_mark_hook)
  (asection *, struct bfd_link_info *, Elf_Internal_Rela *,
   struct elf_link_hash_entry *h, Elf_Internal_Sym *);
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

if (!bed->can_gc_sections
    || info->relocatable
    || info->emitrelocations
    || !is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  {
    (*_bfd_error_handler)(_("Warning: gc-sections option ignored")("Warning: gc-sections option ignored"));
    return TRUE1;
  }

/* Apply transitive closure to the vtable entry usage info.  */
elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_propagate_vtable_entries_used), (&ok
)))
	  elf_gc_propagate_vtable_entries_used,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_propagate_vtable_entries_used), (&ok
)))
	  &ok)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_propagate_vtable_entries_used), (&ok
)));
if (!ok)
  return FALSE0;

/* Kill the vtable relocations that were not used.  */
elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_smash_unused_vtentry_relocs), (&ok))
)
	  elf_gc_smash_unused_vtentry_relocs,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_smash_unused_vtentry_relocs), (&ok))
)
	  &ok)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_smash_unused_vtentry_relocs), (&ok))
);
if (!ok)
  return FALSE0;

/* Mark dynamically referenced symbols.  */
if (elf_hash_table (info)((struct elf_link_hash_table *) ((info)->hash))->dynamic_sections_created)
  elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (bed->gc_mark_dynamic_ref), (info)))
	    bed->gc_mark_dynamic_ref,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (bed->gc_mark_dynamic_ref), (info)))
	    info)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (bed->gc_mark_dynamic_ref), (info)));

/* Grovel through relocs to find out who stays ...  */
gc_mark_hook = bed->gc_mark_hook;
for (sub = info->input_bfds; sub != NULL((void*)0); sub = sub->link_next)
  {
    asection *o;

    if (bfd_get_flavour (sub)((sub)->xvec->flavour) != bfd_target_elf_flavour)
continue;

    for (o = sub->sections; o != NULL((void*)0); o = o->next)
if ((o->flags & SEC_KEEP0x400000) != 0 && !o->gc_mark)
 if (!_bfd_elf_gc_mark (info, o, gc_mark_hook))
   return FALSE0;
  }

/* ... again for sections marked from eh_frame.  */
for (sub = info->input_bfds; sub != NULL((void*)0); sub = sub->link_next)
  {
    asection *o;

    if (bfd_get_flavour (sub)((sub)->xvec->flavour) != bfd_target_elf_flavour)
continue;

    /* Keep .gcc_except_table.* if the associated .text.* is
marked.  This isn't very nice, but the proper solution,
splitting .eh_frame up and using comdat doesn't pan out
easily due to needing special relocs to handle the
difference of two symbols in separate sections.
Don't keep code sections referenced by .eh_frame.  */
    for (o = sub->sections; o != NULL((void*)0); o = o->next)
if (!o->gc_mark && o->gc_mark_from_eh && (o->flags & SEC_CODE0x010) == 0)
 {
   if (strncmp (o->name, ".gcc_except_table.", 18) == 0)
     {
unsigned long len;
char *fn_name;
asection *fn_text;

len = strlen (o->name + 18) + 1;
fn_name = bfd_malloc (len + 6);
if (fn_name == NULL((void*)0))
  return FALSE0;
memcpy (fn_name, ".text.", 6);
memcpy (fn_name + 6, o->name + 18, len);
fn_text = bfd_get_section_by_name (sub, fn_name);
free (fn_name);
if (fn_text == NULL((void*)0) || !fn_text->gc_mark)
  continue;
     }

   /* If not using specially named exception table section,
      then keep whatever we are using.  */
   if (!_bfd_elf_gc_mark (info, o, gc_mark_hook))
     return FALSE0;
 }
  }

/* ... and mark SEC_EXCLUDE for those that go.  */
return elf_gc_sweep (abfd, info);
9633}
9634
9635/* Called from check_relocs to record the existence of a VTINHERIT reloc.  */

9637bfd_boolean
9638bfd_elf_gc_record_vtinherit (bfd *abfd,
	     asection *sec,
	     struct elf_link_hash_entry *h,
	     bfd_vma offset)
9642{
struct elf_link_hash_entry **sym_hashes, **sym_hashes_end;
struct elf_link_hash_entry **search, *child;
bfd_size_type extsymcount;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

/* 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.  */
extsymcount = elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_hdr.sh_size / bed->s->sizeof_sym;
if (!elf_bad_symtab (abfd)(((abfd) -> tdata.elf_obj_data) -> bad_symtab))
  extsymcount -= elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_hdr.sh_info;

sym_hashes = elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes);
sym_hashes_end = sym_hashes + extsymcount;

/* Hunt down the child symbol, which is in this section at the same
   offset as the relocation.  */
for (search = sym_hashes; search != sym_hashes_end; ++search)
  {
    if ((child = *search) != NULL((void*)0)
 && (child->root.type == bfd_link_hash_defined
     || child->root.type == bfd_link_hash_defweak)
 && child->root.u.def.section == sec
 && child->root.u.def.value == offset)
goto win;
  }

(*_bfd_error_handler) ("%B: %A+%lu: No symbol found for INHERIT",
	 abfd, sec, (unsigned long) offset);
bfd_set_error (bfd_error_invalid_operation);
return FALSE0;

win:
if (!child->vtable)
  {
    child->vtable = bfd_zalloc (abfd, sizeof (*child->vtable));
    if (!child->vtable)
return FALSE0;
  }
if (!h)
  {
    /* This *should* only be the absolute section.  It could potentially
be that someone has defined a non-global vtable though, which
would be bad.  It isn't worth paging in the local symbols to be
sure though; that case should simply be handled by the assembler.  */

    child->vtable->parent = (struct elf_link_hash_entry *) -1;
  }
else
  child->vtable->parent = h;

return TRUE1;
9695}

9697/* Called from check_relocs to record the existence of a VTENTRY reloc.  */

9699bfd_boolean
9700bfd_elf_gc_record_vtentry (bfd *abfd ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
	   asection *sec ATTRIBUTE_UNUSED__attribute__ ((__unused__)),
	   struct elf_link_hash_entry *h,
	   bfd_vma addend)
9704{
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
unsigned int log_file_align = bed->s->log_file_align;

if (!h->vtable)
  {
    h->vtable = bfd_zalloc (abfd, sizeof (*h->vtable));
    if (!h->vtable)
return FALSE0;
  }

if (addend >= h->vtable->size)
  {
    size_t size, bytes, file_align;
    bfd_boolean *ptr = h->vtable->used;

    /* While the symbol is undefined, we have to be prepared to handle
a zero size.  */
    file_align = 1 << log_file_align;
    if (h->root.type == bfd_link_hash_undefined)
size = addend + file_align;
    else
{
 size = h->size;
 if (addend >= size)
   {
     /* Oops!  We've got a reference past the defined end of
 the table.  This is probably a bug -- shall we warn?  */
     size = addend + file_align;
   }
}
    size = (size + file_align - 1) & -file_align;

    /* Allocate one extra entry for use as a "done" flag for the
consolidation pass.  */
    bytes = ((size >> log_file_align) + 1) * sizeof (bfd_boolean);

    if (ptr)
{
 ptr = bfd_realloc (ptr - 1, bytes);

 if (ptr != NULL((void*)0))
   {
     size_t oldbytes;

     oldbytes = (((h->vtable->size >> log_file_align) + 1)
	  * sizeof (bfd_boolean));
     memset (((char *) ptr) + oldbytes, 0, bytes - oldbytes);
   }
}
    else
ptr = bfd_zmalloc (bytes);

    if (ptr == NULL((void*)0))
return FALSE0;

    /* And arrange for that done flag to be at index -1.  */
    h->vtable->used = ptr + 1;
    h->vtable->size = size;
  }

h->vtable->used[addend >> log_file_align] = TRUE1;

return TRUE1;
9768}

9770struct alloc_got_off_arg {
bfd_vma gotoff;
unsigned int got_elt_size;
9773};

9775/* We need a special top-level link routine to convert got reference counts
 to real got offsets.  */

9778static bfd_boolean
9779elf_gc_allocate_got_offsets (struct elf_link_hash_entry *h, void *arg)
9780{
struct alloc_got_off_arg *gofarg = arg;

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

if (h->got.refcount > 0)
  {
    h->got.offset = gofarg->gotoff;
    gofarg->gotoff += gofarg->got_elt_size;
  }
else
  h->got.offset = (bfd_vma) -1;

return TRUE1;
9795}

9797/* And an accompanying bit to work out final got entry offsets once
 we're done.  Should be called from final_link.  */

9800bfd_boolean
9801bfd_elf_gc_common_finalize_got_offsets (bfd *abfd,
			struct bfd_link_info *info)
9803{
bfd *i;
const struct elf_backend_data *bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);
bfd_vma gotoff;
unsigned int got_elt_size = bed->s->arch_size / 8;
struct alloc_got_off_arg gofarg;

if (! is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return FALSE0;

/* The GOT offset is relative to the .got section, but the GOT header is
   put into the .got.plt section, if the backend uses it.  */
if (bed->want_got_plt)
  gotoff = 0;
else
  gotoff = bed->got_header_size;

/* Do the local .got entries first.  */
for (i = info->input_bfds; i; i = i->link_next)
  {
    bfd_signed_vma *local_got;
    bfd_size_type j, locsymcount;
    Elf_Internal_Shdr *symtab_hdr;

    if (bfd_get_flavour (i)((i)->xvec->flavour) != bfd_target_elf_flavour)
continue;

    local_got = elf_local_got_refcounts (i)(((i) -> tdata.elf_obj_data) -> local_got.refcounts);
    if (!local_got)
continue;

    symtab_hdr = &elf_tdata (i)((i) -> tdata.elf_obj_data)->symtab_hdr;
    if (elf_bad_symtab (i)(((i) -> tdata.elf_obj_data) -> bad_symtab))
locsymcount = symtab_hdr->sh_size / bed->s->sizeof_sym;
    else
locsymcount = symtab_hdr->sh_info;

    for (j = 0; j < locsymcount; ++j)
{
 if (local_got[j] > 0)
   {
     local_got[j] = gotoff;
     gotoff += got_elt_size;
   }
 else
   local_got[j] = (bfd_vma) -1;
}
  }

/* Then the global .got entries.  .plt refcounts are handled by
   adjust_dynamic_symbol  */
gofarg.gotoff = gotoff;
gofarg.got_elt_size = got_elt_size;
elf_link_hash_traverse (elf_hash_table (info),(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_allocate_got_offsets), (&gofarg)))
	  elf_gc_allocate_got_offsets,(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_allocate_got_offsets), (&gofarg)))
	  &gofarg)(bfd_link_hash_traverse (&(((struct elf_link_hash_table *
) ((info)->hash)))->root, (bfd_boolean (*) (struct bfd_link_hash_entry
 *, void *)) (elf_gc_allocate_got_offsets), (&gofarg)));
return TRUE1;
9860}

9862/* Many folk need no more in the way of final link than this, once
 got entry reference counting is enabled.  */

9865bfd_boolean
9866bfd_elf_gc_common_final_link (bfd *abfd, struct bfd_link_info *info)
9867{
if (!bfd_elf_gc_common_finalize_got_offsets (abfd, info))
  return FALSE0;

/* Invoke the regular ELF backend linker to do all the work.  */
return bfd_elf_final_link (abfd, info);
9873}

9875bfd_boolean
9876bfd_elf_reloc_symbol_deleted_p (bfd_vma offset, void *cookie)
9877{
struct elf_reloc_cookie *rcookie = cookie;

if (rcookie->bad_symtab)
  rcookie->rel = rcookie->rels;

for (; rcookie->rel < rcookie->relend; rcookie->rel++)
  {
    unsigned long r_symndx;

    if (! rcookie->bad_symtab)
if (rcookie->rel->r_offset > offset)
 return FALSE0;
    if (rcookie->rel->r_offset != offset)
continue;

    r_symndx = rcookie->rel->r_info >> rcookie->r_sym_shift;
    if (r_symndx == SHN_UNDEF0)
return TRUE1;

    if (r_symndx >= rcookie->locsymcount
 || ELF_ST_BIND (rcookie->locsyms[r_symndx].st_info)(((unsigned int)(rcookie->locsyms[r_symndx].st_info)) >>
 4) != STB_LOCAL0)
{
 struct elf_link_hash_entry *h;

 h = rcookie->sym_hashes[r_symndx - rcookie->extsymoff];

 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 ((h->root.type == bfd_link_hash_defined
      || h->root.type == bfd_link_hash_defweak)
     && elf_discarded_section (h->root.u.def.section)(!((h->root.u.def.section) == ((asection *) &bfd_abs_section
)) && (((h->root.u.def.section)->output_section
) == ((asection *) &bfd_abs_section)) && (h->root
.u.def.section)->sec_info_type != 2 && (h->root
.u.def.section)->sec_info_type != 4))
   return TRUE1;
 else
   return FALSE0;
}
    else
{
 /* It's not a relocation against a global symbol,
    but it could be a relocation against a local
    symbol for a discarded section.  */
 asection *isec;
 Elf_Internal_Sym *isym;

 /* Need to: get the symbol; get the section.  */
 isym = &rcookie->locsyms[r_symndx];
 if (isym->st_shndx < SHN_LORESERVE0xFF00 || isym->st_shndx > SHN_HIRESERVE0xFFFF)
   {
     isec = bfd_section_from_elf_index (rcookie->abfd, isym->st_shndx);
     if (isec != NULL((void*)0) && elf_discarded_section (isec)(!((isec) == ((asection *) &bfd_abs_section)) && (
((isec)->output_section) == ((asection *) &bfd_abs_section
)) && (isec)->sec_info_type != 2 && (isec)
->sec_info_type != 4))
return TRUE1;
   }
}
    return FALSE0;
  }
return FALSE0;
9935}

9937/* Discard unneeded references to discarded sections.
 Returns TRUE if any section's size was changed.  */
9939/* This function assumes that the relocations are in sorted order,
 which is true for all known assemblers.  */

9942bfd_boolean
9943bfd_elf_discard_info (bfd *output_bfd, struct bfd_link_info *info)
9944{
struct elf_reloc_cookie cookie;
asection *stab, *eh;
Elf_Internal_Shdr *symtab_hdr;
const struct elf_backend_data *bed;
bfd *abfd;
unsigned int count;
bfd_boolean ret = FALSE0;

if (info->traditional_format
    || !is_elf_hash_table (info->hash)(((struct bfd_link_hash_table *) (info->hash))->type ==
 bfd_link_elf_hash_table))
  return FALSE0;

for (abfd = info->input_bfds; abfd != NULL((void*)0); abfd = abfd->link_next)
  {
    if (bfd_get_flavour (abfd)((abfd)->xvec->flavour) != bfd_target_elf_flavour)
continue;

    bed = get_elf_backend_data (abfd)((const struct elf_backend_data *) (abfd)->xvec->backend_data
);

    if ((abfd->flags & DYNAMIC0x40) != 0)
continue;

    eh = bfd_get_section_by_name (abfd, ".eh_frame");
    if (info->relocatable
 || (eh != NULL((void*)0)
     && (eh->size == 0
  || bfd_is_abs_section (eh->output_section)((eh->output_section) == ((asection *) &bfd_abs_section
)))))
eh = NULL((void*)0);

    stab = bfd_get_section_by_name (abfd, ".stab");
    if (stab != NULL((void*)0)
 && (stab->size == 0
     || bfd_is_abs_section (stab->output_section)((stab->output_section) == ((asection *) &bfd_abs_section
))
     || stab->sec_info_type != ELF_INFO_TYPE_STABS1))
stab = NULL((void*)0);

    if (stab == NULL((void*)0)
 && eh == NULL((void*)0)
 && bed->elf_backend_discard_info == NULL((void*)0))
continue;

    symtab_hdr = &elf_tdata (abfd)((abfd) -> tdata.elf_obj_data)->symtab_hdr;
    cookie.abfd = abfd;
    cookie.sym_hashes = elf_sym_hashes (abfd)(((abfd) -> tdata.elf_obj_data) -> sym_hashes);
    cookie.bad_symtab = elf_bad_symtab (abfd)(((abfd) -> tdata.elf_obj_data) -> bad_symtab);
    if (cookie.bad_symtab)
{
 cookie.locsymcount = symtab_hdr->sh_size / bed->s->sizeof_sym;
 cookie.extsymoff = 0;
}
    else
{
 cookie.locsymcount = symtab_hdr->sh_info;
 cookie.extsymoff = symtab_hdr->sh_info;
}

    if (bed->s->arch_size == 32)
cookie.r_sym_shift = 8;
    else
cookie.r_sym_shift = 32;

    cookie.locsyms = (Elf_Internal_Sym *) symtab_hdr->contents;
    if (cookie.locsyms == NULL((void*)0) && cookie.locsymcount != 0)
{
 cookie.locsyms = bfd_elf_get_elf_syms (abfd, symtab_hdr,
				 cookie.locsymcount, 0,
				 NULL((void*)0), NULL((void*)0), NULL((void*)0));
 if (cookie.locsyms == NULL((void*)0))
   return FALSE0;
}

    if (stab != NULL((void*)0))
{
 cookie.rels = NULL((void*)0);
 count = stab->reloc_count;
 if (count != 0)
   cookie.rels = _bfd_elf_link_read_relocs (abfd, stab, NULL((void*)0), NULL((void*)0),
				     info->keep_memory);
 if (cookie.rels != NULL((void*)0))
   {
     cookie.rel = cookie.rels;
     cookie.relend = cookie.rels;
     cookie.relend += count * bed->s->int_rels_per_ext_rel;
     if (_bfd_discard_section_stabs (abfd, stab,
			      elf_section_data (stab)((struct bfd_elf_section_data*)(stab)->used_by_bfd)->sec_info,
			      bfd_elf_reloc_symbol_deleted_p,
			      &cookie))
ret = TRUE1;
     if (elf_section_data (stab)((struct bfd_elf_section_data*)(stab)->used_by_bfd)->relocs != cookie.rels)
free (cookie.rels);
   }
}

    if (eh != NULL((void*)0))
{
 cookie.rels = NULL((void*)0);
 count = eh->reloc_count;
 if (count != 0)
   cookie.rels = _bfd_elf_link_read_relocs (abfd, eh, NULL((void*)0), NULL((void*)0),
				     info->keep_memory);
 cookie.rel = cookie.rels;
 cookie.relend = cookie.rels;
 if (cookie.rels != NULL((void*)0))
   cookie.relend += count * bed->s->int_rels_per_ext_rel;

 if (_bfd_elf_discard_section_eh_frame (abfd, info, eh,
				 bfd_elf_reloc_symbol_deleted_p,
				 &cookie))
   ret = TRUE1;

 if (cookie.rels != NULL((void*)0)
     && elf_section_data (eh)((struct bfd_elf_section_data*)(eh)->used_by_bfd)->relocs != cookie.rels)
   free (cookie.rels);
}

    if (bed->elf_backend_discard_info != NULL((void*)0)
 && (*bed->elf_backend_discard_info) (abfd, &cookie, info))
ret = TRUE1;

    if (cookie.locsyms != NULL((void*)0)
 && symtab_hdr->contents != (unsigned char *) cookie.locsyms)
{
 if (! info->keep_memory)
   free (cookie.locsyms);
 else
   symtab_hdr->contents = (unsigned char *) cookie.locsyms;
}
  }

if (info->eh_frame_hdr
    && !info->relocatable
    && _bfd_elf_discard_section_eh_frame_hdr (output_bfd, info))
  ret = TRUE1;

return ret;
10080}

10082void
10083_bfd_elf_section_already_linked (bfd *abfd, struct bfd_section *sec,
		 struct bfd_link_info *info)
10085{
flagword flags;
const char *name, *p;
struct bfd_section_already_linked *l;
struct bfd_section_already_linked_hash_entry *already_linked_list;
asection *group;

/* A single member comdat group section may be discarded by a
   linkonce section. See below.  */
if (sec->output_section == bfd_abs_section_ptr((asection *) &bfd_abs_section))
  return;

flags = sec->flags;

/* Check if it belongs to a section group.  */
group = elf_sec_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->sec_group
);

/* Return if it isn't a linkonce section nor a member of a group.  A
   comdat group section also has SEC_LINK_ONCE set.  */
if ((flags & SEC_LINK_ONCE0x20000) == 0 && group == NULL((void*)0))
  return;

if (group)
  {
    /* If this is the member of a single member comdat group, check if
the group should be discarded.  */
    if (elf_next_in_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group
) == sec
 && (group->flags & SEC_LINK_ONCE0x20000) != 0)
sec = group;
    else
return;
  }

/* FIXME: When doing a relocatable link, we may have trouble
   copying relocations in other sections that refer to local symbols
   in the section being discarded.  Those relocations will have to
   be converted somehow; as of this writing I'm not sure that any of
   the backends handle that correctly.

   It is tempting to instead not discard link once sections when
   doing a relocatable link (technically, they should be discarded
   whenever we are building constructors).  However, that fails,
   because the linker winds up combining all the link once sections
   into a single large link once section, which defeats the purpose
   of having link once sections in the first place.

   Also, not merging link once sections in a relocatable link
   causes trouble for MIPS ELF, which relies on link once semantics
   to handle the .reginfo section correctly.  */

name = bfd_get_section_name (abfd, sec)((sec)->name + 0);

if (strncmp (name, ".gnu.linkonce.", sizeof (".gnu.linkonce.") - 1) == 0
    && (p = strchr (name + sizeof (".gnu.linkonce.") - 1, '.')) != NULL((void*)0))
  p++;
else
  p = name;

already_linked_list = bfd_section_already_linked_table_lookup (p);

for (l = already_linked_list->entry; l != NULL((void*)0); l = l->next)
  {
    /* We may have 3 different sections on the list: group section,
comdat section and linkonce section. SEC may be a linkonce or
group section. We match a group section with a group section,
a linkonce section with a linkonce section, and ignore comdat
section.  */
    if ((flags & SEC_GROUP0x4000000) == (l->sec->flags & SEC_GROUP0x4000000)
 && strcmp (name, l->sec->name) == 0
 && bfd_coff_get_comdat_section (l->sec->owner, l->sec) == NULL((void*)0))
{
 /* The section has already been linked.  See if we should
    issue a warning.  */
 switch (flags & SEC_LINK_DUPLICATES0x40000)
   {
   default:
     abort ()_bfd_abort ("/usr/src/gnu/usr.bin/binutils-2.17/bfd/elflink.c"
, 10161, __PRETTY_FUNCTION__);

   case SEC_LINK_DUPLICATES_DISCARD0x0:
     break;

   case SEC_LINK_DUPLICATES_ONE_ONLY0x80000:
     (*_bfd_error_handler)
(_("%B: ignoring duplicate section `%A'")("%B: ignoring duplicate section `%A'"),
 abfd, sec);
     break;

   case SEC_LINK_DUPLICATES_SAME_SIZE0x100000:
     if (sec->size != l->sec->size)
(*_bfd_error_handler)
  (_("%B: duplicate section `%A' has different size")("%B: duplicate section `%A' has different size"),
   abfd, sec);
     break;

   case SEC_LINK_DUPLICATES_SAME_CONTENTS(0x80000 | 0x100000):
     if (sec->size != l->sec->size)
(*_bfd_error_handler)
  (_("%B: duplicate section `%A' has different size")("%B: duplicate section `%A' has different size"),
   abfd, sec);
     else if (sec->size != 0)
{
  bfd_byte *sec_contents = NULL((void*)0), *l_sec_contents = NULL((void*)0);

  if (!bfd_malloc_and_get_section (abfd, sec, &sec_contents))
    (*_bfd_error_handler)
      (_("%B: warning: could not read contents of section `%A'")("%B: warning: could not read contents of section `%A'"),
       abfd, sec);
  else if (!bfd_malloc_and_get_section (l->sec->owner, l->sec,
					&l_sec_contents))
    (*_bfd_error_handler)
      (_("%B: warning: could not read contents of section `%A'")("%B: warning: could not read contents of section `%A'"),
       l->sec->owner, l->sec);
  else if (memcmp (sec_contents, l_sec_contents, sec->size) != 0)
    (*_bfd_error_handler)
      (_("%B: warning: duplicate section `%A' has different contents")("%B: warning: duplicate section `%A' has different contents"
),
       abfd, sec);

  if (sec_contents)
    free (sec_contents);
  if (l_sec_contents)
    free (l_sec_contents);
}
     break;
   }

 /* Set the output_section field so that lang_add_section
    does not create a lang_input_section structure for this
    section.  Since there might be a symbol in the section
    being discarded, we must retain a pointer to the section
    which we are really going to use.  */
 sec->output_section = bfd_abs_section_ptr((asection *) &bfd_abs_section);
 sec->kept_section = l->sec;

 if (flags & SEC_GROUP0x4000000)
   {
     asection *first = elf_next_in_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group
);
     asection *s = first;

     while (s != NULL((void*)0))
{
  s->output_section = bfd_abs_section_ptr((asection *) &bfd_abs_section);
  /* Record which group discards it.  */
  s->kept_section = l->sec;
  s = elf_next_in_group (s)(((struct bfd_elf_section_data*)(s)->used_by_bfd)->next_in_group
);
  /* These lists are circular.  */
  if (s == first)
    break;
}
   }

 return;
}
  }

if (group)
  {
    /* If this is the member of a single member comdat group and the
group hasn't be discarded, we check if it matches a linkonce
section. We only record the discarded comdat group. Otherwise
the undiscarded group will be discarded incorrectly later since
itself has been recorded.  */
    for (l = already_linked_list->entry; l != NULL((void*)0); l = l->next)
if ((l->sec->flags & SEC_GROUP0x4000000) == 0
   && bfd_coff_get_comdat_section (l->sec->owner, l->sec) == NULL((void*)0)
   && bfd_elf_match_symbols_in_sections (l->sec,
				  elf_next_in_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group
),
				  info))
 {
   elf_next_in_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group
)->output_section = bfd_abs_section_ptr((asection *) &bfd_abs_section);
   elf_next_in_group (sec)(((struct bfd_elf_section_data*)(sec)->used_by_bfd)->next_in_group
)->kept_section = l->sec;
   group->output_section = bfd_abs_section_ptr((asection *) &bfd_abs_section);
   break;
 }
    if (l == NULL((void*)0))
return;
  }
else
  /* There is no direct match. But for linkonce section, we should
     check if there is a match with comdat group member. We always
     record the linkonce section, discarded or not.  */
  for (l = already_linked_list->entry; l != NULL((void*)0); l = l->next)
    if (l->sec->flags & SEC_GROUP0x4000000)
{
 asection *first = elf_next_in_group (l->sec)(((struct bfd_elf_section_data*)(l->sec)->used_by_bfd)->
next_in_group);

 if (first != NULL((void*)0)
     && elf_next_in_group (first)(((struct bfd_elf_section_data*)(first)->used_by_bfd)->
next_in_group) == first
     && bfd_elf_match_symbols_in_sections (first, sec, info))
   {
     sec->output_section = bfd_abs_section_ptr((asection *) &bfd_abs_section);
     sec->kept_section = l->sec;
     break;
   }
}

/* This is the first section with this name.  Record it.  */
bfd_section_already_linked_table_insert (already_linked_list, sec);
10282}

10284bfd_boolean
10285_bfd_elf_common_definition (Elf_Internal_Sym *sym)
10286{
return sym->st_shndx == SHN_COMMON0xFFF2;
10288}

10290unsigned int
10291_bfd_elf_common_section_index (asection *sec ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
10292{
return SHN_COMMON0xFFF2;
10294}

10296asection *
10297_bfd_elf_common_section (asection *sec ATTRIBUTE_UNUSED__attribute__ ((__unused__)))
10298{
return bfd_com_section_ptr((asection *) &bfd_com_section);
10300}