1241744Sgrehan/* BFD back-end for linux flavored sparc a.out binaries. 2241744Sgrehan Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1999, 2000, 2001, 2002, 3241744Sgrehan 2003, 2004, 2006, 2007 Free Software Foundation, Inc. 4241744Sgrehan 5241744Sgrehan This file is part of BFD, the Binary File Descriptor library. 6241744Sgrehan 7241744Sgrehan This program is free software; you can redistribute it and/or modify 8241744Sgrehan it under the terms of the GNU General Public License as published by 9241744Sgrehan the Free Software Foundation; either version 2 of the License, or 10241744Sgrehan (at your option) any later version. 11241744Sgrehan 12241744Sgrehan This program is distributed in the hope that it will be useful, 13241744Sgrehan but WITHOUT ANY WARRANTY; without even the implied warranty of 14241744Sgrehan MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15241744Sgrehan GNU General Public License for more details. 16241744Sgrehan 17241744Sgrehan You should have received a copy of the GNU General Public License 18241744Sgrehan along with this program; if not, write to the Free Software 19241744Sgrehan Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, 20241744Sgrehan USA. */ 21241744Sgrehan 22241744Sgrehan#define TARGET_PAGE_SIZE 4096 23241744Sgrehan#define ZMAGIC_DISK_BLOCK_SIZE 1024 24241744Sgrehan#define SEGMENT_SIZE TARGET_PAGE_SIZE 25241744Sgrehan#define TEXT_START_ADDR 0x0 26241744Sgrehan#define N_SHARED_LIB(x) 0 27241744Sgrehan 28241744Sgrehan#define MACHTYPE_OK(mtype) ((mtype) == M_SPARC || (mtype) == M_UNKNOWN) 29241744Sgrehan 30241744Sgrehan#include "sysdep.h" 31241744Sgrehan#include "bfd.h" 32241744Sgrehan#include "libbfd.h" 33241744Sgrehan#include "aout/aout64.h" 34241744Sgrehan#include "aout/stab_gnu.h" 35241744Sgrehan#include "aout/ar.h" 36241744Sgrehan#include "libaout.h" /* BFD a.out internal data structures */ 37241744Sgrehan 38241744Sgrehan#define DEFAULT_ARCH bfd_arch_sparc 39241744Sgrehan/* Do not "beautify" the CONCAT* macro args. Traditional C will not 40241744Sgrehan remove whitespace added here, and thus will fail to concatenate 41241744Sgrehan the tokens. */ 42268976Sjhb#define MY(OP) CONCAT2 (sparclinux_,OP) 43241744Sgrehan#define TARGETNAME "a.out-sparc-linux" 44241744Sgrehan 45241744Sgrehanextern const bfd_target MY(vec); 46241744Sgrehan 47249321Sneel/* We always generate QMAGIC files in preference to ZMAGIC files. It 48241744Sgrehan would be possible to make this a linker option, if that ever 49241744Sgrehan becomes important. */ 50241744Sgrehan 51241744Sgrehanstatic void MY_final_link_callback 52241744Sgrehan PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *)); 53241744Sgrehan 54241744Sgrehanstatic bfd_boolean sparclinux_bfd_final_link 55241744Sgrehan PARAMS ((bfd *abfd, struct bfd_link_info *info)); 56241744Sgrehan 57241744Sgrehanstatic bfd_boolean 58241744Sgrehansparclinux_bfd_final_link (abfd, info) 59241744Sgrehan bfd *abfd; 60241744Sgrehan struct bfd_link_info *info; 61247144Sgrehan{ 62241744Sgrehan obj_aout_subformat (abfd) = q_magic_format; 63241744Sgrehan return NAME(aout,final_link) (abfd, info, MY_final_link_callback); 64241744Sgrehan} 65241744Sgrehan 66241744Sgrehan#define MY_bfd_final_link sparclinux_bfd_final_link 67241744Sgrehan 68241744Sgrehan/* Set the machine type correctly. */ 69241744Sgrehan 70249322Sneelstatic bfd_boolean sparclinux_write_object_contents PARAMS ((bfd *abfd)); 71249321Sneel 72241744Sgrehanstatic bfd_boolean 73241744Sgrehansparclinux_write_object_contents (abfd) 74241744Sgrehan bfd *abfd; 75241744Sgrehan{ 76241744Sgrehan struct external_exec exec_bytes; 77241744Sgrehan struct internal_exec *execp = exec_hdr (abfd); 78241744Sgrehan 79241744Sgrehan N_SET_MACHTYPE (*execp, M_SPARC); 80241744Sgrehan 81241744Sgrehan obj_reloc_entry_size (abfd) = RELOC_STD_SIZE; 82241744Sgrehan 83247144Sgrehan WRITE_HEADERS(abfd, execp); 84247144Sgrehan 85241744Sgrehan return TRUE; 86241744Sgrehan} 87241744Sgrehan 88241744Sgrehan#define MY_write_object_contents sparclinux_write_object_contents 89241744Sgrehan/* Code to link against Linux a.out shared libraries. */ 90247144Sgrehan 91241744Sgrehan/* See if a symbol name is a reference to the global offset table. */ 92241744Sgrehan 93241744Sgrehan#ifndef GOT_REF_PREFIX 94241744Sgrehan#define GOT_REF_PREFIX "__GOT_" 95241744Sgrehan#endif 96241744Sgrehan 97241744Sgrehan#define IS_GOT_SYM(name) (CONST_STRNEQ (name, GOT_REF_PREFIX)) 98241744Sgrehan 99241744Sgrehan/* See if a symbol name is a reference to the procedure linkage table. */ 100241744Sgrehan 101247144Sgrehan#ifndef PLT_REF_PREFIX 102241744Sgrehan#define PLT_REF_PREFIX "__PLT_" 103241744Sgrehan#endif 104241744Sgrehan 105247144Sgrehan#define IS_PLT_SYM(name) (CONST_STRNEQ (name, PLT_REF_PREFIX)) 106241744Sgrehan 107241744Sgrehan/* This string is used to generate specialized error messages. */ 108241744Sgrehan 109241744Sgrehan#ifndef NEEDS_SHRLIB 110241744Sgrehan#define NEEDS_SHRLIB "__NEEDS_SHRLIB_" 111241744Sgrehan#endif 112241744Sgrehan 113241744Sgrehan/* This special symbol is a set vector that contains a list of 114241744Sgrehan pointers to fixup tables. It will be present in any dynamically 115241744Sgrehan linked file. The linker generated fixup table should also be added 116241744Sgrehan to the list, and it should always appear in the second slot (the 117241744Sgrehan first one is a dummy with a magic number that is defined in 118241744Sgrehan crt0.o). */ 119241744Sgrehan 120241744Sgrehan#ifndef SHARABLE_CONFLICTS 121241744Sgrehan#define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__" 122247144Sgrehan#endif 123241744Sgrehan 124241744Sgrehan/* We keep a list of fixups. The terminology is a bit strange, but 125241744Sgrehan each fixup contains two 32 bit numbers. A regular fixup contains 126249322Sneel an address and a pointer, and at runtime we should store the 127247144Sgrehan address at the location pointed to by the pointer. A builtin fixup 128241744Sgrehan contains two pointers, and we should read the address using one 129241744Sgrehan pointer and store it at the location pointed to by the other 130241744Sgrehan pointer. Builtin fixups come into play when we have duplicate 131249322Sneel __GOT__ symbols for the same variable. The builtin fixup will copy 132241744Sgrehan the GOT pointer from one over into the other. */ 133241744Sgrehan 134241744Sgrehanstruct fixup 135241744Sgrehan{ 136241744Sgrehan struct fixup *next; 137243640Sneel struct linux_link_hash_entry *h; 138243640Sneel bfd_vma value; 139243640Sneel 140243640Sneel /* Nonzero if this is a jump instruction that needs to be fixed, 141243640Sneel zero if this is just a pointer */ 142243640Sneel char jump; 143243640Sneel 144243640Sneel char builtin; 145243640Sneel}; 146243640Sneel 147243640Sneel/* We don't need a special hash table entry structure, but we do need 148243640Sneel to keep some information between linker passes, so we use a special 149243640Sneel hash table. */ 150243640Sneel 151243640Sneelstruct linux_link_hash_entry 152243640Sneel{ 153243640Sneel struct aout_link_hash_entry root; 154243640Sneel}; 155243640Sneel 156243640Sneelstruct linux_link_hash_table 157243640Sneel{ 158243640Sneel struct aout_link_hash_table root; 159241744Sgrehan 160270159Sgrehan /* First dynamic object found in link. */ 161270159Sgrehan bfd *dynobj; 162270159Sgrehan 163241744Sgrehan /* Number of fixups. */ 164241744Sgrehan size_t fixup_count; 165270159Sgrehan 166249321Sneel /* Number of builtin fixups. */ 167249322Sneel size_t local_builtins; 168241744Sgrehan 169241744Sgrehan /* List of fixups. */ 170241744Sgrehan struct fixup *fixup_list; 171241744Sgrehan}; 172241744Sgrehan 173241744Sgrehanstatic struct bfd_hash_entry *linux_link_hash_newfunc 174243640Sneel PARAMS ((struct bfd_hash_entry *, struct bfd_hash_table *, const char *)); 175243640Sneelstatic struct bfd_link_hash_table *linux_link_hash_table_create 176243640Sneel PARAMS ((bfd *)); 177243640Sneelstatic struct fixup *new_fixup 178243640Sneel PARAMS ((struct bfd_link_info *, struct linux_link_hash_entry *, 179249321Sneel bfd_vma, int)); 180247144Sgrehanstatic bfd_boolean linux_link_create_dynamic_sections 181247144Sgrehan PARAMS ((bfd *, struct bfd_link_info *)); 182247144Sgrehanstatic bfd_boolean linux_add_one_symbol 183249322Sneel PARAMS ((struct bfd_link_info *, bfd *, const char *, flagword, asection *, 184243640Sneel bfd_vma, const char *, bfd_boolean, bfd_boolean, 185247144Sgrehan struct bfd_link_hash_entry **)); 186241744Sgrehanstatic bfd_boolean linux_tally_symbols 187241744Sgrehan PARAMS ((struct linux_link_hash_entry *, PTR)); 188247144Sgrehanstatic bfd_boolean linux_finish_dynamic_link 189270159Sgrehan PARAMS ((bfd *, struct bfd_link_info *)); 190270159Sgrehan 191270159Sgrehan/* Routine to create an entry in an Linux link hash table. */ 192270159Sgrehan 193270159Sgrehanstatic struct bfd_hash_entry * 194270159Sgrehanlinux_link_hash_newfunc (entry, table, string) 195270159Sgrehan struct bfd_hash_entry *entry; 196270159Sgrehan struct bfd_hash_table *table; 197270159Sgrehan const char *string; 198270159Sgrehan{ 199270159Sgrehan struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry; 200270159Sgrehan 201270159Sgrehan /* Allocate the structure if it has not already been allocated by a 202270159Sgrehan subclass. */ 203270159Sgrehan if (ret == (struct linux_link_hash_entry *) NULL) 204270159Sgrehan ret = ((struct linux_link_hash_entry *) 205270159Sgrehan bfd_hash_allocate (table, sizeof (struct linux_link_hash_entry))); 206243640Sneel if (ret == NULL) 207270159Sgrehan return (struct bfd_hash_entry *) ret; 208270159Sgrehan 209270159Sgrehan /* Call the allocation method of the superclass. */ 210270159Sgrehan ret = ((struct linux_link_hash_entry *) 211241744Sgrehan NAME(aout,link_hash_newfunc) ((struct bfd_hash_entry *) ret, 212241744Sgrehan table, string)); 213241744Sgrehan if (ret != NULL) 214247144Sgrehan { 215247144Sgrehan /* Set local fields; there aren't any. */ 216241744Sgrehan } 217249321Sneel 218241744Sgrehan return (struct bfd_hash_entry *) ret; 219241744Sgrehan} 220241744Sgrehan 221241744Sgrehan/* Create a Linux link hash table. */ 222241744Sgrehan 223249321Sneelstatic struct bfd_link_hash_table * 224241744Sgrehanlinux_link_hash_table_create (abfd) 225241744Sgrehan bfd *abfd; 226241744Sgrehan{ 227241744Sgrehan struct linux_link_hash_table *ret; 228249322Sneel bfd_size_type amt = sizeof (struct linux_link_hash_table); 229249321Sneel 230249321Sneel ret = (struct linux_link_hash_table *) bfd_malloc (amt); 231249322Sneel if (ret == (struct linux_link_hash_table *) NULL) 232241744Sgrehan return (struct bfd_link_hash_table *) NULL; 233241744Sgrehan if (!NAME(aout,link_hash_table_init) (&ret->root, abfd, 234241744Sgrehan linux_link_hash_newfunc, 235241744Sgrehan sizeof (struct linux_link_hash_entry))) 236241744Sgrehan { 237241744Sgrehan free (ret); 238241744Sgrehan return (struct bfd_link_hash_table *) NULL; 239241744Sgrehan } 240247144Sgrehan 241247144Sgrehan ret->dynobj = NULL; 242247144Sgrehan ret->fixup_count = 0; 243247144Sgrehan ret->local_builtins = 0; 244247144Sgrehan ret->fixup_list = NULL; 245247144Sgrehan 246247144Sgrehan return &ret->root.root; 247247144Sgrehan} 248247144Sgrehan 249247144Sgrehan/* Look up an entry in a Linux link hash table. */ 250247144Sgrehan 251247144Sgrehan#define linux_link_hash_lookup(table, string, create, copy, follow) \ 252247144Sgrehan ((struct linux_link_hash_entry *) \ 253247144Sgrehan aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\ 254249321Sneel (follow))) 255249321Sneel 256249321Sneel/* Traverse a Linux link hash table. */ 257249321Sneel 258249321Sneel#define linux_link_hash_traverse(table, func, info) \ 259249321Sneel (aout_link_hash_traverse \ 260249321Sneel (&(table)->root, \ 261249322Sneel (bfd_boolean (*) PARAMS ((struct aout_link_hash_entry *, PTR))) (func), \ 262249321Sneel (info))) 263249321Sneel 264249321Sneel/* Get the Linux link hash table from the info structure. This is 265249321Sneel just a cast. */ 266249321Sneel 267270159Sgrehan#define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash)) 268249321Sneel 269249321Sneel/* Store the information for a new fixup. */ 270249321Sneel 271249321Sneelstatic struct fixup * 272249321Sneelnew_fixup (info, h, value, builtin) 273249321Sneel struct bfd_link_info *info; 274249321Sneel struct linux_link_hash_entry *h; 275249321Sneel bfd_vma value; 276249322Sneel int builtin; 277249321Sneel{ 278249321Sneel struct fixup *f; 279249321Sneel 280249321Sneel f = (struct fixup *) bfd_hash_allocate (&info->hash->table, 281249321Sneel sizeof (struct fixup)); 282249321Sneel if (f == NULL) 283249321Sneel return f; 284241744Sgrehan f->next = linux_hash_table (info)->fixup_list; 285241744Sgrehan linux_hash_table (info)->fixup_list = f; 286241744Sgrehan f->h = h; 287241744Sgrehan f->value = value; 288247144Sgrehan f->builtin = builtin; 289247144Sgrehan f->jump = 0; 290249322Sneel ++linux_hash_table (info)->fixup_count; 291241744Sgrehan 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 301static bfd_boolean 302linux_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_with_flags (abfd, ".linux-dynamic", flags); 315 if (s == NULL 316 || ! bfd_set_section_alignment (abfd, s, 2)) 317 return FALSE; 318 s->size = 0; 319 s->contents = 0; 320 321 return TRUE; 322} 323 324/* Function to add a single symbol to the linker hash table. This is 325 a wrapper around _bfd_generic_link_add_one_symbol which handles the 326 tweaking needed for dynamic linking support. */ 327 328static bfd_boolean 329linux_add_one_symbol (info, abfd, name, flags, section, value, string, 330 copy, collect, hashp) 331 struct bfd_link_info *info; 332 bfd *abfd; 333 const char *name; 334 flagword flags; 335 asection *section; 336 bfd_vma value; 337 const char *string; 338 bfd_boolean copy; 339 bfd_boolean collect; 340 struct bfd_link_hash_entry **hashp; 341{ 342 struct linux_link_hash_entry *h; 343 bfd_boolean insert; 344 345 /* Look up and see if we already have this symbol in the hash table. 346 If we do, and the defining entry is from a shared library, we 347 need to create the dynamic sections. 348 349 FIXME: What if abfd->xvec != info->hash->creator? We may want to 350 be able to link Linux a.out and ELF objects together, but serious 351 confusion is possible. */ 352 353 insert = FALSE; 354 355 if (! info->relocatable 356 && linux_hash_table (info)->dynobj == NULL 357 && strcmp (name, SHARABLE_CONFLICTS) == 0 358 && (flags & BSF_CONSTRUCTOR) != 0 359 && abfd->xvec == info->hash->creator) 360 { 361 if (! linux_link_create_dynamic_sections (abfd, info)) 362 return FALSE; 363 linux_hash_table (info)->dynobj = abfd; 364 insert = TRUE; 365 } 366 367 if (bfd_is_abs_section (section) 368 && abfd->xvec == info->hash->creator) 369 { 370 h = linux_link_hash_lookup (linux_hash_table (info), name, FALSE, 371 FALSE, FALSE); 372 if (h != NULL 373 && (h->root.root.type == bfd_link_hash_defined 374 || h->root.root.type == bfd_link_hash_defweak)) 375 { 376 struct fixup *f; 377 378 if (hashp != NULL) 379 *hashp = (struct bfd_link_hash_entry *) h; 380 381 f = new_fixup (info, h, value, ! IS_PLT_SYM (name)); 382 if (f == NULL) 383 return FALSE; 384 f->jump = IS_PLT_SYM (name); 385 386 return TRUE; 387 } 388 } 389 390 /* Do the usual procedure for adding a symbol. */ 391 if (! _bfd_generic_link_add_one_symbol (info, abfd, name, flags, section, 392 value, string, copy, collect, 393 hashp)) 394 return FALSE; 395 396 /* Insert a pointer to our table in the set vector. The dynamic 397 linker requires this information. */ 398 if (insert) 399 { 400 asection *s; 401 402 /* Here we do our special thing to add the pointer to the 403 dynamic section in the SHARABLE_CONFLICTS set vector. */ 404 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 405 ".linux-dynamic"); 406 BFD_ASSERT (s != NULL); 407 408 if (! (_bfd_generic_link_add_one_symbol 409 (info, linux_hash_table (info)->dynobj, SHARABLE_CONFLICTS, 410 BSF_GLOBAL | BSF_CONSTRUCTOR, s, (bfd_vma) 0, NULL, 411 FALSE, FALSE, NULL))) 412 return FALSE; 413 } 414 415 return TRUE; 416} 417 418/* We will crawl the hash table and come here for every global symbol. 419 We will examine each entry and see if there are indications that we 420 need to add a fixup. There are two possible cases - one is where 421 you have duplicate definitions of PLT or GOT symbols - these will 422 have already been caught and added as "builtin" fixups. If we find 423 that the corresponding non PLT/GOT symbol is also present, we 424 convert it to a regular fixup instead. 425 426 This function is called via linux_link_hash_traverse. */ 427 428static bfd_boolean 429linux_tally_symbols (struct linux_link_hash_entry *h, void * 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 bfd_boolean exists; 436 437 if (h->root.root.type == bfd_link_hash_warning) 438 h = (struct linux_link_hash_entry *) h->root.root.u.i.link; 439 440 if (h->root.root.type == bfd_link_hash_undefined 441 && CONST_STRNEQ (h->root.root.root.string, NEEDS_SHRLIB)) 442 { 443 const char *name; 444 char *p; 445 char *alloc = NULL; 446 447 name = h->root.root.root.string + sizeof NEEDS_SHRLIB - 1; 448 p = strrchr (name, '_'); 449 if (p != NULL) 450 alloc = (char *) bfd_malloc ((bfd_size_type) strlen (name) + 1); 451 452 if (p == NULL || alloc == NULL) 453 (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"), 454 name); 455 else 456 { 457 strcpy (alloc, name); 458 p = strrchr (alloc, '_'); 459 *p++ = '\0'; 460 (*_bfd_error_handler) 461 (_("Output file requires shared library `%s.so.%s'\n"), 462 alloc, p); 463 free (alloc); 464 } 465 466 abort (); 467 } 468 469 /* If this symbol is not a PLT/GOT, we do not even need to look at 470 it. */ 471 is_plt = IS_PLT_SYM (h->root.root.root.string); 472 473 if (is_plt || IS_GOT_SYM (h->root.root.root.string)) 474 { 475 /* Look up this symbol twice. Once just as a regular lookup, 476 and then again following all of the indirect links until we 477 reach a real symbol. */ 478 h1 = linux_link_hash_lookup (linux_hash_table (info), 479 (h->root.root.root.string 480 + sizeof PLT_REF_PREFIX - 1), 481 FALSE, FALSE, TRUE); 482 /* h2 does not follow indirect symbols. */ 483 h2 = linux_link_hash_lookup (linux_hash_table (info), 484 (h->root.root.root.string 485 + sizeof PLT_REF_PREFIX - 1), 486 FALSE, FALSE, FALSE); 487 488 /* The real symbol must exist but if it is also an ABS symbol, 489 there is no need to have a fixup. This is because they both 490 came from the same library. If on the other hand, we had to 491 use an indirect symbol to get to the real symbol, we add the 492 fixup anyway, since there are cases where these symbols come 493 from different shared libraries */ 494 if (h1 != NULL 495 && (((h1->root.root.type == bfd_link_hash_defined 496 || h1->root.root.type == bfd_link_hash_defweak) 497 && ! bfd_is_abs_section (h1->root.root.u.def.section)) 498 || h2->root.root.type == bfd_link_hash_indirect)) 499 { 500 /* See if there is a "builtin" fixup already present 501 involving this symbol. If so, convert it to a regular 502 fixup. In the end, this relaxes some of the requirements 503 about the order of performing fixups. */ 504 exists = FALSE; 505 for (f1 = linux_hash_table (info)->fixup_list; 506 f1 != NULL; 507 f1 = f1->next) 508 { 509 if ((f1->h != h && f1->h != h1) 510 || (! f1->builtin && ! f1->jump)) 511 continue; 512 if (f1->h == h1) 513 exists = TRUE; 514 if (! exists 515 && bfd_is_abs_section (h->root.root.u.def.section)) 516 { 517 f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0); 518 f->jump = is_plt; 519 } 520 f1->h = h1; 521 f1->jump = is_plt; 522 f1->builtin = 0; 523 exists = TRUE; 524 } 525 if (! exists 526 && bfd_is_abs_section (h->root.root.u.def.section)) 527 { 528 f = new_fixup (info, h1, h->root.root.u.def.value, 0); 529 if (f == NULL) 530 { 531 /* FIXME: No way to return error. */ 532 abort (); 533 } 534 f->jump = is_plt; 535 } 536 } 537 538 /* Quick and dirty way of stripping these symbols from the 539 symtab. */ 540 if (bfd_is_abs_section (h->root.root.u.def.section)) 541 h->root.written = TRUE; 542 } 543 544 return TRUE; 545} 546 547/* This is called to set the size of the .linux-dynamic section is. 548 It is called by the Linux linker emulation before_allocation 549 routine. We have finished reading all of the input files, and now 550 we just scan the hash tables to find out how many additional fixups 551 are required. */ 552 553bfd_boolean 554bfd_sparclinux_size_dynamic_sections (output_bfd, info) 555 bfd *output_bfd; 556 struct bfd_link_info *info; 557{ 558 struct fixup *f; 559 asection *s; 560 561 if (output_bfd->xvec != &MY(vec)) 562 return TRUE; 563 564 /* First find the fixups... */ 565 linux_link_hash_traverse (linux_hash_table (info), 566 linux_tally_symbols, 567 (PTR) info); 568 569 /* If there are builtin fixups, leave room for a marker. This is 570 used by the dynamic linker so that it knows that all that follow 571 are builtin fixups instead of regular fixups. */ 572 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 573 { 574 if (f->builtin) 575 { 576 ++linux_hash_table (info)->fixup_count; 577 ++linux_hash_table (info)->local_builtins; 578 break; 579 } 580 } 581 582 if (linux_hash_table (info)->dynobj == NULL) 583 { 584 if (linux_hash_table (info)->fixup_count > 0) 585 abort (); 586 return TRUE; 587 } 588 589 /* Allocate memory for our fixup table. We will fill it in later. */ 590 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 591 ".linux-dynamic"); 592 if (s != NULL) 593 { 594 s->size = linux_hash_table (info)->fixup_count + 1; 595 s->size *= 8; 596 s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->size); 597 if (s->contents == NULL) 598 return FALSE; 599 } 600 601 return TRUE; 602} 603 604/* We come here once we are ready to actually write the fixup table to 605 the output file. Scan the fixup tables and so forth and generate 606 the stuff we need. */ 607 608static bfd_boolean 609linux_finish_dynamic_link (output_bfd, info) 610 bfd *output_bfd; 611 struct bfd_link_info *info; 612{ 613 asection *s, *os, *is; 614 bfd_byte *fixup_table; 615 struct linux_link_hash_entry *h; 616 struct fixup *f; 617 unsigned int new_addr; 618 int section_offset; 619 unsigned int fixups_written; 620 621 if (linux_hash_table (info)->dynobj == NULL) 622 return TRUE; 623 624 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj, 625 ".linux-dynamic"); 626 BFD_ASSERT (s != NULL); 627 os = s->output_section; 628 fixups_written = 0; 629 630#ifdef LINUX_LINK_DEBUG 631 printf ("Fixup table file offset: %x VMA: %x\n", 632 os->filepos + s->output_offset, 633 os->vma + s->output_offset); 634#endif 635 636 fixup_table = s->contents; 637 bfd_put_32 (output_bfd, 638 (bfd_vma) linux_hash_table (info)->fixup_count, fixup_table); 639 fixup_table += 4; 640 641 /* Fill in fixup table. */ 642 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 643 { 644 if (f->builtin) 645 continue; 646 647 if (f->h->root.root.type != bfd_link_hash_defined 648 && f->h->root.root.type != bfd_link_hash_defweak) 649 { 650 (*_bfd_error_handler) 651 (_("Symbol %s not defined for fixups\n"), 652 f->h->root.root.root.string); 653 continue; 654 } 655 656 is = f->h->root.root.u.def.section; 657 section_offset = is->output_section->vma + is->output_offset; 658 new_addr = f->h->root.root.u.def.value + section_offset; 659 660#ifdef LINUX_LINK_DEBUG 661 printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string, 662 new_addr, f->value); 663#endif 664 665 if (f->jump) 666 { 667 /* Relative address */ 668 new_addr = new_addr - (f->value + 5); 669 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 670 fixup_table += 4; 671 bfd_put_32 (output_bfd, f->value + 1, fixup_table); 672 fixup_table += 4; 673 } 674 else 675 { 676 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 677 fixup_table += 4; 678 bfd_put_32 (output_bfd, f->value, fixup_table); 679 fixup_table += 4; 680 } 681 ++fixups_written; 682 } 683 684 if (linux_hash_table (info)->local_builtins != 0) 685 { 686 /* Special marker so we know to switch to the other type of fixup */ 687 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 688 fixup_table += 4; 689 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 690 fixup_table += 4; 691 ++fixups_written; 692 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next) 693 { 694 if (! f->builtin) 695 continue; 696 697 if (f->h->root.root.type != bfd_link_hash_defined 698 && f->h->root.root.type != bfd_link_hash_defweak) 699 { 700 (*_bfd_error_handler) 701 (_("Symbol %s not defined for fixups\n"), 702 f->h->root.root.root.string); 703 continue; 704 } 705 706 is = f->h->root.root.u.def.section; 707 section_offset = is->output_section->vma + is->output_offset; 708 new_addr = f->h->root.root.u.def.value + section_offset; 709 710#ifdef LINUX_LINK_DEBUG 711 printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string, 712 new_addr, f->value); 713#endif 714 715 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 716 fixup_table += 4; 717 bfd_put_32 (output_bfd, f->value, fixup_table); 718 fixup_table += 4; 719 ++fixups_written; 720 } 721 } 722 723 if (linux_hash_table (info)->fixup_count != fixups_written) 724 { 725 (*_bfd_error_handler) (_("Warning: fixup count mismatch\n")); 726 while (linux_hash_table (info)->fixup_count > fixups_written) 727 { 728 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 729 fixup_table += 4; 730 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 731 fixup_table += 4; 732 ++fixups_written; 733 } 734 } 735 736 h = linux_link_hash_lookup (linux_hash_table (info), 737 "__BUILTIN_FIXUPS__", 738 FALSE, FALSE, FALSE); 739 740 if (h != NULL 741 && (h->root.root.type == bfd_link_hash_defined 742 || h->root.root.type == bfd_link_hash_defweak)) 743 { 744 is = h->root.root.u.def.section; 745 section_offset = is->output_section->vma + is->output_offset; 746 new_addr = h->root.root.u.def.value + section_offset; 747 748#ifdef LINUX_LINK_DEBUG 749 printf ("Builtin fixup table at %x\n", new_addr); 750#endif 751 752 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table); 753 } 754 else 755 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table); 756 757 if (bfd_seek (output_bfd, (file_ptr) (os->filepos + s->output_offset), 758 SEEK_SET) != 0) 759 return FALSE; 760 761 if (bfd_bwrite ((PTR) s->contents, s->size, output_bfd) != s->size) 762 return FALSE; 763 764 return TRUE; 765} 766 767#define MY_bfd_link_hash_table_create linux_link_hash_table_create 768#define MY_add_one_symbol linux_add_one_symbol 769#define MY_finish_dynamic_link linux_finish_dynamic_link 770 771#define MY_zmagic_contiguous 1 772 773#include "aout-target.h" 774