1 /* BFD semi-generic back-end for a.out binaries.
2 Copyright 1990, 1991, 1992, 1993, 1994 Free Software Foundation, Inc.
3 Written by Cygnus Support.
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., 675 Mass Ave, Cambridge, MA 02139, USA. */
28 BFD supports a number of different flavours of a.out format,
29 though the major differences are only the sizes of the
30 structures on disk, and the shape of the relocation
33 The support is split into a basic support file @file{aoutx.h}
34 and other files which derive functions from the base. One
35 derivation file is @file{aoutf1.h} (for a.out flavour 1), and
36 adds to the basic a.out functions support for sun3, sun4, 386
37 and 29k a.out files, to create a target jump vector for a
40 This information is further split out into more specific files
41 for each machine, including @file{sunos.c} for sun3 and sun4,
42 @file{newsos3.c} for the Sony NEWS, and @file{demo64.c} for a
43 demonstration of a 64 bit a.out format.
45 The base file @file{aoutx.h} defines general mechanisms for
46 reading and writing records to and from disk and various
47 other methods which BFD requires. It is included by
48 @file{aout32.c} and @file{aout64.c} to form the names
49 <<aout_32_swap_exec_header_in>>, <<aout_64_swap_exec_header_in>>, etc.
51 As an example, this is what goes on to make the back end for a
52 sun4, from @file{aout32.c}:
54 | #define ARCH_SIZE 32
60 | aout_32_canonicalize_reloc
61 | aout_32_find_nearest_line
63 | aout_32_get_reloc_upper_bound
69 | #define TARGET_NAME "a.out-sunos-big"
70 | #define VECNAME sunos_big_vec
73 requires all the names from @file{aout32.c}, and produces the jump vector
77 The file @file{host-aout.c} is a special case. It is for a large set
78 of hosts that use ``more or less standard'' a.out files, and
79 for which cross-debugging is not interesting. It uses the
80 standard 32-bit a.out support routines, but determines the
81 file offsets and addresses of the text, data, and BSS
82 sections, the machine architecture and machine type, and the
83 entry point address, in a host-dependent manner. Once these
84 values have been determined, generic code is used to handle
87 When porting it to run on a new system, you must supply:
91 | HOST_MACHINE_ARCH (optional)
92 | HOST_MACHINE_MACHINE (optional)
93 | HOST_TEXT_START_ADDR
96 in the file @file{../include/sys/h-@var{XXX}.h} (for your host). These
97 values, plus the structures and macros defined in @file{a.out.h} on
98 your host system, will produce a BFD target that will access
99 ordinary a.out files on your host. To configure a new machine
100 to use @file{host-aout.c}, specify:
102 | TDEFAULTS = -DDEFAULT_VECTOR=host_aout_big_vec
103 | TDEPFILES= host-aout.o trad-core.o
105 in the @file{config/@var{XXX}.mt} file, and modify @file{configure.in}
107 @file{@var{XXX}.mt} file (by setting "<<bfd_target=XXX>>") when your
108 configuration is selected.
113 * Any BFD with D_PAGED set is ZMAGIC, and vice versa.
114 Doesn't matter what the setting of WP_TEXT is on output, but it'll
116 * Any BFD with D_PAGED clear and WP_TEXT set is NMAGIC.
117 * Any BFD with both flags clear is OMAGIC.
118 (Just want to make these explicit, so the conditions tested in this
119 file make sense if you're more familiar with a.out than with BFD.) */
122 #define KEEPITTYPE int
125 #include <string.h> /* For strchr and friends */
132 #include "aout/aout64.h"
133 #include "aout/stab_gnu.h"
136 static boolean aout_get_external_symbols PARAMS ((bfd *));
137 static boolean translate_symbol_table PARAMS ((bfd *, aout_symbol_type *,
138 struct external_nlist *,
139 bfd_size_type, char *,
148 The file @file{aoutx.h} provides for both the @emph{standard}
149 and @emph{extended} forms of a.out relocation records.
151 The standard records contain only an
152 address, a symbol index, and a type field. The extended records
153 (used on 29ks and sparcs) also have a full integer for an
157 #define CTOR_TABLE_RELOC_IDX 2
159 #define howto_table_ext NAME(aout,ext_howto_table)
160 #define howto_table_std NAME(aout,std_howto_table)
162 reloc_howto_type howto_table_ext[] =
164 /* type rs size bsz pcrel bitpos ovrf sf name part_inpl readmask setmask pcdone */
165 HOWTO(RELOC_8, 0, 0, 8, false, 0, complain_overflow_bitfield,0,"8", false, 0,0x000000ff, false),
166 HOWTO(RELOC_16, 0, 1, 16, false, 0, complain_overflow_bitfield,0,"16", false, 0,0x0000ffff, false),
167 HOWTO(RELOC_32, 0, 2, 32, false, 0, complain_overflow_bitfield,0,"32", false, 0,0xffffffff, false),
168 HOWTO(RELOC_DISP8, 0, 0, 8, true, 0, complain_overflow_signed,0,"DISP8", false, 0,0x000000ff, false),
169 HOWTO(RELOC_DISP16, 0, 1, 16, true, 0, complain_overflow_signed,0,"DISP16", false, 0,0x0000ffff, false),
170 HOWTO(RELOC_DISP32, 0, 2, 32, true, 0, complain_overflow_signed,0,"DISP32", false, 0,0xffffffff, false),
171 HOWTO(RELOC_WDISP30,2, 2, 30, true, 0, complain_overflow_signed,0,"WDISP30", false, 0,0x3fffffff, false),
172 HOWTO(RELOC_WDISP22,2, 2, 22, true, 0, complain_overflow_signed,0,"WDISP22", false, 0,0x003fffff, false),
173 HOWTO(RELOC_HI22, 10, 2, 22, false, 0, complain_overflow_bitfield,0,"HI22", false, 0,0x003fffff, false),
174 HOWTO(RELOC_22, 0, 2, 22, false, 0, complain_overflow_bitfield,0,"22", false, 0,0x003fffff, false),
175 HOWTO(RELOC_13, 0, 2, 13, false, 0, complain_overflow_bitfield,0,"13", false, 0,0x00001fff, false),
176 HOWTO(RELOC_LO10, 0, 2, 10, false, 0, complain_overflow_dont,0,"LO10", false, 0,0x000003ff, false),
177 HOWTO(RELOC_SFA_BASE,0, 2, 32, false, 0, complain_overflow_bitfield,0,"SFA_BASE", false, 0,0xffffffff, false),
178 HOWTO(RELOC_SFA_OFF13,0,2, 32, false, 0, complain_overflow_bitfield,0,"SFA_OFF13",false, 0,0xffffffff, false),
179 HOWTO(RELOC_BASE10, 0, 2, 16, false, 0, complain_overflow_bitfield,0,"BASE10", false, 0,0x0000ffff, false),
180 HOWTO(RELOC_BASE13, 0, 2, 13, false, 0, complain_overflow_bitfield,0,"BASE13", false, 0,0x00001fff, false),
181 HOWTO(RELOC_BASE22, 0, 2, 0, false, 0, complain_overflow_bitfield,0,"BASE22", false, 0,0x00000000, false),
182 HOWTO(RELOC_PC10, 0, 2, 10, false, 0, complain_overflow_bitfield,0,"PC10", false, 0,0x000003ff, false),
183 HOWTO(RELOC_PC22, 0, 2, 22, false, 0, complain_overflow_bitfield,0,"PC22", false, 0,0x003fffff, false),
184 HOWTO(RELOC_JMP_TBL,0, 2, 32, false, 0, complain_overflow_bitfield,0,"JMP_TBL", false, 0,0xffffffff, false),
185 HOWTO(RELOC_SEGOFF16,0, 2, 0, false, 0, complain_overflow_bitfield,0,"SEGOFF16", false, 0,0x00000000, false),
186 HOWTO(RELOC_GLOB_DAT,0, 2, 0, false, 0, complain_overflow_bitfield,0,"GLOB_DAT", false, 0,0x00000000, false),
187 HOWTO(RELOC_JMP_SLOT,0, 2, 0, false, 0, complain_overflow_bitfield,0,"JMP_SLOT", false, 0,0x00000000, false),
188 HOWTO(RELOC_RELATIVE,0, 2, 0, false, 0, complain_overflow_bitfield,0,"RELATIVE", false, 0,0x00000000, false),
191 /* Convert standard reloc records to "arelent" format (incl byte swap). */
193 reloc_howto_type howto_table_std[] = {
194 /* type rs size bsz pcrel bitpos ovrf sf name part_inpl readmask setmask pcdone */
195 HOWTO( 0, 0, 0, 8, false, 0, complain_overflow_bitfield,0,"8", true, 0x000000ff,0x000000ff, false),
196 HOWTO( 1, 0, 1, 16, false, 0, complain_overflow_bitfield,0,"16", true, 0x0000ffff,0x0000ffff, false),
197 HOWTO( 2, 0, 2, 32, false, 0, complain_overflow_bitfield,0,"32", true, 0xffffffff,0xffffffff, false),
198 HOWTO( 3, 0, 4, 64, false, 0, complain_overflow_bitfield,0,"64", true, 0xdeaddead,0xdeaddead, false),
199 HOWTO( 4, 0, 0, 8, true, 0, complain_overflow_signed, 0,"DISP8", true, 0x000000ff,0x000000ff, false),
200 HOWTO( 5, 0, 1, 16, true, 0, complain_overflow_signed, 0,"DISP16", true, 0x0000ffff,0x0000ffff, false),
201 HOWTO( 6, 0, 2, 32, true, 0, complain_overflow_signed, 0,"DISP32", true, 0xffffffff,0xffffffff, false),
202 HOWTO( 7, 0, 4, 64, true, 0, complain_overflow_signed, 0,"DISP64", true, 0xfeedface,0xfeedface, false),
204 HOWTO( 9, 0, 1, 16, false, 0, complain_overflow_bitfield,0,"BASE16", false,0xffffffff,0xffffffff, false),
205 HOWTO(10, 0, 2, 32, false, 0, complain_overflow_bitfield,0,"BASE32", false,0xffffffff,0xffffffff, false),
208 #define TABLE_SIZE(TABLE) (sizeof(TABLE)/sizeof(TABLE[0]))
210 CONST struct reloc_howto_struct *
211 NAME(aout,reloc_type_lookup) (abfd,code)
213 bfd_reloc_code_real_type code;
215 #define EXT(i,j) case i: return &howto_table_ext[j]
216 #define STD(i,j) case i: return &howto_table_std[j]
217 int ext = obj_reloc_entry_size (abfd) == RELOC_EXT_SIZE;
218 if (code == BFD_RELOC_CTOR)
219 switch (bfd_get_arch_info (abfd)->bits_per_address)
231 EXT (BFD_RELOC_32, 2);
232 EXT (BFD_RELOC_HI22, 8);
233 EXT (BFD_RELOC_LO10, 11);
234 EXT (BFD_RELOC_32_PCREL_S2, 6);
235 EXT (BFD_RELOC_SPARC_WDISP22, 7);
236 EXT (BFD_RELOC_SPARC13, 10);
237 EXT (BFD_RELOC_SPARC_BASE13, 15);
238 default: return (CONST struct reloc_howto_struct *) 0;
244 STD (BFD_RELOC_16, 1);
245 STD (BFD_RELOC_32, 2);
246 STD (BFD_RELOC_8_PCREL, 4);
247 STD (BFD_RELOC_16_PCREL, 5);
248 STD (BFD_RELOC_32_PCREL, 6);
249 STD (BFD_RELOC_16_BASEREL, 9);
250 STD (BFD_RELOC_32_BASEREL, 10);
251 default: return (CONST struct reloc_howto_struct *) 0;
257 Internal entry points
260 @file{aoutx.h} exports several routines for accessing the
261 contents of an a.out file, which are gathered and exported in
262 turn by various format specific files (eg sunos.c).
268 aout_@var{size}_swap_exec_header_in
271 void aout_@var{size}_swap_exec_header_in,
273 struct external_exec *raw_bytes,
274 struct internal_exec *execp);
277 Swap the information in an executable header @var{raw_bytes} taken
278 from a raw byte stream memory image into the internal exec header
279 structure @var{execp}.
282 #ifndef NAME_swap_exec_header_in
284 NAME(aout,swap_exec_header_in) (abfd, raw_bytes, execp)
286 struct external_exec *raw_bytes;
287 struct internal_exec *execp;
289 struct external_exec *bytes = (struct external_exec *)raw_bytes;
291 /* The internal_exec structure has some fields that are unused in this
292 configuration (IE for i960), so ensure that all such uninitialized
293 fields are zero'd out. There are places where two of these structs
294 are memcmp'd, and thus the contents do matter. */
295 memset ((PTR) execp, 0, sizeof (struct internal_exec));
296 /* Now fill in fields in the execp, from the bytes in the raw data. */
297 execp->a_info = bfd_h_get_32 (abfd, bytes->e_info);
298 execp->a_text = GET_WORD (abfd, bytes->e_text);
299 execp->a_data = GET_WORD (abfd, bytes->e_data);
300 execp->a_bss = GET_WORD (abfd, bytes->e_bss);
301 execp->a_syms = GET_WORD (abfd, bytes->e_syms);
302 execp->a_entry = GET_WORD (abfd, bytes->e_entry);
303 execp->a_trsize = GET_WORD (abfd, bytes->e_trsize);
304 execp->a_drsize = GET_WORD (abfd, bytes->e_drsize);
306 #define NAME_swap_exec_header_in NAME(aout,swap_exec_header_in)
311 aout_@var{size}_swap_exec_header_out
314 void aout_@var{size}_swap_exec_header_out
316 struct internal_exec *execp,
317 struct external_exec *raw_bytes);
320 Swap the information in an internal exec header structure
321 @var{execp} into the buffer @var{raw_bytes} ready for writing to disk.
324 NAME(aout,swap_exec_header_out) (abfd, execp, raw_bytes)
326 struct internal_exec *execp;
327 struct external_exec *raw_bytes;
329 struct external_exec *bytes = (struct external_exec *)raw_bytes;
331 /* Now fill in fields in the raw data, from the fields in the exec struct. */
332 bfd_h_put_32 (abfd, execp->a_info , bytes->e_info);
333 PUT_WORD (abfd, execp->a_text , bytes->e_text);
334 PUT_WORD (abfd, execp->a_data , bytes->e_data);
335 PUT_WORD (abfd, execp->a_bss , bytes->e_bss);
336 PUT_WORD (abfd, execp->a_syms , bytes->e_syms);
337 PUT_WORD (abfd, execp->a_entry , bytes->e_entry);
338 PUT_WORD (abfd, execp->a_trsize, bytes->e_trsize);
339 PUT_WORD (abfd, execp->a_drsize, bytes->e_drsize);
346 aout_@var{size}_some_aout_object_p
349 bfd_target *aout_@var{size}_some_aout_object_p
351 bfd_target *(*callback_to_real_object_p)());
354 Some a.out variant thinks that the file open in @var{abfd}
355 checking is an a.out file. Do some more checking, and set up
356 for access if it really is. Call back to the calling
357 environment's "finish up" function just before returning, to
358 handle any last-minute setup.
362 NAME(aout,some_aout_object_p) (abfd, execp, callback_to_real_object_p)
364 struct internal_exec *execp;
365 bfd_target *(*callback_to_real_object_p) PARAMS ((bfd *));
367 struct aout_data_struct *rawptr, *oldrawptr;
370 rawptr = (struct aout_data_struct *) bfd_zalloc (abfd, sizeof (struct aout_data_struct ));
371 if (rawptr == NULL) {
372 bfd_set_error (bfd_error_no_memory);
376 oldrawptr = abfd->tdata.aout_data;
377 abfd->tdata.aout_data = rawptr;
379 /* Copy the contents of the old tdata struct.
380 In particular, we want the subformat, since for hpux it was set in
381 hp300hpux.c:swap_exec_header_in and will be used in
382 hp300hpux.c:callback. */
383 if (oldrawptr != NULL)
384 *abfd->tdata.aout_data = *oldrawptr;
386 abfd->tdata.aout_data->a.hdr = &rawptr->e;
387 *(abfd->tdata.aout_data->a.hdr) = *execp; /* Copy in the internal_exec struct */
388 execp = abfd->tdata.aout_data->a.hdr;
390 /* Set the file flags */
391 abfd->flags = NO_FLAGS;
392 if (execp->a_drsize || execp->a_trsize)
393 abfd->flags |= HAS_RELOC;
394 /* Setting of EXEC_P has been deferred to the bottom of this function */
396 abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS;
397 if (N_DYNAMIC(*execp))
398 abfd->flags |= DYNAMIC;
400 if (N_MAGIC (*execp) == ZMAGIC)
402 abfd->flags |= D_PAGED|WP_TEXT;
403 adata(abfd).magic = z_magic;
405 else if (N_MAGIC (*execp) == NMAGIC)
407 abfd->flags |= WP_TEXT;
408 adata(abfd).magic = n_magic;
411 adata(abfd).magic = o_magic;
413 bfd_get_start_address (abfd) = execp->a_entry;
415 obj_aout_symbols (abfd) = (aout_symbol_type *)NULL;
416 bfd_get_symcount (abfd) = execp->a_syms / sizeof (struct external_nlist);
418 /* The default relocation entry size is that of traditional V7 Unix. */
419 obj_reloc_entry_size (abfd) = RELOC_STD_SIZE;
421 /* The default symbol entry size is that of traditional Unix. */
422 obj_symbol_entry_size (abfd) = EXTERNAL_NLIST_SIZE;
424 obj_aout_external_syms (abfd) = NULL;
425 obj_aout_external_strings (abfd) = NULL;
426 obj_aout_sym_hashes (abfd) = NULL;
428 /* Create the sections. This is raunchy, but bfd_close wants to reclaim
431 obj_textsec (abfd) = bfd_make_section_old_way (abfd, ".text");
432 obj_datasec (abfd) = bfd_make_section_old_way (abfd, ".data");
433 obj_bsssec (abfd) = bfd_make_section_old_way (abfd, ".bss");
436 (void)bfd_make_section (abfd, ".text");
437 (void)bfd_make_section (abfd, ".data");
438 (void)bfd_make_section (abfd, ".bss");
441 obj_datasec (abfd)->_raw_size = execp->a_data;
442 obj_bsssec (abfd)->_raw_size = execp->a_bss;
444 /* If this object is dynamically linked, we assume that both
445 sections have relocs. This does no real harm, even though it may
447 obj_textsec (abfd)->flags =
448 (execp->a_trsize != 0 || (abfd->flags & DYNAMIC) != 0
449 ? (SEC_ALLOC | SEC_LOAD | SEC_CODE | SEC_HAS_CONTENTS | SEC_RELOC)
450 : (SEC_ALLOC | SEC_LOAD | SEC_CODE | SEC_HAS_CONTENTS));
451 obj_datasec (abfd)->flags =
452 (execp->a_drsize != 0 || (abfd->flags & DYNAMIC) != 0
453 ? (SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_HAS_CONTENTS | SEC_RELOC)
454 : (SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_HAS_CONTENTS));
455 obj_bsssec (abfd)->flags = SEC_ALLOC;
457 #ifdef THIS_IS_ONLY_DOCUMENTATION
458 /* The common code can't fill in these things because they depend
459 on either the start address of the text segment, the rounding
460 up of virtual addresses between segments, or the starting file
461 position of the text segment -- all of which varies among different
462 versions of a.out. */
464 /* Call back to the format-dependent code to fill in the rest of the
465 fields and do any further cleanup. Things that should be filled
466 in by the callback: */
468 struct exec *execp = exec_hdr (abfd);
470 obj_textsec (abfd)->size = N_TXTSIZE(*execp);
471 obj_textsec (abfd)->raw_size = N_TXTSIZE(*execp);
472 /* data and bss are already filled in since they're so standard */
474 /* The virtual memory addresses of the sections */
475 obj_textsec (abfd)->vma = N_TXTADDR(*execp);
476 obj_datasec (abfd)->vma = N_DATADDR(*execp);
477 obj_bsssec (abfd)->vma = N_BSSADDR(*execp);
479 /* The file offsets of the sections */
480 obj_textsec (abfd)->filepos = N_TXTOFF(*execp);
481 obj_datasec (abfd)->filepos = N_DATOFF(*execp);
483 /* The file offsets of the relocation info */
484 obj_textsec (abfd)->rel_filepos = N_TRELOFF(*execp);
485 obj_datasec (abfd)->rel_filepos = N_DRELOFF(*execp);
487 /* The file offsets of the string table and symbol table. */
488 obj_str_filepos (abfd) = N_STROFF (*execp);
489 obj_sym_filepos (abfd) = N_SYMOFF (*execp);
491 /* Determine the architecture and machine type of the object file. */
492 switch (N_MACHTYPE (*exec_hdr (abfd))) {
494 abfd->obj_arch = bfd_arch_obscure;
498 adata(abfd)->page_size = PAGE_SIZE;
499 adata(abfd)->segment_size = SEGMENT_SIZE;
500 adata(abfd)->exec_bytes_size = EXEC_BYTES_SIZE;
504 /* The architecture is encoded in various ways in various a.out variants,
505 or is not encoded at all in some of them. The relocation size depends
506 on the architecture and the a.out variant. Finally, the return value
507 is the bfd_target vector in use. If an error occurs, return zero and
508 set bfd_error to the appropriate error code.
510 Formats such as b.out, which have additional fields in the a.out
511 header, should cope with them in this callback as well. */
512 #endif /* DOCUMENTATION */
514 result = (*callback_to_real_object_p)(abfd);
516 /* Now that the segment addresses have been worked out, take a better
517 guess at whether the file is executable. If the entry point
518 is within the text segment, assume it is. (This makes files
519 executable even if their entry point address is 0, as long as
520 their text starts at zero.)
522 At some point we should probably break down and stat the file and
523 declare it executable if (one of) its 'x' bits are on... */
524 if ((execp->a_entry >= obj_textsec(abfd)->vma) &&
525 (execp->a_entry < obj_textsec(abfd)->vma + obj_textsec(abfd)->_raw_size))
526 abfd->flags |= EXEC_P;
529 #if 0 /* These should be set correctly anyways. */
530 abfd->sections = obj_textsec (abfd);
531 obj_textsec (abfd)->next = obj_datasec (abfd);
532 obj_datasec (abfd)->next = obj_bsssec (abfd);
538 abfd->tdata.aout_data = oldrawptr;
545 aout_@var{size}_mkobject
548 boolean aout_@var{size}_mkobject, (bfd *abfd);
551 Initialize BFD @var{abfd} for use with a.out files.
555 NAME(aout,mkobject) (abfd)
558 struct aout_data_struct *rawptr;
560 bfd_set_error (bfd_error_system_call);
562 /* Use an intermediate variable for clarity */
563 rawptr = (struct aout_data_struct *)bfd_zalloc (abfd, sizeof (struct aout_data_struct ));
565 if (rawptr == NULL) {
566 bfd_set_error (bfd_error_no_memory);
570 abfd->tdata.aout_data = rawptr;
571 exec_hdr (abfd) = &(rawptr->e);
573 /* For simplicity's sake we just make all the sections right here. */
575 obj_textsec (abfd) = (asection *)NULL;
576 obj_datasec (abfd) = (asection *)NULL;
577 obj_bsssec (abfd) = (asection *)NULL;
578 bfd_make_section (abfd, ".text");
579 bfd_make_section (abfd, ".data");
580 bfd_make_section (abfd, ".bss");
581 bfd_make_section (abfd, BFD_ABS_SECTION_NAME);
582 bfd_make_section (abfd, BFD_UND_SECTION_NAME);
583 bfd_make_section (abfd, BFD_COM_SECTION_NAME);
591 aout_@var{size}_machine_type
594 enum machine_type aout_@var{size}_machine_type
595 (enum bfd_architecture arch,
596 unsigned long machine));
599 Keep track of machine architecture and machine type for
600 a.out's. Return the <<machine_type>> for a particular
601 architecture and machine, or <<M_UNKNOWN>> if that exact architecture
602 and machine can't be represented in a.out format.
604 If the architecture is understood, machine type 0 (default)
605 is always understood.
609 NAME(aout,machine_type) (arch, machine)
610 enum bfd_architecture arch;
611 unsigned long machine;
613 enum machine_type arch_flags;
615 arch_flags = M_UNKNOWN;
619 if (machine == 0) arch_flags = M_SPARC;
624 case 0: arch_flags = M_68010; break;
625 case 68000: arch_flags = M_UNKNOWN; break;
626 case 68010: arch_flags = M_68010; break;
627 case 68020: arch_flags = M_68020; break;
628 default: arch_flags = M_UNKNOWN; break;
633 if (machine == 0) arch_flags = M_386;
637 if (machine == 0) arch_flags = M_29K;
644 case 3000: arch_flags = M_MIPS1; break;
647 case 6000: arch_flags = M_MIPS2; break;
648 default: arch_flags = M_UNKNOWN; break;
653 arch_flags = M_UNKNOWN;
661 aout_@var{size}_set_arch_mach
664 boolean aout_@var{size}_set_arch_mach,
666 enum bfd_architecture arch,
667 unsigned long machine));
670 Set the architecture and the machine of the BFD @var{abfd} to the
671 values @var{arch} and @var{machine}. Verify that @var{abfd}'s format
672 can support the architecture required.
676 NAME(aout,set_arch_mach) (abfd, arch, machine)
678 enum bfd_architecture arch;
679 unsigned long machine;
681 if (! bfd_default_set_arch_mach (abfd, arch, machine))
684 if (arch != bfd_arch_unknown &&
685 NAME(aout,machine_type) (arch, machine) == M_UNKNOWN)
686 return false; /* We can't represent this type */
688 /* Determine the size of a relocation entry */
693 obj_reloc_entry_size (abfd) = RELOC_EXT_SIZE;
696 obj_reloc_entry_size (abfd) = RELOC_STD_SIZE;
700 return (*aout_backend_info(abfd)->set_sizes) (abfd);
704 adjust_o_magic (abfd, execp)
706 struct internal_exec *execp;
708 file_ptr pos = adata (abfd).exec_bytes_size;
713 obj_textsec(abfd)->filepos = pos;
714 pos += obj_textsec(abfd)->_raw_size;
715 vma += obj_textsec(abfd)->_raw_size;
718 if (!obj_datasec(abfd)->user_set_vma)
720 #if 0 /* ?? Does alignment in the file image really matter? */
721 pad = align_power (vma, obj_datasec(abfd)->alignment_power) - vma;
723 obj_textsec(abfd)->_raw_size += pad;
726 obj_datasec(abfd)->vma = vma;
728 obj_datasec(abfd)->filepos = pos;
729 pos += obj_datasec(abfd)->_raw_size;
730 vma += obj_datasec(abfd)->_raw_size;
733 if (!obj_bsssec(abfd)->user_set_vma)
736 pad = align_power (vma, obj_bsssec(abfd)->alignment_power) - vma;
738 obj_datasec(abfd)->_raw_size += pad;
741 obj_bsssec(abfd)->vma = vma;
743 obj_bsssec(abfd)->filepos = pos;
745 /* Fix up the exec header. */
746 execp->a_text = obj_textsec(abfd)->_raw_size;
747 execp->a_data = obj_datasec(abfd)->_raw_size;
748 execp->a_bss = obj_bsssec(abfd)->_raw_size;
749 N_SET_MAGIC (*execp, OMAGIC);
753 adjust_z_magic (abfd, execp)
755 struct internal_exec *execp;
757 bfd_size_type data_pad, text_pad;
759 CONST struct aout_backend_data *abdp;
760 int ztih; /* Nonzero if text includes exec header. */
762 abdp = aout_backend_info (abfd);
765 ztih = abdp && abdp->text_includes_header;
766 obj_textsec(abfd)->filepos = (ztih
767 ? adata(abfd).exec_bytes_size
768 : adata(abfd).page_size);
769 if (! obj_textsec(abfd)->user_set_vma)
770 /* ?? Do we really need to check for relocs here? */
771 obj_textsec(abfd)->vma = ((abfd->flags & HAS_RELOC)
774 ? (abdp->default_text_vma
775 + adata(abfd).exec_bytes_size)
776 : abdp->default_text_vma));
777 /* Could take strange alignment of text section into account here? */
779 /* Find start of data. */
780 text_end = obj_textsec(abfd)->filepos + obj_textsec(abfd)->_raw_size;
781 text_pad = BFD_ALIGN (text_end, adata(abfd).page_size) - text_end;
782 obj_textsec(abfd)->_raw_size += text_pad;
783 text_end += text_pad;
786 if (!obj_datasec(abfd)->user_set_vma)
789 vma = obj_textsec(abfd)->vma + obj_textsec(abfd)->_raw_size;
790 obj_datasec(abfd)->vma = BFD_ALIGN (vma, adata(abfd).segment_size);
792 if (abdp && abdp->zmagic_mapped_contiguous)
794 text_pad = (obj_datasec(abfd)->vma
795 - obj_textsec(abfd)->vma
796 - obj_textsec(abfd)->_raw_size);
797 obj_textsec(abfd)->_raw_size += text_pad;
799 obj_datasec(abfd)->filepos = (obj_textsec(abfd)->filepos
800 + obj_textsec(abfd)->_raw_size);
802 /* Fix up exec header while we're at it. */
803 execp->a_text = obj_textsec(abfd)->_raw_size;
804 if (ztih && (!abdp || (abdp && !abdp->exec_header_not_counted)))
805 execp->a_text += adata(abfd).exec_bytes_size;
806 N_SET_MAGIC (*execp, ZMAGIC);
808 /* Spec says data section should be rounded up to page boundary. */
809 obj_datasec(abfd)->_raw_size
810 = align_power (obj_datasec(abfd)->_raw_size,
811 obj_bsssec(abfd)->alignment_power);
812 execp->a_data = BFD_ALIGN (obj_datasec(abfd)->_raw_size,
813 adata(abfd).page_size);
814 data_pad = execp->a_data - obj_datasec(abfd)->_raw_size;
817 if (!obj_bsssec(abfd)->user_set_vma)
818 obj_bsssec(abfd)->vma = (obj_datasec(abfd)->vma
819 + obj_datasec(abfd)->_raw_size);
820 /* If the BSS immediately follows the data section and extra space
821 in the page is left after the data section, fudge data
822 in the header so that the bss section looks smaller by that
823 amount. We'll start the bss section there, and lie to the OS.
824 (Note that a linker script, as well as the above assignment,
825 could have explicitly set the BSS vma to immediately follow
826 the data section.) */
827 if (align_power (obj_bsssec(abfd)->vma, obj_bsssec(abfd)->alignment_power)
828 == obj_datasec(abfd)->vma + obj_datasec(abfd)->_raw_size)
829 execp->a_bss = (data_pad > obj_bsssec(abfd)->_raw_size) ? 0 :
830 obj_bsssec(abfd)->_raw_size - data_pad;
832 execp->a_bss = obj_bsssec(abfd)->_raw_size;
836 adjust_n_magic (abfd, execp)
838 struct internal_exec *execp;
840 file_ptr pos = adata(abfd).exec_bytes_size;
845 obj_textsec(abfd)->filepos = pos;
846 if (!obj_textsec(abfd)->user_set_vma)
847 obj_textsec(abfd)->vma = vma;
849 vma = obj_textsec(abfd)->vma;
850 pos += obj_textsec(abfd)->_raw_size;
851 vma += obj_textsec(abfd)->_raw_size;
854 obj_datasec(abfd)->filepos = pos;
855 if (!obj_datasec(abfd)->user_set_vma)
856 obj_datasec(abfd)->vma = BFD_ALIGN (vma, adata(abfd).segment_size);
857 vma = obj_datasec(abfd)->vma;
859 /* Since BSS follows data immediately, see if it needs alignment. */
860 vma += obj_datasec(abfd)->_raw_size;
861 pad = align_power (vma, obj_bsssec(abfd)->alignment_power) - vma;
862 obj_datasec(abfd)->_raw_size += pad;
863 pos += obj_datasec(abfd)->_raw_size;
866 if (!obj_bsssec(abfd)->user_set_vma)
867 obj_bsssec(abfd)->vma = vma;
869 vma = obj_bsssec(abfd)->vma;
871 /* Fix up exec header. */
872 execp->a_text = obj_textsec(abfd)->_raw_size;
873 execp->a_data = obj_datasec(abfd)->_raw_size;
874 execp->a_bss = obj_bsssec(abfd)->_raw_size;
875 N_SET_MAGIC (*execp, NMAGIC);
879 NAME(aout,adjust_sizes_and_vmas) (abfd, text_size, text_end)
881 bfd_size_type *text_size;
884 struct internal_exec *execp = exec_hdr (abfd);
886 if ((obj_textsec (abfd) == NULL) || (obj_datasec (abfd) == NULL))
888 bfd_set_error (bfd_error_invalid_operation);
891 if (adata(abfd).magic != undecided_magic) return true;
893 obj_textsec(abfd)->_raw_size =
894 align_power(obj_textsec(abfd)->_raw_size,
895 obj_textsec(abfd)->alignment_power);
897 *text_size = obj_textsec (abfd)->_raw_size;
898 /* Rule (heuristic) for when to pad to a new page. Note that there
899 are (at least) two ways demand-paged (ZMAGIC) files have been
900 handled. Most Berkeley-based systems start the text segment at
901 (PAGE_SIZE). However, newer versions of SUNOS start the text
902 segment right after the exec header; the latter is counted in the
903 text segment size, and is paged in by the kernel with the rest of
906 /* This perhaps isn't the right way to do this, but made it simpler for me
907 to understand enough to implement it. Better would probably be to go
908 right from BFD flags to alignment/positioning characteristics. But the
909 old code was sloppy enough about handling the flags, and had enough
910 other magic, that it was a little hard for me to understand. I think
911 I understand it better now, but I haven't time to do the cleanup this
914 if (abfd->flags & D_PAGED)
915 /* Whether or not WP_TEXT is set -- let D_PAGED override. */
916 /* @@ What about QMAGIC? */
917 adata(abfd).magic = z_magic;
918 else if (abfd->flags & WP_TEXT)
919 adata(abfd).magic = n_magic;
921 adata(abfd).magic = o_magic;
923 #ifdef BFD_AOUT_DEBUG /* requires gcc2 */
925 fprintf (stderr, "%s text=<%x,%x,%x> data=<%x,%x,%x> bss=<%x,%x,%x>\n",
927 switch (adata(abfd).magic) {
928 case n_magic: str = "NMAGIC"; break;
929 case o_magic: str = "OMAGIC"; break;
930 case z_magic: str = "ZMAGIC"; break;
935 obj_textsec(abfd)->vma, obj_textsec(abfd)->_raw_size,
936 obj_textsec(abfd)->alignment_power,
937 obj_datasec(abfd)->vma, obj_datasec(abfd)->_raw_size,
938 obj_datasec(abfd)->alignment_power,
939 obj_bsssec(abfd)->vma, obj_bsssec(abfd)->_raw_size,
940 obj_bsssec(abfd)->alignment_power);
944 switch (adata(abfd).magic)
947 adjust_o_magic (abfd, execp);
950 adjust_z_magic (abfd, execp);
953 adjust_n_magic (abfd, execp);
959 #ifdef BFD_AOUT_DEBUG
960 fprintf (stderr, " text=<%x,%x,%x> data=<%x,%x,%x> bss=<%x,%x>\n",
961 obj_textsec(abfd)->vma, obj_textsec(abfd)->_raw_size,
962 obj_textsec(abfd)->filepos,
963 obj_datasec(abfd)->vma, obj_datasec(abfd)->_raw_size,
964 obj_datasec(abfd)->filepos,
965 obj_bsssec(abfd)->vma, obj_bsssec(abfd)->_raw_size);
973 aout_@var{size}_new_section_hook
976 boolean aout_@var{size}_new_section_hook,
981 Called by the BFD in response to a @code{bfd_make_section}
985 NAME(aout,new_section_hook) (abfd, newsect)
989 /* align to double at least */
990 newsect->alignment_power = bfd_get_arch_info(abfd)->section_align_power;
993 if (bfd_get_format (abfd) == bfd_object)
995 if (obj_textsec(abfd) == NULL && !strcmp(newsect->name, ".text")) {
996 obj_textsec(abfd)= newsect;
997 newsect->target_index = N_TEXT | N_EXT;
1001 if (obj_datasec(abfd) == NULL && !strcmp(newsect->name, ".data")) {
1002 obj_datasec(abfd) = newsect;
1003 newsect->target_index = N_DATA | N_EXT;
1007 if (obj_bsssec(abfd) == NULL && !strcmp(newsect->name, ".bss")) {
1008 obj_bsssec(abfd) = newsect;
1009 newsect->target_index = N_BSS | N_EXT;
1015 /* We allow more than three sections internally */
1020 NAME(aout,set_section_contents) (abfd, section, location, offset, count)
1025 bfd_size_type count;
1028 bfd_size_type text_size;
1030 if (abfd->output_has_begun == false)
1032 if (NAME(aout,adjust_sizes_and_vmas) (abfd,
1034 &text_end) == false)
1038 /* regardless, once we know what we're doing, we might as well get going */
1039 if (section != obj_bsssec(abfd))
1041 if (bfd_seek (abfd, section->filepos + offset, SEEK_SET) != 0)
1045 return (bfd_write ((PTR)location, 1, count, abfd) == count) ?
1053 /* Classify stabs symbols */
1055 #define sym_in_text_section(sym) \
1056 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_TEXT)
1058 #define sym_in_data_section(sym) \
1059 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_DATA)
1061 #define sym_in_bss_section(sym) \
1062 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_BSS)
1064 /* Symbol is undefined if type is N_UNDF|N_EXT and if it has
1065 zero in the "value" field. Nonzeroes there are fortrancommon
1067 #define sym_is_undefined(sym) \
1068 ((sym)->type == (N_UNDF | N_EXT) && (sym)->symbol.value == 0)
1070 /* Symbol is a global definition if N_EXT is on and if it has
1071 a nonzero type field. */
1072 #define sym_is_global_defn(sym) \
1073 (((sym)->type & N_EXT) && (sym)->type & N_TYPE)
1075 /* Symbol is debugger info if any bits outside N_TYPE or N_EXT
1077 #define sym_is_debugger_info(sym) \
1078 (((sym)->type & ~(N_EXT | N_TYPE)) || (sym)->type == N_FN)
1080 #define sym_is_fortrancommon(sym) \
1081 (((sym)->type == (N_EXT)) && (sym)->symbol.value != 0)
1083 /* Symbol is absolute if it has N_ABS set */
1084 #define sym_is_absolute(sym) \
1085 (((sym)->type & N_TYPE)== N_ABS)
1088 #define sym_is_indirect(sym) \
1089 (((sym)->type & N_ABS)== N_ABS)
1091 /* Read the external symbols from an a.out file. */
1094 aout_get_external_symbols (abfd)
1097 if (obj_aout_external_syms (abfd) == (struct external_nlist *) NULL)
1099 bfd_size_type count;
1100 struct external_nlist *syms;
1102 count = exec_hdr (abfd)->a_syms / EXTERNAL_NLIST_SIZE;
1104 /* We allocate using malloc to make the values easy to free
1105 later on. If we put them on the obstack it might not be
1106 possible to free them. */
1107 syms = ((struct external_nlist *)
1108 malloc ((size_t) count * EXTERNAL_NLIST_SIZE));
1109 if (syms == (struct external_nlist *) NULL && count != 0)
1111 bfd_set_error (bfd_error_no_memory);
1115 if (bfd_seek (abfd, obj_sym_filepos (abfd), SEEK_SET) != 0
1116 || (bfd_read (syms, 1, exec_hdr (abfd)->a_syms, abfd)
1117 != exec_hdr (abfd)->a_syms))
1123 obj_aout_external_syms (abfd) = syms;
1124 obj_aout_external_sym_count (abfd) = count;
1127 if (obj_aout_external_strings (abfd) == NULL)
1129 unsigned char string_chars[BYTES_IN_WORD];
1130 bfd_size_type stringsize;
1133 /* Get the size of the strings. */
1134 if (bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET) != 0
1135 || (bfd_read ((PTR) string_chars, BYTES_IN_WORD, 1, abfd)
1138 stringsize = GET_WORD (abfd, string_chars);
1140 strings = (char *) malloc ((size_t) stringsize + 1);
1141 if (strings == NULL)
1143 bfd_set_error (bfd_error_no_memory);
1147 /* Skip space for the string count in the buffer for convenience
1148 when using indexes. */
1149 if (bfd_read (strings + BYTES_IN_WORD, 1, stringsize - BYTES_IN_WORD,
1151 != stringsize - BYTES_IN_WORD)
1157 /* Sanity preservation. */
1158 strings[stringsize] = '\0';
1160 obj_aout_external_strings (abfd) = strings;
1161 obj_aout_external_string_size (abfd) = stringsize;
1167 /* Only in their own functions for ease of debugging; when sym flags have
1168 stabilised these should be inlined into their (single) caller */
1171 translate_from_native_sym_flags (sym_pointer, cache_ptr, abfd)
1172 struct external_nlist *sym_pointer;
1173 aout_symbol_type * cache_ptr;
1176 cache_ptr->symbol.section = 0;
1177 switch (cache_ptr->type & N_TYPE)
1179 case N_SETA: case N_SETA | N_EXT:
1180 case N_SETT: case N_SETT | N_EXT:
1181 case N_SETD: case N_SETD | N_EXT:
1182 case N_SETB: case N_SETB | N_EXT:
1184 char *copy = bfd_alloc (abfd, strlen (cache_ptr->symbol.name) + 1);
1186 asection *into_section;
1187 arelent_chain *reloc = (arelent_chain *) bfd_alloc (abfd, sizeof (arelent_chain));
1189 if (!copy || !reloc)
1191 bfd_set_error (bfd_error_no_memory);
1195 strcpy (copy, cache_ptr->symbol.name);
1197 /* Make sure that this bfd has a section with the right contructor
1199 section = bfd_get_section_by_name (abfd, copy);
1201 section = bfd_make_section (abfd, copy);
1203 /* Build a relocation entry for the constructor */
1204 switch ((cache_ptr->type & N_TYPE))
1206 case N_SETA: case N_SETA | N_EXT:
1207 into_section = &bfd_abs_section;
1208 cache_ptr->type = N_ABS;
1210 case N_SETT: case N_SETT | N_EXT:
1211 into_section = (asection *) obj_textsec (abfd);
1212 cache_ptr->type = N_TEXT;
1214 case N_SETD: case N_SETD | N_EXT:
1215 into_section = (asection *) obj_datasec (abfd);
1216 cache_ptr->type = N_DATA;
1218 case N_SETB: case N_SETB | N_EXT:
1219 into_section = (asection *) obj_bsssec (abfd);
1220 cache_ptr->type = N_BSS;
1223 bfd_set_error (bfd_error_bad_value);
1227 /* Build a relocation pointing into the constuctor section
1228 pointing at the symbol in the set vector specified */
1230 reloc->relent.addend = cache_ptr->symbol.value;
1231 cache_ptr->symbol.section = into_section->symbol->section;
1232 reloc->relent.sym_ptr_ptr = into_section->symbol_ptr_ptr;
1235 /* We modify the symbol to belong to a section depending upon the
1236 name of the symbol - probably __CTOR__ or __DTOR__ but we don't
1237 really care, and add to the size of the section to contain a
1238 pointer to the symbol. Build a reloc entry to relocate to this
1239 symbol attached to this section. */
1241 section->flags = SEC_CONSTRUCTOR | SEC_RELOC;
1244 section->reloc_count++;
1245 section->alignment_power = 2;
1247 reloc->next = section->constructor_chain;
1248 section->constructor_chain = reloc;
1249 reloc->relent.address = section->_raw_size;
1250 section->_raw_size += sizeof (int *);
1253 = (obj_reloc_entry_size(abfd) == RELOC_EXT_SIZE
1254 ? howto_table_ext : howto_table_std)
1255 + CTOR_TABLE_RELOC_IDX;
1256 cache_ptr->symbol.flags |= BSF_CONSTRUCTOR;
1260 if (cache_ptr->type == N_WARNING)
1262 /* This symbol is the text of a warning message, the next symbol
1263 is the symbol to associate the warning with */
1264 cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_WARNING;
1266 /* @@ Stuffing pointers into integers is a no-no.
1267 We can usually get away with it if the integer is
1268 large enough though. */
1269 if (sizeof (cache_ptr + 1) > sizeof (bfd_vma))
1271 cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1));
1273 /* We don't use a warning symbol's section, but we need
1274 it to be nonzero for the sanity check below, so
1275 pick one arbitrarily. */
1276 cache_ptr->symbol.section = &bfd_abs_section;
1278 /* We furgle with the next symbol in place.
1279 We don't want it to be undefined, we'll trample the type */
1280 (sym_pointer + 1)->e_type[0] = 0xff;
1283 if ((cache_ptr->type | N_EXT) == (N_INDR | N_EXT))
1285 /* Two symbols in a row for an INDR message. The first symbol
1286 contains the name we will match, the second symbol contains
1287 the name the first name is translated into. It is supplied to
1288 us undefined. This is good, since we want to pull in any files
1290 cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_INDIRECT;
1292 /* @@ Stuffing pointers into integers is a no-no.
1293 We can usually get away with it if the integer is
1294 large enough though. */
1295 if (sizeof (cache_ptr + 1) > sizeof (bfd_vma))
1298 cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1));
1299 cache_ptr->symbol.section = &bfd_ind_section;
1302 else if (sym_is_debugger_info (cache_ptr))
1304 cache_ptr->symbol.flags = BSF_DEBUGGING;
1305 /* Work out the section correct for this symbol */
1306 switch (cache_ptr->type & N_TYPE)
1310 cache_ptr->symbol.section = obj_textsec (abfd);
1311 cache_ptr->symbol.value -= obj_textsec (abfd)->vma;
1314 cache_ptr->symbol.value -= obj_datasec (abfd)->vma;
1315 cache_ptr->symbol.section = obj_datasec (abfd);
1318 cache_ptr->symbol.section = obj_bsssec (abfd);
1319 cache_ptr->symbol.value -= obj_bsssec (abfd)->vma;
1323 cache_ptr->symbol.section = &bfd_abs_section;
1330 if (sym_is_fortrancommon (cache_ptr))
1332 cache_ptr->symbol.flags = 0;
1333 cache_ptr->symbol.section = &bfd_com_section;
1341 /* In a.out, the value of a symbol is always relative to the
1342 * start of the file, if this is a data symbol we'll subtract
1343 * the size of the text section to get the section relative
1344 * value. If this is a bss symbol (which would be strange)
1345 * we'll subtract the size of the previous two sections
1346 * to find the section relative address.
1349 if (sym_in_text_section (cache_ptr))
1351 cache_ptr->symbol.value -= obj_textsec (abfd)->vma;
1352 cache_ptr->symbol.section = obj_textsec (abfd);
1354 else if (sym_in_data_section (cache_ptr))
1356 cache_ptr->symbol.value -= obj_datasec (abfd)->vma;
1357 cache_ptr->symbol.section = obj_datasec (abfd);
1359 else if (sym_in_bss_section (cache_ptr))
1361 cache_ptr->symbol.section = obj_bsssec (abfd);
1362 cache_ptr->symbol.value -= obj_bsssec (abfd)->vma;
1364 else if (sym_is_undefined (cache_ptr))
1366 cache_ptr->symbol.flags = 0;
1367 cache_ptr->symbol.section = &bfd_und_section;
1369 else if (sym_is_absolute (cache_ptr))
1371 cache_ptr->symbol.section = &bfd_abs_section;
1374 if (sym_is_global_defn (cache_ptr))
1376 cache_ptr->symbol.flags = BSF_GLOBAL | BSF_EXPORT;
1378 else if (! sym_is_undefined (cache_ptr))
1380 cache_ptr->symbol.flags = BSF_LOCAL;
1384 if (cache_ptr->symbol.section == 0)
1391 translate_to_native_sym_flags (sym_pointer, cache_ptr, abfd)
1392 struct external_nlist *sym_pointer;
1396 bfd_vma value = cache_ptr->value;
1398 /* mask out any existing type bits in case copying from one section
1400 sym_pointer->e_type[0] &= ~N_TYPE;
1402 /* We attempt to order these tests by decreasing frequency of success,
1403 according to tcov when linking the linker. */
1404 if (bfd_get_output_section(cache_ptr) == &bfd_abs_section) {
1405 sym_pointer->e_type[0] |= N_ABS;
1407 else if (bfd_get_output_section(cache_ptr) == obj_textsec (abfd)) {
1408 sym_pointer->e_type[0] |= N_TEXT;
1410 else if (bfd_get_output_section(cache_ptr) == obj_datasec (abfd)) {
1411 sym_pointer->e_type[0] |= N_DATA;
1413 else if (bfd_get_output_section(cache_ptr) == obj_bsssec (abfd)) {
1414 sym_pointer->e_type[0] |= N_BSS;
1416 else if (bfd_get_output_section(cache_ptr) == &bfd_und_section) {
1417 sym_pointer->e_type[0] = (N_UNDF | N_EXT);
1419 else if (bfd_get_output_section(cache_ptr) == &bfd_ind_section) {
1420 sym_pointer->e_type[0] = N_INDR;
1422 else if (bfd_get_output_section(cache_ptr) == NULL) {
1423 /* Protect the bfd_is_com_section call.
1424 This case occurs, e.g., for the *DEBUG* section of a COFF file. */
1425 bfd_set_error (bfd_error_nonrepresentable_section);
1428 else if (bfd_is_com_section (bfd_get_output_section (cache_ptr))) {
1429 sym_pointer->e_type[0] = (N_UNDF | N_EXT);
1432 bfd_set_error (bfd_error_nonrepresentable_section);
1436 /* Turn the symbol from section relative to absolute again */
1438 value += cache_ptr->section->output_section->vma + cache_ptr->section->output_offset ;
1441 if (cache_ptr->flags & (BSF_WARNING)) {
1442 sym_pointer->e_type[0] = N_WARNING;
1443 (sym_pointer+1)->e_type[0] = 1;
1446 if (cache_ptr->flags & BSF_DEBUGGING) {
1447 sym_pointer->e_type[0] = ((aout_symbol_type *)cache_ptr)->type;
1449 else if (cache_ptr->flags & (BSF_GLOBAL | BSF_EXPORT)) {
1450 sym_pointer->e_type[0] |= N_EXT;
1452 if (cache_ptr->flags & BSF_CONSTRUCTOR) {
1453 int type = ((aout_symbol_type *)cache_ptr)->type;
1456 case N_ABS: type = N_SETA; break;
1457 case N_TEXT: type = N_SETT; break;
1458 case N_DATA: type = N_SETD; break;
1459 case N_BSS: type = N_SETB; break;
1461 sym_pointer->e_type[0] = type;
1464 PUT_WORD(abfd, value, sym_pointer->e_value);
1469 /* Native-level interface to symbols. */
1473 NAME(aout,make_empty_symbol) (abfd)
1476 aout_symbol_type *new =
1477 (aout_symbol_type *)bfd_zalloc (abfd, sizeof (aout_symbol_type));
1480 bfd_set_error (bfd_error_no_memory);
1483 new->symbol.the_bfd = abfd;
1485 return &new->symbol;
1488 /* Translate a set of internal symbols into external symbols. */
1491 translate_symbol_table (abfd, in, ext, count, str, strsize, dynamic)
1493 aout_symbol_type *in;
1494 struct external_nlist *ext;
1495 bfd_size_type count;
1497 bfd_size_type strsize;
1500 struct external_nlist *ext_end;
1502 ext_end = ext + count;
1503 for (; ext < ext_end; ext++, in++)
1507 x = GET_WORD (abfd, ext->e_strx);
1508 in->symbol.the_bfd = abfd;
1510 /* For the normal symbols, the zero index points at the number
1511 of bytes in the string table but is to be interpreted as the
1512 null string. For the dynamic symbols, the number of bytes in
1513 the string table is stored in the __DYNAMIC structure and the
1514 zero index points at an actual string. */
1515 if (x == 0 && ! dynamic)
1516 in->symbol.name = "";
1517 else if (x < strsize)
1518 in->symbol.name = str + x;
1522 in->symbol.value = GET_SWORD (abfd, ext->e_value);
1523 in->desc = bfd_h_get_16 (abfd, ext->e_desc);
1524 in->other = bfd_h_get_8 (abfd, ext->e_other);
1525 in->type = bfd_h_get_8 (abfd, ext->e_type);
1526 in->symbol.udata = 0;
1528 if (!translate_from_native_sym_flags (ext, in, abfd))
1532 in->symbol.flags |= BSF_DYNAMIC;
1538 /* We read the symbols into a buffer, which is discarded when this
1539 function exits. We read the strings into a buffer large enough to
1540 hold them all plus all the cached symbol entries. */
1543 NAME(aout,slurp_symbol_table) (abfd)
1546 struct external_nlist *old_external_syms;
1547 aout_symbol_type *cached;
1549 bfd_size_type dynsym_count = 0;
1550 struct external_nlist *dynsyms = NULL;
1551 char *dynstrs = NULL;
1552 bfd_size_type dynstr_size;
1554 /* If there's no work to be done, don't do any */
1555 if (obj_aout_symbols (abfd) != (aout_symbol_type *) NULL)
1558 old_external_syms = obj_aout_external_syms (abfd);
1560 if (! aout_get_external_symbols (abfd))
1563 if (obj_aout_external_sym_count (abfd) == 0)
1565 bfd_set_error (bfd_error_no_symbols);
1569 /* If this is a dynamic object, see if we can get the dynamic symbol
1571 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
1572 && aout_backend_info (abfd)->read_dynamic_symbols)
1574 dynsym_count = ((*aout_backend_info (abfd)->read_dynamic_symbols)
1575 (abfd, &dynsyms, &dynstrs, &dynstr_size));
1576 if (dynsym_count == (bfd_size_type) -1)
1580 cached_size = ((obj_aout_external_sym_count (abfd) + dynsym_count)
1581 * sizeof (aout_symbol_type));
1582 cached = (aout_symbol_type *) malloc (cached_size);
1583 memset (cached, 0, cached_size);
1587 bfd_set_error (bfd_error_no_memory);
1591 /* Convert from external symbol information to internal. */
1592 if (! translate_symbol_table (abfd, cached,
1593 obj_aout_external_syms (abfd),
1594 obj_aout_external_sym_count (abfd),
1595 obj_aout_external_strings (abfd),
1596 obj_aout_external_string_size (abfd),
1598 || ! translate_symbol_table (abfd,
1600 + obj_aout_external_sym_count (abfd)),
1601 dynsyms, dynsym_count, dynstrs,
1608 bfd_get_symcount (abfd) = (obj_aout_external_sym_count (abfd)
1611 obj_aout_symbols (abfd) = cached;
1613 /* It is very likely that anybody who calls this function will not
1614 want the external symbol information, so if it was allocated
1615 because of our call to aout_get_external_symbols, we free it up
1616 right away to save space. */
1617 if (old_external_syms == (struct external_nlist *) NULL
1618 && obj_aout_external_syms (abfd) != (struct external_nlist *) NULL)
1620 free (obj_aout_external_syms (abfd));
1621 obj_aout_external_syms (abfd) = NULL;
1627 /* Possible improvements:
1628 + look for strings matching trailing substrings of other strings
1629 + better data structures? balanced trees?
1630 + smaller per-string or per-symbol data? re-use some of the symbol's
1632 + also look at reducing memory use elsewhere -- maybe if we didn't have to
1633 construct the entire symbol table at once, we could get by with smaller
1634 amounts of VM? (What effect does that have on the string table
1636 + rip this out of here, put it into its own file in bfd or libiberty, so
1637 coff and elf can use it too. I'll work on this soon, but have more
1638 pressing tasks right now.
1640 A hash table might(?) be more efficient for handling exactly the cases that
1641 are handled now, but for trailing substring matches, I think we want to
1642 examine the `nearest' values (reverse-)lexically, not merely impose a strict
1643 order, nor look only for exact-match or not-match. I don't think a hash
1644 table would be very useful for that, and I don't feel like fleshing out two
1645 completely different implementations. [raeburn:930419.0331EDT] */
1647 struct stringtab_entry {
1648 /* Hash value for this string. Only useful so long as we aren't doing
1649 substring matches. */
1652 /* Next node to look at, depending on whether the hash value of the string
1653 being searched for is less than or greater than the hash value of the
1654 current node. For now, `equal to' is lumped in with `greater than', for
1655 space efficiency. It's not a common enough case to warrant another field
1656 to be used for all nodes. */
1657 struct stringtab_entry *less;
1658 struct stringtab_entry *greater;
1660 /* The string itself. */
1663 /* The index allocated for this string. */
1664 bfd_size_type index;
1666 #ifdef GATHER_STATISTICS
1667 /* How many references have there been to this string? (Not currently used;
1668 could be dumped out for anaylsis, if anyone's interested.) */
1669 unsigned long count;
1672 /* Next node in linked list, in suggested output order. */
1673 struct stringtab_entry *next_to_output;
1676 struct stringtab_data {
1677 /* Tree of string table entries. */
1678 struct stringtab_entry *strings;
1680 /* Fudge factor used to center top node of tree. */
1683 /* Next index value to issue. */
1684 bfd_size_type index;
1686 /* Index used for empty strings. Cached here because checking for them
1687 is really easy, and we can avoid searching the tree. */
1688 bfd_size_type empty_string_index;
1690 /* These fields indicate the two ends of a singly-linked list that indicates
1691 the order strings should be written out in. Use this order, and no
1692 seeking will need to be done, so output efficiency should be maximized. */
1693 struct stringtab_entry **end;
1694 struct stringtab_entry *output_order;
1696 #ifdef GATHER_STATISTICS
1697 /* Number of strings which duplicate strings already in the table. */
1698 unsigned long duplicates;
1700 /* Number of bytes saved by not having to write all the duplicate strings. */
1701 unsigned long bytes_saved;
1703 /* Number of zero-length strings. Currently, these all turn into
1704 references to the null byte at the end of the first string. In some
1705 cases (possibly not all? explore this...), it should be possible to
1706 simply write out a zero index value. */
1707 unsigned long empty_strings;
1709 /* Number of times the hash values matched but the strings were different.
1710 Note that this includes the number of times the other string(s) occurs, so
1711 there may only be two strings hashing to the same value, even if this
1712 number is very large. */
1713 unsigned long bad_hash_matches;
1715 /* Null strings aren't counted in this one.
1716 This will probably only be nonzero if we've got an input file
1717 which was produced by `ld -r' (i.e., it's already been processed
1718 through this code). Under some operating systems, native tools
1719 may make all empty strings have the same index; but the pointer
1720 check won't catch those, because to get to that stage we'd already
1721 have to compute the checksum, which requires reading the string,
1722 so we short-circuit that case with empty_string_index above. */
1723 unsigned long pointer_matches;
1725 /* Number of comparisons done. I figure with the algorithms in use below,
1726 the average number of comparisons done (per symbol) should be roughly
1727 log-base-2 of the number of unique strings. */
1728 unsigned long n_compares;
1732 /* Some utility functions for the string table code. */
1734 /* For speed, only hash on the first this many bytes of strings.
1735 This number was chosen by profiling ld linking itself, with -g. */
1736 #define HASHMAXLEN 25
1738 #define HASH_CHAR(c) (sum ^= sum >> 20, sum ^= sum << 7, sum += (c))
1740 static INLINE unsigned int
1742 unsigned char *string;
1743 register unsigned int len;
1745 register unsigned int sum = 0;
1747 if (len > HASHMAXLEN)
1755 HASH_CHAR (*string++);
1761 stringtab_init (tab)
1762 struct stringtab_data *tab;
1765 tab->output_order = 0;
1767 tab->end = &tab->output_order;
1769 /* Initial string table length includes size of length field. */
1770 tab->index = BYTES_IN_WORD;
1771 tab->empty_string_index = -1;
1772 #ifdef GATHER_STATISTICS
1773 tab->duplicates = 0;
1774 tab->empty_strings = 0;
1775 tab->bad_hash_matches = 0;
1776 tab->pointer_matches = 0;
1777 tab->bytes_saved = 0;
1778 tab->n_compares = 0;
1783 compare (entry, str, hash)
1784 struct stringtab_entry *entry;
1788 return hash - entry->hash;
1791 #ifdef GATHER_STATISTICS
1792 /* Don't want to have to link in math library with all bfd applications... */
1793 static INLINE double
1801 return ((d > 1.41) ? 0.5 : 0) + n;
1805 /* Main string table routines. */
1806 /* Returns index in string table. Whether or not this actually adds an
1807 entry into the string table should be irrelevant -- it just has to
1808 return a valid index. */
1809 static bfd_size_type
1810 add_to_stringtab (abfd, str, tab)
1813 struct stringtab_data *tab;
1815 struct stringtab_entry **ep;
1816 register struct stringtab_entry *entry;
1817 unsigned int hashval, len;
1821 bfd_size_type index;
1822 CONST bfd_size_type minus_one = -1;
1824 #ifdef GATHER_STATISTICS
1825 tab->empty_strings++;
1827 index = tab->empty_string_index;
1828 if (index != minus_one)
1831 #ifdef GATHER_STATISTICS
1838 /* Need to find it. */
1839 entry = tab->strings;
1842 index = entry->index + strlen (entry->string);
1843 tab->empty_string_index = index;
1851 /* The hash_zero value is chosen such that the first symbol gets a value of
1852 zero. With a balanced tree, this wouldn't be very useful, but without it,
1853 we might get a more even split at the top level, instead of skewing it
1854 badly should hash("/usr/lib/crt0.o") (or whatever) be far from zero. */
1855 hashval = hash (str, len) ^ tab->hash_zero;
1859 tab->hash_zero = hashval;
1869 #ifdef GATHER_STATISTICS
1872 cmp = compare (entry, str, hashval);
1873 /* The not-equal cases are more frequent, so check them first. */
1875 ep = &entry->greater;
1880 if (entry->string == str)
1882 #ifdef GATHER_STATISTICS
1883 tab->pointer_matches++;
1887 /* Compare the first bytes to save a function call if they
1889 if (entry->string[0] == str[0] && !strcmp (entry->string, str))
1892 #ifdef GATHER_STATISTICS
1894 tab->bytes_saved += len + 1;
1897 /* If we're in the linker, and the new string is from a new
1898 input file which might have already had these reductions
1899 run over it, we want to keep the new string pointer. I
1900 don't think we're likely to see any (or nearly as many,
1901 at least) cases where a later string is in the same location
1902 as an earlier one rather than this one. */
1903 entry->string = str;
1904 return entry->index;
1906 #ifdef GATHER_STATISTICS
1907 tab->bad_hash_matches++;
1909 ep = &entry->greater;
1913 /* If we get here, nothing that's in the table already matched.
1914 EP points to the `next' field at the end of the chain; stick a
1915 new entry on here. */
1917 entry = (struct stringtab_entry *)
1918 bfd_alloc_by_size_t (abfd, sizeof (struct stringtab_entry));
1921 bfd_set_error (bfd_error_no_memory);
1922 abort(); /* FIXME */
1925 entry->less = entry->greater = 0;
1926 entry->hash = hashval;
1927 entry->index = tab->index;
1928 entry->string = str;
1929 entry->next_to_output = 0;
1930 #ifdef GATHER_STATISTICS
1934 assert (*tab->end == 0);
1935 *(tab->end) = entry;
1936 tab->end = &entry->next_to_output;
1937 assert (*tab->end == 0);
1940 tab->index += len + 1;
1942 tab->empty_string_index = entry->index;
1946 return entry->index;
1950 emit_strtab (abfd, tab)
1952 struct stringtab_data *tab;
1954 struct stringtab_entry *entry;
1955 #ifdef GATHER_STATISTICS
1959 /* Be sure to put string length into correct byte ordering before writing
1961 char buffer[BYTES_IN_WORD];
1963 PUT_WORD (abfd, tab->index, (unsigned char *) buffer);
1964 if (bfd_write ((PTR) buffer, 1, BYTES_IN_WORD, abfd) != BYTES_IN_WORD)
1967 for (entry = tab->output_order; entry; entry = entry->next_to_output)
1969 size_t len = strlen (entry->string) + 1;
1971 if (bfd_write ((PTR) entry->string, 1, len, abfd) != len)
1974 #ifdef GATHER_STATISTICS
1979 #ifdef GATHER_STATISTICS
1980 /* Short form only, for now.
1981 To do: Specify output file. Conditionalize on environment? Detailed
1982 analysis if desired. */
1984 int n_syms = bfd_get_symcount (abfd);
1986 fprintf (stderr, "String table data for output file:\n");
1987 fprintf (stderr, " %8d symbols output\n", n_syms);
1988 fprintf (stderr, " %8d duplicate strings\n", tab->duplicates);
1989 fprintf (stderr, " %8d empty strings\n", tab->empty_strings);
1990 fprintf (stderr, " %8d unique strings output\n", count);
1991 fprintf (stderr, " %8d pointer matches\n", tab->pointer_matches);
1992 fprintf (stderr, " %8d bytes saved\n", tab->bytes_saved);
1993 fprintf (stderr, " %8d bad hash matches\n", tab->bad_hash_matches);
1994 fprintf (stderr, " %8d hash-val comparisons\n", tab->n_compares);
1997 double n_compares = tab->n_compares;
1998 double avg_compares = n_compares / n_syms;
1999 /* The second value here should usually be near one. */
2001 "\t average %f comparisons per symbol (%f * log2 nstrings)\n",
2002 avg_compares, avg_compares / log2 (count));
2009 generic = bfd_get_outsymbols(abfd);
2010 for (count = 0; count < bfd_get_symcount(abfd); count++)
2012 asymbol *g = *(generic++);
2016 size_t length = strlen(g->name)+1;
2017 bfd_write((PTR)g->name, 1, length, abfd);
2019 g->KEEPIT = (KEEPITTYPE) count;
2026 NAME(aout,write_syms) (abfd)
2029 unsigned int count ;
2030 asymbol **generic = bfd_get_outsymbols (abfd);
2031 struct stringtab_data strtab;
2033 stringtab_init (&strtab);
2035 for (count = 0; count < bfd_get_symcount (abfd); count++)
2037 asymbol *g = generic[count];
2038 struct external_nlist nsp;
2041 PUT_WORD (abfd, add_to_stringtab (abfd, g->name, &strtab),
2042 (unsigned char *) nsp.e_strx);
2044 PUT_WORD (abfd, 0, (unsigned char *)nsp.e_strx);
2046 if (bfd_asymbol_flavour(g) == abfd->xvec->flavour)
2048 bfd_h_put_16(abfd, aout_symbol(g)->desc, nsp.e_desc);
2049 bfd_h_put_8(abfd, aout_symbol(g)->other, nsp.e_other);
2050 bfd_h_put_8(abfd, aout_symbol(g)->type, nsp.e_type);
2054 bfd_h_put_16(abfd,0, nsp.e_desc);
2055 bfd_h_put_8(abfd, 0, nsp.e_other);
2056 bfd_h_put_8(abfd, 0, nsp.e_type);
2059 if (! translate_to_native_sym_flags (&nsp, g, abfd))
2062 if (bfd_write((PTR)&nsp,1,EXTERNAL_NLIST_SIZE, abfd)
2063 != EXTERNAL_NLIST_SIZE)
2066 /* NB: `KEEPIT' currently overlays `flags', so set this only
2067 here, at the end. */
2071 return emit_strtab (abfd, &strtab);
2076 NAME(aout,get_symtab) (abfd, location)
2080 unsigned int counter = 0;
2081 aout_symbol_type *symbase;
2083 if (!NAME(aout,slurp_symbol_table)(abfd))
2086 for (symbase = obj_aout_symbols(abfd); counter++ < bfd_get_symcount (abfd);)
2087 *(location++) = (asymbol *)( symbase++);
2089 return bfd_get_symcount (abfd);
2093 /* Standard reloc stuff */
2094 /* Output standard relocation information to a file in target byte order. */
2097 NAME(aout,swap_std_reloc_out) (abfd, g, natptr)
2100 struct reloc_std_external *natptr;
2103 asymbol *sym = *(g->sym_ptr_ptr);
2105 unsigned int r_length;
2107 int r_baserel, r_jmptable, r_relative;
2108 asection *output_section = sym->section->output_section;
2110 PUT_WORD(abfd, g->address, natptr->r_address);
2112 r_length = g->howto->size ; /* Size as a power of two */
2113 r_pcrel = (int) g->howto->pc_relative; /* Relative to PC? */
2114 /* XXX This relies on relocs coming from a.out files. */
2115 r_baserel = (g->howto->type & 8) != 0;
2116 /* r_jmptable, r_relative??? FIXME-soon */
2121 /* For a standard reloc, the addend is in the object file. */
2122 r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma;
2125 /* name was clobbered by aout_write_syms to be symbol index */
2127 /* If this relocation is relative to a symbol then set the
2128 r_index to the symbols index, and the r_extern bit.
2130 Absolute symbols can come in in two ways, either as an offset
2131 from the abs section, or as a symbol which has an abs value.
2136 if (bfd_is_com_section (output_section)
2137 || output_section == &bfd_abs_section
2138 || output_section == &bfd_und_section)
2140 if (bfd_abs_section.symbol == sym)
2142 /* Whoops, looked like an abs symbol, but is really an offset
2143 from the abs section */
2149 /* Fill in symbol */
2151 r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT);
2157 /* Just an ordinary section */
2159 r_index = output_section->target_index;
2162 /* now the fun stuff */
2163 if (abfd->xvec->header_byteorder_big_p != false) {
2164 natptr->r_index[0] = r_index >> 16;
2165 natptr->r_index[1] = r_index >> 8;
2166 natptr->r_index[2] = r_index;
2168 (r_extern? RELOC_STD_BITS_EXTERN_BIG: 0)
2169 | (r_pcrel? RELOC_STD_BITS_PCREL_BIG: 0)
2170 | (r_baserel? RELOC_STD_BITS_BASEREL_BIG: 0)
2171 | (r_jmptable? RELOC_STD_BITS_JMPTABLE_BIG: 0)
2172 | (r_relative? RELOC_STD_BITS_RELATIVE_BIG: 0)
2173 | (r_length << RELOC_STD_BITS_LENGTH_SH_BIG);
2175 natptr->r_index[2] = r_index >> 16;
2176 natptr->r_index[1] = r_index >> 8;
2177 natptr->r_index[0] = r_index;
2179 (r_extern? RELOC_STD_BITS_EXTERN_LITTLE: 0)
2180 | (r_pcrel? RELOC_STD_BITS_PCREL_LITTLE: 0)
2181 | (r_baserel? RELOC_STD_BITS_BASEREL_LITTLE: 0)
2182 | (r_jmptable? RELOC_STD_BITS_JMPTABLE_LITTLE: 0)
2183 | (r_relative? RELOC_STD_BITS_RELATIVE_LITTLE: 0)
2184 | (r_length << RELOC_STD_BITS_LENGTH_SH_LITTLE);
2189 /* Extended stuff */
2190 /* Output extended relocation information to a file in target byte order. */
2193 NAME(aout,swap_ext_reloc_out) (abfd, g, natptr)
2196 register struct reloc_ext_external *natptr;
2200 unsigned int r_type;
2201 unsigned int r_addend;
2202 asymbol *sym = *(g->sym_ptr_ptr);
2203 asection *output_section = sym->section->output_section;
2205 PUT_WORD (abfd, g->address, natptr->r_address);
2207 r_type = (unsigned int) g->howto->type;
2209 r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma;
2211 /* If this relocation is relative to a symbol then set the
2212 r_index to the symbols index, and the r_extern bit.
2214 Absolute symbols can come in in two ways, either as an offset
2215 from the abs section, or as a symbol which has an abs value.
2216 check for that here. */
2218 if (bfd_is_com_section (output_section)
2219 || output_section == &bfd_abs_section
2220 || output_section == &bfd_und_section)
2222 if (bfd_abs_section.symbol == sym)
2224 /* Whoops, looked like an abs symbol, but is really an offset
2225 from the abs section */
2232 r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT);
2237 /* Just an ordinary section */
2239 r_index = output_section->target_index;
2242 /* now the fun stuff */
2243 if (abfd->xvec->header_byteorder_big_p != false) {
2244 natptr->r_index[0] = r_index >> 16;
2245 natptr->r_index[1] = r_index >> 8;
2246 natptr->r_index[2] = r_index;
2248 ((r_extern? RELOC_EXT_BITS_EXTERN_BIG: 0)
2249 | (r_type << RELOC_EXT_BITS_TYPE_SH_BIG));
2251 natptr->r_index[2] = r_index >> 16;
2252 natptr->r_index[1] = r_index >> 8;
2253 natptr->r_index[0] = r_index;
2255 (r_extern? RELOC_EXT_BITS_EXTERN_LITTLE: 0)
2256 | (r_type << RELOC_EXT_BITS_TYPE_SH_LITTLE);
2259 PUT_WORD (abfd, r_addend, natptr->r_addend);
2262 /* BFD deals internally with all things based from the section they're
2263 in. so, something in 10 bytes into a text section with a base of
2264 50 would have a symbol (.text+10) and know .text vma was 50.
2266 Aout keeps all it's symbols based from zero, so the symbol would
2267 contain 60. This macro subs the base of each section from the value
2268 to give the true offset from the section */
2271 #define MOVE_ADDRESS(ad) \
2273 /* undefined symbol */ \
2274 cache_ptr->sym_ptr_ptr = symbols + r_index; \
2275 cache_ptr->addend = ad; \
2277 /* defined, section relative. replace symbol with pointer to \
2278 symbol which points to section */ \
2279 switch (r_index) { \
2281 case N_TEXT | N_EXT: \
2282 cache_ptr->sym_ptr_ptr = obj_textsec(abfd)->symbol_ptr_ptr; \
2283 cache_ptr->addend = ad - su->textsec->vma; \
2286 case N_DATA | N_EXT: \
2287 cache_ptr->sym_ptr_ptr = obj_datasec(abfd)->symbol_ptr_ptr; \
2288 cache_ptr->addend = ad - su->datasec->vma; \
2291 case N_BSS | N_EXT: \
2292 cache_ptr->sym_ptr_ptr = obj_bsssec(abfd)->symbol_ptr_ptr; \
2293 cache_ptr->addend = ad - su->bsssec->vma; \
2297 case N_ABS | N_EXT: \
2298 cache_ptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr; \
2299 cache_ptr->addend = ad; \
2305 NAME(aout,swap_ext_reloc_in) (abfd, bytes, cache_ptr, symbols)
2307 struct reloc_ext_external *bytes;
2313 unsigned int r_type;
2314 struct aoutdata *su = &(abfd->tdata.aout_data->a);
2316 cache_ptr->address = (GET_SWORD (abfd, bytes->r_address));
2318 /* now the fun stuff */
2319 if (abfd->xvec->header_byteorder_big_p != false) {
2320 r_index = (bytes->r_index[0] << 16)
2321 | (bytes->r_index[1] << 8)
2322 | bytes->r_index[2];
2323 r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_BIG));
2324 r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_BIG)
2325 >> RELOC_EXT_BITS_TYPE_SH_BIG;
2327 r_index = (bytes->r_index[2] << 16)
2328 | (bytes->r_index[1] << 8)
2329 | bytes->r_index[0];
2330 r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_LITTLE));
2331 r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_LITTLE)
2332 >> RELOC_EXT_BITS_TYPE_SH_LITTLE;
2335 cache_ptr->howto = howto_table_ext + r_type;
2336 MOVE_ADDRESS(GET_SWORD(abfd, bytes->r_addend));
2340 NAME(aout,swap_std_reloc_in) (abfd, bytes, cache_ptr, symbols)
2342 struct reloc_std_external *bytes;
2348 unsigned int r_length;
2350 int r_baserel, r_jmptable, r_relative;
2351 struct aoutdata *su = &(abfd->tdata.aout_data->a);
2354 cache_ptr->address = bfd_h_get_32 (abfd, bytes->r_address);
2356 /* now the fun stuff */
2357 if (abfd->xvec->header_byteorder_big_p != false) {
2358 r_index = (bytes->r_index[0] << 16)
2359 | (bytes->r_index[1] << 8)
2360 | bytes->r_index[2];
2361 r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_BIG));
2362 r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_BIG));
2363 r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_BIG));
2364 r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_BIG));
2365 r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_BIG));
2366 r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_BIG)
2367 >> RELOC_STD_BITS_LENGTH_SH_BIG;
2369 r_index = (bytes->r_index[2] << 16)
2370 | (bytes->r_index[1] << 8)
2371 | bytes->r_index[0];
2372 r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_LITTLE));
2373 r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_LITTLE));
2374 r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_LITTLE));
2375 r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_LITTLE));
2376 r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_LITTLE));
2377 r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_LITTLE)
2378 >> RELOC_STD_BITS_LENGTH_SH_LITTLE;
2381 howto_idx = r_length + 4 * r_pcrel + 8 * r_baserel;
2382 BFD_ASSERT (howto_idx < TABLE_SIZE (howto_table_std));
2383 cache_ptr->howto = howto_table_std + howto_idx;
2384 BFD_ASSERT (cache_ptr->howto->type != -1);
2385 BFD_ASSERT (r_jmptable == 0);
2386 BFD_ASSERT (r_relative == 0);
2387 /* FIXME-soon: Roll jmptable, relative bits into howto setting */
2392 /* Read and swap the relocs for a section. */
2395 NAME(aout,slurp_reloc_table) (abfd, asect, symbols)
2401 bfd_size_type reloc_size;
2403 bfd_size_type dynrel_count = 0;
2405 arelent *reloc_cache;
2407 unsigned int counter = 0;
2410 if (asect->relocation)
2413 if (asect->flags & SEC_CONSTRUCTOR)
2416 if (asect == obj_datasec (abfd))
2417 reloc_size = exec_hdr(abfd)->a_drsize;
2418 else if (asect == obj_textsec (abfd))
2419 reloc_size = exec_hdr(abfd)->a_trsize;
2422 bfd_set_error (bfd_error_invalid_operation);
2426 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
2427 && aout_backend_info (abfd)->read_dynamic_relocs)
2429 dynrel_count = ((*aout_backend_info (abfd)->read_dynamic_relocs)
2431 if (dynrel_count == (bfd_size_type) -1)
2435 if (bfd_seek (abfd, asect->rel_filepos, SEEK_SET) != 0)
2438 each_size = obj_reloc_entry_size (abfd);
2440 count = reloc_size / each_size;
2442 reloc_cache = (arelent *) malloc ((size_t) ((count + dynrel_count)
2443 * sizeof (arelent)));
2444 if (reloc_cache == NULL && count != 0)
2446 bfd_set_error (bfd_error_no_memory);
2449 memset (reloc_cache, 0, (count + dynrel_count) * sizeof (arelent));
2451 relocs = malloc (reloc_size);
2452 if (relocs == NULL && reloc_size != 0)
2455 bfd_set_error (bfd_error_no_memory);
2459 if (bfd_read (relocs, 1, reloc_size, abfd) != reloc_size)
2466 cache_ptr = reloc_cache;
2467 if (each_size == RELOC_EXT_SIZE)
2469 register struct reloc_ext_external *rptr =
2470 (struct reloc_ext_external *) relocs;
2472 for (; counter < count; counter++, rptr++, cache_ptr++)
2473 NAME(aout,swap_ext_reloc_in) (abfd, rptr, cache_ptr, symbols);
2477 register struct reloc_std_external *rptr =
2478 (struct reloc_std_external *) relocs;
2480 for (; counter < count; counter++, rptr++, cache_ptr++)
2481 NAME(aout,swap_std_reloc_in) (abfd, rptr, cache_ptr, symbols);
2486 if (dynrel_count > 0)
2490 /* The dynamic symbols are at the end of the symbol table. */
2491 for (dynsyms = symbols;
2492 *dynsyms != NULL && ((*dynsyms)->flags & BSF_DYNAMIC) == 0;
2496 /* Swap in the dynamic relocs. These relocs may be for either
2497 section, so we must discard ones we don't want. */
2499 if (each_size == RELOC_EXT_SIZE)
2501 register struct reloc_ext_external *rptr
2502 = (struct reloc_ext_external *) dynrels;
2504 for (; counter < dynrel_count; counter++, rptr++, cache_ptr++)
2506 NAME(aout,swap_ext_reloc_in) (abfd, rptr, cache_ptr, dynsyms);
2507 cache_ptr->address -= bfd_get_section_vma (abfd, asect);
2508 if (cache_ptr->address >= bfd_section_size (abfd, asect))
2514 register struct reloc_std_external *rptr
2515 = (struct reloc_std_external *) dynrels;
2517 for (; counter < dynrel_count; counter++, rptr++, cache_ptr++)
2519 NAME(aout,swap_std_reloc_in) (abfd, rptr, cache_ptr, dynsyms);
2520 cache_ptr->address -= bfd_get_section_vma (abfd, asect);
2521 if (cache_ptr->address >= bfd_section_size (abfd, asect))
2527 asect->relocation = reloc_cache;
2528 asect->reloc_count = cache_ptr - reloc_cache;
2533 /* Write out a relocation section into an object file. */
2536 NAME(aout,squirt_out_relocs) (abfd, section)
2541 unsigned char *native, *natptr;
2544 unsigned int count = section->reloc_count;
2547 if (count == 0) return true;
2549 each_size = obj_reloc_entry_size (abfd);
2550 natsize = each_size * count;
2551 native = (unsigned char *) bfd_zalloc (abfd, natsize);
2553 bfd_set_error (bfd_error_no_memory);
2557 generic = section->orelocation;
2559 if (each_size == RELOC_EXT_SIZE)
2561 for (natptr = native;
2563 --count, natptr += each_size, ++generic)
2564 NAME(aout,swap_ext_reloc_out) (abfd, *generic, (struct reloc_ext_external *)natptr);
2568 for (natptr = native;
2570 --count, natptr += each_size, ++generic)
2571 NAME(aout,swap_std_reloc_out)(abfd, *generic, (struct reloc_std_external *)natptr);
2574 if ( bfd_write ((PTR) native, 1, natsize, abfd) != natsize) {
2575 bfd_release(abfd, native);
2578 bfd_release (abfd, native);
2583 /* This is stupid. This function should be a boolean predicate */
2585 NAME(aout,canonicalize_reloc) (abfd, section, relptr, symbols)
2591 arelent *tblptr = section->relocation;
2594 if (!(tblptr || NAME(aout,slurp_reloc_table)(abfd, section, symbols)))
2597 if (section->flags & SEC_CONSTRUCTOR) {
2598 arelent_chain *chain = section->constructor_chain;
2599 for (count = 0; count < section->reloc_count; count ++) {
2600 *relptr ++ = &chain->relent;
2601 chain = chain->next;
2605 tblptr = section->relocation;
2607 for (count = 0; count++ < section->reloc_count;)
2609 *relptr++ = tblptr++;
2614 return section->reloc_count;
2618 NAME(aout,get_reloc_upper_bound) (abfd, asect)
2622 bfd_size_type dynrel_count = 0;
2624 if (bfd_get_format (abfd) != bfd_object) {
2625 bfd_set_error (bfd_error_invalid_operation);
2628 if (asect->flags & SEC_CONSTRUCTOR) {
2629 return (sizeof (arelent *) * (asect->reloc_count+1));
2632 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
2633 && aout_backend_info (abfd)->read_dynamic_relocs)
2637 dynrel_count = ((*aout_backend_info (abfd)->read_dynamic_relocs)
2639 if (dynrel_count == (bfd_size_type) -1)
2643 if (asect == obj_datasec (abfd))
2644 return (sizeof (arelent *) *
2645 ((exec_hdr(abfd)->a_drsize / obj_reloc_entry_size (abfd))
2646 + dynrel_count + 1));
2648 if (asect == obj_textsec (abfd))
2649 return (sizeof (arelent *) *
2650 ((exec_hdr(abfd)->a_trsize / obj_reloc_entry_size (abfd))
2651 + dynrel_count + 1));
2653 bfd_set_error (bfd_error_invalid_operation);
2659 NAME(aout,get_symtab_upper_bound) (abfd)
2662 if (!NAME(aout,slurp_symbol_table)(abfd))
2665 return (bfd_get_symcount (abfd)+1) * (sizeof (aout_symbol_type *));
2670 NAME(aout,get_lineno) (ignore_abfd, ignore_symbol)
2672 asymbol *ignore_symbol;
2674 return (alent *)NULL;
2679 NAME(aout,get_symbol_info) (ignore_abfd, symbol, ret)
2684 bfd_symbol_info (symbol, ret);
2686 if (ret->type == '?')
2688 int type_code = aout_symbol(symbol)->type & 0xff;
2689 CONST char *stab_name = aout_stab_name(type_code);
2690 static char buf[10];
2692 if (stab_name == NULL)
2694 sprintf(buf, "(%d)", type_code);
2698 ret->stab_other = (unsigned)(aout_symbol(symbol)->other & 0xff);
2699 ret->stab_desc = (unsigned)(aout_symbol(symbol)->desc & 0xffff);
2700 ret->stab_name = stab_name;
2706 NAME(aout,print_symbol) (ignore_abfd, afile, symbol, how)
2710 bfd_print_symbol_type how;
2712 FILE *file = (FILE *)afile;
2715 case bfd_print_symbol_name:
2717 fprintf(file,"%s", symbol->name);
2719 case bfd_print_symbol_more:
2720 fprintf(file,"%4x %2x %2x",(unsigned)(aout_symbol(symbol)->desc & 0xffff),
2721 (unsigned)(aout_symbol(symbol)->other & 0xff),
2722 (unsigned)(aout_symbol(symbol)->type));
2724 case bfd_print_symbol_all:
2726 CONST char *section_name = symbol->section->name;
2729 bfd_print_symbol_vandf((PTR)file,symbol);
2731 fprintf(file," %-5s %04x %02x %02x",
2733 (unsigned)(aout_symbol(symbol)->desc & 0xffff),
2734 (unsigned)(aout_symbol(symbol)->other & 0xff),
2735 (unsigned)(aout_symbol(symbol)->type & 0xff));
2737 fprintf(file," %s", symbol->name);
2744 provided a BFD, a section and an offset into the section, calculate
2745 and return the name of the source file and the line nearest to the
2750 NAME(aout,find_nearest_line)
2751 (abfd, section, symbols, offset, filename_ptr, functionname_ptr, line_ptr)
2756 CONST char **filename_ptr;
2757 CONST char **functionname_ptr;
2758 unsigned int *line_ptr;
2760 /* Run down the file looking for the filename, function and linenumber */
2762 static char buffer[100];
2763 static char filename_buffer[200];
2764 CONST char *directory_name = NULL;
2765 CONST char *main_file_name = NULL;
2766 CONST char *current_file_name = NULL;
2767 CONST char *line_file_name = NULL; /* Value of current_file_name at line number. */
2768 bfd_vma high_line_vma = ~0;
2769 bfd_vma low_func_vma = 0;
2771 *filename_ptr = abfd->filename;
2772 *functionname_ptr = 0;
2774 if (symbols != (asymbol **)NULL) {
2775 for (p = symbols; *p; p++) {
2776 aout_symbol_type *q = (aout_symbol_type *)(*p);
2780 main_file_name = current_file_name = q->symbol.name;
2781 /* Look ahead to next symbol to check if that too is an N_SO. */
2785 q = (aout_symbol_type *)(*p);
2786 if (q->type != (int)N_SO)
2789 /* Found a second N_SO First is directory; second is filename. */
2790 directory_name = current_file_name;
2791 main_file_name = current_file_name = q->symbol.name;
2792 if (obj_textsec(abfd) != section)
2796 current_file_name = q->symbol.name;
2803 /* We'll keep this if it resolves nearer than the one we have already */
2804 if (q->symbol.value >= offset &&
2805 q->symbol.value < high_line_vma) {
2806 *line_ptr = q->desc;
2807 high_line_vma = q->symbol.value;
2808 line_file_name = current_file_name;
2813 /* We'll keep this if it is nearer than the one we have already */
2814 if (q->symbol.value >= low_func_vma &&
2815 q->symbol.value <= offset) {
2816 low_func_vma = q->symbol.value;
2817 func = (asymbol *)q;
2819 if (*line_ptr && func) {
2820 CONST char *function = func->name;
2823 /* The caller expects a symbol name. We actually have a
2824 function name, without the leading underscore. Put the
2825 underscore back in, so that the caller gets a symbol
2827 if (bfd_get_symbol_leading_char (abfd) == '\0')
2828 strncpy (buffer, function, sizeof (buffer) - 1);
2831 buffer[0] = bfd_get_symbol_leading_char (abfd);
2832 strncpy (buffer + 1, function, sizeof (buffer) - 2);
2834 buffer[sizeof(buffer)-1] = 0;
2835 /* Have to remove : stuff */
2836 p = strchr(buffer,':');
2837 if (p != NULL) { *p = '\0'; }
2838 *functionname_ptr = buffer;
2850 main_file_name = line_file_name;
2851 if (main_file_name) {
2852 if (main_file_name[0] == '/' || directory_name == NULL)
2853 *filename_ptr = main_file_name;
2855 sprintf(filename_buffer, "%.140s%.50s",
2856 directory_name, main_file_name);
2857 *filename_ptr = filename_buffer;
2866 NAME(aout,sizeof_headers) (abfd, execable)
2870 return adata(abfd).exec_bytes_size;
2873 /* Free all information we have cached for this BFD. We can always
2874 read it again later if we need it. */
2877 NAME(aout,bfd_free_cached_info) (abfd)
2882 if (bfd_get_format (abfd) != bfd_object)
2885 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
2886 FREE (obj_aout_symbols (abfd));
2887 FREE (obj_aout_external_syms (abfd));
2888 FREE (obj_aout_external_strings (abfd));
2889 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
2890 FREE (o->relocation);
2896 /* a.out link code. */
2898 /* a.out linker hash table entries. */
2900 struct aout_link_hash_entry
2902 struct bfd_link_hash_entry root;
2903 /* Symbol index in output file. */
2907 /* a.out linker hash table. */
2909 struct aout_link_hash_table
2911 struct bfd_link_hash_table root;
2914 static struct bfd_hash_entry *aout_link_hash_newfunc
2915 PARAMS ((struct bfd_hash_entry *entry,
2916 struct bfd_hash_table *table,
2917 const char *string));
2918 static boolean aout_link_add_object_symbols
2919 PARAMS ((bfd *, struct bfd_link_info *));
2920 static boolean aout_link_check_archive_element
2921 PARAMS ((bfd *, struct bfd_link_info *, boolean *));
2922 static boolean aout_link_free_symbols PARAMS ((bfd *));
2923 static boolean aout_link_check_ar_symbols
2924 PARAMS ((bfd *, struct bfd_link_info *, boolean *pneeded));
2925 static boolean aout_link_add_symbols
2926 PARAMS ((bfd *, struct bfd_link_info *));
2928 /* Routine to create an entry in an a.out link hash table. */
2930 static struct bfd_hash_entry *
2931 aout_link_hash_newfunc (entry, table, string)
2932 struct bfd_hash_entry *entry;
2933 struct bfd_hash_table *table;
2936 struct aout_link_hash_entry *ret = (struct aout_link_hash_entry *) entry;
2938 /* Allocate the structure if it has not already been allocated by a
2940 if (ret == (struct aout_link_hash_entry *) NULL)
2941 ret = ((struct aout_link_hash_entry *)
2942 bfd_hash_allocate (table, sizeof (struct aout_link_hash_entry)));
2943 if (ret == (struct aout_link_hash_entry *) NULL)
2945 bfd_set_error (bfd_error_no_memory);
2946 return (struct bfd_hash_entry *) ret;
2949 /* Call the allocation method of the superclass. */
2950 ret = ((struct aout_link_hash_entry *)
2951 _bfd_link_hash_newfunc ((struct bfd_hash_entry *) ret,
2954 /* Set local fields. */
2957 return (struct bfd_hash_entry *) ret;
2960 /* Create an a.out link hash table. */
2962 struct bfd_link_hash_table *
2963 NAME(aout,link_hash_table_create) (abfd)
2966 struct aout_link_hash_table *ret;
2968 ret = ((struct aout_link_hash_table *)
2969 malloc (sizeof (struct aout_link_hash_table)));
2970 if (ret == (struct aout_link_hash_table *) NULL)
2972 bfd_set_error (bfd_error_no_memory);
2973 return (struct bfd_link_hash_table *) NULL;
2975 if (! _bfd_link_hash_table_init (&ret->root, abfd,
2976 aout_link_hash_newfunc))
2979 return (struct bfd_link_hash_table *) NULL;
2984 /* Look up an entry in an a.out link hash table. */
2986 #define aout_link_hash_lookup(table, string, create, copy, follow) \
2987 ((struct aout_link_hash_entry *) \
2988 bfd_link_hash_lookup (&(table)->root, (string), (create), (copy), (follow)))
2990 /* Traverse an a.out link hash table. */
2992 #define aout_link_hash_traverse(table, func, info) \
2993 (bfd_link_hash_traverse \
2995 (boolean (*) PARAMS ((struct bfd_link_hash_entry *, PTR))) (func), \
2998 /* Get the a.out link hash table from the info structure. This is
3001 #define aout_hash_table(p) ((struct aout_link_hash_table *) ((p)->hash))
3003 /* Given an a.out BFD, add symbols to the global hash table as
3007 NAME(aout,link_add_symbols) (abfd, info)
3009 struct bfd_link_info *info;
3011 switch (bfd_get_format (abfd))
3014 return aout_link_add_object_symbols (abfd, info);
3016 return _bfd_generic_link_add_archive_symbols
3017 (abfd, info, aout_link_check_archive_element);
3019 bfd_set_error (bfd_error_wrong_format);
3024 /* Add symbols from an a.out object file. */
3027 aout_link_add_object_symbols (abfd, info)
3029 struct bfd_link_info *info;
3031 if (! aout_get_external_symbols (abfd))
3033 if (! aout_link_add_symbols (abfd, info))
3035 if (! info->keep_memory)
3037 if (! aout_link_free_symbols (abfd))
3043 /* Check a single archive element to see if we need to include it in
3044 the link. *PNEEDED is set according to whether this element is
3045 needed in the link or not. This is called from
3046 _bfd_generic_link_add_archive_symbols. */
3049 aout_link_check_archive_element (abfd, info, pneeded)
3051 struct bfd_link_info *info;
3054 if (! aout_get_external_symbols (abfd))
3057 if (! aout_link_check_ar_symbols (abfd, info, pneeded))
3062 if (! aout_link_add_symbols (abfd, info))
3066 /* We keep around the symbols even if we aren't going to use this
3067 object file, because we may want to reread it. This doesn't
3068 waste too much memory, because it isn't all that common to read
3069 an archive element but not need it. */
3070 if (! info->keep_memory)
3072 if (! aout_link_free_symbols (abfd))
3079 /* Free up the internal symbols read from an a.out file. */
3082 aout_link_free_symbols (abfd)
3085 if (obj_aout_external_syms (abfd) != (struct external_nlist *) NULL)
3087 free ((PTR) obj_aout_external_syms (abfd));
3088 obj_aout_external_syms (abfd) = (struct external_nlist *) NULL;
3090 if (obj_aout_external_strings (abfd) != (char *) NULL)
3092 free ((PTR) obj_aout_external_strings (abfd));
3093 obj_aout_external_strings (abfd) = (char *) NULL;
3098 /* Look through the internal symbols to see if this object file should
3099 be included in the link. We should include this object file if it
3100 defines any symbols which are currently undefined. If this object
3101 file defines a common symbol, then we may adjust the size of the
3102 known symbol but we do not include the object file in the link
3103 (unless there is some other reason to include it). */
3106 aout_link_check_ar_symbols (abfd, info, pneeded)
3108 struct bfd_link_info *info;
3111 register struct external_nlist *p;
3112 struct external_nlist *pend;
3117 /* Look through all the symbols. */
3118 p = obj_aout_external_syms (abfd);
3119 pend = p + obj_aout_external_sym_count (abfd);
3120 strings = obj_aout_external_strings (abfd);
3121 for (; p < pend; p++)
3123 int type = bfd_h_get_8 (abfd, p->e_type);
3125 struct bfd_link_hash_entry *h;
3127 /* Ignore symbols that are not externally visible. */
3128 if ((type & N_EXT) == 0)
3130 if (type == N_WARNING
3136 name = strings + GET_WORD (abfd, p->e_strx);
3137 h = bfd_link_hash_lookup (info->hash, name, false, false, true);
3139 /* We are only interested in symbols that are currently
3140 undefined or common. */
3141 if (h == (struct bfd_link_hash_entry *) NULL
3142 || (h->type != bfd_link_hash_undefined
3143 && h->type != bfd_link_hash_common))
3145 if (type == (N_INDR | N_EXT))
3150 if (type == (N_TEXT | N_EXT)
3151 || type == (N_DATA | N_EXT)
3152 || type == (N_BSS | N_EXT)
3153 || type == (N_ABS | N_EXT)
3154 || type == (N_INDR | N_EXT))
3156 /* This object file defines this symbol. We must link it
3157 in. This is true regardless of whether the current
3158 definition of the symbol is undefined or common. If the
3159 current definition is common, we have a case in which we
3160 have already seen an object file including
3162 and this object file from the archive includes
3164 In such a case we must include this object file. */
3165 if (! (*info->callbacks->add_archive_element) (info, abfd, name))
3171 if (type == (N_UNDF | N_EXT))
3175 value = GET_WORD (abfd, p->e_value);
3178 /* This symbol is common in the object from the archive
3180 if (h->type == bfd_link_hash_undefined)
3184 symbfd = h->u.undef.abfd;
3185 if (symbfd == (bfd *) NULL)
3187 /* This symbol was created as undefined from
3188 outside BFD. We assume that we should link
3189 in the object file. This is done for the -u
3190 option in the linker. */
3191 if (! (*info->callbacks->add_archive_element) (info,
3198 /* Turn the current link symbol into a common
3199 symbol. It is already on the undefs list. */
3200 h->type = bfd_link_hash_common;
3201 h->u.c.size = value;
3202 h->u.c.section = bfd_make_section_old_way (symbfd,
3207 /* Adjust the size of the common symbol if
3209 if (value > h->u.c.size)
3210 h->u.c.size = value;
3216 /* We do not need this object file. */
3220 /* Add all symbols from an object file to the hash table. */
3223 aout_link_add_symbols (abfd, info)
3225 struct bfd_link_info *info;
3227 bfd_size_type sym_count;
3230 struct aout_link_hash_entry **sym_hash;
3231 register struct external_nlist *p;
3232 struct external_nlist *pend;
3234 sym_count = obj_aout_external_sym_count (abfd);
3235 strings = obj_aout_external_strings (abfd);
3236 if (info->keep_memory)
3241 /* We keep a list of the linker hash table entries that correspond
3242 to particular symbols. We could just look them up in the hash
3243 table, but keeping the list is more efficient. Perhaps this
3244 should be conditional on info->keep_memory. */
3245 sym_hash = ((struct aout_link_hash_entry **)
3248 * sizeof (struct aout_link_hash_entry *))));
3251 bfd_set_error (bfd_error_no_memory);
3254 obj_aout_sym_hashes (abfd) = sym_hash;
3256 p = obj_aout_external_syms (abfd);
3257 pend = p + sym_count;
3258 for (; p < pend; p++, sym_hash++)
3269 type = bfd_h_get_8 (abfd, p->e_type);
3271 /* Ignore debugging symbols. */
3272 if ((type & N_STAB) != 0)
3275 /* Ignore symbols that are not external. */
3276 if ((type & N_EXT) == 0
3277 && type != N_WARNING
3283 /* If this is an N_INDR symbol we must skip the next entry,
3284 which is the symbol to indirect to (actually, an N_INDR
3285 symbol without N_EXT set is pretty useless). */
3294 /* Ignore N_FN symbols (these appear to have N_EXT set). */
3298 name = strings + GET_WORD (abfd, p->e_strx);
3299 value = GET_WORD (abfd, p->e_value);
3306 case N_UNDF | N_EXT:
3308 section = &bfd_com_section;
3310 section = &bfd_und_section;
3313 section = &bfd_abs_section;
3315 case N_TEXT | N_EXT:
3316 section = obj_textsec (abfd);
3317 value -= bfd_get_section_vma (abfd, section);
3319 case N_DATA | N_EXT:
3320 section = obj_datasec (abfd);
3321 value -= bfd_get_section_vma (abfd, section);
3324 section = obj_bsssec (abfd);
3325 value -= bfd_get_section_vma (abfd, section);
3327 case N_INDR | N_EXT:
3328 /* An indirect symbol. The next symbol is the symbol
3329 which this one really is. */
3330 BFD_ASSERT (p + 1 < pend);
3332 string = strings + GET_WORD (abfd, p->e_strx);
3333 section = &bfd_ind_section;
3334 flags |= BSF_INDIRECT;
3336 case N_COMM | N_EXT:
3337 section = &bfd_com_section;
3339 case N_SETA: case N_SETA | N_EXT:
3340 section = &bfd_abs_section;
3341 flags |= BSF_CONSTRUCTOR;
3343 case N_SETT: case N_SETT | N_EXT:
3344 section = obj_textsec (abfd);
3345 flags |= BSF_CONSTRUCTOR;
3346 value -= bfd_get_section_vma (abfd, section);
3348 case N_SETD: case N_SETD | N_EXT:
3349 section = obj_datasec (abfd);
3350 flags |= BSF_CONSTRUCTOR;
3351 value -= bfd_get_section_vma (abfd, section);
3353 case N_SETB: case N_SETB | N_EXT:
3354 section = obj_bsssec (abfd);
3355 flags |= BSF_CONSTRUCTOR;
3356 value -= bfd_get_section_vma (abfd, section);
3359 /* A warning symbol. The next symbol is the one to warn
3361 BFD_ASSERT (p + 1 < pend);
3364 name = strings + GET_WORD (abfd, p->e_strx);
3365 section = &bfd_und_section;
3366 flags |= BSF_WARNING;
3370 if (! (_bfd_generic_link_add_one_symbol
3371 (info, abfd, name, flags, section, value, string, copy, false,
3372 (struct bfd_link_hash_entry **) sym_hash)))
3375 if (type == (N_INDR | N_EXT) || type == N_WARNING)
3382 /* During the final link step we need to pass around a bunch of
3383 information, so we do it in an instance of this structure. */
3385 struct aout_final_link_info
3387 /* General link information. */
3388 struct bfd_link_info *info;
3391 /* Reloc file positions. */
3392 file_ptr treloff, dreloff;
3393 /* File position of symbols. */
3396 struct stringtab_data strtab;
3399 static boolean aout_link_input_bfd
3400 PARAMS ((struct aout_final_link_info *, bfd *input_bfd));
3401 static boolean aout_link_write_symbols
3402 PARAMS ((struct aout_final_link_info *, bfd *input_bfd, int *symbol_map));
3403 static boolean aout_link_write_other_symbol
3404 PARAMS ((struct aout_link_hash_entry *, PTR));
3405 static boolean aout_link_input_section
3406 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3407 asection *input_section, file_ptr *reloff_ptr,
3408 bfd_size_type rel_size, int *symbol_map));
3409 static boolean aout_link_input_section_std
3410 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3411 asection *input_section, struct reloc_std_external *,
3412 bfd_size_type rel_size, bfd_byte *contents, int *symbol_map));
3413 static boolean aout_link_input_section_ext
3414 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3415 asection *input_section, struct reloc_ext_external *,
3416 bfd_size_type rel_size, bfd_byte *contents, int *symbol_map));
3417 static INLINE asection *aout_reloc_index_to_section
3418 PARAMS ((bfd *, int));
3419 static boolean aout_link_reloc_link_order
3420 PARAMS ((struct aout_final_link_info *, asection *,
3421 struct bfd_link_order *));
3423 /* Do the final link step. This is called on the output BFD. The
3424 INFO structure should point to a list of BFDs linked through the
3425 link_next field which can be used to find each BFD which takes part
3426 in the output. Also, each section in ABFD should point to a list
3427 of bfd_link_order structures which list all the input sections for
3428 the output section. */
3431 NAME(aout,final_link) (abfd, info, callback)
3433 struct bfd_link_info *info;
3434 void (*callback) PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *));
3436 struct aout_final_link_info aout_info;
3438 bfd_size_type text_size;
3440 register struct bfd_link_order *p;
3442 boolean have_link_order_relocs;
3444 aout_info.info = info;
3445 aout_info.output_bfd = abfd;
3447 if (! info->relocateable)
3449 exec_hdr (abfd)->a_trsize = 0;
3450 exec_hdr (abfd)->a_drsize = 0;
3454 bfd_size_type trsize, drsize;
3456 /* Count up the relocation sizes. */
3459 for (sub = info->input_bfds; sub != (bfd *) NULL; sub = sub->link_next)
3461 if (bfd_get_flavour (abfd) == bfd_target_aout_flavour)
3463 trsize += exec_hdr (sub)->a_trsize;
3464 drsize += exec_hdr (sub)->a_drsize;
3468 /* FIXME: We need to identify the .text and .data sections
3469 and call get_reloc_upper_bound and canonicalize_reloc to
3470 work out the number of relocs needed, and then multiply
3471 by the reloc size. */
3475 trsize += (_bfd_count_link_order_relocs (obj_textsec (abfd)
3477 * obj_reloc_entry_size (abfd));
3478 exec_hdr (abfd)->a_trsize = trsize;
3479 drsize += (_bfd_count_link_order_relocs (obj_datasec (abfd)
3481 * obj_reloc_entry_size (abfd));
3482 exec_hdr (abfd)->a_drsize = drsize;
3485 exec_hdr (abfd)->a_entry = bfd_get_start_address (abfd);
3487 /* Adjust the section sizes and vmas according to the magic number.
3488 This sets a_text, a_data and a_bss in the exec_hdr and sets the
3489 filepos for each section. */
3490 if (! NAME(aout,adjust_sizes_and_vmas) (abfd, &text_size, &text_end))
3493 /* The relocation and symbol file positions differ among a.out
3494 targets. We are passed a callback routine from the backend
3495 specific code to handle this.
3496 FIXME: At this point we do not know how much space the symbol
3497 table will require. This will not work for any (nonstandard)
3498 a.out target that needs to know the symbol table size before it
3499 can compute the relocation file positions. This may or may not
3500 be the case for the hp300hpux target, for example. */
3501 (*callback) (abfd, &aout_info.treloff, &aout_info.dreloff,
3503 obj_textsec (abfd)->rel_filepos = aout_info.treloff;
3504 obj_datasec (abfd)->rel_filepos = aout_info.dreloff;
3505 obj_sym_filepos (abfd) = aout_info.symoff;
3507 /* We keep a count of the symbols as we output them. */
3508 obj_aout_external_sym_count (abfd) = 0;
3510 /* We accumulate the string table as we write out the symbols. */
3511 stringtab_init (&aout_info.strtab);
3513 /* The most time efficient way to do the link would be to read all
3514 the input object files into memory and then sort out the
3515 information into the output file. Unfortunately, that will
3516 probably use too much memory. Another method would be to step
3517 through everything that composes the text section and write it
3518 out, and then everything that composes the data section and write
3519 it out, and then write out the relocs, and then write out the
3520 symbols. Unfortunately, that requires reading stuff from each
3521 input file several times, and we will not be able to keep all the
3522 input files open simultaneously, and reopening them will be slow.
3524 What we do is basically process one input file at a time. We do
3525 everything we need to do with an input file once--copy over the
3526 section contents, handle the relocation information, and write
3527 out the symbols--and then we throw away the information we read
3528 from it. This approach requires a lot of lseeks of the output
3529 file, which is unfortunate but still faster than reopening a lot
3532 We use the output_has_begun field of the input BFDs to see
3533 whether we have already handled it. */
3534 for (sub = info->input_bfds; sub != (bfd *) NULL; sub = sub->link_next)
3535 sub->output_has_begun = false;
3537 have_link_order_relocs = false;
3538 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
3540 for (p = o->link_order_head;
3541 p != (struct bfd_link_order *) NULL;
3544 if (p->type == bfd_indirect_link_order
3545 && (bfd_get_flavour (p->u.indirect.section->owner)
3546 == bfd_target_aout_flavour))
3550 input_bfd = p->u.indirect.section->owner;
3551 if (! input_bfd->output_has_begun)
3553 if (! aout_link_input_bfd (&aout_info, input_bfd))
3555 input_bfd->output_has_begun = true;
3558 else if (p->type == bfd_section_reloc_link_order
3559 || p->type == bfd_symbol_reloc_link_order)
3561 /* These are handled below. */
3562 have_link_order_relocs = true;
3566 if (! _bfd_default_link_order (abfd, info, o, p))
3572 /* Write out any symbols that we have not already written out. */
3573 aout_link_hash_traverse (aout_hash_table (info),
3574 aout_link_write_other_symbol,
3577 /* Now handle any relocs we were asked to create by the linker.
3578 These did not come from any input file. We must do these after
3579 we have written out all the symbols, so that we know the symbol
3581 if (have_link_order_relocs)
3583 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
3585 for (p = o->link_order_head;
3586 p != (struct bfd_link_order *) NULL;
3589 if (p->type == bfd_section_reloc_link_order
3590 || p->type == bfd_symbol_reloc_link_order)
3592 if (! aout_link_reloc_link_order (&aout_info, o, p))
3599 /* Update the header information. */
3600 abfd->symcount = obj_aout_external_sym_count (abfd);
3601 exec_hdr (abfd)->a_syms = abfd->symcount * EXTERNAL_NLIST_SIZE;
3602 obj_str_filepos (abfd) = obj_sym_filepos (abfd) + exec_hdr (abfd)->a_syms;
3603 obj_textsec (abfd)->reloc_count =
3604 exec_hdr (abfd)->a_trsize / obj_reloc_entry_size (abfd);
3605 obj_datasec (abfd)->reloc_count =
3606 exec_hdr (abfd)->a_drsize / obj_reloc_entry_size (abfd);
3608 /* Write out the string table. */
3609 if (bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET) != 0)
3611 return emit_strtab (abfd, &aout_info.strtab);
3614 /* Link an a.out input BFD into the output file. */
3617 aout_link_input_bfd (finfo, input_bfd)
3618 struct aout_final_link_info *finfo;
3621 bfd_size_type sym_count;
3622 int *symbol_map = NULL;
3624 BFD_ASSERT (bfd_get_format (input_bfd) == bfd_object);
3626 /* Get the symbols. We probably have them already, unless
3627 finfo->info->keep_memory is false. */
3628 if (! aout_get_external_symbols (input_bfd))
3631 sym_count = obj_aout_external_sym_count (input_bfd);
3632 symbol_map = (int *) malloc ((size_t) sym_count * sizeof (int));
3633 if (symbol_map == NULL && sym_count != 0)
3635 bfd_set_error (bfd_error_no_memory);
3639 /* Write out the symbols and get a map of the new indices. */
3640 if (! aout_link_write_symbols (finfo, input_bfd, symbol_map))
3643 /* Relocate and write out the sections. */
3644 if (! aout_link_input_section (finfo, input_bfd,
3645 obj_textsec (input_bfd),
3647 exec_hdr (input_bfd)->a_trsize,
3649 || ! aout_link_input_section (finfo, input_bfd,
3650 obj_datasec (input_bfd),
3652 exec_hdr (input_bfd)->a_drsize,
3656 /* If we are not keeping memory, we don't need the symbols any
3657 longer. We still need them if we are keeping memory, because the
3658 strings in the hash table point into them. */
3659 if (! finfo->info->keep_memory)
3661 if (! aout_link_free_symbols (input_bfd))
3665 if (symbol_map != NULL)
3669 if (symbol_map != NULL)
3674 /* Adjust and write out the symbols for an a.out file. Set the new
3675 symbol indices into a symbol_map. */
3678 aout_link_write_symbols (finfo, input_bfd, symbol_map)
3679 struct aout_final_link_info *finfo;
3684 bfd_size_type sym_count;
3686 enum bfd_link_strip strip;
3687 enum bfd_link_discard discard;
3688 struct external_nlist *output_syms = NULL;
3689 struct external_nlist *outsym;
3690 register struct external_nlist *sym;
3691 struct external_nlist *sym_end;
3692 struct aout_link_hash_entry **sym_hash;
3694 boolean skip_indirect;
3696 output_bfd = finfo->output_bfd;
3697 sym_count = obj_aout_external_sym_count (input_bfd);
3698 strings = obj_aout_external_strings (input_bfd);
3699 strip = finfo->info->strip;
3700 discard = finfo->info->discard;
3701 output_syms = ((struct external_nlist *)
3702 malloc ((size_t) (sym_count + 1) * EXTERNAL_NLIST_SIZE));
3703 if (output_syms == NULL)
3705 bfd_set_error (bfd_error_no_memory);
3708 outsym = output_syms;
3710 /* First write out a symbol for this object file, unless we are
3711 discarding such symbols. */
3712 if (strip != strip_all
3713 && (strip != strip_some
3714 || bfd_hash_lookup (finfo->info->keep_hash, input_bfd->filename,
3715 false, false) != NULL)
3716 && discard != discard_all)
3718 bfd_h_put_8 (output_bfd, N_TEXT, outsym->e_type);
3719 bfd_h_put_8 (output_bfd, 0, outsym->e_other);
3720 bfd_h_put_16 (output_bfd, (bfd_vma) 0, outsym->e_desc);
3721 PUT_WORD (output_bfd,
3722 add_to_stringtab (output_bfd, input_bfd->filename,
3725 PUT_WORD (output_bfd,
3726 (bfd_get_section_vma (output_bfd,
3727 obj_textsec (input_bfd)->output_section)
3728 + obj_textsec (input_bfd)->output_offset),
3730 ++obj_aout_external_sym_count (output_bfd);
3735 skip_indirect = false;
3736 sym = obj_aout_external_syms (input_bfd);
3737 sym_end = sym + sym_count;
3738 sym_hash = obj_aout_sym_hashes (input_bfd);
3739 for (; sym < sym_end; sym++, sym_hash++, symbol_map++)
3743 struct aout_link_hash_entry *h;
3750 type = bfd_h_get_8 (input_bfd, sym->e_type);
3751 name = strings + GET_WORD (input_bfd, sym->e_strx);
3757 /* Pass this symbol through. It is the target of an
3758 indirect or warning symbol. */
3759 val = GET_WORD (input_bfd, sym->e_value);
3762 else if (skip_indirect)
3764 /* Skip this symbol, which is the target of an indirect
3765 symbol that we have changed to no longer be an indirect
3767 skip_indirect = false;
3772 struct aout_link_hash_entry *hresolve;
3774 /* We have saved the hash table entry for this symbol, if
3775 there is one. Note that we could just look it up again
3776 in the hash table, provided we first check that it is an
3780 /* If this is an indirect or warning symbol, then change
3781 hresolve to the base symbol. We also change *sym_hash so
3782 that the relocation routines relocate against the real
3785 if (h != (struct aout_link_hash_entry *) NULL
3786 && (h->root.type == bfd_link_hash_indirect
3787 || h->root.type == bfd_link_hash_warning))
3789 hresolve = (struct aout_link_hash_entry *) h->root.u.i.link;
3790 while (hresolve->root.type == bfd_link_hash_indirect)
3791 hresolve = ((struct aout_link_hash_entry *)
3792 hresolve->root.u.i.link);
3793 *sym_hash = hresolve;
3796 /* If the symbol has already been written out, skip it. */
3797 if (h != (struct aout_link_hash_entry *) NULL
3800 *symbol_map = h->indx;
3804 /* See if we are stripping this symbol. */
3810 case strip_debugger:
3811 if ((type & N_STAB) != 0)
3815 if (bfd_hash_lookup (finfo->info->keep_hash, name, false, false)
3825 if (h != (struct aout_link_hash_entry *) NULL)
3826 h->root.written = true;
3830 /* Get the value of the symbol. */
3831 if ((type & N_TYPE) == N_TEXT)
3832 symsec = obj_textsec (input_bfd);
3833 else if ((type & N_TYPE) == N_DATA)
3834 symsec = obj_datasec (input_bfd);
3835 else if ((type & N_TYPE) == N_BSS)
3836 symsec = obj_bsssec (input_bfd);
3837 else if ((type & N_TYPE) == N_ABS)
3838 symsec = &bfd_abs_section;
3839 else if (((type & N_TYPE) == N_INDR
3840 && (hresolve == (struct aout_link_hash_entry *) NULL
3841 || (hresolve->root.type != bfd_link_hash_defined
3842 && hresolve->root.type != bfd_link_hash_common)))
3843 || type == N_WARNING)
3845 /* Pass the next symbol through unchanged. The
3846 condition above for indirect symbols is so that if
3847 the indirect symbol was defined, we output it with
3848 the correct definition so the debugger will
3851 val = GET_WORD (input_bfd, sym->e_value);
3854 else if ((type & N_STAB) != 0)
3856 val = GET_WORD (input_bfd, sym->e_value);
3861 /* If we get here with an indirect symbol, it means that
3862 we are outputting it with a real definition. In such
3863 a case we do not want to output the next symbol,
3864 which is the target of the indirection. */
3865 if ((type & N_TYPE) == N_INDR)
3866 skip_indirect = true;
3868 /* We need to get the value from the hash table. We use
3869 hresolve so that if we have defined an indirect
3870 symbol we output the final definition. */
3871 if (h == (struct aout_link_hash_entry *) NULL)
3873 else if (hresolve->root.type == bfd_link_hash_defined)
3875 asection *input_section;
3876 asection *output_section;
3878 /* This case means a common symbol which was turned
3879 into a defined symbol. */
3880 input_section = hresolve->root.u.def.section;
3881 output_section = input_section->output_section;
3882 BFD_ASSERT (output_section == &bfd_abs_section
3883 || output_section->owner == output_bfd);
3884 val = (hresolve->root.u.def.value
3885 + bfd_get_section_vma (output_bfd, output_section)
3886 + input_section->output_offset);
3888 /* Get the correct type based on the section. If
3889 this is a constructed set, force it to be
3890 globally visible. */
3899 if (output_section == obj_textsec (output_bfd))
3901 else if (output_section == obj_datasec (output_bfd))
3903 else if (output_section == obj_bsssec (output_bfd))
3908 else if (hresolve->root.type == bfd_link_hash_common)
3909 val = hresolve->root.u.c.size;
3915 if (symsec != (asection *) NULL)
3916 val = (symsec->output_section->vma
3917 + symsec->output_offset
3918 + (GET_WORD (input_bfd, sym->e_value)
3921 /* If this is a global symbol set the written flag, and if
3922 it is a local symbol see if we should discard it. */
3923 if (h != (struct aout_link_hash_entry *) NULL)
3925 h->root.written = true;
3926 h->indx = obj_aout_external_sym_count (output_bfd);
3935 if (*name == *finfo->info->lprefix
3936 && (finfo->info->lprefix_len == 1
3937 || strncmp (name, finfo->info->lprefix,
3938 finfo->info->lprefix_len) == 0))
3953 /* Copy this symbol into the list of symbols we are going to
3955 bfd_h_put_8 (output_bfd, type, outsym->e_type);
3956 bfd_h_put_8 (output_bfd, bfd_h_get_8 (input_bfd, sym->e_other),
3958 bfd_h_put_16 (output_bfd, bfd_h_get_16 (input_bfd, sym->e_desc),
3960 if (! finfo->info->keep_memory)
3962 /* name points into a string table which we are going to
3963 free. If there is a hash table entry, use that string.
3964 Otherwise, copy name into memory. */
3965 if (h != (struct aout_link_hash_entry *) NULL)
3966 name = (*sym_hash)->root.root.string;
3971 n = bfd_alloc (output_bfd, strlen (name) + 1);
3976 PUT_WORD (output_bfd,
3977 add_to_stringtab (output_bfd, name, &finfo->strtab),
3979 PUT_WORD (output_bfd, val, outsym->e_value);
3980 *symbol_map = obj_aout_external_sym_count (output_bfd);
3981 ++obj_aout_external_sym_count (output_bfd);
3985 /* Write out the output symbols we have just constructed. */
3986 if (outsym > output_syms)
3988 bfd_size_type outsym_count;
3990 if (bfd_seek (output_bfd, finfo->symoff, SEEK_SET) != 0)
3992 outsym_count = outsym - output_syms;
3993 if (bfd_write ((PTR) output_syms, (bfd_size_type) EXTERNAL_NLIST_SIZE,
3994 (bfd_size_type) outsym_count, output_bfd)
3995 != outsym_count * EXTERNAL_NLIST_SIZE)
3997 finfo->symoff += outsym_count * EXTERNAL_NLIST_SIZE;
4000 if (output_syms != NULL)
4004 if (output_syms != NULL)
4009 /* Write out a symbol that was not associated with an a.out input
4013 aout_link_write_other_symbol (h, data)
4014 struct aout_link_hash_entry *h;
4017 struct aout_final_link_info *finfo = (struct aout_final_link_info *) data;
4021 struct external_nlist outsym;
4023 if (h->root.written)
4026 h->root.written = true;
4028 if (finfo->info->strip == strip_all
4029 || (finfo->info->strip == strip_some
4030 && bfd_hash_lookup (finfo->info->keep_hash, h->root.root.string,
4031 false, false) == NULL))
4034 output_bfd = finfo->output_bfd;
4036 switch (h->root.type)
4039 case bfd_link_hash_new:
4041 /* Avoid variable not initialized warnings. */
4043 case bfd_link_hash_undefined:
4044 type = N_UNDF | N_EXT;
4047 case bfd_link_hash_defined:
4051 sec = h->root.u.def.section;
4052 BFD_ASSERT (sec == &bfd_abs_section
4053 || sec->owner == output_bfd);
4054 if (sec == obj_textsec (output_bfd))
4055 type = N_TEXT | N_EXT;
4056 else if (sec == obj_datasec (output_bfd))
4057 type = N_DATA | N_EXT;
4058 else if (sec == obj_bsssec (output_bfd))
4059 type = N_BSS | N_EXT;
4061 type = N_ABS | N_EXT;
4062 val = (h->root.u.def.value
4063 + sec->output_section->vma
4064 + sec->output_offset);
4067 case bfd_link_hash_common:
4068 type = N_UNDF | N_EXT;
4069 val = h->root.u.c.size;
4071 case bfd_link_hash_indirect:
4072 case bfd_link_hash_warning:
4073 /* FIXME: Ignore these for now. The circumstances under which
4074 they should be written out are not clear to me. */
4078 bfd_h_put_8 (output_bfd, type, outsym.e_type);
4079 bfd_h_put_8 (output_bfd, 0, outsym.e_other);
4080 bfd_h_put_16 (output_bfd, 0, outsym.e_desc);
4081 PUT_WORD (output_bfd,
4082 add_to_stringtab (output_bfd, h->root.root.string, &finfo->strtab),
4084 PUT_WORD (output_bfd, val, outsym.e_value);
4086 if (bfd_seek (output_bfd, finfo->symoff, SEEK_SET) != 0
4087 || bfd_write ((PTR) &outsym, (bfd_size_type) EXTERNAL_NLIST_SIZE,
4088 (bfd_size_type) 1, output_bfd) != EXTERNAL_NLIST_SIZE)
4090 /* FIXME: No way to handle errors. */
4094 finfo->symoff += EXTERNAL_NLIST_SIZE;
4095 h->indx = obj_aout_external_sym_count (output_bfd);
4096 ++obj_aout_external_sym_count (output_bfd);
4101 /* Link an a.out section into the output file. */
4104 aout_link_input_section (finfo, input_bfd, input_section, reloff_ptr,
4105 rel_size, symbol_map)
4106 struct aout_final_link_info *finfo;
4108 asection *input_section;
4109 file_ptr *reloff_ptr;
4110 bfd_size_type rel_size;
4113 bfd_size_type input_size;
4114 bfd_byte *contents = NULL;
4117 /* Get the section contents. */
4118 input_size = bfd_section_size (input_bfd, input_section);
4119 contents = (bfd_byte *) malloc (input_size);
4120 if (contents == NULL && input_size != 0)
4122 bfd_set_error (bfd_error_no_memory);
4125 if (! bfd_get_section_contents (input_bfd, input_section, (PTR) contents,
4126 (file_ptr) 0, input_size))
4129 /* Read in the relocs. */
4130 relocs = (PTR) malloc (rel_size);
4131 if (relocs == NULL && rel_size != 0)
4133 bfd_set_error (bfd_error_no_memory);
4136 if (bfd_seek (input_bfd, input_section->rel_filepos, SEEK_SET) != 0
4137 || bfd_read (relocs, 1, rel_size, input_bfd) != rel_size)
4140 /* Relocate the section contents. */
4141 if (obj_reloc_entry_size (input_bfd) == RELOC_STD_SIZE)
4143 if (! aout_link_input_section_std (finfo, input_bfd, input_section,
4144 (struct reloc_std_external *) relocs,
4145 rel_size, contents, symbol_map))
4150 if (! aout_link_input_section_ext (finfo, input_bfd, input_section,
4151 (struct reloc_ext_external *) relocs,
4152 rel_size, contents, symbol_map))
4156 /* Write out the section contents. */
4157 if (! bfd_set_section_contents (finfo->output_bfd,
4158 input_section->output_section,
4160 input_section->output_offset,
4164 /* If we are producing relocateable output, the relocs were
4165 modified, and we now write them out. */
4166 if (finfo->info->relocateable)
4168 if (bfd_seek (finfo->output_bfd, *reloff_ptr, SEEK_SET) != 0)
4170 if (bfd_write (relocs, (bfd_size_type) 1, rel_size, finfo->output_bfd)
4173 *reloff_ptr += rel_size;
4175 /* Assert that the relocs have not run into the symbols, and
4176 that if these are the text relocs they have not run into the
4178 BFD_ASSERT (*reloff_ptr <= obj_sym_filepos (finfo->output_bfd)
4179 && (reloff_ptr != &finfo->treloff
4181 <= obj_datasec (finfo->output_bfd)->rel_filepos)));
4186 if (contents != NULL)
4192 if (contents != NULL)
4197 /* Get the section corresponding to a reloc index. */
4199 static INLINE asection *
4200 aout_reloc_index_to_section (abfd, indx)
4204 switch (indx & N_TYPE)
4207 return obj_textsec (abfd);
4209 return obj_datasec (abfd);
4211 return obj_bsssec (abfd);
4214 return &bfd_abs_section;
4220 /* Relocate an a.out section using standard a.out relocs. */
4223 aout_link_input_section_std (finfo, input_bfd, input_section, relocs,
4224 rel_size, contents, symbol_map)
4225 struct aout_final_link_info *finfo;
4227 asection *input_section;
4228 struct reloc_std_external *relocs;
4229 bfd_size_type rel_size;
4234 boolean relocateable;
4235 struct external_nlist *syms;
4237 struct aout_link_hash_entry **sym_hashes;
4238 bfd_size_type reloc_count;
4239 register struct reloc_std_external *rel;
4240 struct reloc_std_external *rel_end;
4242 output_bfd = finfo->output_bfd;
4244 BFD_ASSERT (obj_reloc_entry_size (input_bfd) == RELOC_STD_SIZE);
4245 BFD_ASSERT (input_bfd->xvec->header_byteorder_big_p
4246 == output_bfd->xvec->header_byteorder_big_p);
4248 relocateable = finfo->info->relocateable;
4249 syms = obj_aout_external_syms (input_bfd);
4250 strings = obj_aout_external_strings (input_bfd);
4251 sym_hashes = obj_aout_sym_hashes (input_bfd);
4253 reloc_count = rel_size / RELOC_STD_SIZE;
4255 rel_end = rel + reloc_count;
4256 for (; rel < rel_end; rel++)
4268 bfd_reloc_status_type r;
4270 r_addr = GET_SWORD (input_bfd, rel->r_address);
4272 if (input_bfd->xvec->header_byteorder_big_p)
4274 r_index = ((rel->r_index[0] << 16)
4275 | (rel->r_index[1] << 8)
4277 r_extern = (0 != (rel->r_type[0] & RELOC_STD_BITS_EXTERN_BIG));
4278 r_pcrel = (0 != (rel->r_type[0] & RELOC_STD_BITS_PCREL_BIG));
4279 r_baserel = (0 != (rel->r_type[0] & RELOC_STD_BITS_BASEREL_BIG));
4280 r_jmptable= (0 != (rel->r_type[0] & RELOC_STD_BITS_JMPTABLE_BIG));
4281 r_relative= (0 != (rel->r_type[0] & RELOC_STD_BITS_RELATIVE_BIG));
4282 r_length = ((rel->r_type[0] & RELOC_STD_BITS_LENGTH_BIG)
4283 >> RELOC_STD_BITS_LENGTH_SH_BIG);
4287 r_index = ((rel->r_index[2] << 16)
4288 | (rel->r_index[1] << 8)
4290 r_extern = (0 != (rel->r_type[0] & RELOC_STD_BITS_EXTERN_LITTLE));
4291 r_pcrel = (0 != (rel->r_type[0] & RELOC_STD_BITS_PCREL_LITTLE));
4292 r_baserel = (0 != (rel->r_type[0] & RELOC_STD_BITS_BASEREL_LITTLE));
4293 r_jmptable= (0 != (rel->r_type[0] & RELOC_STD_BITS_JMPTABLE_LITTLE));
4294 r_relative= (0 != (rel->r_type[0] & RELOC_STD_BITS_RELATIVE_LITTLE));
4295 r_length = ((rel->r_type[0] & RELOC_STD_BITS_LENGTH_LITTLE)
4296 >> RELOC_STD_BITS_LENGTH_SH_LITTLE);
4299 howto_idx = r_length + 4 * r_pcrel + 8 * r_baserel;
4300 BFD_ASSERT (howto_idx < TABLE_SIZE (howto_table_std));
4301 BFD_ASSERT (r_jmptable == 0);
4302 BFD_ASSERT (r_relative == 0);
4306 /* We are generating a relocateable output file, and must
4307 modify the reloc accordingly. */
4310 struct aout_link_hash_entry *h;
4312 /* If we know the symbol this relocation is against,
4313 convert it into a relocation against a section. This
4314 is what the native linker does. */
4315 h = sym_hashes[r_index];
4316 if (h != (struct aout_link_hash_entry *) NULL
4317 && h->root.type == bfd_link_hash_defined)
4319 asection *output_section;
4321 /* Change the r_extern value. */
4322 if (output_bfd->xvec->header_byteorder_big_p)
4323 rel->r_type[0] &=~ RELOC_STD_BITS_EXTERN_BIG;
4325 rel->r_type[0] &=~ RELOC_STD_BITS_EXTERN_LITTLE;
4327 /* Compute a new r_index. */
4328 output_section = h->root.u.def.section->output_section;
4329 if (output_section == obj_textsec (output_bfd))
4331 else if (output_section == obj_datasec (output_bfd))
4333 else if (output_section == obj_bsssec (output_bfd))
4338 /* Add the symbol value and the section VMA to the
4339 addend stored in the contents. */
4340 relocation = (h->root.u.def.value
4341 + output_section->vma
4342 + h->root.u.def.section->output_offset);
4346 /* We must change r_index according to the symbol
4348 r_index = symbol_map[r_index];
4354 name = strings + GET_WORD (input_bfd,
4355 syms[r_index].e_strx);
4356 if (! ((*finfo->info->callbacks->unattached_reloc)
4357 (finfo->info, name, input_bfd, input_section,
4366 /* Write out the new r_index value. */
4367 if (output_bfd->xvec->header_byteorder_big_p)
4369 rel->r_index[0] = r_index >> 16;
4370 rel->r_index[1] = r_index >> 8;
4371 rel->r_index[2] = r_index;
4375 rel->r_index[2] = r_index >> 16;
4376 rel->r_index[1] = r_index >> 8;
4377 rel->r_index[0] = r_index;
4384 /* This is a relocation against a section. We must
4385 adjust by the amount that the section moved. */
4386 section = aout_reloc_index_to_section (input_bfd, r_index);
4387 relocation = (section->output_section->vma
4388 + section->output_offset
4392 /* Change the address of the relocation. */
4393 PUT_WORD (output_bfd,
4394 r_addr + input_section->output_offset,
4397 /* Adjust a PC relative relocation by removing the reference
4398 to the original address in the section and including the
4399 reference to the new address. */
4401 relocation -= (input_section->output_section->vma
4402 + input_section->output_offset
4403 - input_section->vma);
4405 if (relocation == 0)
4408 r = _bfd_relocate_contents (howto_table_std + howto_idx,
4409 input_bfd, relocation,
4414 /* We are generating an executable, and must do a full
4418 struct aout_link_hash_entry *h;
4420 h = sym_hashes[r_index];
4421 if (h != (struct aout_link_hash_entry *) NULL
4422 && h->root.type == bfd_link_hash_defined)
4424 relocation = (h->root.u.def.value
4425 + h->root.u.def.section->output_section->vma
4426 + h->root.u.def.section->output_offset);
4432 name = strings + GET_WORD (input_bfd, syms[r_index].e_strx);
4433 if (! ((*finfo->info->callbacks->undefined_symbol)
4434 (finfo->info, name, input_bfd, input_section,
4444 section = aout_reloc_index_to_section (input_bfd, r_index);
4445 relocation = (section->output_section->vma
4446 + section->output_offset
4449 relocation += input_section->vma;
4452 r = _bfd_final_link_relocate (howto_table_std + howto_idx,
4453 input_bfd, input_section,
4454 contents, r_addr, relocation,
4458 if (r != bfd_reloc_ok)
4463 case bfd_reloc_outofrange:
4465 case bfd_reloc_overflow:
4470 name = strings + GET_WORD (input_bfd,
4471 syms[r_index].e_strx);
4476 s = aout_reloc_index_to_section (input_bfd, r_index);
4477 name = bfd_section_name (input_bfd, s);
4479 if (! ((*finfo->info->callbacks->reloc_overflow)
4480 (finfo->info, name, howto_table_std[howto_idx].name,
4481 (bfd_vma) 0, input_bfd, input_section, r_addr)))
4492 /* Relocate an a.out section using extended a.out relocs. */
4495 aout_link_input_section_ext (finfo, input_bfd, input_section, relocs,
4496 rel_size, contents, symbol_map)
4497 struct aout_final_link_info *finfo;
4499 asection *input_section;
4500 struct reloc_ext_external *relocs;
4501 bfd_size_type rel_size;
4506 boolean relocateable;
4507 struct external_nlist *syms;
4509 struct aout_link_hash_entry **sym_hashes;
4510 bfd_size_type reloc_count;
4511 register struct reloc_ext_external *rel;
4512 struct reloc_ext_external *rel_end;
4514 output_bfd = finfo->output_bfd;
4516 BFD_ASSERT (obj_reloc_entry_size (input_bfd) == RELOC_EXT_SIZE);
4517 BFD_ASSERT (input_bfd->xvec->header_byteorder_big_p
4518 == output_bfd->xvec->header_byteorder_big_p);
4520 relocateable = finfo->info->relocateable;
4521 syms = obj_aout_external_syms (input_bfd);
4522 strings = obj_aout_external_strings (input_bfd);
4523 sym_hashes = obj_aout_sym_hashes (input_bfd);
4525 reloc_count = rel_size / RELOC_EXT_SIZE;
4527 rel_end = rel + reloc_count;
4528 for (; rel < rel_end; rel++)
4537 r_addr = GET_SWORD (input_bfd, rel->r_address);
4539 if (input_bfd->xvec->header_byteorder_big_p)
4541 r_index = ((rel->r_index[0] << 16)
4542 | (rel->r_index[1] << 8)
4544 r_extern = (0 != (rel->r_type[0] & RELOC_EXT_BITS_EXTERN_BIG));
4545 r_type = ((rel->r_type[0] & RELOC_EXT_BITS_TYPE_BIG)
4546 >> RELOC_EXT_BITS_TYPE_SH_BIG);
4550 r_index = ((rel->r_index[2] << 16)
4551 | (rel->r_index[1] << 8)
4553 r_extern = (0 != (rel->r_type[0] & RELOC_EXT_BITS_EXTERN_LITTLE));
4554 r_type = ((rel->r_type[0] & RELOC_EXT_BITS_TYPE_LITTLE)
4555 >> RELOC_EXT_BITS_TYPE_SH_LITTLE);
4558 r_addend = GET_SWORD (input_bfd, rel->r_addend);
4560 BFD_ASSERT (r_type >= 0
4561 && r_type < TABLE_SIZE (howto_table_ext));
4565 /* We are generating a relocateable output file, and must
4566 modify the reloc accordingly. */
4569 struct aout_link_hash_entry *h;
4571 /* If we know the symbol this relocation is against,
4572 convert it into a relocation against a section. This
4573 is what the native linker does. */
4574 h = sym_hashes[r_index];
4575 if (h != (struct aout_link_hash_entry *) NULL
4576 && h->root.type == bfd_link_hash_defined)
4578 asection *output_section;
4580 /* Change the r_extern value. */
4581 if (output_bfd->xvec->header_byteorder_big_p)
4582 rel->r_type[0] &=~ RELOC_EXT_BITS_EXTERN_BIG;
4584 rel->r_type[0] &=~ RELOC_EXT_BITS_EXTERN_LITTLE;
4586 /* Compute a new r_index. */
4587 output_section = h->root.u.def.section->output_section;
4588 if (output_section == obj_textsec (output_bfd))
4590 else if (output_section == obj_datasec (output_bfd))
4592 else if (output_section == obj_bsssec (output_bfd))
4597 /* Add the symbol value and the section VMA to the
4599 relocation = (h->root.u.def.value
4600 + output_section->vma
4601 + h->root.u.def.section->output_offset);
4603 /* Now RELOCATION is the VMA of the final
4604 destination. If this is a PC relative reloc,
4605 then ADDEND is the negative of the source VMA.
4606 We want to set ADDEND to the difference between
4607 the destination VMA and the source VMA, which
4608 means we must adjust RELOCATION by the change in
4609 the source VMA. This is done below. */
4613 /* We must change r_index according to the symbol
4615 r_index = symbol_map[r_index];
4622 + GET_WORD (input_bfd, syms[r_index].e_strx));
4623 if (! ((*finfo->info->callbacks->unattached_reloc)
4624 (finfo->info, name, input_bfd, input_section,
4632 /* If this is a PC relative reloc, then the addend
4633 is the negative of the source VMA. We must
4634 adjust it by the change in the source VMA. This
4638 /* Write out the new r_index value. */
4639 if (output_bfd->xvec->header_byteorder_big_p)
4641 rel->r_index[0] = r_index >> 16;
4642 rel->r_index[1] = r_index >> 8;
4643 rel->r_index[2] = r_index;
4647 rel->r_index[2] = r_index >> 16;
4648 rel->r_index[1] = r_index >> 8;
4649 rel->r_index[0] = r_index;
4656 /* This is a relocation against a section. We must
4657 adjust by the amount that the section moved. */
4658 section = aout_reloc_index_to_section (input_bfd, r_index);
4659 relocation = (section->output_section->vma
4660 + section->output_offset
4663 /* If this is a PC relative reloc, then the addend is
4664 the difference in VMA between the destination and the
4665 source. We have just adjusted for the change in VMA
4666 of the destination, so we must also adjust by the
4667 change in VMA of the source. This is done below. */
4670 /* As described above, we must always adjust a PC relative
4671 reloc by the change in VMA of the source. */
4672 if (howto_table_ext[r_type].pc_relative)
4673 relocation -= (input_section->output_section->vma
4674 + input_section->output_offset
4675 - input_section->vma);
4677 /* Change the addend if necessary. */
4678 if (relocation != 0)
4679 PUT_WORD (output_bfd, r_addend + relocation, rel->r_addend);
4681 /* Change the address of the relocation. */
4682 PUT_WORD (output_bfd,
4683 r_addr + input_section->output_offset,
4688 bfd_reloc_status_type r;
4690 /* We are generating an executable, and must do a full
4694 struct aout_link_hash_entry *h;
4696 h = sym_hashes[r_index];
4697 if (h != (struct aout_link_hash_entry *) NULL
4698 && h->root.type == bfd_link_hash_defined)
4700 relocation = (h->root.u.def.value
4701 + h->root.u.def.section->output_section->vma
4702 + h->root.u.def.section->output_offset);
4708 name = strings + GET_WORD (input_bfd, syms[r_index].e_strx);
4709 if (! ((*finfo->info->callbacks->undefined_symbol)
4710 (finfo->info, name, input_bfd, input_section,
4720 section = aout_reloc_index_to_section (input_bfd, r_index);
4722 /* If this is a PC relative reloc, then R_ADDEND is the
4723 difference between the two vmas, or
4724 old_dest_sec + old_dest_off - (old_src_sec + old_src_off)
4726 old_dest_sec == section->vma
4728 old_src_sec == input_section->vma
4730 old_src_off == r_addr
4732 _bfd_final_link_relocate expects RELOCATION +
4733 R_ADDEND to be the VMA of the destination minus
4734 r_addr (the minus r_addr is because this relocation
4735 is not pcrel_offset, which is a bit confusing and
4736 should, perhaps, be changed), or
4739 new_dest_sec == output_section->vma + output_offset
4740 We arrange for this to happen by setting RELOCATION to
4741 new_dest_sec + old_src_sec - old_dest_sec
4743 If this is not a PC relative reloc, then R_ADDEND is
4744 simply the VMA of the destination, so we set
4745 RELOCATION to the change in the destination VMA, or
4746 new_dest_sec - old_dest_sec
4748 relocation = (section->output_section->vma
4749 + section->output_offset
4751 if (howto_table_ext[r_type].pc_relative)
4752 relocation += input_section->vma;
4755 r = _bfd_final_link_relocate (howto_table_ext + r_type,
4756 input_bfd, input_section,
4757 contents, r_addr, relocation,
4759 if (r != bfd_reloc_ok)
4764 case bfd_reloc_outofrange:
4766 case bfd_reloc_overflow:
4771 name = strings + GET_WORD (input_bfd,
4772 syms[r_index].e_strx);
4777 s = aout_reloc_index_to_section (input_bfd, r_index);
4778 name = bfd_section_name (input_bfd, s);
4780 if (! ((*finfo->info->callbacks->reloc_overflow)
4781 (finfo->info, name, howto_table_ext[r_type].name,
4782 r_addend, input_bfd, input_section, r_addr)))
4794 /* Handle a link order which is supposed to generate a reloc. */
4797 aout_link_reloc_link_order (finfo, o, p)
4798 struct aout_final_link_info *finfo;
4800 struct bfd_link_order *p;
4802 struct bfd_link_order_reloc *pr;
4805 const reloc_howto_type *howto;
4806 file_ptr *reloff_ptr;
4807 struct reloc_std_external srel;
4808 struct reloc_ext_external erel;
4813 if (p->type == bfd_section_reloc_link_order)
4816 if (pr->u.section == &bfd_abs_section)
4817 r_index = N_ABS | N_EXT;
4820 BFD_ASSERT (pr->u.section->owner == finfo->output_bfd);
4821 r_index = pr->u.section->target_index;
4826 struct aout_link_hash_entry *h;
4828 BFD_ASSERT (p->type == bfd_symbol_reloc_link_order);
4830 h = aout_link_hash_lookup (aout_hash_table (finfo->info),
4831 pr->u.name, false, false, true);
4832 if (h != (struct aout_link_hash_entry *) NULL
4837 if (! ((*finfo->info->callbacks->unattached_reloc)
4838 (finfo->info, pr->u.name, (bfd *) NULL,
4839 (asection *) NULL, (bfd_vma) 0)))
4845 howto = bfd_reloc_type_lookup (finfo->output_bfd, pr->reloc);
4846 if (howto == (const reloc_howto_type *) NULL)
4848 bfd_set_error (bfd_error_bad_value);
4852 if (o == obj_textsec (finfo->output_bfd))
4853 reloff_ptr = &finfo->treloff;
4854 else if (o == obj_datasec (finfo->output_bfd))
4855 reloff_ptr = &finfo->dreloff;
4859 if (obj_reloc_entry_size (finfo->output_bfd) == RELOC_STD_SIZE)
4867 r_pcrel = howto->pc_relative;
4868 r_baserel = (howto->type & 8) != 0;
4871 r_length = howto->size;
4873 PUT_WORD (finfo->output_bfd, p->offset, srel.r_address);
4874 if (finfo->output_bfd->xvec->header_byteorder_big_p)
4876 srel.r_index[0] = r_index >> 16;
4877 srel.r_index[1] = r_index >> 8;
4878 srel.r_index[2] = r_index;
4880 ((r_extern ? RELOC_STD_BITS_EXTERN_BIG : 0)
4881 | (r_pcrel ? RELOC_STD_BITS_PCREL_BIG : 0)
4882 | (r_baserel ? RELOC_STD_BITS_BASEREL_BIG : 0)
4883 | (r_jmptable ? RELOC_STD_BITS_JMPTABLE_BIG : 0)
4884 | (r_relative ? RELOC_STD_BITS_RELATIVE_BIG : 0)
4885 | (r_length << RELOC_STD_BITS_LENGTH_SH_BIG));
4889 srel.r_index[2] = r_index >> 16;
4890 srel.r_index[1] = r_index >> 8;
4891 srel.r_index[0] = r_index;
4893 ((r_extern ? RELOC_STD_BITS_EXTERN_LITTLE : 0)
4894 | (r_pcrel ? RELOC_STD_BITS_PCREL_LITTLE : 0)
4895 | (r_baserel ? RELOC_STD_BITS_BASEREL_LITTLE : 0)
4896 | (r_jmptable ? RELOC_STD_BITS_JMPTABLE_LITTLE : 0)
4897 | (r_relative ? RELOC_STD_BITS_RELATIVE_LITTLE : 0)
4898 | (r_length << RELOC_STD_BITS_LENGTH_SH_LITTLE));
4901 rel_ptr = (PTR) &srel;
4903 /* We have to write the addend into the object file, since
4904 standard a.out relocs are in place. It would be more
4905 reliable if we had the current contents of the file here,
4906 rather than assuming zeroes, but we can't read the file since
4907 it was opened using bfd_openw. */
4908 if (pr->addend != 0)
4911 bfd_reloc_status_type r;
4915 size = bfd_get_reloc_size (howto);
4916 buf = (bfd_byte*) bfd_zmalloc (size);
4917 if (buf == (bfd_byte *) NULL)
4919 bfd_set_error (bfd_error_no_memory);
4922 r = _bfd_relocate_contents (howto, finfo->output_bfd,
4929 case bfd_reloc_outofrange:
4931 case bfd_reloc_overflow:
4932 if (! ((*finfo->info->callbacks->reloc_overflow)
4934 (p->type == bfd_section_reloc_link_order
4935 ? bfd_section_name (finfo->output_bfd,
4938 howto->name, pr->addend, (bfd *) NULL,
4939 (asection *) NULL, (bfd_vma) 0)))
4946 ok = bfd_set_section_contents (finfo->output_bfd, o,
4948 (file_ptr) p->offset,
4957 PUT_WORD (finfo->output_bfd, p->offset, erel.r_address);
4959 if (finfo->output_bfd->xvec->header_byteorder_big_p)
4961 erel.r_index[0] = r_index >> 16;
4962 erel.r_index[1] = r_index >> 8;
4963 erel.r_index[2] = r_index;
4965 ((r_extern ? RELOC_EXT_BITS_EXTERN_BIG : 0)
4966 | (howto->type << RELOC_EXT_BITS_TYPE_SH_BIG));
4970 erel.r_index[2] = r_index >> 16;
4971 erel.r_index[1] = r_index >> 8;
4972 erel.r_index[0] = r_index;
4974 (r_extern ? RELOC_EXT_BITS_EXTERN_LITTLE : 0)
4975 | (howto->type << RELOC_EXT_BITS_TYPE_SH_LITTLE);
4978 PUT_WORD (finfo->output_bfd, pr->addend, erel.r_addend);
4980 rel_ptr = (PTR) &erel;
4983 if (bfd_seek (finfo->output_bfd, *reloff_ptr, SEEK_SET) != 0
4984 || (bfd_write (rel_ptr, (bfd_size_type) 1,
4985 obj_reloc_entry_size (finfo->output_bfd),
4987 != obj_reloc_entry_size (finfo->output_bfd)))
4990 *reloff_ptr += obj_reloc_entry_size (finfo->output_bfd);
4992 /* Assert that the relocs have not run into the symbols, and that n
4993 the text relocs have not run into the data relocs. */
4994 BFD_ASSERT (*reloff_ptr <= obj_sym_filepos (finfo->output_bfd)
4995 && (reloff_ptr != &finfo->treloff
4997 <= obj_datasec (finfo->output_bfd)->rel_filepos)));