bfd/sparclinux.c

   1 /* BFD back-end for linux flavored sparc a.out binaries.
   2    Copyright (C) 1992, 93, 94, 95, 96, 1997, 1998 Free Software Foundation, Inc.
   3
   4 This file is part of BFD, the Binary File Descriptor library.
   5
   6 This program is free software; you can redistribute it and/or modify
   7 it under the terms of the GNU General Public License as published by
   8 the Free Software Foundation; either version 2 of the License, or
   9 (at your option) any later version.
  10
  11 This program is distributed in the hope that it will be useful,
  12 but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 GNU General Public License for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with this program; if not, write to the Free Software
  18 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  19 USA.  */
  20
  21 #define TARGET_PAGE_SIZE        4096
  22 #define ZMAGIC_DISK_BLOCK_SIZE 1024
  23 #define SEGMENT_SIZE TARGET_PAGE_SIZE
  24 #define TEXT_START_ADDR        0x0
  25 #define N_SHARED_LIB(x) 0
  26 #define BYTES_IN_WORD 4
  27
  28 #define MACHTYPE_OK(mtype) ((mtype) == M_SPARC || (mtype) == M_UNKNOWN)
  29
  30 #include "bfd.h"
  31 #include "sysdep.h"
  32 #include "libbfd.h"
  33 #include "aout/aout64.h"
  34 #include "aout/stab_gnu.h"
  35 #include "aout/ar.h"
  36 #include "libaout.h"           /* BFD a.out internal data structures */
  37
  38 #define DEFAULT_ARCH bfd_arch_sparc
  39 #define MY(OP) CAT(sparclinux_,OP)
  40 #define TARGETNAME "a.out-sparc-linux"
  41
  42 extern const bfd_target MY(vec);
  43
  44 /* We always generate QMAGIC files in preference to ZMAGIC files.  It
  45    would be possible to make this a linker option, if that ever
  46    becomes important.  */
  47
  48 static void MY_final_link_callback
  49   PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *));
  50
  51 static boolean sparclinux_bfd_final_link
  52   PARAMS ((bfd *abfd, struct bfd_link_info *info));
  53
  54 static boolean
  55 sparclinux_bfd_final_link (abfd, info)
  56      bfd *abfd;
  57      struct bfd_link_info *info;
  58 {
  59   obj_aout_subformat (abfd) = q_magic_format;
  60   return NAME(aout,final_link) (abfd, info, MY_final_link_callback);
  61 }
  62
  63 #define MY_bfd_final_link sparclinux_bfd_final_link
  64
  65 /* Set the machine type correctly.  */
  66
  67 static boolean sparclinux_write_object_contents PARAMS ((bfd *abfd));
  68
  69 static boolean
  70 sparclinux_write_object_contents (abfd)
  71      bfd *abfd;
  72 {
  73   struct external_exec exec_bytes;
  74   struct internal_exec *execp = exec_hdr (abfd);
  75
  76   N_SET_MACHTYPE (*execp, M_SPARC);
  77
  78   obj_reloc_entry_size (abfd) = RELOC_STD_SIZE;
  79
  80   WRITE_HEADERS(abfd, execp);
  81
  82   return true;
  83 }
  84
  85 #define MY_write_object_contents sparclinux_write_object_contents
  86 /* Code to link against Linux a.out shared libraries.  */
  87
  88 /* See if a symbol name is a reference to the global offset table.  */
  89
  90 #ifndef GOT_REF_PREFIX
  91 #define        GOT_REF_PREFIX  "__GOT_"
  92 #endif
  93
  94 #define IS_GOT_SYM(name) \
  95   (strncmp (name, GOT_REF_PREFIX, sizeof GOT_REF_PREFIX - 1) == 0)
  96
  97 /* See if a symbol name is a reference to the procedure linkage table. */
  98
  99 #ifndef PLT_REF_PREFIX
 100 #define        PLT_REF_PREFIX  "__PLT_"
 101 #endif
 102
 103 #define IS_PLT_SYM(name) \
 104   (strncmp (name, PLT_REF_PREFIX, sizeof PLT_REF_PREFIX - 1) == 0)
 105
 106 /* This string is used to generate specialized error messages.  */
 107
 108 #ifndef NEEDS_SHRLIB
 109 #define NEEDS_SHRLIB "__NEEDS_SHRLIB_"
 110 #endif
 111
 112 /* This special symbol is a set vector that contains a list of
 113    pointers to fixup tables.  It will be present in any dynamicly
 114    linked file.  The linker generated fixup table should also be added
 115    to the list, and it should always appear in the second slot (the
 116    first one is a dummy with a magic number that is defined in
 117    crt0.o).  */
 118
 119 #ifndef SHARABLE_CONFLICTS
 120 #define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__"
 121 #endif
 122
 123 /* We keep a list of fixups.  The terminology is a bit strange, but
 124    each fixup contains two 32 bit numbers.  A regular fixup contains
 125    an address and a pointer, and at runtime we should store the
 126    address at the location pointed to by the pointer.  A builtin fixup
 127    contains two pointers, and we should read the address using one
 128    pointer and store it at the location pointed to by the other
 129    pointer.  Builtin fixups come into play when we have duplicate
 130    __GOT__ symbols for the same variable.  The builtin fixup will copy
 131    the GOT pointer from one over into the other.  */
 132
 133 struct fixup
 134 {
 135   struct fixup *next;
 136   struct linux_link_hash_entry *h;
 137   bfd_vma value;
 138
 139   /* Nonzero if this is a jump instruction that needs to be fixed,
 140      zero if this is just a pointer */
 141   char jump;
 142
 143   char builtin;
 144 };
 145
 146 /* We don't need a special hash table entry structure, but we do need
 147    to keep some information between linker passes, so we use a special
 148    hash table.  */
 149
 150 struct linux_link_hash_entry
 151 {
 152   struct aout_link_hash_entry root;
 153 };
 154
 155 struct linux_link_hash_table
 156 {
 157   struct aout_link_hash_table root;
 158
 159   /* First dynamic object found in link.  */
 160   bfd *dynobj;
 161
 162   /* Number of fixups.  */
 163   size_t fixup_count;
 164
 165   /* Number of builtin fixups.  */
 166   size_t local_builtins;
 167
 168   /* List of fixups.  */
 169   struct fixup *fixup_list;
 170 };
 171
 172 static struct bfd_hash_entry *linux_link_hash_newfunc
 173   PARAMS ((struct bfd_hash_entry *, struct bfd_hash_table *, const char *));
 174 static struct bfd_link_hash_table *linux_link_hash_table_create
 175   PARAMS ((bfd *));
 176 static struct fixup *new_fixup
 177   PARAMS ((struct bfd_link_info *, struct linux_link_hash_entry *,
 178           bfd_vma, int));
 179 static boolean linux_link_create_dynamic_sections
 180   PARAMS ((bfd *, struct bfd_link_info *));
 181 static boolean linux_add_one_symbol
 182   PARAMS ((struct bfd_link_info *, bfd *, const char *, flagword, asection *,
 183           bfd_vma, const char *, boolean, boolean,
 184           struct bfd_link_hash_entry **));
 185 static boolean linux_tally_symbols
 186   PARAMS ((struct linux_link_hash_entry *, PTR));
 187 static boolean linux_finish_dynamic_link
 188   PARAMS ((bfd *, struct bfd_link_info *));
 189
 190 /* Routine to create an entry in an Linux link hash table.  */
 191
 192 static struct bfd_hash_entry *
 193 linux_link_hash_newfunc (entry, table, string)
 194      struct bfd_hash_entry *entry;
 195      struct bfd_hash_table *table;
 196      const char *string;
 197 {
 198   struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry;
 199
 200   /* Allocate the structure if it has not already been allocated by a
 201      subclass.  */
 202   if (ret == (struct linux_link_hash_entry *) NULL)
 203     ret = ((struct linux_link_hash_entry *)
 204           bfd_hash_allocate (table, sizeof (struct linux_link_hash_entry)));
 205   if (ret == NULL)
 206     return (struct bfd_hash_entry *) ret;
 207
 208   /* Call the allocation method of the superclass.  */
 209   ret = ((struct linux_link_hash_entry *)
 210         NAME(aout,link_hash_newfunc) ((struct bfd_hash_entry *) ret,
 211                                       table, string));
 212   if (ret != NULL)
 213     {
 214       /* Set local fields; there aren't any.  */
 215     }
 216
 217   return (struct bfd_hash_entry *) ret;
 218 }
 219
 220 /* Create a Linux link hash table.  */
 221
 222 static struct bfd_link_hash_table *
 223 linux_link_hash_table_create (abfd)
 224      bfd *abfd;
 225 {
 226   struct linux_link_hash_table *ret;
 227
 228   ret = ((struct linux_link_hash_table *)
 229         bfd_alloc (abfd, sizeof (struct linux_link_hash_table)));
 230   if (ret == (struct linux_link_hash_table *) NULL)
 231     return (struct bfd_link_hash_table *) NULL;
 232   if (! NAME(aout,link_hash_table_init) (&ret->root, abfd,
 233                                         linux_link_hash_newfunc))
 234     {
 235       free (ret);
 236       return (struct bfd_link_hash_table *) NULL;
 237     }
 238
 239   ret->dynobj = NULL;
 240   ret->fixup_count = 0;
 241   ret->local_builtins = 0;
 242   ret->fixup_list = NULL;
 243
 244   return &ret->root.root;
 245 }
 246
 247 /* Look up an entry in a Linux link hash table.  */
 248
 249 #define linux_link_hash_lookup(table, string, create, copy, follow) \
 250   ((struct linux_link_hash_entry *) \
 251    aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
 252                          (follow)))
 253
 254 /* Traverse a Linux link hash table.  */
 255
 256 #define linux_link_hash_traverse(table, func, info)                    \
 257   (aout_link_hash_traverse                                             \
 258    (&(table)->root,                                                    \
 259     (boolean (*) PARAMS ((struct aout_link_hash_entry *, PTR))) (func), \
 260     (info)))
 261
 262 /* Get the Linux link hash table from the info structure.  This is
 263    just a cast.  */
 264
 265 #define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
 266
 267 /* Store the information for a new fixup.  */
 268
 269 static struct fixup *
 270 new_fixup (info, h, value, builtin)
 271      struct bfd_link_info *info;
 272      struct linux_link_hash_entry *h;
 273      bfd_vma value;
 274      int builtin;
 275 {
 276   struct fixup *f;
 277
 278   f = (struct fixup *) bfd_hash_allocate (&info->hash->table,
 279                                          sizeof (struct fixup));
 280   if (f == NULL)
 281     return f;
 282   f->next = linux_hash_table (info)->fixup_list;
 283   linux_hash_table (info)->fixup_list = f;
 284   f->h = h;
 285   f->value = value;
 286   f->builtin = builtin;
 287   f->jump = 0;
 288   ++linux_hash_table (info)->fixup_count;
 289   return f;
 290 }
 291
 292 /* We come here once we realize that we are going to link to a shared
 293    library.  We need to create a special section that contains the
 294    fixup table, and we ultimately need to add a pointer to this into
 295    the set vector for SHARABLE_CONFLICTS.  At this point we do not
 296    know the size of the section, but that's OK - we just need to
 297    create it for now.  */
 298
 299 static boolean
 300 linux_link_create_dynamic_sections (abfd, info)
 301      bfd *abfd;
 302      struct bfd_link_info *info;
 303 {
 304   flagword flags;
 305   register asection *s;
 306
 307   /* Note that we set the SEC_IN_MEMORY flag.  */
 308   flags = SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY;
 309
 310   /* We choose to use the name ".linux-dynamic" for the fixup table.
 311      Why not? */
 312   s = bfd_make_section (abfd, ".linux-dynamic");
 313   if (s == NULL
 314       || ! bfd_set_section_flags (abfd, s, flags)
 315       || ! bfd_set_section_alignment (abfd, s, 2))
 316     return false;
 317   s->_raw_size = 0;
 318   s->contents = 0;
 319
 320   return true;
 321 }
 322
 323 /* Function to add a single symbol to the linker hash table.  This is
 324    a wrapper around _bfd_generic_link_add_one_symbol which handles the
 325    tweaking needed for dynamic linking support.  */
 326
 327 static boolean
 328 linux_add_one_symbol (info, abfd, name, flags, section, value, string,
 329                      copy, collect, hashp)
 330      struct bfd_link_info *info;
 331      bfd *abfd;
 332      const char *name;
 333      flagword flags;
 334      asection *section;
 335      bfd_vma value;
 336      const char *string;
 337      boolean copy;
 338      boolean collect;
 339      struct bfd_link_hash_entry **hashp;
 340 {
 341   struct linux_link_hash_entry *h;
 342   boolean insert;
 343
 344   /* Look up and see if we already have this symbol in the hash table.
 345      If we do, and the defining entry is from a shared library, we
 346      need to create the dynamic sections.
 347
 348      FIXME: What if abfd->xvec != info->hash->creator?  We may want to
 349      be able to link Linux a.out and ELF objects together, but serious
 350      confusion is possible.  */
 351
 352   insert = false;
 353
 354   if (! info->relocateable
 355       && linux_hash_table (info)->dynobj == NULL
 356       && strcmp (name, SHARABLE_CONFLICTS) == 0
 357       && (flags & BSF_CONSTRUCTOR) != 0
 358       && abfd->xvec == info->hash->creator)
 359     {
 360       if (! linux_link_create_dynamic_sections (abfd, info))
 361        return false;
 362       linux_hash_table (info)->dynobj = abfd;
 363       insert = true;
 364     }
 365
 366   if (bfd_is_abs_section (section)
 367       && abfd->xvec == info->hash->creator)
 368     {
 369       h = linux_link_hash_lookup (linux_hash_table (info), name, false,
 370                                  false, false);
 371       if (h != NULL
 372          && (h->root.root.type == bfd_link_hash_defined
 373              || h->root.root.type == bfd_link_hash_defweak))
 374        {
 375          struct fixup *f;
 376
 377          if (hashp != NULL)
 378            *hashp = (struct bfd_link_hash_entry *) h;
 379
 380          f = new_fixup (info, h, value, ! IS_PLT_SYM (name));
 381          if (f == NULL)
 382            return false;
 383          f->jump = IS_PLT_SYM (name);
 384
 385          return true;
 386        }
 387     }
 388
 389   /* Do the usual procedure for adding a symbol.  */
 390   if (! _bfd_generic_link_add_one_symbol (info, abfd, name, flags, section,
 391                                          value, string, copy, collect,
 392                                          hashp))
 393     return false;
 394
 395   /* Insert a pointer to our table in the set vector.  The dynamic
 396      linker requires this information */
 397   if (insert)
 398     {
 399       asection *s;
 400
 401       /* Here we do our special thing to add the pointer to the
 402         dynamic section in the SHARABLE_CONFLICTS set vector.  */
 403       s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
 404                                   ".linux-dynamic");
 405       BFD_ASSERT (s != NULL);
 406
 407       if (! (_bfd_generic_link_add_one_symbol
 408             (info, linux_hash_table (info)->dynobj, SHARABLE_CONFLICTS,
 409              BSF_GLOBAL | BSF_CONSTRUCTOR, s, 0, NULL, false, false, NULL)))
 410        return false;
 411     }
 412
 413   return true;
 414 }
 415
 416 /* We will crawl the hash table and come here for every global symbol.
 417    We will examine each entry and see if there are indications that we
 418    need to add a fixup.  There are two possible cases - one is where
 419    you have duplicate definitions of PLT or GOT symbols - these will
 420    have already been caught and added as "builtin" fixups.  If we find
 421    that the corresponding non PLT/GOT symbol is also present, we
 422    convert it to a regular fixup instead.
 423
 424    This function is called via linux_link_hash_traverse.  */
 425
 426 static boolean
 427 linux_tally_symbols (h, data)
 428      struct linux_link_hash_entry *h;
 429      PTR data;
 430 {
 431   struct bfd_link_info *info = (struct bfd_link_info *) data;
 432   struct fixup *f, *f1;
 433   int is_plt;
 434   struct linux_link_hash_entry *h1, *h2;
 435   boolean exists;
 436
 437   if (h->root.root.type == bfd_link_hash_undefined
 438       && strncmp (h->root.root.root.string, NEEDS_SHRLIB,
 439                  sizeof NEEDS_SHRLIB - 1) == 0)
 440     {
 441       const char *name;
 442       char *p;
 443       char *alloc = NULL;
 444
 445       name = h->root.root.root.string + sizeof NEEDS_SHRLIB - 1;
 446       p = strrchr (name, '_');
 447       if (p != NULL)
 448        alloc = (char *) bfd_malloc (strlen (name) + 1);
 449
 450       if (p == NULL || alloc == NULL)
 451        (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"),
 452                               name);
 453       else
 454        {
 455          strcpy (alloc, name);
 456          p = strrchr (alloc, '_');
 457          *p++ = '\0';
 458          (*_bfd_error_handler)
 459            (_("Output file requires shared library `%s.so.%s'\n"),
 460             alloc, p);
 461          free (alloc);
 462        }
 463
 464       abort ();
 465     }
 466
 467   /* If this symbol is not a PLT/GOT, we do not even need to look at
 468      it.  */
 469   is_plt = IS_PLT_SYM (h->root.root.root.string);
 470
 471   if (is_plt || IS_GOT_SYM (h->root.root.root.string))
 472     {
 473       /* Look up this symbol twice.  Once just as a regular lookup,
 474         and then again following all of the indirect links until we
 475         reach a real symbol.  */
 476       h1 = linux_link_hash_lookup (linux_hash_table (info),
 477                                   (h->root.root.root.string
 478                                    + sizeof PLT_REF_PREFIX - 1),
 479                                   false, false, true);
 480       /* h2 does not follow indirect symbols. */
 481       h2 = linux_link_hash_lookup (linux_hash_table (info),
 482                                   (h->root.root.root.string
 483                                    + sizeof PLT_REF_PREFIX - 1),
 484                                   false, false, false);
 485
 486       /* The real symbol must exist but if it is also an ABS symbol,
 487         there is no need to have a fixup.  This is because they both
 488         came from the same library.  If on the other hand, we had to
 489         use an indirect symbol to get to the real symbol, we add the
 490         fixup anyway, since there are cases where these symbols come
 491         from different shared libraries */
 492       if (h1 != NULL
 493          && (((h1->root.root.type == bfd_link_hash_defined
 494                || h1->root.root.type == bfd_link_hash_defweak)
 495               && ! bfd_is_abs_section (h1->root.root.u.def.section))
 496              || h2->root.root.type == bfd_link_hash_indirect))
 497        {
 498          /* See if there is a "builtin" fixup already present
 499             involving this symbol.  If so, convert it to a regular
 500             fixup.  In the end, this relaxes some of the requirements
 501             about the order of performing fixups.  */
 502          exists = false;
 503          for (f1 = linux_hash_table (info)->fixup_list;
 504               f1 != NULL;
 505               f1 = f1->next)
 506            {
 507              if ((f1->h != h && f1->h != h1)
 508                  || (! f1->builtin && ! f1->jump))
 509                continue;
 510              if (f1->h == h1)
 511               exists = true;
 512              if (! exists
 513                  && bfd_is_abs_section (h->root.root.u.def.section))
 514                {
 515                  f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0);
 516                  f->jump = is_plt;
 517                }
 518              f1->h = h1;
 519              f1->jump = is_plt;
 520              f1->builtin = 0;
 521              exists = true;
 522            }
 523          if (! exists
 524              && bfd_is_abs_section (h->root.root.u.def.section))
 525            {
 526              f = new_fixup (info, h1, h->root.root.u.def.value, 0);
 527              if (f == NULL)
 528                {
 529                  /* FIXME: No way to return error.  */
 530                  abort ();
 531                }
 532              f->jump = is_plt;
 533            }
 534        }
 535
 536       /* Quick and dirty way of stripping these symbols from the
 537         symtab. */
 538       if (bfd_is_abs_section (h->root.root.u.def.section))
 539        h->root.written = true;
 540     }
 541
 542   return true;
 543 }
 544
 545 /* This is called to set the size of the .linux-dynamic section is.
 546    It is called by the Linux linker emulation before_allocation
 547    routine.  We have finished reading all of the input files, and now
 548    we just scan the hash tables to find out how many additional fixups
 549    are required.  */
 550
 551 boolean
 552 bfd_sparclinux_size_dynamic_sections (output_bfd, info)
 553      bfd *output_bfd;
 554      struct bfd_link_info *info;
 555 {
 556   struct fixup *f;
 557   asection *s;
 558
 559   if (output_bfd->xvec != &MY(vec))
 560     return true;
 561
 562   /* First find the fixups... */
 563   linux_link_hash_traverse (linux_hash_table (info),
 564                            linux_tally_symbols,
 565                            (PTR) info);
 566
 567   /* If there are builtin fixups, leave room for a marker.  This is
 568      used by the dynamic linker so that it knows that all that follow
 569      are builtin fixups instead of regular fixups.  */
 570   for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
 571     {
 572       if (f->builtin)
 573        {
 574          ++linux_hash_table (info)->fixup_count;
 575          ++linux_hash_table (info)->local_builtins;
 576          break;
 577        }
 578     }
 579
 580   if (linux_hash_table (info)->dynobj == NULL)
 581     {
 582       if (linux_hash_table (info)->fixup_count > 0)
 583       abort ();
 584       return true;
 585     }
 586
 587   /* Allocate memory for our fixup table.  We will fill it in later.  */
 588   s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
 589                               ".linux-dynamic");
 590   if (s != NULL)
 591     {
 592       s->_raw_size = 8 + linux_hash_table (info)->fixup_count * 8;
 593       s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size);
 594       if (s->contents == NULL)
 595        return false;
 596       memset (s->contents, 0, (size_t) s->_raw_size);
 597     }
 598
 599   return true;
 600 }
 601
 602 /* We come here once we are ready to actually write the fixup table to
 603    the output file.  Scan the fixup tables and so forth and generate
 604    the stuff we need.  */
 605
 606 static boolean
 607 linux_finish_dynamic_link (output_bfd, info)
 608      bfd *output_bfd;
 609      struct bfd_link_info *info;
 610 {
 611   asection *s, *os, *is;
 612   bfd_byte *fixup_table;
 613   struct linux_link_hash_entry *h;
 614   struct fixup *f;
 615   unsigned int new_addr;
 616   int section_offset;
 617   unsigned int fixups_written;
 618
 619   if (linux_hash_table (info)->dynobj == NULL)
 620     return true;
 621
 622   s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
 623                               ".linux-dynamic");
 624   BFD_ASSERT (s != NULL);
 625   os = s->output_section;
 626   fixups_written = 0;
 627
 628 #ifdef LINUX_LINK_DEBUG
 629   printf ("Fixup table file offset: %x  VMA: %x\n",
 630          os->filepos + s->output_offset,
 631          os->vma + s->output_offset);
 632 #endif
 633
 634   fixup_table = s->contents;
 635   bfd_put_32 (output_bfd, linux_hash_table (info)->fixup_count, fixup_table);
 636   fixup_table += 4;
 637
 638   /* Fill in fixup table.  */
 639   for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
 640     {
 641       if (f->builtin)
 642        continue;
 643
 644       if (f->h->root.root.type != bfd_link_hash_defined
 645          && f->h->root.root.type != bfd_link_hash_defweak)
 646        {
 647          (*_bfd_error_handler)
 648            (_("Symbol %s not defined for fixups\n"),
 649             f->h->root.root.root.string);
 650          continue;
 651        }
 652
 653       is = f->h->root.root.u.def.section;
 654       section_offset = is->output_section->vma + is->output_offset;
 655       new_addr = f->h->root.root.u.def.value + section_offset;
 656
 657 #ifdef LINUX_LINK_DEBUG
 658       printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string,
 659              new_addr, f->value);
 660 #endif
 661
 662       if (f->jump)
 663        {
 664          /* Relative address */
 665          new_addr = new_addr - (f->value + 5);
 666          bfd_put_32 (output_bfd, new_addr, fixup_table);
 667          fixup_table += 4;
 668          bfd_put_32 (output_bfd, f->value + 1, fixup_table);
 669          fixup_table += 4;
 670        }
 671       else
 672        {
 673          bfd_put_32 (output_bfd, new_addr, fixup_table);
 674          fixup_table += 4;
 675          bfd_put_32 (output_bfd, f->value, fixup_table);
 676          fixup_table += 4;
 677        }
 678       ++fixups_written;
 679     }
 680
 681   if (linux_hash_table (info)->local_builtins != 0)
 682     {
 683       /* Special marker so we know to switch to the other type of fixup */
 684       bfd_put_32 (output_bfd, 0, fixup_table);
 685       fixup_table += 4;
 686       bfd_put_32 (output_bfd, 0, fixup_table);
 687       fixup_table += 4;
 688       ++fixups_written;
 689       for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
 690        {
 691          if (! f->builtin)
 692            continue;
 693
 694          if (f->h->root.root.type != bfd_link_hash_defined
 695              && f->h->root.root.type != bfd_link_hash_defweak)
 696            {
 697              (*_bfd_error_handler)
 698                (_("Symbol %s not defined for fixups\n"),
 699                 f->h->root.root.root.string);
 700              continue;
 701            }
 702
 703          is = f->h->root.root.u.def.section;
 704          section_offset = is->output_section->vma + is->output_offset;
 705          new_addr = f->h->root.root.u.def.value + section_offset;
 706
 707 #ifdef LINUX_LINK_DEBUG
 708          printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string,
 709                  new_addr, f->value);
 710 #endif
 711
 712          bfd_put_32 (output_bfd, new_addr, fixup_table);
 713          fixup_table += 4;
 714          bfd_put_32 (output_bfd, f->value, fixup_table);
 715          fixup_table += 4;
 716          ++fixups_written;
 717        }
 718   }
 719
 720   if (linux_hash_table (info)->fixup_count != fixups_written)
 721     {
 722       (*_bfd_error_handler) (_("Warning: fixup count mismatch\n"));
 723       while (linux_hash_table (info)->fixup_count > fixups_written)
 724        {
 725          bfd_put_32 (output_bfd, 0, fixup_table);
 726          fixup_table += 4;
 727          bfd_put_32 (output_bfd, 0, fixup_table);
 728          fixup_table += 4;
 729          ++fixups_written;
 730        }
 731     }
 732
 733   h = linux_link_hash_lookup (linux_hash_table (info),
 734                              "__BUILTIN_FIXUPS__",
 735                              false, false, false);
 736
 737   if (h != NULL
 738       && (h->root.root.type == bfd_link_hash_defined
 739          || h->root.root.type == bfd_link_hash_defweak))
 740     {
 741       is = h->root.root.u.def.section;
 742       section_offset = is->output_section->vma + is->output_offset;
 743       new_addr = h->root.root.u.def.value + section_offset;
 744
 745 #ifdef LINUX_LINK_DEBUG
 746       printf ("Builtin fixup table at %x\n", new_addr);
 747 #endif
 748
 749       bfd_put_32 (output_bfd, new_addr, fixup_table);
 750     }
 751   else
 752     bfd_put_32 (output_bfd, 0, fixup_table);
 753
 754   if (bfd_seek (output_bfd, os->filepos + s->output_offset, SEEK_SET) != 0)
 755     return false;
 756
 757   if (bfd_write ((PTR) s->contents, 1, s->_raw_size, output_bfd)
 758       != s->_raw_size)
 759     return false;
 760
 761   return true;
 762 }
 763
 764 #define MY_bfd_link_hash_table_create linux_link_hash_table_create
 765 #define MY_add_one_symbol linux_add_one_symbol
 766 #define MY_finish_dynamic_link linux_finish_dynamic_link
 767
 768 #define MY_zmagic_contiguous 1
 769
 770 #include "aout-target.h"