* elf32-spu.c (build_stub): Fix malloc under-allocation.
[binutils.git] / bfd / sparclinux.c
blobb7fef220643d92ebf969d1185ed6a455c4df5a6b
1 /* BFD back-end for linux flavored sparc a.out binaries.
2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1999, 2000, 2001, 2002,
3 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2011
4 Free Software Foundation, Inc.
6 This file is part of BFD, the Binary File Descriptor library.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 MA 02110-1301, USA. */
23 #define TARGET_PAGE_SIZE 4096
24 #define ZMAGIC_DISK_BLOCK_SIZE 1024
25 #define SEGMENT_SIZE TARGET_PAGE_SIZE
26 #define TEXT_START_ADDR 0x0
28 #define MACHTYPE_OK(mtype) ((mtype) == M_SPARC || (mtype) == M_UNKNOWN)
30 #include "sysdep.h"
31 #include "bfd.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) (CONST_STRNEQ (name, GOT_REF_PREFIX))
99 /* See if a symbol name is a reference to the procedure linkage table. */
101 #ifndef PLT_REF_PREFIX
102 #define PLT_REF_PREFIX "__PLT_"
103 #endif
105 #define IS_PLT_SYM(name) (CONST_STRNEQ (name, PLT_REF_PREFIX))
107 /* This string is used to generate specialized error messages. */
109 #ifndef NEEDS_SHRLIB
110 #define NEEDS_SHRLIB "__NEEDS_SHRLIB_"
111 #endif
113 /* This special symbol is a set vector that contains a list of
114 pointers to fixup tables. It will be present in any dynamically
115 linked file. The linker generated fixup table should also be added
116 to the list, and it should always appear in the second slot (the
117 first one is a dummy with a magic number that is defined in
118 crt0.o). */
120 #ifndef SHARABLE_CONFLICTS
121 #define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__"
122 #endif
124 /* We keep a list of fixups. The terminology is a bit strange, but
125 each fixup contains two 32 bit numbers. A regular fixup contains
126 an address and a pointer, and at runtime we should store the
127 address at the location pointed to by the pointer. A builtin fixup
128 contains two pointers, and we should read the address using one
129 pointer and store it at the location pointed to by the other
130 pointer. Builtin fixups come into play when we have duplicate
131 __GOT__ symbols for the same variable. The builtin fixup will copy
132 the GOT pointer from one over into the other. */
134 struct fixup
136 struct fixup *next;
137 struct linux_link_hash_entry *h;
138 bfd_vma value;
140 /* Nonzero if this is a jump instruction that needs to be fixed,
141 zero if this is just a pointer */
142 char jump;
144 char builtin;
147 /* We don't need a special hash table entry structure, but we do need
148 to keep some information between linker passes, so we use a special
149 hash table. */
151 struct linux_link_hash_entry
153 struct aout_link_hash_entry root;
156 struct linux_link_hash_table
158 struct aout_link_hash_table root;
160 /* First dynamic object found in link. */
161 bfd *dynobj;
163 /* Number of fixups. */
164 size_t fixup_count;
166 /* Number of builtin fixups. */
167 size_t local_builtins;
169 /* List of fixups. */
170 struct fixup *fixup_list;
173 static struct bfd_hash_entry *linux_link_hash_newfunc
174 PARAMS ((struct bfd_hash_entry *, struct bfd_hash_table *, const char *));
175 static struct bfd_link_hash_table *linux_link_hash_table_create
176 PARAMS ((bfd *));
177 static struct fixup *new_fixup
178 PARAMS ((struct bfd_link_info *, struct linux_link_hash_entry *,
179 bfd_vma, int));
180 static bfd_boolean linux_link_create_dynamic_sections
181 PARAMS ((bfd *, struct bfd_link_info *));
182 static bfd_boolean linux_add_one_symbol
183 PARAMS ((struct bfd_link_info *, bfd *, const char *, flagword, asection *,
184 bfd_vma, const char *, bfd_boolean, bfd_boolean,
185 struct bfd_link_hash_entry **));
186 static bfd_boolean linux_tally_symbols
187 PARAMS ((struct linux_link_hash_entry *, PTR));
188 static bfd_boolean linux_finish_dynamic_link
189 PARAMS ((bfd *, struct bfd_link_info *));
191 /* Routine to create an entry in an Linux link hash table. */
193 static struct bfd_hash_entry *
194 linux_link_hash_newfunc (entry, table, string)
195 struct bfd_hash_entry *entry;
196 struct bfd_hash_table *table;
197 const char *string;
199 struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry;
201 /* Allocate the structure if it has not already been allocated by a
202 subclass. */
203 if (ret == (struct linux_link_hash_entry *) NULL)
204 ret = ((struct linux_link_hash_entry *)
205 bfd_hash_allocate (table, sizeof (struct linux_link_hash_entry)));
206 if (ret == NULL)
207 return (struct bfd_hash_entry *) ret;
209 /* Call the allocation method of the superclass. */
210 ret = ((struct linux_link_hash_entry *)
211 NAME(aout,link_hash_newfunc) ((struct bfd_hash_entry *) ret,
212 table, string));
213 if (ret != NULL)
215 /* Set local fields; there aren't any. */
218 return (struct bfd_hash_entry *) ret;
221 /* Create a Linux link hash table. */
223 static struct bfd_link_hash_table *
224 linux_link_hash_table_create (abfd)
225 bfd *abfd;
227 struct linux_link_hash_table *ret;
228 bfd_size_type amt = sizeof (struct linux_link_hash_table);
230 ret = (struct linux_link_hash_table *) bfd_malloc (amt);
231 if (ret == (struct linux_link_hash_table *) NULL)
232 return (struct bfd_link_hash_table *) NULL;
233 if (!NAME(aout,link_hash_table_init) (&ret->root, abfd,
234 linux_link_hash_newfunc,
235 sizeof (struct linux_link_hash_entry)))
237 free (ret);
238 return (struct bfd_link_hash_table *) NULL;
241 ret->dynobj = NULL;
242 ret->fixup_count = 0;
243 ret->local_builtins = 0;
244 ret->fixup_list = NULL;
246 return &ret->root.root;
249 /* Look up an entry in a Linux link hash table. */
251 #define linux_link_hash_lookup(table, string, create, copy, follow) \
252 ((struct linux_link_hash_entry *) \
253 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
254 (follow)))
256 /* Traverse a Linux link hash table. */
258 #define linux_link_hash_traverse(table, func, info) \
259 (aout_link_hash_traverse \
260 (&(table)->root, \
261 (bfd_boolean (*) PARAMS ((struct aout_link_hash_entry *, PTR))) (func), \
262 (info)))
264 /* Get the Linux link hash table from the info structure. This is
265 just a cast. */
267 #define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
269 /* Store the information for a new fixup. */
271 static struct fixup *
272 new_fixup (info, h, value, builtin)
273 struct bfd_link_info *info;
274 struct linux_link_hash_entry *h;
275 bfd_vma value;
276 int builtin;
278 struct fixup *f;
280 f = (struct fixup *) bfd_hash_allocate (&info->hash->table,
281 sizeof (struct fixup));
282 if (f == NULL)
283 return f;
284 f->next = linux_hash_table (info)->fixup_list;
285 linux_hash_table (info)->fixup_list = f;
286 f->h = h;
287 f->value = value;
288 f->builtin = builtin;
289 f->jump = 0;
290 ++linux_hash_table (info)->fixup_count;
291 return f;
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. */
301 static bfd_boolean
302 linux_link_create_dynamic_sections (abfd, info)
303 bfd *abfd;
304 struct bfd_link_info *info ATTRIBUTE_UNUSED;
306 flagword flags;
307 register asection *s;
309 /* Note that we set the SEC_IN_MEMORY flag. */
310 flags = SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY;
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;
321 return TRUE;
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. */
328 static bfd_boolean
329 linux_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;
342 struct linux_link_hash_entry *h;
343 bfd_boolean insert;
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.
349 FIXME: What if abfd->xvec != info->output_bfd->xvec? We may
350 want to be able to link Linux a.out and ELF objects together,
351 but serious confusion is possible. */
353 insert = FALSE;
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->output_bfd->xvec)
361 if (! linux_link_create_dynamic_sections (abfd, info))
362 return FALSE;
363 linux_hash_table (info)->dynobj = abfd;
364 insert = TRUE;
367 if (bfd_is_abs_section (section)
368 && abfd->xvec == info->output_bfd->xvec)
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))
376 struct fixup *f;
378 if (hashp != NULL)
379 *hashp = (struct bfd_link_hash_entry *) h;
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);
386 return TRUE;
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;
396 /* Insert a pointer to our table in the set vector. The dynamic
397 linker requires this information. */
398 if (insert)
400 asection *s;
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);
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;
415 return TRUE;
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.
426 This function is called via linux_link_hash_traverse. */
428 static bfd_boolean
429 linux_tally_symbols (struct linux_link_hash_entry *h, void * data)
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;
437 if (h->root.root.type == bfd_link_hash_undefined
438 && CONST_STRNEQ (h->root.root.root.string, NEEDS_SHRLIB))
440 const char *name;
441 char *p;
442 char *alloc = NULL;
444 name = h->root.root.root.string + sizeof NEEDS_SHRLIB - 1;
445 p = strrchr (name, '_');
446 if (p != NULL)
447 alloc = (char *) bfd_malloc ((bfd_size_type) strlen (name) + 1);
449 if (p == NULL || alloc == NULL)
450 (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"),
451 name);
452 else
454 strcpy (alloc, name);
455 p = strrchr (alloc, '_');
456 *p++ = '\0';
457 (*_bfd_error_handler)
458 (_("Output file requires shared library `%s.so.%s'\n"),
459 alloc, p);
460 free (alloc);
463 abort ();
466 /* If this symbol is not a PLT/GOT, we do not even need to look at
467 it. */
468 is_plt = IS_PLT_SYM (h->root.root.root.string);
470 if (is_plt || IS_GOT_SYM (h->root.root.root.string))
472 /* Look up this symbol twice. Once just as a regular lookup,
473 and then again following all of the indirect links until we
474 reach a real symbol. */
475 h1 = linux_link_hash_lookup (linux_hash_table (info),
476 (h->root.root.root.string
477 + sizeof PLT_REF_PREFIX - 1),
478 FALSE, FALSE, TRUE);
479 /* h2 does not follow indirect symbols. */
480 h2 = linux_link_hash_lookup (linux_hash_table (info),
481 (h->root.root.root.string
482 + sizeof PLT_REF_PREFIX - 1),
483 FALSE, FALSE, FALSE);
485 /* The real symbol must exist but if it is also an ABS symbol,
486 there is no need to have a fixup. This is because they both
487 came from the same library. If on the other hand, we had to
488 use an indirect symbol to get to the real symbol, we add the
489 fixup anyway, since there are cases where these symbols come
490 from different shared libraries */
491 if (h1 != NULL
492 && (((h1->root.root.type == bfd_link_hash_defined
493 || h1->root.root.type == bfd_link_hash_defweak)
494 && ! bfd_is_abs_section (h1->root.root.u.def.section))
495 || h2->root.root.type == bfd_link_hash_indirect))
497 /* See if there is a "builtin" fixup already present
498 involving this symbol. If so, convert it to a regular
499 fixup. In the end, this relaxes some of the requirements
500 about the order of performing fixups. */
501 exists = FALSE;
502 for (f1 = linux_hash_table (info)->fixup_list;
503 f1 != NULL;
504 f1 = f1->next)
506 if ((f1->h != h && f1->h != h1)
507 || (! f1->builtin && ! f1->jump))
508 continue;
509 if (f1->h == h1)
510 exists = TRUE;
511 if (! exists
512 && bfd_is_abs_section (h->root.root.u.def.section))
514 f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0);
515 f->jump = is_plt;
517 f1->h = h1;
518 f1->jump = is_plt;
519 f1->builtin = 0;
520 exists = TRUE;
522 if (! exists
523 && bfd_is_abs_section (h->root.root.u.def.section))
525 f = new_fixup (info, h1, h->root.root.u.def.value, 0);
526 if (f == NULL)
528 /* FIXME: No way to return error. */
529 abort ();
531 f->jump = is_plt;
535 /* Quick and dirty way of stripping these symbols from the
536 symtab. */
537 if (bfd_is_abs_section (h->root.root.u.def.section))
538 h->root.written = TRUE;
541 return TRUE;
544 /* This is called to set the size of the .linux-dynamic section is.
545 It is called by the Linux linker emulation before_allocation
546 routine. We have finished reading all of the input files, and now
547 we just scan the hash tables to find out how many additional fixups
548 are required. */
550 bfd_boolean
551 bfd_sparclinux_size_dynamic_sections (output_bfd, info)
552 bfd *output_bfd;
553 struct bfd_link_info *info;
555 struct fixup *f;
556 asection *s;
558 if (output_bfd->xvec != &MY(vec))
559 return TRUE;
561 /* First find the fixups... */
562 linux_link_hash_traverse (linux_hash_table (info),
563 linux_tally_symbols,
564 (PTR) info);
566 /* If there are builtin fixups, leave room for a marker. This is
567 used by the dynamic linker so that it knows that all that follow
568 are builtin fixups instead of regular fixups. */
569 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
571 if (f->builtin)
573 ++linux_hash_table (info)->fixup_count;
574 ++linux_hash_table (info)->local_builtins;
575 break;
579 if (linux_hash_table (info)->dynobj == NULL)
581 if (linux_hash_table (info)->fixup_count > 0)
582 abort ();
583 return TRUE;
586 /* Allocate memory for our fixup table. We will fill it in later. */
587 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
588 ".linux-dynamic");
589 if (s != NULL)
591 s->size = linux_hash_table (info)->fixup_count + 1;
592 s->size *= 8;
593 s->contents = (bfd_byte *) bfd_zalloc (output_bfd, s->size);
594 if (s->contents == NULL)
595 return FALSE;
598 return TRUE;
601 /* We come here once we are ready to actually write the fixup table to
602 the output file. Scan the fixup tables and so forth and generate
603 the stuff we need. */
605 static bfd_boolean
606 linux_finish_dynamic_link (output_bfd, info)
607 bfd *output_bfd;
608 struct bfd_link_info *info;
610 asection *s, *os, *is;
611 bfd_byte *fixup_table;
612 struct linux_link_hash_entry *h;
613 struct fixup *f;
614 unsigned int new_addr;
615 int section_offset;
616 unsigned int fixups_written;
618 if (linux_hash_table (info)->dynobj == NULL)
619 return TRUE;
621 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
622 ".linux-dynamic");
623 BFD_ASSERT (s != NULL);
624 os = s->output_section;
625 fixups_written = 0;
627 #ifdef LINUX_LINK_DEBUG
628 printf ("Fixup table file offset: %x VMA: %x\n",
629 os->filepos + s->output_offset,
630 os->vma + s->output_offset);
631 #endif
633 fixup_table = s->contents;
634 bfd_put_32 (output_bfd,
635 (bfd_vma) linux_hash_table (info)->fixup_count, fixup_table);
636 fixup_table += 4;
638 /* Fill in fixup table. */
639 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
641 if (f->builtin)
642 continue;
644 if (f->h->root.root.type != bfd_link_hash_defined
645 && f->h->root.root.type != bfd_link_hash_defweak)
647 (*_bfd_error_handler)
648 (_("Symbol %s not defined for fixups\n"),
649 f->h->root.root.root.string);
650 continue;
653 is = f->h->root.root.u.def.section;
654 section_offset = is->output_section->vma + is->output_offset;
655 new_addr = f->h->root.root.u.def.value + section_offset;
657 #ifdef LINUX_LINK_DEBUG
658 printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string,
659 new_addr, f->value);
660 #endif
662 if (f->jump)
664 /* Relative address */
665 new_addr = new_addr - (f->value + 5);
666 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
667 fixup_table += 4;
668 bfd_put_32 (output_bfd, f->value + 1, fixup_table);
669 fixup_table += 4;
671 else
673 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
674 fixup_table += 4;
675 bfd_put_32 (output_bfd, f->value, fixup_table);
676 fixup_table += 4;
678 ++fixups_written;
681 if (linux_hash_table (info)->local_builtins != 0)
683 /* Special marker so we know to switch to the other type of fixup */
684 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
685 fixup_table += 4;
686 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
687 fixup_table += 4;
688 ++fixups_written;
689 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
691 if (! f->builtin)
692 continue;
694 if (f->h->root.root.type != bfd_link_hash_defined
695 && f->h->root.root.type != bfd_link_hash_defweak)
697 (*_bfd_error_handler)
698 (_("Symbol %s not defined for fixups\n"),
699 f->h->root.root.root.string);
700 continue;
703 is = f->h->root.root.u.def.section;
704 section_offset = is->output_section->vma + is->output_offset;
705 new_addr = f->h->root.root.u.def.value + section_offset;
707 #ifdef LINUX_LINK_DEBUG
708 printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string,
709 new_addr, f->value);
710 #endif
712 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
713 fixup_table += 4;
714 bfd_put_32 (output_bfd, f->value, fixup_table);
715 fixup_table += 4;
716 ++fixups_written;
720 if (linux_hash_table (info)->fixup_count != fixups_written)
722 (*_bfd_error_handler) (_("Warning: fixup count mismatch\n"));
723 while (linux_hash_table (info)->fixup_count > fixups_written)
725 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
726 fixup_table += 4;
727 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
728 fixup_table += 4;
729 ++fixups_written;
733 h = linux_link_hash_lookup (linux_hash_table (info),
734 "__BUILTIN_FIXUPS__",
735 FALSE, FALSE, FALSE);
737 if (h != NULL
738 && (h->root.root.type == bfd_link_hash_defined
739 || h->root.root.type == bfd_link_hash_defweak))
741 is = h->root.root.u.def.section;
742 section_offset = is->output_section->vma + is->output_offset;
743 new_addr = h->root.root.u.def.value + section_offset;
745 #ifdef LINUX_LINK_DEBUG
746 printf ("Builtin fixup table at %x\n", new_addr);
747 #endif
749 bfd_put_32 (output_bfd, (bfd_vma) new_addr, fixup_table);
751 else
752 bfd_put_32 (output_bfd, (bfd_vma) 0, fixup_table);
754 if (bfd_seek (output_bfd, (file_ptr) (os->filepos + s->output_offset),
755 SEEK_SET) != 0)
756 return FALSE;
758 if (bfd_bwrite ((PTR) s->contents, s->size, output_bfd) != s->size)
759 return FALSE;
761 return TRUE;
764 #define MY_bfd_link_hash_table_create linux_link_hash_table_create
765 #define MY_add_one_symbol linux_add_one_symbol
766 #define MY_finish_dynamic_link linux_finish_dynamic_link
768 #define MY_zmagic_contiguous 1
770 #include "aout-target.h"