/* Assorted BFD support routines, only used internally.
- Copyright 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
+ Copyright 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
+ 2000, 2001, 2002, 2003, 2004
+ Free Software Foundation, Inc.
Written by Cygnus Support.
-This file is part of BFD, the Binary File Descriptor library.
+ This file is part of BFD, the Binary File Descriptor library.
-This program is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 2 of the License, or
-(at your option) any later version.
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of the License, or
+ (at your option) any later version.
-This program is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-GNU General Public License for more details.
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
-You should have received a copy of the GNU General Public License
-along with this program; if not, write to the Free Software
-Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#include "bfd.h"
#include "sysdep.h"
#include "libbfd.h"
+#ifndef HAVE_GETPAGESIZE
+#define getpagesize() 2048
+#endif
+
/*
SECTION
Internal functions
completeness.
*/
-/*ARGSUSED*/
-boolean
-DEFUN(_bfd_dummy_new_section_hook,(ignore, ignore_newsect),
- bfd *ignore AND
- asection *ignore_newsect)
+/* A routine which is used in target vectors for unsupported
+ operations. */
+
+bfd_boolean
+bfd_false (bfd *ignore ATTRIBUTE_UNUSED)
+{
+ bfd_set_error (bfd_error_invalid_operation);
+ return FALSE;
+}
+
+/* A routine which is used in target vectors for supported operations
+ which do not actually do anything. */
+
+bfd_boolean
+bfd_true (bfd *ignore ATTRIBUTE_UNUSED)
{
- return true;
+ return TRUE;
}
-/*ARGSUSED*/
-boolean
-DEFUN(bfd_false ,(ignore),
- bfd *ignore)
+/* A routine which is used in target vectors for unsupported
+ operations which return a pointer value. */
+
+void *
+bfd_nullvoidptr (bfd *ignore ATTRIBUTE_UNUSED)
{
- return false;
+ bfd_set_error (bfd_error_invalid_operation);
+ return NULL;
}
-/*ARGSUSED*/
-boolean
-DEFUN(bfd_true,(ignore),
- bfd *ignore)
+int
+bfd_0 (bfd *ignore ATTRIBUTE_UNUSED)
{
- return true;
+ return 0;
}
-/*ARGSUSED*/
-PTR
-DEFUN(bfd_nullvoidptr,(ignore),
- bfd *ignore)
+unsigned int
+bfd_0u (bfd *ignore ATTRIBUTE_UNUSED)
{
- return (PTR)NULL;
+ return 0;
}
-/*ARGSUSED*/
-int
-DEFUN(bfd_0,(ignore),
- bfd *ignore)
+long
+bfd_0l (bfd *ignore ATTRIBUTE_UNUSED)
{
return 0;
}
-/*ARGSUSED*/
-unsigned int
-DEFUN(bfd_0u,(ignore),
- bfd *ignore)
+/* A routine which is used in target vectors for unsupported
+ operations which return -1 on error. */
+
+long
+_bfd_n1 (bfd *ignore_abfd ATTRIBUTE_UNUSED)
{
- return 0;
+ bfd_set_error (bfd_error_invalid_operation);
+ return -1;
}
-/*ARGSUSED*/
-void
-DEFUN(bfd_void,(ignore),
- bfd *ignore)
+void
+bfd_void (bfd *ignore ATTRIBUTE_UNUSED)
{
}
-/*ARGSUSED*/
-boolean
-DEFUN(_bfd_dummy_core_file_matches_executable_p,(ignore_core_bfd, ignore_exec_bfd),
- bfd *ignore_core_bfd AND
- bfd *ignore_exec_bfd)
+bfd_boolean
+_bfd_nocore_core_file_matches_executable_p
+ (bfd *ignore_core_bfd ATTRIBUTE_UNUSED,
+ bfd *ignore_exec_bfd ATTRIBUTE_UNUSED)
{
- bfd_error = invalid_operation;
- return false;
+ bfd_set_error (bfd_error_invalid_operation);
+ return FALSE;
}
-/* of course you can't initialize a function to be the same as another, grr */
+/* Routine to handle core_file_failing_command entry point for targets
+ without core file support. */
-/*ARGSUSED*/
char *
-DEFUN(_bfd_dummy_core_file_failing_command,(ignore_abfd),
- bfd *ignore_abfd)
+_bfd_nocore_core_file_failing_command (bfd *ignore_abfd ATTRIBUTE_UNUSED)
{
- return (char *)NULL;
+ bfd_set_error (bfd_error_invalid_operation);
+ return NULL;
}
-/*ARGSUSED*/
+/* Routine to handle core_file_failing_signal entry point for targets
+ without core file support. */
+
int
-DEFUN(_bfd_dummy_core_file_failing_signal,(ignore_abfd),
- bfd *ignore_abfd)
+_bfd_nocore_core_file_failing_signal (bfd *ignore_abfd ATTRIBUTE_UNUSED)
{
+ bfd_set_error (bfd_error_invalid_operation);
return 0;
}
-/*ARGSUSED*/
-bfd_target *
-DEFUN(_bfd_dummy_target,(ignore_abfd),
- bfd *ignore_abfd)
+const bfd_target *
+_bfd_dummy_target (bfd *ignore_abfd ATTRIBUTE_UNUSED)
{
+ bfd_set_error (bfd_error_wrong_format);
return 0;
}
\f
-/** zalloc -- allocate and clear storage */
-
+/* Allocate memory using malloc. */
-#ifndef zalloc
-char *
-DEFUN(zalloc,(size),
- bfd_size_type size)
+void *
+bfd_malloc (bfd_size_type size)
{
- char *ptr = (char *) malloc ((size_t)size);
+ void *ptr;
- if ((ptr != NULL) && (size != 0))
- memset(ptr,0, (size_t) size);
+ if (size != (size_t) size)
+ {
+ bfd_set_error (bfd_error_no_memory);
+ return NULL;
+ }
+
+ ptr = malloc ((size_t) size);
+ if (ptr == NULL && (size_t) size != 0)
+ bfd_set_error (bfd_error_no_memory);
return ptr;
}
-#endif
-/*
-INTERNAL_FUNCTION
- bfd_xmalloc
-
-SYNOPSIS
- PTR bfd_xmalloc (bfd_size_type size);
-
-DESCRIPTION
- Like <<malloc>>, but exit if no more memory.
+/* Reallocate memory using realloc. */
-*/
-
-/** There is major inconsistency in how running out of memory is handled.
- Some routines return a NULL, and set bfd_error to no_memory.
- However, obstack routines can't do this ... */
-
-
-DEFUN(PTR bfd_xmalloc,(size),
- bfd_size_type size)
+void *
+bfd_realloc (void *ptr, bfd_size_type size)
{
- static CONST char no_memory_message[] = "Virtual memory exhausted!\n";
- PTR ptr;
- if (size == 0) size = 1;
- ptr = (PTR)malloc((size_t) size);
- if (!ptr)
+ void *ret;
+
+ if (size != (size_t) size)
{
- write (2, no_memory_message, sizeof(no_memory_message)-1);
- exit (1);
+ bfd_set_error (bfd_error_no_memory);
+ return NULL;
}
- return ptr;
-}
-/*
-INTERNAL_FUNCTION
- bfd_xmalloc_by_size_t
+ if (ptr == NULL)
+ ret = malloc ((size_t) size);
+ else
+ ret = realloc (ptr, (size_t) size);
-SYNOPSIS
- PTR bfd_xmalloc_by_size_t (size_t size);
+ if (ret == NULL && (size_t) size != 0)
+ bfd_set_error (bfd_error_no_memory);
-DESCRIPTION
- Like <<malloc>>, but exit if no more memory.
- Uses <<size_t>>, so it's suitable for use as <<obstack_chunk_alloc>>.
- */
-PTR
-DEFUN(bfd_xmalloc_by_size_t, (size),
- size_t size)
-{
- return bfd_xmalloc ((bfd_size_type) size);
+ return ret;
}
-\f
-/* Some IO code */
+/* Allocate memory using malloc and clear it. */
-/* Note that archive entries don't have streams; they share their parent's.
- This allows someone to play with the iostream behind BFD's back.
+void *
+bfd_zmalloc (bfd_size_type size)
+{
+ void *ptr;
- Also, note that the origin pointer points to the beginning of a file's
- contents (0 for non-archive elements). For archive entries this is the
- first octet in the file, NOT the beginning of the archive header. */
+ if (size != (size_t) size)
+ {
+ bfd_set_error (bfd_error_no_memory);
+ return NULL;
+ }
-static
-int DEFUN(real_read,(where, a,b, file),
- PTR where AND
- int a AND
- int b AND
- FILE *file)
-{
- return fread(where, a,b,file);
-}
-bfd_size_type
-DEFUN(bfd_read,(ptr, size, nitems, abfd),
- PTR ptr AND
- bfd_size_type size AND
- bfd_size_type nitems AND
- bfd *abfd)
-{
- int nread;
- nread = real_read (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd));
-#ifdef FILE_OFFSET_IS_CHAR_INDEX
- if (nread > 0)
- abfd->where += nread;
-#endif
- return nread;
-}
+ ptr = malloc ((size_t) size);
-bfd_size_type
-bfd_write (ptr, size, nitems, abfd)
- CONST PTR ptr;
- bfd_size_type size;
- bfd_size_type nitems;
- bfd *abfd;
-{
- int nwrote = fwrite (ptr, 1, (int) (size * nitems), bfd_cache_lookup (abfd));
-#ifdef FILE_OFFSET_IS_CHAR_INDEX
- if (nwrote > 0)
- abfd->where += nwrote;
-#endif
- if (nwrote != size * nitems)
+ if ((size_t) size != 0)
{
-#ifdef ENOSPC
- if (nwrote >= 0)
- errno = ENOSPC;
-#endif
- bfd_error = system_call_error;
+ if (ptr == NULL)
+ bfd_set_error (bfd_error_no_memory);
+ else
+ memset (ptr, 0, (size_t) size);
}
- return nwrote;
-}
+ return ptr;
+}
/*
INTERNAL_FUNCTION
bfd_write_bigendian_4byte_int
SYNOPSIS
- void bfd_write_bigendian_4byte_int(bfd *abfd, int i);
+ bfd_boolean bfd_write_bigendian_4byte_int (bfd *, unsigned int);
DESCRIPTION
Write a 4 byte integer @var{i} to the output BFD @var{abfd}, in big
archives.
*/
-void
-DEFUN(bfd_write_bigendian_4byte_int,(abfd, i),
- bfd *abfd AND
- int i)
+bfd_boolean
+bfd_write_bigendian_4byte_int (bfd *abfd, unsigned int i)
{
bfd_byte buffer[4];
- bfd_putb32(i, buffer);
- bfd_write((PTR)buffer, 4, 1, abfd);
-}
-
-long
-DEFUN(bfd_tell,(abfd),
- bfd *abfd)
-{
- file_ptr ptr;
-
- ptr = ftell (bfd_cache_lookup(abfd));
-
- if (abfd->my_archive)
- ptr -= abfd->origin;
- abfd->where = ptr;
- return ptr;
-}
-
-int
-DEFUN(bfd_flush,(abfd),
- bfd *abfd)
-{
- return fflush (bfd_cache_lookup(abfd));
-}
-
-int
-DEFUN(bfd_stat,(abfd, statbuf),
- bfd *abfd AND
- struct stat *statbuf)
-{
- return fstat (fileno(bfd_cache_lookup(abfd)), statbuf);
-}
-
-int
-DEFUN(bfd_seek,(abfd, position, direction),
- bfd * CONST abfd AND
- CONST file_ptr position AND
- CONST int direction)
-{
- int result;
- FILE *f;
- file_ptr file_position;
- /* For the time being, a BFD may not seek to it's end. The problem
- is that we don't easily have a way to recognize the end of an
- element in an archive. */
-
- BFD_ASSERT (direction == SEEK_SET || direction == SEEK_CUR);
-
- if (direction == SEEK_CUR && position == 0)
- return 0;
-#ifdef FILE_OFFSET_IS_CHAR_INDEX
- if (abfd->format != bfd_archive && abfd->my_archive == 0)
- {
-#if 0
- /* Explanation for this code: I'm only about 95+% sure that the above
- conditions are sufficient and that all i/o calls are properly
- adjusting the `where' field. So this is sort of an `assert'
- that the `where' field is correct. If we can go a while without
- tripping the abort, we can probably safely disable this code,
- so that the real optimizations happen. */
- file_ptr where_am_i_now;
- where_am_i_now = ftell (bfd_cache_lookup (abfd));
- if (abfd->my_archive)
- where_am_i_now -= abfd->origin;
- if (where_am_i_now != abfd->where)
- abort ();
-#endif
- if (direction == SEEK_SET && position == abfd->where)
- return 0;
- }
- else
- {
- /* We need something smarter to optimize access to archives.
- Currently, anything inside an archive is read via the file
- handle for the archive. Which means that a bfd_seek on one
- component affects the `current position' in the archive, as
- well as in any other component.
-
- It might be sufficient to put a spike through the cache
- abstraction, and look to the archive for the file position,
- but I think we should try for something cleaner.
-
- In the meantime, no optimization for archives. */
- }
-#endif
-
- f = bfd_cache_lookup (abfd);
- file_position = position;
- if (direction == SEEK_SET && abfd->my_archive != NULL)
- file_position += abfd->origin;
-
- result = fseek (f, file_position, direction);
-
- if (result != 0)
- {
- /* Force redetermination of `where' field. */
- bfd_tell (abfd);
- bfd_error = system_call_error;
- }
- else
- {
-#ifdef FILE_OFFSET_IS_CHAR_INDEX
- /* Adjust `where' field. */
- if (direction == SEEK_SET)
- abfd->where = position;
- else
- abfd->where += position;
-#endif
- }
- return result;
+ bfd_putb32 ((bfd_vma) i, buffer);
+ return bfd_bwrite (buffer, (bfd_size_type) 4, abfd) == 4;
}
-\f
-/** Make a string table */
-
-/*>bfd.h<
- Add string to table pointed to by table, at location starting with free_ptr.
- resizes the table if necessary (if it's NULL, creates it, ignoring
- table_length). Updates free_ptr, table, table_length */
-
-boolean
-DEFUN(bfd_add_to_string_table,(table, new_string, table_length, free_ptr),
- char **table AND
- char *new_string AND
- unsigned int *table_length AND
- char **free_ptr)
-{
- size_t string_length = strlen (new_string) + 1; /* include null here */
- char *base = *table;
- size_t space_length = *table_length;
- unsigned int offset = (base ? *free_ptr - base : 0);
-
- if (base == NULL) {
- /* Avoid a useless regrow if we can (but of course we still
- take it next time */
- space_length = (string_length < DEFAULT_STRING_SPACE_SIZE ?
- DEFAULT_STRING_SPACE_SIZE : string_length+1);
- base = zalloc ((bfd_size_type) space_length);
-
- if (base == NULL) {
- bfd_error = no_memory;
- return false;
- }
- }
-
- if ((size_t)(offset + string_length) >= space_length) {
- /* Make sure we will have enough space */
- while ((size_t)(offset + string_length) >= space_length)
- space_length += space_length/2; /* grow by 50% */
-
- base = (char *) realloc (base, space_length);
- if (base == NULL) {
- bfd_error = no_memory;
- return false;
- }
-
- }
- memcpy (base + offset, new_string, string_length);
- *table = base;
- *table_length = space_length;
- *free_ptr = base + offset + string_length;
-
- return true;
-}
\f
/** The do-it-yourself (byte) sex-change kit */
/* FIXME: Should these take a count argument?
Answer (gnu@cygnus.com): No, but perhaps they should be inline
- functions in swap.h #ifdef __GNUC__.
+ functions in swap.h #ifdef __GNUC__.
Gprof them later and find out. */
/*
.{* Byte swapping macros for user section data. *}
.
.#define bfd_put_8(abfd, val, ptr) \
-. (*((unsigned char *)(ptr)) = (unsigned char)(val))
+. ((void) (*((unsigned char *) (ptr)) = (val) & 0xff))
.#define bfd_put_signed_8 \
-. bfd_put_8
+. bfd_put_8
.#define bfd_get_8(abfd, ptr) \
-. (*(unsigned char *)(ptr))
+. (*(unsigned char *) (ptr) & 0xff)
.#define bfd_get_signed_8(abfd, ptr) \
-. ((*(unsigned char *)(ptr) ^ 0x80) - 0x80)
+. (((*(unsigned char *) (ptr) & 0xff) ^ 0x80) - 0x80)
.
.#define bfd_put_16(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_putx16, ((val),(ptr)))
+. BFD_SEND (abfd, bfd_putx16, ((val),(ptr)))
.#define bfd_put_signed_16 \
-. bfd_put_16
+. bfd_put_16
.#define bfd_get_16(abfd, ptr) \
-. BFD_SEND(abfd, bfd_getx16, (ptr))
+. BFD_SEND (abfd, bfd_getx16, (ptr))
.#define bfd_get_signed_16(abfd, ptr) \
-. BFD_SEND (abfd, bfd_getx_signed_16, (ptr))
+. BFD_SEND (abfd, bfd_getx_signed_16, (ptr))
.
.#define bfd_put_32(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_putx32, ((val),(ptr)))
+. BFD_SEND (abfd, bfd_putx32, ((val),(ptr)))
.#define bfd_put_signed_32 \
-. bfd_put_32
+. bfd_put_32
.#define bfd_get_32(abfd, ptr) \
-. BFD_SEND(abfd, bfd_getx32, (ptr))
+. BFD_SEND (abfd, bfd_getx32, (ptr))
.#define bfd_get_signed_32(abfd, ptr) \
-. BFD_SEND(abfd, bfd_getx_signed_32, (ptr))
+. BFD_SEND (abfd, bfd_getx_signed_32, (ptr))
.
.#define bfd_put_64(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_putx64, ((val), (ptr)))
+. BFD_SEND (abfd, bfd_putx64, ((val), (ptr)))
.#define bfd_put_signed_64 \
-. bfd_put_64
+. bfd_put_64
.#define bfd_get_64(abfd, ptr) \
-. BFD_SEND(abfd, bfd_getx64, (ptr))
+. BFD_SEND (abfd, bfd_getx64, (ptr))
.#define bfd_get_signed_64(abfd, ptr) \
-. BFD_SEND(abfd, bfd_getx_signed_64, (ptr))
+. BFD_SEND (abfd, bfd_getx_signed_64, (ptr))
.
-*/
+.#define bfd_get(bits, abfd, ptr) \
+. ((bits) == 8 ? (bfd_vma) bfd_get_8 (abfd, ptr) \
+. : (bits) == 16 ? bfd_get_16 (abfd, ptr) \
+. : (bits) == 32 ? bfd_get_32 (abfd, ptr) \
+. : (bits) == 64 ? bfd_get_64 (abfd, ptr) \
+. : (abort (), (bfd_vma) - 1))
+.
+.#define bfd_put(bits, abfd, val, ptr) \
+. ((bits) == 8 ? bfd_put_8 (abfd, val, ptr) \
+. : (bits) == 16 ? bfd_put_16 (abfd, val, ptr) \
+. : (bits) == 32 ? bfd_put_32 (abfd, val, ptr) \
+. : (bits) == 64 ? bfd_put_64 (abfd, val, ptr) \
+. : (abort (), (void) 0))
+.
+*/
/*
FUNCTION
DESCRIPTION
These macros have the same function as their <<bfd_get_x>>
- bretheren, except that they are used for removing information
+ brethren, except that they are used for removing information
for the header records of object files. Believe it or not,
some object files keep their header records in big endian
order and their data in little endian order.
.{* Byte swapping macros for file header data. *}
.
.#define bfd_h_put_8(abfd, val, ptr) \
-. bfd_put_8 (abfd, val, ptr)
+. bfd_put_8 (abfd, val, ptr)
.#define bfd_h_put_signed_8(abfd, val, ptr) \
-. bfd_put_8 (abfd, val, ptr)
+. bfd_put_8 (abfd, val, ptr)
.#define bfd_h_get_8(abfd, ptr) \
-. bfd_get_8 (abfd, ptr)
+. bfd_get_8 (abfd, ptr)
.#define bfd_h_get_signed_8(abfd, ptr) \
-. bfd_get_signed_8 (abfd, ptr)
+. bfd_get_signed_8 (abfd, ptr)
.
.#define bfd_h_put_16(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_h_putx16,(val,ptr))
+. BFD_SEND (abfd, bfd_h_putx16, (val, ptr))
.#define bfd_h_put_signed_16 \
-. bfd_h_put_16
+. bfd_h_put_16
.#define bfd_h_get_16(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx16,(ptr))
+. BFD_SEND (abfd, bfd_h_getx16, (ptr))
.#define bfd_h_get_signed_16(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx_signed_16, (ptr))
+. BFD_SEND (abfd, bfd_h_getx_signed_16, (ptr))
.
.#define bfd_h_put_32(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_h_putx32,(val,ptr))
+. BFD_SEND (abfd, bfd_h_putx32, (val, ptr))
.#define bfd_h_put_signed_32 \
-. bfd_h_put_32
+. bfd_h_put_32
.#define bfd_h_get_32(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx32,(ptr))
+. BFD_SEND (abfd, bfd_h_getx32, (ptr))
.#define bfd_h_get_signed_32(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx_signed_32, (ptr))
+. BFD_SEND (abfd, bfd_h_getx_signed_32, (ptr))
.
.#define bfd_h_put_64(abfd, val, ptr) \
-. BFD_SEND(abfd, bfd_h_putx64,(val, ptr))
+. BFD_SEND (abfd, bfd_h_putx64, (val, ptr))
.#define bfd_h_put_signed_64 \
-. bfd_h_put_64
+. bfd_h_put_64
.#define bfd_h_get_64(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx64,(ptr))
+. BFD_SEND (abfd, bfd_h_getx64, (ptr))
.#define bfd_h_get_signed_64(abfd, ptr) \
-. BFD_SEND(abfd, bfd_h_getx_signed_64, (ptr))
+. BFD_SEND (abfd, bfd_h_getx_signed_64, (ptr))
.
-*/
+.{* Aliases for the above, which should eventually go away. *}
+.
+.#define H_PUT_64 bfd_h_put_64
+.#define H_PUT_32 bfd_h_put_32
+.#define H_PUT_16 bfd_h_put_16
+.#define H_PUT_8 bfd_h_put_8
+.#define H_PUT_S64 bfd_h_put_signed_64
+.#define H_PUT_S32 bfd_h_put_signed_32
+.#define H_PUT_S16 bfd_h_put_signed_16
+.#define H_PUT_S8 bfd_h_put_signed_8
+.#define H_GET_64 bfd_h_get_64
+.#define H_GET_32 bfd_h_get_32
+.#define H_GET_16 bfd_h_get_16
+.#define H_GET_8 bfd_h_get_8
+.#define H_GET_S64 bfd_h_get_signed_64
+.#define H_GET_S32 bfd_h_get_signed_32
+.#define H_GET_S16 bfd_h_get_signed_16
+.#define H_GET_S8 bfd_h_get_signed_8
+.
+.*/
/* Sign extension to bfd_signed_vma. */
#define COERCE16(x) (((bfd_signed_vma) (x) ^ 0x8000) - 0x8000)
#define COERCE32(x) (((bfd_signed_vma) (x) ^ 0x80000000) - 0x80000000)
-#define EIGHT_GAZILLION (((HOST_64_BIT)0x80000000) << 32)
+#define EIGHT_GAZILLION ((bfd_int64_t) 1 << 63)
#define COERCE64(x) \
- (((bfd_signed_vma) (x) ^ EIGHT_GAZILLION) - EIGHT_GAZILLION)
+ (((bfd_int64_t) (x) ^ EIGHT_GAZILLION) - EIGHT_GAZILLION)
bfd_vma
-DEFUN(bfd_getb16,(addr),
- register bfd_byte *addr)
+bfd_getb16 (const void *p)
{
- return (addr[0] << 8) | addr[1];
+ const bfd_byte *addr = p;
+ return (addr[0] << 8) | addr[1];
}
bfd_vma
-DEFUN(bfd_getl16,(addr),
- register bfd_byte *addr)
+bfd_getl16 (const void *p)
{
- return (addr[1] << 8) | addr[0];
+ const bfd_byte *addr = p;
+ return (addr[1] << 8) | addr[0];
}
bfd_signed_vma
-DEFUN(bfd_getb_signed_16,(addr),
- register bfd_byte *addr)
+bfd_getb_signed_16 (const void *p)
{
- return COERCE16((addr[0] << 8) | addr[1]);
+ const bfd_byte *addr = p;
+ return COERCE16 ((addr[0] << 8) | addr[1]);
}
bfd_signed_vma
-DEFUN(bfd_getl_signed_16,(addr),
- register bfd_byte *addr)
+bfd_getl_signed_16 (const void *p)
{
- return COERCE16((addr[1] << 8) | addr[0]);
+ const bfd_byte *addr = p;
+ return COERCE16 ((addr[1] << 8) | addr[0]);
}
void
-DEFUN(bfd_putb16,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
+bfd_putb16 (bfd_vma data, void *p)
{
- addr[0] = (bfd_byte)(data >> 8);
- addr[1] = (bfd_byte )data;
+ bfd_byte *addr = p;
+ addr[0] = (data >> 8) & 0xff;
+ addr[1] = data & 0xff;
}
void
-DEFUN(bfd_putl16,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
+bfd_putl16 (bfd_vma data, void *p)
{
- addr[0] = (bfd_byte )data;
- addr[1] = (bfd_byte)(data >> 8);
+ bfd_byte *addr = p;
+ addr[0] = data & 0xff;
+ addr[1] = (data >> 8) & 0xff;
}
bfd_vma
-bfd_getb32 (addr)
- register bfd_byte *addr;
+bfd_getb32 (const void *p)
{
- return (((((bfd_vma)addr[0] << 8) | addr[1]) << 8)
- | addr[2]) << 8 | addr[3];
+ const bfd_byte *addr = p;
+ unsigned long v;
+
+ v = (unsigned long) addr[0] << 24;
+ v |= (unsigned long) addr[1] << 16;
+ v |= (unsigned long) addr[2] << 8;
+ v |= (unsigned long) addr[3];
+ return v;
}
bfd_vma
-bfd_getl32 (addr)
- register bfd_byte *addr;
+bfd_getl32 (const void *p)
{
- return (((((bfd_vma)addr[3] << 8) | addr[2]) << 8)
- | addr[1]) << 8 | addr[0];
+ const bfd_byte *addr = p;
+ unsigned long v;
+
+ v = (unsigned long) addr[0];
+ v |= (unsigned long) addr[1] << 8;
+ v |= (unsigned long) addr[2] << 16;
+ v |= (unsigned long) addr[3] << 24;
+ return v;
}
bfd_signed_vma
-bfd_getb_signed_32 (addr)
- register bfd_byte *addr;
+bfd_getb_signed_32 (const void *p)
{
- return COERCE32((((((bfd_vma)addr[0] << 8) | addr[1]) << 8)
- | addr[2]) << 8 | addr[3]);
+ const bfd_byte *addr = p;
+ unsigned long v;
+
+ v = (unsigned long) addr[0] << 24;
+ v |= (unsigned long) addr[1] << 16;
+ v |= (unsigned long) addr[2] << 8;
+ v |= (unsigned long) addr[3];
+ return COERCE32 (v);
}
bfd_signed_vma
-bfd_getl_signed_32 (addr)
- register bfd_byte *addr;
+bfd_getl_signed_32 (const void *p)
{
- return COERCE32((((((bfd_vma)addr[3] << 8) | addr[2]) << 8)
- | addr[1]) << 8 | addr[0]);
+ const bfd_byte *addr = p;
+ unsigned long v;
+
+ v = (unsigned long) addr[0];
+ v |= (unsigned long) addr[1] << 8;
+ v |= (unsigned long) addr[2] << 16;
+ v |= (unsigned long) addr[3] << 24;
+ return COERCE32 (v);
}
-bfd_vma
-DEFUN(bfd_getb64,(addr),
- register bfd_byte *addr)
+bfd_uint64_t
+bfd_getb64 (const void *p ATTRIBUTE_UNUSED)
{
-#ifdef BFD64
- bfd_vma low, high;
-
- high= ((((((((addr[0]) << 8) |
- addr[1]) << 8) |
- addr[2]) << 8) |
- addr[3]) );
+#ifdef BFD_HOST_64_BIT
+ const bfd_byte *addr = p;
+ bfd_uint64_t v;
- low = (((((((((bfd_vma)addr[4]) << 8) |
- addr[5]) << 8) |
- addr[6]) << 8) |
- addr[7]));
+ v = addr[0]; v <<= 8;
+ v |= addr[1]; v <<= 8;
+ v |= addr[2]; v <<= 8;
+ v |= addr[3]; v <<= 8;
+ v |= addr[4]; v <<= 8;
+ v |= addr[5]; v <<= 8;
+ v |= addr[6]; v <<= 8;
+ v |= addr[7];
- return high << 32 | low;
+ return v;
#else
BFD_FAIL();
return 0;
#endif
-
}
-bfd_vma
-DEFUN(bfd_getl64,(addr),
- register bfd_byte *addr)
+bfd_uint64_t
+bfd_getl64 (const void *p ATTRIBUTE_UNUSED)
{
+#ifdef BFD_HOST_64_BIT
+ const bfd_byte *addr = p;
+ bfd_uint64_t v;
-#ifdef BFD64
- bfd_vma low, high;
- high= (((((((addr[7] << 8) |
- addr[6]) << 8) |
- addr[5]) << 8) |
- addr[4]));
-
- low = ((((((((bfd_vma)addr[3] << 8) |
- addr[2]) << 8) |
- addr[1]) << 8) |
- addr[0]) );
+ v = addr[7]; v <<= 8;
+ v |= addr[6]; v <<= 8;
+ v |= addr[5]; v <<= 8;
+ v |= addr[4]; v <<= 8;
+ v |= addr[3]; v <<= 8;
+ v |= addr[2]; v <<= 8;
+ v |= addr[1]; v <<= 8;
+ v |= addr[0];
- return high << 32 | low;
+ return v;
#else
BFD_FAIL();
return 0;
}
-bfd_signed_vma
-DEFUN(bfd_getb_signed_64,(addr),
- register bfd_byte *addr)
+bfd_int64_t
+bfd_getb_signed_64 (const void *p ATTRIBUTE_UNUSED)
{
-#ifdef BFD64
- bfd_vma low, high;
-
- high= ((((((((addr[0]) << 8) |
- addr[1]) << 8) |
- addr[2]) << 8) |
- addr[3]) );
+#ifdef BFD_HOST_64_BIT
+ const bfd_byte *addr = p;
+ bfd_uint64_t v;
- low = (((((((((bfd_vma)addr[4]) << 8) |
- addr[5]) << 8) |
- addr[6]) << 8) |
- addr[7]));
+ v = addr[0]; v <<= 8;
+ v |= addr[1]; v <<= 8;
+ v |= addr[2]; v <<= 8;
+ v |= addr[3]; v <<= 8;
+ v |= addr[4]; v <<= 8;
+ v |= addr[5]; v <<= 8;
+ v |= addr[6]; v <<= 8;
+ v |= addr[7];
- return COERCE64(high << 32 | low);
+ return COERCE64 (v);
#else
BFD_FAIL();
return 0;
#endif
-
}
-bfd_signed_vma
-DEFUN(bfd_getl_signed_64,(addr),
- register bfd_byte *addr)
+bfd_int64_t
+bfd_getl_signed_64 (const void *p ATTRIBUTE_UNUSED)
{
+#ifdef BFD_HOST_64_BIT
+ const bfd_byte *addr = p;
+ bfd_uint64_t v;
-#ifdef BFD64
- bfd_vma low, high;
- high= (((((((addr[7] << 8) |
- addr[6]) << 8) |
- addr[5]) << 8) |
- addr[4]));
-
- low = ((((((((bfd_vma)addr[3] << 8) |
- addr[2]) << 8) |
- addr[1]) << 8) |
- addr[0]) );
+ v = addr[7]; v <<= 8;
+ v |= addr[6]; v <<= 8;
+ v |= addr[5]; v <<= 8;
+ v |= addr[4]; v <<= 8;
+ v |= addr[3]; v <<= 8;
+ v |= addr[2]; v <<= 8;
+ v |= addr[1]; v <<= 8;
+ v |= addr[0];
- return COERCE64(high << 32 | low);
+ return COERCE64 (v);
#else
BFD_FAIL();
return 0;
#endif
-
}
void
-DEFUN(bfd_putb32,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
+bfd_putb32 (bfd_vma data, void *p)
{
- addr[0] = (bfd_byte)(data >> 24);
- addr[1] = (bfd_byte)(data >> 16);
- addr[2] = (bfd_byte)(data >> 8);
- addr[3] = (bfd_byte)data;
+ bfd_byte *addr = p;
+ addr[0] = (data >> 24) & 0xff;
+ addr[1] = (data >> 16) & 0xff;
+ addr[2] = (data >> 8) & 0xff;
+ addr[3] = data & 0xff;
}
void
-DEFUN(bfd_putl32,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
+bfd_putl32 (bfd_vma data, void *p)
{
- addr[0] = (bfd_byte)data;
- addr[1] = (bfd_byte)(data >> 8);
- addr[2] = (bfd_byte)(data >> 16);
- addr[3] = (bfd_byte)(data >> 24);
+ bfd_byte *addr = p;
+ addr[0] = data & 0xff;
+ addr[1] = (data >> 8) & 0xff;
+ addr[2] = (data >> 16) & 0xff;
+ addr[3] = (data >> 24) & 0xff;
}
+
void
-DEFUN(bfd_putb64,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
-{
-#ifdef BFD64
- addr[0] = (bfd_byte)(data >> (7*8));
- addr[1] = (bfd_byte)(data >> (6*8));
- addr[2] = (bfd_byte)(data >> (5*8));
- addr[3] = (bfd_byte)(data >> (4*8));
- addr[4] = (bfd_byte)(data >> (3*8));
- addr[5] = (bfd_byte)(data >> (2*8));
- addr[6] = (bfd_byte)(data >> (1*8));
- addr[7] = (bfd_byte)(data >> (0*8));
+bfd_putb64 (bfd_uint64_t data ATTRIBUTE_UNUSED, void *p ATTRIBUTE_UNUSED)
+{
+#ifdef BFD_HOST_64_BIT
+ bfd_byte *addr = p;
+ addr[0] = (data >> (7*8)) & 0xff;
+ addr[1] = (data >> (6*8)) & 0xff;
+ addr[2] = (data >> (5*8)) & 0xff;
+ addr[3] = (data >> (4*8)) & 0xff;
+ addr[4] = (data >> (3*8)) & 0xff;
+ addr[5] = (data >> (2*8)) & 0xff;
+ addr[6] = (data >> (1*8)) & 0xff;
+ addr[7] = (data >> (0*8)) & 0xff;
#else
BFD_FAIL();
#endif
-
}
void
-DEFUN(bfd_putl64,(data, addr),
- bfd_vma data AND
- register bfd_byte *addr)
-{
-#ifdef BFD64
- addr[7] = (bfd_byte)(data >> (7*8));
- addr[6] = (bfd_byte)(data >> (6*8));
- addr[5] = (bfd_byte)(data >> (5*8));
- addr[4] = (bfd_byte)(data >> (4*8));
- addr[3] = (bfd_byte)(data >> (3*8));
- addr[2] = (bfd_byte)(data >> (2*8));
- addr[1] = (bfd_byte)(data >> (1*8));
- addr[0] = (bfd_byte)(data >> (0*8));
+bfd_putl64 (bfd_uint64_t data ATTRIBUTE_UNUSED, void *p ATTRIBUTE_UNUSED)
+{
+#ifdef BFD_HOST_64_BIT
+ bfd_byte *addr = p;
+ addr[7] = (data >> (7*8)) & 0xff;
+ addr[6] = (data >> (6*8)) & 0xff;
+ addr[5] = (data >> (5*8)) & 0xff;
+ addr[4] = (data >> (4*8)) & 0xff;
+ addr[3] = (data >> (3*8)) & 0xff;
+ addr[2] = (data >> (2*8)) & 0xff;
+ addr[1] = (data >> (1*8)) & 0xff;
+ addr[0] = (data >> (0*8)) & 0xff;
#else
BFD_FAIL();
#endif
+}
+void
+bfd_put_bits (bfd_uint64_t data, void *p, int bits, bfd_boolean big_p)
+{
+ bfd_byte *addr = p;
+ int i;
+ int bytes;
+
+ if (bits % 8 != 0)
+ abort ();
+
+ bytes = bits / 8;
+ for (i = 0; i < bytes; i++)
+ {
+ int index = big_p ? bytes - i - 1 : i;
+
+ addr[index] = data & 0xff;
+ data >>= 8;
+ }
}
+bfd_uint64_t
+bfd_get_bits (const void *p, int bits, bfd_boolean big_p)
+{
+ const bfd_byte *addr = p;
+ bfd_uint64_t data;
+ int i;
+ int bytes;
+
+ if (bits % 8 != 0)
+ abort ();
+
+ data = 0;
+ bytes = bits / 8;
+ for (i = 0; i < bytes; i++)
+ {
+ int index = big_p ? i : bytes - i - 1;
+
+ data = (data << 8) | addr[index];
+ }
+
+ return data;
+}
\f
/* Default implementation */
-boolean
-DEFUN(bfd_generic_get_section_contents, (abfd, section, location, offset, count),
- bfd *abfd AND
- sec_ptr section AND
- PTR location AND
- file_ptr offset AND
- bfd_size_type count)
+bfd_boolean
+_bfd_generic_get_section_contents (bfd *abfd,
+ sec_ptr section,
+ void *location,
+ file_ptr offset,
+ bfd_size_type count)
{
- if (count == 0)
- return true;
- if ((bfd_size_type)(offset+count) > section->_raw_size
- || bfd_seek(abfd, (file_ptr)(section->filepos + offset), SEEK_SET) == -1
- || bfd_read(location, (bfd_size_type)1, count, abfd) != count)
- return (false); /* on error */
- return (true);
+ bfd_size_type sz;
+ if (count == 0)
+ return TRUE;
+
+ sz = section->rawsize ? section->rawsize : section->size;
+ if (offset + count > sz)
+ {
+ bfd_set_error (bfd_error_invalid_operation);
+ return FALSE;
+ }
+
+ if (bfd_seek (abfd, section->filepos + offset, SEEK_SET) != 0
+ || bfd_bread (location, count, abfd) != count)
+ return FALSE;
+
+ return TRUE;
+}
+
+bfd_boolean
+_bfd_generic_get_section_contents_in_window
+ (bfd *abfd ATTRIBUTE_UNUSED,
+ sec_ptr section ATTRIBUTE_UNUSED,
+ bfd_window *w ATTRIBUTE_UNUSED,
+ file_ptr offset ATTRIBUTE_UNUSED,
+ bfd_size_type count ATTRIBUTE_UNUSED)
+{
+#ifdef USE_MMAP
+ bfd_size_type sz;
+
+ if (count == 0)
+ return TRUE;
+ if (abfd->xvec->_bfd_get_section_contents
+ != _bfd_generic_get_section_contents)
+ {
+ /* We don't know what changes the bfd's get_section_contents
+ method may have to make. So punt trying to map the file
+ window, and let get_section_contents do its thing. */
+ /* @@ FIXME : If the internal window has a refcount of 1 and was
+ allocated with malloc instead of mmap, just reuse it. */
+ bfd_free_window (w);
+ w->i = bfd_zmalloc (sizeof (bfd_window_internal));
+ if (w->i == NULL)
+ return FALSE;
+ w->i->data = bfd_malloc (count);
+ if (w->i->data == NULL)
+ {
+ free (w->i);
+ w->i = NULL;
+ return FALSE;
+ }
+ w->i->mapped = 0;
+ w->i->refcount = 1;
+ w->size = w->i->size = count;
+ w->data = w->i->data;
+ return bfd_get_section_contents (abfd, section, w->data, offset, count);
+ }
+ sz = section->rawsize ? section->rawsize : section->size;
+ if (offset + count > sz
+ || ! bfd_get_file_window (abfd, section->filepos + offset, count, w,
+ TRUE))
+ return FALSE;
+ return TRUE;
+#else
+ abort ();
+#endif
}
/* This generic function can only be used in implementations where creating
NEW sections is disallowed. It is useful in patching existing sections
in read-write files, though. See other set_section_contents functions
to see why it doesn't work for new sections. */
-boolean
-bfd_generic_set_section_contents (abfd, section, location, offset, count)
- bfd *abfd;
- sec_ptr section;
- PTR location;
- file_ptr offset;
- bfd_size_type count;
+bfd_boolean
+_bfd_generic_set_section_contents (bfd *abfd,
+ sec_ptr section,
+ const void *location,
+ file_ptr offset,
+ bfd_size_type count)
{
if (count == 0)
- return true;
+ return TRUE;
- if (offset + count > bfd_get_section_size_after_reloc (section))
- {
- bfd_error = bad_value;
- return false;
- }
+ if (bfd_seek (abfd, section->filepos + offset, SEEK_SET) != 0
+ || bfd_bwrite (location, count, abfd) != count)
+ return FALSE;
- if (bfd_seek (abfd, (file_ptr) (section->filepos + offset), SEEK_SET) == -1
- || bfd_write (location, (bfd_size_type) 1, count, abfd) != count)
- return false;
-
- return true;
+ return TRUE;
}
/*
bfd_log2
SYNOPSIS
- unsigned int bfd_log2(bfd_vma x);
+ unsigned int bfd_log2 (bfd_vma x);
DESCRIPTION
Return the log base 2 of the value supplied, rounded up. E.g., an
- @var{x} of 1025 returns 11.
+ @var{x} of 1025 returns 11. A @var{x} of 0 returns 0.
*/
-unsigned
-bfd_log2(x)
- bfd_vma x;
+unsigned int
+bfd_log2 (bfd_vma x)
{
- unsigned result = 0;
- while ( (bfd_vma)(1<< result) < x)
- result++;
+ unsigned int result = 0;
+
+ while ((x = (x >> 1)) != 0)
+ ++result;
return result;
}
+
+bfd_boolean
+bfd_generic_is_local_label_name (bfd *abfd, const char *name)
+{
+ char locals_prefix = (bfd_get_symbol_leading_char (abfd) == '_') ? 'L' : '.';
+
+ return name[0] == locals_prefix;
+}
+
+/* Can be used from / for bfd_merge_private_bfd_data to check that
+ endianness matches between input and output file. Returns
+ TRUE for a match, otherwise returns FALSE and emits an error. */
+bfd_boolean
+_bfd_generic_verify_endian_match (bfd *ibfd, bfd *obfd)
+{
+ if (ibfd->xvec->byteorder != obfd->xvec->byteorder
+ && ibfd->xvec->byteorder != BFD_ENDIAN_UNKNOWN
+ && obfd->xvec->byteorder != BFD_ENDIAN_UNKNOWN)
+ {
+ const char *msg;
+
+ if (bfd_big_endian (ibfd))
+ msg = _("%B: compiled for a big endian system and target is little endian");
+ else
+ msg = _("%B: compiled for a little endian system and target is big endian");
+
+ (*_bfd_error_handler) (msg, ibfd);
+
+ bfd_set_error (bfd_error_wrong_format);
+ return FALSE;
+ }
+
+ return TRUE;
+}
+
+/* Give a warning at runtime if someone compiles code which calls
+ old routines. */
+
+void
+warn_deprecated (const char *what,
+ const char *file,
+ int line,
+ const char *func)
+{
+ /* Poor man's tracking of functions we've already warned about. */
+ static size_t mask = 0;
+
+ if (~(size_t) func & ~mask)
+ {
+ /* Note: separate sentences in order to allow
+ for translation into other languages. */
+ if (func)
+ fprintf (stderr, _("Deprecated %s called at %s line %d in %s\n"),
+ what, file, line, func);
+ else
+ fprintf (stderr, _("Deprecated %s called\n"), what);
+ mask |= ~(size_t) func;
+ }
+}
projects / deliverable / binutils-gdb.git / blobdiff