Commit | Line | Data |
---|---|---|
0d552306 KR |
1 | /* Assorted BFD support routines, only used internally. |
2 | Copyright 1990, 1991, 1992 Free Software Foundation, Inc. | |
f58809fd | 3 | Written by Cygnus Support. |
4a81b561 | 4 | |
f58809fd | 5 | This file is part of BFD, the Binary File Descriptor library. |
4a81b561 | 6 | |
f58809fd | 7 | This program is free software; you can redistribute it and/or modify |
4a81b561 | 8 | it under the terms of the GNU General Public License as published by |
f58809fd SC |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | (at your option) any later version. | |
4a81b561 | 11 | |
f58809fd | 12 | This program is distributed in the hope that it will be useful, |
4a81b561 DHW |
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 | |
f58809fd SC |
18 | along with this program; if not, write to the Free Software |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
4a81b561 | 20 | |
4a81b561 | 21 | #include "bfd.h" |
f58809fd | 22 | #include "sysdep.h" |
4a81b561 DHW |
23 | #include "libbfd.h" |
24 | ||
f8e01940 JG |
25 | /* |
26 | SECTION | |
27 | libbfd | |
28 | ||
29 | DESCRIPTION | |
c188b0be | 30 | These routines are used within BFD. |
f8e01940 JG |
31 | They are not intended for export, but are documented here for |
32 | completeness. | |
33 | */ | |
4a81b561 DHW |
34 | |
35 | boolean | |
536b27a5 SC |
36 | DEFUN(_bfd_dummy_new_section_hook,(ignore, ignore_newsect), |
37 | bfd *ignore AND | |
38 | asection *ignore_newsect) | |
4a81b561 DHW |
39 | { |
40 | return true; | |
41 | } | |
42 | ||
43 | boolean | |
536b27a5 SC |
44 | DEFUN(bfd_false ,(ignore), |
45 | bfd *ignore) | |
4a81b561 DHW |
46 | { |
47 | return false; | |
48 | } | |
49 | ||
50 | boolean | |
536b27a5 SC |
51 | DEFUN(bfd_true,(ignore), |
52 | bfd *ignore) | |
4a81b561 DHW |
53 | { |
54 | return true; | |
55 | } | |
56 | ||
d0ec7a8e | 57 | PTR |
536b27a5 SC |
58 | DEFUN(bfd_nullvoidptr,(ignore), |
59 | bfd *ignore) | |
4a81b561 | 60 | { |
d0ec7a8e | 61 | return (PTR)NULL; |
4a81b561 | 62 | } |
fc723380 | 63 | |
4a81b561 | 64 | int |
536b27a5 SC |
65 | DEFUN(bfd_0,(ignore), |
66 | bfd *ignore) | |
4a81b561 DHW |
67 | { |
68 | return 0; | |
69 | } | |
fc723380 | 70 | |
4a81b561 | 71 | unsigned int |
536b27a5 SC |
72 | DEFUN(bfd_0u,(ignore), |
73 | bfd *ignore) | |
4a81b561 DHW |
74 | { |
75 | return 0; | |
76 | } | |
77 | ||
78 | void | |
536b27a5 SC |
79 | DEFUN(bfd_void,(ignore), |
80 | bfd *ignore) | |
4a81b561 DHW |
81 | { |
82 | } | |
83 | ||
84 | boolean | |
536b27a5 SC |
85 | DEFUN(_bfd_dummy_core_file_matches_executable_p,(ignore_core_bfd, ignore_exec_bfd), |
86 | bfd *ignore_core_bfd AND | |
87 | bfd *ignore_exec_bfd) | |
4a81b561 DHW |
88 | { |
89 | bfd_error = invalid_operation; | |
90 | return false; | |
91 | } | |
92 | ||
93 | /* of course you can't initialize a function to be the same as another, grr */ | |
94 | ||
95 | char * | |
0f268757 | 96 | DEFUN(_bfd_dummy_core_file_failing_command,(ignore_abfd), |
536b27a5 | 97 | bfd *ignore_abfd) |
4a81b561 DHW |
98 | { |
99 | return (char *)NULL; | |
100 | } | |
101 | ||
102 | int | |
536b27a5 SC |
103 | DEFUN(_bfd_dummy_core_file_failing_signal,(ignore_abfd), |
104 | bfd *ignore_abfd) | |
4a81b561 DHW |
105 | { |
106 | return 0; | |
107 | } | |
108 | ||
109 | bfd_target * | |
536b27a5 SC |
110 | DEFUN(_bfd_dummy_target,(ignore_abfd), |
111 | bfd *ignore_abfd) | |
4a81b561 DHW |
112 | { |
113 | return 0; | |
114 | } | |
115 | \f | |
116 | /** zalloc -- allocate and clear storage */ | |
117 | ||
118 | ||
119 | #ifndef zalloc | |
120 | char * | |
536b27a5 SC |
121 | DEFUN(zalloc,(size), |
122 | bfd_size_type size) | |
4a81b561 | 123 | { |
b5b4294e | 124 | char *ptr = (char *) malloc ((size_t)size); |
4a81b561 DHW |
125 | |
126 | if ((ptr != NULL) && (size != 0)) | |
b5b4294e | 127 | memset(ptr,0, (size_t) size); |
4a81b561 DHW |
128 | |
129 | return ptr; | |
130 | } | |
131 | #endif | |
1e310759 | 132 | |
f8e01940 JG |
133 | /* |
134 | INTERNAL_FUNCTION | |
135 | bfd_xmalloc | |
136 | ||
137 | SYNOPSIS | |
138 | PTR bfd_xmalloc( bfd_size_type size); | |
139 | ||
140 | DESCRIPTION | |
c188b0be | 141 | Like <<malloc>>, but exit if no more memory. |
f8e01940 | 142 | |
1e310759 | 143 | */ |
f8e01940 | 144 | |
1e310759 JG |
145 | /** There is major inconsistency in how running out of memory is handled. |
146 | Some routines return a NULL, and set bfd_error to no_memory. | |
147 | However, obstack routines can't do this ... */ | |
148 | ||
149 | ||
150 | DEFUN(PTR bfd_xmalloc,(size), | |
151 | bfd_size_type size) | |
152 | { | |
f8e01940 | 153 | static CONST char no_memory_message[] = "Virtual memory exhausted!\n"; |
1e310759 JG |
154 | PTR ptr; |
155 | if (size == 0) size = 1; | |
b5b4294e | 156 | ptr = (PTR)malloc((size_t) size); |
1e310759 JG |
157 | if (!ptr) |
158 | { | |
159 | write (2, no_memory_message, sizeof(no_memory_message)-1); | |
c188b0be | 160 | exit (1); |
1e310759 JG |
161 | } |
162 | return ptr; | |
163 | } | |
b5b4294e JG |
164 | |
165 | /* | |
166 | INTERNAL_FUNCTION | |
167 | bfd_xmalloc_by_size_t | |
168 | ||
169 | SYNOPSIS | |
170 | PTR bfd_xmalloc_by_size_t ( size_t size); | |
171 | ||
172 | DESCRIPTION | |
c188b0be DM |
173 | Like <<malloc>>, but exit if no more memory. |
174 | Uses <<size_t>>, so it's suitable for use as <<obstack_chunk_alloc>>. | |
b5b4294e JG |
175 | */ |
176 | PTR | |
177 | DEFUN(bfd_xmalloc_by_size_t, (size), | |
178 | size_t size) | |
179 | { | |
180 | return bfd_xmalloc ((bfd_size_type) size); | |
181 | } | |
4a81b561 DHW |
182 | \f |
183 | /* Some IO code */ | |
184 | ||
185 | ||
186 | /* Note that archive entries don't have streams; they share their parent's. | |
f58809fd | 187 | This allows someone to play with the iostream behind BFD's back. |
4a81b561 DHW |
188 | |
189 | Also, note that the origin pointer points to the beginning of a file's | |
190 | contents (0 for non-archive elements). For archive entries this is the | |
191 | first octet in the file, NOT the beginning of the archive header. */ | |
192 | ||
7ed4093a SC |
193 | static |
194 | int DEFUN(real_read,(where, a,b, file), | |
6f715d66 SC |
195 | PTR where AND |
196 | int a AND | |
197 | int b AND | |
198 | FILE *file) | |
7ed4093a SC |
199 | { |
200 | return fread(where, a,b,file); | |
201 | } | |
23b0b558 | 202 | bfd_size_type |
7ed4093a SC |
203 | DEFUN(bfd_read,(ptr, size, nitems, abfd), |
204 | PTR ptr AND | |
205 | bfd_size_type size AND | |
206 | bfd_size_type nitems AND | |
207 | bfd *abfd) | |
4a81b561 | 208 | { |
0d552306 KR |
209 | int nread; |
210 | nread = real_read (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd)); | |
211 | #ifdef FILE_OFFSET_IS_CHAR_INDEX | |
212 | if (nread > 0) | |
213 | abfd->where += nread; | |
214 | #endif | |
215 | return nread; | |
4a81b561 DHW |
216 | } |
217 | ||
23b0b558 | 218 | bfd_size_type |
df34342b ILT |
219 | bfd_write (ptr, size, nitems, abfd) |
220 | CONST PTR ptr; | |
221 | bfd_size_type size; | |
222 | bfd_size_type nitems; | |
223 | bfd *abfd; | |
4a81b561 | 224 | { |
df34342b | 225 | int nwrote = fwrite (ptr, 1, (int) (size * nitems), bfd_cache_lookup (abfd)); |
0d552306 KR |
226 | #ifdef FILE_OFFSET_IS_CHAR_INDEX |
227 | if (nwrote > 0) | |
228 | abfd->where += nwrote; | |
229 | #endif | |
df34342b ILT |
230 | if (nwrote != size * nitems) |
231 | { | |
232 | #ifdef ENOSPC | |
233 | if (nwrote >= 0) | |
234 | errno = ENOSPC; | |
235 | #endif | |
236 | bfd_error = system_call_error; | |
237 | } | |
0d552306 | 238 | return nwrote; |
4a81b561 DHW |
239 | } |
240 | ||
f8e01940 JG |
241 | /* |
242 | INTERNAL_FUNCTION | |
243 | bfd_write_bigendian_4byte_int | |
244 | ||
245 | SYNOPSIS | |
246 | void bfd_write_bigendian_4byte_int(bfd *abfd, int i); | |
247 | ||
248 | DESCRIPTION | |
c188b0be DM |
249 | Write a 4 byte integer @var{i} to the output BFD @var{abfd}, in big |
250 | endian order regardless of what else is going on. This is useful in | |
f8e01940 | 251 | archives. |
1e310759 | 252 | |
1e310759 | 253 | */ |
f58809fd SC |
254 | void |
255 | DEFUN(bfd_write_bigendian_4byte_int,(abfd, i), | |
256 | bfd *abfd AND | |
257 | int i) | |
258 | { | |
1e310759 | 259 | bfd_byte buffer[4]; |
b5b4294e | 260 | bfd_putb32(i, buffer); |
1e310759 | 261 | bfd_write((PTR)buffer, 4, 1, abfd); |
f58809fd SC |
262 | } |
263 | ||
0d552306 KR |
264 | long |
265 | DEFUN(bfd_tell,(abfd), | |
266 | bfd *abfd) | |
267 | { | |
268 | file_ptr ptr; | |
269 | ||
270 | ptr = ftell (bfd_cache_lookup(abfd)); | |
271 | ||
272 | if (abfd->my_archive) | |
273 | ptr -= abfd->origin; | |
274 | abfd->where = ptr; | |
275 | return ptr; | |
276 | } | |
277 | ||
b5b4294e JG |
278 | int |
279 | DEFUN(bfd_flush,(abfd), | |
280 | bfd *abfd) | |
281 | { | |
282 | return fflush (bfd_cache_lookup(abfd)); | |
283 | } | |
284 | ||
285 | int | |
286 | DEFUN(bfd_stat,(abfd, statbuf), | |
287 | bfd *abfd AND | |
288 | struct stat *statbuf) | |
289 | { | |
290 | return fstat (fileno(bfd_cache_lookup(abfd)), statbuf); | |
291 | } | |
292 | ||
4a81b561 | 293 | int |
7ed4093a SC |
294 | DEFUN(bfd_seek,(abfd, position, direction), |
295 | bfd * CONST abfd AND | |
296 | CONST file_ptr position AND | |
297 | CONST int direction) | |
4a81b561 | 298 | { |
0d552306 KR |
299 | int result; |
300 | FILE *f; | |
e5b02860 | 301 | file_ptr file_position; |
0d552306 KR |
302 | /* For the time being, a BFD may not seek to it's end. The problem |
303 | is that we don't easily have a way to recognize the end of an | |
304 | element in an archive. */ | |
305 | ||
306 | BFD_ASSERT (direction == SEEK_SET || direction == SEEK_CUR); | |
307 | ||
b31d06ca | 308 | if (direction == SEEK_CUR && position == 0) |
0d552306 KR |
309 | return 0; |
310 | #ifdef FILE_OFFSET_IS_CHAR_INDEX | |
b6090f4d JG |
311 | if (abfd->format != bfd_archive && abfd->my_archive == 0) |
312 | { | |
313 | #ifndef NDEBUG | |
314 | /* Explanation for this code: I'm only about 95+% sure that the above | |
315 | conditions are sufficient and that all i/o calls are properly | |
316 | adjusting the `where' field. So this is sort of an `assert' | |
317 | that the `where' field is correct. If we can go a while without | |
318 | tripping the abort, we can probably safely disable this code, | |
319 | so that the real optimizations happen. */ | |
320 | file_ptr where_am_i_now; | |
321 | where_am_i_now = ftell (bfd_cache_lookup (abfd)); | |
322 | if (abfd->my_archive) | |
323 | where_am_i_now -= abfd->origin; | |
324 | if (where_am_i_now != abfd->where) | |
325 | abort (); | |
326 | #endif | |
327 | if (direction == SEEK_SET && position == abfd->where) | |
328 | return 0; | |
329 | } | |
330 | else | |
331 | { | |
332 | /* We need something smarter to optimize access to archives. | |
333 | Currently, anything inside an archive is read via the file | |
334 | handle for the archive. Which means that a bfd_seek on one | |
335 | component affects the `current position' in the archive, as | |
336 | well as in any other component. | |
337 | ||
338 | It might be sufficient to put a spike through the cache | |
339 | abstraction, and look to the archive for the file position, | |
340 | but I think we should try for something cleaner. | |
341 | ||
342 | In the meantime, no optimization for archives. */ | |
343 | } | |
0d552306 | 344 | #endif |
4a81b561 | 345 | |
0d552306 | 346 | f = bfd_cache_lookup (abfd); |
e5b02860 | 347 | file_position = position; |
0d552306 | 348 | if (direction == SEEK_SET && abfd->my_archive != NULL) |
e5b02860 KR |
349 | file_position += abfd->origin; |
350 | ||
351 | result = fseek (f, file_position, direction); | |
352 | ||
353 | if (result != 0) | |
df34342b ILT |
354 | { |
355 | /* Force redetermination of `where' field. */ | |
356 | bfd_tell (abfd); | |
357 | bfd_error = system_call_error; | |
358 | } | |
0d552306 KR |
359 | else |
360 | { | |
e5b02860 KR |
361 | #ifdef FILE_OFFSET_IS_CHAR_INDEX |
362 | /* Adjust `where' field. */ | |
363 | if (direction == SEEK_SET) | |
364 | abfd->where = position; | |
365 | else | |
366 | abfd->where += position; | |
367 | #endif | |
0d552306 | 368 | } |
e5b02860 | 369 | return result; |
4a81b561 DHW |
370 | } |
371 | \f | |
372 | /** Make a string table */ | |
373 | ||
6f715d66 SC |
374 | /*>bfd.h< |
375 | Add string to table pointed to by table, at location starting with free_ptr. | |
4a81b561 DHW |
376 | resizes the table if necessary (if it's NULL, creates it, ignoring |
377 | table_length). Updates free_ptr, table, table_length */ | |
378 | ||
379 | boolean | |
536b27a5 SC |
380 | DEFUN(bfd_add_to_string_table,(table, new_string, table_length, free_ptr), |
381 | char **table AND | |
536b27a5 | 382 | char *new_string AND |
5ad1d830 SC |
383 | unsigned int *table_length AND |
384 | char **free_ptr) | |
4a81b561 DHW |
385 | { |
386 | size_t string_length = strlen (new_string) + 1; /* include null here */ | |
387 | char *base = *table; | |
388 | size_t space_length = *table_length; | |
389 | unsigned int offset = (base ? *free_ptr - base : 0); | |
390 | ||
391 | if (base == NULL) { | |
392 | /* Avoid a useless regrow if we can (but of course we still | |
393 | take it next time */ | |
394 | space_length = (string_length < DEFAULT_STRING_SPACE_SIZE ? | |
6f715d66 | 395 | DEFAULT_STRING_SPACE_SIZE : string_length+1); |
b5b4294e | 396 | base = zalloc ((bfd_size_type) space_length); |
4a81b561 DHW |
397 | |
398 | if (base == NULL) { | |
399 | bfd_error = no_memory; | |
400 | return false; | |
401 | } | |
402 | } | |
403 | ||
404 | if ((size_t)(offset + string_length) >= space_length) { | |
405 | /* Make sure we will have enough space */ | |
406 | while ((size_t)(offset + string_length) >= space_length) | |
407 | space_length += space_length/2; /* grow by 50% */ | |
408 | ||
409 | base = (char *) realloc (base, space_length); | |
410 | if (base == NULL) { | |
411 | bfd_error = no_memory; | |
412 | return false; | |
413 | } | |
414 | ||
415 | } | |
416 | ||
417 | memcpy (base + offset, new_string, string_length); | |
418 | *table = base; | |
419 | *table_length = space_length; | |
420 | *free_ptr = base + offset + string_length; | |
421 | ||
422 | return true; | |
423 | } | |
424 | \f | |
425 | /** The do-it-yourself (byte) sex-change kit */ | |
426 | ||
427 | /* The middle letter e.g. get<b>short indicates Big or Little endian | |
428 | target machine. It doesn't matter what the byte order of the host | |
429 | machine is; these routines work for either. */ | |
430 | ||
431 | /* FIXME: Should these take a count argument? | |
432 | Answer (gnu@cygnus.com): No, but perhaps they should be inline | |
6f715d66 SC |
433 | functions in swap.h #ifdef __GNUC__. |
434 | Gprof them later and find out. */ | |
435 | ||
f8e01940 JG |
436 | /* |
437 | FUNCTION | |
438 | bfd_put_size | |
439 | FUNCTION | |
440 | bfd_get_size | |
441 | ||
442 | DESCRIPTION | |
443 | These macros as used for reading and writing raw data in | |
444 | sections; each access (except for bytes) is vectored through | |
445 | the target format of the BFD and mangled accordingly. The | |
446 | mangling performs any necessary endian translations and | |
14e3c2e4 JK |
447 | removes alignment restrictions. Note that types accepted and |
448 | returned by these macros are identical so they can be swapped | |
449 | around in macros--for example libaout.h defines GET_WORD to | |
450 | either bfd_get_32 or bfd_get_64. | |
f8e01940 | 451 | |
7e4db254 JK |
452 | In the put routines, val must be a bfd_vma. If we are on a |
453 | system without prototypes, the caller is responsible for making | |
454 | sure that is true, with a cast if necessary. We don't cast | |
455 | them in the macro definitions because that would prevent lint | |
456 | or gcc -Wall from detecting sins such as passing a pointer. | |
457 | To detect calling these with less than a bfd_vma, use gcc | |
458 | -Wconversion on a host with 64 bit bfd_vma's. | |
459 | ||
da3cd00a KR |
460 | . |
461 | .{* Byte swapping macros for user section data. *} | |
462 | . | |
f8e01940 | 463 | .#define bfd_put_8(abfd, val, ptr) \ |
da3cd00a KR |
464 | . (*((unsigned char *)(ptr)) = (unsigned char)val) |
465 | .#define bfd_put_signed_8 \ | |
466 | . bfd_put_8 | |
f8e01940 | 467 | .#define bfd_get_8(abfd, ptr) \ |
da3cd00a KR |
468 | . (*(unsigned char *)(ptr)) |
469 | .#define bfd_get_signed_8(abfd, ptr) \ | |
470 | . ((*(unsigned char *)(ptr) ^ 0x80) - 0x80) | |
471 | . | |
f8e01940 | 472 | .#define bfd_put_16(abfd, val, ptr) \ |
7e4db254 | 473 | . BFD_SEND(abfd, bfd_putx16, ((val),(ptr))) |
da3cd00a KR |
474 | .#define bfd_put_signed_16 \ |
475 | . bfd_put_16 | |
f8e01940 JG |
476 | .#define bfd_get_16(abfd, ptr) \ |
477 | . BFD_SEND(abfd, bfd_getx16, (ptr)) | |
14e3c2e4 JK |
478 | .#define bfd_get_signed_16(abfd, ptr) \ |
479 | . BFD_SEND (abfd, bfd_getx_signed_16, (ptr)) | |
da3cd00a | 480 | . |
f8e01940 | 481 | .#define bfd_put_32(abfd, val, ptr) \ |
7e4db254 | 482 | . BFD_SEND(abfd, bfd_putx32, ((val),(ptr))) |
da3cd00a KR |
483 | .#define bfd_put_signed_32 \ |
484 | . bfd_put_32 | |
f8e01940 JG |
485 | .#define bfd_get_32(abfd, ptr) \ |
486 | . BFD_SEND(abfd, bfd_getx32, (ptr)) | |
14e3c2e4 JK |
487 | .#define bfd_get_signed_32(abfd, ptr) \ |
488 | . BFD_SEND(abfd, bfd_getx_signed_32, (ptr)) | |
da3cd00a | 489 | . |
f8e01940 | 490 | .#define bfd_put_64(abfd, val, ptr) \ |
7e4db254 | 491 | . BFD_SEND(abfd, bfd_putx64, ((val), (ptr))) |
da3cd00a KR |
492 | .#define bfd_put_signed_64 \ |
493 | . bfd_put_64 | |
f8e01940 JG |
494 | .#define bfd_get_64(abfd, ptr) \ |
495 | . BFD_SEND(abfd, bfd_getx64, (ptr)) | |
14e3c2e4 JK |
496 | .#define bfd_get_signed_64(abfd, ptr) \ |
497 | . BFD_SEND(abfd, bfd_getx_signed_64, (ptr)) | |
da3cd00a | 498 | . |
f8e01940 JG |
499 | */ |
500 | ||
501 | /* | |
502 | FUNCTION | |
503 | bfd_h_put_size | |
f8e01940 JG |
504 | bfd_h_get_size |
505 | ||
506 | DESCRIPTION | |
507 | These macros have the same function as their <<bfd_get_x>> | |
c188b0be | 508 | bretheren, except that they are used for removing information |
f8e01940 JG |
509 | for the header records of object files. Believe it or not, |
510 | some object files keep their header records in big endian | |
c188b0be | 511 | order and their data in little endian order. |
da3cd00a KR |
512 | . |
513 | .{* Byte swapping macros for file header data. *} | |
514 | . | |
f8e01940 | 515 | .#define bfd_h_put_8(abfd, val, ptr) \ |
da3cd00a KR |
516 | . bfd_put_8 (abfd, val, ptr) |
517 | .#define bfd_h_put_signed_8(abfd, val, ptr) \ | |
518 | . bfd_put_8 (abfd, val, ptr) | |
f8e01940 | 519 | .#define bfd_h_get_8(abfd, ptr) \ |
da3cd00a KR |
520 | . bfd_get_8 (abfd, ptr) |
521 | .#define bfd_h_get_signed_8(abfd, ptr) \ | |
522 | . bfd_get_signed_8 (abfd, ptr) | |
523 | . | |
f8e01940 JG |
524 | .#define bfd_h_put_16(abfd, val, ptr) \ |
525 | . BFD_SEND(abfd, bfd_h_putx16,(val,ptr)) | |
da3cd00a KR |
526 | .#define bfd_h_put_signed_16 \ |
527 | . bfd_h_put_16 | |
f8e01940 JG |
528 | .#define bfd_h_get_16(abfd, ptr) \ |
529 | . BFD_SEND(abfd, bfd_h_getx16,(ptr)) | |
14e3c2e4 JK |
530 | .#define bfd_h_get_signed_16(abfd, ptr) \ |
531 | . BFD_SEND(abfd, bfd_h_getx_signed_16, (ptr)) | |
da3cd00a | 532 | . |
f8e01940 JG |
533 | .#define bfd_h_put_32(abfd, val, ptr) \ |
534 | . BFD_SEND(abfd, bfd_h_putx32,(val,ptr)) | |
da3cd00a KR |
535 | .#define bfd_h_put_signed_32 \ |
536 | . bfd_h_put_32 | |
f8e01940 JG |
537 | .#define bfd_h_get_32(abfd, ptr) \ |
538 | . BFD_SEND(abfd, bfd_h_getx32,(ptr)) | |
14e3c2e4 JK |
539 | .#define bfd_h_get_signed_32(abfd, ptr) \ |
540 | . BFD_SEND(abfd, bfd_h_getx_signed_32, (ptr)) | |
da3cd00a | 541 | . |
f8e01940 JG |
542 | .#define bfd_h_put_64(abfd, val, ptr) \ |
543 | . BFD_SEND(abfd, bfd_h_putx64,(val, ptr)) | |
da3cd00a KR |
544 | .#define bfd_h_put_signed_64 \ |
545 | . bfd_h_put_64 | |
f8e01940 JG |
546 | .#define bfd_h_get_64(abfd, ptr) \ |
547 | . BFD_SEND(abfd, bfd_h_getx64,(ptr)) | |
14e3c2e4 JK |
548 | .#define bfd_h_get_signed_64(abfd, ptr) \ |
549 | . BFD_SEND(abfd, bfd_h_getx_signed_64, (ptr)) | |
da3cd00a | 550 | . |
f8e01940 | 551 | */ |
4a81b561 | 552 | |
14e3c2e4 | 553 | /* Sign extension to bfd_signed_vma. */ |
df34342b ILT |
554 | #define COERCE16(x) (((bfd_signed_vma) (x) ^ 0x8000) - 0x8000) |
555 | #define COERCE32(x) (((bfd_signed_vma) (x) ^ 0x80000000) - 0x80000000) | |
da3cd00a | 556 | #define EIGHT_GAZILLION (((HOST_64_BIT)0x80000000) << 32) |
df34342b ILT |
557 | #define COERCE64(x) \ |
558 | (((bfd_signed_vma) (x) ^ EIGHT_GAZILLION) - EIGHT_GAZILLION) | |
14e3c2e4 | 559 | |
f58809fd | 560 | bfd_vma |
b5b4294e | 561 | DEFUN(bfd_getb16,(addr), |
536b27a5 | 562 | register bfd_byte *addr) |
4a81b561 | 563 | { |
6f715d66 | 564 | return (addr[0] << 8) | addr[1]; |
4a81b561 DHW |
565 | } |
566 | ||
f58809fd | 567 | bfd_vma |
b5b4294e | 568 | DEFUN(bfd_getl16,(addr), |
536b27a5 | 569 | register bfd_byte *addr) |
4a81b561 | 570 | { |
6f715d66 | 571 | return (addr[1] << 8) | addr[0]; |
4a81b561 DHW |
572 | } |
573 | ||
14e3c2e4 | 574 | bfd_signed_vma |
b5b4294e | 575 | DEFUN(bfd_getb_signed_16,(addr), |
14e3c2e4 JK |
576 | register bfd_byte *addr) |
577 | { | |
578 | return COERCE16((addr[0] << 8) | addr[1]); | |
579 | } | |
580 | ||
581 | bfd_signed_vma | |
b5b4294e | 582 | DEFUN(bfd_getl_signed_16,(addr), |
14e3c2e4 JK |
583 | register bfd_byte *addr) |
584 | { | |
585 | return COERCE16((addr[1] << 8) | addr[0]); | |
586 | } | |
587 | ||
4a81b561 | 588 | void |
b5b4294e | 589 | DEFUN(bfd_putb16,(data, addr), |
f58809fd | 590 | bfd_vma data AND |
536b27a5 | 591 | register bfd_byte *addr) |
4a81b561 | 592 | { |
6f715d66 SC |
593 | addr[0] = (bfd_byte)(data >> 8); |
594 | addr[1] = (bfd_byte )data; | |
4a81b561 DHW |
595 | } |
596 | ||
597 | void | |
b5b4294e | 598 | DEFUN(bfd_putl16,(data, addr), |
f58809fd | 599 | bfd_vma data AND |
536b27a5 | 600 | register bfd_byte *addr) |
4a81b561 | 601 | { |
6f715d66 SC |
602 | addr[0] = (bfd_byte )data; |
603 | addr[1] = (bfd_byte)(data >> 8); | |
4a81b561 DHW |
604 | } |
605 | ||
f58809fd | 606 | bfd_vma |
b5b4294e | 607 | bfd_getb32 (addr) |
14e3c2e4 | 608 | register bfd_byte *addr; |
4a81b561 | 609 | { |
df34342b ILT |
610 | return (((((bfd_vma)addr[0] << 8) | addr[1]) << 8) |
611 | | addr[2]) << 8 | addr[3]; | |
4a81b561 DHW |
612 | } |
613 | ||
f58809fd | 614 | bfd_vma |
b5b4294e | 615 | bfd_getl32 (addr) |
6f715d66 | 616 | register bfd_byte *addr; |
4a81b561 | 617 | { |
df34342b ILT |
618 | return (((((bfd_vma)addr[3] << 8) | addr[2]) << 8) |
619 | | addr[1]) << 8 | addr[0]; | |
4a81b561 DHW |
620 | } |
621 | ||
14e3c2e4 | 622 | bfd_signed_vma |
b5b4294e | 623 | bfd_getb_signed_32 (addr) |
14e3c2e4 JK |
624 | register bfd_byte *addr; |
625 | { | |
df34342b | 626 | return COERCE32((((((bfd_vma)addr[0] << 8) | addr[1]) << 8) |
14e3c2e4 JK |
627 | | addr[2]) << 8 | addr[3]); |
628 | } | |
629 | ||
630 | bfd_signed_vma | |
b5b4294e | 631 | bfd_getl_signed_32 (addr) |
14e3c2e4 JK |
632 | register bfd_byte *addr; |
633 | { | |
df34342b | 634 | return COERCE32((((((bfd_vma)addr[3] << 8) | addr[2]) << 8) |
14e3c2e4 JK |
635 | | addr[1]) << 8 | addr[0]); |
636 | } | |
637 | ||
f58809fd | 638 | bfd_vma |
b5b4294e | 639 | DEFUN(bfd_getb64,(addr), |
536b27a5 | 640 | register bfd_byte *addr) |
7ed4093a | 641 | { |
b5b4294e | 642 | #ifdef BFD64 |
b6090f4d | 643 | bfd_vma low, high; |
536b27a5 | 644 | |
7ed4093a | 645 | high= ((((((((addr[0]) << 8) | |
6f715d66 SC |
646 | addr[1]) << 8) | |
647 | addr[2]) << 8) | | |
648 | addr[3]) ); | |
7ed4093a | 649 | |
df34342b | 650 | low = (((((((((bfd_vma)addr[4]) << 8) | |
6f715d66 SC |
651 | addr[5]) << 8) | |
652 | addr[6]) << 8) | | |
653 | addr[7])); | |
7ed4093a SC |
654 | |
655 | return high << 32 | low; | |
656 | #else | |
657 | BFD_FAIL(); | |
f58809fd | 658 | return 0; |
7ed4093a SC |
659 | #endif |
660 | ||
661 | } | |
662 | ||
f58809fd | 663 | bfd_vma |
b5b4294e | 664 | DEFUN(bfd_getl64,(addr), |
536b27a5 | 665 | register bfd_byte *addr) |
7ed4093a | 666 | { |
6f715d66 | 667 | |
b5b4294e | 668 | #ifdef BFD64 |
b6090f4d | 669 | bfd_vma low, high; |
7ed4093a | 670 | high= (((((((addr[7] << 8) | |
6f715d66 SC |
671 | addr[6]) << 8) | |
672 | addr[5]) << 8) | | |
673 | addr[4])); | |
7ed4093a | 674 | |
df34342b | 675 | low = ((((((((bfd_vma)addr[3] << 8) | |
6f715d66 SC |
676 | addr[2]) << 8) | |
677 | addr[1]) << 8) | | |
678 | addr[0]) ); | |
7ed4093a SC |
679 | |
680 | return high << 32 | low; | |
681 | #else | |
682 | BFD_FAIL(); | |
f58809fd | 683 | return 0; |
7ed4093a | 684 | #endif |
6f715d66 | 685 | |
7ed4093a SC |
686 | } |
687 | ||
14e3c2e4 | 688 | bfd_signed_vma |
b5b4294e | 689 | DEFUN(bfd_getb_signed_64,(addr), |
14e3c2e4 JK |
690 | register bfd_byte *addr) |
691 | { | |
b5b4294e | 692 | #ifdef BFD64 |
14e3c2e4 JK |
693 | bfd_vma low, high; |
694 | ||
695 | high= ((((((((addr[0]) << 8) | | |
696 | addr[1]) << 8) | | |
697 | addr[2]) << 8) | | |
698 | addr[3]) ); | |
699 | ||
df34342b | 700 | low = (((((((((bfd_vma)addr[4]) << 8) | |
14e3c2e4 JK |
701 | addr[5]) << 8) | |
702 | addr[6]) << 8) | | |
703 | addr[7])); | |
704 | ||
705 | return COERCE64(high << 32 | low); | |
706 | #else | |
707 | BFD_FAIL(); | |
708 | return 0; | |
709 | #endif | |
710 | ||
711 | } | |
712 | ||
713 | bfd_signed_vma | |
b5b4294e | 714 | DEFUN(bfd_getl_signed_64,(addr), |
14e3c2e4 JK |
715 | register bfd_byte *addr) |
716 | { | |
717 | ||
b5b4294e | 718 | #ifdef BFD64 |
14e3c2e4 JK |
719 | bfd_vma low, high; |
720 | high= (((((((addr[7] << 8) | | |
721 | addr[6]) << 8) | | |
722 | addr[5]) << 8) | | |
723 | addr[4])); | |
724 | ||
df34342b | 725 | low = ((((((((bfd_vma)addr[3] << 8) | |
14e3c2e4 JK |
726 | addr[2]) << 8) | |
727 | addr[1]) << 8) | | |
728 | addr[0]) ); | |
729 | ||
730 | return COERCE64(high << 32 | low); | |
731 | #else | |
732 | BFD_FAIL(); | |
733 | return 0; | |
734 | #endif | |
735 | ||
736 | } | |
737 | ||
4a81b561 | 738 | void |
b5b4294e | 739 | DEFUN(bfd_putb32,(data, addr), |
f58809fd | 740 | bfd_vma data AND |
536b27a5 | 741 | register bfd_byte *addr) |
4a81b561 | 742 | { |
6f715d66 SC |
743 | addr[0] = (bfd_byte)(data >> 24); |
744 | addr[1] = (bfd_byte)(data >> 16); | |
745 | addr[2] = (bfd_byte)(data >> 8); | |
746 | addr[3] = (bfd_byte)data; | |
4a81b561 DHW |
747 | } |
748 | ||
749 | void | |
b5b4294e | 750 | DEFUN(bfd_putl32,(data, addr), |
f58809fd | 751 | bfd_vma data AND |
536b27a5 | 752 | register bfd_byte *addr) |
4a81b561 | 753 | { |
6f715d66 SC |
754 | addr[0] = (bfd_byte)data; |
755 | addr[1] = (bfd_byte)(data >> 8); | |
756 | addr[2] = (bfd_byte)(data >> 16); | |
757 | addr[3] = (bfd_byte)(data >> 24); | |
4a81b561 | 758 | } |
7ed4093a | 759 | void |
b5b4294e | 760 | DEFUN(bfd_putb64,(data, addr), |
f58809fd | 761 | bfd_vma data AND |
6f715d66 | 762 | register bfd_byte *addr) |
7ed4093a | 763 | { |
b5b4294e | 764 | #ifdef BFD64 |
536b27a5 SC |
765 | addr[0] = (bfd_byte)(data >> (7*8)); |
766 | addr[1] = (bfd_byte)(data >> (6*8)); | |
767 | addr[2] = (bfd_byte)(data >> (5*8)); | |
768 | addr[3] = (bfd_byte)(data >> (4*8)); | |
769 | addr[4] = (bfd_byte)(data >> (3*8)); | |
770 | addr[5] = (bfd_byte)(data >> (2*8)); | |
771 | addr[6] = (bfd_byte)(data >> (1*8)); | |
772 | addr[7] = (bfd_byte)(data >> (0*8)); | |
7ed4093a | 773 | #else |
536b27a5 | 774 | BFD_FAIL(); |
7ed4093a SC |
775 | #endif |
776 | ||
777 | } | |
778 | ||
779 | void | |
b5b4294e | 780 | DEFUN(bfd_putl64,(data, addr), |
f58809fd | 781 | bfd_vma data AND |
536b27a5 | 782 | register bfd_byte *addr) |
7ed4093a | 783 | { |
b5b4294e | 784 | #ifdef BFD64 |
536b27a5 SC |
785 | addr[7] = (bfd_byte)(data >> (7*8)); |
786 | addr[6] = (bfd_byte)(data >> (6*8)); | |
787 | addr[5] = (bfd_byte)(data >> (5*8)); | |
788 | addr[4] = (bfd_byte)(data >> (4*8)); | |
789 | addr[3] = (bfd_byte)(data >> (3*8)); | |
790 | addr[2] = (bfd_byte)(data >> (2*8)); | |
791 | addr[1] = (bfd_byte)(data >> (1*8)); | |
792 | addr[0] = (bfd_byte)(data >> (0*8)); | |
7ed4093a | 793 | #else |
536b27a5 | 794 | BFD_FAIL(); |
7ed4093a SC |
795 | #endif |
796 | ||
797 | } | |
798 | ||
2203f786 JG |
799 | \f |
800 | /* Default implementation */ | |
4a81b561 | 801 | |
2203f786 | 802 | boolean |
7ed4093a SC |
803 | DEFUN(bfd_generic_get_section_contents, (abfd, section, location, offset, count), |
804 | bfd *abfd AND | |
805 | sec_ptr section AND | |
806 | PTR location AND | |
807 | file_ptr offset AND | |
808 | bfd_size_type count) | |
2203f786 JG |
809 | { |
810 | if (count == 0) | |
6f715d66 | 811 | return true; |
f8e01940 JG |
812 | if ((bfd_size_type)(offset+count) > section->_raw_size |
813 | || bfd_seek(abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1 | |
6f715d66 SC |
814 | || bfd_read(location, (bfd_size_type)1, count, abfd) != count) |
815 | return (false); /* on error */ | |
2203f786 JG |
816 | return (true); |
817 | } | |
6f715d66 | 818 | |
f58809fd SC |
819 | /* This generic function can only be used in implementations where creating |
820 | NEW sections is disallowed. It is useful in patching existing sections | |
821 | in read-write files, though. See other set_section_contents functions | |
822 | to see why it doesn't work for new sections. */ | |
823 | boolean | |
df34342b ILT |
824 | bfd_generic_set_section_contents (abfd, section, location, offset, count) |
825 | bfd *abfd; | |
826 | sec_ptr section; | |
827 | PTR location; | |
828 | file_ptr offset; | |
829 | bfd_size_type count; | |
f58809fd | 830 | { |
df34342b ILT |
831 | if (count == 0) |
832 | return true; | |
833 | ||
834 | if (offset + count > bfd_get_section_size_after_reloc (section)) | |
835 | { | |
836 | bfd_error = bad_value; | |
837 | return false; | |
838 | } | |
839 | ||
840 | if (bfd_seek (abfd, (file_ptr) (section->filepos + offset), SEEK_SET) == -1 | |
841 | || bfd_write (location, (bfd_size_type) 1, count, abfd) != count) | |
842 | return false; | |
843 | ||
844 | return true; | |
f58809fd SC |
845 | } |
846 | ||
f8e01940 JG |
847 | /* |
848 | INTERNAL_FUNCTION | |
849 | bfd_log2 | |
850 | ||
851 | DESCRIPTION | |
c188b0be DM |
852 | Return the log base 2 of the value supplied, rounded up. E.g., an |
853 | @var{x} of 1025 returns 11. | |
f8e01940 JG |
854 | |
855 | SYNOPSIS | |
b5b4294e | 856 | unsigned int bfd_log2(bfd_vma x); |
f8e01940 | 857 | */ |
6f715d66 | 858 | |
b5b4294e JG |
859 | unsigned |
860 | bfd_log2(x) | |
861 | bfd_vma x; | |
6f715d66 | 862 | { |
b5b4294e | 863 | unsigned result = 0; |
6f715d66 SC |
864 | while ( (bfd_vma)(1<< result) < x) |
865 | result++; | |
866 | return result; | |
867 | } |