1 /* Assorted BFD support routines, only used internally.
2 Copyright 1990, 91, 92, 93, 94 Free Software Foundation, Inc.
3 Written by Cygnus Support.
5 This file is part of BFD, the Binary File Descriptor library.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
25 static int real_read
PARAMS ((PTR
, size_t, size_t, FILE *));
32 These routines are used within BFD.
33 They are not intended for export, but are documented here for
37 /* A routine which is used in target vectors for unsupported
45 bfd_set_error (bfd_error_invalid_operation
);
49 /* A routine which is used in target vectors for supported operations
50 which do not actually do anything. */
60 /* A routine which is used in target vectors for unsupported
61 operations which return a pointer value. */
65 bfd_nullvoidptr (ignore
)
68 bfd_set_error (bfd_error_invalid_operation
);
96 /* A routine which is used in target vectors for unsupported
97 operations which return -1 on error. */
101 _bfd_n1 (ignore_abfd
)
104 bfd_set_error (bfd_error_invalid_operation
);
117 _bfd_nocore_core_file_matches_executable_p (ignore_core_bfd
, ignore_exec_bfd
)
118 bfd
*ignore_core_bfd
;
119 bfd
*ignore_exec_bfd
;
121 bfd_set_error (bfd_error_invalid_operation
);
125 /* Routine to handle core_file_failing_command entry point for targets
126 without core file support. */
130 _bfd_nocore_core_file_failing_command (ignore_abfd
)
133 bfd_set_error (bfd_error_invalid_operation
);
137 /* Routine to handle core_file_failing_signal entry point for targets
138 without core file support. */
142 _bfd_nocore_core_file_failing_signal (ignore_abfd
)
145 bfd_set_error (bfd_error_invalid_operation
);
151 _bfd_dummy_target (ignore_abfd
)
154 bfd_set_error (bfd_error_wrong_format
);
160 /* allocate and clear storage */
166 char *ptr
= (char *) malloc ((size_t) size
);
169 memset(ptr
, 0, (size_t) size
);
173 #endif /* bfd_zmalloc */
178 /* Note that archive entries don't have streams; they share their parent's.
179 This allows someone to play with the iostream behind BFD's back.
181 Also, note that the origin pointer points to the beginning of a file's
182 contents (0 for non-archive elements). For archive entries this is the
183 first octet in the file, NOT the beginning of the archive header. */
186 real_read (where
, a
,b
, file
)
192 return fread (where
, a
, b
, file
);
195 /* Return value is amount read (FIXME: how are errors and end of file dealt
196 with? We never call bfd_set_error, which is probably a mistake). */
199 bfd_read (ptr
, size
, nitems
, abfd
)
202 bfd_size_type nitems
;
206 nread
= real_read (ptr
, 1, (size_t)(size
*nitems
), bfd_cache_lookup(abfd
));
207 #ifdef FILE_OFFSET_IS_CHAR_INDEX
209 abfd
->where
+= nread
;
212 /* Set bfd_error if we did not read as much data as we expected.
214 If the read failed due to an error set the bfd_error_system_call,
215 else set bfd_error_file_truncated.
217 A BFD backend may wish to override bfd_error_file_truncated to
218 provide something more useful (eg. no_symbols or wrong_format). */
219 if (nread
< (int)(size
* nitems
))
221 if (ferror (bfd_cache_lookup (abfd
)))
222 bfd_set_error (bfd_error_system_call
);
224 bfd_set_error (bfd_error_file_truncated
);
230 /* The window support stuff should probably be broken out into
232 /* The idea behind the next and refcount fields is that one mapped
233 region can suffice for multiple read-only windows or multiple
234 non-overlapping read-write windows. It's not implemented yet
236 struct _bfd_window_internal
{
237 struct _bfd_window_internal
*next
;
240 int refcount
: 31; /* should be enough... */
241 unsigned mapped
: 1; /* 1 = mmap, 0 = malloc */
245 bfd_init_window (windowp
)
253 #undef HAVE_MPROTECT /* code's not tested yet */
255 #if HAVE_MMAP || HAVE_MPROTECT
256 #include <sys/types.h>
257 #include <sys/mman.h>
264 static int debug_windows
;
267 bfd_free_window (windowp
)
270 bfd_window_internal
*i
= windowp
->i
;
277 fprintf (stderr
, "freeing window @%p<%p,%lx,%p>\n",
278 windowp
, windowp
->data
, windowp
->size
, windowp
->i
);
279 if (i
->refcount
!= 0)
285 munmap (i
->data
, i
->size
);
292 mprotect (i
->data
, i
->size
, PROT_READ
| PROT_WRITE
);
299 /* There should be no more references to i at this point. */
303 static int ok_to_map
= 1;
306 bfd_get_file_window (abfd
, offset
, size
, windowp
, writable
)
313 static size_t pagesize
;
314 bfd_window_internal
*i
= windowp
->i
;
315 size_t size_to_alloc
= size
;
318 fprintf (stderr
, "bfd_get_file_window (%p, %6ld, %6ld, %p<%p,%lx,%p>, %d)",
319 abfd
, (long) offset
, (long) size
,
320 windowp
, windowp
->data
, windowp
->size
, windowp
->i
,
323 /* Make sure we know the page size, so we can be friendly to mmap. */
325 pagesize
= getpagesize ();
331 windowp
->i
= i
= (bfd_window_internal
*) bfd_zmalloc (sizeof (bfd_window_internal
));
337 if (ok_to_map
&& (i
->data
== 0 || i
->mapped
== 1))
339 file_ptr file_offset
, offset2
;
344 /* Find the real file and the real offset into it. */
345 while (abfd
->my_archive
!= NULL
)
347 offset
+= abfd
->origin
;
348 abfd
= abfd
->my_archive
;
350 f
= bfd_cache_lookup (abfd
);
353 /* Compute offsets and size for mmap and for the user's data. */
354 offset2
= offset
% pagesize
;
357 file_offset
= offset
- offset2
;
358 real_size
= offset
+ size
- file_offset
;
359 real_size
= real_size
+ pagesize
- 1;
360 real_size
-= real_size
% pagesize
;
362 /* If we're re-using a memory region, make sure it's big enough. */
363 if (i
->data
&& i
->size
< size
)
365 munmap (i
->data
, i
->size
);
368 i
->data
= mmap (i
->data
, real_size
,
369 writable
? PROT_WRITE
| PROT_READ
: PROT_READ
,
370 writable
? MAP_FILE
| MAP_PRIVATE
: MAP_FILE
,
372 if (i
->data
== (PTR
) -1)
374 /* An error happened. Report it, or try using malloc, or
376 bfd_set_error (bfd_error_system_call
);
380 fprintf (stderr
, "\t\tmmap failed!\n");
384 fprintf (stderr
, "\n\tmapped %ld at %p, offset is %ld\n",
385 (long) real_size
, i
->data
, (long) offset2
);
387 windowp
->data
= i
->data
+ offset2
;
388 windowp
->size
= size
;
392 else if (debug_windows
)
395 fprintf (stderr
, "not mapping: data=%x mapped=%d\n",
398 fprintf (stderr
, "not mapping: env var not set\n");
407 size_to_alloc
+= pagesize
- 1;
408 size_to_alloc
-= size_to_alloc
% pagesize
;
412 fprintf (stderr
, "\n\t%s(%6ld)",
413 i
->data
? "realloc" : " malloc", (long) size_to_alloc
);
415 i
->data
= realloc (i
->data
, size_to_alloc
);
417 i
->data
= malloc (size_to_alloc
);
419 fprintf (stderr
, "\t-> %p\n", i
->data
);
422 return size_to_alloc
== 0;
423 if (bfd_seek (abfd
, offset
, SEEK_SET
) != 0)
425 i
->size
= bfd_read (i
->data
, size
, 1, abfd
);
433 fprintf (stderr
, "\tmprotect (%p, %ld, PROT_READ)\n", i
->data
,
435 mprotect (i
->data
, i
->size
, PROT_READ
);
438 windowp
->data
= i
->data
;
439 windowp
->size
= i
->size
;
444 bfd_write (ptr
, size
, nitems
, abfd
)
447 bfd_size_type nitems
;
450 long nwrote
= fwrite (ptr
, 1, (size_t) (size
* nitems
),
451 bfd_cache_lookup (abfd
));
452 #ifdef FILE_OFFSET_IS_CHAR_INDEX
454 abfd
->where
+= nwrote
;
456 if ((bfd_size_type
) nwrote
!= size
* nitems
)
462 bfd_set_error (bfd_error_system_call
);
469 bfd_write_bigendian_4byte_int
472 void bfd_write_bigendian_4byte_int(bfd *abfd, int i);
475 Write a 4 byte integer @var{i} to the output BFD @var{abfd}, in big
476 endian order regardless of what else is going on. This is useful in
481 bfd_write_bigendian_4byte_int (abfd
, i
)
486 bfd_putb32(i
, buffer
);
487 if (bfd_write((PTR
)buffer
, 4, 1, abfd
) != 4)
497 ptr
= ftell (bfd_cache_lookup(abfd
));
499 if (abfd
->my_archive
)
509 return fflush (bfd_cache_lookup(abfd
));
512 /* Returns 0 for success, negative value for failure (in which case
513 bfd_get_error can retrieve the error code). */
515 bfd_stat (abfd
, statbuf
)
517 struct stat
*statbuf
;
521 f
= bfd_cache_lookup (abfd
);
524 bfd_set_error (bfd_error_system_call
);
527 result
= fstat (fileno (f
), statbuf
);
529 bfd_set_error (bfd_error_system_call
);
533 /* Returns 0 for success, nonzero for failure (in which case bfd_get_error
534 can retrieve the error code). */
537 bfd_seek (abfd
, position
, direction
)
544 file_ptr file_position
;
545 /* For the time being, a BFD may not seek to it's end. The problem
546 is that we don't easily have a way to recognize the end of an
547 element in an archive. */
549 BFD_ASSERT (direction
== SEEK_SET
|| direction
== SEEK_CUR
);
551 if (direction
== SEEK_CUR
&& position
== 0)
553 #ifdef FILE_OFFSET_IS_CHAR_INDEX
554 if (abfd
->format
!= bfd_archive
&& abfd
->my_archive
== 0)
557 /* Explanation for this code: I'm only about 95+% sure that the above
558 conditions are sufficient and that all i/o calls are properly
559 adjusting the `where' field. So this is sort of an `assert'
560 that the `where' field is correct. If we can go a while without
561 tripping the abort, we can probably safely disable this code,
562 so that the real optimizations happen. */
563 file_ptr where_am_i_now
;
564 where_am_i_now
= ftell (bfd_cache_lookup (abfd
));
565 if (abfd
->my_archive
)
566 where_am_i_now
-= abfd
->origin
;
567 if (where_am_i_now
!= abfd
->where
)
570 if (direction
== SEEK_SET
&& position
== abfd
->where
)
575 /* We need something smarter to optimize access to archives.
576 Currently, anything inside an archive is read via the file
577 handle for the archive. Which means that a bfd_seek on one
578 component affects the `current position' in the archive, as
579 well as in any other component.
581 It might be sufficient to put a spike through the cache
582 abstraction, and look to the archive for the file position,
583 but I think we should try for something cleaner.
585 In the meantime, no optimization for archives. */
589 f
= bfd_cache_lookup (abfd
);
590 file_position
= position
;
591 if (direction
== SEEK_SET
&& abfd
->my_archive
!= NULL
)
592 file_position
+= abfd
->origin
;
594 result
= fseek (f
, file_position
, direction
);
598 /* Force redetermination of `where' field. */
600 bfd_set_error (bfd_error_system_call
);
604 #ifdef FILE_OFFSET_IS_CHAR_INDEX
605 /* Adjust `where' field. */
606 if (direction
== SEEK_SET
)
607 abfd
->where
= position
;
609 abfd
->where
+= position
;
615 /** The do-it-yourself (byte) sex-change kit */
617 /* The middle letter e.g. get<b>short indicates Big or Little endian
618 target machine. It doesn't matter what the byte order of the host
619 machine is; these routines work for either. */
621 /* FIXME: Should these take a count argument?
622 Answer (gnu@cygnus.com): No, but perhaps they should be inline
623 functions in swap.h #ifdef __GNUC__.
624 Gprof them later and find out. */
633 These macros as used for reading and writing raw data in
634 sections; each access (except for bytes) is vectored through
635 the target format of the BFD and mangled accordingly. The
636 mangling performs any necessary endian translations and
637 removes alignment restrictions. Note that types accepted and
638 returned by these macros are identical so they can be swapped
639 around in macros---for example, @file{libaout.h} defines <<GET_WORD>>
640 to either <<bfd_get_32>> or <<bfd_get_64>>.
642 In the put routines, @var{val} must be a <<bfd_vma>>. If we are on a
643 system without prototypes, the caller is responsible for making
644 sure that is true, with a cast if necessary. We don't cast
645 them in the macro definitions because that would prevent <<lint>>
646 or <<gcc -Wall>> from detecting sins such as passing a pointer.
647 To detect calling these with less than a <<bfd_vma>>, use
648 <<gcc -Wconversion>> on a host with 64 bit <<bfd_vma>>'s.
651 .{* Byte swapping macros for user section data. *}
653 .#define bfd_put_8(abfd, val, ptr) \
654 . (*((unsigned char *)(ptr)) = (unsigned char)(val))
655 .#define bfd_put_signed_8 \
657 .#define bfd_get_8(abfd, ptr) \
658 . (*(unsigned char *)(ptr))
659 .#define bfd_get_signed_8(abfd, ptr) \
660 . ((*(unsigned char *)(ptr) ^ 0x80) - 0x80)
662 .#define bfd_put_16(abfd, val, ptr) \
663 . BFD_SEND(abfd, bfd_putx16, ((val),(ptr)))
664 .#define bfd_put_signed_16 \
666 .#define bfd_get_16(abfd, ptr) \
667 . BFD_SEND(abfd, bfd_getx16, (ptr))
668 .#define bfd_get_signed_16(abfd, ptr) \
669 . BFD_SEND (abfd, bfd_getx_signed_16, (ptr))
671 .#define bfd_put_32(abfd, val, ptr) \
672 . BFD_SEND(abfd, bfd_putx32, ((val),(ptr)))
673 .#define bfd_put_signed_32 \
675 .#define bfd_get_32(abfd, ptr) \
676 . BFD_SEND(abfd, bfd_getx32, (ptr))
677 .#define bfd_get_signed_32(abfd, ptr) \
678 . BFD_SEND(abfd, bfd_getx_signed_32, (ptr))
680 .#define bfd_put_64(abfd, val, ptr) \
681 . BFD_SEND(abfd, bfd_putx64, ((val), (ptr)))
682 .#define bfd_put_signed_64 \
684 .#define bfd_get_64(abfd, ptr) \
685 . BFD_SEND(abfd, bfd_getx64, (ptr))
686 .#define bfd_get_signed_64(abfd, ptr) \
687 . BFD_SEND(abfd, bfd_getx_signed_64, (ptr))
697 These macros have the same function as their <<bfd_get_x>>
698 bretheren, except that they are used for removing information
699 for the header records of object files. Believe it or not,
700 some object files keep their header records in big endian
701 order and their data in little endian order.
703 .{* Byte swapping macros for file header data. *}
705 .#define bfd_h_put_8(abfd, val, ptr) \
706 . bfd_put_8 (abfd, val, ptr)
707 .#define bfd_h_put_signed_8(abfd, val, ptr) \
708 . bfd_put_8 (abfd, val, ptr)
709 .#define bfd_h_get_8(abfd, ptr) \
710 . bfd_get_8 (abfd, ptr)
711 .#define bfd_h_get_signed_8(abfd, ptr) \
712 . bfd_get_signed_8 (abfd, ptr)
714 .#define bfd_h_put_16(abfd, val, ptr) \
715 . BFD_SEND(abfd, bfd_h_putx16,(val,ptr))
716 .#define bfd_h_put_signed_16 \
718 .#define bfd_h_get_16(abfd, ptr) \
719 . BFD_SEND(abfd, bfd_h_getx16,(ptr))
720 .#define bfd_h_get_signed_16(abfd, ptr) \
721 . BFD_SEND(abfd, bfd_h_getx_signed_16, (ptr))
723 .#define bfd_h_put_32(abfd, val, ptr) \
724 . BFD_SEND(abfd, bfd_h_putx32,(val,ptr))
725 .#define bfd_h_put_signed_32 \
727 .#define bfd_h_get_32(abfd, ptr) \
728 . BFD_SEND(abfd, bfd_h_getx32,(ptr))
729 .#define bfd_h_get_signed_32(abfd, ptr) \
730 . BFD_SEND(abfd, bfd_h_getx_signed_32, (ptr))
732 .#define bfd_h_put_64(abfd, val, ptr) \
733 . BFD_SEND(abfd, bfd_h_putx64,(val, ptr))
734 .#define bfd_h_put_signed_64 \
736 .#define bfd_h_get_64(abfd, ptr) \
737 . BFD_SEND(abfd, bfd_h_getx64,(ptr))
738 .#define bfd_h_get_signed_64(abfd, ptr) \
739 . BFD_SEND(abfd, bfd_h_getx_signed_64, (ptr))
743 /* Sign extension to bfd_signed_vma. */
744 #define COERCE16(x) (((bfd_signed_vma) (x) ^ 0x8000) - 0x8000)
745 #define COERCE32(x) (((bfd_signed_vma) (x) ^ 0x80000000) - 0x80000000)
746 #define EIGHT_GAZILLION (((BFD_HOST_64_BIT)0x80000000) << 32)
747 #define COERCE64(x) \
748 (((bfd_signed_vma) (x) ^ EIGHT_GAZILLION) - EIGHT_GAZILLION)
752 register const bfd_byte
*addr
;
754 return (addr
[0] << 8) | addr
[1];
759 register const bfd_byte
*addr
;
761 return (addr
[1] << 8) | addr
[0];
765 bfd_getb_signed_16 (addr
)
766 register const bfd_byte
*addr
;
768 return COERCE16((addr
[0] << 8) | addr
[1]);
772 bfd_getl_signed_16 (addr
)
773 register const bfd_byte
*addr
;
775 return COERCE16((addr
[1] << 8) | addr
[0]);
779 bfd_putb16 (data
, addr
)
781 register bfd_byte
*addr
;
783 addr
[0] = (bfd_byte
)(data
>> 8);
784 addr
[1] = (bfd_byte
)data
;
788 bfd_putl16 (data
, addr
)
790 register bfd_byte
*addr
;
792 addr
[0] = (bfd_byte
)data
;
793 addr
[1] = (bfd_byte
)(data
>> 8);
798 register const bfd_byte
*addr
;
800 return (((((bfd_vma
)addr
[0] << 8) | addr
[1]) << 8)
801 | addr
[2]) << 8 | addr
[3];
806 register const bfd_byte
*addr
;
808 return (((((bfd_vma
)addr
[3] << 8) | addr
[2]) << 8)
809 | addr
[1]) << 8 | addr
[0];
813 bfd_getb_signed_32 (addr
)
814 register const bfd_byte
*addr
;
816 return COERCE32((((((bfd_vma
)addr
[0] << 8) | addr
[1]) << 8)
817 | addr
[2]) << 8 | addr
[3]);
821 bfd_getl_signed_32 (addr
)
822 register const bfd_byte
*addr
;
824 return COERCE32((((((bfd_vma
)addr
[3] << 8) | addr
[2]) << 8)
825 | addr
[1]) << 8 | addr
[0]);
830 register const bfd_byte
*addr
;
835 high
= ((((((((addr
[0]) << 8) |
840 low
= (((((((((bfd_vma
)addr
[4]) << 8) |
845 return high
<< 32 | low
;
854 register const bfd_byte
*addr
;
858 high
= (((((((addr
[7] << 8) |
863 low
= ((((((((bfd_vma
)addr
[3] << 8) |
868 return high
<< 32 | low
;
877 bfd_getb_signed_64 (addr
)
878 register const bfd_byte
*addr
;
883 high
= ((((((((addr
[0]) << 8) |
888 low
= (((((((((bfd_vma
)addr
[4]) << 8) |
893 return COERCE64(high
<< 32 | low
);
901 bfd_getl_signed_64 (addr
)
902 register const bfd_byte
*addr
;
906 high
= (((((((addr
[7] << 8) |
911 low
= ((((((((bfd_vma
)addr
[3] << 8) |
916 return COERCE64(high
<< 32 | low
);
924 bfd_putb32 (data
, addr
)
926 register bfd_byte
*addr
;
928 addr
[0] = (bfd_byte
)(data
>> 24);
929 addr
[1] = (bfd_byte
)(data
>> 16);
930 addr
[2] = (bfd_byte
)(data
>> 8);
931 addr
[3] = (bfd_byte
)data
;
935 bfd_putl32 (data
, addr
)
937 register bfd_byte
*addr
;
939 addr
[0] = (bfd_byte
)data
;
940 addr
[1] = (bfd_byte
)(data
>> 8);
941 addr
[2] = (bfd_byte
)(data
>> 16);
942 addr
[3] = (bfd_byte
)(data
>> 24);
946 bfd_putb64 (data
, addr
)
948 register bfd_byte
*addr
;
951 addr
[0] = (bfd_byte
)(data
>> (7*8));
952 addr
[1] = (bfd_byte
)(data
>> (6*8));
953 addr
[2] = (bfd_byte
)(data
>> (5*8));
954 addr
[3] = (bfd_byte
)(data
>> (4*8));
955 addr
[4] = (bfd_byte
)(data
>> (3*8));
956 addr
[5] = (bfd_byte
)(data
>> (2*8));
957 addr
[6] = (bfd_byte
)(data
>> (1*8));
958 addr
[7] = (bfd_byte
)(data
>> (0*8));
965 bfd_putl64 (data
, addr
)
967 register bfd_byte
*addr
;
970 addr
[7] = (bfd_byte
)(data
>> (7*8));
971 addr
[6] = (bfd_byte
)(data
>> (6*8));
972 addr
[5] = (bfd_byte
)(data
>> (5*8));
973 addr
[4] = (bfd_byte
)(data
>> (4*8));
974 addr
[3] = (bfd_byte
)(data
>> (3*8));
975 addr
[2] = (bfd_byte
)(data
>> (2*8));
976 addr
[1] = (bfd_byte
)(data
>> (1*8));
977 addr
[0] = (bfd_byte
)(data
>> (0*8));
983 /* Default implementation */
986 _bfd_generic_get_section_contents (abfd
, section
, location
, offset
, count
)
995 if ((bfd_size_type
)(offset
+count
) > section
->_raw_size
996 || bfd_seek(abfd
, (file_ptr
)(section
->filepos
+ offset
), SEEK_SET
) == -1
997 || bfd_read(location
, (bfd_size_type
)1, count
, abfd
) != count
)
998 return (false); /* on error */
1003 _bfd_generic_get_section_contents_in_window (abfd
, section
, w
, offset
, count
)
1008 bfd_size_type count
;
1012 if (abfd
->xvec
->_bfd_get_section_contents
!= _bfd_generic_get_section_contents
)
1014 /* We don't know what changes the bfd's get_section_contents
1015 method may have to make. So punt trying to map the file
1016 window, and let get_section_contents do its thing. */
1017 /* @@ FIXME : If the internal window has a refcount of 1 and was
1018 allocated with malloc instead of mmap, just reuse it. */
1019 bfd_free_window (w
);
1020 w
->i
= (bfd_window_internal
*) bfd_zmalloc (sizeof (bfd_window_internal
));
1023 w
->i
->data
= (PTR
) malloc ((size_t) count
);
1024 if (w
->i
->data
== NULL
)
1032 w
->size
= w
->i
->size
= count
;
1033 w
->data
= w
->i
->data
;
1034 return bfd_get_section_contents (abfd
, section
, w
->data
, offset
, count
);
1036 if ((bfd_size_type
) (offset
+count
) > section
->_raw_size
1037 || (bfd_get_file_window (abfd
, section
->filepos
+ offset
, count
, w
, 1)
1043 /* This generic function can only be used in implementations where creating
1044 NEW sections is disallowed. It is useful in patching existing sections
1045 in read-write files, though. See other set_section_contents functions
1046 to see why it doesn't work for new sections. */
1048 _bfd_generic_set_section_contents (abfd
, section
, location
, offset
, count
)
1053 bfd_size_type count
;
1058 if (bfd_seek (abfd
, (file_ptr
) (section
->filepos
+ offset
), SEEK_SET
) == -1
1059 || bfd_write (location
, (bfd_size_type
) 1, count
, abfd
) != count
)
1070 unsigned int bfd_log2(bfd_vma x);
1073 Return the log base 2 of the value supplied, rounded up. E.g., an
1074 @var{x} of 1025 returns 11.
1081 unsigned result
= 0;
1082 while ( (bfd_vma
)(1<< result
) < x
)
1088 bfd_generic_is_local_label (abfd
, sym
)
1092 char locals_prefix
= (bfd_get_symbol_leading_char (abfd
) == '_') ? 'L' : '.';
1094 return (sym
->name
[0] == locals_prefix
);