1 /* BFD back-end for linux flavored i386 a.out binaries. 2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1999, 2001, 2002, 2003, 3 2004, 2006 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., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, 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 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 sizeof (struct linux_link_hash_entry))) 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 (bfd_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 bfd_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->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 bfd_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 bfd_boolean copy; 341 bfd_boolean collect; 342 struct bfd_link_hash_entry **hashp; 343 { 344 struct linux_link_hash_entry *h; 345 bfd_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->relocatable 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 bfd_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 bfd_boolean exists; 440 441 if (h->root.root.type == bfd_link_hash_warning) 442 h = (struct linux_link_hash_entry *) h->root.root.u.i.link; 443 444 if (h->root.root.type == bfd_link_hash_undefined 445 && strncmp (h->root.root.root.string, NEEDS_SHRLIB, 446 sizeof NEEDS_SHRLIB - 1) == 0) 447 { 448 const char *name; 449 char *p; 450 char *alloc = NULL; 451 452 name = h->root.root.root.string + sizeof NEEDS_SHRLIB - 1; 453 p = strrchr (name, '_'); 454 if (p != NULL) 455 alloc = (char *) bfd_malloc ((bfd_size_type) strlen (name) + 1); 456 457 if (p == NULL || alloc == NULL) 458 (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"), 459 name); 460 else 461 { 462 strcpy (alloc, name); 463 p = strrchr (alloc, '_'); 464 *p++ = '\0'; 465 (*_bfd_error_handler) 466 (_("Output file requires shared library `%s.so.%s'\n"), 467 alloc, p); 468 free (alloc); 469 } 470 471 abort (); 472 } 473 474 /* If this symbol is not a PLT/GOT, we do not even need to look at it */ 475 is_plt = IS_PLT_SYM (h->root.root.root.string); 476 477 if (is_plt || IS_GOT_SYM (h->root.root.root.string)) 478 { 479 /* Look up this symbol twice. Once just as a regular lookup, 480 and then again following all of the indirect links until we 481 reach a real symbol. */ 482 h1 = linux_link_hash_lookup (linux_hash_table (info), 483 (h->root.root.root.string 484 + sizeof PLT_REF_PREFIX - 1), 485 FALSE, FALSE, TRUE); 486 /* h2 does not follow indirect symbols. */ 487 h2 = linux_link_hash_lookup (linux_hash_table (info), 488 (h->root.root.root.string 489 + sizeof PLT_REF_PREFIX - 1), 490 FALSE, FALSE, FALSE); 491 492 /* The real symbol must exist but if it is also an ABS symbol, 493 there is no need to have a fixup. This is because they both 494 came from the same library. If on the other hand, we had to 495 use an indirect symbol to get to the real symbol, we add the 496 fixup anyway, since there are cases where these symbols come 497 from different shared libraries */ 498 if (h1 != NULL 499 && (((h1->root.root.type == bfd_link_hash_defined 500 || h1->root.root.type == bfd_link_hash_defweak) 501 && ! bfd_is_abs_section (h1->root.root.u.def.section)) 502 || h2->root.root.type == bfd_link_hash_indirect)) 503 { 504 /* See if there is a "builtin" fixup already present 505 involving this symbol. If so, convert it to a regular 506 fixup. In the end, this relaxes some of the requirements 507 about the order of performing fixups. */ 508 exists = FALSE; 509 for (f1 = linux_hash_table (info)->fixup_list; 510 f1 != NULL; 511 f1 = f1->next) 512 { 513 if ((f1->h != h && f1->h != h1) 514 || (! f1->builtin && ! f1->jump)) 515 continue; 516 if (f1->h == h1) 517 exists = TRUE; 518 if (! exists 519 && bfd_is_abs_section (h->root.root.u.def.section)) 520 { 521 f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0); 522 f->jump = is_plt; 523 } 524 f1->h = h1; 525 f1->jump = is_plt; 526 f1->builtin = 0; 527 exists = TRUE; 528 } 529 if (! exists 530 && bfd_is_abs_section (h->root.root.u.def.section)) 531 { 532 f = new_fixup (info, h1, h->root.root.u.def.value, 0); 533 if (f == NULL) 534 { 535 /* FIXME: No way to return error. */ 536 abort (); 537 } 538 f->jump = is_plt; 539 } 540 } 541 542 /* Quick and dirty way of stripping these symbols from the 543 symtab. */ 544 if (bfd_is_abs_section (h->root.root.u.def.section)) 545 h->root.written = TRUE; 546 } 547 548 return TRUE; 549 } 550 551 /* This is called to set the size of the .linux-dynamic section is. 552 It is called by the Linux linker emulation before_allocation 553 routine. We have finished reading all of the input files, and now 554 we just scan the hash tables to find out how many additional fixups 555 are required. */ 556 557 bfd_boolean 558 bfd_i386linux_size_dynamic_sections (output_bfd, info) 559 bfd *output_bfd; 560 struct bfd_link_info *info; 561 { 562 struct fixup *f; 563 asection *s; 564 565 if (output_bfd->xvec != &MY(vec)) 566 return TRUE; 567 568 /* First find the fixups... */ 569 linux_link_hash_traverse (linux_hash_table (info), 570 linux_tally_symbols, 571 (PTR) info); 572 573 /* If there are builtin fixups, leave room for a marker. This is 574 used by the dynamic linker so that it knows that all that follow 575 are builtin fixups instead of regular fixups. */ 576 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 577 { 578 if (f->builtin) 579 { 580 ++linux_hash_table (info)->fixup_count; 581 ++linux_hash_table (info)->local_builtins; 582 break; 583 } 584 } 585 586 if (linux_hash_table (info)->dynobj == NULL) 587 { 588 if (linux_hash_table (info)->fixup_count > 0) 589 abort (); 590 return TRUE; 591 } 592 593 /* Allocate memory for our fixup table. We will fill it in later. */ 594 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 595 ".linux-dynamic"); 596 if (s != NULL) 597 { 598 s->size = linux_hash_table (info)->fixup_count + 1; 599 s->size *= 8; 600 s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->size); 601 if (s->contents == NULL) 602 return FALSE; 603 } 604 605 return TRUE; 606 } 607 608 /* We come here once we are ready to actually write the fixup table to 609 the output file. Scan the fixup tables and so forth and generate 610 the stuff we need. */ 611 612 static bfd_boolean 613 linux_finish_dynamic_link (output_bfd, info) 614 bfd *output_bfd; 615 struct bfd_link_info *info; 616 { 617 asection *s, *os, *is; 618 bfd_byte *fixup_table; 619 struct linux_link_hash_entry *h; 620 struct fixup *f; 621 unsigned int new_addr; 622 int section_offset; 623 unsigned int fixups_written; 624 625 if (linux_hash_table (info)->dynobj == NULL) 626 return TRUE; 627 628 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 629 ".linux-dynamic"); 630 BFD_ASSERT (s != NULL); 631 os = s->output_section; 632 fixups_written = 0; 633 634 #ifdef LINUX_LINK_DEBUG 635 printf ("Fixup table file offset: %x VMA: %x\n", 636 os->filepos + s->output_offset, 637 os->vma + s->output_offset); 638 #endif 639 640 fixup_table = s->contents; 641 bfd_put_32 (output_bfd, 642 (bfd_vma) linux_hash_table (info)->fixup_count, fixup_table); 643 fixup_table += 4; 644 645 /* Fill in fixup table. */ 646 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 647 { 648 if (f->builtin) 649 continue; 650 651 if (f->h->root.root.type != bfd_link_hash_defined 652 && f->h->root.root.type != bfd_link_hash_defweak) 653 { 654 (*_bfd_error_handler) 655 (_("Symbol %s not defined for fixups\n"), 656 f->h->root.root.root.string); 657 continue; 658 } 659 660 is = f->h->root.root.u.def.section; 661 section_offset = is->output_section->vma + is->output_offset; 662 new_addr = f->h->root.root.u.def.value + section_offset; 663 664 #ifdef LINUX_LINK_DEBUG 665 printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string, 666 new_addr, f->value); 667 #endif 668 669 if (f->jump) 670 { 671 /* Relative address */ 672 new_addr = new_addr - (f->value + 5); 673 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 674 fixup_table += 4; 675 bfd_put_32 (output_bfd, f->value + 1, fixup_table); 676 fixup_table += 4; 677 } 678 else 679 { 680 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 681 fixup_table += 4; 682 bfd_put_32 (output_bfd, f->value, fixup_table); 683 fixup_table += 4; 684 } 685 ++fixups_written; 686 } 687 688 if (linux_hash_table (info)->local_builtins != 0) 689 { 690 /* Special marker so we know to switch to the other type of fixup */ 691 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 692 fixup_table += 4; 693 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 694 fixup_table += 4; 695 ++fixups_written; 696 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 697 { 698 if (! f->builtin) 699 continue; 700 701 if (f->h->root.root.type != bfd_link_hash_defined 702 && f->h->root.root.type != bfd_link_hash_defweak) 703 { 704 (*_bfd_error_handler) 705 (_("Symbol %s not defined for fixups\n"), 706 f->h->root.root.root.string); 707 continue; 708 } 709 710 is = f->h->root.root.u.def.section; 711 section_offset = is->output_section->vma + is->output_offset; 712 new_addr = f->h->root.root.u.def.value + section_offset; 713 714 #ifdef LINUX_LINK_DEBUG 715 printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string, 716 new_addr, f->value); 717 #endif 718 719 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 720 fixup_table += 4; 721 bfd_put_32 (output_bfd, f->value, fixup_table); 722 fixup_table += 4; 723 ++fixups_written; 724 } 725 } 726 727 if (linux_hash_table (info)->fixup_count != fixups_written) 728 { 729 (*_bfd_error_handler) (_("Warning: fixup count mismatch\n")); 730 while (linux_hash_table (info)->fixup_count > fixups_written) 731 { 732 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 733 fixup_table += 4; 734 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 735 fixup_table += 4; 736 ++fixups_written; 737 } 738 } 739 740 h = linux_link_hash_lookup (linux_hash_table (info), 741 "__BUILTIN_FIXUPS__", 742 FALSE, FALSE, FALSE); 743 744 if (h != NULL 745 && (h->root.root.type == bfd_link_hash_defined 746 || h->root.root.type == bfd_link_hash_defweak)) 747 { 748 is = h->root.root.u.def.section; 749 section_offset = is->output_section->vma + is->output_offset; 750 new_addr = h->root.root.u.def.value + section_offset; 751 752 #ifdef LINUX_LINK_DEBUG 753 printf ("Builtin fixup table at %x\n", new_addr); 754 #endif 755 756 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 757 } 758 else 759 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 760 761 if (bfd_seek (output_bfd, (file_ptr) (os->filepos + s->output_offset), 762 SEEK_SET) != 0) 763 return FALSE; 764 765 if (bfd_bwrite ((PTR) s->contents, s->size, output_bfd) != s->size) 766 return FALSE; 767 768 return TRUE; 769 } 770 771 #define MY_bfd_link_hash_table_create linux_link_hash_table_create 772 #define MY_add_one_symbol linux_add_one_symbol 773 #define MY_finish_dynamic_link linux_finish_dynamic_link 774 775 #define MY_zmagic_contiguous 1 776 777 #include "aout-target.h" 778