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 | |
30 | This file contains various routines which are used within BFD. | |
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 | { |
7ed4093a | 124 | char *ptr = (char *) malloc ((int)size); |
4a81b561 DHW |
125 | |
126 | if ((ptr != NULL) && (size != 0)) | |
301dfc71 | 127 | memset(ptr,0, 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 | |
141 | Like malloc, but exit if no more memory. | |
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; | |
156 | ptr = (PTR)malloc(size); | |
1e310759 JG |
157 | if (!ptr) |
158 | { | |
159 | write (2, no_memory_message, sizeof(no_memory_message)-1); | |
160 | exit (-1); | |
161 | } | |
162 | return ptr; | |
163 | } | |
4a81b561 DHW |
164 | \f |
165 | /* Some IO code */ | |
166 | ||
167 | ||
168 | /* Note that archive entries don't have streams; they share their parent's. | |
f58809fd | 169 | This allows someone to play with the iostream behind BFD's back. |
4a81b561 DHW |
170 | |
171 | Also, note that the origin pointer points to the beginning of a file's | |
172 | contents (0 for non-archive elements). For archive entries this is the | |
173 | first octet in the file, NOT the beginning of the archive header. */ | |
174 | ||
7ed4093a SC |
175 | static |
176 | int DEFUN(real_read,(where, a,b, file), | |
6f715d66 SC |
177 | PTR where AND |
178 | int a AND | |
179 | int b AND | |
180 | FILE *file) | |
7ed4093a SC |
181 | { |
182 | return fread(where, a,b,file); | |
183 | } | |
23b0b558 | 184 | bfd_size_type |
7ed4093a SC |
185 | DEFUN(bfd_read,(ptr, size, nitems, abfd), |
186 | PTR ptr AND | |
187 | bfd_size_type size AND | |
188 | bfd_size_type nitems AND | |
189 | bfd *abfd) | |
4a81b561 | 190 | { |
0d552306 KR |
191 | int nread; |
192 | nread = real_read (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd)); | |
193 | #ifdef FILE_OFFSET_IS_CHAR_INDEX | |
194 | if (nread > 0) | |
195 | abfd->where += nread; | |
196 | #endif | |
197 | return nread; | |
4a81b561 DHW |
198 | } |
199 | ||
23b0b558 | 200 | bfd_size_type |
7ed4093a | 201 | DEFUN(bfd_write,(ptr, size, nitems, abfd), |
f58809fd | 202 | CONST PTR ptr AND |
7ed4093a SC |
203 | bfd_size_type size AND |
204 | bfd_size_type nitems AND | |
205 | bfd *abfd) | |
4a81b561 | 206 | { |
0d552306 KR |
207 | int nwrote = fwrite (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd)); |
208 | #ifdef FILE_OFFSET_IS_CHAR_INDEX | |
209 | if (nwrote > 0) | |
210 | abfd->where += nwrote; | |
211 | #endif | |
212 | return nwrote; | |
4a81b561 DHW |
213 | } |
214 | ||
f8e01940 JG |
215 | /* |
216 | INTERNAL_FUNCTION | |
217 | bfd_write_bigendian_4byte_int | |
218 | ||
219 | SYNOPSIS | |
220 | void bfd_write_bigendian_4byte_int(bfd *abfd, int i); | |
221 | ||
222 | DESCRIPTION | |
223 | Writes a 4 byte integer to the outputing bfd, in big endian | |
224 | mode regardless of what else is going on. This is usefull in | |
225 | archives. | |
1e310759 | 226 | |
1e310759 | 227 | */ |
f58809fd SC |
228 | void |
229 | DEFUN(bfd_write_bigendian_4byte_int,(abfd, i), | |
230 | bfd *abfd AND | |
231 | int i) | |
232 | { | |
1e310759 | 233 | bfd_byte buffer[4]; |
f58809fd | 234 | _do_putb32(i, buffer); |
1e310759 | 235 | bfd_write((PTR)buffer, 4, 1, abfd); |
f58809fd SC |
236 | } |
237 | ||
0d552306 KR |
238 | long |
239 | DEFUN(bfd_tell,(abfd), | |
240 | bfd *abfd) | |
241 | { | |
242 | file_ptr ptr; | |
243 | ||
244 | ptr = ftell (bfd_cache_lookup(abfd)); | |
245 | ||
246 | if (abfd->my_archive) | |
247 | ptr -= abfd->origin; | |
248 | abfd->where = ptr; | |
249 | return ptr; | |
250 | } | |
251 | ||
4a81b561 | 252 | int |
7ed4093a SC |
253 | DEFUN(bfd_seek,(abfd, position, direction), |
254 | bfd * CONST abfd AND | |
255 | CONST file_ptr position AND | |
256 | CONST int direction) | |
4a81b561 | 257 | { |
0d552306 KR |
258 | int result; |
259 | FILE *f; | |
e5b02860 | 260 | file_ptr file_position; |
0d552306 KR |
261 | /* For the time being, a BFD may not seek to it's end. The problem |
262 | is that we don't easily have a way to recognize the end of an | |
263 | element in an archive. */ | |
264 | ||
265 | BFD_ASSERT (direction == SEEK_SET || direction == SEEK_CUR); | |
266 | ||
b31d06ca | 267 | if (direction == SEEK_CUR && position == 0) |
0d552306 KR |
268 | return 0; |
269 | #ifdef FILE_OFFSET_IS_CHAR_INDEX | |
33446e90 | 270 | if (direction == SEEK_SET && position == abfd->where) |
0d552306 KR |
271 | return 0; |
272 | #endif | |
4a81b561 | 273 | |
0d552306 | 274 | f = bfd_cache_lookup (abfd); |
e5b02860 | 275 | file_position = position; |
0d552306 | 276 | if (direction == SEEK_SET && abfd->my_archive != NULL) |
e5b02860 KR |
277 | file_position += abfd->origin; |
278 | ||
279 | result = fseek (f, file_position, direction); | |
280 | ||
281 | if (result != 0) | |
282 | /* Force redetermination of `where' field. */ | |
283 | bfd_tell (abfd); | |
0d552306 KR |
284 | else |
285 | { | |
e5b02860 KR |
286 | #ifdef FILE_OFFSET_IS_CHAR_INDEX |
287 | /* Adjust `where' field. */ | |
288 | if (direction == SEEK_SET) | |
289 | abfd->where = position; | |
290 | else | |
291 | abfd->where += position; | |
292 | #endif | |
0d552306 | 293 | } |
e5b02860 | 294 | return result; |
4a81b561 DHW |
295 | } |
296 | \f | |
297 | /** Make a string table */ | |
298 | ||
6f715d66 SC |
299 | /*>bfd.h< |
300 | Add string to table pointed to by table, at location starting with free_ptr. | |
4a81b561 DHW |
301 | resizes the table if necessary (if it's NULL, creates it, ignoring |
302 | table_length). Updates free_ptr, table, table_length */ | |
303 | ||
304 | boolean | |
536b27a5 SC |
305 | DEFUN(bfd_add_to_string_table,(table, new_string, table_length, free_ptr), |
306 | char **table AND | |
536b27a5 | 307 | char *new_string AND |
5ad1d830 SC |
308 | unsigned int *table_length AND |
309 | char **free_ptr) | |
4a81b561 DHW |
310 | { |
311 | size_t string_length = strlen (new_string) + 1; /* include null here */ | |
312 | char *base = *table; | |
313 | size_t space_length = *table_length; | |
314 | unsigned int offset = (base ? *free_ptr - base : 0); | |
315 | ||
316 | if (base == NULL) { | |
317 | /* Avoid a useless regrow if we can (but of course we still | |
318 | take it next time */ | |
319 | space_length = (string_length < DEFAULT_STRING_SPACE_SIZE ? | |
6f715d66 | 320 | DEFAULT_STRING_SPACE_SIZE : string_length+1); |
4a81b561 DHW |
321 | base = zalloc (space_length); |
322 | ||
323 | if (base == NULL) { | |
324 | bfd_error = no_memory; | |
325 | return false; | |
326 | } | |
327 | } | |
328 | ||
329 | if ((size_t)(offset + string_length) >= space_length) { | |
330 | /* Make sure we will have enough space */ | |
331 | while ((size_t)(offset + string_length) >= space_length) | |
332 | space_length += space_length/2; /* grow by 50% */ | |
333 | ||
334 | base = (char *) realloc (base, space_length); | |
335 | if (base == NULL) { | |
336 | bfd_error = no_memory; | |
337 | return false; | |
338 | } | |
339 | ||
340 | } | |
341 | ||
342 | memcpy (base + offset, new_string, string_length); | |
343 | *table = base; | |
344 | *table_length = space_length; | |
345 | *free_ptr = base + offset + string_length; | |
346 | ||
347 | return true; | |
348 | } | |
349 | \f | |
350 | /** The do-it-yourself (byte) sex-change kit */ | |
351 | ||
352 | /* The middle letter e.g. get<b>short indicates Big or Little endian | |
353 | target machine. It doesn't matter what the byte order of the host | |
354 | machine is; these routines work for either. */ | |
355 | ||
356 | /* FIXME: Should these take a count argument? | |
357 | Answer (gnu@cygnus.com): No, but perhaps they should be inline | |
6f715d66 SC |
358 | functions in swap.h #ifdef __GNUC__. |
359 | Gprof them later and find out. */ | |
360 | ||
f8e01940 JG |
361 | /* |
362 | FUNCTION | |
363 | bfd_put_size | |
364 | FUNCTION | |
365 | bfd_get_size | |
366 | ||
367 | DESCRIPTION | |
368 | These macros as used for reading and writing raw data in | |
369 | sections; each access (except for bytes) is vectored through | |
370 | the target format of the BFD and mangled accordingly. The | |
371 | mangling performs any necessary endian translations and | |
372 | removes alignment restrictions. | |
373 | ||
374 | .#define bfd_put_8(abfd, val, ptr) \ | |
375 | . (*((char *)ptr) = (char)val) | |
376 | .#define bfd_get_8(abfd, ptr) \ | |
377 | . (*((char *)ptr)) | |
378 | .#define bfd_put_16(abfd, val, ptr) \ | |
379 | . BFD_SEND(abfd, bfd_putx16, (val,ptr)) | |
380 | .#define bfd_get_16(abfd, ptr) \ | |
381 | . BFD_SEND(abfd, bfd_getx16, (ptr)) | |
382 | .#define bfd_put_32(abfd, val, ptr) \ | |
383 | . BFD_SEND(abfd, bfd_putx32, (val,ptr)) | |
384 | .#define bfd_get_32(abfd, ptr) \ | |
385 | . BFD_SEND(abfd, bfd_getx32, (ptr)) | |
386 | .#define bfd_put_64(abfd, val, ptr) \ | |
387 | . BFD_SEND(abfd, bfd_putx64, (val, ptr)) | |
388 | .#define bfd_get_64(abfd, ptr) \ | |
389 | . BFD_SEND(abfd, bfd_getx64, (ptr)) | |
390 | ||
391 | */ | |
392 | ||
393 | /* | |
394 | FUNCTION | |
395 | bfd_h_put_size | |
396 | FUNCTION | |
397 | bfd_h_get_size | |
398 | ||
399 | DESCRIPTION | |
400 | These macros have the same function as their <<bfd_get_x>> | |
401 | bretherin, except that they are used for removing information | |
402 | for the header records of object files. Believe it or not, | |
403 | some object files keep their header records in big endian | |
404 | order, and their data in little endan order. | |
405 | ||
406 | .#define bfd_h_put_8(abfd, val, ptr) \ | |
407 | . (*((char *)ptr) = (char)val) | |
408 | .#define bfd_h_get_8(abfd, ptr) \ | |
409 | . (*((char *)ptr)) | |
410 | .#define bfd_h_put_16(abfd, val, ptr) \ | |
411 | . BFD_SEND(abfd, bfd_h_putx16,(val,ptr)) | |
412 | .#define bfd_h_get_16(abfd, ptr) \ | |
413 | . BFD_SEND(abfd, bfd_h_getx16,(ptr)) | |
414 | .#define bfd_h_put_32(abfd, val, ptr) \ | |
415 | . BFD_SEND(abfd, bfd_h_putx32,(val,ptr)) | |
416 | .#define bfd_h_get_32(abfd, ptr) \ | |
417 | . BFD_SEND(abfd, bfd_h_getx32,(ptr)) | |
418 | .#define bfd_h_put_64(abfd, val, ptr) \ | |
419 | . BFD_SEND(abfd, bfd_h_putx64,(val, ptr)) | |
420 | .#define bfd_h_get_64(abfd, ptr) \ | |
421 | . BFD_SEND(abfd, bfd_h_getx64,(ptr)) | |
422 | ||
423 | */ | |
4a81b561 | 424 | |
f58809fd | 425 | bfd_vma |
536b27a5 SC |
426 | DEFUN(_do_getb16,(addr), |
427 | register bfd_byte *addr) | |
4a81b561 | 428 | { |
6f715d66 | 429 | return (addr[0] << 8) | addr[1]; |
4a81b561 DHW |
430 | } |
431 | ||
f58809fd | 432 | bfd_vma |
536b27a5 SC |
433 | DEFUN(_do_getl16,(addr), |
434 | register bfd_byte *addr) | |
4a81b561 | 435 | { |
6f715d66 | 436 | return (addr[1] << 8) | addr[0]; |
4a81b561 DHW |
437 | } |
438 | ||
439 | void | |
536b27a5 | 440 | DEFUN(_do_putb16,(data, addr), |
f58809fd | 441 | bfd_vma data AND |
536b27a5 | 442 | register bfd_byte *addr) |
4a81b561 | 443 | { |
6f715d66 SC |
444 | addr[0] = (bfd_byte)(data >> 8); |
445 | addr[1] = (bfd_byte )data; | |
4a81b561 DHW |
446 | } |
447 | ||
448 | void | |
536b27a5 | 449 | DEFUN(_do_putl16,(data, addr), |
f58809fd | 450 | bfd_vma data AND |
536b27a5 | 451 | register bfd_byte *addr) |
4a81b561 | 452 | { |
6f715d66 SC |
453 | addr[0] = (bfd_byte )data; |
454 | addr[1] = (bfd_byte)(data >> 8); | |
4a81b561 DHW |
455 | } |
456 | ||
f58809fd | 457 | bfd_vma |
536b27a5 SC |
458 | DEFUN(_do_getb32,(addr), |
459 | register bfd_byte *addr) | |
4a81b561 | 460 | { |
6f715d66 | 461 | return ((((addr[0] << 8) | addr[1]) << 8) | addr[2]) << 8 | addr[3]; |
4a81b561 DHW |
462 | } |
463 | ||
f58809fd | 464 | bfd_vma |
7ed4093a | 465 | _do_getl32 (addr) |
6f715d66 | 466 | register bfd_byte *addr; |
4a81b561 | 467 | { |
6f715d66 | 468 | return ((((addr[3] << 8) | addr[2]) << 8) | addr[1]) << 8 | addr[0]; |
4a81b561 DHW |
469 | } |
470 | ||
f58809fd | 471 | bfd_vma |
536b27a5 SC |
472 | DEFUN(_do_getb64,(addr), |
473 | register bfd_byte *addr) | |
7ed4093a | 474 | { |
536b27a5 | 475 | #ifdef HOST_64_BIT |
7ed4093a | 476 | bfd_64_type low, high; |
536b27a5 | 477 | |
7ed4093a | 478 | high= ((((((((addr[0]) << 8) | |
6f715d66 SC |
479 | addr[1]) << 8) | |
480 | addr[2]) << 8) | | |
481 | addr[3]) ); | |
7ed4093a SC |
482 | |
483 | low = ((((((((addr[4]) << 8) | | |
6f715d66 SC |
484 | addr[5]) << 8) | |
485 | addr[6]) << 8) | | |
486 | addr[7])); | |
7ed4093a SC |
487 | |
488 | return high << 32 | low; | |
489 | #else | |
490 | BFD_FAIL(); | |
f58809fd | 491 | return 0; |
7ed4093a SC |
492 | #endif |
493 | ||
494 | } | |
495 | ||
f58809fd | 496 | bfd_vma |
5ad1d830 | 497 | DEFUN(_do_getl64,(addr), |
536b27a5 | 498 | register bfd_byte *addr) |
7ed4093a | 499 | { |
6f715d66 | 500 | |
536b27a5 | 501 | #ifdef HOST_64_BIT |
6f715d66 | 502 | bfd_64_type low, high; |
7ed4093a | 503 | high= (((((((addr[7] << 8) | |
6f715d66 SC |
504 | addr[6]) << 8) | |
505 | addr[5]) << 8) | | |
506 | addr[4])); | |
7ed4093a SC |
507 | |
508 | low = (((((((addr[3] << 8) | | |
6f715d66 SC |
509 | addr[2]) << 8) | |
510 | addr[1]) << 8) | | |
511 | addr[0]) ); | |
7ed4093a SC |
512 | |
513 | return high << 32 | low; | |
514 | #else | |
515 | BFD_FAIL(); | |
f58809fd | 516 | return 0; |
7ed4093a | 517 | #endif |
6f715d66 | 518 | |
7ed4093a SC |
519 | } |
520 | ||
4a81b561 | 521 | void |
536b27a5 | 522 | DEFUN(_do_putb32,(data, addr), |
f58809fd | 523 | bfd_vma data AND |
536b27a5 | 524 | register bfd_byte *addr) |
4a81b561 | 525 | { |
6f715d66 SC |
526 | addr[0] = (bfd_byte)(data >> 24); |
527 | addr[1] = (bfd_byte)(data >> 16); | |
528 | addr[2] = (bfd_byte)(data >> 8); | |
529 | addr[3] = (bfd_byte)data; | |
4a81b561 DHW |
530 | } |
531 | ||
532 | void | |
536b27a5 | 533 | DEFUN(_do_putl32,(data, addr), |
f58809fd | 534 | bfd_vma data AND |
536b27a5 | 535 | register bfd_byte *addr) |
4a81b561 | 536 | { |
6f715d66 SC |
537 | addr[0] = (bfd_byte)data; |
538 | addr[1] = (bfd_byte)(data >> 8); | |
539 | addr[2] = (bfd_byte)(data >> 16); | |
540 | addr[3] = (bfd_byte)(data >> 24); | |
4a81b561 | 541 | } |
7ed4093a | 542 | void |
536b27a5 | 543 | DEFUN(_do_putb64,(data, addr), |
f58809fd | 544 | bfd_vma data AND |
6f715d66 | 545 | register bfd_byte *addr) |
7ed4093a | 546 | { |
536b27a5 SC |
547 | #ifdef HOST_64_BIT |
548 | addr[0] = (bfd_byte)(data >> (7*8)); | |
549 | addr[1] = (bfd_byte)(data >> (6*8)); | |
550 | addr[2] = (bfd_byte)(data >> (5*8)); | |
551 | addr[3] = (bfd_byte)(data >> (4*8)); | |
552 | addr[4] = (bfd_byte)(data >> (3*8)); | |
553 | addr[5] = (bfd_byte)(data >> (2*8)); | |
554 | addr[6] = (bfd_byte)(data >> (1*8)); | |
555 | addr[7] = (bfd_byte)(data >> (0*8)); | |
7ed4093a | 556 | #else |
536b27a5 | 557 | BFD_FAIL(); |
7ed4093a SC |
558 | #endif |
559 | ||
560 | } | |
561 | ||
562 | void | |
536b27a5 | 563 | DEFUN(_do_putl64,(data, addr), |
f58809fd | 564 | bfd_vma data AND |
536b27a5 | 565 | register bfd_byte *addr) |
7ed4093a | 566 | { |
536b27a5 SC |
567 | #ifdef HOST_64_BIT |
568 | addr[7] = (bfd_byte)(data >> (7*8)); | |
569 | addr[6] = (bfd_byte)(data >> (6*8)); | |
570 | addr[5] = (bfd_byte)(data >> (5*8)); | |
571 | addr[4] = (bfd_byte)(data >> (4*8)); | |
572 | addr[3] = (bfd_byte)(data >> (3*8)); | |
573 | addr[2] = (bfd_byte)(data >> (2*8)); | |
574 | addr[1] = (bfd_byte)(data >> (1*8)); | |
575 | addr[0] = (bfd_byte)(data >> (0*8)); | |
7ed4093a | 576 | #else |
536b27a5 | 577 | BFD_FAIL(); |
7ed4093a SC |
578 | #endif |
579 | ||
580 | } | |
581 | ||
2203f786 JG |
582 | \f |
583 | /* Default implementation */ | |
4a81b561 | 584 | |
2203f786 | 585 | boolean |
7ed4093a SC |
586 | DEFUN(bfd_generic_get_section_contents, (abfd, section, location, offset, count), |
587 | bfd *abfd AND | |
588 | sec_ptr section AND | |
589 | PTR location AND | |
590 | file_ptr offset AND | |
591 | bfd_size_type count) | |
2203f786 JG |
592 | { |
593 | if (count == 0) | |
6f715d66 | 594 | return true; |
f8e01940 JG |
595 | if ((bfd_size_type)(offset+count) > section->_raw_size |
596 | || bfd_seek(abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1 | |
6f715d66 SC |
597 | || bfd_read(location, (bfd_size_type)1, count, abfd) != count) |
598 | return (false); /* on error */ | |
2203f786 JG |
599 | return (true); |
600 | } | |
6f715d66 | 601 | |
f58809fd SC |
602 | /* This generic function can only be used in implementations where creating |
603 | NEW sections is disallowed. It is useful in patching existing sections | |
604 | in read-write files, though. See other set_section_contents functions | |
605 | to see why it doesn't work for new sections. */ | |
606 | boolean | |
607 | DEFUN(bfd_generic_set_section_contents, (abfd, section, location, offset, count), | |
608 | bfd *abfd AND | |
609 | sec_ptr section AND | |
610 | PTR location AND | |
611 | file_ptr offset AND | |
612 | bfd_size_type count) | |
613 | { | |
614 | if (count == 0) | |
615 | return true; | |
f8e01940 | 616 | if ((bfd_size_type)(offset+count) > bfd_get_section_size_after_reloc(section) |
f58809fd SC |
617 | || bfd_seek(abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1 |
618 | || bfd_write(location, (bfd_size_type)1, count, abfd) != count) | |
619 | return (false); /* on error */ | |
620 | return (true); | |
621 | } | |
622 | ||
f8e01940 JG |
623 | /* |
624 | INTERNAL_FUNCTION | |
625 | bfd_log2 | |
626 | ||
627 | DESCRIPTION | |
628 | Return the log base 2 of the value supplied, rounded up. eg an | |
629 | arg of 1025 would return 11. | |
630 | ||
631 | SYNOPSIS | |
632 | bfd_vma bfd_log2(bfd_vma x); | |
633 | */ | |
6f715d66 SC |
634 | |
635 | bfd_vma bfd_log2(x) | |
636 | bfd_vma x; | |
637 | { | |
638 | bfd_vma result = 0; | |
639 | while ( (bfd_vma)(1<< result) < x) | |
640 | result++; | |
641 | return result; | |
642 | } |