bfd/i386linux.c

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