daily update
[binutils.git] / bfd / sparclinux.c
blob0a936b1966bdf8d844550cc0ad1d28cb65bd4120
1 /* BFD back-end for linux flavored sparc a.out binaries.
2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 2000, 2001, 2002, 2003
3 Free Software Foundation, Inc.
5 This file is part of BFD, the Binary File Descriptor library.
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.
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.
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,
20 USA. */
22 #define TARGET_PAGE_SIZE 4096
23 #define ZMAGIC_DISK_BLOCK_SIZE 1024
24 #define SEGMENT_SIZE TARGET_PAGE_SIZE
25 #define TEXT_START_ADDR 0x0
26 #define N_SHARED_LIB(x) 0
28 #define MACHTYPE_OK(mtype) ((mtype) == M_SPARC || (mtype) == M_UNKNOWN)
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 */
38 #define DEFAULT_ARCH bfd_arch_sparc
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 (sparclinux_,OP)
43 #define TARGETNAME "a.out-sparc-linux"
45 extern const bfd_target MY(vec);
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. */
51 static void MY_final_link_callback
52 PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *));
54 static bfd_boolean sparclinux_bfd_final_link
55 PARAMS ((bfd *abfd, struct bfd_link_info *info));
57 static bfd_boolean
58 sparclinux_bfd_final_link (abfd, info)
59 bfd *abfd;
60 struct bfd_link_info *info;
62 obj_aout_subformat (abfd) = q_magic_format;
63 return NAME(aout,final_link) (abfd, info, MY_final_link_callback);
66 #define MY_bfd_final_link sparclinux_bfd_final_link
68 /* Set the machine type correctly. */
70 static bfd_boolean sparclinux_write_object_contents PARAMS ((bfd *abfd));
72 static bfd_boolean
73 sparclinux_write_object_contents (abfd)
74 bfd *abfd;
76 struct external_exec exec_bytes;
77 struct internal_exec *execp = exec_hdr (abfd);
79 N_SET_MACHTYPE (*execp, M_SPARC);
81 obj_reloc_entry_size (abfd) = RELOC_STD_SIZE;
83 WRITE_HEADERS(abfd, execp);
85 return TRUE;
88 #define MY_write_object_contents sparclinux_write_object_contents
89 /* Code to link against Linux a.out shared libraries. */
91 /* See if a symbol name is a reference to the global offset table. */
93 #ifndef GOT_REF_PREFIX
94 #define GOT_REF_PREFIX "__GOT_"
95 #endif
97 #define IS_GOT_SYM(name) \
98 (strncmp (name, GOT_REF_PREFIX, sizeof GOT_REF_PREFIX - 1) == 0)
100 /* See if a symbol name is a reference to the procedure linkage table. */
102 #ifndef PLT_REF_PREFIX
103 #define PLT_REF_PREFIX "__PLT_"
104 #endif
106 #define IS_PLT_SYM(name) \
107 (strncmp (name, PLT_REF_PREFIX, sizeof PLT_REF_PREFIX - 1) == 0)
109 /* This string is used to generate specialized error messages. */
111 #ifndef NEEDS_SHRLIB
112 #define NEEDS_SHRLIB "__NEEDS_SHRLIB_"
113 #endif
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). */
122 #ifndef SHARABLE_CONFLICTS
123 #define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__"
124 #endif
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. */
136 struct fixup
138 struct fixup *next;
139 struct linux_link_hash_entry *h;
140 bfd_vma value;
142 /* Nonzero if this is a jump instruction that needs to be fixed,
143 zero if this is just a pointer */
144 char jump;
146 char builtin;
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. */
153 struct linux_link_hash_entry
155 struct aout_link_hash_entry root;
158 struct linux_link_hash_table
160 struct aout_link_hash_table root;
162 /* First dynamic object found in link. */
163 bfd *dynobj;
165 /* Number of fixups. */
166 size_t fixup_count;
168 /* Number of builtin fixups. */
169 size_t local_builtins;
171 /* List of fixups. */
172 struct fixup *fixup_list;
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 bfd_boolean linux_link_create_dynamic_sections
183 PARAMS ((bfd *, struct bfd_link_info *));
184 static bfd_boolean linux_add_one_symbol
185 PARAMS ((struct bfd_link_info *, bfd *, const char *, flagword, asection *,
186 bfd_vma, const char *, bfd_boolean, bfd_boolean,
187 struct bfd_link_hash_entry **));
188 static bfd_boolean linux_tally_symbols
189 PARAMS ((struct linux_link_hash_entry *, PTR));
190 static bfd_boolean linux_finish_dynamic_link
191 PARAMS ((bfd *, struct bfd_link_info *));
193 /* Routine to create an entry in an Linux link hash table. */
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;
201 struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry;
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;
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)
217 /* Set local fields; there aren't any. */
220 return (struct bfd_hash_entry *) ret;
223 /* Create a Linux link hash table. */
225 static struct bfd_link_hash_table *
226 linux_link_hash_table_create (abfd)
227 bfd *abfd;
229 struct linux_link_hash_table *ret;
230 bfd_size_type amt = sizeof (struct linux_link_hash_table);
232 ret = (struct linux_link_hash_table *) bfd_malloc (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))
238 free (ret);
239 return (struct bfd_link_hash_table *) NULL;
242 ret->dynobj = NULL;
243 ret->fixup_count = 0;
244 ret->local_builtins = 0;
245 ret->fixup_list = NULL;
247 return &ret->root.root;
250 /* Look up an entry in a Linux link hash table. */
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)))
257 /* Traverse a Linux link hash table. */
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)))
265 /* Get the Linux link hash table from the info structure. This is
266 just a cast. */
268 #define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
270 /* Store the information for a new fixup. */
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;
279 struct fixup *f;
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;
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. */
302 static bfd_boolean
303 linux_link_create_dynamic_sections (abfd, info)
304 bfd *abfd;
305 struct bfd_link_info *info ATTRIBUTE_UNUSED;
307 flagword flags;
308 register asection *s;
310 /* Note that we set the SEC_IN_MEMORY flag. */
311 flags = SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY;
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;
323 return TRUE;
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. */
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;
344 struct linux_link_hash_entry *h;
345 bfd_boolean insert;
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.
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. */
355 insert = FALSE;
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)
363 if (! linux_link_create_dynamic_sections (abfd, info))
364 return FALSE;
365 linux_hash_table (info)->dynobj = abfd;
366 insert = TRUE;
369 if (bfd_is_abs_section (section)
370 && abfd->xvec == info->hash->creator)
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))
378 struct fixup *f;
380 if (hashp != NULL)
381 *hashp = (struct bfd_link_hash_entry *) h;
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);
388 return TRUE;
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;
398 /* Insert a pointer to our table in the set vector. The dynamic
399 linker requires this information. */
400 if (insert)
402 asection *s;
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);
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;
417 return TRUE;
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.
428 This function is called via linux_link_hash_traverse. */
430 static bfd_boolean
431 linux_tally_symbols (h, data)
432 struct linux_link_hash_entry *h;
433 PTR data;
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;
441 if (h->root.root.type == bfd_link_hash_warning)
442 h = (struct linux_link_hash_entry *) h->root.root.u.i.link;
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)
448 const char *name;
449 char *p;
450 char *alloc = NULL;
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);
457 if (p == NULL || alloc == NULL)
458 (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"),
459 name);
460 else
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);
471 abort ();
474 /* If this symbol is not a PLT/GOT, we do not even need to look at
475 it. */
476 is_plt = IS_PLT_SYM (h->root.root.root.string);
478 if (is_plt || IS_GOT_SYM (h->root.root.root.string))
480 /* Look up this symbol twice. Once just as a regular lookup,
481 and then again following all of the indirect links until we
482 reach a real symbol. */
483 h1 = linux_link_hash_lookup (linux_hash_table (info),
484 (h->root.root.root.string
485 + sizeof PLT_REF_PREFIX - 1),
486 FALSE, FALSE, TRUE);
487 /* h2 does not follow indirect symbols. */
488 h2 = linux_link_hash_lookup (linux_hash_table (info),
489 (h->root.root.root.string
490 + sizeof PLT_REF_PREFIX - 1),
491 FALSE, FALSE, FALSE);
493 /* The real symbol must exist but if it is also an ABS symbol,
494 there is no need to have a fixup. This is because they both
495 came from the same library. If on the other hand, we had to
496 use an indirect symbol to get to the real symbol, we add the
497 fixup anyway, since there are cases where these symbols come
498 from different shared libraries */
499 if (h1 != NULL
500 && (((h1->root.root.type == bfd_link_hash_defined
501 || h1->root.root.type == bfd_link_hash_defweak)
502 && ! bfd_is_abs_section (h1->root.root.u.def.section))
503 || h2->root.root.type == bfd_link_hash_indirect))
505 /* See if there is a "builtin" fixup already present
506 involving this symbol. If so, convert it to a regular
507 fixup. In the end, this relaxes some of the requirements
508 about the order of performing fixups. */
509 exists = FALSE;
510 for (f1 = linux_hash_table (info)->fixup_list;
511 f1 != NULL;
512 f1 = f1->next)
514 if ((f1->h != h && f1->h != h1)
515 || (! f1->builtin && ! f1->jump))
516 continue;
517 if (f1->h == h1)
518 exists = TRUE;
519 if (! exists
520 && bfd_is_abs_section (h->root.root.u.def.section))
522 f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0);
523 f->jump = is_plt;
525 f1->h = h1;
526 f1->jump = is_plt;
527 f1->builtin = 0;
528 exists = TRUE;
530 if (! exists
531 && bfd_is_abs_section (h->root.root.u.def.section))
533 f = new_fixup (info, h1, h->root.root.u.def.value, 0);
534 if (f == NULL)
536 /* FIXME: No way to return error. */
537 abort ();
539 f->jump = is_plt;
543 /* Quick and dirty way of stripping these symbols from the
544 symtab. */
545 if (bfd_is_abs_section (h->root.root.u.def.section))
546 h->root.written = TRUE;
549 return TRUE;
552 /* This is called to set the size of the .linux-dynamic section is.
553 It is called by the Linux linker emulation before_allocation
554 routine. We have finished reading all of the input files, and now
555 we just scan the hash tables to find out how many additional fixups
556 are required. */
558 bfd_boolean
559 bfd_sparclinux_size_dynamic_sections (output_bfd, info)
560 bfd *output_bfd;
561 struct bfd_link_info *info;
563 struct fixup *f;
564 asection *s;
566 if (output_bfd->xvec != &MY(vec))
567 return TRUE;
569 /* First find the fixups... */
570 linux_link_hash_traverse (linux_hash_table (info),
571 linux_tally_symbols,
572 (PTR) info);
574 /* If there are builtin fixups, leave room for a marker. This is
575 used by the dynamic linker so that it knows that all that follow
576 are builtin fixups instead of regular fixups. */
577 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
579 if (f->builtin)
581 ++linux_hash_table (info)->fixup_count;
582 ++linux_hash_table (info)->local_builtins;
583 break;
587 if (linux_hash_table (info)->dynobj == NULL)
589 if (linux_hash_table (info)->fixup_count > 0)
590 abort ();
591 return TRUE;
594 /* Allocate memory for our fixup table. We will fill it in later. */
595 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
596 ".linux-dynamic");
597 if (s != NULL)
599 s->_raw_size = linux_hash_table (info)->fixup_count + 1;
600 s->_raw_size *= 8;
601 s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->_raw_size);
602 if (s->contents == NULL)
603 return FALSE;
606 return TRUE;
609 /* We come here once we are ready to actually write the fixup table to
610 the output file. Scan the fixup tables and so forth and generate
611 the stuff we need. */
613 static bfd_boolean
614 linux_finish_dynamic_link (output_bfd, info)
615 bfd *output_bfd;
616 struct bfd_link_info *info;
618 asection *s, *os, *is;
619 bfd_byte *fixup_table;
620 struct linux_link_hash_entry *h;
621 struct fixup *f;
622 unsigned int new_addr;
623 int section_offset;
624 unsigned int fixups_written;
626 if (linux_hash_table (info)->dynobj == NULL)
627 return TRUE;
629 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
630 ".linux-dynamic");
631 BFD_ASSERT (s != NULL);
632 os = s->output_section;
633 fixups_written = 0;
635 #ifdef LINUX_LINK_DEBUG
636 printf ("Fixup table file offset: %x VMA: %x\n",
637 os->filepos + s->output_offset,
638 os->vma + s->output_offset);
639 #endif
641 fixup_table = s->contents;
642 bfd_put_32 (output_bfd,
643 (bfd_vma) linux_hash_table (info)->fixup_count, fixup_table);
644 fixup_table += 4;
646 /* Fill in fixup table. */
647 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
649 if (f->builtin)
650 continue;
652 if (f->h->root.root.type != bfd_link_hash_defined
653 && f->h->root.root.type != bfd_link_hash_defweak)
655 (*_bfd_error_handler)
656 (_("Symbol %s not defined for fixups\n"),
657 f->h->root.root.root.string);
658 continue;
661 is = f->h->root.root.u.def.section;
662 section_offset = is->output_section->vma + is->output_offset;
663 new_addr = f->h->root.root.u.def.value + section_offset;
665 #ifdef LINUX_LINK_DEBUG
666 printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string,
667 new_addr, f->value);
668 #endif
670 if (f->jump)
672 /* Relative address */
673 new_addr = new_addr - (f->value + 5);
674 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
675 fixup_table += 4;
676 bfd_put_32 (output_bfd, f->value + 1, fixup_table);
677 fixup_table += 4;
679 else
681 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
682 fixup_table += 4;
683 bfd_put_32 (output_bfd, f->value, fixup_table);
684 fixup_table += 4;
686 ++fixups_written;
689 if (linux_hash_table (info)->local_builtins != 0)
691 /* Special marker so we know to switch to the other type of fixup */
692 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
693 fixup_table += 4;
694 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
695 fixup_table += 4;
696 ++fixups_written;
697 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
699 if (! f->builtin)
700 continue;
702 if (f->h->root.root.type != bfd_link_hash_defined
703 && f->h->root.root.type != bfd_link_hash_defweak)
705 (*_bfd_error_handler)
706 (_("Symbol %s not defined for fixups\n"),
707 f->h->root.root.root.string);
708 continue;
711 is = f->h->root.root.u.def.section;
712 section_offset = is->output_section->vma + is->output_offset;
713 new_addr = f->h->root.root.u.def.value + section_offset;
715 #ifdef LINUX_LINK_DEBUG
716 printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string,
717 new_addr, f->value);
718 #endif
720 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
721 fixup_table += 4;
722 bfd_put_32 (output_bfd, f->value, fixup_table);
723 fixup_table += 4;
724 ++fixups_written;
728 if (linux_hash_table (info)->fixup_count != fixups_written)
730 (*_bfd_error_handler) (_("Warning: fixup count mismatch\n"));
731 while (linux_hash_table (info)->fixup_count > fixups_written)
733 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
734 fixup_table += 4;
735 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
736 fixup_table += 4;
737 ++fixups_written;
741 h = linux_link_hash_lookup (linux_hash_table (info),
742 "__BUILTIN_FIXUPS__",
743 FALSE, FALSE, FALSE);
745 if (h != NULL
746 && (h->root.root.type == bfd_link_hash_defined
747 || h->root.root.type == bfd_link_hash_defweak))
749 is = h->root.root.u.def.section;
750 section_offset = is->output_section->vma + is->output_offset;
751 new_addr = h->root.root.u.def.value + section_offset;
753 #ifdef LINUX_LINK_DEBUG
754 printf ("Builtin fixup table at %x\n", new_addr);
755 #endif
757 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
759 else
760 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
762 if (bfd_seek (output_bfd, (file_ptr) (os->filepos + s->output_offset),
763 SEEK_SET) != 0)
764 return FALSE;
766 if (bfd_bwrite ((PTR) s->contents, s->_raw_size, output_bfd) != s->_raw_size)
767 return FALSE;
769 return TRUE;
772 #define MY_bfd_link_hash_table_create linux_link_hash_table_create
773 #define MY_add_one_symbol linux_add_one_symbol
774 #define MY_finish_dynamic_link linux_finish_dynamic_link
776 #define MY_zmagic_contiguous 1
778 #include "aout-target.h"