1 /* Copyright (C) 1990, 1991 Free Software Foundation, Inc.
3 This file is part of BFD, the Binary File Diddler.
5 BFD is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 1, or (at your option)
10 BFD is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with BFD; see the file COPYING. If not, write to
17 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /*** libbfd.c -- random bfd support routines used internally only. */
28 /** Dummies for targets that don't want or need to implement
32 _bfd_dummy_new_section_hook (ignore, ignore_newsect)
34 asection *ignore_newsect;
54 bfd_nullvoidptr(ignore)
81 _bfd_dummy_core_file_matches_executable_p (ignore_core_bfd, ignore_exec_bfd)
85 bfd_error = invalid_operation;
89 /* of course you can't initialize a function to be the same as another, grr */
92 _bfd_dummy_core_file_failing_command (ignore_abfd)
99 _bfd_dummy_core_file_failing_signal (ignore_abfd)
106 _bfd_dummy_target (ignore_abfd)
112 /** zalloc -- allocate and clear storage */
120 char *ptr = (char *) malloc ((int)size);
122 if ((ptr != NULL) && (size != 0))
132 /* Note that archive entries don't have streams; they share their parent's.
133 This allows someone to play with the iostream behind bfd's back.
135 Also, note that the origin pointer points to the beginning of a file's
136 contents (0 for non-archive elements). For archive entries this is the
137 first octet in the file, NOT the beginning of the archive header. */
140 int DEFUN(real_read,(where, a,b, file),
146 return fread(where, a,b,file);
149 DEFUN(bfd_read,(ptr, size, nitems, abfd),
151 bfd_size_type size AND
152 bfd_size_type nitems AND
155 return (bfd_size_type)real_read (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd));
159 DEFUN(bfd_write,(ptr, size, nitems, abfd),
161 bfd_size_type size AND
162 bfd_size_type nitems AND
165 return fwrite (ptr, 1, (int)(size*nitems), bfd_cache_lookup(abfd));
169 DEFUN(bfd_seek,(abfd, position, direction),
171 CONST file_ptr position AND
174 /* For the time being, a bfd may not seek to it's end. The
175 problem is that we don't easily have a way to recognize
176 the end of an element in an archive. */
178 BFD_ASSERT(direction == SEEK_SET
179 || direction == SEEK_CUR);
181 if (direction == SEEK_SET && abfd->my_archive != NULL)
183 /* This is a set within an archive, so we need to
184 add the base of the object within the archive */
185 return(fseek(bfd_cache_lookup(abfd),
186 position + abfd->origin,
191 return(fseek(bfd_cache_lookup(abfd), position, direction));
201 ptr = ftell (bfd_cache_lookup(abfd));
203 if (abfd->my_archive)
208 /** Make a string table */
210 /* Add string to table pointed to by table, at location starting with free_ptr.
211 resizes the table if necessary (if it's NULL, creates it, ignoring
212 table_length). Updates free_ptr, table, table_length */
215 bfd_add_to_string_table (table, new_string, table_length, free_ptr)
216 char **table, **free_ptr;
218 unsigned int *table_length;
220 size_t string_length = strlen (new_string) + 1; /* include null here */
222 size_t space_length = *table_length;
223 unsigned int offset = (base ? *free_ptr - base : 0);
226 /* Avoid a useless regrow if we can (but of course we still
228 space_length = (string_length < DEFAULT_STRING_SPACE_SIZE ?
229 DEFAULT_STRING_SPACE_SIZE : string_length+1);
230 base = zalloc (space_length);
233 bfd_error = no_memory;
238 if ((size_t)(offset + string_length) >= space_length) {
239 /* Make sure we will have enough space */
240 while ((size_t)(offset + string_length) >= space_length)
241 space_length += space_length/2; /* grow by 50% */
243 base = (char *) realloc (base, space_length);
245 bfd_error = no_memory;
251 memcpy (base + offset, new_string, string_length);
253 *table_length = space_length;
254 *free_ptr = base + offset + string_length;
259 /** The do-it-yourself (byte) sex-change kit */
261 /* The middle letter e.g. get<b>short indicates Big or Little endian
262 target machine. It doesn't matter what the byte order of the host
263 machine is; these routines work for either. */
265 /* FIXME: Should these take a count argument?
266 Answer (gnu@cygnus.com): No, but perhaps they should be inline
267 functions in swap.h #ifdef __GNUC__.
268 Gprof them later and find out. */
272 register bfd_byte *addr;
274 return (addr[0] << 8) | addr[1];
279 register bfd_byte *addr;
281 return (addr[1] << 8) | addr[0];
285 _do_putb16 (data, addr)
286 int data; /* Actually short, but ansi C sucks */
287 register bfd_byte *addr;
289 addr[0] = (bfd_byte)(data >> 8);
290 addr[1] = (bfd_byte )data;
294 _do_putl16 (data, addr)
295 int data; /* Actually short, but ansi C sucks */
296 register bfd_byte *addr;
298 addr[0] = (bfd_byte )data;
299 addr[1] = (bfd_byte)(data >> 8);
304 register bfd_byte *addr;
306 return ((((addr[0] << 8) | addr[1]) << 8) | addr[2]) << 8 | addr[3];
311 register bfd_byte *addr;
313 return ((((addr[3] << 8) | addr[2]) << 8) | addr[1]) << 8 | addr[0];
318 register bfd_byte *addr;
320 bfd_64_type low, high;
322 high= ((((((((addr[0]) << 8) |
327 low = ((((((((addr[4]) << 8) |
332 return high << 32 | low;
341 register bfd_byte *addr;
343 bfd_64_type low, high;
345 high= (((((((addr[7] << 8) |
350 low = (((((((addr[3] << 8) |
355 return high << 32 | low;
362 _do_putb32 (data, addr)
364 register bfd_byte *addr;
366 addr[0] = (bfd_byte)(data >> 24);
367 addr[1] = (bfd_byte)(data >> 16);
368 addr[2] = (bfd_byte)(data >> 8);
369 addr[3] = (bfd_byte)data;
373 _do_putl32 (data, addr)
375 register bfd_byte *addr;
377 addr[0] = (bfd_byte)data;
378 addr[1] = (bfd_byte)(data >> 8);
379 addr[2] = (bfd_byte)(data >> 16);
380 addr[3] = (bfd_byte)(data >> 24);
383 _do_putb64 (data, addr)
385 register bfd_byte *addr;
388 addr[0] = (bfd_byte)(data >> (7*8));
389 addr[1] = (bfd_byte)(data >> (6*8));
390 addr[2] = (bfd_byte)(data >> (5*8));
391 addr[3] = (bfd_byte)(data >> (4*8));
392 addr[4] = (bfd_byte)(data >> (3*8));
393 addr[5] = (bfd_byte)(data >> (2*8));
394 addr[6] = (bfd_byte)(data >> (1*8));
395 addr[7] = (bfd_byte)(data >> (0*8));
403 _do_putl64 (data, addr)
405 register bfd_byte *addr;
408 addr[7] = (bfd_byte)(data >> (7*8));
409 addr[6] = (bfd_byte)(data >> (6*8));
410 addr[5] = (bfd_byte)(data >> (5*8));
411 addr[4] = (bfd_byte)(data >> (4*8));
412 addr[3] = (bfd_byte)(data >> (3*8));
413 addr[2] = (bfd_byte)(data >> (2*8));
414 addr[1] = (bfd_byte)(data >> (1*8));
415 addr[0] = (bfd_byte)(data >> (0*8));
423 /* Default implementation */
426 DEFUN(bfd_generic_get_section_contents, (abfd, section, location, offset, count),
435 if ((bfd_size_type)offset >= section->size
436 || bfd_seek(abfd,(file_ptr)( section->filepos + offset), SEEK_SET) == -1
437 || bfd_read(location, (bfd_size_type)1, count, abfd) != count)
438 return (false); /* on error */