1 /* BFD back-end for linux flavored i386 a.out binaries.
2 Copyright 1992, 1993, 1994, 1995, 1996, 1997, 2001, 2002
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, USA. */
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
28 #define MACHTYPE_OK(mtype) ((mtype) == M_386 || (mtype) == M_UNKNOWN)
33 #include "aout/aout64.h"
34 #include "aout/stab_gnu.h"
36 #include "libaout.h" /* BFD a.out internal data structures */
38 #define DEFAULT_ARCH bfd_arch_i386
40 /* Do not "beautify" the CONCAT* macro args. Traditional C will not
41 remove whitespace added here, and thus will fail to concatenate
43 #define MY(OP) CONCAT2 (i386linux_,OP)
44 #define TARGETNAME "a.out-i386-linux"
46 extern const bfd_target
MY(vec
);
48 /* We always generate QMAGIC files in preference to ZMAGIC files. It
49 would be possible to make this a linker option, if that ever
52 static void MY_final_link_callback
53 PARAMS ((bfd
*, file_ptr
*, file_ptr
*, file_ptr
*));
54 static boolean i386linux_bfd_final_link
55 PARAMS ((bfd
*, struct bfd_link_info
*));
56 static boolean i386linux_write_object_contents
PARAMS ((bfd
*));
59 i386linux_bfd_final_link (abfd
, info
)
61 struct bfd_link_info
*info
;
63 obj_aout_subformat (abfd
) = q_magic_format
;
64 return NAME(aout
,final_link
) (abfd
, info
, MY_final_link_callback
);
67 #define MY_bfd_final_link i386linux_bfd_final_link
69 /* Set the machine type correctly. */
72 i386linux_write_object_contents (abfd
)
75 struct external_exec exec_bytes
;
76 struct internal_exec
*execp
= exec_hdr (abfd
);
78 N_SET_MACHTYPE (*execp
, M_386
);
80 obj_reloc_entry_size (abfd
) = RELOC_STD_SIZE
;
82 WRITE_HEADERS(abfd
, execp
);
87 #define MY_write_object_contents i386linux_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_"
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_"
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. */
112 #define NEEDS_SHRLIB "__NEEDS_SHRLIB_"
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
122 #ifndef SHARABLE_CONFLICTS
123 #define SHARABLE_CONFLICTS "__SHARABLE_CONFLICTS__"
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. */
139 struct linux_link_hash_entry
*h
;
142 /* Nonzero if this is a jump instruction that needs to be fixed,
143 zero if this is just a pointer */
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
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. */
165 /* Number of fixups. */
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
179 static struct fixup
*new_fixup
180 PARAMS ((struct bfd_link_info
*, struct linux_link_hash_entry
*,
182 static boolean linux_link_create_dynamic_sections
183 PARAMS ((bfd
*, struct bfd_link_info
*));
184 static boolean linux_add_one_symbol
185 PARAMS ((struct bfd_link_info
*, bfd
*, const char *, flagword
, asection
*,
186 bfd_vma
, const char *, boolean
, boolean
,
187 struct bfd_link_hash_entry
**));
188 static boolean linux_tally_symbols
189 PARAMS ((struct linux_link_hash_entry
*, PTR
));
190 static 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
;
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
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
)));
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
,
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
)
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_alloc (abfd
, 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
))
239 return (struct bfd_link_hash_table
*) 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),\
257 /* Traverse a Linux link hash table. */
259 #define linux_link_hash_traverse(table, func, info) \
260 (aout_link_hash_traverse \
262 (boolean (*) PARAMS ((struct aout_link_hash_entry *, PTR))) (func), \
265 /* Get the Linux link hash table from the info structure. This is
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
;
281 f
= (struct fixup
*) bfd_hash_allocate (&info
->hash
->table
,
282 sizeof (struct fixup
));
285 f
->next
= linux_hash_table (info
)->fixup_list
;
286 linux_hash_table (info
)->fixup_list
= f
;
289 f
->builtin
= builtin
;
291 ++linux_hash_table (info
)->fixup_count
;
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. */
303 linux_link_create_dynamic_sections (abfd
, info
)
305 struct bfd_link_info
*info ATTRIBUTE_UNUSED
;
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.
315 s
= bfd_make_section (abfd
, ".linux-dynamic");
317 || ! bfd_set_section_flags (abfd
, s
, flags
)
318 || ! bfd_set_section_alignment (abfd
, s
, 2))
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. */
331 linux_add_one_symbol (info
, abfd
, name
, flags
, section
, value
, string
,
332 copy
, collect
, hashp
)
333 struct bfd_link_info
*info
;
342 struct bfd_link_hash_entry
**hashp
;
344 struct linux_link_hash_entry
*h
;
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. */
357 if (! info
->relocateable
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
))
365 linux_hash_table (info
)->dynobj
= abfd
;
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,
375 && (h
->root
.root
.type
== bfd_link_hash_defined
376 || h
->root
.root
.type
== bfd_link_hash_defweak
))
381 *hashp
= (struct bfd_link_hash_entry
*) h
;
383 f
= new_fixup (info
, h
, value
, ! IS_PLT_SYM (name
));
386 f
->jump
= IS_PLT_SYM (name
);
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
,
398 /* Insert a pointer to our table in the set vector. The dynamic
399 linker requires this information */
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
,
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
)))
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. */
431 linux_tally_symbols (h
, data
)
432 struct linux_link_hash_entry
*h
;
435 struct bfd_link_info
*info
= (struct bfd_link_info
*) data
;
436 struct fixup
*f
, *f1
;
438 struct linux_link_hash_entry
*h1
, *h2
;
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)
452 name
= h
->root
.root
.root
.string
+ sizeof NEEDS_SHRLIB
- 1;
453 p
= strrchr (name
, '_');
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"),
462 strcpy (alloc
, name
);
463 p
= strrchr (alloc
, '_');
465 (*_bfd_error_handler
)
466 (_("Output file requires shared library `%s.so.%s'\n"),
474 /* If this symbol is not a PLT/GOT, we do not even need to look at it */
475 is_plt
= IS_PLT_SYM (h
->root
.root
.root
.string
);
477 if (is_plt
|| IS_GOT_SYM (h
->root
.root
.root
.string
))
479 /* Look up this symbol twice. Once just as a regular lookup,
480 and then again following all of the indirect links until we
481 reach a real symbol. */
482 h1
= linux_link_hash_lookup (linux_hash_table (info
),
483 (h
->root
.root
.root
.string
484 + sizeof PLT_REF_PREFIX
- 1),
486 /* h2 does not follow indirect symbols. */
487 h2
= linux_link_hash_lookup (linux_hash_table (info
),
488 (h
->root
.root
.root
.string
489 + sizeof PLT_REF_PREFIX
- 1),
490 false, false, false);
492 /* The real symbol must exist but if it is also an ABS symbol,
493 there is no need to have a fixup. This is because they both
494 came from the same library. If on the other hand, we had to
495 use an indirect symbol to get to the real symbol, we add the
496 fixup anyway, since there are cases where these symbols come
497 from different shared libraries */
499 && (((h1
->root
.root
.type
== bfd_link_hash_defined
500 || h1
->root
.root
.type
== bfd_link_hash_defweak
)
501 && ! bfd_is_abs_section (h1
->root
.root
.u
.def
.section
))
502 || h2
->root
.root
.type
== bfd_link_hash_indirect
))
504 /* See if there is a "builtin" fixup already present
505 involving this symbol. If so, convert it to a regular
506 fixup. In the end, this relaxes some of the requirements
507 about the order of performing fixups. */
509 for (f1
= linux_hash_table (info
)->fixup_list
;
513 if ((f1
->h
!= h
&& f1
->h
!= h1
)
514 || (! f1
->builtin
&& ! f1
->jump
))
519 && bfd_is_abs_section (h
->root
.root
.u
.def
.section
))
521 f
= new_fixup (info
, h1
, f1
->h
->root
.root
.u
.def
.value
, 0);
530 && bfd_is_abs_section (h
->root
.root
.u
.def
.section
))
532 f
= new_fixup (info
, h1
, h
->root
.root
.u
.def
.value
, 0);
535 /* FIXME: No way to return error. */
542 /* Quick and dirty way of stripping these symbols from the
544 if (bfd_is_abs_section (h
->root
.root
.u
.def
.section
))
545 h
->root
.written
= true;
551 /* This is called to set the size of the .linux-dynamic section is.
552 It is called by the Linux linker emulation before_allocation
553 routine. We have finished reading all of the input files, and now
554 we just scan the hash tables to find out how many additional fixups
558 bfd_i386linux_size_dynamic_sections (output_bfd
, info
)
560 struct bfd_link_info
*info
;
565 if (output_bfd
->xvec
!= &MY(vec
))
568 /* First find the fixups... */
569 linux_link_hash_traverse (linux_hash_table (info
),
573 /* If there are builtin fixups, leave room for a marker. This is
574 used by the dynamic linker so that it knows that all that follow
575 are builtin fixups instead of regular fixups. */
576 for (f
= linux_hash_table (info
)->fixup_list
; f
!= NULL
; f
= f
->next
)
580 ++linux_hash_table (info
)->fixup_count
;
581 ++linux_hash_table (info
)->local_builtins
;
586 if (linux_hash_table (info
)->dynobj
== NULL
)
588 if (linux_hash_table (info
)->fixup_count
> 0)
593 /* Allocate memory for our fixup table. We will fill it in later. */
594 s
= bfd_get_section_by_name (linux_hash_table (info
)->dynobj
,
598 s
->_raw_size
= linux_hash_table (info
)->fixup_count
+ 1;
600 s
->contents
= (bfd_byte
*) bfd_zalloc (output_bfd
, s
->_raw_size
);
601 if (s
->contents
== NULL
)
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. */
613 linux_finish_dynamic_link (output_bfd
, info
)
615 struct bfd_link_info
*info
;
617 asection
*s
, *os
, *is
;
618 bfd_byte
*fixup_table
;
619 struct linux_link_hash_entry
*h
;
621 unsigned int new_addr
;
623 unsigned int fixups_written
;
625 if (linux_hash_table (info
)->dynobj
== NULL
)
628 s
= bfd_get_section_by_name (linux_hash_table (info
)->dynobj
,
630 BFD_ASSERT (s
!= NULL
);
631 os
= s
->output_section
;
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
);
640 fixup_table
= s
->contents
;
641 bfd_put_32 (output_bfd
,
642 (bfd_vma
) linux_hash_table (info
)->fixup_count
, fixup_table
);
645 /* Fill in fixup table. */
646 for (f
= linux_hash_table (info
)->fixup_list
; f
!= NULL
; f
= f
->next
)
651 if (f
->h
->root
.root
.type
!= bfd_link_hash_defined
652 && f
->h
->root
.root
.type
!= bfd_link_hash_defweak
)
654 (*_bfd_error_handler
)
655 (_("Symbol %s not defined for fixups\n"),
656 f
->h
->root
.root
.root
.string
);
660 is
= f
->h
->root
.root
.u
.def
.section
;
661 section_offset
= is
->output_section
->vma
+ is
->output_offset
;
662 new_addr
= f
->h
->root
.root
.u
.def
.value
+ section_offset
;
664 #ifdef LINUX_LINK_DEBUG
665 printf ("Fixup(%d) %s: %x %x\n",f
->jump
, f
->h
->root
.root
.string
,
671 /* Relative address */
672 new_addr
= new_addr
- (f
->value
+ 5);
673 bfd_put_32 (output_bfd
, (bfd_vma
) new_addr
, fixup_table
);
675 bfd_put_32 (output_bfd
, f
->value
+ 1, fixup_table
);
680 bfd_put_32 (output_bfd
, (bfd_vma
) new_addr
, fixup_table
);
682 bfd_put_32 (output_bfd
, f
->value
, fixup_table
);
688 if (linux_hash_table (info
)->local_builtins
!= 0)
690 /* Special marker so we know to switch to the other type of fixup */
691 bfd_put_32 (output_bfd
, (bfd_vma
) 0, fixup_table
);
693 bfd_put_32 (output_bfd
, (bfd_vma
) 0, fixup_table
);
696 for (f
= linux_hash_table (info
)->fixup_list
; f
!= NULL
; f
= f
->next
)
701 if (f
->h
->root
.root
.type
!= bfd_link_hash_defined
702 && f
->h
->root
.root
.type
!= bfd_link_hash_defweak
)
704 (*_bfd_error_handler
)
705 (_("Symbol %s not defined for fixups\n"),
706 f
->h
->root
.root
.root
.string
);
710 is
= f
->h
->root
.root
.u
.def
.section
;
711 section_offset
= is
->output_section
->vma
+ is
->output_offset
;
712 new_addr
= f
->h
->root
.root
.u
.def
.value
+ section_offset
;
714 #ifdef LINUX_LINK_DEBUG
715 printf ("Fixup(B) %s: %x %x\n", f
->h
->root
.root
.string
,
719 bfd_put_32 (output_bfd
, (bfd_vma
) new_addr
, fixup_table
);
721 bfd_put_32 (output_bfd
, f
->value
, fixup_table
);
727 if (linux_hash_table (info
)->fixup_count
!= fixups_written
)
729 (*_bfd_error_handler
) (_("Warning: fixup count mismatch\n"));
730 while (linux_hash_table (info
)->fixup_count
> fixups_written
)
732 bfd_put_32 (output_bfd
, (bfd_vma
) 0, fixup_table
);
734 bfd_put_32 (output_bfd
, (bfd_vma
) 0, fixup_table
);
740 h
= linux_link_hash_lookup (linux_hash_table (info
),
741 "__BUILTIN_FIXUPS__",
742 false, false, false);
745 && (h
->root
.root
.type
== bfd_link_hash_defined
746 || h
->root
.root
.type
== bfd_link_hash_defweak
))
748 is
= h
->root
.root
.u
.def
.section
;
749 section_offset
= is
->output_section
->vma
+ is
->output_offset
;
750 new_addr
= h
->root
.root
.u
.def
.value
+ section_offset
;
752 #ifdef LINUX_LINK_DEBUG
753 printf ("Builtin fixup table at %x\n", new_addr
);
756 bfd_put_32 (output_bfd
, (bfd_vma
) new_addr
, fixup_table
);
759 bfd_put_32 (output_bfd
, (bfd_vma
) 0, fixup_table
);
761 if (bfd_seek (output_bfd
, (file_ptr
) (os
->filepos
+ s
->output_offset
),
765 if (bfd_bwrite ((PTR
) s
->contents
, s
->_raw_size
, output_bfd
) != s
->_raw_size
)
771 #define MY_bfd_link_hash_table_create linux_link_hash_table_create
772 #define MY_add_one_symbol linux_add_one_symbol
773 #define MY_finish_dynamic_link linux_finish_dynamic_link
775 #define MY_zmagic_contiguous 1
777 #include "aout-target.h"