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 bfd_seek (abfd, section->filepos + offset, SEEK_SET);
1044 return (bfd_write ((PTR)location, 1, count, abfd) == count) ?
1052 /* Classify stabs symbols */
1054 #define sym_in_text_section(sym) \
1055 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_TEXT)
1057 #define sym_in_data_section(sym) \
1058 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_DATA)
1060 #define sym_in_bss_section(sym) \
1061 (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_BSS)
1063 /* Symbol is undefined if type is N_UNDF|N_EXT and if it has
1064 zero in the "value" field. Nonzeroes there are fortrancommon
1066 #define sym_is_undefined(sym) \
1067 ((sym)->type == (N_UNDF | N_EXT) && (sym)->symbol.value == 0)
1069 /* Symbol is a global definition if N_EXT is on and if it has
1070 a nonzero type field. */
1071 #define sym_is_global_defn(sym) \
1072 (((sym)->type & N_EXT) && (sym)->type & N_TYPE)
1074 /* Symbol is debugger info if any bits outside N_TYPE or N_EXT
1076 #define sym_is_debugger_info(sym) \
1077 (((sym)->type & ~(N_EXT | N_TYPE)) || (sym)->type == N_FN)
1079 #define sym_is_fortrancommon(sym) \
1080 (((sym)->type == (N_EXT)) && (sym)->symbol.value != 0)
1082 /* Symbol is absolute if it has N_ABS set */
1083 #define sym_is_absolute(sym) \
1084 (((sym)->type & N_TYPE)== N_ABS)
1087 #define sym_is_indirect(sym) \
1088 (((sym)->type & N_ABS)== N_ABS)
1090 /* Read the external symbols from an a.out file. */
1093 aout_get_external_symbols (abfd)
1096 if (obj_aout_external_syms (abfd) == (struct external_nlist *) NULL)
1098 bfd_size_type count;
1099 struct external_nlist *syms;
1101 count = exec_hdr (abfd)->a_syms / EXTERNAL_NLIST_SIZE;
1103 /* We allocate using malloc to make the values easy to free
1104 later on. If we put them on the obstack it might not be
1105 possible to free them. */
1106 syms = ((struct external_nlist *)
1107 malloc ((size_t) count * EXTERNAL_NLIST_SIZE));
1108 if (syms == (struct external_nlist *) NULL && count != 0)
1110 bfd_set_error (bfd_error_no_memory);
1114 if (bfd_seek (abfd, obj_sym_filepos (abfd), SEEK_SET) != 0
1115 || (bfd_read (syms, 1, exec_hdr (abfd)->a_syms, abfd)
1116 != exec_hdr (abfd)->a_syms))
1122 obj_aout_external_syms (abfd) = syms;
1123 obj_aout_external_sym_count (abfd) = count;
1126 if (obj_aout_external_strings (abfd) == NULL)
1128 unsigned char string_chars[BYTES_IN_WORD];
1129 bfd_size_type stringsize;
1132 /* Get the size of the strings. */
1133 if (bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET) != 0
1134 || (bfd_read ((PTR) string_chars, BYTES_IN_WORD, 1, abfd)
1137 stringsize = GET_WORD (abfd, string_chars);
1139 strings = (char *) malloc ((size_t) stringsize + 1);
1140 if (strings == NULL)
1142 bfd_set_error (bfd_error_no_memory);
1146 /* Skip space for the string count in the buffer for convenience
1147 when using indexes. */
1148 if (bfd_read (strings + BYTES_IN_WORD, 1, stringsize - BYTES_IN_WORD,
1150 != stringsize - BYTES_IN_WORD)
1156 /* Sanity preservation. */
1157 strings[stringsize] = '\0';
1159 obj_aout_external_strings (abfd) = strings;
1160 obj_aout_external_string_size (abfd) = stringsize;
1166 /* Only in their own functions for ease of debugging; when sym flags have
1167 stabilised these should be inlined into their (single) caller */
1170 translate_from_native_sym_flags (sym_pointer, cache_ptr, abfd)
1171 struct external_nlist *sym_pointer;
1172 aout_symbol_type * cache_ptr;
1175 cache_ptr->symbol.section = 0;
1176 switch (cache_ptr->type & N_TYPE)
1178 case N_SETA: case N_SETA | N_EXT:
1179 case N_SETT: case N_SETT | N_EXT:
1180 case N_SETD: case N_SETD | N_EXT:
1181 case N_SETB: case N_SETB | N_EXT:
1183 char *copy = bfd_alloc (abfd, strlen (cache_ptr->symbol.name) + 1);
1185 asection *into_section;
1186 arelent_chain *reloc = (arelent_chain *) bfd_alloc (abfd, sizeof (arelent_chain));
1188 if (!copy || !reloc)
1190 bfd_set_error (bfd_error_no_memory);
1194 strcpy (copy, cache_ptr->symbol.name);
1196 /* Make sure that this bfd has a section with the right contructor
1198 section = bfd_get_section_by_name (abfd, copy);
1200 section = bfd_make_section (abfd, copy);
1202 /* Build a relocation entry for the constructor */
1203 switch ((cache_ptr->type & N_TYPE))
1205 case N_SETA: case N_SETA | N_EXT:
1206 into_section = &bfd_abs_section;
1207 cache_ptr->type = N_ABS;
1209 case N_SETT: case N_SETT | N_EXT:
1210 into_section = (asection *) obj_textsec (abfd);
1211 cache_ptr->type = N_TEXT;
1213 case N_SETD: case N_SETD | N_EXT:
1214 into_section = (asection *) obj_datasec (abfd);
1215 cache_ptr->type = N_DATA;
1217 case N_SETB: case N_SETB | N_EXT:
1218 into_section = (asection *) obj_bsssec (abfd);
1219 cache_ptr->type = N_BSS;
1222 bfd_set_error (bfd_error_bad_value);
1226 /* Build a relocation pointing into the constuctor section
1227 pointing at the symbol in the set vector specified */
1229 reloc->relent.addend = cache_ptr->symbol.value;
1230 cache_ptr->symbol.section = into_section->symbol->section;
1231 reloc->relent.sym_ptr_ptr = into_section->symbol_ptr_ptr;
1234 /* We modify the symbol to belong to a section depending upon the
1235 name of the symbol - probably __CTOR__ or __DTOR__ but we don't
1236 really care, and add to the size of the section to contain a
1237 pointer to the symbol. Build a reloc entry to relocate to this
1238 symbol attached to this section. */
1240 section->flags = SEC_CONSTRUCTOR | SEC_RELOC;
1243 section->reloc_count++;
1244 section->alignment_power = 2;
1246 reloc->next = section->constructor_chain;
1247 section->constructor_chain = reloc;
1248 reloc->relent.address = section->_raw_size;
1249 section->_raw_size += sizeof (int *);
1252 = (obj_reloc_entry_size(abfd) == RELOC_EXT_SIZE
1253 ? howto_table_ext : howto_table_std)
1254 + CTOR_TABLE_RELOC_IDX;
1255 cache_ptr->symbol.flags |= BSF_CONSTRUCTOR;
1259 if (cache_ptr->type == N_WARNING)
1261 /* This symbol is the text of a warning message, the next symbol
1262 is the symbol to associate the warning with */
1263 cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_WARNING;
1265 /* @@ Stuffing pointers into integers is a no-no.
1266 We can usually get away with it if the integer is
1267 large enough though. */
1268 if (sizeof (cache_ptr + 1) > sizeof (bfd_vma))
1270 cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1));
1272 /* We don't use a warning symbol's section, but we need
1273 it to be nonzero for the sanity check below, so
1274 pick one arbitrarily. */
1275 cache_ptr->symbol.section = &bfd_abs_section;
1277 /* We furgle with the next symbol in place.
1278 We don't want it to be undefined, we'll trample the type */
1279 (sym_pointer + 1)->e_type[0] = 0xff;
1282 if ((cache_ptr->type | N_EXT) == (N_INDR | N_EXT))
1284 /* Two symbols in a row for an INDR message. The first symbol
1285 contains the name we will match, the second symbol contains
1286 the name the first name is translated into. It is supplied to
1287 us undefined. This is good, since we want to pull in any files
1289 cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_INDIRECT;
1291 /* @@ Stuffing pointers into integers is a no-no.
1292 We can usually get away with it if the integer is
1293 large enough though. */
1294 if (sizeof (cache_ptr + 1) > sizeof (bfd_vma))
1297 cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1));
1298 cache_ptr->symbol.section = &bfd_ind_section;
1301 else if (sym_is_debugger_info (cache_ptr))
1303 cache_ptr->symbol.flags = BSF_DEBUGGING;
1304 /* Work out the section correct for this symbol */
1305 switch (cache_ptr->type & N_TYPE)
1309 cache_ptr->symbol.section = obj_textsec (abfd);
1310 cache_ptr->symbol.value -= obj_textsec (abfd)->vma;
1313 cache_ptr->symbol.value -= obj_datasec (abfd)->vma;
1314 cache_ptr->symbol.section = obj_datasec (abfd);
1317 cache_ptr->symbol.section = obj_bsssec (abfd);
1318 cache_ptr->symbol.value -= obj_bsssec (abfd)->vma;
1322 cache_ptr->symbol.section = &bfd_abs_section;
1329 if (sym_is_fortrancommon (cache_ptr))
1331 cache_ptr->symbol.flags = 0;
1332 cache_ptr->symbol.section = &bfd_com_section;
1340 /* In a.out, the value of a symbol is always relative to the
1341 * start of the file, if this is a data symbol we'll subtract
1342 * the size of the text section to get the section relative
1343 * value. If this is a bss symbol (which would be strange)
1344 * we'll subtract the size of the previous two sections
1345 * to find the section relative address.
1348 if (sym_in_text_section (cache_ptr))
1350 cache_ptr->symbol.value -= obj_textsec (abfd)->vma;
1351 cache_ptr->symbol.section = obj_textsec (abfd);
1353 else if (sym_in_data_section (cache_ptr))
1355 cache_ptr->symbol.value -= obj_datasec (abfd)->vma;
1356 cache_ptr->symbol.section = obj_datasec (abfd);
1358 else if (sym_in_bss_section (cache_ptr))
1360 cache_ptr->symbol.section = obj_bsssec (abfd);
1361 cache_ptr->symbol.value -= obj_bsssec (abfd)->vma;
1363 else if (sym_is_undefined (cache_ptr))
1365 cache_ptr->symbol.flags = 0;
1366 cache_ptr->symbol.section = &bfd_und_section;
1368 else if (sym_is_absolute (cache_ptr))
1370 cache_ptr->symbol.section = &bfd_abs_section;
1373 if (sym_is_global_defn (cache_ptr))
1375 cache_ptr->symbol.flags = BSF_GLOBAL | BSF_EXPORT;
1377 else if (! sym_is_undefined (cache_ptr))
1379 cache_ptr->symbol.flags = BSF_LOCAL;
1383 if (cache_ptr->symbol.section == 0)
1390 translate_to_native_sym_flags (sym_pointer, cache_ptr, abfd)
1391 struct external_nlist *sym_pointer;
1395 bfd_vma value = cache_ptr->value;
1397 /* mask out any existing type bits in case copying from one section
1399 sym_pointer->e_type[0] &= ~N_TYPE;
1401 /* We attempt to order these tests by decreasing frequency of success,
1402 according to tcov when linking the linker. */
1403 if (bfd_get_output_section(cache_ptr) == &bfd_abs_section) {
1404 sym_pointer->e_type[0] |= N_ABS;
1406 else if (bfd_get_output_section(cache_ptr) == obj_textsec (abfd)) {
1407 sym_pointer->e_type[0] |= N_TEXT;
1409 else if (bfd_get_output_section(cache_ptr) == obj_datasec (abfd)) {
1410 sym_pointer->e_type[0] |= N_DATA;
1412 else if (bfd_get_output_section(cache_ptr) == obj_bsssec (abfd)) {
1413 sym_pointer->e_type[0] |= N_BSS;
1415 else if (bfd_get_output_section(cache_ptr) == &bfd_und_section) {
1416 sym_pointer->e_type[0] = (N_UNDF | N_EXT);
1418 else if (bfd_get_output_section(cache_ptr) == &bfd_ind_section) {
1419 sym_pointer->e_type[0] = N_INDR;
1421 else if (bfd_get_output_section(cache_ptr) == NULL) {
1422 /* Protect the bfd_is_com_section call.
1423 This case occurs, e.g., for the *DEBUG* section of a COFF file. */
1424 bfd_set_error (bfd_error_nonrepresentable_section);
1427 else if (bfd_is_com_section (bfd_get_output_section (cache_ptr))) {
1428 sym_pointer->e_type[0] = (N_UNDF | N_EXT);
1431 bfd_set_error (bfd_error_nonrepresentable_section);
1435 /* Turn the symbol from section relative to absolute again */
1437 value += cache_ptr->section->output_section->vma + cache_ptr->section->output_offset ;
1440 if (cache_ptr->flags & (BSF_WARNING)) {
1441 sym_pointer->e_type[0] = N_WARNING;
1442 (sym_pointer+1)->e_type[0] = 1;
1445 if (cache_ptr->flags & BSF_DEBUGGING) {
1446 sym_pointer->e_type[0] = ((aout_symbol_type *)cache_ptr)->type;
1448 else if (cache_ptr->flags & (BSF_GLOBAL | BSF_EXPORT)) {
1449 sym_pointer->e_type[0] |= N_EXT;
1451 if (cache_ptr->flags & BSF_CONSTRUCTOR) {
1452 int type = ((aout_symbol_type *)cache_ptr)->type;
1455 case N_ABS: type = N_SETA; break;
1456 case N_TEXT: type = N_SETT; break;
1457 case N_DATA: type = N_SETD; break;
1458 case N_BSS: type = N_SETB; break;
1460 sym_pointer->e_type[0] = type;
1463 PUT_WORD(abfd, value, sym_pointer->e_value);
1468 /* Native-level interface to symbols. */
1472 NAME(aout,make_empty_symbol) (abfd)
1475 aout_symbol_type *new =
1476 (aout_symbol_type *)bfd_zalloc (abfd, sizeof (aout_symbol_type));
1479 bfd_set_error (bfd_error_no_memory);
1482 new->symbol.the_bfd = abfd;
1484 return &new->symbol;
1487 /* Translate a set of internal symbols into external symbols. */
1490 translate_symbol_table (abfd, in, ext, count, str, strsize, dynamic)
1492 aout_symbol_type *in;
1493 struct external_nlist *ext;
1494 bfd_size_type count;
1496 bfd_size_type strsize;
1499 struct external_nlist *ext_end;
1501 ext_end = ext + count;
1502 for (; ext < ext_end; ext++, in++)
1506 x = GET_WORD (abfd, ext->e_strx);
1507 in->symbol.the_bfd = abfd;
1509 /* For the normal symbols, the zero index points at the number
1510 of bytes in the string table but is to be interpreted as the
1511 null string. For the dynamic symbols, the number of bytes in
1512 the string table is stored in the __DYNAMIC structure and the
1513 zero index points at an actual string. */
1514 if (x == 0 && ! dynamic)
1515 in->symbol.name = "";
1516 else if (x < strsize)
1517 in->symbol.name = str + x;
1521 in->symbol.value = GET_SWORD (abfd, ext->e_value);
1522 in->desc = bfd_h_get_16 (abfd, ext->e_desc);
1523 in->other = bfd_h_get_8 (abfd, ext->e_other);
1524 in->type = bfd_h_get_8 (abfd, ext->e_type);
1525 in->symbol.udata = 0;
1527 if (!translate_from_native_sym_flags (ext, in, abfd))
1531 in->symbol.flags |= BSF_DYNAMIC;
1537 /* We read the symbols into a buffer, which is discarded when this
1538 function exits. We read the strings into a buffer large enough to
1539 hold them all plus all the cached symbol entries. */
1542 NAME(aout,slurp_symbol_table) (abfd)
1545 struct external_nlist *old_external_syms;
1546 aout_symbol_type *cached;
1548 bfd_size_type dynsym_count = 0;
1549 struct external_nlist *dynsyms = NULL;
1550 char *dynstrs = NULL;
1551 bfd_size_type dynstr_size;
1553 /* If there's no work to be done, don't do any */
1554 if (obj_aout_symbols (abfd) != (aout_symbol_type *) NULL)
1557 old_external_syms = obj_aout_external_syms (abfd);
1559 if (! aout_get_external_symbols (abfd))
1562 if (obj_aout_external_sym_count (abfd) == 0)
1564 bfd_set_error (bfd_error_no_symbols);
1568 /* If this is a dynamic object, see if we can get the dynamic symbol
1570 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
1571 && aout_backend_info (abfd)->read_dynamic_symbols)
1573 dynsym_count = ((*aout_backend_info (abfd)->read_dynamic_symbols)
1574 (abfd, &dynsyms, &dynstrs, &dynstr_size));
1575 if (dynsym_count == (bfd_size_type) -1)
1579 cached_size = ((obj_aout_external_sym_count (abfd) + dynsym_count)
1580 * sizeof (aout_symbol_type));
1581 cached = (aout_symbol_type *) malloc (cached_size);
1582 memset (cached, 0, cached_size);
1586 bfd_set_error (bfd_error_no_memory);
1590 /* Convert from external symbol information to internal. */
1591 if (! translate_symbol_table (abfd, cached,
1592 obj_aout_external_syms (abfd),
1593 obj_aout_external_sym_count (abfd),
1594 obj_aout_external_strings (abfd),
1595 obj_aout_external_string_size (abfd),
1597 || ! translate_symbol_table (abfd,
1599 + obj_aout_external_sym_count (abfd)),
1600 dynsyms, dynsym_count, dynstrs,
1607 bfd_get_symcount (abfd) = (obj_aout_external_sym_count (abfd)
1610 obj_aout_symbols (abfd) = cached;
1612 /* It is very likely that anybody who calls this function will not
1613 want the external symbol information, so if it was allocated
1614 because of our call to aout_get_external_symbols, we free it up
1615 right away to save space. */
1616 if (old_external_syms == (struct external_nlist *) NULL
1617 && obj_aout_external_syms (abfd) != (struct external_nlist *) NULL)
1619 free (obj_aout_external_syms (abfd));
1620 obj_aout_external_syms (abfd) = NULL;
1626 /* Possible improvements:
1627 + look for strings matching trailing substrings of other strings
1628 + better data structures? balanced trees?
1629 + smaller per-string or per-symbol data? re-use some of the symbol's
1631 + also look at reducing memory use elsewhere -- maybe if we didn't have to
1632 construct the entire symbol table at once, we could get by with smaller
1633 amounts of VM? (What effect does that have on the string table
1635 + rip this out of here, put it into its own file in bfd or libiberty, so
1636 coff and elf can use it too. I'll work on this soon, but have more
1637 pressing tasks right now.
1639 A hash table might(?) be more efficient for handling exactly the cases that
1640 are handled now, but for trailing substring matches, I think we want to
1641 examine the `nearest' values (reverse-)lexically, not merely impose a strict
1642 order, nor look only for exact-match or not-match. I don't think a hash
1643 table would be very useful for that, and I don't feel like fleshing out two
1644 completely different implementations. [raeburn:930419.0331EDT] */
1646 struct stringtab_entry {
1647 /* Hash value for this string. Only useful so long as we aren't doing
1648 substring matches. */
1651 /* Next node to look at, depending on whether the hash value of the string
1652 being searched for is less than or greater than the hash value of the
1653 current node. For now, `equal to' is lumped in with `greater than', for
1654 space efficiency. It's not a common enough case to warrant another field
1655 to be used for all nodes. */
1656 struct stringtab_entry *less;
1657 struct stringtab_entry *greater;
1659 /* The string itself. */
1662 /* The index allocated for this string. */
1663 bfd_size_type index;
1665 #ifdef GATHER_STATISTICS
1666 /* How many references have there been to this string? (Not currently used;
1667 could be dumped out for anaylsis, if anyone's interested.) */
1668 unsigned long count;
1671 /* Next node in linked list, in suggested output order. */
1672 struct stringtab_entry *next_to_output;
1675 struct stringtab_data {
1676 /* Tree of string table entries. */
1677 struct stringtab_entry *strings;
1679 /* Fudge factor used to center top node of tree. */
1682 /* Next index value to issue. */
1683 bfd_size_type index;
1685 /* Index used for empty strings. Cached here because checking for them
1686 is really easy, and we can avoid searching the tree. */
1687 bfd_size_type empty_string_index;
1689 /* These fields indicate the two ends of a singly-linked list that indicates
1690 the order strings should be written out in. Use this order, and no
1691 seeking will need to be done, so output efficiency should be maximized. */
1692 struct stringtab_entry **end;
1693 struct stringtab_entry *output_order;
1695 #ifdef GATHER_STATISTICS
1696 /* Number of strings which duplicate strings already in the table. */
1697 unsigned long duplicates;
1699 /* Number of bytes saved by not having to write all the duplicate strings. */
1700 unsigned long bytes_saved;
1702 /* Number of zero-length strings. Currently, these all turn into
1703 references to the null byte at the end of the first string. In some
1704 cases (possibly not all? explore this...), it should be possible to
1705 simply write out a zero index value. */
1706 unsigned long empty_strings;
1708 /* Number of times the hash values matched but the strings were different.
1709 Note that this includes the number of times the other string(s) occurs, so
1710 there may only be two strings hashing to the same value, even if this
1711 number is very large. */
1712 unsigned long bad_hash_matches;
1714 /* Null strings aren't counted in this one.
1715 This will probably only be nonzero if we've got an input file
1716 which was produced by `ld -r' (i.e., it's already been processed
1717 through this code). Under some operating systems, native tools
1718 may make all empty strings have the same index; but the pointer
1719 check won't catch those, because to get to that stage we'd already
1720 have to compute the checksum, which requires reading the string,
1721 so we short-circuit that case with empty_string_index above. */
1722 unsigned long pointer_matches;
1724 /* Number of comparisons done. I figure with the algorithms in use below,
1725 the average number of comparisons done (per symbol) should be roughly
1726 log-base-2 of the number of unique strings. */
1727 unsigned long n_compares;
1731 /* Some utility functions for the string table code. */
1733 /* For speed, only hash on the first this many bytes of strings.
1734 This number was chosen by profiling ld linking itself, with -g. */
1735 #define HASHMAXLEN 25
1737 #define HASH_CHAR(c) (sum ^= sum >> 20, sum ^= sum << 7, sum += (c))
1739 static INLINE unsigned int
1741 unsigned char *string;
1742 register unsigned int len;
1744 register unsigned int sum = 0;
1746 if (len > HASHMAXLEN)
1754 HASH_CHAR (*string++);
1760 stringtab_init (tab)
1761 struct stringtab_data *tab;
1764 tab->output_order = 0;
1766 tab->end = &tab->output_order;
1768 /* Initial string table length includes size of length field. */
1769 tab->index = BYTES_IN_WORD;
1770 tab->empty_string_index = -1;
1771 #ifdef GATHER_STATISTICS
1772 tab->duplicates = 0;
1773 tab->empty_strings = 0;
1774 tab->bad_hash_matches = 0;
1775 tab->pointer_matches = 0;
1776 tab->bytes_saved = 0;
1777 tab->n_compares = 0;
1782 compare (entry, str, hash)
1783 struct stringtab_entry *entry;
1787 return hash - entry->hash;
1790 #ifdef GATHER_STATISTICS
1791 /* Don't want to have to link in math library with all bfd applications... */
1792 static INLINE double
1800 return ((d > 1.41) ? 0.5 : 0) + n;
1804 /* Main string table routines. */
1805 /* Returns index in string table. Whether or not this actually adds an
1806 entry into the string table should be irrelevant -- it just has to
1807 return a valid index. */
1808 static bfd_size_type
1809 add_to_stringtab (abfd, str, tab)
1812 struct stringtab_data *tab;
1814 struct stringtab_entry **ep;
1815 register struct stringtab_entry *entry;
1816 unsigned int hashval, len;
1820 bfd_size_type index;
1821 CONST bfd_size_type minus_one = -1;
1823 #ifdef GATHER_STATISTICS
1824 tab->empty_strings++;
1826 index = tab->empty_string_index;
1827 if (index != minus_one)
1830 #ifdef GATHER_STATISTICS
1837 /* Need to find it. */
1838 entry = tab->strings;
1841 index = entry->index + strlen (entry->string);
1842 tab->empty_string_index = index;
1850 /* The hash_zero value is chosen such that the first symbol gets a value of
1851 zero. With a balanced tree, this wouldn't be very useful, but without it,
1852 we might get a more even split at the top level, instead of skewing it
1853 badly should hash("/usr/lib/crt0.o") (or whatever) be far from zero. */
1854 hashval = hash (str, len) ^ tab->hash_zero;
1858 tab->hash_zero = hashval;
1868 #ifdef GATHER_STATISTICS
1871 cmp = compare (entry, str, hashval);
1872 /* The not-equal cases are more frequent, so check them first. */
1874 ep = &entry->greater;
1879 if (entry->string == str)
1881 #ifdef GATHER_STATISTICS
1882 tab->pointer_matches++;
1886 /* Compare the first bytes to save a function call if they
1888 if (entry->string[0] == str[0] && !strcmp (entry->string, str))
1891 #ifdef GATHER_STATISTICS
1893 tab->bytes_saved += len + 1;
1896 /* If we're in the linker, and the new string is from a new
1897 input file which might have already had these reductions
1898 run over it, we want to keep the new string pointer. I
1899 don't think we're likely to see any (or nearly as many,
1900 at least) cases where a later string is in the same location
1901 as an earlier one rather than this one. */
1902 entry->string = str;
1903 return entry->index;
1905 #ifdef GATHER_STATISTICS
1906 tab->bad_hash_matches++;
1908 ep = &entry->greater;
1912 /* If we get here, nothing that's in the table already matched.
1913 EP points to the `next' field at the end of the chain; stick a
1914 new entry on here. */
1916 entry = (struct stringtab_entry *)
1917 bfd_alloc_by_size_t (abfd, sizeof (struct stringtab_entry));
1920 bfd_set_error (bfd_error_no_memory);
1921 abort(); /* FIXME */
1924 entry->less = entry->greater = 0;
1925 entry->hash = hashval;
1926 entry->index = tab->index;
1927 entry->string = str;
1928 entry->next_to_output = 0;
1929 #ifdef GATHER_STATISTICS
1933 assert (*tab->end == 0);
1934 *(tab->end) = entry;
1935 tab->end = &entry->next_to_output;
1936 assert (*tab->end == 0);
1939 tab->index += len + 1;
1941 tab->empty_string_index = entry->index;
1945 return entry->index;
1949 emit_strtab (abfd, tab)
1951 struct stringtab_data *tab;
1953 struct stringtab_entry *entry;
1954 #ifdef GATHER_STATISTICS
1958 /* Be sure to put string length into correct byte ordering before writing
1960 char buffer[BYTES_IN_WORD];
1962 PUT_WORD (abfd, tab->index, (unsigned char *) buffer);
1963 bfd_write ((PTR) buffer, 1, BYTES_IN_WORD, abfd);
1965 for (entry = tab->output_order; entry; entry = entry->next_to_output)
1967 bfd_write ((PTR) entry->string, 1, strlen (entry->string) + 1, abfd);
1968 #ifdef GATHER_STATISTICS
1973 #ifdef GATHER_STATISTICS
1974 /* Short form only, for now.
1975 To do: Specify output file. Conditionalize on environment? Detailed
1976 analysis if desired. */
1978 int n_syms = bfd_get_symcount (abfd);
1980 fprintf (stderr, "String table data for output file:\n");
1981 fprintf (stderr, " %8d symbols output\n", n_syms);
1982 fprintf (stderr, " %8d duplicate strings\n", tab->duplicates);
1983 fprintf (stderr, " %8d empty strings\n", tab->empty_strings);
1984 fprintf (stderr, " %8d unique strings output\n", count);
1985 fprintf (stderr, " %8d pointer matches\n", tab->pointer_matches);
1986 fprintf (stderr, " %8d bytes saved\n", tab->bytes_saved);
1987 fprintf (stderr, " %8d bad hash matches\n", tab->bad_hash_matches);
1988 fprintf (stderr, " %8d hash-val comparisons\n", tab->n_compares);
1991 double n_compares = tab->n_compares;
1992 double avg_compares = n_compares / n_syms;
1993 /* The second value here should usually be near one. */
1995 "\t average %f comparisons per symbol (%f * log2 nstrings)\n",
1996 avg_compares, avg_compares / log2 (count));
2003 generic = bfd_get_outsymbols(abfd);
2004 for (count = 0; count < bfd_get_symcount(abfd); count++)
2006 asymbol *g = *(generic++);
2010 size_t length = strlen(g->name)+1;
2011 bfd_write((PTR)g->name, 1, length, abfd);
2013 g->KEEPIT = (KEEPITTYPE) count;
2018 NAME(aout,write_syms) (abfd)
2021 unsigned int count ;
2022 asymbol **generic = bfd_get_outsymbols (abfd);
2023 struct stringtab_data strtab;
2025 stringtab_init (&strtab);
2027 for (count = 0; count < bfd_get_symcount (abfd); count++)
2029 asymbol *g = generic[count];
2030 struct external_nlist nsp;
2033 PUT_WORD (abfd, add_to_stringtab (abfd, g->name, &strtab),
2034 (unsigned char *) nsp.e_strx);
2036 PUT_WORD (abfd, 0, (unsigned char *)nsp.e_strx);
2038 if (bfd_asymbol_flavour(g) == abfd->xvec->flavour)
2040 bfd_h_put_16(abfd, aout_symbol(g)->desc, nsp.e_desc);
2041 bfd_h_put_8(abfd, aout_symbol(g)->other, nsp.e_other);
2042 bfd_h_put_8(abfd, aout_symbol(g)->type, nsp.e_type);
2046 bfd_h_put_16(abfd,0, nsp.e_desc);
2047 bfd_h_put_8(abfd, 0, nsp.e_other);
2048 bfd_h_put_8(abfd, 0, nsp.e_type);
2051 if (! translate_to_native_sym_flags (&nsp, g, abfd))
2054 if (bfd_write((PTR)&nsp,1,EXTERNAL_NLIST_SIZE, abfd)
2055 != EXTERNAL_NLIST_SIZE)
2058 /* NB: `KEEPIT' currently overlays `flags', so set this only
2059 here, at the end. */
2063 emit_strtab (abfd, &strtab);
2070 NAME(aout,get_symtab) (abfd, location)
2074 unsigned int counter = 0;
2075 aout_symbol_type *symbase;
2077 if (!NAME(aout,slurp_symbol_table)(abfd))
2080 for (symbase = obj_aout_symbols(abfd); counter++ < bfd_get_symcount (abfd);)
2081 *(location++) = (asymbol *)( symbase++);
2083 return bfd_get_symcount (abfd);
2087 /* Standard reloc stuff */
2088 /* Output standard relocation information to a file in target byte order. */
2091 NAME(aout,swap_std_reloc_out) (abfd, g, natptr)
2094 struct reloc_std_external *natptr;
2097 asymbol *sym = *(g->sym_ptr_ptr);
2099 unsigned int r_length;
2101 int r_baserel, r_jmptable, r_relative;
2102 asection *output_section = sym->section->output_section;
2104 PUT_WORD(abfd, g->address, natptr->r_address);
2106 r_length = g->howto->size ; /* Size as a power of two */
2107 r_pcrel = (int) g->howto->pc_relative; /* Relative to PC? */
2108 /* XXX This relies on relocs coming from a.out files. */
2109 r_baserel = (g->howto->type & 8) != 0;
2110 /* r_jmptable, r_relative??? FIXME-soon */
2115 /* For a standard reloc, the addend is in the object file. */
2116 r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma;
2119 /* name was clobbered by aout_write_syms to be symbol index */
2121 /* If this relocation is relative to a symbol then set the
2122 r_index to the symbols index, and the r_extern bit.
2124 Absolute symbols can come in in two ways, either as an offset
2125 from the abs section, or as a symbol which has an abs value.
2130 if (bfd_is_com_section (output_section)
2131 || output_section == &bfd_abs_section
2132 || output_section == &bfd_und_section)
2134 if (bfd_abs_section.symbol == sym)
2136 /* Whoops, looked like an abs symbol, but is really an offset
2137 from the abs section */
2143 /* Fill in symbol */
2145 r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT);
2151 /* Just an ordinary section */
2153 r_index = output_section->target_index;
2156 /* now the fun stuff */
2157 if (abfd->xvec->header_byteorder_big_p != false) {
2158 natptr->r_index[0] = r_index >> 16;
2159 natptr->r_index[1] = r_index >> 8;
2160 natptr->r_index[2] = r_index;
2162 (r_extern? RELOC_STD_BITS_EXTERN_BIG: 0)
2163 | (r_pcrel? RELOC_STD_BITS_PCREL_BIG: 0)
2164 | (r_baserel? RELOC_STD_BITS_BASEREL_BIG: 0)
2165 | (r_jmptable? RELOC_STD_BITS_JMPTABLE_BIG: 0)
2166 | (r_relative? RELOC_STD_BITS_RELATIVE_BIG: 0)
2167 | (r_length << RELOC_STD_BITS_LENGTH_SH_BIG);
2169 natptr->r_index[2] = r_index >> 16;
2170 natptr->r_index[1] = r_index >> 8;
2171 natptr->r_index[0] = r_index;
2173 (r_extern? RELOC_STD_BITS_EXTERN_LITTLE: 0)
2174 | (r_pcrel? RELOC_STD_BITS_PCREL_LITTLE: 0)
2175 | (r_baserel? RELOC_STD_BITS_BASEREL_LITTLE: 0)
2176 | (r_jmptable? RELOC_STD_BITS_JMPTABLE_LITTLE: 0)
2177 | (r_relative? RELOC_STD_BITS_RELATIVE_LITTLE: 0)
2178 | (r_length << RELOC_STD_BITS_LENGTH_SH_LITTLE);
2183 /* Extended stuff */
2184 /* Output extended relocation information to a file in target byte order. */
2187 NAME(aout,swap_ext_reloc_out) (abfd, g, natptr)
2190 register struct reloc_ext_external *natptr;
2194 unsigned int r_type;
2195 unsigned int r_addend;
2196 asymbol *sym = *(g->sym_ptr_ptr);
2197 asection *output_section = sym->section->output_section;
2199 PUT_WORD (abfd, g->address, natptr->r_address);
2201 r_type = (unsigned int) g->howto->type;
2203 r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma;
2205 /* If this relocation is relative to a symbol then set the
2206 r_index to the symbols index, and the r_extern bit.
2208 Absolute symbols can come in in two ways, either as an offset
2209 from the abs section, or as a symbol which has an abs value.
2210 check for that here. */
2212 if (bfd_is_com_section (output_section)
2213 || output_section == &bfd_abs_section
2214 || output_section == &bfd_und_section)
2216 if (bfd_abs_section.symbol == sym)
2218 /* Whoops, looked like an abs symbol, but is really an offset
2219 from the abs section */
2226 r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT);
2231 /* Just an ordinary section */
2233 r_index = output_section->target_index;
2236 /* now the fun stuff */
2237 if (abfd->xvec->header_byteorder_big_p != false) {
2238 natptr->r_index[0] = r_index >> 16;
2239 natptr->r_index[1] = r_index >> 8;
2240 natptr->r_index[2] = r_index;
2242 ((r_extern? RELOC_EXT_BITS_EXTERN_BIG: 0)
2243 | (r_type << RELOC_EXT_BITS_TYPE_SH_BIG));
2245 natptr->r_index[2] = r_index >> 16;
2246 natptr->r_index[1] = r_index >> 8;
2247 natptr->r_index[0] = r_index;
2249 (r_extern? RELOC_EXT_BITS_EXTERN_LITTLE: 0)
2250 | (r_type << RELOC_EXT_BITS_TYPE_SH_LITTLE);
2253 PUT_WORD (abfd, r_addend, natptr->r_addend);
2256 /* BFD deals internally with all things based from the section they're
2257 in. so, something in 10 bytes into a text section with a base of
2258 50 would have a symbol (.text+10) and know .text vma was 50.
2260 Aout keeps all it's symbols based from zero, so the symbol would
2261 contain 60. This macro subs the base of each section from the value
2262 to give the true offset from the section */
2265 #define MOVE_ADDRESS(ad) \
2267 /* undefined symbol */ \
2268 cache_ptr->sym_ptr_ptr = symbols + r_index; \
2269 cache_ptr->addend = ad; \
2271 /* defined, section relative. replace symbol with pointer to \
2272 symbol which points to section */ \
2273 switch (r_index) { \
2275 case N_TEXT | N_EXT: \
2276 cache_ptr->sym_ptr_ptr = obj_textsec(abfd)->symbol_ptr_ptr; \
2277 cache_ptr->addend = ad - su->textsec->vma; \
2280 case N_DATA | N_EXT: \
2281 cache_ptr->sym_ptr_ptr = obj_datasec(abfd)->symbol_ptr_ptr; \
2282 cache_ptr->addend = ad - su->datasec->vma; \
2285 case N_BSS | N_EXT: \
2286 cache_ptr->sym_ptr_ptr = obj_bsssec(abfd)->symbol_ptr_ptr; \
2287 cache_ptr->addend = ad - su->bsssec->vma; \
2291 case N_ABS | N_EXT: \
2292 cache_ptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr; \
2293 cache_ptr->addend = ad; \
2299 NAME(aout,swap_ext_reloc_in) (abfd, bytes, cache_ptr, symbols)
2301 struct reloc_ext_external *bytes;
2307 unsigned int r_type;
2308 struct aoutdata *su = &(abfd->tdata.aout_data->a);
2310 cache_ptr->address = (GET_SWORD (abfd, bytes->r_address));
2312 /* now the fun stuff */
2313 if (abfd->xvec->header_byteorder_big_p != false) {
2314 r_index = (bytes->r_index[0] << 16)
2315 | (bytes->r_index[1] << 8)
2316 | bytes->r_index[2];
2317 r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_BIG));
2318 r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_BIG)
2319 >> RELOC_EXT_BITS_TYPE_SH_BIG;
2321 r_index = (bytes->r_index[2] << 16)
2322 | (bytes->r_index[1] << 8)
2323 | bytes->r_index[0];
2324 r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_LITTLE));
2325 r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_LITTLE)
2326 >> RELOC_EXT_BITS_TYPE_SH_LITTLE;
2329 cache_ptr->howto = howto_table_ext + r_type;
2330 MOVE_ADDRESS(GET_SWORD(abfd, bytes->r_addend));
2334 NAME(aout,swap_std_reloc_in) (abfd, bytes, cache_ptr, symbols)
2336 struct reloc_std_external *bytes;
2342 unsigned int r_length;
2344 int r_baserel, r_jmptable, r_relative;
2345 struct aoutdata *su = &(abfd->tdata.aout_data->a);
2348 cache_ptr->address = bfd_h_get_32 (abfd, bytes->r_address);
2350 /* now the fun stuff */
2351 if (abfd->xvec->header_byteorder_big_p != false) {
2352 r_index = (bytes->r_index[0] << 16)
2353 | (bytes->r_index[1] << 8)
2354 | bytes->r_index[2];
2355 r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_BIG));
2356 r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_BIG));
2357 r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_BIG));
2358 r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_BIG));
2359 r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_BIG));
2360 r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_BIG)
2361 >> RELOC_STD_BITS_LENGTH_SH_BIG;
2363 r_index = (bytes->r_index[2] << 16)
2364 | (bytes->r_index[1] << 8)
2365 | bytes->r_index[0];
2366 r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_LITTLE));
2367 r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_LITTLE));
2368 r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_LITTLE));
2369 r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_LITTLE));
2370 r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_LITTLE));
2371 r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_LITTLE)
2372 >> RELOC_STD_BITS_LENGTH_SH_LITTLE;
2375 howto_idx = r_length + 4 * r_pcrel + 8 * r_baserel;
2376 BFD_ASSERT (howto_idx < TABLE_SIZE (howto_table_std));
2377 cache_ptr->howto = howto_table_std + howto_idx;
2378 BFD_ASSERT (cache_ptr->howto->type != -1);
2379 BFD_ASSERT (r_jmptable == 0);
2380 BFD_ASSERT (r_relative == 0);
2381 /* FIXME-soon: Roll jmptable, relative bits into howto setting */
2386 /* Read and swap the relocs for a section. */
2389 NAME(aout,slurp_reloc_table) (abfd, asect, symbols)
2395 bfd_size_type reloc_size;
2397 bfd_size_type dynrel_count = 0;
2399 arelent *reloc_cache;
2401 unsigned int counter = 0;
2404 if (asect->relocation)
2407 if (asect->flags & SEC_CONSTRUCTOR)
2410 if (asect == obj_datasec (abfd))
2411 reloc_size = exec_hdr(abfd)->a_drsize;
2412 else if (asect == obj_textsec (abfd))
2413 reloc_size = exec_hdr(abfd)->a_trsize;
2416 bfd_set_error (bfd_error_invalid_operation);
2420 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
2421 && aout_backend_info (abfd)->read_dynamic_relocs)
2423 dynrel_count = ((*aout_backend_info (abfd)->read_dynamic_relocs)
2425 if (dynrel_count == (bfd_size_type) -1)
2429 if (bfd_seek (abfd, asect->rel_filepos, SEEK_SET) != 0)
2432 each_size = obj_reloc_entry_size (abfd);
2434 count = reloc_size / each_size;
2436 reloc_cache = (arelent *) malloc ((size_t) ((count + dynrel_count)
2437 * sizeof (arelent)));
2438 if (reloc_cache == NULL && count != 0)
2440 bfd_set_error (bfd_error_no_memory);
2443 memset (reloc_cache, 0, (count + dynrel_count) * sizeof (arelent));
2445 relocs = malloc (reloc_size);
2446 if (relocs == NULL && reloc_size != 0)
2449 bfd_set_error (bfd_error_no_memory);
2453 if (bfd_read (relocs, 1, reloc_size, abfd) != reloc_size)
2460 cache_ptr = reloc_cache;
2461 if (each_size == RELOC_EXT_SIZE)
2463 register struct reloc_ext_external *rptr =
2464 (struct reloc_ext_external *) relocs;
2466 for (; counter < count; counter++, rptr++, cache_ptr++)
2467 NAME(aout,swap_ext_reloc_in) (abfd, rptr, cache_ptr, symbols);
2471 register struct reloc_std_external *rptr =
2472 (struct reloc_std_external *) relocs;
2474 for (; counter < count; counter++, rptr++, cache_ptr++)
2475 NAME(aout,swap_std_reloc_in) (abfd, rptr, cache_ptr, symbols);
2480 if (dynrel_count > 0)
2484 /* The dynamic symbols are at the end of the symbol table. */
2485 for (dynsyms = symbols;
2486 *dynsyms != NULL && ((*dynsyms)->flags & BSF_DYNAMIC) == 0;
2490 /* Swap in the dynamic relocs. These relocs may be for either
2491 section, so we must discard ones we don't want. */
2493 if (each_size == RELOC_EXT_SIZE)
2495 register struct reloc_ext_external *rptr
2496 = (struct reloc_ext_external *) dynrels;
2498 for (; counter < dynrel_count; counter++, rptr++, cache_ptr++)
2500 NAME(aout,swap_ext_reloc_in) (abfd, rptr, cache_ptr, dynsyms);
2501 cache_ptr->address -= bfd_get_section_vma (abfd, asect);
2502 if (cache_ptr->address >= bfd_section_size (abfd, asect))
2508 register struct reloc_std_external *rptr
2509 = (struct reloc_std_external *) dynrels;
2511 for (; counter < dynrel_count; counter++, rptr++, cache_ptr++)
2513 NAME(aout,swap_std_reloc_in) (abfd, rptr, cache_ptr, dynsyms);
2514 cache_ptr->address -= bfd_get_section_vma (abfd, asect);
2515 if (cache_ptr->address >= bfd_section_size (abfd, asect))
2521 asect->relocation = reloc_cache;
2522 asect->reloc_count = cache_ptr - reloc_cache;
2527 /* Write out a relocation section into an object file. */
2530 NAME(aout,squirt_out_relocs) (abfd, section)
2535 unsigned char *native, *natptr;
2538 unsigned int count = section->reloc_count;
2541 if (count == 0) return true;
2543 each_size = obj_reloc_entry_size (abfd);
2544 natsize = each_size * count;
2545 native = (unsigned char *) bfd_zalloc (abfd, natsize);
2547 bfd_set_error (bfd_error_no_memory);
2551 generic = section->orelocation;
2553 if (each_size == RELOC_EXT_SIZE)
2555 for (natptr = native;
2557 --count, natptr += each_size, ++generic)
2558 NAME(aout,swap_ext_reloc_out) (abfd, *generic, (struct reloc_ext_external *)natptr);
2562 for (natptr = native;
2564 --count, natptr += each_size, ++generic)
2565 NAME(aout,swap_std_reloc_out)(abfd, *generic, (struct reloc_std_external *)natptr);
2568 if ( bfd_write ((PTR) native, 1, natsize, abfd) != natsize) {
2569 bfd_release(abfd, native);
2572 bfd_release (abfd, native);
2577 /* This is stupid. This function should be a boolean predicate */
2579 NAME(aout,canonicalize_reloc) (abfd, section, relptr, symbols)
2585 arelent *tblptr = section->relocation;
2588 if (!(tblptr || NAME(aout,slurp_reloc_table)(abfd, section, symbols)))
2591 if (section->flags & SEC_CONSTRUCTOR) {
2592 arelent_chain *chain = section->constructor_chain;
2593 for (count = 0; count < section->reloc_count; count ++) {
2594 *relptr ++ = &chain->relent;
2595 chain = chain->next;
2599 tblptr = section->relocation;
2600 if (!tblptr) return 0;
2602 for (count = 0; count++ < section->reloc_count;)
2604 *relptr++ = tblptr++;
2609 return section->reloc_count;
2613 NAME(aout,get_reloc_upper_bound) (abfd, asect)
2617 bfd_size_type dynrel_count = 0;
2619 if (bfd_get_format (abfd) != bfd_object) {
2620 bfd_set_error (bfd_error_invalid_operation);
2623 if (asect->flags & SEC_CONSTRUCTOR) {
2624 return (sizeof (arelent *) * (asect->reloc_count+1));
2627 if ((bfd_get_file_flags (abfd) & DYNAMIC) != 0
2628 && aout_backend_info (abfd)->read_dynamic_relocs)
2632 dynrel_count = ((*aout_backend_info (abfd)->read_dynamic_relocs)
2634 if (dynrel_count == (bfd_size_type) -1)
2638 if (asect == obj_datasec (abfd))
2639 return (sizeof (arelent *) *
2640 ((exec_hdr(abfd)->a_drsize / obj_reloc_entry_size (abfd))
2641 + dynrel_count + 1));
2643 if (asect == obj_textsec (abfd))
2644 return (sizeof (arelent *) *
2645 ((exec_hdr(abfd)->a_trsize / obj_reloc_entry_size (abfd))
2646 + dynrel_count + 1));
2648 bfd_set_error (bfd_error_invalid_operation);
2654 NAME(aout,get_symtab_upper_bound) (abfd)
2657 if (!NAME(aout,slurp_symbol_table)(abfd))
2660 return (bfd_get_symcount (abfd)+1) * (sizeof (aout_symbol_type *));
2665 NAME(aout,get_lineno) (ignore_abfd, ignore_symbol)
2667 asymbol *ignore_symbol;
2669 return (alent *)NULL;
2674 NAME(aout,get_symbol_info) (ignore_abfd, symbol, ret)
2679 bfd_symbol_info (symbol, ret);
2681 if (ret->type == '?')
2683 int type_code = aout_symbol(symbol)->type & 0xff;
2684 CONST char *stab_name = aout_stab_name(type_code);
2685 static char buf[10];
2687 if (stab_name == NULL)
2689 sprintf(buf, "(%d)", type_code);
2693 ret->stab_other = (unsigned)(aout_symbol(symbol)->other & 0xff);
2694 ret->stab_desc = (unsigned)(aout_symbol(symbol)->desc & 0xffff);
2695 ret->stab_name = stab_name;
2701 NAME(aout,print_symbol) (ignore_abfd, afile, symbol, how)
2705 bfd_print_symbol_type how;
2707 FILE *file = (FILE *)afile;
2710 case bfd_print_symbol_name:
2712 fprintf(file,"%s", symbol->name);
2714 case bfd_print_symbol_more:
2715 fprintf(file,"%4x %2x %2x",(unsigned)(aout_symbol(symbol)->desc & 0xffff),
2716 (unsigned)(aout_symbol(symbol)->other & 0xff),
2717 (unsigned)(aout_symbol(symbol)->type));
2719 case bfd_print_symbol_all:
2721 CONST char *section_name = symbol->section->name;
2724 bfd_print_symbol_vandf((PTR)file,symbol);
2726 fprintf(file," %-5s %04x %02x %02x",
2728 (unsigned)(aout_symbol(symbol)->desc & 0xffff),
2729 (unsigned)(aout_symbol(symbol)->other & 0xff),
2730 (unsigned)(aout_symbol(symbol)->type & 0xff));
2732 fprintf(file," %s", symbol->name);
2739 provided a BFD, a section and an offset into the section, calculate
2740 and return the name of the source file and the line nearest to the
2745 NAME(aout,find_nearest_line)
2746 (abfd, section, symbols, offset, filename_ptr, functionname_ptr, line_ptr)
2751 CONST char **filename_ptr;
2752 CONST char **functionname_ptr;
2753 unsigned int *line_ptr;
2755 /* Run down the file looking for the filename, function and linenumber */
2757 static char buffer[100];
2758 static char filename_buffer[200];
2759 CONST char *directory_name = NULL;
2760 CONST char *main_file_name = NULL;
2761 CONST char *current_file_name = NULL;
2762 CONST char *line_file_name = NULL; /* Value of current_file_name at line number. */
2763 bfd_vma high_line_vma = ~0;
2764 bfd_vma low_func_vma = 0;
2766 *filename_ptr = abfd->filename;
2767 *functionname_ptr = 0;
2769 if (symbols != (asymbol **)NULL) {
2770 for (p = symbols; *p; p++) {
2771 aout_symbol_type *q = (aout_symbol_type *)(*p);
2775 main_file_name = current_file_name = q->symbol.name;
2776 /* Look ahead to next symbol to check if that too is an N_SO. */
2780 q = (aout_symbol_type *)(*p);
2781 if (q->type != (int)N_SO)
2784 /* Found a second N_SO First is directory; second is filename. */
2785 directory_name = current_file_name;
2786 main_file_name = current_file_name = q->symbol.name;
2787 if (obj_textsec(abfd) != section)
2791 current_file_name = q->symbol.name;
2798 /* We'll keep this if it resolves nearer than the one we have already */
2799 if (q->symbol.value >= offset &&
2800 q->symbol.value < high_line_vma) {
2801 *line_ptr = q->desc;
2802 high_line_vma = q->symbol.value;
2803 line_file_name = current_file_name;
2808 /* We'll keep this if it is nearer than the one we have already */
2809 if (q->symbol.value >= low_func_vma &&
2810 q->symbol.value <= offset) {
2811 low_func_vma = q->symbol.value;
2812 func = (asymbol *)q;
2814 if (*line_ptr && func) {
2815 CONST char *function = func->name;
2818 /* The caller expects a symbol name. We actually have a
2819 function name, without the leading underscore. Put the
2820 underscore back in, so that the caller gets a symbol
2822 if (bfd_get_symbol_leading_char (abfd) == '\0')
2823 strncpy (buffer, function, sizeof (buffer) - 1);
2826 buffer[0] = bfd_get_symbol_leading_char (abfd);
2827 strncpy (buffer + 1, function, sizeof (buffer) - 2);
2829 buffer[sizeof(buffer)-1] = 0;
2830 /* Have to remove : stuff */
2831 p = strchr(buffer,':');
2832 if (p != NULL) { *p = '\0'; }
2833 *functionname_ptr = buffer;
2845 main_file_name = line_file_name;
2846 if (main_file_name) {
2847 if (main_file_name[0] == '/' || directory_name == NULL)
2848 *filename_ptr = main_file_name;
2850 sprintf(filename_buffer, "%.140s%.50s",
2851 directory_name, main_file_name);
2852 *filename_ptr = filename_buffer;
2861 NAME(aout,sizeof_headers) (abfd, execable)
2865 return adata(abfd).exec_bytes_size;
2868 /* Free all information we have cached for this BFD. We can always
2869 read it again later if we need it. */
2872 NAME(aout,bfd_free_cached_info) (abfd)
2877 #define FREE(x) if (x != NULL) { free (x); x = NULL; }
2878 FREE (obj_aout_symbols (abfd));
2879 FREE (obj_aout_external_syms (abfd));
2880 FREE (obj_aout_external_strings (abfd));
2881 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
2882 FREE (o->relocation);
2888 /* a.out link code. */
2890 /* a.out linker hash table entries. */
2892 struct aout_link_hash_entry
2894 struct bfd_link_hash_entry root;
2895 /* Symbol index in output file. */
2899 /* a.out linker hash table. */
2901 struct aout_link_hash_table
2903 struct bfd_link_hash_table root;
2906 static struct bfd_hash_entry *aout_link_hash_newfunc
2907 PARAMS ((struct bfd_hash_entry *entry,
2908 struct bfd_hash_table *table,
2909 const char *string));
2910 static boolean aout_link_add_object_symbols
2911 PARAMS ((bfd *, struct bfd_link_info *));
2912 static boolean aout_link_check_archive_element
2913 PARAMS ((bfd *, struct bfd_link_info *, boolean *));
2914 static boolean aout_link_free_symbols PARAMS ((bfd *));
2915 static boolean aout_link_check_ar_symbols
2916 PARAMS ((bfd *, struct bfd_link_info *, boolean *pneeded));
2917 static boolean aout_link_add_symbols
2918 PARAMS ((bfd *, struct bfd_link_info *));
2920 /* Routine to create an entry in an a.out link hash table. */
2922 static struct bfd_hash_entry *
2923 aout_link_hash_newfunc (entry, table, string)
2924 struct bfd_hash_entry *entry;
2925 struct bfd_hash_table *table;
2928 struct aout_link_hash_entry *ret = (struct aout_link_hash_entry *) entry;
2930 /* Allocate the structure if it has not already been allocated by a
2932 if (ret == (struct aout_link_hash_entry *) NULL)
2933 ret = ((struct aout_link_hash_entry *)
2934 bfd_hash_allocate (table, sizeof (struct aout_link_hash_entry)));
2935 if (ret == (struct aout_link_hash_entry *) NULL)
2937 bfd_set_error (bfd_error_no_memory);
2938 return (struct bfd_hash_entry *) ret;
2941 /* Call the allocation method of the superclass. */
2942 ret = ((struct aout_link_hash_entry *)
2943 _bfd_link_hash_newfunc ((struct bfd_hash_entry *) ret,
2946 /* Set local fields. */
2949 return (struct bfd_hash_entry *) ret;
2952 /* Create an a.out link hash table. */
2954 struct bfd_link_hash_table *
2955 NAME(aout,link_hash_table_create) (abfd)
2958 struct aout_link_hash_table *ret;
2960 ret = ((struct aout_link_hash_table *)
2961 malloc (sizeof (struct aout_link_hash_table)));
2962 if (ret == (struct aout_link_hash_table *) NULL)
2964 bfd_set_error (bfd_error_no_memory);
2965 return (struct bfd_link_hash_table *) NULL;
2967 if (! _bfd_link_hash_table_init (&ret->root, abfd,
2968 aout_link_hash_newfunc))
2971 return (struct bfd_link_hash_table *) NULL;
2976 /* Look up an entry in an a.out link hash table. */
2978 #define aout_link_hash_lookup(table, string, create, copy, follow) \
2979 ((struct aout_link_hash_entry *) \
2980 bfd_link_hash_lookup (&(table)->root, (string), (create), (copy), (follow)))
2982 /* Traverse an a.out link hash table. */
2984 #define aout_link_hash_traverse(table, func, info) \
2985 (bfd_link_hash_traverse \
2987 (boolean (*) PARAMS ((struct bfd_link_hash_entry *, PTR))) (func), \
2990 /* Get the a.out link hash table from the info structure. This is
2993 #define aout_hash_table(p) ((struct aout_link_hash_table *) ((p)->hash))
2995 /* Given an a.out BFD, add symbols to the global hash table as
2999 NAME(aout,link_add_symbols) (abfd, info)
3001 struct bfd_link_info *info;
3003 switch (bfd_get_format (abfd))
3006 return aout_link_add_object_symbols (abfd, info);
3008 return _bfd_generic_link_add_archive_symbols
3009 (abfd, info, aout_link_check_archive_element);
3011 bfd_set_error (bfd_error_wrong_format);
3016 /* Add symbols from an a.out object file. */
3019 aout_link_add_object_symbols (abfd, info)
3021 struct bfd_link_info *info;
3023 if (! aout_get_external_symbols (abfd))
3025 if (! aout_link_add_symbols (abfd, info))
3027 if (! info->keep_memory)
3029 if (! aout_link_free_symbols (abfd))
3035 /* Check a single archive element to see if we need to include it in
3036 the link. *PNEEDED is set according to whether this element is
3037 needed in the link or not. This is called from
3038 _bfd_generic_link_add_archive_symbols. */
3041 aout_link_check_archive_element (abfd, info, pneeded)
3043 struct bfd_link_info *info;
3046 if (! aout_get_external_symbols (abfd))
3049 if (! aout_link_check_ar_symbols (abfd, info, pneeded))
3054 if (! aout_link_add_symbols (abfd, info))
3058 /* We keep around the symbols even if we aren't going to use this
3059 object file, because we may want to reread it. This doesn't
3060 waste too much memory, because it isn't all that common to read
3061 an archive element but not need it. */
3062 if (! info->keep_memory)
3064 if (! aout_link_free_symbols (abfd))
3071 /* Free up the internal symbols read from an a.out file. */
3074 aout_link_free_symbols (abfd)
3077 if (obj_aout_external_syms (abfd) != (struct external_nlist *) NULL)
3079 free ((PTR) obj_aout_external_syms (abfd));
3080 obj_aout_external_syms (abfd) = (struct external_nlist *) NULL;
3082 if (obj_aout_external_strings (abfd) != (char *) NULL)
3084 free ((PTR) obj_aout_external_strings (abfd));
3085 obj_aout_external_strings (abfd) = (char *) NULL;
3090 /* Look through the internal symbols to see if this object file should
3091 be included in the link. We should include this object file if it
3092 defines any symbols which are currently undefined. If this object
3093 file defines a common symbol, then we may adjust the size of the
3094 known symbol but we do not include the object file in the link
3095 (unless there is some other reason to include it). */
3098 aout_link_check_ar_symbols (abfd, info, pneeded)
3100 struct bfd_link_info *info;
3103 register struct external_nlist *p;
3104 struct external_nlist *pend;
3109 /* Look through all the symbols. */
3110 p = obj_aout_external_syms (abfd);
3111 pend = p + obj_aout_external_sym_count (abfd);
3112 strings = obj_aout_external_strings (abfd);
3113 for (; p < pend; p++)
3115 int type = bfd_h_get_8 (abfd, p->e_type);
3117 struct bfd_link_hash_entry *h;
3119 /* Ignore symbols that are not externally visible. */
3120 if ((type & N_EXT) == 0)
3122 if (type == N_WARNING
3128 name = strings + GET_WORD (abfd, p->e_strx);
3129 h = bfd_link_hash_lookup (info->hash, name, false, false, true);
3131 /* We are only interested in symbols that are currently
3132 undefined or common. */
3133 if (h == (struct bfd_link_hash_entry *) NULL
3134 || (h->type != bfd_link_hash_undefined
3135 && h->type != bfd_link_hash_common))
3137 if (type == (N_INDR | N_EXT))
3142 if (type == (N_TEXT | N_EXT)
3143 || type == (N_DATA | N_EXT)
3144 || type == (N_BSS | N_EXT)
3145 || type == (N_ABS | N_EXT)
3146 || type == (N_INDR | N_EXT))
3148 /* This object file defines this symbol. We must link it
3149 in. This is true regardless of whether the current
3150 definition of the symbol is undefined or common. If the
3151 current definition is common, we have a case in which we
3152 have already seen an object file including
3154 and this object file from the archive includes
3156 In such a case we must include this object file. */
3157 if (! (*info->callbacks->add_archive_element) (info, abfd, name))
3163 if (type == (N_UNDF | N_EXT))
3167 value = GET_WORD (abfd, p->e_value);
3170 /* This symbol is common in the object from the archive
3172 if (h->type == bfd_link_hash_undefined)
3176 symbfd = h->u.undef.abfd;
3177 if (symbfd == (bfd *) NULL)
3179 /* This symbol was created as undefined from
3180 outside BFD. We assume that we should link
3181 in the object file. This is done for the -u
3182 option in the linker. */
3183 if (! (*info->callbacks->add_archive_element) (info,
3190 /* Turn the current link symbol into a common
3191 symbol. It is already on the undefs list. */
3192 h->type = bfd_link_hash_common;
3193 h->u.c.size = value;
3194 h->u.c.section = bfd_make_section_old_way (symbfd,
3199 /* Adjust the size of the common symbol if
3201 if (value > h->u.c.size)
3202 h->u.c.size = value;
3208 /* We do not need this object file. */
3212 /* Add all symbols from an object file to the hash table. */
3215 aout_link_add_symbols (abfd, info)
3217 struct bfd_link_info *info;
3219 bfd_size_type sym_count;
3222 struct aout_link_hash_entry **sym_hash;
3223 register struct external_nlist *p;
3224 struct external_nlist *pend;
3226 sym_count = obj_aout_external_sym_count (abfd);
3227 strings = obj_aout_external_strings (abfd);
3228 if (info->keep_memory)
3233 /* We keep a list of the linker hash table entries that correspond
3234 to particular symbols. We could just look them up in the hash
3235 table, but keeping the list is more efficient. Perhaps this
3236 should be conditional on info->keep_memory. */
3237 sym_hash = ((struct aout_link_hash_entry **)
3240 * sizeof (struct aout_link_hash_entry *))));
3243 bfd_set_error (bfd_error_no_memory);
3246 obj_aout_sym_hashes (abfd) = sym_hash;
3248 p = obj_aout_external_syms (abfd);
3249 pend = p + sym_count;
3250 for (; p < pend; p++, sym_hash++)
3261 type = bfd_h_get_8 (abfd, p->e_type);
3263 /* Ignore debugging symbols. */
3264 if ((type & N_STAB) != 0)
3267 /* Ignore symbols that are not external. */
3268 if ((type & N_EXT) == 0
3269 && type != N_WARNING
3275 /* If this is an N_INDR symbol we must skip the next entry,
3276 which is the symbol to indirect to (actually, an N_INDR
3277 symbol without N_EXT set is pretty useless). */
3286 /* Ignore N_FN symbols (these appear to have N_EXT set). */
3290 name = strings + GET_WORD (abfd, p->e_strx);
3291 value = GET_WORD (abfd, p->e_value);
3298 case N_UNDF | N_EXT:
3300 section = &bfd_com_section;
3302 section = &bfd_und_section;
3305 section = &bfd_abs_section;
3307 case N_TEXT | N_EXT:
3308 section = obj_textsec (abfd);
3309 value -= bfd_get_section_vma (abfd, section);
3311 case N_DATA | N_EXT:
3312 section = obj_datasec (abfd);
3313 value -= bfd_get_section_vma (abfd, section);
3316 section = obj_bsssec (abfd);
3317 value -= bfd_get_section_vma (abfd, section);
3319 case N_INDR | N_EXT:
3320 /* An indirect symbol. The next symbol is the symbol
3321 which this one really is. */
3322 BFD_ASSERT (p + 1 < pend);
3324 string = strings + GET_WORD (abfd, p->e_strx);
3325 section = &bfd_ind_section;
3326 flags |= BSF_INDIRECT;
3328 case N_COMM | N_EXT:
3329 section = &bfd_com_section;
3331 case N_SETA: case N_SETA | N_EXT:
3332 section = &bfd_abs_section;
3333 flags |= BSF_CONSTRUCTOR;
3335 case N_SETT: case N_SETT | N_EXT:
3336 section = obj_textsec (abfd);
3337 flags |= BSF_CONSTRUCTOR;
3338 value -= bfd_get_section_vma (abfd, section);
3340 case N_SETD: case N_SETD | N_EXT:
3341 section = obj_datasec (abfd);
3342 flags |= BSF_CONSTRUCTOR;
3343 value -= bfd_get_section_vma (abfd, section);
3345 case N_SETB: case N_SETB | N_EXT:
3346 section = obj_bsssec (abfd);
3347 flags |= BSF_CONSTRUCTOR;
3348 value -= bfd_get_section_vma (abfd, section);
3351 /* A warning symbol. The next symbol is the one to warn
3353 BFD_ASSERT (p + 1 < pend);
3356 name = strings + GET_WORD (abfd, p->e_strx);
3357 section = &bfd_und_section;
3358 flags |= BSF_WARNING;
3362 if (! (_bfd_generic_link_add_one_symbol
3363 (info, abfd, name, flags, section, value, string, copy, false,
3364 (struct bfd_link_hash_entry **) sym_hash)))
3367 if (type == (N_INDR | N_EXT) || type == N_WARNING)
3374 /* During the final link step we need to pass around a bunch of
3375 information, so we do it in an instance of this structure. */
3377 struct aout_final_link_info
3379 /* General link information. */
3380 struct bfd_link_info *info;
3383 /* Reloc file positions. */
3384 file_ptr treloff, dreloff;
3385 /* File position of symbols. */
3388 struct stringtab_data strtab;
3391 static boolean aout_link_input_bfd
3392 PARAMS ((struct aout_final_link_info *, bfd *input_bfd));
3393 static boolean aout_link_write_symbols
3394 PARAMS ((struct aout_final_link_info *, bfd *input_bfd, int *symbol_map));
3395 static boolean aout_link_write_other_symbol
3396 PARAMS ((struct aout_link_hash_entry *, PTR));
3397 static boolean aout_link_input_section
3398 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3399 asection *input_section, file_ptr *reloff_ptr,
3400 bfd_size_type rel_size, int *symbol_map));
3401 static boolean aout_link_input_section_std
3402 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3403 asection *input_section, struct reloc_std_external *,
3404 bfd_size_type rel_size, bfd_byte *contents, int *symbol_map));
3405 static boolean aout_link_input_section_ext
3406 PARAMS ((struct aout_final_link_info *, bfd *input_bfd,
3407 asection *input_section, struct reloc_ext_external *,
3408 bfd_size_type rel_size, bfd_byte *contents, int *symbol_map));
3409 static INLINE asection *aout_reloc_index_to_section
3410 PARAMS ((bfd *, int));
3411 static boolean aout_link_reloc_link_order
3412 PARAMS ((struct aout_final_link_info *, asection *,
3413 struct bfd_link_order *));
3415 /* Do the final link step. This is called on the output BFD. The
3416 INFO structure should point to a list of BFDs linked through the
3417 link_next field which can be used to find each BFD which takes part
3418 in the output. Also, each section in ABFD should point to a list
3419 of bfd_link_order structures which list all the input sections for
3420 the output section. */
3423 NAME(aout,final_link) (abfd, info, callback)
3425 struct bfd_link_info *info;
3426 void (*callback) PARAMS ((bfd *, file_ptr *, file_ptr *, file_ptr *));
3428 struct aout_final_link_info aout_info;
3430 bfd_size_type text_size;
3432 register struct bfd_link_order *p;
3434 boolean have_link_order_relocs;
3436 aout_info.info = info;
3437 aout_info.output_bfd = abfd;
3439 if (! info->relocateable)
3441 exec_hdr (abfd)->a_trsize = 0;
3442 exec_hdr (abfd)->a_drsize = 0;
3446 bfd_size_type trsize, drsize;
3448 /* Count up the relocation sizes. */
3451 for (sub = info->input_bfds; sub != (bfd *) NULL; sub = sub->link_next)
3453 if (bfd_get_flavour (abfd) == bfd_target_aout_flavour)
3455 trsize += exec_hdr (sub)->a_trsize;
3456 drsize += exec_hdr (sub)->a_drsize;
3460 /* FIXME: We need to identify the .text and .data sections
3461 and call get_reloc_upper_bound and canonicalize_reloc to
3462 work out the number of relocs needed, and then multiply
3463 by the reloc size. */
3467 trsize += (_bfd_count_link_order_relocs (obj_textsec (abfd)
3469 * obj_reloc_entry_size (abfd));
3470 exec_hdr (abfd)->a_trsize = trsize;
3471 drsize += (_bfd_count_link_order_relocs (obj_datasec (abfd)
3473 * obj_reloc_entry_size (abfd));
3474 exec_hdr (abfd)->a_drsize = drsize;
3477 exec_hdr (abfd)->a_entry = bfd_get_start_address (abfd);
3479 /* Adjust the section sizes and vmas according to the magic number.
3480 This sets a_text, a_data and a_bss in the exec_hdr and sets the
3481 filepos for each section. */
3482 if (! NAME(aout,adjust_sizes_and_vmas) (abfd, &text_size, &text_end))
3485 /* The relocation and symbol file positions differ among a.out
3486 targets. We are passed a callback routine from the backend
3487 specific code to handle this.
3488 FIXME: At this point we do not know how much space the symbol
3489 table will require. This will not work for any (nonstandard)
3490 a.out target that needs to know the symbol table size before it
3491 can compute the relocation file positions. This may or may not
3492 be the case for the hp300hpux target, for example. */
3493 (*callback) (abfd, &aout_info.treloff, &aout_info.dreloff,
3495 obj_textsec (abfd)->rel_filepos = aout_info.treloff;
3496 obj_datasec (abfd)->rel_filepos = aout_info.dreloff;
3497 obj_sym_filepos (abfd) = aout_info.symoff;
3499 /* We keep a count of the symbols as we output them. */
3500 obj_aout_external_sym_count (abfd) = 0;
3502 /* We accumulate the string table as we write out the symbols. */
3503 stringtab_init (&aout_info.strtab);
3505 /* The most time efficient way to do the link would be to read all
3506 the input object files into memory and then sort out the
3507 information into the output file. Unfortunately, that will
3508 probably use too much memory. Another method would be to step
3509 through everything that composes the text section and write it
3510 out, and then everything that composes the data section and write
3511 it out, and then write out the relocs, and then write out the
3512 symbols. Unfortunately, that requires reading stuff from each
3513 input file several times, and we will not be able to keep all the
3514 input files open simultaneously, and reopening them will be slow.
3516 What we do is basically process one input file at a time. We do
3517 everything we need to do with an input file once--copy over the
3518 section contents, handle the relocation information, and write
3519 out the symbols--and then we throw away the information we read
3520 from it. This approach requires a lot of lseeks of the output
3521 file, which is unfortunate but still faster than reopening a lot
3524 We use the output_has_begun field of the input BFDs to see
3525 whether we have already handled it. */
3526 for (sub = info->input_bfds; sub != (bfd *) NULL; sub = sub->link_next)
3527 sub->output_has_begun = false;
3529 have_link_order_relocs = false;
3530 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
3532 for (p = o->link_order_head;
3533 p != (struct bfd_link_order *) NULL;
3536 if (p->type == bfd_indirect_link_order
3537 && (bfd_get_flavour (p->u.indirect.section->owner)
3538 == bfd_target_aout_flavour))
3542 input_bfd = p->u.indirect.section->owner;
3543 if (! input_bfd->output_has_begun)
3545 if (! aout_link_input_bfd (&aout_info, input_bfd))
3547 input_bfd->output_has_begun = true;
3550 else if (p->type == bfd_section_reloc_link_order
3551 || p->type == bfd_symbol_reloc_link_order)
3553 /* These are handled below. */
3554 have_link_order_relocs = true;
3558 if (! _bfd_default_link_order (abfd, info, o, p))
3564 /* Write out any symbols that we have not already written out. */
3565 aout_link_hash_traverse (aout_hash_table (info),
3566 aout_link_write_other_symbol,
3569 /* Now handle any relocs we were asked to create by the linker.
3570 These did not come from any input file. We must do these after
3571 we have written out all the symbols, so that we know the symbol
3573 if (have_link_order_relocs)
3575 for (o = abfd->sections; o != (asection *) NULL; o = o->next)
3577 for (p = o->link_order_head;
3578 p != (struct bfd_link_order *) NULL;
3581 if (p->type == bfd_section_reloc_link_order
3582 || p->type == bfd_symbol_reloc_link_order)
3584 if (! aout_link_reloc_link_order (&aout_info, o, p))
3591 /* Update the header information. */
3592 abfd->symcount = obj_aout_external_sym_count (abfd);
3593 exec_hdr (abfd)->a_syms = abfd->symcount * EXTERNAL_NLIST_SIZE;
3594 obj_str_filepos (abfd) = obj_sym_filepos (abfd) + exec_hdr (abfd)->a_syms;
3595 obj_textsec (abfd)->reloc_count =
3596 exec_hdr (abfd)->a_trsize / obj_reloc_entry_size (abfd);
3597 obj_datasec (abfd)->reloc_count =
3598 exec_hdr (abfd)->a_drsize / obj_reloc_entry_size (abfd);
3600 /* Write out the string table. */
3601 if (bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET) != 0)
3603 emit_strtab (abfd, &aout_info.strtab);
3608 /* Link an a.out input BFD into the output file. */
3611 aout_link_input_bfd (finfo, input_bfd)
3612 struct aout_final_link_info *finfo;
3615 bfd_size_type sym_count;
3616 int *symbol_map = NULL;
3618 BFD_ASSERT (bfd_get_format (input_bfd) == bfd_object);
3620 /* Get the symbols. We probably have them already, unless
3621 finfo->info->keep_memory is false. */
3622 if (! aout_get_external_symbols (input_bfd))
3625 sym_count = obj_aout_external_sym_count (input_bfd);
3626 symbol_map = (int *) malloc ((size_t) sym_count * sizeof (int));
3627 if (symbol_map == NULL && sym_count != 0)
3629 bfd_set_error (bfd_error_no_memory);
3633 /* Write out the symbols and get a map of the new indices. */
3634 if (! aout_link_write_symbols (finfo, input_bfd, symbol_map))
3637 /* Relocate and write out the sections. */
3638 if (! aout_link_input_section (finfo, input_bfd,
3639 obj_textsec (input_bfd),
3641 exec_hdr (input_bfd)->a_trsize,
3643 || ! aout_link_input_section (finfo, input_bfd,
3644 obj_datasec (input_bfd),
3646 exec_hdr (input_bfd)->a_drsize,
3650 /* If we are not keeping memory, we don't need the symbols any
3651 longer. We still need them if we are keeping memory, because the
3652 strings in the hash table point into them. */
3653 if (! finfo->info->keep_memory)
3655 if (! aout_link_free_symbols (input_bfd))
3659 if (symbol_map != NULL)
3663 if (symbol_map != NULL)
3668 /* Adjust and write out the symbols for an a.out file. Set the new
3669 symbol indices into a symbol_map. */
3672 aout_link_write_symbols (finfo, input_bfd, symbol_map)
3673 struct aout_final_link_info *finfo;
3678 bfd_size_type sym_count;
3680 enum bfd_link_strip strip;
3681 enum bfd_link_discard discard;
3682 struct external_nlist *output_syms = NULL;
3683 struct external_nlist *outsym;
3684 register struct external_nlist *sym;
3685 struct external_nlist *sym_end;
3686 struct aout_link_hash_entry **sym_hash;
3688 boolean skip_indirect;
3690 output_bfd = finfo->output_bfd;
3691 sym_count = obj_aout_external_sym_count (input_bfd);
3692 strings = obj_aout_external_strings (input_bfd);
3693 strip = finfo->info->strip;
3694 discard = finfo->info->discard;
3695 output_syms = ((struct external_nlist *)
3696 malloc ((size_t) (sym_count + 1) * EXTERNAL_NLIST_SIZE));
3697 if (output_syms == NULL)
3699 bfd_set_error (bfd_error_no_memory);
3702 outsym = output_syms;
3704 /* First write out a symbol for this object file, unless we are
3705 discarding such symbols. */
3706 if (strip != strip_all
3707 && (strip != strip_some
3708 || bfd_hash_lookup (finfo->info->keep_hash, input_bfd->filename,
3709 false, false) != NULL)
3710 && discard != discard_all)
3712 bfd_h_put_8 (output_bfd, N_TEXT, outsym->e_type);
3713 bfd_h_put_8 (output_bfd, 0, outsym->e_other);
3714 bfd_h_put_16 (output_bfd, (bfd_vma) 0, outsym->e_desc);
3715 PUT_WORD (output_bfd,
3716 add_to_stringtab (output_bfd, input_bfd->filename,
3719 PUT_WORD (output_bfd,
3720 (bfd_get_section_vma (output_bfd,
3721 obj_textsec (input_bfd)->output_section)
3722 + obj_textsec (input_bfd)->output_offset),
3724 ++obj_aout_external_sym_count (output_bfd);
3729 skip_indirect = false;
3730 sym = obj_aout_external_syms (input_bfd);
3731 sym_end = sym + sym_count;
3732 sym_hash = obj_aout_sym_hashes (input_bfd);
3733 for (; sym < sym_end; sym++, sym_hash++, symbol_map++)
3737 struct aout_link_hash_entry *h;
3744 type = bfd_h_get_8 (input_bfd, sym->e_type);
3745 name = strings + GET_WORD (input_bfd, sym->e_strx);
3751 /* Pass this symbol through. It is the target of an
3752 indirect or warning symbol. */
3753 val = GET_WORD (input_bfd, sym->e_value);
3756 else if (skip_indirect)
3758 /* Skip this symbol, which is the target of an indirect
3759 symbol that we have changed to no longer be an indirect
3761 skip_indirect = false;
3766 struct aout_link_hash_entry *hresolve;
3768 /* We have saved the hash table entry for this symbol, if
3769 there is one. Note that we could just look it up again
3770 in the hash table, provided we first check that it is an
3774 /* If this is an indirect or warning symbol, then change
3775 hresolve to the base symbol. We also change *sym_hash so
3776 that the relocation routines relocate against the real
3779 if (h != (struct aout_link_hash_entry *) NULL
3780 && (h->root.type == bfd_link_hash_indirect
3781 || h->root.type == bfd_link_hash_warning))
3783 hresolve = (struct aout_link_hash_entry *) h->root.u.i.link;
3784 while (hresolve->root.type == bfd_link_hash_indirect)
3785 hresolve = ((struct aout_link_hash_entry *)
3786 hresolve->root.u.i.link);
3787 *sym_hash = hresolve;
3790 /* If the symbol has already been written out, skip it. */
3791 if (h != (struct aout_link_hash_entry *) NULL
3794 *symbol_map = h->indx;
3798 /* See if we are stripping this symbol. */
3804 case strip_debugger:
3805 if ((type & N_STAB) != 0)
3809 if (bfd_hash_lookup (finfo->info->keep_hash, name, false, false)
3819 if (h != (struct aout_link_hash_entry *) NULL)
3820 h->root.written = true;
3824 /* Get the value of the symbol. */
3825 if ((type & N_TYPE) == N_TEXT)
3826 symsec = obj_textsec (input_bfd);
3827 else if ((type & N_TYPE) == N_DATA)
3828 symsec = obj_datasec (input_bfd);
3829 else if ((type & N_TYPE) == N_BSS)
3830 symsec = obj_bsssec (input_bfd);
3831 else if ((type & N_TYPE) == N_ABS)
3832 symsec = &bfd_abs_section;
3833 else if (((type & N_TYPE) == N_INDR
3834 && (hresolve == (struct aout_link_hash_entry *) NULL
3835 || (hresolve->root.type != bfd_link_hash_defined
3836 && hresolve->root.type != bfd_link_hash_common)))
3837 || type == N_WARNING)
3839 /* Pass the next symbol through unchanged. The
3840 condition above for indirect symbols is so that if
3841 the indirect symbol was defined, we output it with
3842 the correct definition so the debugger will
3845 val = GET_WORD (input_bfd, sym->e_value);
3848 else if ((type & N_STAB) != 0)
3850 val = GET_WORD (input_bfd, sym->e_value);
3855 /* If we get here with an indirect symbol, it means that
3856 we are outputting it with a real definition. In such
3857 a case we do not want to output the next symbol,
3858 which is the target of the indirection. */
3859 if ((type & N_TYPE) == N_INDR)
3860 skip_indirect = true;
3862 /* We need to get the value from the hash table. We use
3863 hresolve so that if we have defined an indirect
3864 symbol we output the final definition. */
3865 if (h == (struct aout_link_hash_entry *) NULL)
3867 else if (hresolve->root.type == bfd_link_hash_defined)
3869 asection *input_section;
3870 asection *output_section;
3872 /* This case means a common symbol which was turned
3873 into a defined symbol. */
3874 input_section = hresolve->root.u.def.section;
3875 output_section = input_section->output_section;
3876 BFD_ASSERT (output_section == &bfd_abs_section
3877 || output_section->owner == output_bfd);
3878 val = (hresolve->root.u.def.value
3879 + bfd_get_section_vma (output_bfd, output_section)
3880 + input_section->output_offset);
3882 /* Get the correct type based on the section. If
3883 this is a constructed set, force it to be
3884 globally visible. */
3893 if (output_section == obj_textsec (output_bfd))
3895 else if (output_section == obj_datasec (output_bfd))
3897 else if (output_section == obj_bsssec (output_bfd))
3902 else if (hresolve->root.type == bfd_link_hash_common)
3903 val = hresolve->root.u.c.size;
3909 if (symsec != (asection *) NULL)
3910 val = (symsec->output_section->vma
3911 + symsec->output_offset
3912 + (GET_WORD (input_bfd, sym->e_value)
3915 /* If this is a global symbol set the written flag, and if
3916 it is a local symbol see if we should discard it. */
3917 if (h != (struct aout_link_hash_entry *) NULL)
3919 h->root.written = true;
3920 h->indx = obj_aout_external_sym_count (output_bfd);
3929 if (*name == *finfo->info->lprefix
3930 && (finfo->info->lprefix_len == 1
3931 || strncmp (name, finfo->info->lprefix,
3932 finfo->info->lprefix_len) == 0))
3947 /* Copy this symbol into the list of symbols we are going to
3949 bfd_h_put_8 (output_bfd, type, outsym->e_type);
3950 bfd_h_put_8 (output_bfd, bfd_h_get_8 (input_bfd, sym->e_other),
3952 bfd_h_put_16 (output_bfd, bfd_h_get_16 (input_bfd, sym->e_desc),
3954 if (! finfo->info->keep_memory)
3956 /* name points into a string table which we are going to
3957 free. If there is a hash table entry, use that string.
3958 Otherwise, copy name into memory. */
3959 if (h != (struct aout_link_hash_entry *) NULL)
3960 name = (*sym_hash)->root.root.string;
3965 n = bfd_alloc (output_bfd, strlen (name) + 1);
3970 PUT_WORD (output_bfd,
3971 add_to_stringtab (output_bfd, name, &finfo->strtab),
3973 PUT_WORD (output_bfd, val, outsym->e_value);
3974 *symbol_map = obj_aout_external_sym_count (output_bfd);
3975 ++obj_aout_external_sym_count (output_bfd);
3979 /* Write out the output symbols we have just constructed. */
3980 if (outsym > output_syms)
3982 bfd_size_type outsym_count;
3984 if (bfd_seek (output_bfd, finfo->symoff, SEEK_SET) != 0)
3986 outsym_count = outsym - output_syms;
3987 if (bfd_write ((PTR) output_syms, (bfd_size_type) EXTERNAL_NLIST_SIZE,
3988 (bfd_size_type) outsym_count, output_bfd)
3989 != outsym_count * EXTERNAL_NLIST_SIZE)
3991 finfo->symoff += outsym_count * EXTERNAL_NLIST_SIZE;
3994 if (output_syms != NULL)
3998 if (output_syms != NULL)
4003 /* Write out a symbol that was not associated with an a.out input
4007 aout_link_write_other_symbol (h, data)
4008 struct aout_link_hash_entry *h;
4011 struct aout_final_link_info *finfo = (struct aout_final_link_info *) data;
4015 struct external_nlist outsym;
4017 if (h->root.written)
4020 h->root.written = true;
4022 if (finfo->info->strip == strip_all
4023 || (finfo->info->strip == strip_some
4024 && bfd_hash_lookup (finfo->info->keep_hash, h->root.root.string,
4025 false, false) == NULL))
4028 output_bfd = finfo->output_bfd;
4030 switch (h->root.type)
4033 case bfd_link_hash_new:
4035 /* Avoid variable not initialized warnings. */
4037 case bfd_link_hash_undefined:
4038 type = N_UNDF | N_EXT;
4041 case bfd_link_hash_defined:
4045 sec = h->root.u.def.section;
4046 BFD_ASSERT (sec == &bfd_abs_section
4047 || sec->owner == output_bfd);
4048 if (sec == obj_textsec (output_bfd))
4049 type = N_TEXT | N_EXT;
4050 else if (sec == obj_datasec (output_bfd))
4051 type = N_DATA | N_EXT;
4052 else if (sec == obj_bsssec (output_bfd))
4053 type = N_BSS | N_EXT;
4055 type = N_ABS | N_EXT;
4056 val = (h->root.u.def.value
4057 + sec->output_section->vma
4058 + sec->output_offset);
4061 case bfd_link_hash_common:
4062 type = N_UNDF | N_EXT;
4063 val = h->root.u.c.size;
4065 case bfd_link_hash_indirect:
4066 case bfd_link_hash_warning:
4067 /* FIXME: Ignore these for now. The circumstances under which
4068 they should be written out are not clear to me. */
4072 bfd_h_put_8 (output_bfd, type, outsym.e_type);
4073 bfd_h_put_8 (output_bfd, 0, outsym.e_other);
4074 bfd_h_put_16 (output_bfd, 0, outsym.e_desc);
4075 PUT_WORD (output_bfd,
4076 add_to_stringtab (output_bfd, h->root.root.string, &finfo->strtab),
4078 PUT_WORD (output_bfd, val, outsym.e_value);
4080 if (bfd_seek (output_bfd, finfo->symoff, SEEK_SET) != 0
4081 || bfd_write ((PTR) &outsym, (bfd_size_type) EXTERNAL_NLIST_SIZE,
4082 (bfd_size_type) 1, output_bfd) != EXTERNAL_NLIST_SIZE)
4084 /* FIXME: No way to handle errors. */
4088 finfo->symoff += EXTERNAL_NLIST_SIZE;
4089 h->indx = obj_aout_external_sym_count (output_bfd);
4090 ++obj_aout_external_sym_count (output_bfd);
4095 /* Link an a.out section into the output file. */
4098 aout_link_input_section (finfo, input_bfd, input_section, reloff_ptr,
4099 rel_size, symbol_map)
4100 struct aout_final_link_info *finfo;
4102 asection *input_section;
4103 file_ptr *reloff_ptr;
4104 bfd_size_type rel_size;
4107 bfd_size_type input_size;
4108 bfd_byte *contents = NULL;
4111 /* Get the section contents. */
4112 input_size = bfd_section_size (input_bfd, input_section);
4113 contents = (bfd_byte *) malloc (input_size);
4114 if (contents == NULL && input_size != 0)
4116 bfd_set_error (bfd_error_no_memory);
4119 if (! bfd_get_section_contents (input_bfd, input_section, (PTR) contents,
4120 (file_ptr) 0, input_size))
4123 /* Read in the relocs. */
4124 relocs = (PTR) malloc (rel_size);
4125 if (relocs == NULL && rel_size != 0)
4127 bfd_set_error (bfd_error_no_memory);
4130 if (bfd_seek (input_bfd, input_section->rel_filepos, SEEK_SET) != 0
4131 || bfd_read (relocs, 1, rel_size, input_bfd) != rel_size)
4134 /* Relocate the section contents. */
4135 if (obj_reloc_entry_size (input_bfd) == RELOC_STD_SIZE)
4137 if (! aout_link_input_section_std (finfo, input_bfd, input_section,
4138 (struct reloc_std_external *) relocs,
4139 rel_size, contents, symbol_map))
4144 if (! aout_link_input_section_ext (finfo, input_bfd, input_section,
4145 (struct reloc_ext_external *) relocs,
4146 rel_size, contents, symbol_map))
4150 /* Write out the section contents. */
4151 if (! bfd_set_section_contents (finfo->output_bfd,
4152 input_section->output_section,
4154 input_section->output_offset,
4158 /* If we are producing relocateable output, the relocs were
4159 modified, and we now write them out. */
4160 if (finfo->info->relocateable)
4162 if (bfd_seek (finfo->output_bfd, *reloff_ptr, SEEK_SET) != 0)
4164 if (bfd_write (relocs, (bfd_size_type) 1, rel_size, finfo->output_bfd)
4167 *reloff_ptr += rel_size;
4169 /* Assert that the relocs have not run into the symbols, and
4170 that if these are the text relocs they have not run into the
4172 BFD_ASSERT (*reloff_ptr <= obj_sym_filepos (finfo->output_bfd)
4173 && (reloff_ptr != &finfo->treloff
4175 <= obj_datasec (finfo->output_bfd)->rel_filepos)));
4180 if (contents != NULL)
4186 if (contents != NULL)
4191 /* Get the section corresponding to a reloc index. */
4193 static INLINE asection *
4194 aout_reloc_index_to_section (abfd, indx)
4198 switch (indx & N_TYPE)
4201 return obj_textsec (abfd);
4203 return obj_datasec (abfd);
4205 return obj_bsssec (abfd);
4208 return &bfd_abs_section;
4214 /* Relocate an a.out section using standard a.out relocs. */
4217 aout_link_input_section_std (finfo, input_bfd, input_section, relocs,
4218 rel_size, contents, symbol_map)
4219 struct aout_final_link_info *finfo;
4221 asection *input_section;
4222 struct reloc_std_external *relocs;
4223 bfd_size_type rel_size;
4228 boolean relocateable;
4229 struct external_nlist *syms;
4231 struct aout_link_hash_entry **sym_hashes;
4232 bfd_size_type reloc_count;
4233 register struct reloc_std_external *rel;
4234 struct reloc_std_external *rel_end;
4236 output_bfd = finfo->output_bfd;
4238 BFD_ASSERT (obj_reloc_entry_size (input_bfd) == RELOC_STD_SIZE);
4239 BFD_ASSERT (input_bfd->xvec->header_byteorder_big_p
4240 == output_bfd->xvec->header_byteorder_big_p);
4242 relocateable = finfo->info->relocateable;
4243 syms = obj_aout_external_syms (input_bfd);
4244 strings = obj_aout_external_strings (input_bfd);
4245 sym_hashes = obj_aout_sym_hashes (input_bfd);
4247 reloc_count = rel_size / RELOC_STD_SIZE;
4249 rel_end = rel + reloc_count;
4250 for (; rel < rel_end; rel++)
4262 bfd_reloc_status_type r;
4264 r_addr = GET_SWORD (input_bfd, rel->r_address);
4266 if (input_bfd->xvec->header_byteorder_big_p)
4268 r_index = ((rel->r_index[0] << 16)
4269 | (rel->r_index[1] << 8)
4271 r_extern = (0 != (rel->r_type[0] & RELOC_STD_BITS_EXTERN_BIG));
4272 r_pcrel = (0 != (rel->r_type[0] & RELOC_STD_BITS_PCREL_BIG));
4273 r_baserel = (0 != (rel->r_type[0] & RELOC_STD_BITS_BASEREL_BIG));
4274 r_jmptable= (0 != (rel->r_type[0] & RELOC_STD_BITS_JMPTABLE_BIG));
4275 r_relative= (0 != (rel->r_type[0] & RELOC_STD_BITS_RELATIVE_BIG));
4276 r_length = ((rel->r_type[0] & RELOC_STD_BITS_LENGTH_BIG)
4277 >> RELOC_STD_BITS_LENGTH_SH_BIG);
4281 r_index = ((rel->r_index[2] << 16)
4282 | (rel->r_index[1] << 8)
4284 r_extern = (0 != (rel->r_type[0] & RELOC_STD_BITS_EXTERN_LITTLE));
4285 r_pcrel = (0 != (rel->r_type[0] & RELOC_STD_BITS_PCREL_LITTLE));
4286 r_baserel = (0 != (rel->r_type[0] & RELOC_STD_BITS_BASEREL_LITTLE));
4287 r_jmptable= (0 != (rel->r_type[0] & RELOC_STD_BITS_JMPTABLE_LITTLE));
4288 r_relative= (0 != (rel->r_type[0] & RELOC_STD_BITS_RELATIVE_LITTLE));
4289 r_length = ((rel->r_type[0] & RELOC_STD_BITS_LENGTH_LITTLE)
4290 >> RELOC_STD_BITS_LENGTH_SH_LITTLE);
4293 howto_idx = r_length + 4 * r_pcrel + 8 * r_baserel;
4294 BFD_ASSERT (howto_idx < TABLE_SIZE (howto_table_std));
4295 BFD_ASSERT (r_jmptable == 0);
4296 BFD_ASSERT (r_relative == 0);
4300 /* We are generating a relocateable output file, and must
4301 modify the reloc accordingly. */
4304 struct aout_link_hash_entry *h;
4306 /* If we know the symbol this relocation is against,
4307 convert it into a relocation against a section. This
4308 is what the native linker does. */
4309 h = sym_hashes[r_index];
4310 if (h != (struct aout_link_hash_entry *) NULL
4311 && h->root.type == bfd_link_hash_defined)
4313 asection *output_section;
4315 /* Change the r_extern value. */
4316 if (output_bfd->xvec->header_byteorder_big_p)
4317 rel->r_type[0] &=~ RELOC_STD_BITS_EXTERN_BIG;
4319 rel->r_type[0] &=~ RELOC_STD_BITS_EXTERN_LITTLE;
4321 /* Compute a new r_index. */
4322 output_section = h->root.u.def.section->output_section;
4323 if (output_section == obj_textsec (output_bfd))
4325 else if (output_section == obj_datasec (output_bfd))
4327 else if (output_section == obj_bsssec (output_bfd))
4332 /* Add the symbol value and the section VMA to the
4333 addend stored in the contents. */
4334 relocation = (h->root.u.def.value
4335 + output_section->vma
4336 + h->root.u.def.section->output_offset);
4340 /* We must change r_index according to the symbol
4342 r_index = symbol_map[r_index];
4348 name = strings + GET_WORD (input_bfd,
4349 syms[r_index].e_strx);
4350 if (! ((*finfo->info->callbacks->unattached_reloc)
4351 (finfo->info, name, input_bfd, input_section,
4360 /* Write out the new r_index value. */
4361 if (output_bfd->xvec->header_byteorder_big_p)
4363 rel->r_index[0] = r_index >> 16;
4364 rel->r_index[1] = r_index >> 8;
4365 rel->r_index[2] = r_index;
4369 rel->r_index[2] = r_index >> 16;
4370 rel->r_index[1] = r_index >> 8;
4371 rel->r_index[0] = r_index;
4378 /* This is a relocation against a section. We must
4379 adjust by the amount that the section moved. */
4380 section = aout_reloc_index_to_section (input_bfd, r_index);
4381 relocation = (section->output_section->vma
4382 + section->output_offset
4386 /* Change the address of the relocation. */
4387 PUT_WORD (output_bfd,
4388 r_addr + input_section->output_offset,
4391 /* Adjust a PC relative relocation by removing the reference
4392 to the original address in the section and including the
4393 reference to the new address. */
4395 relocation -= (input_section->output_section->vma
4396 + input_section->output_offset
4397 - input_section->vma);
4399 if (relocation == 0)
4402 r = _bfd_relocate_contents (howto_table_std + howto_idx,
4403 input_bfd, relocation,
4408 /* We are generating an executable, and must do a full
4412 struct aout_link_hash_entry *h;
4414 h = sym_hashes[r_index];
4415 if (h != (struct aout_link_hash_entry *) NULL
4416 && h->root.type == bfd_link_hash_defined)
4418 relocation = (h->root.u.def.value
4419 + h->root.u.def.section->output_section->vma
4420 + h->root.u.def.section->output_offset);
4426 name = strings + GET_WORD (input_bfd, syms[r_index].e_strx);
4427 if (! ((*finfo->info->callbacks->undefined_symbol)
4428 (finfo->info, name, input_bfd, input_section,
4438 section = aout_reloc_index_to_section (input_bfd, r_index);
4439 relocation = (section->output_section->vma
4440 + section->output_offset
4443 relocation += input_section->vma;
4446 r = _bfd_final_link_relocate (howto_table_std + howto_idx,
4447 input_bfd, input_section,
4448 contents, r_addr, relocation,
4452 if (r != bfd_reloc_ok)
4457 case bfd_reloc_outofrange:
4459 case bfd_reloc_overflow:
4464 name = strings + GET_WORD (input_bfd,
4465 syms[r_index].e_strx);
4470 s = aout_reloc_index_to_section (input_bfd, r_index);
4471 name = bfd_section_name (input_bfd, s);
4473 if (! ((*finfo->info->callbacks->reloc_overflow)
4474 (finfo->info, name, howto_table_std[howto_idx].name,
4475 (bfd_vma) 0, input_bfd, input_section, r_addr)))
4486 /* Relocate an a.out section using extended a.out relocs. */
4489 aout_link_input_section_ext (finfo, input_bfd, input_section, relocs,
4490 rel_size, contents, symbol_map)
4491 struct aout_final_link_info *finfo;
4493 asection *input_section;
4494 struct reloc_ext_external *relocs;
4495 bfd_size_type rel_size;
4500 boolean relocateable;
4501 struct external_nlist *syms;
4503 struct aout_link_hash_entry **sym_hashes;
4504 bfd_size_type reloc_count;
4505 register struct reloc_ext_external *rel;
4506 struct reloc_ext_external *rel_end;
4508 output_bfd = finfo->output_bfd;
4510 BFD_ASSERT (obj_reloc_entry_size (input_bfd) == RELOC_EXT_SIZE);
4511 BFD_ASSERT (input_bfd->xvec->header_byteorder_big_p
4512 == output_bfd->xvec->header_byteorder_big_p);
4514 relocateable = finfo->info->relocateable;
4515 syms = obj_aout_external_syms (input_bfd);
4516 strings = obj_aout_external_strings (input_bfd);
4517 sym_hashes = obj_aout_sym_hashes (input_bfd);
4519 reloc_count = rel_size / RELOC_EXT_SIZE;
4521 rel_end = rel + reloc_count;
4522 for (; rel < rel_end; rel++)
4531 r_addr = GET_SWORD (input_bfd, rel->r_address);
4533 if (input_bfd->xvec->header_byteorder_big_p)
4535 r_index = ((rel->r_index[0] << 16)
4536 | (rel->r_index[1] << 8)
4538 r_extern = (0 != (rel->r_type[0] & RELOC_EXT_BITS_EXTERN_BIG));
4539 r_type = ((rel->r_type[0] & RELOC_EXT_BITS_TYPE_BIG)
4540 >> RELOC_EXT_BITS_TYPE_SH_BIG);
4544 r_index = ((rel->r_index[2] << 16)
4545 | (rel->r_index[1] << 8)
4547 r_extern = (0 != (rel->r_type[0] & RELOC_EXT_BITS_EXTERN_LITTLE));
4548 r_type = ((rel->r_type[0] & RELOC_EXT_BITS_TYPE_LITTLE)
4549 >> RELOC_EXT_BITS_TYPE_SH_LITTLE);
4552 r_addend = GET_SWORD (input_bfd, rel->r_addend);
4554 BFD_ASSERT (r_type >= 0
4555 && r_type < TABLE_SIZE (howto_table_ext));
4559 /* We are generating a relocateable output file, and must
4560 modify the reloc accordingly. */
4563 struct aout_link_hash_entry *h;
4565 /* If we know the symbol this relocation is against,
4566 convert it into a relocation against a section. This
4567 is what the native linker does. */
4568 h = sym_hashes[r_index];
4569 if (h != (struct aout_link_hash_entry *) NULL
4570 && h->root.type == bfd_link_hash_defined)
4572 asection *output_section;
4574 /* Change the r_extern value. */
4575 if (output_bfd->xvec->header_byteorder_big_p)
4576 rel->r_type[0] &=~ RELOC_EXT_BITS_EXTERN_BIG;
4578 rel->r_type[0] &=~ RELOC_EXT_BITS_EXTERN_LITTLE;
4580 /* Compute a new r_index. */
4581 output_section = h->root.u.def.section->output_section;
4582 if (output_section == obj_textsec (output_bfd))
4584 else if (output_section == obj_datasec (output_bfd))
4586 else if (output_section == obj_bsssec (output_bfd))
4591 /* Add the symbol value and the section VMA to the
4593 relocation = (h->root.u.def.value
4594 + output_section->vma
4595 + h->root.u.def.section->output_offset);
4597 /* Now RELOCATION is the VMA of the final
4598 destination. If this is a PC relative reloc,
4599 then ADDEND is the negative of the source VMA.
4600 We want to set ADDEND to the difference between
4601 the destination VMA and the source VMA, which
4602 means we must adjust RELOCATION by the change in
4603 the source VMA. This is done below. */
4607 /* We must change r_index according to the symbol
4609 r_index = symbol_map[r_index];
4616 + GET_WORD (input_bfd, syms[r_index].e_strx));
4617 if (! ((*finfo->info->callbacks->unattached_reloc)
4618 (finfo->info, name, input_bfd, input_section,
4626 /* If this is a PC relative reloc, then the addend
4627 is the negative of the source VMA. We must
4628 adjust it by the change in the source VMA. This
4632 /* Write out the new r_index value. */
4633 if (output_bfd->xvec->header_byteorder_big_p)
4635 rel->r_index[0] = r_index >> 16;
4636 rel->r_index[1] = r_index >> 8;
4637 rel->r_index[2] = r_index;
4641 rel->r_index[2] = r_index >> 16;
4642 rel->r_index[1] = r_index >> 8;
4643 rel->r_index[0] = r_index;
4650 /* This is a relocation against a section. We must
4651 adjust by the amount that the section moved. */
4652 section = aout_reloc_index_to_section (input_bfd, r_index);
4653 relocation = (section->output_section->vma
4654 + section->output_offset
4657 /* If this is a PC relative reloc, then the addend is
4658 the difference in VMA between the destination and the
4659 source. We have just adjusted for the change in VMA
4660 of the destination, so we must also adjust by the
4661 change in VMA of the source. This is done below. */
4664 /* As described above, we must always adjust a PC relative
4665 reloc by the change in VMA of the source. */
4666 if (howto_table_ext[r_type].pc_relative)
4667 relocation -= (input_section->output_section->vma
4668 + input_section->output_offset
4669 - input_section->vma);
4671 /* Change the addend if necessary. */
4672 if (relocation != 0)
4673 PUT_WORD (output_bfd, r_addend + relocation, rel->r_addend);
4675 /* Change the address of the relocation. */
4676 PUT_WORD (output_bfd,
4677 r_addr + input_section->output_offset,
4682 bfd_reloc_status_type r;
4684 /* We are generating an executable, and must do a full
4688 struct aout_link_hash_entry *h;
4690 h = sym_hashes[r_index];
4691 if (h != (struct aout_link_hash_entry *) NULL
4692 && h->root.type == bfd_link_hash_defined)
4694 relocation = (h->root.u.def.value
4695 + h->root.u.def.section->output_section->vma
4696 + h->root.u.def.section->output_offset);
4702 name = strings + GET_WORD (input_bfd, syms[r_index].e_strx);
4703 if (! ((*finfo->info->callbacks->undefined_symbol)
4704 (finfo->info, name, input_bfd, input_section,
4714 section = aout_reloc_index_to_section (input_bfd, r_index);
4716 /* If this is a PC relative reloc, then R_ADDEND is the
4717 difference between the two vmas, or
4718 old_dest_sec + old_dest_off - (old_src_sec + old_src_off)
4720 old_dest_sec == section->vma
4722 old_src_sec == input_section->vma
4724 old_src_off == r_addr
4726 _bfd_final_link_relocate expects RELOCATION +
4727 R_ADDEND to be the VMA of the destination minus
4728 r_addr (the minus r_addr is because this relocation
4729 is not pcrel_offset, which is a bit confusing and
4730 should, perhaps, be changed), or
4733 new_dest_sec == output_section->vma + output_offset
4734 We arrange for this to happen by setting RELOCATION to
4735 new_dest_sec + old_src_sec - old_dest_sec
4737 If this is not a PC relative reloc, then R_ADDEND is
4738 simply the VMA of the destination, so we set
4739 RELOCATION to the change in the destination VMA, or
4740 new_dest_sec - old_dest_sec
4742 relocation = (section->output_section->vma
4743 + section->output_offset
4745 if (howto_table_ext[r_type].pc_relative)
4746 relocation += input_section->vma;
4749 r = _bfd_final_link_relocate (howto_table_ext + r_type,
4750 input_bfd, input_section,
4751 contents, r_addr, relocation,
4753 if (r != bfd_reloc_ok)
4758 case bfd_reloc_outofrange:
4760 case bfd_reloc_overflow:
4765 name = strings + GET_WORD (input_bfd,
4766 syms[r_index].e_strx);
4771 s = aout_reloc_index_to_section (input_bfd, r_index);
4772 name = bfd_section_name (input_bfd, s);
4774 if (! ((*finfo->info->callbacks->reloc_overflow)
4775 (finfo->info, name, howto_table_ext[r_type].name,
4776 r_addend, input_bfd, input_section, r_addr)))
4788 /* Handle a link order which is supposed to generate a reloc. */
4791 aout_link_reloc_link_order (finfo, o, p)
4792 struct aout_final_link_info *finfo;
4794 struct bfd_link_order *p;
4796 struct bfd_link_order_reloc *pr;
4799 const reloc_howto_type *howto;
4800 file_ptr *reloff_ptr;
4801 struct reloc_std_external srel;
4802 struct reloc_ext_external erel;
4807 if (p->type == bfd_section_reloc_link_order)
4810 if (pr->u.section == &bfd_abs_section)
4811 r_index = N_ABS | N_EXT;
4814 BFD_ASSERT (pr->u.section->owner == finfo->output_bfd);
4815 r_index = pr->u.section->target_index;
4820 struct aout_link_hash_entry *h;
4822 BFD_ASSERT (p->type == bfd_symbol_reloc_link_order);
4824 h = aout_link_hash_lookup (aout_hash_table (finfo->info),
4825 pr->u.name, false, false, true);
4826 if (h != (struct aout_link_hash_entry *) NULL
4831 if (! ((*finfo->info->callbacks->unattached_reloc)
4832 (finfo->info, pr->u.name, (bfd *) NULL,
4833 (asection *) NULL, (bfd_vma) 0)))
4839 howto = bfd_reloc_type_lookup (finfo->output_bfd, pr->reloc);
4840 if (howto == (const reloc_howto_type *) NULL)
4842 bfd_set_error (bfd_error_bad_value);
4846 if (o == obj_textsec (finfo->output_bfd))
4847 reloff_ptr = &finfo->treloff;
4848 else if (o == obj_datasec (finfo->output_bfd))
4849 reloff_ptr = &finfo->dreloff;
4853 if (obj_reloc_entry_size (finfo->output_bfd) == RELOC_STD_SIZE)
4861 r_pcrel = howto->pc_relative;
4862 r_baserel = (howto->type & 8) != 0;
4865 r_length = howto->size;
4867 PUT_WORD (finfo->output_bfd, p->offset, srel.r_address);
4868 if (finfo->output_bfd->xvec->header_byteorder_big_p)
4870 srel.r_index[0] = r_index >> 16;
4871 srel.r_index[1] = r_index >> 8;
4872 srel.r_index[2] = r_index;
4874 ((r_extern ? RELOC_STD_BITS_EXTERN_BIG : 0)
4875 | (r_pcrel ? RELOC_STD_BITS_PCREL_BIG : 0)
4876 | (r_baserel ? RELOC_STD_BITS_BASEREL_BIG : 0)
4877 | (r_jmptable ? RELOC_STD_BITS_JMPTABLE_BIG : 0)
4878 | (r_relative ? RELOC_STD_BITS_RELATIVE_BIG : 0)
4879 | (r_length << RELOC_STD_BITS_LENGTH_SH_BIG));
4883 srel.r_index[2] = r_index >> 16;
4884 srel.r_index[1] = r_index >> 8;
4885 srel.r_index[0] = r_index;
4887 ((r_extern ? RELOC_STD_BITS_EXTERN_LITTLE : 0)
4888 | (r_pcrel ? RELOC_STD_BITS_PCREL_LITTLE : 0)
4889 | (r_baserel ? RELOC_STD_BITS_BASEREL_LITTLE : 0)
4890 | (r_jmptable ? RELOC_STD_BITS_JMPTABLE_LITTLE : 0)
4891 | (r_relative ? RELOC_STD_BITS_RELATIVE_LITTLE : 0)
4892 | (r_length << RELOC_STD_BITS_LENGTH_SH_LITTLE));
4895 rel_ptr = (PTR) &srel;
4897 /* We have to write the addend into the object file, since
4898 standard a.out relocs are in place. It would be more
4899 reliable if we had the current contents of the file here,
4900 rather than assuming zeroes, but we can't read the file since
4901 it was opened using bfd_openw. */
4902 if (pr->addend != 0)
4905 bfd_reloc_status_type r;
4909 size = bfd_get_reloc_size (howto);
4910 buf = (bfd_byte*) bfd_zmalloc (size);
4911 if (buf == (bfd_byte *) NULL)
4913 bfd_set_error (bfd_error_no_memory);
4916 r = _bfd_relocate_contents (howto, finfo->output_bfd,
4923 case bfd_reloc_outofrange:
4925 case bfd_reloc_overflow:
4926 if (! ((*finfo->info->callbacks->reloc_overflow)
4928 (p->type == bfd_section_reloc_link_order
4929 ? bfd_section_name (finfo->output_bfd,
4932 howto->name, pr->addend, (bfd *) NULL,
4933 (asection *) NULL, (bfd_vma) 0)))
4940 ok = bfd_set_section_contents (finfo->output_bfd, o,
4942 (file_ptr) p->offset,
4951 PUT_WORD (finfo->output_bfd, p->offset, erel.r_address);
4953 if (finfo->output_bfd->xvec->header_byteorder_big_p)
4955 erel.r_index[0] = r_index >> 16;
4956 erel.r_index[1] = r_index >> 8;
4957 erel.r_index[2] = r_index;
4959 ((r_extern ? RELOC_EXT_BITS_EXTERN_BIG : 0)
4960 | (howto->type << RELOC_EXT_BITS_TYPE_SH_BIG));
4964 erel.r_index[2] = r_index >> 16;
4965 erel.r_index[1] = r_index >> 8;
4966 erel.r_index[0] = r_index;
4968 (r_extern ? RELOC_EXT_BITS_EXTERN_LITTLE : 0)
4969 | (howto->type << RELOC_EXT_BITS_TYPE_SH_LITTLE);
4972 PUT_WORD (finfo->output_bfd, pr->addend, erel.r_addend);
4974 rel_ptr = (PTR) &erel;
4977 if (bfd_seek (finfo->output_bfd, *reloff_ptr, SEEK_SET) != 0
4978 || (bfd_write (rel_ptr, (bfd_size_type) 1,
4979 obj_reloc_entry_size (finfo->output_bfd),
4981 != obj_reloc_entry_size (finfo->output_bfd)))
4984 *reloff_ptr += obj_reloc_entry_size (finfo->output_bfd);
4986 /* Assert that the relocs have not run into the symbols, and that n
4987 the text relocs have not run into the data relocs. */
4988 BFD_ASSERT (*reloff_ptr <= obj_sym_filepos (finfo->output_bfd)
4989 && (reloff_ptr != &finfo->treloff
4991 <= obj_datasec (finfo->output_bfd)->rel_filepos)));