source: trunk/src/binutils/bfd/m68klinux.c@ 466

Last change on this file since 466 was 10, checked in by bird, 22 years ago

Initial revision

  • Property cvs2svn:cvs-rev set to 1.1
  • Property svn:eol-style set to native
  • Property svn:executable set to *
File size: 22.2 KB
Line 
1/* BFD back-end for linux flavored m68k a.out binaries.
2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 1999, 2000
3 Free Software Foundation, Inc.
4
5This file is part of BFD, the Binary File Descriptor library.
6
7This program is free software; you can redistribute it and/or modify
8it under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 2 of the License, or
10(at your option) any later version.
11
12This program is distributed in the hope that it will be useful,
13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with this program; if not, write to the Free Software
19Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
20
21#define TARGET_PAGE_SIZE 4096
22#define ZMAGIC_DISK_BLOCK_SIZE 1024
23#define SEGMENT_SIZE TARGET_PAGE_SIZE
24#define TEXT_START_ADDR 0x0
25#define N_SHARED_LIB(x) 0
26#define BYTES_IN_WORD 4
27
28#define MACHTYPE_OK(mtype) ((mtype) == M_68020 || (mtype) == M_UNKNOWN)
29
30#include "bfd.h"
31#include "sysdep.h"
32#include "libbfd.h"
33#include "aout/aout64.h"
34#include "aout/stab_gnu.h"
35#include "aout/ar.h"
36#include "libaout.h" /* BFD a.out internal data structures */
37
38#define TARGET_IS_BIG_ENDIAN_P
39#define DEFAULT_ARCH bfd_arch_m68k
40#define MY(OP) CAT(m68klinux_,OP)
41#define TARGETNAME "a.out-m68k-linux"
42
43extern const bfd_target MY(vec);
44
45/* We always generate QMAGIC files in preference to ZMAGIC files. It
46 would be possible to make this a linker option, if that ever
47 becomes important. */
48
49static void MY_final_link_callback
50 PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *));
51static boolean m68klinux_bfd_final_link
52 PARAMS ((bfd *, struct bfd_link_info *));
53static boolean m68klinux_write_object_contents PARAMS ((bfd *));
54
55static boolean
56m68klinux_bfd_final_link (abfd, info)
57 bfd *abfd;
58 struct bfd_link_info *info;
59{
60 obj_aout_subformat (abfd) = q_magic_format;
61 return NAME(aout,final_link) (abfd, info, MY_final_link_callback);
62}
63
64#define MY_bfd_final_link m68klinux_bfd_final_link
65
66/* Set the machine type correctly. */
67
68static boolean
69m68klinux_write_object_contents (abfd)
70 bfd *abfd;
71{
72 struct external_exec exec_bytes;
73 struct internal_exec *execp = exec_hdr (abfd);
74
75 N_SET_MACHTYPE (*execp, M_68020);
76
77 obj_reloc_entry_size (abfd) = RELOC_STD_SIZE;
78
79 WRITE_HEADERS(abfd, execp);
80
81 return true;
82}
83
84#define MY_write_object_contents m68klinux_write_object_contents
85
86
87/* Code to link against Linux a.out shared libraries. */
88
89/* See if a symbol name is a reference to the global offset table. */
90
91#ifndef GOT_REF_PREFIX
92#define GOT_REF_PREFIX "__GOT_"
93#endif
94
95#define IS_GOT_SYM(name) \
96 (strncmp (name, GOT_REF_PREFIX, sizeof GOT_REF_PREFIX - 1) == 0)
97
98/* See if a symbol name is a reference to the procedure linkage table. */
99
100#ifndef PLT_REF_PREFIX
101#define PLT_REF_PREFIX "__PLT_"
102#endif
103
104#define IS_PLT_SYM(name) \
105 (strncmp (name, PLT_REF_PREFIX, sizeof PLT_REF_PREFIX - 1) == 0)
106
107/* This string is used to generate specialized error messages. */
108
109#ifndef NEEDS_SHRLIB
110#define NEEDS_SHRLIB "__NEEDS_SHRLIB_"
111#endif
112
113/* This special symbol is a set vector that contains a list of
114 pointers to fixup tables. It will be present in any dynamicly
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). */
119
120#ifndef SHARABLE_CONFLICTS
121#define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__"
122#endif
123
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. */
133
134struct fixup
135{
136 struct fixup *next;
137 struct linux_link_hash_entry *h;
138 bfd_vma value;
139
140 /* Nonzero if this is a jump instruction that needs to be fixed,
141 zero if this is just a pointer */
142 char jump;
143
144 char builtin;
145};
146
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. */
150
151struct linux_link_hash_entry
152{
153 struct aout_link_hash_entry root;
154};
155
156struct linux_link_hash_table
157{
158 struct aout_link_hash_table root;
159
160 /* First dynamic object found in link. */
161 bfd *dynobj;
162
163 /* Number of fixups. */
164 size_t fixup_count;
165
166 /* Number of builtin fixups. */
167 size_t local_builtins;
168
169 /* List of fixups. */
170 struct fixup *fixup_list;
171};
172
173static struct bfd_hash_entry *linux_link_hash_newfunc
174 PARAMS ((struct bfd_hash_entry *, struct bfd_hash_table *, const char *));
175static struct bfd_link_hash_table *linux_link_hash_table_create
176 PARAMS ((bfd *));
177static struct fixup *new_fixup
178 PARAMS ((struct bfd_link_info *, struct linux_link_hash_entry *,
179 bfd_vma, int));
180static boolean linux_link_create_dynamic_sections
181 PARAMS ((bfd *, struct bfd_link_info *));
182static boolean linux_add_one_symbol
183 PARAMS ((struct bfd_link_info *, bfd *, const char *, flagword, asection *,
184 bfd_vma, const char *, boolean, boolean,
185 struct bfd_link_hash_entry **));
186static boolean linux_tally_symbols
187 PARAMS ((struct linux_link_hash_entry *, PTR));
188static boolean linux_finish_dynamic_link
189 PARAMS ((bfd *, struct bfd_link_info *));
190
191/* Routine to create an entry in an Linux link hash table. */
192
193static struct bfd_hash_entry *
194linux_link_hash_newfunc (entry, table, string)
195 struct bfd_hash_entry *entry;
196 struct bfd_hash_table *table;
197 const char *string;
198{
199 struct linux_link_hash_entry *ret = (struct linux_link_hash_entry *) entry;
200
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;
208
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)
214 {
215 /* Set local fields; there aren't any. */
216 }
217
218 return (struct bfd_hash_entry *) ret;
219}
220
221/* Create a Linux link hash table. */
222
223static struct bfd_link_hash_table *
224linux_link_hash_table_create (abfd)
225 bfd *abfd;
226{
227 struct linux_link_hash_table *ret;
228
229 ret = ((struct linux_link_hash_table *)
230 bfd_alloc (abfd, sizeof (struct linux_link_hash_table)));
231 if (ret == (struct linux_link_hash_table *) NULL)
232 {
233 bfd_set_error (bfd_error_no_memory);
234 return (struct bfd_link_hash_table *) NULL;
235 }
236 if (! NAME(aout,link_hash_table_init) (&ret->root, abfd,
237 linux_link_hash_newfunc))
238 {
239 free (ret);
240 return (struct bfd_link_hash_table *) NULL;
241 }
242
243 ret->dynobj = NULL;
244 ret->fixup_count = 0;
245 ret->local_builtins = 0;
246 ret->fixup_list = NULL;
247
248 return &ret->root.root;
249}
250
251/* Look up an entry in a Linux link hash table. */
252
253#define linux_link_hash_lookup(table, string, create, copy, follow) \
254 ((struct linux_link_hash_entry *) \
255 aout_link_hash_lookup (&(table)->root, (string), (create), (copy),\
256 (follow)))
257
258/* Traverse a Linux link hash table. */
259
260#define linux_link_hash_traverse(table, func, info) \
261 (aout_link_hash_traverse \
262 (&(table)->root, \
263 (boolean (*) PARAMS ((struct aout_link_hash_entry *, PTR))) (func), \
264 (info)))
265
266/* Get the Linux link hash table from the info structure. This is
267 just a cast. */
268
269#define linux_hash_table(p) ((struct linux_link_hash_table *) ((p)->hash))
270
271/* Store the information for a new fixup. */
272
273static struct fixup *
274new_fixup (info, h, value, builtin)
275 struct bfd_link_info *info;
276 struct linux_link_hash_entry *h;
277 bfd_vma value;
278 int builtin;
279{
280 struct fixup *f;
281
282 f = (struct fixup *) bfd_hash_allocate (&info->hash->table,
283 sizeof (struct fixup));
284 if (f == NULL)
285 return f;
286 f->next = linux_hash_table (info)->fixup_list;
287 linux_hash_table (info)->fixup_list = f;
288 f->h = h;
289 f->value = value;
290 f->builtin = builtin;
291 f->jump = 0;
292 ++linux_hash_table (info)->fixup_count;
293 return f;
294}
295
296/* We come here once we realize that we are going to link to a shared
297 library. We need to create a special section that contains the
298 fixup table, and we ultimately need to add a pointer to this into
299 the set vector for SHARABLE_CONFLICTS. At this point we do not
300 know the size of the section, but that's OK - we just need to
301 create it for now. */
302
303static boolean
304linux_link_create_dynamic_sections (abfd, info)
305 bfd *abfd;
306 struct bfd_link_info *info ATTRIBUTE_UNUSED;
307{
308 flagword flags;
309 register asection *s;
310
311 /* Note that we set the SEC_IN_MEMORY flag. */
312 flags = SEC_ALLOC | SEC_LOAD | SEC_HAS_CONTENTS | SEC_IN_MEMORY;
313
314 /* We choose to use the name ".linux-dynamic" for the fixup table.
315 Why not? */
316 s = bfd_make_section (abfd, ".linux-dynamic");
317 if (s == NULL
318 || ! bfd_set_section_flags (abfd, s, flags)
319 || ! bfd_set_section_alignment (abfd, s, 2))
320 return false;
321 s->_raw_size = 0;
322 s->contents = 0;
323
324 return true;
325}
326
327/* Function to add a single symbol to the linker hash table. This is
328 a wrapper around _bfd_generic_link_add_one_symbol which handles the
329 tweaking needed for dynamic linking support. */
330
331static boolean
332linux_add_one_symbol (info, abfd, name, flags, section, value, string,
333 copy, collect, hashp)
334 struct bfd_link_info *info;
335 bfd *abfd;
336 const char *name;
337 flagword flags;
338 asection *section;
339 bfd_vma value;
340 const char *string;
341 boolean copy;
342 boolean collect;
343 struct bfd_link_hash_entry **hashp;
344{
345 struct linux_link_hash_entry *h;
346 boolean insert;
347
348 /* Look up and see if we already have this symbol in the hash table.
349 If we do, and the defining entry is from a shared library, we
350 need to create the dynamic sections.
351
352 FIXME: What if abfd->xvec != info->hash->creator? We may want to
353 be able to link Linux a.out and ELF objects together, but serious
354 confusion is possible. */
355
356 insert = false;
357
358 if (! info->relocateable
359 && linux_hash_table (info)->dynobj == NULL
360 && strcmp (name, SHARABLE_CONFLICTS) == 0
361 && (flags & BSF_CONSTRUCTOR) != 0
362 && abfd->xvec == info->hash->creator)
363 {
364 if (! linux_link_create_dynamic_sections (abfd, info))
365 return false;
366 linux_hash_table (info)->dynobj = abfd;
367 insert = true;
368 }
369
370 if (bfd_is_abs_section (section)
371 && abfd->xvec == info->hash->creator)
372 {
373 h = linux_link_hash_lookup (linux_hash_table (info), name, false,
374 false, false);
375 if (h != NULL
376 && (h->root.root.type == bfd_link_hash_defined
377 || h->root.root.type == bfd_link_hash_defweak))
378 {
379 struct fixup *f;
380
381 if (hashp != NULL)
382 *hashp = (struct bfd_link_hash_entry *) h;
383
384 f = new_fixup (info, h, value, ! IS_PLT_SYM (name));
385 if (f == NULL)
386 return false;
387 f->jump = IS_PLT_SYM (name);
388
389 return true;
390 }
391 }
392
393 /* Do the usual procedure for adding a symbol. */
394 if (! _bfd_generic_link_add_one_symbol (info, abfd, name, flags, section,
395 value, string, copy, collect,
396 hashp))
397 return false;
398
399 /* Insert a pointer to our table in the set vector. The dynamic
400 linker requires this information */
401 if (insert)
402 {
403 asection *s;
404
405 /* Here we do our special thing to add the pointer to the
406 dynamic section in the SHARABLE_CONFLICTS set vector. */
407 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
408 ".linux-dynamic");
409 BFD_ASSERT (s != NULL);
410
411 if (! (_bfd_generic_link_add_one_symbol
412 (info, linux_hash_table (info)->dynobj, SHARABLE_CONFLICTS,
413 BSF_GLOBAL | BSF_CONSTRUCTOR, s, 0, NULL, 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
430static boolean
431linux_tally_symbols (h, data)
432 struct linux_link_hash_entry *h;
433 PTR data;
434{
435 struct bfd_link_info *info = (struct bfd_link_info *) data;
436 struct fixup *f, *f1;
437 int is_plt;
438 struct linux_link_hash_entry *h1, *h2;
439 boolean exists;
440
441 if (h->root.root.type == bfd_link_hash_undefined
442 && strncmp (h->root.root.root.string, NEEDS_SHRLIB,
443 sizeof NEEDS_SHRLIB - 1) == 0)
444 {
445 const char *name;
446 char *p;
447 char *alloc = NULL;
448
449 name = h->root.root.root.string + sizeof NEEDS_SHRLIB - 1;
450 p = strrchr (name, '_');
451 if (p != NULL)
452 alloc = (char *) bfd_malloc (strlen (name) + 1);
453
454 if (p == NULL || alloc == NULL)
455 (*_bfd_error_handler) (_("Output file requires shared library `%s'\n"),
456 name);
457 else
458 {
459 strcpy (alloc, name);
460 p = strrchr (alloc, '_');
461 *p++ = '\0';
462 (*_bfd_error_handler)
463 (_("Output file requires shared library `%s.so.%s'\n"),
464 alloc, p);
465 free (alloc);
466 }
467
468 abort ();
469 }
470
471 /* If this symbol is not a PLT/GOT, we do not even need to look at it */
472 is_plt = IS_PLT_SYM (h->root.root.root.string);
473
474 if (is_plt || IS_GOT_SYM (h->root.root.root.string))
475 {
476 /* Look up this symbol twice. Once just as a regular lookup,
477 and then again following all of the indirect links until we
478 reach a real symbol. */
479 h1 = linux_link_hash_lookup (linux_hash_table (info),
480 (h->root.root.root.string
481 + sizeof PLT_REF_PREFIX - 1),
482 false, false, true);
483 /* h2 does not follow indirect symbols. */
484 h2 = linux_link_hash_lookup (linux_hash_table (info),
485 (h->root.root.root.string
486 + sizeof PLT_REF_PREFIX - 1),
487 false, false, false);
488
489 /* The real symbol must exist but if it is also an ABS symbol,
490 there is no need to have a fixup. This is because they both
491 came from the same library. If on the other hand, we had to
492 use an indirect symbol to get to the real symbol, we add the
493 fixup anyway, since there are cases where these symbols come
494 from different shared libraries */
495 if (h1 != NULL
496 && (((h1->root.root.type == bfd_link_hash_defined
497 || h1->root.root.type == bfd_link_hash_defweak)
498 && ! bfd_is_abs_section (h1->root.root.u.def.section))
499 || h2->root.root.type == bfd_link_hash_indirect))
500 {
501 /* See if there is a "builtin" fixup already present
502 involving this symbol. If so, convert it to a regular
503 fixup. In the end, this relaxes some of the requirements
504 about the order of performing fixups. */
505 exists = false;
506 for (f1 = linux_hash_table (info)->fixup_list;
507 f1 != NULL;
508 f1 = f1->next)
509 {
510 if ((f1->h != h && f1->h != h1)
511 || (! f1->builtin && ! f1->jump))
512 continue;
513 if (f1->h == h1)
514 exists = true;
515 if (! exists
516 && bfd_is_abs_section (h->root.root.u.def.section))
517 {
518 f = new_fixup (info, h1, f1->h->root.root.u.def.value, 0);
519 f->jump = is_plt;
520 }
521 f1->h = h1;
522 f1->jump = is_plt;
523 f1->builtin = 0;
524 exists = true;
525 }
526 if (! exists
527 && bfd_is_abs_section (h->root.root.u.def.section))
528 {
529 f = new_fixup (info, h1, h->root.root.u.def.value, 0);
530 if (f == NULL)
531 {
532 /* FIXME: No way to return error. */
533 abort ();
534 }
535 f->jump = is_plt;
536 }
537 }
538
539 /* Quick and dirty way of stripping these symbols from the
540 symtab. */
541 if (bfd_is_abs_section (h->root.root.u.def.section))
542 h->root.written = true;
543 }
544
545 return true;
546}
547
548/* This is called to set the size of the .linux-dynamic section is.
549 It is called by the Linux linker emulation before_allocation
550 routine. We have finished reading all of the input files, and now
551 we just scan the hash tables to find out how many additional fixups
552 are required. */
553
554boolean
555bfd_m68klinux_size_dynamic_sections (output_bfd, info)
556 bfd *output_bfd;
557 struct bfd_link_info *info;
558{
559 struct fixup *f;
560 asection *s;
561
562 if (output_bfd->xvec != &MY(vec))
563 return true;
564
565 /* First find the fixups... */
566 linux_link_hash_traverse (linux_hash_table (info),
567 linux_tally_symbols,
568 (PTR) info);
569
570 /* If there are builtin fixups, leave room for a marker. This is
571 used by the dynamic linker so that it knows that all that follow
572 are builtin fixups instead of regular fixups. */
573 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
574 {
575 if (f->builtin)
576 {
577 ++linux_hash_table (info)->fixup_count;
578 ++linux_hash_table (info)->local_builtins;
579 break;
580 }
581 }
582
583 if (linux_hash_table (info)->dynobj == NULL)
584 {
585 if (linux_hash_table (info)->fixup_count > 0)
586 abort ();
587 return true;
588 }
589
590 /* Allocate memory for our fixup table. We will fill it in later. */
591 s = bfd_get_section_by_name (linux_hash_table (info)->dynobj,
592 ".linux-dynamic");
593 if (s != NULL)
594 {
595 s->_raw_size = 8 + linux_hash_table (info)->fixup_count * 8;
596 s->contents = (bfd_byte *) bfd_alloc (output_bfd, s->_raw_size);
597 if (s->contents == NULL)
598 {
599 bfd_set_error (bfd_error_no_memory);
600 return false;
601 }
602 memset (s->contents, 0, (size_t) s->_raw_size);
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
612static boolean
613linux_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, linux_hash_table (info)->fixup_count, fixup_table);
642 fixup_table += 4;
643
644 /* Fill in fixup table. */
645 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
646 {
647 if (f->builtin)
648 continue;
649
650 if (f->h->root.root.type != bfd_link_hash_defined
651 && f->h->root.root.type != bfd_link_hash_defweak)
652 {
653 (*_bfd_error_handler)
654 (_("Symbol %s not defined for fixups\n"),
655 f->h->root.root.root.string);
656 continue;
657 }
658
659 is = f->h->root.root.u.def.section;
660 section_offset = is->output_section->vma + is->output_offset;
661 new_addr = f->h->root.root.u.def.value + section_offset;
662
663#ifdef LINUX_LINK_DEBUG
664 printf ("Fixup(%d) %s: %x %x\n",f->jump, f->h->root.root.string,
665 new_addr, f->value);
666#endif
667
668 if (f->jump)
669 {
670 bfd_put_32 (output_bfd, new_addr, fixup_table);
671 fixup_table += 4;
672 bfd_put_32 (output_bfd, f->value + 2, fixup_table);
673 fixup_table += 4;
674 }
675 else
676 {
677 bfd_put_32 (output_bfd, new_addr, fixup_table);
678 fixup_table += 4;
679 bfd_put_32 (output_bfd, f->value, fixup_table);
680 fixup_table += 4;
681 }
682 ++fixups_written;
683 }
684
685 if (linux_hash_table (info)->local_builtins != 0)
686 {
687 /* Special marker so we know to switch to the other type of fixup */
688 bfd_put_32 (output_bfd, 0, fixup_table);
689 fixup_table += 4;
690 bfd_put_32 (output_bfd, 0, fixup_table);
691 fixup_table += 4;
692 ++fixups_written;
693 for (f = linux_hash_table (info)->fixup_list; f != NULL; f = f->next)
694 {
695 if (! f->builtin)
696 continue;
697
698 if (f->h->root.root.type != bfd_link_hash_defined
699 && f->h->root.root.type != bfd_link_hash_defweak)
700 {
701 (*_bfd_error_handler)
702 (_("Symbol %s not defined for fixups\n"),
703 f->h->root.root.root.string);
704 continue;
705 }
706
707 is = f->h->root.root.u.def.section;
708 section_offset = is->output_section->vma + is->output_offset;
709 new_addr = f->h->root.root.u.def.value + section_offset;
710
711#ifdef LINUX_LINK_DEBUG
712 printf ("Fixup(B) %s: %x %x\n", f->h->root.root.string,
713 new_addr, f->value);
714#endif
715
716 bfd_put_32 (output_bfd, new_addr, fixup_table);
717 fixup_table += 4;
718 bfd_put_32 (output_bfd, f->value, fixup_table);
719 fixup_table += 4;
720 ++fixups_written;
721 }
722 }
723
724 if (linux_hash_table (info)->fixup_count != fixups_written)
725 {
726 (*_bfd_error_handler) (_("Warning: fixup count mismatch\n"));
727 while (linux_hash_table (info)->fixup_count > fixups_written)
728 {
729 bfd_put_32 (output_bfd, 0, fixup_table);
730 fixup_table += 4;
731 bfd_put_32 (output_bfd, 0, fixup_table);
732 fixup_table += 4;
733 ++fixups_written;
734 }
735 }
736
737 h = linux_link_hash_lookup (linux_hash_table (info),
738 "__BUILTIN_FIXUPS__",
739 false, false, false);
740
741 if (h != NULL
742 && (h->root.root.type == bfd_link_hash_defined
743 || h->root.root.type == bfd_link_hash_defweak))
744 {
745 is = h->root.root.u.def.section;
746 section_offset = is->output_section->vma + is->output_offset;
747 new_addr = h->root.root.u.def.value + section_offset;
748
749#ifdef LINUX_LINK_DEBUG
750 printf ("Builtin fixup table at %x\n", new_addr);
751#endif
752
753 bfd_put_32 (output_bfd, new_addr, fixup_table);
754 }
755 else
756 bfd_put_32 (output_bfd, 0, fixup_table);
757
758 if (bfd_seek (output_bfd, os->filepos + s->output_offset, SEEK_SET) != 0)
759 return false;
760
761 if (bfd_write ((PTR) s->contents, 1, s->_raw_size, output_bfd)
762 != s->_raw_size)
763 return false;
764
765 return true;
766}
767
768#define MY_bfd_link_hash_table_create linux_link_hash_table_create
769#define MY_add_one_symbol linux_add_one_symbol
770#define MY_finish_dynamic_link linux_finish_dynamic_link
771
772#define MY_zmagic_contiguous 1
773
774#include "aout-target.h"
Note: See TracBrowser for help on using the repository browser.