bfd/i386linux.c

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