Commit | Line | Data |
---|---|---|
1f29e30b | 1 | /* BFD semi-generic back-end for a.out binaries. |
a99c3d70 | 2 | Copyright 1990, 1991, 1992, 1993 Free Software Foundation, Inc. |
88dfcd68 | 3 | Written by Cygnus Support. |
7ed4093a | 4 | |
88dfcd68 | 5 | This file is part of BFD, the Binary File Descriptor library. |
7ed4093a | 6 | |
88dfcd68 | 7 | This program is free software; you can redistribute it and/or modify |
7ed4093a | 8 | it under the terms of the GNU General Public License as published by |
88dfcd68 SC |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. | |
7ed4093a | 11 | |
88dfcd68 | 12 | This program is distributed in the hope that it will be useful, |
7ed4093a SC |
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. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
88dfcd68 SC |
18 | along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
7ed4093a | 20 | |
4e41b5aa SC |
21 | /* |
22 | SECTION | |
23 | a.out backends | |
6f715d66 | 24 | |
6f715d66 | 25 | |
4e41b5aa | 26 | DESCRIPTION |
6f715d66 | 27 | |
4e41b5aa SC |
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 | |
31 | information. | |
6f715d66 | 32 | |
4e41b5aa SC |
33 | The support is split into a basic support file @code{aoutx.h} |
34 | and other files which derive functions from the base. One | |
35 | derivation file is @code{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 | |
38 | specific target. | |
6f715d66 | 39 | |
4e41b5aa SC |
40 | This information is further split out into more specific files |
41 | for each machine, including @code{sunos.c} for sun3 and sun4, | |
42 | @code{newsos3.c} for the Sony NEWS, and @code{demo64.c} for a | |
43 | demonstration of a 64 bit a.out format. | |
44 | ||
45 | The base file @code{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 | @code{aout32.c} and @code{aout64.c} to form the names | |
49 | aout_32_swap_exec_header_in, aout_64_swap_exec_header_in, etc. | |
50 | ||
51 | As an example, this is what goes on to make the back end for a | |
52 | sun4, from aout32.c | |
53 | ||
3f7607af PB |
54 | | #define ARCH_SIZE 32 |
55 | | #include "aoutx.h" | |
4e41b5aa SC |
56 | |
57 | Which exports names: | |
58 | ||
3f7607af PB |
59 | | ... |
60 | | aout_32_canonicalize_reloc | |
61 | | aout_32_find_nearest_line | |
62 | | aout_32_get_lineno | |
63 | | aout_32_get_reloc_upper_bound | |
64 | | ... | |
6f715d66 | 65 | |
4e41b5aa SC |
66 | from sunos.c |
67 | ||
3f7607af PB |
68 | | #define ARCH 32 |
69 | | #define TARGET_NAME "a.out-sunos-big" | |
70 | | #define VECNAME sunos_big_vec | |
71 | | #include "aoutf1.h" | |
4e41b5aa SC |
72 | |
73 | requires all the names from aout32.c, and produces the jump vector | |
6f715d66 | 74 | |
3f7607af | 75 | | sunos_big_vec |
c6705697 | 76 | |
4e41b5aa SC |
77 | The 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 | |
85 | the object file. | |
c6705697 | 86 | |
4e41b5aa SC |
87 | When porting it to run on a new system, you must supply: |
88 | ||
3f7607af PB |
89 | | HOST_PAGE_SIZE |
90 | | HOST_SEGMENT_SIZE | |
91 | | HOST_MACHINE_ARCH (optional) | |
92 | | HOST_MACHINE_MACHINE (optional) | |
93 | | HOST_TEXT_START_ADDR | |
94 | | HOST_STACK_END_ADDR | |
c6705697 | 95 | |
3f7607af PB |
96 | in the file <<../include/sys/h-XXX.h>> (for your host). These |
97 | values, plus the structures and macros defined in <<a.out.h>> on | |
4e41b5aa SC |
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 | |
3f7607af | 100 | to use <<host-aout.c>., specify: |
c6705697 | 101 | |
3f7607af PB |
102 | | TDEFAULTS = -DDEFAULT_VECTOR=host_aout_big_vec |
103 | | TDEPFILES= host-aout.o trad-core.o | |
c6705697 | 104 | |
3f7607af PB |
105 | in the <<config/mt-XXX>> file, and modify configure.in to use the |
106 | <<mt-XXX>> file (by setting "<<bfd_target=XXX>>") when your | |
4e41b5aa | 107 | configuration is selected. |
c6705697 | 108 | |
6f715d66 SC |
109 | */ |
110 | ||
ce07dd7c KR |
111 | /* Some assumptions: |
112 | * Any BFD with D_PAGED set is ZMAGIC, and vice versa. | |
113 | Doesn't matter what the setting of WP_TEXT is on output, but it'll | |
114 | get set on input. | |
115 | * Any BFD with D_PAGED clear and WP_TEXT set is NMAGIC. | |
116 | * Any BFD with both flags clear is OMAGIC. | |
117 | (Just want to make these explicit, so the conditions tested in this | |
118 | file make sense if you're more familiar with a.out than with BFD.) */ | |
119 | ||
c618de01 SC |
120 | #define KEEPIT flags |
121 | #define KEEPITTYPE int | |
67c060c3 | 122 | |
0f213cc2 | 123 | #include <assert.h> |
a99c3d70 | 124 | #include <string.h> /* For strchr and friends */ |
67c060c3 | 125 | #include "bfd.h" |
7ed4093a SC |
126 | #include <sysdep.h> |
127 | #include <ansidecl.h> | |
128 | ||
9e2dad8e | 129 | struct external_exec; |
6f715d66 | 130 | #include "libaout.h" |
7ed4093a | 131 | #include "libbfd.h" |
c3eb25fc SC |
132 | #include "aout/aout64.h" |
133 | #include "aout/stab_gnu.h" | |
134 | #include "aout/ar.h" | |
7ed4093a | 135 | |
ce07dd7c | 136 | extern void (*bfd_error_trap)(); |
7ed4093a | 137 | |
4e41b5aa SC |
138 | /* |
139 | SUBSECTION | |
140 | relocations | |
141 | ||
142 | DESCRIPTION | |
143 | The file @code{aoutx.h} caters for both the @emph{standard} | |
144 | and @emph{extended} forms of a.out relocation records. | |
145 | ||
146 | The standard records are characterised by containing only an | |
147 | address, a symbol index and a type field. The extended records | |
148 | (used on 29ks and sparcs) also have a full integer for an | |
149 | addend. | |
7ed4093a | 150 | |
6f715d66 | 151 | */ |
7ed4093a | 152 | #define CTOR_TABLE_RELOC_IDX 2 |
67c060c3 | 153 | |
ce07dd7c KR |
154 | #define howto_table_ext NAME(aout,ext_howto_table) |
155 | #define howto_table_std NAME(aout,std_howto_table) | |
67c060c3 | 156 | |
ce07dd7c | 157 | reloc_howto_type howto_table_ext[] = |
7ed4093a | 158 | { |
3caa6924 DM |
159 | /* type rightshift size bitsize pc_ bit absol compl spec name partial_ src_ dst_ pcrel_ |
160 | rela pos ute ain_on ial_ inplace mask mask offset | |
161 | tive _overf fn */ | |
162 | HOWTO(RELOC_8, 0, 0, 8, false, 0, true, true,0,"8", false, 0,0x000000ff, false), | |
163 | HOWTO(RELOC_16, 0, 1, 16, false, 0, true, true,0,"16", false, 0,0x0000ffff, false), | |
164 | HOWTO(RELOC_32, 0, 2, 32, false, 0, true, true,0,"32", false, 0,0xffffffff, false), | |
7ed4093a SC |
165 | HOWTO(RELOC_DISP8, 0, 0, 8, true, 0, false, true,0,"DISP8", false, 0,0x000000ff, false), |
166 | HOWTO(RELOC_DISP16, 0, 1, 16, true, 0, false, true,0,"DISP16", false, 0,0x0000ffff, false), | |
167 | HOWTO(RELOC_DISP32, 0, 2, 32, true, 0, false, true,0,"DISP32", false, 0,0xffffffff, false), | |
168 | HOWTO(RELOC_WDISP30,2, 2, 30, true, 0, false, true,0,"WDISP30", false, 0,0x3fffffff, false), | |
169 | HOWTO(RELOC_WDISP22,2, 2, 22, true, 0, false, true,0,"WDISP22", false, 0,0x003fffff, false), | |
170 | HOWTO(RELOC_HI22, 10, 2, 22, false, 0, false, true,0,"HI22", false, 0,0x003fffff, false), | |
3caa6924 DM |
171 | HOWTO(RELOC_22, 0, 2, 22, false, 0, false, true,0,"22", false, 0,0x003fffff, false), |
172 | HOWTO(RELOC_13, 0, 2, 13, false, 0, false, true,0,"13", false, 0,0x00001fff, false), | |
173 | HOWTO(RELOC_LO10, 0, 2, 10, false, 0, false, true,0,"LO10", false, 0,0x000003ff, false), | |
7ed4093a SC |
174 | HOWTO(RELOC_SFA_BASE,0, 2, 32, false, 0, false, true,0,"SFA_BASE", false, 0,0xffffffff, false), |
175 | HOWTO(RELOC_SFA_OFF13,0,2, 32, false, 0, false, true,0,"SFA_OFF13",false, 0,0xffffffff, false), | |
176 | HOWTO(RELOC_BASE10, 0, 2, 16, false, 0, false, true,0,"BASE10", false, 0,0x0000ffff, false), | |
177 | HOWTO(RELOC_BASE13, 0, 2, 13, false, 0, false, true,0,"BASE13", false, 0,0x00001fff, false), | |
178 | HOWTO(RELOC_BASE22, 0, 2, 0, false, 0, false, true,0,"BASE22", false, 0,0x00000000, false), | |
179 | HOWTO(RELOC_PC10, 0, 2, 10, false, 0, false, true,0,"PC10", false, 0,0x000003ff, false), | |
180 | HOWTO(RELOC_PC22, 0, 2, 22, false, 0, false, true,0,"PC22", false, 0,0x003fffff, false), | |
181 | HOWTO(RELOC_JMP_TBL,0, 2, 32, false, 0, false, true,0,"JMP_TBL", false, 0,0xffffffff, false), | |
182 | HOWTO(RELOC_SEGOFF16,0, 2, 0, false, 0, false, true,0,"SEGOFF16", false, 0,0x00000000, false), | |
183 | HOWTO(RELOC_GLOB_DAT,0, 2, 0, false, 0, false, true,0,"GLOB_DAT", false, 0,0x00000000, false), | |
184 | HOWTO(RELOC_JMP_SLOT,0, 2, 0, false, 0, false, true,0,"JMP_SLOT", false, 0,0x00000000, false), | |
3caa6924 | 185 | HOWTO(RELOC_RELATIVE,0, 2, 0, false, 0, false, true,0,"RELATIVE", false, 0,0x00000000, false), |
7ed4093a SC |
186 | }; |
187 | ||
188 | /* Convert standard reloc records to "arelent" format (incl byte swap). */ | |
189 | ||
ce07dd7c | 190 | reloc_howto_type howto_table_std[] = { |
7ed4093a SC |
191 | /* type rs size bsz pcrel bitpos abs ovrf sf name part_inpl readmask setmask pcdone */ |
192 | HOWTO( 0, 0, 0, 8, false, 0, true, true,0,"8", true, 0x000000ff,0x000000ff, false), | |
193 | HOWTO( 1, 0, 1, 16, false, 0, true, true,0,"16", true, 0x0000ffff,0x0000ffff, false), | |
194 | HOWTO( 2, 0, 2, 32, false, 0, true, true,0,"32", true, 0xffffffff,0xffffffff, false), | |
195 | HOWTO( 3, 0, 3, 64, false, 0, true, true,0,"64", true, 0xdeaddead,0xdeaddead, false), | |
196 | HOWTO( 4, 0, 0, 8, true, 0, false, true,0,"DISP8", true, 0x000000ff,0x000000ff, false), | |
197 | HOWTO( 5, 0, 1, 16, true, 0, false, true,0,"DISP16", true, 0x0000ffff,0x0000ffff, false), | |
198 | HOWTO( 6, 0, 2, 32, true, 0, false, true,0,"DISP32", true, 0xffffffff,0xffffffff, false), | |
199 | HOWTO( 7, 0, 3, 64, true, 0, false, true,0,"DISP64", true, 0xfeedface,0xfeedface, false), | |
200 | }; | |
201 | ||
214f8f23 KR |
202 | CONST struct reloc_howto_struct * |
203 | DEFUN(NAME(aout,reloc_type_lookup),(abfd,code), | |
204 | bfd *abfd AND | |
205 | bfd_reloc_code_real_type code) | |
206 | { | |
207 | #define EXT(i,j) case i: return &howto_table_ext[j] | |
208 | #define STD(i,j) case i: return &howto_table_std[j] | |
209 | int ext = obj_reloc_entry_size (abfd) == RELOC_EXT_SIZE; | |
210 | if (code == BFD_RELOC_CTOR) | |
211 | switch (bfd_get_arch_info (abfd)->bits_per_address) | |
212 | { | |
213 | case 32: | |
214 | code = BFD_RELOC_32; | |
215 | break; | |
216 | } | |
217 | if (ext) | |
218 | switch (code) | |
219 | { | |
220 | EXT (BFD_RELOC_32, 2); | |
221 | EXT (BFD_RELOC_HI22, 8); | |
222 | EXT (BFD_RELOC_LO10, 11); | |
223 | EXT (BFD_RELOC_32_PCREL_S2, 6); | |
a99c3d70 | 224 | default: return (CONST struct reloc_howto_struct *) 0; |
214f8f23 KR |
225 | } |
226 | else | |
227 | /* std relocs */ | |
228 | switch (code) | |
229 | { | |
230 | STD (BFD_RELOC_16, 1); | |
231 | STD (BFD_RELOC_32, 2); | |
232 | STD (BFD_RELOC_8_PCREL, 4); | |
233 | STD (BFD_RELOC_16_PCREL, 5); | |
234 | STD (BFD_RELOC_32_PCREL, 6); | |
a99c3d70 | 235 | default: return (CONST struct reloc_howto_struct *) 0; |
214f8f23 | 236 | } |
214f8f23 | 237 | } |
7ed4093a | 238 | |
ce07dd7c | 239 | extern bfd_error_vector_type bfd_error_vector; |
6f715d66 | 240 | |
4e41b5aa SC |
241 | /* |
242 | SUBSECTION | |
243 | Internal Entry Points | |
244 | ||
245 | DESCRIPTION | |
246 | @code{aoutx.h} exports several routines for accessing the | |
247 | contents of an a.out file, which are gathered and exported in | |
248 | turn by various format specific files (eg sunos.c). | |
249 | ||
6f715d66 SC |
250 | */ |
251 | ||
4e41b5aa SC |
252 | /* |
253 | FUNCTION | |
254 | aout_<size>_swap_exec_header_in | |
255 | ||
256 | DESCRIPTION | |
257 | Swaps the information in an executable header taken from a raw | |
258 | byte stream memory image, into the internal exec_header | |
259 | structure. | |
260 | ||
fa2b89f1 | 261 | SYNOPSIS |
4e41b5aa SC |
262 | void aout_<size>_swap_exec_header_in, |
263 | (bfd *abfd, | |
264 | struct external_exec *raw_bytes, | |
265 | struct internal_exec *execp); | |
6f715d66 SC |
266 | */ |
267 | ||
34dd8ba3 | 268 | #ifndef NAME_swap_exec_header_in |
7ed4093a SC |
269 | void |
270 | DEFUN(NAME(aout,swap_exec_header_in),(abfd, raw_bytes, execp), | |
271 | bfd *abfd AND | |
272 | struct external_exec *raw_bytes AND | |
273 | struct internal_exec *execp) | |
274 | { | |
275 | struct external_exec *bytes = (struct external_exec *)raw_bytes; | |
276 | ||
55c0061e FF |
277 | /* The internal_exec structure has some fields that are unused in this |
278 | configuration (IE for i960), so ensure that all such uninitialized | |
279 | fields are zero'd out. There are places where two of these structs | |
280 | are memcmp'd, and thus the contents do matter. */ | |
281 | memset (execp, 0, sizeof (struct internal_exec)); | |
7ed4093a SC |
282 | /* Now fill in fields in the execp, from the bytes in the raw data. */ |
283 | execp->a_info = bfd_h_get_32 (abfd, bytes->e_info); | |
284 | execp->a_text = GET_WORD (abfd, bytes->e_text); | |
285 | execp->a_data = GET_WORD (abfd, bytes->e_data); | |
286 | execp->a_bss = GET_WORD (abfd, bytes->e_bss); | |
287 | execp->a_syms = GET_WORD (abfd, bytes->e_syms); | |
288 | execp->a_entry = GET_WORD (abfd, bytes->e_entry); | |
289 | execp->a_trsize = GET_WORD (abfd, bytes->e_trsize); | |
290 | execp->a_drsize = GET_WORD (abfd, bytes->e_drsize); | |
291 | } | |
34dd8ba3 JG |
292 | #define NAME_swap_exec_header_in NAME(aout,swap_exec_header_in) |
293 | #endif | |
7ed4093a | 294 | |
4e41b5aa SC |
295 | /* |
296 | FUNCTION | |
297 | aout_<size>_swap_exec_header_out | |
298 | ||
299 | DESCRIPTION | |
300 | Swaps the information in an internal exec header structure | |
301 | into the supplied buffer ready for writing to disk. | |
302 | ||
fa2b89f1 | 303 | SYNOPSIS |
4e41b5aa | 304 | void aout_<size>_swap_exec_header_out |
6f715d66 SC |
305 | (bfd *abfd, |
306 | struct internal_exec *execp, | |
4e41b5aa | 307 | struct external_exec *raw_bytes); |
6f715d66 | 308 | */ |
7ed4093a SC |
309 | void |
310 | DEFUN(NAME(aout,swap_exec_header_out),(abfd, execp, raw_bytes), | |
311 | bfd *abfd AND | |
312 | struct internal_exec *execp AND | |
313 | struct external_exec *raw_bytes) | |
314 | { | |
315 | struct external_exec *bytes = (struct external_exec *)raw_bytes; | |
316 | ||
317 | /* Now fill in fields in the raw data, from the fields in the exec struct. */ | |
318 | bfd_h_put_32 (abfd, execp->a_info , bytes->e_info); | |
319 | PUT_WORD (abfd, execp->a_text , bytes->e_text); | |
320 | PUT_WORD (abfd, execp->a_data , bytes->e_data); | |
321 | PUT_WORD (abfd, execp->a_bss , bytes->e_bss); | |
322 | PUT_WORD (abfd, execp->a_syms , bytes->e_syms); | |
323 | PUT_WORD (abfd, execp->a_entry , bytes->e_entry); | |
324 | PUT_WORD (abfd, execp->a_trsize, bytes->e_trsize); | |
325 | PUT_WORD (abfd, execp->a_drsize, bytes->e_drsize); | |
326 | } | |
327 | ||
7ed4093a | 328 | |
6f715d66 | 329 | |
4e41b5aa SC |
330 | /* |
331 | FUNCTION | |
332 | aout_<size>_some_aout_object_p | |
6f715d66 | 333 | |
4e41b5aa SC |
334 | DESCRIPTION |
335 | Some A.OUT variant thinks that the file whose format we're | |
336 | checking is an a.out file. Do some more checking, and set up | |
337 | for access if it really is. Call back to the calling | |
338 | environments "finish up" function just before returning, to | |
339 | handle any last-minute setup. | |
6f715d66 | 340 | |
fa2b89f1 | 341 | SYNOPSIS |
4e41b5aa | 342 | bfd_target *aout_<size>_some_aout_object_p |
6f715d66 | 343 | (bfd *abfd, |
4e41b5aa | 344 | bfd_target *(*callback_to_real_object_p)()); |
6f715d66 | 345 | */ |
7ed4093a SC |
346 | |
347 | bfd_target * | |
7b02b4ed | 348 | DEFUN(NAME(aout,some_aout_object_p),(abfd, execp, callback_to_real_object_p), |
7ed4093a | 349 | bfd *abfd AND |
7b02b4ed | 350 | struct internal_exec *execp AND |
b86f998b | 351 | bfd_target *(*callback_to_real_object_p) PARAMS ((bfd *))) |
7ed4093a | 352 | { |
214f8f23 | 353 | struct aout_data_struct *rawptr, *oldrawptr; |
e6e265ce | 354 | bfd_target *result; |
7ed4093a | 355 | |
6db82ea7 | 356 | rawptr = (struct aout_data_struct *) bfd_zalloc (abfd, sizeof (struct aout_data_struct )); |
7ed4093a SC |
357 | if (rawptr == NULL) { |
358 | bfd_error = no_memory; | |
359 | return 0; | |
360 | } | |
361 | ||
214f8f23 | 362 | oldrawptr = abfd->tdata.aout_data; |
6db82ea7 | 363 | abfd->tdata.aout_data = rawptr; |
ebd24135 ILT |
364 | |
365 | /* Copy the contents of the old tdata struct. | |
366 | In particular, we want the subformat, since for hpux it was set in | |
367 | hp300hpux.c:swap_exec_header_in and will be used in | |
368 | hp300hpux.c:callback. */ | |
369 | if (oldrawptr != NULL) | |
370 | *abfd->tdata.aout_data = *oldrawptr; | |
371 | ||
6db82ea7 SC |
372 | abfd->tdata.aout_data->a.hdr = &rawptr->e; |
373 | *(abfd->tdata.aout_data->a.hdr) = *execp; /* Copy in the internal_exec struct */ | |
374 | execp = abfd->tdata.aout_data->a.hdr; | |
7ed4093a SC |
375 | |
376 | /* Set the file flags */ | |
377 | abfd->flags = NO_FLAGS; | |
378 | if (execp->a_drsize || execp->a_trsize) | |
379 | abfd->flags |= HAS_RELOC; | |
e6e265ce | 380 | /* Setting of EXEC_P has been deferred to the bottom of this function */ |
7ed4093a SC |
381 | if (execp->a_syms) |
382 | abfd->flags |= HAS_LINENO | HAS_DEBUG | HAS_SYMS | HAS_LOCALS; | |
383 | ||
ce07dd7c KR |
384 | if (N_MAGIC (*execp) == ZMAGIC) |
385 | { | |
386 | abfd->flags |= D_PAGED|WP_TEXT; | |
387 | adata(abfd).magic = z_magic; | |
388 | } | |
389 | else if (N_MAGIC (*execp) == NMAGIC) | |
390 | { | |
391 | abfd->flags |= WP_TEXT; | |
392 | adata(abfd).magic = n_magic; | |
393 | } | |
394 | else | |
395 | adata(abfd).magic = o_magic; | |
7ed4093a SC |
396 | |
397 | bfd_get_start_address (abfd) = execp->a_entry; | |
398 | ||
399 | obj_aout_symbols (abfd) = (aout_symbol_type *)NULL; | |
400 | bfd_get_symcount (abfd) = execp->a_syms / sizeof (struct external_nlist); | |
401 | ||
7ed4093a SC |
402 | /* The default relocation entry size is that of traditional V7 Unix. */ |
403 | obj_reloc_entry_size (abfd) = RELOC_STD_SIZE; | |
404 | ||
7b02b4ed JG |
405 | /* The default symbol entry size is that of traditional Unix. */ |
406 | obj_symbol_entry_size (abfd) = EXTERNAL_NLIST_SIZE; | |
407 | ||
7ed4093a SC |
408 | /* create the sections. This is raunchy, but bfd_close wants to reclaim |
409 | them */ | |
6db82ea7 | 410 | |
214f8f23 KR |
411 | obj_textsec (abfd) = bfd_make_section_old_way (abfd, ".text"); |
412 | obj_datasec (abfd) = bfd_make_section_old_way (abfd, ".data"); | |
413 | obj_bsssec (abfd) = bfd_make_section_old_way (abfd, ".bss"); | |
414 | ||
415 | #if 0 | |
416 | (void)bfd_make_section (abfd, ".text"); | |
417 | (void)bfd_make_section (abfd, ".data"); | |
418 | (void)bfd_make_section (abfd, ".bss"); | |
419 | #endif | |
7ed4093a | 420 | |
6db82ea7 SC |
421 | obj_datasec (abfd)->_raw_size = execp->a_data; |
422 | obj_bsssec (abfd)->_raw_size = execp->a_bss; | |
7ed4093a | 423 | |
7ed4093a | 424 | obj_textsec (abfd)->flags = (execp->a_trsize != 0 ? |
d047d16a JG |
425 | (SEC_ALLOC | SEC_LOAD | SEC_CODE | SEC_HAS_CONTENTS | SEC_RELOC) : |
426 | (SEC_ALLOC | SEC_LOAD | SEC_CODE | SEC_HAS_CONTENTS)); | |
7ed4093a | 427 | obj_datasec (abfd)->flags = (execp->a_drsize != 0 ? |
d047d16a JG |
428 | (SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_HAS_CONTENTS | SEC_RELOC) : |
429 | (SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_HAS_CONTENTS)); | |
7ed4093a SC |
430 | obj_bsssec (abfd)->flags = SEC_ALLOC; |
431 | ||
432 | #ifdef THIS_IS_ONLY_DOCUMENTATION | |
98d43107 JG |
433 | /* The common code can't fill in these things because they depend |
434 | on either the start address of the text segment, the rounding | |
435 | up of virtual addersses between segments, or the starting file | |
436 | position of the text segment -- all of which varies among different | |
437 | versions of a.out. */ | |
438 | ||
7ed4093a SC |
439 | /* Call back to the format-dependent code to fill in the rest of the |
440 | fields and do any further cleanup. Things that should be filled | |
441 | in by the callback: */ | |
442 | ||
443 | struct exec *execp = exec_hdr (abfd); | |
444 | ||
98d43107 | 445 | obj_textsec (abfd)->size = N_TXTSIZE(*execp); |
6db82ea7 | 446 | obj_textsec (abfd)->raw_size = N_TXTSIZE(*execp); |
98d43107 JG |
447 | /* data and bss are already filled in since they're so standard */ |
448 | ||
7ed4093a | 449 | /* The virtual memory addresses of the sections */ |
7ed4093a | 450 | obj_textsec (abfd)->vma = N_TXTADDR(*execp); |
98d43107 JG |
451 | obj_datasec (abfd)->vma = N_DATADDR(*execp); |
452 | obj_bsssec (abfd)->vma = N_BSSADDR(*execp); | |
7ed4093a SC |
453 | |
454 | /* The file offsets of the sections */ | |
455 | obj_textsec (abfd)->filepos = N_TXTOFF(*execp); | |
456 | obj_datasec (abfd)->filepos = N_DATOFF(*execp); | |
457 | ||
458 | /* The file offsets of the relocation info */ | |
459 | obj_textsec (abfd)->rel_filepos = N_TRELOFF(*execp); | |
460 | obj_datasec (abfd)->rel_filepos = N_DRELOFF(*execp); | |
461 | ||
462 | /* The file offsets of the string table and symbol table. */ | |
463 | obj_str_filepos (abfd) = N_STROFF (*execp); | |
464 | obj_sym_filepos (abfd) = N_SYMOFF (*execp); | |
465 | ||
7ed4093a SC |
466 | /* Determine the architecture and machine type of the object file. */ |
467 | switch (N_MACHTYPE (*exec_hdr (abfd))) { | |
468 | default: | |
469 | abfd->obj_arch = bfd_arch_obscure; | |
470 | break; | |
471 | } | |
472 | ||
7b02b4ed JG |
473 | adata(abfd)->page_size = PAGE_SIZE; |
474 | adata(abfd)->segment_size = SEGMENT_SIZE; | |
475 | adata(abfd)->exec_bytes_size = EXEC_BYTES_SIZE; | |
476 | ||
7ed4093a SC |
477 | return abfd->xvec; |
478 | ||
479 | /* The architecture is encoded in various ways in various a.out variants, | |
480 | or is not encoded at all in some of them. The relocation size depends | |
481 | on the architecture and the a.out variant. Finally, the return value | |
482 | is the bfd_target vector in use. If an error occurs, return zero and | |
483 | set bfd_error to the appropriate error code. | |
484 | ||
485 | Formats such as b.out, which have additional fields in the a.out | |
486 | header, should cope with them in this callback as well. */ | |
487 | #endif /* DOCUMENTATION */ | |
488 | ||
e6e265ce JG |
489 | result = (*callback_to_real_object_p)(abfd); |
490 | ||
491 | /* Now that the segment addresses have been worked out, take a better | |
492 | guess at whether the file is executable. If the entry point | |
493 | is within the text segment, assume it is. (This makes files | |
494 | executable even if their entry point address is 0, as long as | |
495 | their text starts at zero.) | |
496 | ||
497 | At some point we should probably break down and stat the file and | |
498 | declare it executable if (one of) its 'x' bits are on... */ | |
499 | if ((execp->a_entry >= obj_textsec(abfd)->vma) && | |
6db82ea7 | 500 | (execp->a_entry < obj_textsec(abfd)->vma + obj_textsec(abfd)->_raw_size)) |
e6e265ce | 501 | abfd->flags |= EXEC_P; |
214f8f23 KR |
502 | if (result) |
503 | { | |
1f29e30b | 504 | #if 0 /* These should be set correctly anyways. */ |
214f8f23 KR |
505 | abfd->sections = obj_textsec (abfd); |
506 | obj_textsec (abfd)->next = obj_datasec (abfd); | |
507 | obj_datasec (abfd)->next = obj_bsssec (abfd); | |
1f29e30b | 508 | #endif |
214f8f23 KR |
509 | } |
510 | else | |
511 | { | |
512 | free (rawptr); | |
513 | abfd->tdata.aout_data = oldrawptr; | |
514 | } | |
e6e265ce | 515 | return result; |
7ed4093a SC |
516 | } |
517 | ||
4e41b5aa SC |
518 | /* |
519 | FUNCTION | |
520 | aout_<size>_mkobject | |
6f715d66 | 521 | |
4e41b5aa SC |
522 | DESCRIPTION |
523 | This routine initializes a BFD for use with a.out files. | |
6f715d66 | 524 | |
fa2b89f1 | 525 | SYNOPSIS |
4e41b5aa | 526 | boolean aout_<size>_mkobject, (bfd *); |
6f715d66 | 527 | */ |
7ed4093a SC |
528 | |
529 | boolean | |
530 | DEFUN(NAME(aout,mkobject),(abfd), | |
531 | bfd *abfd) | |
532 | { | |
6db82ea7 | 533 | struct aout_data_struct *rawptr; |
7ed4093a SC |
534 | |
535 | bfd_error = system_call_error; | |
536 | ||
537 | /* Use an intermediate variable for clarity */ | |
6db82ea7 | 538 | rawptr = (struct aout_data_struct *)bfd_zalloc (abfd, sizeof (struct aout_data_struct )); |
7ed4093a SC |
539 | |
540 | if (rawptr == NULL) { | |
541 | bfd_error = no_memory; | |
542 | return false; | |
543 | } | |
544 | ||
6db82ea7 | 545 | abfd->tdata.aout_data = rawptr; |
7ed4093a SC |
546 | exec_hdr (abfd) = &(rawptr->e); |
547 | ||
548 | /* For simplicity's sake we just make all the sections right here. */ | |
549 | ||
550 | obj_textsec (abfd) = (asection *)NULL; | |
551 | obj_datasec (abfd) = (asection *)NULL; | |
552 | obj_bsssec (abfd) = (asection *)NULL; | |
553 | bfd_make_section (abfd, ".text"); | |
554 | bfd_make_section (abfd, ".data"); | |
555 | bfd_make_section (abfd, ".bss"); | |
6db82ea7 SC |
556 | bfd_make_section (abfd, BFD_ABS_SECTION_NAME); |
557 | bfd_make_section (abfd, BFD_UND_SECTION_NAME); | |
558 | bfd_make_section (abfd, BFD_COM_SECTION_NAME); | |
7ed4093a SC |
559 | |
560 | return true; | |
561 | } | |
562 | ||
6f715d66 | 563 | |
4e41b5aa SC |
564 | /* |
565 | FUNCTION | |
566 | aout_<size>_machine_type | |
6f715d66 | 567 | |
4e41b5aa SC |
568 | DESCRIPTION |
569 | Keep track of machine architecture and machine type for | |
570 | a.out's. Return the machine_type for a particular | |
571 | arch&machine, or M_UNKNOWN if that exact arch&machine can't be | |
572 | represented in a.out format. | |
7ed4093a | 573 | |
4e41b5aa SC |
574 | If the architecture is understood, machine type 0 (default) |
575 | should always be understood. | |
6f715d66 | 576 | |
fa2b89f1 | 577 | SYNOPSIS |
4e41b5aa | 578 | enum machine_type aout_<size>_machine_type |
6f715d66 SC |
579 | (enum bfd_architecture arch, |
580 | unsigned long machine)); | |
581 | */ | |
7ed4093a SC |
582 | |
583 | enum machine_type | |
584 | DEFUN(NAME(aout,machine_type),(arch, machine), | |
585 | enum bfd_architecture arch AND | |
586 | unsigned long machine) | |
587 | { | |
588 | enum machine_type arch_flags; | |
589 | ||
590 | arch_flags = M_UNKNOWN; | |
591 | ||
592 | switch (arch) { | |
593 | case bfd_arch_sparc: | |
594 | if (machine == 0) arch_flags = M_SPARC; | |
595 | break; | |
596 | ||
597 | case bfd_arch_m68k: | |
598 | switch (machine) { | |
599 | case 0: arch_flags = M_68010; break; | |
600 | case 68000: arch_flags = M_UNKNOWN; break; | |
601 | case 68010: arch_flags = M_68010; break; | |
602 | case 68020: arch_flags = M_68020; break; | |
603 | default: arch_flags = M_UNKNOWN; break; | |
604 | } | |
605 | break; | |
606 | ||
607 | case bfd_arch_i386: | |
608 | if (machine == 0) arch_flags = M_386; | |
609 | break; | |
610 | ||
611 | case bfd_arch_a29k: | |
612 | if (machine == 0) arch_flags = M_29K; | |
613 | break; | |
614 | ||
5cd3dcff KR |
615 | case bfd_arch_mips: |
616 | switch (machine) { | |
617 | case 0: | |
618 | case 2000: | |
619 | case 3000: arch_flags = M_MIPS1; break; | |
620 | case 4000: | |
621 | case 4400: | |
622 | case 6000: arch_flags = M_MIPS2; break; | |
623 | default: arch_flags = M_UNKNOWN; break; | |
624 | } | |
625 | break; | |
626 | ||
7ed4093a SC |
627 | default: |
628 | arch_flags = M_UNKNOWN; | |
7ed4093a SC |
629 | } |
630 | return arch_flags; | |
631 | } | |
632 | ||
9e2dad8e | 633 | |
4e41b5aa SC |
634 | /* |
635 | FUNCTION | |
636 | aout_<size>_set_arch_mach | |
6f715d66 | 637 | |
4e41b5aa SC |
638 | DESCRIPTION |
639 | Sets the architecture and the machine of the BFD to those | |
640 | values supplied. Verifies that the format can support the | |
641 | architecture required. | |
6f715d66 | 642 | |
fa2b89f1 | 643 | SYNOPSIS |
4e41b5aa | 644 | boolean aout_<size>_set_arch_mach, |
6f715d66 SC |
645 | (bfd *, |
646 | enum bfd_architecture, | |
647 | unsigned long machine)); | |
648 | */ | |
649 | ||
7ed4093a SC |
650 | boolean |
651 | DEFUN(NAME(aout,set_arch_mach),(abfd, arch, machine), | |
652 | bfd *abfd AND | |
653 | enum bfd_architecture arch AND | |
654 | unsigned long machine) | |
655 | { | |
9e2dad8e | 656 | bfd_default_set_arch_mach(abfd, arch, machine); |
7ed4093a SC |
657 | if (arch != bfd_arch_unknown && |
658 | NAME(aout,machine_type) (arch, machine) == M_UNKNOWN) | |
659 | return false; /* We can't represent this type */ | |
ce07dd7c | 660 | |
214f8f23 KR |
661 | /* Determine the size of a relocation entry */ |
662 | switch (arch) { | |
663 | case bfd_arch_sparc: | |
664 | case bfd_arch_a29k: | |
5cd3dcff | 665 | case bfd_arch_mips: |
214f8f23 KR |
666 | obj_reloc_entry_size (abfd) = RELOC_EXT_SIZE; |
667 | break; | |
668 | default: | |
669 | obj_reloc_entry_size (abfd) = RELOC_STD_SIZE; | |
670 | break; | |
671 | } | |
672 | ||
2768b3f7 | 673 | return (*aout_backend_info(abfd)->set_sizes) (abfd); |
7ed4093a | 674 | } |
7ed4093a | 675 | |
ce07dd7c KR |
676 | boolean |
677 | DEFUN (NAME (aout,adjust_sizes_and_vmas), (abfd, text_size, text_end), | |
678 | bfd *abfd AND bfd_size_type *text_size AND file_ptr *text_end) | |
679 | { | |
680 | struct internal_exec *execp = exec_hdr (abfd); | |
681 | if ((obj_textsec (abfd) == NULL) || (obj_datasec (abfd) == NULL)) | |
682 | { | |
683 | bfd_error = invalid_operation; | |
684 | return false; | |
685 | } | |
686 | if (adata(abfd).magic != undecided_magic) return true; | |
687 | obj_textsec(abfd)->_raw_size = | |
688 | align_power(obj_textsec(abfd)->_raw_size, | |
689 | obj_textsec(abfd)->alignment_power); | |
690 | ||
691 | *text_size = obj_textsec (abfd)->_raw_size; | |
692 | /* Rule (heuristic) for when to pad to a new page. Note that there | |
693 | * are (at least) two ways demand-paged (ZMAGIC) files have been | |
694 | * handled. Most Berkeley-based systems start the text segment at | |
695 | * (PAGE_SIZE). However, newer versions of SUNOS start the text | |
696 | * segment right after the exec header; the latter is counted in the | |
697 | * text segment size, and is paged in by the kernel with the rest of | |
698 | * the text. */ | |
699 | ||
700 | /* This perhaps isn't the right way to do this, but made it simpler for me | |
701 | to understand enough to implement it. Better would probably be to go | |
702 | right from BFD flags to alignment/positioning characteristics. But the | |
703 | old code was sloppy enough about handling the flags, and had enough | |
704 | other magic, that it was a little hard for me to understand. I think | |
705 | I understand it better now, but I haven't time to do the cleanup this | |
706 | minute. */ | |
707 | if (adata(abfd).magic == undecided_magic) | |
708 | { | |
709 | if (abfd->flags & D_PAGED) | |
710 | /* whether or not WP_TEXT is set */ | |
711 | adata(abfd).magic = z_magic; | |
712 | else if (abfd->flags & WP_TEXT) | |
713 | adata(abfd).magic = n_magic; | |
714 | else | |
715 | adata(abfd).magic = o_magic; | |
716 | } | |
717 | ||
718 | #ifdef BFD_AOUT_DEBUG /* requires gcc2 */ | |
719 | #if __GNUC__ >= 2 | |
720 | fprintf (stderr, "%s text=<%x,%x,%x> data=<%x,%x,%x> bss=<%x,%x,%x>\n", | |
721 | ({ char *str; | |
722 | switch (adata(abfd).magic) { | |
723 | case n_magic: str = "NMAGIC"; break; | |
724 | case o_magic: str = "OMAGIC"; break; | |
725 | case z_magic: str = "ZMAGIC"; break; | |
726 | default: abort (); | |
727 | } | |
728 | str; | |
729 | }), | |
730 | obj_textsec(abfd)->vma, obj_textsec(abfd)->_raw_size, obj_textsec(abfd)->alignment_power, | |
731 | obj_datasec(abfd)->vma, obj_datasec(abfd)->_raw_size, obj_datasec(abfd)->alignment_power, | |
732 | obj_bsssec(abfd)->vma, obj_bsssec(abfd)->_raw_size, obj_bsssec(abfd)->alignment_power); | |
733 | #endif | |
734 | #endif | |
735 | ||
736 | switch (adata(abfd).magic) | |
737 | { | |
738 | case o_magic: | |
739 | { | |
740 | file_ptr pos = adata (abfd).exec_bytes_size; | |
741 | bfd_vma vma = 0; | |
214f8f23 | 742 | int pad = 0; |
ce07dd7c KR |
743 | |
744 | obj_textsec(abfd)->filepos = pos; | |
745 | pos += obj_textsec(abfd)->_raw_size; | |
746 | vma += obj_textsec(abfd)->_raw_size; | |
747 | if (!obj_datasec(abfd)->user_set_vma) | |
748 | { | |
214f8f23 | 749 | #if 0 /* ?? Does alignment in the file image really matter? */ |
ce07dd7c | 750 | pad = align_power (vma, obj_datasec(abfd)->alignment_power) - vma; |
214f8f23 | 751 | #endif |
ce07dd7c KR |
752 | obj_textsec(abfd)->_raw_size += pad; |
753 | pos += pad; | |
754 | vma += pad; | |
755 | obj_datasec(abfd)->vma = vma; | |
756 | } | |
757 | obj_datasec(abfd)->filepos = pos; | |
758 | pos += obj_datasec(abfd)->_raw_size; | |
759 | vma += obj_datasec(abfd)->_raw_size; | |
760 | if (!obj_bsssec(abfd)->user_set_vma) | |
761 | { | |
214f8f23 | 762 | #if 0 |
ce07dd7c | 763 | pad = align_power (vma, obj_bsssec(abfd)->alignment_power) - vma; |
214f8f23 | 764 | #endif |
ce07dd7c KR |
765 | obj_datasec(abfd)->_raw_size += pad; |
766 | pos += pad; | |
767 | vma += pad; | |
768 | obj_bsssec(abfd)->vma = vma; | |
769 | } | |
770 | obj_bsssec(abfd)->filepos = pos; | |
771 | execp->a_text = obj_textsec(abfd)->_raw_size; | |
772 | execp->a_data = obj_datasec(abfd)->_raw_size; | |
773 | execp->a_bss = obj_bsssec(abfd)->_raw_size; | |
774 | N_SET_MAGIC (*execp, OMAGIC); | |
775 | } | |
776 | break; | |
777 | case z_magic: | |
778 | { | |
779 | bfd_size_type data_pad, text_pad; | |
780 | file_ptr text_end; | |
781 | CONST struct aout_backend_data *abdp; | |
782 | int ztih; | |
783 | bfd_vma data_vma; | |
784 | ||
785 | abdp = aout_backend_info (abfd); | |
786 | ztih = abdp && abdp->text_includes_header; | |
787 | obj_textsec(abfd)->filepos = (ztih | |
788 | ? adata(abfd).exec_bytes_size | |
789 | : adata(abfd).page_size); | |
790 | if (! obj_textsec(abfd)->user_set_vma) | |
791 | /* ?? Do we really need to check for relocs here? */ | |
792 | obj_textsec(abfd)->vma = ((abfd->flags & HAS_RELOC) | |
793 | ? 0 | |
794 | : (ztih | |
795 | ? (abdp->default_text_vma | |
796 | + adata(abfd).exec_bytes_size) | |
797 | : abdp->default_text_vma)); | |
798 | /* Could take strange alignment of text section into account here? */ | |
799 | ||
800 | /* Find start of data. */ | |
801 | text_end = obj_textsec(abfd)->filepos + obj_textsec(abfd)->_raw_size; | |
802 | text_pad = BFD_ALIGN (text_end, adata(abfd).page_size) - text_end; | |
803 | obj_textsec(abfd)->_raw_size += text_pad; | |
804 | text_end += text_pad; | |
805 | ||
806 | if (!obj_datasec(abfd)->user_set_vma) | |
807 | { | |
808 | bfd_vma vma; | |
809 | vma = obj_textsec(abfd)->vma + obj_textsec(abfd)->_raw_size; | |
810 | obj_datasec(abfd)->vma = BFD_ALIGN (vma, adata(abfd).segment_size); | |
811 | } | |
812 | data_vma = obj_datasec(abfd)->vma; | |
813 | if (abdp && abdp->zmagic_mapped_contiguous) | |
814 | { | |
815 | text_pad = (obj_datasec(abfd)->vma | |
816 | - obj_textsec(abfd)->vma | |
817 | - obj_textsec(abfd)->_raw_size); | |
818 | obj_textsec(abfd)->_raw_size += text_pad; | |
819 | } | |
820 | obj_datasec(abfd)->filepos = (obj_textsec(abfd)->filepos | |
821 | + obj_textsec(abfd)->_raw_size); | |
822 | ||
823 | /* Fix up exec header while we're at it. */ | |
824 | execp->a_text = obj_textsec(abfd)->_raw_size; | |
7f90aa8b | 825 | if (ztih && (!abdp || (abdp && !abdp->exec_header_not_counted))) |
ce07dd7c KR |
826 | execp->a_text += adata(abfd).exec_bytes_size; |
827 | N_SET_MAGIC (*execp, ZMAGIC); | |
828 | /* Spec says data section should be rounded up to page boundary. */ | |
829 | /* If extra space in page is left after data section, fudge data | |
830 | in the header so that the bss section looks smaller by that | |
831 | amount. We'll start the bss section there, and lie to the OS. */ | |
832 | obj_datasec(abfd)->_raw_size | |
833 | = align_power (obj_datasec(abfd)->_raw_size, | |
834 | obj_bsssec(abfd)->alignment_power); | |
835 | execp->a_data = BFD_ALIGN (obj_datasec(abfd)->_raw_size, | |
836 | adata(abfd).page_size); | |
837 | data_pad = execp->a_data - obj_datasec(abfd)->_raw_size; | |
a99c3d70 | 838 | |
ce07dd7c KR |
839 | if (!obj_bsssec(abfd)->user_set_vma) |
840 | obj_bsssec(abfd)->vma = (obj_datasec(abfd)->vma | |
841 | + obj_datasec(abfd)->_raw_size); | |
842 | if (data_pad > obj_bsssec(abfd)->_raw_size) | |
843 | execp->a_bss = 0; | |
844 | else | |
845 | execp->a_bss = obj_bsssec(abfd)->_raw_size - data_pad; | |
846 | } | |
847 | break; | |
848 | case n_magic: | |
849 | { | |
ce07dd7c KR |
850 | file_ptr pos = adata(abfd).exec_bytes_size; |
851 | bfd_vma vma = 0; | |
852 | int pad; | |
853 | ||
854 | obj_textsec(abfd)->filepos = pos; | |
855 | if (!obj_textsec(abfd)->user_set_vma) | |
856 | obj_textsec(abfd)->vma = vma; | |
857 | else | |
858 | vma = obj_textsec(abfd)->vma; | |
859 | pos += obj_textsec(abfd)->_raw_size; | |
860 | vma += obj_textsec(abfd)->_raw_size; | |
861 | obj_datasec(abfd)->filepos = pos; | |
862 | if (!obj_datasec(abfd)->user_set_vma) | |
863 | obj_datasec(abfd)->vma = BFD_ALIGN (vma, adata(abfd).segment_size); | |
864 | vma = obj_datasec(abfd)->vma; | |
865 | ||
866 | /* Since BSS follows data immediately, see if it needs alignment. */ | |
867 | vma += obj_datasec(abfd)->_raw_size; | |
868 | pad = align_power (vma, obj_bsssec(abfd)->alignment_power) - vma; | |
869 | obj_datasec(abfd)->_raw_size += pad; | |
870 | pos += obj_datasec(abfd)->_raw_size; | |
871 | ||
872 | if (!obj_bsssec(abfd)->user_set_vma) | |
873 | obj_bsssec(abfd)->vma = vma; | |
874 | else | |
875 | vma = obj_bsssec(abfd)->vma; | |
876 | } | |
877 | execp->a_text = obj_textsec(abfd)->_raw_size; | |
878 | execp->a_data = obj_datasec(abfd)->_raw_size; | |
879 | execp->a_bss = obj_bsssec(abfd)->_raw_size; | |
880 | N_SET_MAGIC (*execp, NMAGIC); | |
881 | break; | |
882 | default: | |
883 | abort (); | |
884 | } | |
885 | #ifdef BFD_AOUT_DEBUG | |
886 | fprintf (stderr, " text=<%x,%x,%x> data=<%x,%x,%x> bss=<%x,%x>\n", | |
887 | obj_textsec(abfd)->vma, obj_textsec(abfd)->_raw_size, obj_textsec(abfd)->filepos, | |
888 | obj_datasec(abfd)->vma, obj_datasec(abfd)->_raw_size, obj_datasec(abfd)->filepos, | |
889 | obj_bsssec(abfd)->vma, obj_bsssec(abfd)->_raw_size); | |
890 | #endif | |
d047d16a | 891 | return true; |
ce07dd7c KR |
892 | } |
893 | ||
4e41b5aa SC |
894 | /* |
895 | FUNCTION | |
fa2b89f1 | 896 | aout_<size>_new_section_hook |
9e2dad8e | 897 | |
4e41b5aa SC |
898 | DESCRIPTION |
899 | Called by the BFD in response to a @code{bfd_make_section} | |
900 | request. | |
901 | ||
fa2b89f1 | 902 | SYNOPSIS |
4e41b5aa | 903 | boolean aout_<size>_new_section_hook, |
9e2dad8e JG |
904 | (bfd *abfd, |
905 | asection *newsect)); | |
6f715d66 | 906 | */ |
7ed4093a | 907 | boolean |
3f7607af | 908 | DEFUN(NAME(aout,new_section_hook),(abfd, newsect), |
9e2dad8e JG |
909 | bfd *abfd AND |
910 | asection *newsect) | |
7ed4093a | 911 | { |
6db82ea7 SC |
912 | /* align to double at least */ |
913 | newsect->alignment_power = bfd_get_arch_info(abfd)->section_align_power; | |
3f7607af | 914 | |
7ed4093a | 915 | |
6db82ea7 SC |
916 | if (bfd_get_format (abfd) == bfd_object) |
917 | { | |
918 | if (obj_textsec(abfd) == NULL && !strcmp(newsect->name, ".text")) { | |
919 | obj_textsec(abfd)= newsect; | |
920 | newsect->target_index = N_TEXT | N_EXT; | |
921 | return true; | |
922 | } | |
7ed4093a | 923 | |
6db82ea7 SC |
924 | if (obj_datasec(abfd) == NULL && !strcmp(newsect->name, ".data")) { |
925 | obj_datasec(abfd) = newsect; | |
926 | newsect->target_index = N_DATA | N_EXT; | |
927 | return true; | |
928 | } | |
7ed4093a | 929 | |
6db82ea7 SC |
930 | if (obj_bsssec(abfd) == NULL && !strcmp(newsect->name, ".bss")) { |
931 | obj_bsssec(abfd) = newsect; | |
932 | newsect->target_index = N_BSS | N_EXT; | |
933 | return true; | |
934 | } | |
935 | ||
936 | } | |
7ed4093a | 937 | |
6db82ea7 SC |
938 | /* We allow more than three sections internally */ |
939 | return true; | |
7ed4093a SC |
940 | } |
941 | ||
942 | boolean | |
9e2dad8e JG |
943 | DEFUN(NAME(aout,set_section_contents),(abfd, section, location, offset, count), |
944 | bfd *abfd AND | |
945 | sec_ptr section AND | |
946 | PTR location AND | |
947 | file_ptr offset AND | |
948 | bfd_size_type count) | |
7ed4093a | 949 | { |
7b02b4ed | 950 | file_ptr text_end; |
7b02b4ed | 951 | bfd_size_type text_size; |
ce07dd7c | 952 | |
7ed4093a | 953 | if (abfd->output_has_begun == false) |
ebd24135 ILT |
954 | { |
955 | if (NAME(aout,adjust_sizes_and_vmas) (abfd, | |
956 | &text_size, | |
957 | &text_end) == false) | |
958 | return false; | |
9e2dad8e | 959 | } |
12e7087f | 960 | |
7ed4093a SC |
961 | /* regardless, once we know what we're doing, we might as well get going */ |
962 | if (section != obj_bsssec(abfd)) | |
963 | { | |
964 | bfd_seek (abfd, section->filepos + offset, SEEK_SET); | |
9e2dad8e | 965 | |
7ed4093a SC |
966 | if (count) { |
967 | return (bfd_write ((PTR)location, 1, count, abfd) == count) ? | |
968 | true : false; | |
969 | } | |
6db82ea7 | 970 | return true; |
7ed4093a SC |
971 | } |
972 | return true; | |
973 | } | |
974 | \f | |
975 | /* Classify stabs symbols */ | |
976 | ||
977 | #define sym_in_text_section(sym) \ | |
9e2dad8e | 978 | (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_TEXT) |
7ed4093a SC |
979 | |
980 | #define sym_in_data_section(sym) \ | |
9e2dad8e | 981 | (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_DATA) |
7ed4093a SC |
982 | |
983 | #define sym_in_bss_section(sym) \ | |
9e2dad8e | 984 | (((sym)->type & (N_ABS | N_TEXT | N_DATA | N_BSS))== N_BSS) |
7ed4093a SC |
985 | |
986 | /* Symbol is undefined if type is N_UNDF|N_EXT and if it has | |
9e2dad8e JG |
987 | zero in the "value" field. Nonzeroes there are fortrancommon |
988 | symbols. */ | |
7ed4093a | 989 | #define sym_is_undefined(sym) \ |
9e2dad8e | 990 | ((sym)->type == (N_UNDF | N_EXT) && (sym)->symbol.value == 0) |
7ed4093a SC |
991 | |
992 | /* Symbol is a global definition if N_EXT is on and if it has | |
9e2dad8e | 993 | a nonzero type field. */ |
7ed4093a | 994 | #define sym_is_global_defn(sym) \ |
9e2dad8e | 995 | (((sym)->type & N_EXT) && (sym)->type & N_TYPE) |
7ed4093a SC |
996 | |
997 | /* Symbol is debugger info if any bits outside N_TYPE or N_EXT | |
9e2dad8e | 998 | are on. */ |
7ed4093a | 999 | #define sym_is_debugger_info(sym) \ |
9e2dad8e | 1000 | ((sym)->type & ~(N_EXT | N_TYPE)) |
7ed4093a SC |
1001 | |
1002 | #define sym_is_fortrancommon(sym) \ | |
9e2dad8e | 1003 | (((sym)->type == (N_EXT)) && (sym)->symbol.value != 0) |
7ed4093a SC |
1004 | |
1005 | /* Symbol is absolute if it has N_ABS set */ | |
1006 | #define sym_is_absolute(sym) \ | |
9e2dad8e | 1007 | (((sym)->type & N_TYPE)== N_ABS) |
7ed4093a SC |
1008 | |
1009 | ||
1010 | #define sym_is_indirect(sym) \ | |
9e2dad8e | 1011 | (((sym)->type & N_ABS)== N_ABS) |
7ed4093a SC |
1012 | |
1013 | /* Only in their own functions for ease of debugging; when sym flags have | |
9e2dad8e JG |
1014 | stabilised these should be inlined into their (single) caller */ |
1015 | ||
7ed4093a | 1016 | static void |
ebd24135 | 1017 | DEFUN (translate_from_native_sym_flags, (sym_pointer, cache_ptr, abfd), |
a99c3d70 JG |
1018 | struct external_nlist *sym_pointer AND |
1019 | aout_symbol_type * cache_ptr AND | |
ebd24135 | 1020 | bfd * abfd) |
9e2dad8e | 1021 | { |
0f213cc2 | 1022 | cache_ptr->symbol.section = 0; |
ebd24135 | 1023 | switch (cache_ptr->type & N_TYPE) |
6db82ea7 | 1024 | { |
ebd24135 ILT |
1025 | case N_SETA: |
1026 | case N_SETT: | |
1027 | case N_SETD: | |
1028 | case N_SETB: | |
1029 | { | |
1030 | char *copy = bfd_alloc (abfd, strlen (cache_ptr->symbol.name) + 1); | |
1031 | asection *section; | |
1032 | asection *into_section; | |
1033 | ||
1034 | arelent_chain *reloc = (arelent_chain *) bfd_alloc (abfd, sizeof (arelent_chain)); | |
1035 | strcpy (copy, cache_ptr->symbol.name); | |
1036 | ||
1037 | /* Make sure that this bfd has a section with the right contructor | |
1038 | name */ | |
1039 | section = bfd_get_section_by_name (abfd, copy); | |
1040 | if (!section) | |
1041 | section = bfd_make_section (abfd, copy); | |
1042 | ||
1043 | /* Build a relocation entry for the constructor */ | |
1044 | switch ((cache_ptr->type & N_TYPE)) | |
a99c3d70 | 1045 | { |
ebd24135 ILT |
1046 | case N_SETA: |
1047 | into_section = &bfd_abs_section; | |
1048 | cache_ptr->type = N_ABS; | |
1049 | break; | |
1050 | case N_SETT: | |
1051 | into_section = (asection *) obj_textsec (abfd); | |
1052 | cache_ptr->type = N_TEXT; | |
1053 | break; | |
1054 | case N_SETD: | |
1055 | into_section = (asection *) obj_datasec (abfd); | |
1056 | cache_ptr->type = N_DATA; | |
1057 | break; | |
1058 | case N_SETB: | |
1059 | into_section = (asection *) obj_bsssec (abfd); | |
1060 | cache_ptr->type = N_BSS; | |
1061 | break; | |
1062 | default: | |
1063 | abort (); | |
1064 | } | |
88dfcd68 | 1065 | |
ebd24135 ILT |
1066 | /* Build a relocation pointing into the constuctor section |
1067 | pointing at the symbol in the set vector specified */ | |
6db82ea7 | 1068 | |
ebd24135 ILT |
1069 | reloc->relent.addend = cache_ptr->symbol.value; |
1070 | cache_ptr->symbol.section = into_section->symbol->section; | |
1071 | reloc->relent.sym_ptr_ptr = into_section->symbol_ptr_ptr; | |
6db82ea7 SC |
1072 | |
1073 | ||
ebd24135 ILT |
1074 | /* We modify the symbol to belong to a section depending upon the |
1075 | name of the symbol - probably __CTOR__ or __DTOR__ but we don't | |
1076 | really care, and add to the size of the section to contain a | |
1077 | pointer to the symbol. Build a reloc entry to relocate to this | |
1078 | symbol attached to this section. */ | |
a99c3d70 | 1079 | |
ebd24135 | 1080 | section->flags = SEC_CONSTRUCTOR; |
a99c3d70 JG |
1081 | |
1082 | ||
ebd24135 ILT |
1083 | section->reloc_count++; |
1084 | section->alignment_power = 2; | |
a99c3d70 | 1085 | |
ebd24135 ILT |
1086 | reloc->next = section->constructor_chain; |
1087 | section->constructor_chain = reloc; | |
1088 | reloc->relent.address = section->_raw_size; | |
1089 | section->_raw_size += sizeof (int *); | |
a99c3d70 | 1090 | |
ebd24135 ILT |
1091 | reloc->relent.howto |
1092 | = (obj_reloc_entry_size(abfd) == RELOC_EXT_SIZE | |
1093 | ? howto_table_ext : howto_table_std) | |
1094 | + CTOR_TABLE_RELOC_IDX; | |
1095 | cache_ptr->symbol.flags |= BSF_CONSTRUCTOR; | |
1096 | } | |
1097 | break; | |
1098 | default: | |
1099 | if (cache_ptr->type == N_WARNING) | |
1100 | { | |
1101 | /* This symbol is the text of a warning message, the next symbol | |
1102 | is the symbol to associate the warning with */ | |
1103 | cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_WARNING; | |
1104 | ||
1105 | /* @@ Stuffing pointers into integers is a no-no. | |
1106 | We can usually get away with it if the integer is | |
1107 | large enough though. */ | |
1108 | if (sizeof (cache_ptr + 1) > sizeof (bfd_vma)) | |
1109 | abort (); | |
1110 | cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1)); | |
1111 | ||
1112 | /* We furgle with the next symbol in place. | |
1113 | We don't want it to be undefined, we'll trample the type */ | |
1114 | (sym_pointer + 1)->e_type[0] = 0xff; | |
a99c3d70 | 1115 | break; |
ebd24135 ILT |
1116 | } |
1117 | if ((cache_ptr->type | N_EXT) == (N_INDR | N_EXT)) | |
1118 | { | |
1119 | /* Two symbols in a row for an INDR message. The first symbol | |
1120 | contains the name we will match, the second symbol contains | |
1121 | the name the first name is translated into. It is supplied to | |
1122 | us undefined. This is good, since we want to pull in any files | |
1123 | which define it */ | |
1124 | cache_ptr->symbol.flags = BSF_DEBUGGING | BSF_INDIRECT; | |
1125 | ||
1126 | /* @@ Stuffing pointers into integers is a no-no. | |
1127 | We can usually get away with it if the integer is | |
1128 | large enough though. */ | |
1129 | if (sizeof (cache_ptr + 1) > sizeof (bfd_vma)) | |
1130 | abort (); | |
1131 | ||
1132 | cache_ptr->symbol.value = (bfd_vma) ((cache_ptr + 1)); | |
1133 | cache_ptr->symbol.section = &bfd_ind_section; | |
1134 | } | |
1135 | ||
1136 | else if (sym_is_debugger_info (cache_ptr)) | |
1137 | { | |
1138 | cache_ptr->symbol.flags = BSF_DEBUGGING; | |
1139 | /* Work out the section correct for this symbol */ | |
1140 | switch (cache_ptr->type & N_TYPE) | |
a99c3d70 | 1141 | { |
ebd24135 ILT |
1142 | case N_TEXT: |
1143 | case N_FN: | |
1144 | cache_ptr->symbol.section = obj_textsec (abfd); | |
1145 | cache_ptr->symbol.value -= obj_textsec (abfd)->vma; | |
a99c3d70 | 1146 | break; |
ebd24135 ILT |
1147 | case N_DATA: |
1148 | cache_ptr->symbol.value -= obj_datasec (abfd)->vma; | |
1149 | cache_ptr->symbol.section = obj_datasec (abfd); | |
1150 | break; | |
1151 | case N_BSS: | |
1152 | cache_ptr->symbol.section = obj_bsssec (abfd); | |
1153 | cache_ptr->symbol.value -= obj_bsssec (abfd)->vma; | |
1154 | break; | |
1155 | default: | |
1156 | case N_ABS: | |
1157 | ||
1158 | cache_ptr->symbol.section = &bfd_abs_section; | |
1159 | break; | |
1160 | } | |
1161 | } | |
1162 | else | |
1163 | { | |
1164 | ||
1165 | if (sym_is_fortrancommon (cache_ptr)) | |
1166 | { | |
1167 | cache_ptr->symbol.flags = 0; | |
1168 | cache_ptr->symbol.section = &bfd_com_section; | |
1169 | } | |
1170 | else | |
1171 | { | |
1172 | ||
1173 | ||
a99c3d70 | 1174 | } |
ebd24135 ILT |
1175 | |
1176 | /* In a.out, the value of a symbol is always relative to the | |
1177 | * start of the file, if this is a data symbol we'll subtract | |
1178 | * the size of the text section to get the section relative | |
1179 | * value. If this is a bss symbol (which would be strange) | |
1180 | * we'll subtract the size of the previous two sections | |
1181 | * to find the section relative address. | |
1182 | */ | |
1183 | ||
1184 | if (sym_in_text_section (cache_ptr)) | |
a99c3d70 | 1185 | { |
ebd24135 ILT |
1186 | cache_ptr->symbol.value -= obj_textsec (abfd)->vma; |
1187 | cache_ptr->symbol.section = obj_textsec (abfd); | |
1188 | } | |
1189 | else if (sym_in_data_section (cache_ptr)) | |
1190 | { | |
1191 | cache_ptr->symbol.value -= obj_datasec (abfd)->vma; | |
1192 | cache_ptr->symbol.section = obj_datasec (abfd); | |
1193 | } | |
1194 | else if (sym_in_bss_section (cache_ptr)) | |
1195 | { | |
1196 | cache_ptr->symbol.section = obj_bsssec (abfd); | |
1197 | cache_ptr->symbol.value -= obj_bsssec (abfd)->vma; | |
1198 | } | |
1199 | else if (sym_is_undefined (cache_ptr)) | |
1200 | { | |
1201 | cache_ptr->symbol.flags = 0; | |
1202 | cache_ptr->symbol.section = &bfd_und_section; | |
1203 | } | |
1204 | else if (sym_is_absolute (cache_ptr)) | |
1205 | { | |
1206 | cache_ptr->symbol.section = &bfd_abs_section; | |
a99c3d70 JG |
1207 | } |
1208 | ||
ebd24135 | 1209 | if (sym_is_global_defn (cache_ptr)) |
a99c3d70 | 1210 | { |
ebd24135 | 1211 | cache_ptr->symbol.flags = BSF_GLOBAL | BSF_EXPORT; |
a99c3d70 JG |
1212 | } |
1213 | else | |
1214 | { | |
ebd24135 | 1215 | cache_ptr->symbol.flags = BSF_LOCAL; |
a99c3d70 | 1216 | } |
7ed4093a | 1217 | } |
a99c3d70 | 1218 | } |
0f213cc2 KR |
1219 | if (cache_ptr->symbol.section == 0) |
1220 | abort (); | |
7ed4093a SC |
1221 | } |
1222 | ||
6db82ea7 SC |
1223 | |
1224 | ||
7ed4093a SC |
1225 | static void |
1226 | DEFUN(translate_to_native_sym_flags,(sym_pointer, cache_ptr, abfd), | |
1227 | struct external_nlist *sym_pointer AND | |
1228 | asymbol *cache_ptr AND | |
1229 | bfd *abfd) | |
1230 | { | |
1231 | bfd_vma value = cache_ptr->value; | |
1232 | ||
10dea9ed DHW |
1233 | /* mask out any existing type bits in case copying from one section |
1234 | to another */ | |
1235 | sym_pointer->e_type[0] &= ~N_TYPE; | |
a99c3d70 | 1236 | |
10dea9ed | 1237 | |
3caa6924 DM |
1238 | /* We attempt to order these tests by decreasing frequency of success, |
1239 | according to tcov when linking the linker. */ | |
1240 | if (bfd_get_output_section(cache_ptr) == &bfd_abs_section) { | |
1241 | sym_pointer->e_type[0] |= N_ABS; | |
1242 | } | |
1243 | else if (bfd_get_output_section(cache_ptr) == obj_textsec (abfd)) { | |
1244 | sym_pointer->e_type[0] |= N_TEXT; | |
a99c3d70 | 1245 | } |
6db82ea7 | 1246 | else if (bfd_get_output_section(cache_ptr) == obj_datasec (abfd)) { |
a99c3d70 JG |
1247 | sym_pointer->e_type[0] |= N_DATA; |
1248 | } | |
3caa6924 DM |
1249 | else if (bfd_get_output_section(cache_ptr) == obj_bsssec (abfd)) { |
1250 | sym_pointer->e_type[0] |= N_BSS; | |
7ed4093a | 1251 | } |
6db82ea7 | 1252 | else if (bfd_get_output_section(cache_ptr) == &bfd_und_section) |
a99c3d70 | 1253 | { |
6db82ea7 | 1254 | sym_pointer->e_type[0] = (N_UNDF | N_EXT); |
a99c3d70 JG |
1255 | } |
1256 | else if (bfd_get_output_section(cache_ptr) == &bfd_ind_section) | |
1257 | { | |
1258 | sym_pointer->e_type[0] = N_INDR; | |
1259 | } | |
1260 | else if (bfd_is_com_section (bfd_get_output_section (cache_ptr))) { | |
1261 | sym_pointer->e_type[0] = (N_UNDF | N_EXT); | |
1262 | } | |
6db82ea7 | 1263 | else { |
a99c3d70 | 1264 | if (cache_ptr->section->output_section) |
e7b4046c SC |
1265 | { |
1266 | ||
1267 | bfd_error_vector.nonrepresentable_section(abfd, | |
1268 | bfd_get_output_section(cache_ptr)->name); | |
1269 | } | |
a99c3d70 | 1270 | else |
e7b4046c SC |
1271 | { |
1272 | bfd_error_vector.nonrepresentable_section(abfd, | |
1273 | cache_ptr->section->name); | |
1274 | ||
1275 | } | |
1276 | ||
a99c3d70 | 1277 | } |
6db82ea7 | 1278 | /* Turn the symbol from section relative to absolute again */ |
7ed4093a | 1279 | |
6db82ea7 SC |
1280 | value += cache_ptr->section->output_section->vma + cache_ptr->section->output_offset ; |
1281 | ||
1282 | ||
1283 | if (cache_ptr->flags & (BSF_WARNING)) { | |
a99c3d70 JG |
1284 | (sym_pointer+1)->e_type[0] = 1; |
1285 | } | |
6db82ea7 | 1286 | |
6db82ea7 | 1287 | if (cache_ptr->flags & BSF_DEBUGGING) { |
34dd8ba3 JG |
1288 | sym_pointer->e_type[0] = ((aout_symbol_type *)cache_ptr)->type; |
1289 | } | |
3caa6924 DM |
1290 | else if (cache_ptr->flags & (BSF_GLOBAL | BSF_EXPORT)) { |
1291 | sym_pointer->e_type[0] |= N_EXT; | |
1292 | } | |
34dd8ba3 JG |
1293 | if (cache_ptr->flags & BSF_CONSTRUCTOR) { |
1294 | int type = ((aout_symbol_type *)cache_ptr)->type; | |
1295 | switch (type) | |
1296 | { | |
1297 | case N_ABS: type = N_SETA; break; | |
1298 | case N_TEXT: type = N_SETT; break; | |
1299 | case N_DATA: type = N_SETD; break; | |
1300 | case N_BSS: type = N_SETB; break; | |
1301 | } | |
1302 | sym_pointer->e_type[0] = type; | |
a99c3d70 | 1303 | } |
6db82ea7 | 1304 | |
7ed4093a SC |
1305 | PUT_WORD(abfd, value, sym_pointer->e_value); |
1306 | } | |
1307 | \f | |
1308 | /* Native-level interface to symbols. */ | |
1309 | ||
1310 | /* We read the symbols into a buffer, which is discarded when this | |
1311 | function exits. We read the strings into a buffer large enough to | |
1312 | hold them all plus all the cached symbol entries. */ | |
1313 | ||
1314 | asymbol * | |
1315 | DEFUN(NAME(aout,make_empty_symbol),(abfd), | |
1316 | bfd *abfd) | |
9e2dad8e JG |
1317 | { |
1318 | aout_symbol_type *new = | |
1319 | (aout_symbol_type *)bfd_zalloc (abfd, sizeof (aout_symbol_type)); | |
1320 | new->symbol.the_bfd = abfd; | |
fa2b89f1 | 1321 | |
9e2dad8e JG |
1322 | return &new->symbol; |
1323 | } | |
7ed4093a SC |
1324 | |
1325 | boolean | |
1326 | DEFUN(NAME(aout,slurp_symbol_table),(abfd), | |
1327 | bfd *abfd) | |
9e2dad8e JG |
1328 | { |
1329 | bfd_size_type symbol_size; | |
1330 | bfd_size_type string_size; | |
1331 | unsigned char string_chars[BYTES_IN_WORD]; | |
1332 | struct external_nlist *syms; | |
1333 | char *strings; | |
1334 | aout_symbol_type *cached; | |
0f213cc2 | 1335 | |
9e2dad8e JG |
1336 | /* If there's no work to be done, don't do any */ |
1337 | if (obj_aout_symbols (abfd) != (aout_symbol_type *)NULL) return true; | |
1338 | symbol_size = exec_hdr(abfd)->a_syms; | |
0f213cc2 KR |
1339 | if (symbol_size == 0) |
1340 | { | |
1341 | bfd_error = no_symbols; | |
1342 | return false; | |
1343 | } | |
1344 | ||
9e2dad8e JG |
1345 | bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET); |
1346 | if (bfd_read ((PTR)string_chars, BYTES_IN_WORD, 1, abfd) != BYTES_IN_WORD) | |
1347 | return false; | |
1348 | string_size = GET_WORD (abfd, string_chars); | |
0f213cc2 | 1349 | |
9e2dad8e JG |
1350 | strings =(char *) bfd_alloc(abfd, string_size + 1); |
1351 | cached = (aout_symbol_type *) | |
1352 | bfd_zalloc(abfd, (bfd_size_type)(bfd_get_symcount (abfd) * sizeof(aout_symbol_type))); | |
1353 | ||
1354 | /* malloc this, so we can free it if simply. The symbol caching | |
1355 | might want to allocate onto the bfd's obstack */ | |
98d43107 | 1356 | syms = (struct external_nlist *) bfd_xmalloc(symbol_size); |
9e2dad8e | 1357 | bfd_seek (abfd, obj_sym_filepos (abfd), SEEK_SET); |
0f213cc2 KR |
1358 | if (bfd_read ((PTR)syms, 1, symbol_size, abfd) != symbol_size) |
1359 | { | |
1360 | bailout: | |
1361 | if (syms) | |
1362 | free (syms); | |
1363 | if (cached) | |
1364 | bfd_release (abfd, cached); | |
1365 | if (strings) | |
1366 | bfd_release (abfd, strings); | |
1367 | return false; | |
1368 | } | |
1369 | ||
9e2dad8e | 1370 | bfd_seek (abfd, obj_str_filepos (abfd), SEEK_SET); |
0f213cc2 | 1371 | if (bfd_read ((PTR)strings, 1, string_size, abfd) != string_size) |
9e2dad8e | 1372 | { |
0f213cc2 | 1373 | goto bailout; |
9e2dad8e | 1374 | } |
0f213cc2 KR |
1375 | strings[string_size] = 0; /* Just in case. */ |
1376 | ||
1377 | /* OK, now walk the new symtable, cacheing symbol properties */ | |
1378 | { | |
1379 | register struct external_nlist *sym_pointer; | |
0f213cc2 KR |
1380 | register struct external_nlist *sym_end = syms + bfd_get_symcount (abfd); |
1381 | register aout_symbol_type *cache_ptr = cached; | |
1382 | ||
1383 | /* Run through table and copy values */ | |
1384 | for (sym_pointer = syms, cache_ptr = cached; | |
1385 | sym_pointer < sym_end; sym_pointer ++, cache_ptr++) | |
1386 | { | |
1387 | long x = GET_WORD(abfd, sym_pointer->e_strx); | |
1388 | cache_ptr->symbol.the_bfd = abfd; | |
1389 | if (x == 0) | |
1390 | cache_ptr->symbol.name = ""; | |
1391 | else if (x >= 0 && x < string_size) | |
1392 | cache_ptr->symbol.name = x + strings; | |
1393 | else | |
1394 | goto bailout; | |
1395 | ||
1396 | cache_ptr->symbol.value = GET_SWORD(abfd, sym_pointer->e_value); | |
1397 | cache_ptr->desc = bfd_h_get_16(abfd, sym_pointer->e_desc); | |
1398 | cache_ptr->other = bfd_h_get_8(abfd, sym_pointer->e_other); | |
1399 | cache_ptr->type = bfd_h_get_8(abfd, sym_pointer->e_type); | |
1400 | cache_ptr->symbol.udata = 0; | |
ebd24135 | 1401 | translate_from_native_sym_flags (sym_pointer, cache_ptr, abfd); |
0f213cc2 KR |
1402 | } |
1403 | } | |
1404 | ||
9e2dad8e JG |
1405 | obj_aout_symbols (abfd) = cached; |
1406 | free((PTR)syms); | |
0f213cc2 | 1407 | |
9e2dad8e JG |
1408 | return true; |
1409 | } | |
7ed4093a | 1410 | |
0f213cc2 KR |
1411 | \f |
1412 | /* Possible improvements: | |
1413 | + look for strings matching trailing substrings of other strings | |
1414 | + better data structures? balanced trees? | |
1415 | + smaller per-string or per-symbol data? re-use some of the symbol's | |
1416 | data fields? | |
1417 | + also look at reducing memory use elsewhere -- maybe if we didn't have to | |
1418 | construct the entire symbol table at once, we could get by with smaller | |
1419 | amounts of VM? (What effect does that have on the string table | |
1420 | reductions?) | |
1421 | + rip this out of here, put it into its own file in bfd or libiberty, so | |
1422 | coff and elf can use it too. I'll work on this soon, but have more | |
1423 | pressing tasks right now. | |
1424 | ||
1425 | A hash table might(?) be more efficient for handling exactly the cases that | |
1426 | are handled now, but for trailing substring matches, I think we want to | |
1427 | examine the `nearest' values (reverse-)lexically, not merely impose a strict | |
1428 | order, nor look only for exact-match or not-match. I don't think a hash | |
1429 | table would be very useful for that, and I don't feel like fleshing out two | |
1430 | completely different implementations. [raeburn:930419.0331EDT] */ | |
1431 | ||
0f213cc2 KR |
1432 | struct stringtab_entry { |
1433 | /* Hash value for this string. Only useful so long as we aren't doing | |
1434 | substring matches. */ | |
3caa6924 | 1435 | unsigned int hash; |
0f213cc2 KR |
1436 | |
1437 | /* Next node to look at, depending on whether the hash value of the string | |
1438 | being searched for is less than or greater than the hash value of the | |
1439 | current node. For now, `equal to' is lumped in with `greater than', for | |
1440 | space efficiency. It's not a common enough case to warrant another field | |
1441 | to be used for all nodes. */ | |
1442 | struct stringtab_entry *less; | |
1443 | struct stringtab_entry *greater; | |
1444 | ||
1445 | /* The string itself. */ | |
1446 | CONST char *string; | |
1447 | ||
1448 | /* The index allocated for this string. */ | |
1449 | bfd_size_type index; | |
1450 | ||
1451 | #ifdef GATHER_STATISTICS | |
1452 | /* How many references have there been to this string? (Not currently used; | |
1453 | could be dumped out for anaylsis, if anyone's interested.) */ | |
1454 | unsigned long count; | |
1455 | #endif | |
1456 | ||
1457 | /* Next node in linked list, in suggested output order. */ | |
1458 | struct stringtab_entry *next_to_output; | |
1459 | }; | |
1460 | ||
1461 | struct stringtab_data { | |
1462 | /* Tree of string table entries. */ | |
1463 | struct stringtab_entry *strings; | |
1464 | ||
1465 | /* Fudge factor used to center top node of tree. */ | |
1466 | int hash_zero; | |
1467 | ||
1468 | /* Next index value to issue. */ | |
1469 | bfd_size_type index; | |
1470 | ||
1471 | /* Index used for empty strings. Cached here because checking for them | |
1472 | is really easy, and we can avoid searching the tree. */ | |
1473 | bfd_size_type empty_string_index; | |
1474 | ||
1475 | /* These fields indicate the two ends of a singly-linked list that indicates | |
1476 | the order strings should be written out in. Use this order, and no | |
1477 | seeking will need to be done, so output efficiency should be maximized. */ | |
1478 | struct stringtab_entry **end; | |
1479 | struct stringtab_entry *output_order; | |
1480 | ||
1481 | #ifdef GATHER_STATISTICS | |
1482 | /* Number of strings which duplicate strings already in the table. */ | |
1483 | unsigned long duplicates; | |
1484 | ||
1485 | /* Number of bytes saved by not having to write all the duplicate strings. */ | |
1486 | unsigned long bytes_saved; | |
1487 | ||
1488 | /* Number of zero-length strings. Currently, these all turn into | |
1489 | references to the null byte at the end of the first string. In some | |
1490 | cases (possibly not all? explore this...), it should be possible to | |
1491 | simply write out a zero index value. */ | |
1492 | unsigned long empty_strings; | |
1493 | ||
1494 | /* Number of times the hash values matched but the strings were different. | |
1495 | Note that this includes the number of times the other string(s) occurs, so | |
1496 | there may only be two strings hashing to the same value, even if this | |
1497 | number is very large. */ | |
1498 | unsigned long bad_hash_matches; | |
1499 | ||
1500 | /* Null strings aren't counted in this one. | |
1501 | This will probably only be nonzero if we've got an input file | |
1502 | which was produced by `ld -r' (i.e., it's already been processed | |
1503 | through this code). Under some operating systems, native tools | |
1504 | may make all empty strings have the same index; but the pointer | |
1505 | check won't catch those, because to get to that stage we'd already | |
1506 | have to compute the checksum, which requires reading the string, | |
1507 | so we short-circuit that case with empty_string_index above. */ | |
1508 | unsigned long pointer_matches; | |
1509 | ||
1510 | /* Number of comparisons done. I figure with the algorithms in use below, | |
1511 | the average number of comparisons done (per symbol) should be roughly | |
1512 | log-base-2 of the number of unique strings. */ | |
1513 | unsigned long n_compares; | |
1514 | #endif | |
1515 | }; | |
1516 | ||
1517 | /* Some utility functions for the string table code. */ | |
1518 | ||
3caa6924 DM |
1519 | /* For speed, only hash on the first this many bytes of strings. |
1520 | This number was chosen by profiling ld linking itself, with -g. */ | |
1521 | #define HASHMAXLEN 25 | |
1522 | ||
1523 | #define HASH_CHAR(c) (sum ^= sum >> 20, sum ^= sum << 7, sum += (c)) | |
1524 | ||
1525 | static INLINE unsigned int | |
1526 | hash (string, len) | |
1527 | unsigned char *string; | |
1528 | register unsigned int len; | |
0f213cc2 | 1529 | { |
3caa6924 DM |
1530 | register unsigned int sum = 0; |
1531 | ||
1532 | if (len > HASHMAXLEN) | |
0f213cc2 | 1533 | { |
3caa6924 DM |
1534 | HASH_CHAR (len); |
1535 | len = HASHMAXLEN; | |
1536 | } | |
1537 | ||
1538 | while (len--) | |
1539 | { | |
1540 | HASH_CHAR (*string++); | |
0f213cc2 KR |
1541 | } |
1542 | return sum; | |
1543 | } | |
1544 | ||
1545 | static INLINE void | |
1546 | stringtab_init (tab) | |
1547 | struct stringtab_data *tab; | |
1548 | { | |
1549 | tab->strings = 0; | |
1550 | tab->output_order = 0; | |
1551 | tab->end = &tab->output_order; | |
1552 | ||
1553 | /* Initial string table length includes size of length field. */ | |
1554 | tab->index = BYTES_IN_WORD; | |
1555 | tab->empty_string_index = -1; | |
1556 | #ifdef GATHER_STATISTICS | |
1557 | tab->duplicates = 0; | |
1558 | tab->empty_strings = 0; | |
1559 | tab->bad_hash_matches = 0; | |
1560 | tab->pointer_matches = 0; | |
1561 | tab->bytes_saved = 0; | |
1562 | tab->n_compares = 0; | |
1563 | #endif | |
1564 | } | |
1565 | ||
1566 | static INLINE int | |
1567 | compare (entry, str, hash) | |
1568 | struct stringtab_entry *entry; | |
1569 | CONST char *str; | |
3caa6924 | 1570 | unsigned int hash; |
0f213cc2 | 1571 | { |
3caa6924 | 1572 | return hash - entry->hash; |
0f213cc2 KR |
1573 | } |
1574 | ||
1575 | #ifdef GATHER_STATISTICS | |
1576 | /* Don't want to have to link in math library with all bfd applications... */ | |
1577 | static INLINE double | |
1578 | log2 (num) | |
1579 | int num; | |
1580 | { | |
1581 | double d = num; | |
1582 | #if defined (__i386__) && __GNUC__ >= 2 | |
1583 | asm ("fyl2x" : "=t" (d) : "0" (d), "u" (1.0)); | |
1584 | return d; | |
1585 | #else | |
1586 | int n = 0; | |
1587 | while (d >= 2.0) | |
1588 | n++, d /= 2.0; | |
1589 | return ((d > 1.41) ? 0.5 : 0) + n; | |
1590 | #endif | |
1591 | } | |
1592 | #endif | |
1593 | ||
1594 | /* Main string table routines. */ | |
1595 | /* Returns index in string table. Whether or not this actually adds an | |
1596 | entry into the string table should be irrelevant -- it just has to | |
1597 | return a valid index. */ | |
1598 | static bfd_size_type | |
1599 | add_to_stringtab (abfd, str, tab, check) | |
1600 | bfd *abfd; | |
1601 | CONST char *str; | |
1602 | struct stringtab_data *tab; | |
1603 | int check; | |
1604 | { | |
1605 | struct stringtab_entry **ep; | |
3caa6924 DM |
1606 | register struct stringtab_entry *entry; |
1607 | unsigned int hashval, len; | |
0f213cc2 KR |
1608 | |
1609 | if (str[0] == 0) | |
1610 | { | |
1611 | bfd_size_type index; | |
1612 | CONST bfd_size_type minus_one = -1; | |
1613 | ||
1614 | #ifdef GATHER_STATISTICS | |
1615 | tab->empty_strings++; | |
1616 | #endif | |
1617 | index = tab->empty_string_index; | |
1618 | if (index != minus_one) | |
1619 | { | |
1620 | got_empty: | |
1621 | #ifdef GATHER_STATISTICS | |
1622 | tab->bytes_saved++; | |
1623 | tab->duplicates++; | |
1624 | #endif | |
1625 | return index; | |
1626 | } | |
1627 | ||
1628 | /* Need to find it. */ | |
1629 | entry = tab->strings; | |
1630 | if (entry) | |
1631 | { | |
1632 | index = entry->index + strlen (entry->string); | |
1633 | tab->empty_string_index = index; | |
1634 | goto got_empty; | |
1635 | } | |
1636 | len = 0; | |
1637 | } | |
1638 | else | |
1639 | len = strlen (str); | |
1640 | ||
1641 | /* The hash_zero value is chosen such that the first symbol gets a value of | |
1642 | zero. With a balanced tree, this wouldn't be very useful, but without it, | |
1643 | we might get a more even split at the top level, instead of skewing it | |
1644 | badly should hash("/usr/lib/crt0.o") (or whatever) be far from zero. */ | |
3caa6924 | 1645 | hashval = hash (str, len) ^ tab->hash_zero; |
0f213cc2 KR |
1646 | ep = &tab->strings; |
1647 | if (!*ep) | |
1648 | { | |
1649 | tab->hash_zero = hashval; | |
1650 | hashval = 0; | |
1651 | goto add_it; | |
1652 | } | |
1653 | ||
1654 | while (*ep) | |
1655 | { | |
3caa6924 DM |
1656 | register int cmp; |
1657 | ||
0f213cc2 KR |
1658 | entry = *ep; |
1659 | #ifdef GATHER_STATISTICS | |
1660 | tab->n_compares++; | |
1661 | #endif | |
1662 | cmp = compare (entry, str, hashval); | |
3caa6924 DM |
1663 | /* The not-equal cases are more frequent, so check them first. */ |
1664 | if (cmp > 0) | |
1665 | ep = &entry->greater; | |
1666 | else if (cmp < 0) | |
1667 | ep = &entry->less; | |
1668 | else | |
0f213cc2 KR |
1669 | { |
1670 | if (entry->string == str) | |
1671 | { | |
1672 | #ifdef GATHER_STATISTICS | |
1673 | tab->pointer_matches++; | |
1674 | #endif | |
1675 | goto match; | |
1676 | } | |
3caa6924 DM |
1677 | /* Compare the first bytes to save a function call if they |
1678 | don't match. */ | |
1679 | if (entry->string[0] == str[0] && !strcmp (entry->string, str)) | |
0f213cc2 KR |
1680 | { |
1681 | match: | |
1682 | #ifdef GATHER_STATISTICS | |
1683 | entry->count++; | |
1684 | tab->bytes_saved += len + 1; | |
1685 | tab->duplicates++; | |
1686 | #endif | |
1687 | /* If we're in the linker, and the new string is from a new | |
1688 | input file which might have already had these reductions | |
1689 | run over it, we want to keep the new string pointer. I | |
1690 | don't think we're likely to see any (or nearly as many, | |
1691 | at least) cases where a later string is in the same location | |
1692 | as an earlier one rather than this one. */ | |
1693 | entry->string = str; | |
1694 | return entry->index; | |
1695 | } | |
1696 | #ifdef GATHER_STATISTICS | |
1697 | tab->bad_hash_matches++; | |
1698 | #endif | |
1699 | ep = &entry->greater; | |
1700 | } | |
0f213cc2 KR |
1701 | } |
1702 | ||
1703 | /* If we get here, nothing that's in the table already matched. | |
1704 | EP points to the `next' field at the end of the chain; stick a | |
1705 | new entry on here. */ | |
1706 | add_it: | |
3caa6924 DM |
1707 | entry = (struct stringtab_entry *) |
1708 | bfd_alloc_by_size_t (abfd, sizeof (struct stringtab_entry)); | |
0f213cc2 KR |
1709 | |
1710 | entry->less = entry->greater = 0; | |
1711 | entry->hash = hashval; | |
1712 | entry->index = tab->index; | |
1713 | entry->string = str; | |
1714 | entry->next_to_output = 0; | |
1715 | #ifdef GATHER_STATISTICS | |
1716 | entry->count = 1; | |
1717 | #endif | |
1718 | ||
1719 | assert (*tab->end == 0); | |
1720 | *(tab->end) = entry; | |
1721 | tab->end = &entry->next_to_output; | |
1722 | assert (*tab->end == 0); | |
1723 | ||
1724 | { | |
1725 | tab->index += len + 1; | |
1726 | if (len == 0) | |
1727 | tab->empty_string_index = entry->index; | |
1728 | } | |
1729 | assert (*ep == 0); | |
1730 | *ep = entry; | |
1731 | return entry->index; | |
1732 | } | |
1733 | ||
1734 | static void | |
1735 | emit_strtab (abfd, tab) | |
1736 | bfd *abfd; | |
1737 | struct stringtab_data *tab; | |
1738 | { | |
1739 | struct stringtab_entry *entry; | |
1740 | #ifdef GATHER_STATISTICS | |
1741 | int count = 0; | |
1742 | #endif | |
1743 | ||
1744 | /* Be sure to put string length into correct byte ordering before writing | |
1745 | it out. */ | |
1746 | char buffer[BYTES_IN_WORD]; | |
1747 | ||
1748 | PUT_WORD (abfd, tab->index, (unsigned char *) buffer); | |
1749 | bfd_write ((PTR) buffer, 1, BYTES_IN_WORD, abfd); | |
1750 | ||
1751 | for (entry = tab->output_order; entry; entry = entry->next_to_output) | |
1752 | { | |
1753 | bfd_write ((PTR) entry->string, 1, strlen (entry->string) + 1, abfd); | |
1754 | #ifdef GATHER_STATISTICS | |
1755 | count++; | |
1756 | #endif | |
1757 | } | |
1758 | ||
1759 | #ifdef GATHER_STATISTICS | |
1760 | /* Short form only, for now. | |
1761 | To do: Specify output file. Conditionalize on environment? Detailed | |
1762 | analysis if desired. */ | |
1763 | { | |
1764 | int n_syms = bfd_get_symcount (abfd); | |
1765 | ||
1766 | fprintf (stderr, "String table data for output file:\n"); | |
1767 | fprintf (stderr, " %8d symbols output\n", n_syms); | |
1768 | fprintf (stderr, " %8d duplicate strings\n", tab->duplicates); | |
1769 | fprintf (stderr, " %8d empty strings\n", tab->empty_strings); | |
1770 | fprintf (stderr, " %8d unique strings output\n", count); | |
1771 | fprintf (stderr, " %8d pointer matches\n", tab->pointer_matches); | |
1772 | fprintf (stderr, " %8d bytes saved\n", tab->bytes_saved); | |
1773 | fprintf (stderr, " %8d bad hash matches\n", tab->bad_hash_matches); | |
1774 | fprintf (stderr, " %8d hash-val comparisons\n", tab->n_compares); | |
1775 | if (n_syms) | |
1776 | { | |
1777 | double n_compares = tab->n_compares; | |
1778 | double avg_compares = n_compares / n_syms; | |
1779 | /* The second value here should usually be near one. */ | |
3caa6924 DM |
1780 | fprintf (stderr, |
1781 | "\t average %f comparisons per symbol (%f * log2 nstrings)\n", | |
0f213cc2 KR |
1782 | avg_compares, avg_compares / log2 (count)); |
1783 | } | |
1784 | } | |
1785 | #endif | |
1786 | ||
1787 | /* Old code: | |
1788 | unsigned int count; | |
1789 | generic = bfd_get_outsymbols(abfd); | |
1790 | for (count = 0; count < bfd_get_symcount(abfd); count++) | |
1791 | { | |
1792 | asymbol *g = *(generic++); | |
1793 | ||
1794 | if (g->name) | |
1795 | { | |
1796 | size_t length = strlen(g->name)+1; | |
1797 | bfd_write((PTR)g->name, 1, length, abfd); | |
1798 | } | |
1799 | g->KEEPIT = (KEEPITTYPE) count; | |
1800 | } */ | |
1801 | } | |
7ed4093a SC |
1802 | |
1803 | void | |
1804 | DEFUN(NAME(aout,write_syms),(abfd), | |
1805 | bfd *abfd) | |
0f213cc2 KR |
1806 | { |
1807 | unsigned int count ; | |
1808 | asymbol **generic = bfd_get_outsymbols (abfd); | |
1809 | struct stringtab_data strtab; | |
1810 | ||
1811 | stringtab_init (&strtab); | |
1812 | ||
1813 | for (count = 0; count < bfd_get_symcount (abfd); count++) | |
1814 | { | |
7ed4093a SC |
1815 | asymbol *g = generic[count]; |
1816 | struct external_nlist nsp; | |
6db82ea7 | 1817 | |
0f213cc2 KR |
1818 | if (g->name) |
1819 | PUT_WORD (abfd, add_to_stringtab (abfd, g->name, &strtab), | |
1820 | (unsigned char *) nsp.e_strx); | |
1821 | else | |
1822 | PUT_WORD (abfd, 0, (unsigned char *)nsp.e_strx); | |
6db82ea7 | 1823 | |
0f213cc2 KR |
1824 | if (bfd_asymbol_flavour(g) == abfd->xvec->flavour) |
1825 | { | |
1826 | bfd_h_put_16(abfd, aout_symbol(g)->desc, nsp.e_desc); | |
1827 | bfd_h_put_8(abfd, aout_symbol(g)->other, nsp.e_other); | |
1828 | bfd_h_put_8(abfd, aout_symbol(g)->type, nsp.e_type); | |
1829 | } | |
7ed4093a | 1830 | else |
0f213cc2 KR |
1831 | { |
1832 | bfd_h_put_16(abfd,0, nsp.e_desc); | |
1833 | bfd_h_put_8(abfd, 0, nsp.e_other); | |
1834 | bfd_h_put_8(abfd, 0, nsp.e_type); | |
1835 | } | |
7b02b4ed | 1836 | |
7d003262 | 1837 | translate_to_native_sym_flags (&nsp, g, abfd); |
7b02b4ed JG |
1838 | |
1839 | bfd_write((PTR)&nsp,1,EXTERNAL_NLIST_SIZE, abfd); | |
7ed4093a | 1840 | |
0f213cc2 KR |
1841 | /* NB: `KEEPIT' currently overlays `flags', so set this only |
1842 | here, at the end. */ | |
1843 | g->KEEPIT = count; | |
1844 | } | |
7ed4093a | 1845 | |
0f213cc2 KR |
1846 | emit_strtab (abfd, &strtab); |
1847 | } | |
7ed4093a | 1848 | |
0f213cc2 | 1849 | \f |
7ed4093a SC |
1850 | unsigned int |
1851 | DEFUN(NAME(aout,get_symtab),(abfd, location), | |
1852 | bfd *abfd AND | |
1853 | asymbol **location) | |
3f7607af | 1854 | { |
7ed4093a SC |
1855 | unsigned int counter = 0; |
1856 | aout_symbol_type *symbase; | |
ce07dd7c | 1857 | |
7ed4093a | 1858 | if (!NAME(aout,slurp_symbol_table)(abfd)) return 0; |
ce07dd7c | 1859 | |
7ed4093a SC |
1860 | for (symbase = obj_aout_symbols(abfd); counter++ < bfd_get_symcount (abfd);) |
1861 | *(location++) = (asymbol *)( symbase++); | |
1862 | *location++ =0; | |
ce07dd7c | 1863 | return bfd_get_symcount (abfd); |
3f7607af | 1864 | } |
7ed4093a SC |
1865 | |
1866 | \f | |
1867 | /* Standard reloc stuff */ | |
1868 | /* Output standard relocation information to a file in target byte order. */ | |
1869 | ||
1870 | void | |
1871 | DEFUN(NAME(aout,swap_std_reloc_out),(abfd, g, natptr), | |
1872 | bfd *abfd AND | |
1873 | arelent *g AND | |
1874 | struct reloc_std_external *natptr) | |
3f7607af | 1875 | { |
6db82ea7 SC |
1876 | int r_index; |
1877 | asymbol *sym = *(g->sym_ptr_ptr); | |
1878 | int r_extern; | |
1879 | unsigned int r_length; | |
1880 | int r_pcrel; | |
1881 | int r_baserel, r_jmptable, r_relative; | |
1882 | unsigned int r_addend; | |
1883 | asection *output_section = sym->section->output_section; | |
ce07dd7c | 1884 | |
6db82ea7 | 1885 | PUT_WORD(abfd, g->address, natptr->r_address); |
ce07dd7c | 1886 | |
6db82ea7 SC |
1887 | r_length = g->howto->size ; /* Size as a power of two */ |
1888 | r_pcrel = (int) g->howto->pc_relative; /* Relative to PC? */ | |
1889 | /* r_baserel, r_jmptable, r_relative??? FIXME-soon */ | |
1890 | r_baserel = 0; | |
1891 | r_jmptable = 0; | |
1892 | r_relative = 0; | |
7ed4093a | 1893 | |
6db82ea7 | 1894 | r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma; |
7ed4093a | 1895 | |
6db82ea7 SC |
1896 | /* name was clobbered by aout_write_syms to be symbol index */ |
1897 | ||
2768b3f7 SC |
1898 | /* If this relocation is relative to a symbol then set the |
1899 | r_index to the symbols index, and the r_extern bit. | |
1900 | ||
1901 | Absolute symbols can come in in two ways, either as an offset | |
1902 | from the abs section, or as a symbol which has an abs value. | |
1903 | check for that here | |
1904 | */ | |
1905 | ||
1906 | ||
382f2a3d | 1907 | if (bfd_is_com_section (output_section) |
ce07dd7c KR |
1908 | || output_section == &bfd_abs_section |
1909 | || output_section == &bfd_und_section) | |
1910 | { | |
2768b3f7 SC |
1911 | if (bfd_abs_section.symbol == sym) |
1912 | { | |
1913 | /* Whoops, looked like an abs symbol, but is really an offset | |
1914 | from the abs section */ | |
1915 | r_index = 0; | |
1916 | r_extern = 0; | |
1917 | } | |
1918 | else | |
1919 | { | |
1920 | /* Fill in symbol */ | |
1921 | r_extern = 1; | |
1922 | r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT); | |
1923 | ||
1924 | } | |
ce07dd7c | 1925 | } |
6db82ea7 | 1926 | else |
ce07dd7c KR |
1927 | { |
1928 | /* Just an ordinary section */ | |
1929 | r_extern = 0; | |
1930 | r_index = output_section->target_index; | |
1931 | } | |
1932 | ||
6db82ea7 SC |
1933 | /* now the fun stuff */ |
1934 | if (abfd->xvec->header_byteorder_big_p != false) { | |
7ed4093a SC |
1935 | natptr->r_index[0] = r_index >> 16; |
1936 | natptr->r_index[1] = r_index >> 8; | |
1937 | natptr->r_index[2] = r_index; | |
1938 | natptr->r_type[0] = | |
6db82ea7 SC |
1939 | (r_extern? RELOC_STD_BITS_EXTERN_BIG: 0) |
1940 | | (r_pcrel? RELOC_STD_BITS_PCREL_BIG: 0) | |
1941 | | (r_baserel? RELOC_STD_BITS_BASEREL_BIG: 0) | |
1942 | | (r_jmptable? RELOC_STD_BITS_JMPTABLE_BIG: 0) | |
1943 | | (r_relative? RELOC_STD_BITS_RELATIVE_BIG: 0) | |
1944 | | (r_length << RELOC_STD_BITS_LENGTH_SH_BIG); | |
7ed4093a | 1945 | } else { |
6db82ea7 SC |
1946 | natptr->r_index[2] = r_index >> 16; |
1947 | natptr->r_index[1] = r_index >> 8; | |
1948 | natptr->r_index[0] = r_index; | |
1949 | natptr->r_type[0] = | |
1950 | (r_extern? RELOC_STD_BITS_EXTERN_LITTLE: 0) | |
7ed4093a | 1951 | | (r_pcrel? RELOC_STD_BITS_PCREL_LITTLE: 0) |
6db82ea7 SC |
1952 | | (r_baserel? RELOC_STD_BITS_BASEREL_LITTLE: 0) |
1953 | | (r_jmptable? RELOC_STD_BITS_JMPTABLE_LITTLE: 0) | |
1954 | | (r_relative? RELOC_STD_BITS_RELATIVE_LITTLE: 0) | |
1955 | | (r_length << RELOC_STD_BITS_LENGTH_SH_LITTLE); | |
1956 | } | |
3f7607af | 1957 | } |
7ed4093a SC |
1958 | |
1959 | ||
1960 | /* Extended stuff */ | |
1961 | /* Output extended relocation information to a file in target byte order. */ | |
1962 | ||
1963 | void | |
1964 | DEFUN(NAME(aout,swap_ext_reloc_out),(abfd, g, natptr), | |
1965 | bfd *abfd AND | |
1966 | arelent *g AND | |
1967 | register struct reloc_ext_external *natptr) | |
3f7607af | 1968 | { |
6db82ea7 SC |
1969 | int r_index; |
1970 | int r_extern; | |
1971 | unsigned int r_type; | |
1972 | unsigned int r_addend; | |
1973 | asymbol *sym = *(g->sym_ptr_ptr); | |
1974 | asection *output_section = sym->section->output_section; | |
1975 | ||
1976 | PUT_WORD (abfd, g->address, natptr->r_address); | |
7ed4093a | 1977 | |
6db82ea7 | 1978 | r_type = (unsigned int) g->howto->type; |
7ed4093a | 1979 | |
6db82ea7 | 1980 | r_addend = g->addend + (*(g->sym_ptr_ptr))->section->output_section->vma; |
7ed4093a | 1981 | |
7ed4093a | 1982 | |
2768b3f7 SC |
1983 | /* If this relocation is relative to a symbol then set the |
1984 | r_index to the symbols index, and the r_extern bit. | |
1985 | ||
1986 | Absolute symbols can come in in two ways, either as an offset | |
1987 | from the abs section, or as a symbol which has an abs value. | |
1988 | check for that here | |
1989 | */ | |
1990 | ||
382f2a3d | 1991 | if (bfd_is_com_section (output_section) |
2768b3f7 | 1992 | || output_section == &bfd_abs_section |
0f213cc2 | 1993 | || output_section == &bfd_und_section) |
6db82ea7 | 1994 | { |
2768b3f7 SC |
1995 | if (bfd_abs_section.symbol == sym) |
1996 | { | |
1997 | /* Whoops, looked like an abs symbol, but is really an offset | |
1998 | from the abs section */ | |
1999 | r_index = 0; | |
2000 | r_extern = 0; | |
2001 | } | |
2002 | else | |
2003 | { | |
2004 | r_extern = 1; | |
2005 | r_index = stoi((*(g->sym_ptr_ptr))->KEEPIT); | |
2006 | } | |
6db82ea7 SC |
2007 | } |
2008 | else | |
2009 | { | |
2010 | /* Just an ordinary section */ | |
2011 | r_extern = 0; | |
2012 | r_index = output_section->target_index; | |
2013 | } | |
2014 | ||
2015 | ||
7ed4093a SC |
2016 | /* now the fun stuff */ |
2017 | if (abfd->xvec->header_byteorder_big_p != false) { | |
2768b3f7 SC |
2018 | natptr->r_index[0] = r_index >> 16; |
2019 | natptr->r_index[1] = r_index >> 8; | |
2020 | natptr->r_index[2] = r_index; | |
2021 | natptr->r_type[0] = | |
2022 | (r_extern? RELOC_EXT_BITS_EXTERN_BIG: 0) | |
2023 | | (r_type << RELOC_EXT_BITS_TYPE_SH_BIG); | |
2024 | } else { | |
2025 | natptr->r_index[2] = r_index >> 16; | |
2026 | natptr->r_index[1] = r_index >> 8; | |
2027 | natptr->r_index[0] = r_index; | |
2028 | natptr->r_type[0] = | |
2029 | (r_extern? RELOC_EXT_BITS_EXTERN_LITTLE: 0) | |
2030 | | (r_type << RELOC_EXT_BITS_TYPE_SH_LITTLE); | |
2031 | } | |
7ed4093a SC |
2032 | |
2033 | PUT_WORD (abfd, r_addend, natptr->r_addend); | |
2034 | } | |
2035 | ||
6db82ea7 SC |
2036 | /* BFD deals internally with all things based from the section they're |
2037 | in. so, something in 10 bytes into a text section with a base of | |
2038 | 50 would have a symbol (.text+10) and know .text vma was 50. | |
2039 | ||
2040 | Aout keeps all it's symbols based from zero, so the symbol would | |
2041 | contain 60. This macro subs the base of each section from the value | |
2042 | to give the true offset from the section */ | |
2043 | ||
2044 | ||
7ed4093a SC |
2045 | #define MOVE_ADDRESS(ad) \ |
2046 | if (r_extern) { \ | |
6db82ea7 SC |
2047 | /* undefined symbol */ \ |
2048 | cache_ptr->sym_ptr_ptr = symbols + r_index; \ | |
2049 | cache_ptr->addend = ad; \ | |
2050 | } else { \ | |
2051 | /* defined, section relative. replace symbol with pointer to \ | |
2052 | symbol which points to section */ \ | |
7ed4093a SC |
2053 | switch (r_index) { \ |
2054 | case N_TEXT: \ | |
2055 | case N_TEXT | N_EXT: \ | |
6db82ea7 | 2056 | cache_ptr->sym_ptr_ptr = obj_textsec(abfd)->symbol_ptr_ptr; \ |
7ed4093a SC |
2057 | cache_ptr->addend = ad - su->textsec->vma; \ |
2058 | break; \ | |
2059 | case N_DATA: \ | |
2060 | case N_DATA | N_EXT: \ | |
6db82ea7 | 2061 | cache_ptr->sym_ptr_ptr = obj_datasec(abfd)->symbol_ptr_ptr; \ |
7ed4093a SC |
2062 | cache_ptr->addend = ad - su->datasec->vma; \ |
2063 | break; \ | |
2064 | case N_BSS: \ | |
2065 | case N_BSS | N_EXT: \ | |
6db82ea7 | 2066 | cache_ptr->sym_ptr_ptr = obj_bsssec(abfd)->symbol_ptr_ptr; \ |
7ed4093a SC |
2067 | cache_ptr->addend = ad - su->bsssec->vma; \ |
2068 | break; \ | |
6db82ea7 | 2069 | default: \ |
7ed4093a SC |
2070 | case N_ABS: \ |
2071 | case N_ABS | N_EXT: \ | |
6db82ea7 SC |
2072 | cache_ptr->sym_ptr_ptr = bfd_abs_section.symbol_ptr_ptr; \ |
2073 | cache_ptr->addend = ad; \ | |
7ed4093a SC |
2074 | break; \ |
2075 | } \ | |
2076 | } \ | |
2077 | ||
2078 | void | |
2079 | DEFUN(NAME(aout,swap_ext_reloc_in), (abfd, bytes, cache_ptr, symbols), | |
2080 | bfd *abfd AND | |
2081 | struct reloc_ext_external *bytes AND | |
2082 | arelent *cache_ptr AND | |
2083 | asymbol **symbols) | |
2084 | { | |
2085 | int r_index; | |
2086 | int r_extern; | |
2087 | unsigned int r_type; | |
6db82ea7 | 2088 | struct aoutdata *su = &(abfd->tdata.aout_data->a); |
7ed4093a SC |
2089 | |
2090 | cache_ptr->address = (GET_SWORD (abfd, bytes->r_address)); | |
2091 | ||
2092 | /* now the fun stuff */ | |
2093 | if (abfd->xvec->header_byteorder_big_p != false) { | |
382f2a3d ILT |
2094 | r_index = (bytes->r_index[0] << 16) |
2095 | | (bytes->r_index[1] << 8) | |
2096 | | bytes->r_index[2]; | |
7ed4093a SC |
2097 | r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_BIG)); |
2098 | r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_BIG) | |
2099 | >> RELOC_EXT_BITS_TYPE_SH_BIG; | |
2100 | } else { | |
382f2a3d ILT |
2101 | r_index = (bytes->r_index[2] << 16) |
2102 | | (bytes->r_index[1] << 8) | |
2103 | | bytes->r_index[0]; | |
7ed4093a SC |
2104 | r_extern = (0 != (bytes->r_type[0] & RELOC_EXT_BITS_EXTERN_LITTLE)); |
2105 | r_type = (bytes->r_type[0] & RELOC_EXT_BITS_TYPE_LITTLE) | |
2106 | >> RELOC_EXT_BITS_TYPE_SH_LITTLE; | |
2107 | } | |
2108 | ||
2109 | cache_ptr->howto = howto_table_ext + r_type; | |
6db82ea7 | 2110 | MOVE_ADDRESS(GET_SWORD(abfd, bytes->r_addend)); |
7ed4093a SC |
2111 | } |
2112 | ||
2113 | void | |
2114 | DEFUN(NAME(aout,swap_std_reloc_in), (abfd, bytes, cache_ptr, symbols), | |
2115 | bfd *abfd AND | |
2116 | struct reloc_std_external *bytes AND | |
2117 | arelent *cache_ptr AND | |
2118 | asymbol **symbols) | |
2119 | { | |
2120 | int r_index; | |
2121 | int r_extern; | |
2122 | unsigned int r_length; | |
2123 | int r_pcrel; | |
2124 | int r_baserel, r_jmptable, r_relative; | |
6db82ea7 | 2125 | struct aoutdata *su = &(abfd->tdata.aout_data->a); |
7ed4093a | 2126 | |
34dd8ba3 | 2127 | cache_ptr->address = bfd_h_get_32 (abfd, bytes->r_address); |
7ed4093a SC |
2128 | |
2129 | /* now the fun stuff */ | |
2130 | if (abfd->xvec->header_byteorder_big_p != false) { | |
382f2a3d ILT |
2131 | r_index = (bytes->r_index[0] << 16) |
2132 | | (bytes->r_index[1] << 8) | |
2133 | | bytes->r_index[2]; | |
7ed4093a SC |
2134 | r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_BIG)); |
2135 | r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_BIG)); | |
2136 | r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_BIG)); | |
2137 | r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_BIG)); | |
2138 | r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_BIG)); | |
2139 | r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_BIG) | |
2140 | >> RELOC_STD_BITS_LENGTH_SH_BIG; | |
2141 | } else { | |
382f2a3d ILT |
2142 | r_index = (bytes->r_index[2] << 16) |
2143 | | (bytes->r_index[1] << 8) | |
2144 | | bytes->r_index[0]; | |
7ed4093a SC |
2145 | r_extern = (0 != (bytes->r_type[0] & RELOC_STD_BITS_EXTERN_LITTLE)); |
2146 | r_pcrel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_PCREL_LITTLE)); | |
2147 | r_baserel = (0 != (bytes->r_type[0] & RELOC_STD_BITS_BASEREL_LITTLE)); | |
2148 | r_jmptable= (0 != (bytes->r_type[0] & RELOC_STD_BITS_JMPTABLE_LITTLE)); | |
2149 | r_relative= (0 != (bytes->r_type[0] & RELOC_STD_BITS_RELATIVE_LITTLE)); | |
2150 | r_length = (bytes->r_type[0] & RELOC_STD_BITS_LENGTH_LITTLE) | |
2151 | >> RELOC_STD_BITS_LENGTH_SH_LITTLE; | |
2152 | } | |
2153 | ||
2154 | cache_ptr->howto = howto_table_std + r_length + 4 * r_pcrel; | |
2155 | /* FIXME-soon: Roll baserel, jmptable, relative bits into howto setting */ | |
2156 | ||
2157 | MOVE_ADDRESS(0); | |
2158 | } | |
2159 | ||
2160 | /* Reloc hackery */ | |
2161 | ||
2162 | boolean | |
2163 | DEFUN(NAME(aout,slurp_reloc_table),(abfd, asect, symbols), | |
2164 | bfd *abfd AND | |
2165 | sec_ptr asect AND | |
2166 | asymbol **symbols) | |
2167 | { | |
2168 | unsigned int count; | |
2169 | bfd_size_type reloc_size; | |
2170 | PTR relocs; | |
2171 | arelent *reloc_cache; | |
2172 | size_t each_size; | |
2173 | ||
2174 | if (asect->relocation) return true; | |
2175 | ||
2176 | if (asect->flags & SEC_CONSTRUCTOR) return true; | |
2177 | ||
2178 | if (asect == obj_datasec (abfd)) { | |
2179 | reloc_size = exec_hdr(abfd)->a_drsize; | |
2180 | goto doit; | |
2181 | } | |
2182 | ||
2183 | if (asect == obj_textsec (abfd)) { | |
2184 | reloc_size = exec_hdr(abfd)->a_trsize; | |
2185 | goto doit; | |
2186 | } | |
2187 | ||
2188 | bfd_error = invalid_operation; | |
2189 | return false; | |
2190 | ||
2191 | doit: | |
2192 | bfd_seek (abfd, asect->rel_filepos, SEEK_SET); | |
2193 | each_size = obj_reloc_entry_size (abfd); | |
2194 | ||
2195 | count = reloc_size / each_size; | |
2196 | ||
2197 | ||
2198 | reloc_cache = (arelent *) bfd_zalloc (abfd, (size_t)(count * sizeof | |
2199 | (arelent))); | |
2200 | if (!reloc_cache) { | |
2201 | nomem: | |
2202 | bfd_error = no_memory; | |
2203 | return false; | |
2204 | } | |
2205 | ||
2206 | relocs = (PTR) bfd_alloc (abfd, reloc_size); | |
2207 | if (!relocs) { | |
2208 | bfd_release (abfd, reloc_cache); | |
2209 | goto nomem; | |
2210 | } | |
2211 | ||
2212 | if (bfd_read (relocs, 1, reloc_size, abfd) != reloc_size) { | |
2213 | bfd_release (abfd, relocs); | |
2214 | bfd_release (abfd, reloc_cache); | |
2215 | bfd_error = system_call_error; | |
2216 | return false; | |
2217 | } | |
2218 | ||
2219 | if (each_size == RELOC_EXT_SIZE) { | |
2220 | register struct reloc_ext_external *rptr = (struct reloc_ext_external *) relocs; | |
2221 | unsigned int counter = 0; | |
2222 | arelent *cache_ptr = reloc_cache; | |
2223 | ||
2224 | for (; counter < count; counter++, rptr++, cache_ptr++) { | |
2225 | NAME(aout,swap_ext_reloc_in)(abfd, rptr, cache_ptr, symbols); | |
2226 | } | |
2227 | } else { | |
2228 | register struct reloc_std_external *rptr = (struct reloc_std_external*) relocs; | |
2229 | unsigned int counter = 0; | |
2230 | arelent *cache_ptr = reloc_cache; | |
2231 | ||
2232 | for (; counter < count; counter++, rptr++, cache_ptr++) { | |
2233 | NAME(aout,swap_std_reloc_in)(abfd, rptr, cache_ptr, symbols); | |
2234 | } | |
2235 | ||
2236 | } | |
2237 | ||
2238 | bfd_release (abfd,relocs); | |
2239 | asect->relocation = reloc_cache; | |
2240 | asect->reloc_count = count; | |
2241 | return true; | |
2242 | } | |
2243 | ||
2244 | ||
2245 | ||
2246 | /* Write out a relocation section into an object file. */ | |
2247 | ||
2248 | boolean | |
2249 | DEFUN(NAME(aout,squirt_out_relocs),(abfd, section), | |
2250 | bfd *abfd AND | |
2251 | asection *section) | |
2252 | { | |
2253 | arelent **generic; | |
2254 | unsigned char *native, *natptr; | |
2255 | size_t each_size; | |
2256 | ||
2257 | unsigned int count = section->reloc_count; | |
2258 | size_t natsize; | |
2259 | ||
2260 | if (count == 0) return true; | |
2261 | ||
2262 | each_size = obj_reloc_entry_size (abfd); | |
2263 | natsize = each_size * count; | |
2264 | native = (unsigned char *) bfd_zalloc (abfd, natsize); | |
2265 | if (!native) { | |
2266 | bfd_error = no_memory; | |
2267 | return false; | |
2268 | } | |
2269 | ||
2270 | generic = section->orelocation; | |
2271 | ||
2272 | if (each_size == RELOC_EXT_SIZE) | |
2273 | { | |
2274 | for (natptr = native; | |
2275 | count != 0; | |
2276 | --count, natptr += each_size, ++generic) | |
2277 | NAME(aout,swap_ext_reloc_out) (abfd, *generic, (struct reloc_ext_external *)natptr); | |
2278 | } | |
2279 | else | |
2280 | { | |
2281 | for (natptr = native; | |
2282 | count != 0; | |
2283 | --count, natptr += each_size, ++generic) | |
2284 | NAME(aout,swap_std_reloc_out)(abfd, *generic, (struct reloc_std_external *)natptr); | |
2285 | } | |
2286 | ||
2287 | if ( bfd_write ((PTR) native, 1, natsize, abfd) != natsize) { | |
2288 | bfd_release(abfd, native); | |
2289 | return false; | |
2290 | } | |
2291 | bfd_release (abfd, native); | |
2292 | ||
2293 | return true; | |
2294 | } | |
2295 | ||
2296 | /* This is stupid. This function should be a boolean predicate */ | |
2297 | unsigned int | |
2298 | DEFUN(NAME(aout,canonicalize_reloc),(abfd, section, relptr, symbols), | |
2299 | bfd *abfd AND | |
2300 | sec_ptr section AND | |
2301 | arelent **relptr AND | |
2302 | asymbol **symbols) | |
2303 | { | |
2304 | arelent *tblptr = section->relocation; | |
2305 | unsigned int count; | |
2306 | ||
2307 | if (!(tblptr || NAME(aout,slurp_reloc_table)(abfd, section, symbols))) | |
2308 | return 0; | |
2309 | ||
2310 | if (section->flags & SEC_CONSTRUCTOR) { | |
2311 | arelent_chain *chain = section->constructor_chain; | |
2312 | for (count = 0; count < section->reloc_count; count ++) { | |
2313 | *relptr ++ = &chain->relent; | |
2314 | chain = chain->next; | |
2315 | } | |
2316 | } | |
2317 | else { | |
2318 | tblptr = section->relocation; | |
2319 | if (!tblptr) return 0; | |
2320 | ||
2321 | for (count = 0; count++ < section->reloc_count;) | |
2322 | { | |
2323 | *relptr++ = tblptr++; | |
2324 | } | |
2325 | } | |
2326 | *relptr = 0; | |
2327 | ||
2328 | return section->reloc_count; | |
2329 | } | |
2330 | ||
2331 | unsigned int | |
2332 | DEFUN(NAME(aout,get_reloc_upper_bound),(abfd, asect), | |
2333 | bfd *abfd AND | |
2334 | sec_ptr asect) | |
2335 | { | |
2336 | if (bfd_get_format (abfd) != bfd_object) { | |
2337 | bfd_error = invalid_operation; | |
2338 | return 0; | |
2339 | } | |
2340 | if (asect->flags & SEC_CONSTRUCTOR) { | |
2341 | return (sizeof (arelent *) * (asect->reloc_count+1)); | |
2342 | } | |
2343 | ||
2344 | ||
2345 | if (asect == obj_datasec (abfd)) | |
2346 | return (sizeof (arelent *) * | |
2347 | ((exec_hdr(abfd)->a_drsize / obj_reloc_entry_size (abfd)) | |
2348 | +1)); | |
2349 | ||
2350 | if (asect == obj_textsec (abfd)) | |
2351 | return (sizeof (arelent *) * | |
2352 | ((exec_hdr(abfd)->a_trsize / obj_reloc_entry_size (abfd)) | |
2353 | +1)); | |
2354 | ||
2355 | bfd_error = invalid_operation; | |
2356 | return 0; | |
2357 | } | |
2358 | ||
2359 | \f | |
2360 | unsigned int | |
2361 | DEFUN(NAME(aout,get_symtab_upper_bound),(abfd), | |
2362 | bfd *abfd) | |
2363 | { | |
2364 | if (!NAME(aout,slurp_symbol_table)(abfd)) return 0; | |
2365 | ||
2366 | return (bfd_get_symcount (abfd)+1) * (sizeof (aout_symbol_type *)); | |
2367 | } | |
2368 | alent * | |
2369 | DEFUN(NAME(aout,get_lineno),(ignore_abfd, ignore_symbol), | |
2370 | bfd *ignore_abfd AND | |
2371 | asymbol *ignore_symbol) | |
2372 | { | |
2373 | return (alent *)NULL; | |
2374 | } | |
2375 | ||
34dd8ba3 JG |
2376 | void |
2377 | DEFUN(NAME(aout,get_symbol_info),(ignore_abfd, symbol, ret), | |
2378 | bfd *ignore_abfd AND | |
2379 | asymbol *symbol AND | |
2380 | symbol_info *ret) | |
2381 | { | |
2382 | bfd_symbol_info (symbol, ret); | |
2383 | ||
2384 | if (ret->type == '?') | |
2385 | { | |
2386 | int type_code = aout_symbol(symbol)->type & 0xff; | |
2387 | CONST char *stab_name = aout_stab_name(type_code); | |
2388 | static char buf[10]; | |
2389 | ||
2390 | if (stab_name == NULL) | |
2391 | { | |
2392 | sprintf(buf, "(%d)", type_code); | |
2393 | stab_name = buf; | |
2394 | } | |
2395 | ret->type = '-'; | |
2396 | ret->stab_other = (unsigned)(aout_symbol(symbol)->other & 0xff); | |
2397 | ret->stab_desc = (unsigned)(aout_symbol(symbol)->desc & 0xffff); | |
2398 | ret->stab_name = stab_name; | |
2399 | } | |
2400 | } | |
7ed4093a SC |
2401 | |
2402 | void | |
2403 | DEFUN(NAME(aout,print_symbol),(ignore_abfd, afile, symbol, how), | |
2404 | bfd *ignore_abfd AND | |
2405 | PTR afile AND | |
2406 | asymbol *symbol AND | |
9e2dad8e | 2407 | bfd_print_symbol_type how) |
7ed4093a SC |
2408 | { |
2409 | FILE *file = (FILE *)afile; | |
2410 | ||
2411 | switch (how) { | |
9e2dad8e | 2412 | case bfd_print_symbol_name: |
fb3be09b JG |
2413 | if (symbol->name) |
2414 | fprintf(file,"%s", symbol->name); | |
7ed4093a | 2415 | break; |
9e2dad8e | 2416 | case bfd_print_symbol_more: |
7ed4093a SC |
2417 | fprintf(file,"%4x %2x %2x",(unsigned)(aout_symbol(symbol)->desc & 0xffff), |
2418 | (unsigned)(aout_symbol(symbol)->other & 0xff), | |
2419 | (unsigned)(aout_symbol(symbol)->type)); | |
2420 | break; | |
9e2dad8e | 2421 | case bfd_print_symbol_all: |
7ed4093a | 2422 | { |
6db82ea7 SC |
2423 | CONST char *section_name = symbol->section->name; |
2424 | ||
7ed4093a SC |
2425 | |
2426 | bfd_print_symbol_vandf((PTR)file,symbol); | |
2427 | ||
fb3be09b | 2428 | fprintf(file," %-5s %04x %02x %02x", |
7ed4093a SC |
2429 | section_name, |
2430 | (unsigned)(aout_symbol(symbol)->desc & 0xffff), | |
2431 | (unsigned)(aout_symbol(symbol)->other & 0xff), | |
9e2dad8e | 2432 | (unsigned)(aout_symbol(symbol)->type & 0xff)); |
fb3be09b JG |
2433 | if (symbol->name) |
2434 | fprintf(file," %s", symbol->name); | |
7ed4093a SC |
2435 | } |
2436 | break; | |
2437 | } | |
2438 | } | |
2439 | ||
2440 | /* | |
6724ff46 | 2441 | provided a BFD, a section and an offset into the section, calculate |
7ed4093a SC |
2442 | and return the name of the source file and the line nearest to the |
2443 | wanted location. | |
2444 | */ | |
2445 | ||
2446 | boolean | |
2447 | DEFUN(NAME(aout,find_nearest_line),(abfd, | |
2448 | section, | |
2449 | symbols, | |
2450 | offset, | |
2451 | filename_ptr, | |
2452 | functionname_ptr, | |
2453 | line_ptr), | |
2454 | bfd *abfd AND | |
2455 | asection *section AND | |
2456 | asymbol **symbols AND | |
2457 | bfd_vma offset AND | |
2458 | CONST char **filename_ptr AND | |
2459 | CONST char **functionname_ptr AND | |
2460 | unsigned int *line_ptr) | |
2461 | { | |
2462 | /* Run down the file looking for the filename, function and linenumber */ | |
2463 | asymbol **p; | |
2464 | static char buffer[100]; | |
98d43107 | 2465 | static char filename_buffer[200]; |
6db82ea7 SC |
2466 | CONST char *directory_name = NULL; |
2467 | CONST char *main_file_name = NULL; | |
2468 | CONST char *current_file_name = NULL; | |
2469 | CONST char *line_file_name = NULL; /* Value of current_file_name at line number. */ | |
7ed4093a SC |
2470 | bfd_vma high_line_vma = ~0; |
2471 | bfd_vma low_func_vma = 0; | |
2472 | asymbol *func = 0; | |
2473 | *filename_ptr = abfd->filename; | |
2474 | *functionname_ptr = 0; | |
2475 | *line_ptr = 0; | |
2476 | if (symbols != (asymbol **)NULL) { | |
2477 | for (p = symbols; *p; p++) { | |
2478 | aout_symbol_type *q = (aout_symbol_type *)(*p); | |
98d43107 | 2479 | next: |
7ed4093a SC |
2480 | switch (q->type){ |
2481 | case N_SO: | |
3f7607af | 2482 | main_file_name = current_file_name = q->symbol.name; |
98d43107 JG |
2483 | /* Look ahead to next symbol to check if that too is an N_SO. */ |
2484 | p++; | |
2485 | if (*p == NULL) | |
2486 | break; | |
2487 | q = (aout_symbol_type *)(*p); | |
6db82ea7 | 2488 | if (q->type != (int)N_SO) |
98d43107 JG |
2489 | goto next; |
2490 | ||
2491 | /* Found a second N_SO First is directory; second is filename. */ | |
3f7607af PB |
2492 | directory_name = current_file_name; |
2493 | main_file_name = current_file_name = q->symbol.name; | |
2494 | if (obj_textsec(abfd) != section) | |
2495 | goto done; | |
2496 | break; | |
2497 | case N_SOL: | |
2498 | current_file_name = q->symbol.name; | |
7ed4093a | 2499 | break; |
3f7607af | 2500 | |
7ed4093a SC |
2501 | case N_SLINE: |
2502 | ||
2503 | case N_DSLINE: | |
2504 | case N_BSLINE: | |
2505 | /* We'll keep this if it resolves nearer than the one we have already */ | |
2506 | if (q->symbol.value >= offset && | |
2507 | q->symbol.value < high_line_vma) { | |
2508 | *line_ptr = q->desc; | |
2509 | high_line_vma = q->symbol.value; | |
3f7607af | 2510 | line_file_name = current_file_name; |
7ed4093a SC |
2511 | } |
2512 | break; | |
2513 | case N_FUN: | |
2514 | { | |
2515 | /* We'll keep this if it is nearer than the one we have already */ | |
2516 | if (q->symbol.value >= low_func_vma && | |
2517 | q->symbol.value <= offset) { | |
2518 | low_func_vma = q->symbol.value; | |
2519 | func = (asymbol *)q; | |
2520 | } | |
2521 | if (*line_ptr && func) { | |
2522 | CONST char *function = func->name; | |
2523 | char *p; | |
2524 | strncpy(buffer, function, sizeof(buffer)-1); | |
2525 | buffer[sizeof(buffer)-1] = 0; | |
2526 | /* Have to remove : stuff */ | |
2527 | p = strchr(buffer,':'); | |
7b02b4ed | 2528 | if (p != NULL) { *p = '\0'; } |
7ed4093a | 2529 | *functionname_ptr = buffer; |
3f7607af | 2530 | goto done; |
7ed4093a SC |
2531 | |
2532 | } | |
2533 | } | |
2534 | break; | |
2535 | } | |
2536 | } | |
2537 | } | |
3f7607af PB |
2538 | |
2539 | done: | |
2540 | if (*line_ptr) | |
2541 | main_file_name = line_file_name; | |
2542 | if (main_file_name) { | |
2543 | if (main_file_name[0] == '/' || directory_name == NULL) | |
2544 | *filename_ptr = main_file_name; | |
2545 | else { | |
2546 | sprintf(filename_buffer, "%.140s%.50s", | |
2547 | directory_name, main_file_name); | |
2548 | *filename_ptr = filename_buffer; | |
2549 | } | |
2550 | } | |
7ed4093a SC |
2551 | return true; |
2552 | ||
2553 | } | |
2554 | ||
2555 | int | |
cbdc7909 JG |
2556 | DEFUN(NAME(aout,sizeof_headers),(abfd, execable), |
2557 | bfd *abfd AND | |
9e2dad8e | 2558 | boolean execable) |
7ed4093a | 2559 | { |
6db82ea7 | 2560 | return adata(abfd).exec_bytes_size; |
7ed4093a | 2561 | } |