OpenE2K/binutils-gdb
12
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
b6fc45ca4c
binutils-gdb/bfd/archive.c
Steve Chamberlain b6fc45ca4c *** empty log message ***
1991-04-04 17:55:47 +00:00

1241 lines
31 KiB
C
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*** archive.c -- an attempt at combining the machine-independent parts of
archives */
/* Copyright (C) 1990, 1991 Free Software Foundation, Inc.
This file is part of BFD, the Binary File Diddler.
BFD 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 1, or (at your option)
any later version.
BFD 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 BFD; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/* Assumes:
o - all archive elements start on an even boundary, newline padded;
o - all arch headers are char *;
o - all arch headers are the same size (across architectures).
*/
/* $Id$
* $Log$
* Revision 1.4 1991/04/04 17:55:47 steve
* *** empty log message ***
*
* Revision 1.3 1991/04/04 14:56:42 gumby
* Minor format fixes.
*
* Revision 1.2 1991/04/03 22:09:43 steve
* Various noise
*
* Revision 1.1.1.1 1991/03/21 21:10:42 gumby
* Back from Intel with Steve
*
* Revision 1.1 1991/03/21 21:10:42 gumby
* Initial revision
*
* Revision 1.3 1991/03/16 05:55:25 rich
* pop
*
* Revision 1.2 1991/03/15 18:15:50 rich
* *** empty log message ***
*
* Revision 1.7 1991/03/08 04:18:02 rich
* *** empty log message ***
*
* Revision 1.6 1991/03/07 21:55:31 sac
* Added primitive file caching, a file open only for input and
* less than BFD_INCORE_FILE_SIZE will be malloced and read in
* only once.
*
* Revision 1.5 1991/03/05 16:31:12 sac
* lint
*
*/
#include "sysdep.h"
#include "bfd.h"
#include "libbfd.h"
#include "ar.h"
#include "ranlib.h"
/* We keep a cache of archive filepointers to archive elements to
speed up searching the archive by filepos. We only add an entry to
the cache when we actually read one. We also don't sort the cache;
it's short enough to search linearly.
Note that the pointers here point to the front of the ar_hdr, not
to the front of the contents!
*/
struct ar_cache {
file_ptr ptr;
bfd* arelt;
struct ar_cache *next;
};
#define ar_padchar(abfd) ((abfd)->xvec->ar_pad_char)
#define ar_maxnamelen(abfd) ((abfd)->xvec->ar_max_namelen)
#define arch_hdr(bfd) ((struct ar_hdr *) \
(((struct areltdata *)((bfd)->arelt_data))->arch_header))
boolean
_bfd_generic_mkarchive (abfd)
bfd *abfd;
{
abfd->tdata =(void *) zalloc (sizeof (struct artdata));
if (abfd->tdata == NULL) {
bfd_error = no_memory;
return false;
}
bfd_ardata(abfd)->cache = 0;
return true;
}
symindex
bfd_get_next_mapent (abfd, prev, entry)
bfd *abfd;
symindex prev;
carsym **entry;
{
if (!bfd_has_map (abfd)) {
bfd_error = invalid_operation;
return BFD_NO_MORE_SYMBOLS;
}
if (prev == BFD_NO_MORE_SYMBOLS) prev = 0;
else if (++prev >= (symindex)(bfd_ardata (abfd)->symdef_count))
return BFD_NO_MORE_SYMBOLS;
*entry = (bfd_ardata (abfd)->symdefs + prev);
return prev;
}
/* To be called by backends only */
bfd *
_bfd_create_empty_archive_element_shell (obfd)
bfd *obfd;
{
bfd *nbfd;
nbfd = new_bfd_contained_in(obfd);
if (nbfd == NULL) {
bfd_error = no_memory;
return NULL;
}
return nbfd;
}
boolean
bfd_set_archive_head (output_archive, new_head)
bfd *output_archive, *new_head;
{
output_archive->archive_head = new_head;
return true;
}
bfd *
look_for_bfd_in_cache (arch_bfd, filepos)
bfd *arch_bfd;
file_ptr filepos;
{
struct ar_cache *current;
for (current = bfd_ardata (arch_bfd)->cache; current != NULL;
current = current->next)
if (current->ptr == filepos) return current->arelt;
return NULL;
}
/* Kind of stupid to call cons for each one, but we don't do too many */
boolean
add_bfd_to_cache (arch_bfd, filepos, new_elt)
bfd *arch_bfd, *new_elt;
file_ptr filepos;
{
struct ar_cache *new_cache = ((struct ar_cache *)
zalloc (sizeof (struct ar_cache)));
if (new_cache == NULL) {
bfd_error = no_memory;
return false;
}
new_cache->ptr = filepos;
new_cache->arelt = new_elt;
new_cache->next = (struct ar_cache *)NULL;
if (bfd_ardata (arch_bfd)->cache == NULL)
bfd_ardata (arch_bfd)->cache = new_cache;
else {
struct ar_cache *current = bfd_ardata (arch_bfd)->cache;
for (; current->next != NULL; current = current->next);
current->next = new_cache;
}
return true;
}
/* The name begins with space. Hence the rest of the name is an index into
the string table. */
char *
get_extended_arelt_filename (arch, name)
bfd *arch;
char *name;
{
extern int errno;
unsigned long index = 0;
/* Should extract string so that I can guarantee not to overflow into
the next region, but I"m too lazy. */
errno = 0;
index = strtol (name, NULL, 10);
if (errno != 0) {
bfd_error = malformed_archive;
return NULL;
}
return bfd_ardata (arch)->extended_names + index;
}
/* This functions reads an arch header and returns an areltdata pointer, or
NULL on error.
Presumes the file pointer is already in the right place (ie pointing
to the ar_hdr in the file). Moves the file pointer; on success it
should be pointing to the front of the file contents; on failure it
could have been moved arbitrarily.
*/
struct areltdata *
snarf_ar_hdr (abfd)
bfd *abfd;
{
extern int errno;
struct ar_hdr hdr;
char *hdrp = (char *) &hdr;
unsigned int parsed_size;
struct areltdata *ared;
char *filename = NULL;
unsigned int namelen = 0;
unsigned int allocsize = sizeof (struct areltdata) + sizeof (struct ar_hdr);
char *allocptr;
if (bfd_read ((void *)hdrp, 1, sizeof (struct ar_hdr), abfd)
!= sizeof (struct ar_hdr)) {
bfd_error = no_more_archived_files;
return NULL;
}
if (strncmp ((hdr.ar_fmag), ARFMAG, 2)) {
bfd_error = malformed_archive;
return NULL;
}
errno = 0;
parsed_size = strtol (hdr.ar_size, NULL, 10);
if (errno != 0) {
bfd_error = malformed_archive;
return NULL;
}
/* extract the filename from the archive */
if (hdr.ar_name[0] == ' ' && bfd_ardata (abfd)->extended_names != NULL) {
filename = get_extended_arelt_filename (abfd, hdr.ar_name);
if (filename == NULL) {
bfd_error = malformed_archive;
return NULL;
}
}
else
{
/* We judge the end of the name by looking for a space or a
padchar */
namelen = 0;
while (namelen < (unsigned)ar_maxnamelen(abfd) &&
( hdr.ar_name[namelen] != 0 &&
hdr.ar_name[namelen] != ' ' &&
hdr.ar_name[namelen] != ar_padchar(abfd))) {
namelen++;
}
allocsize += namelen + 1;
}
allocptr = zalloc (allocsize);
if (allocptr == NULL) {
bfd_error = no_memory;
return NULL;
}
ared = (struct areltdata *) allocptr;
ared->arch_header = allocptr + sizeof (struct areltdata);
memcpy ((char *) ared->arch_header, &hdr, sizeof (struct ar_hdr));
ared->parsed_size = parsed_size;
if (filename != NULL) ared->filename = filename;
else {
ared->filename = allocptr + (sizeof (struct areltdata) +
sizeof (struct ar_hdr));
if (namelen)
memcpy (ared->filename, hdr.ar_name, namelen);
ared->filename[namelen] = '\0';
}
return ared;
}
bfd *
get_elt_at_filepos (archive, filepos)
bfd *archive;
file_ptr filepos;
{
struct areltdata *new_areldata;
bfd *n_nfd;
n_nfd = look_for_bfd_in_cache (archive, filepos);
if (n_nfd) return n_nfd;
if (0 > bfd_seek (archive, filepos, SEEK_SET)) {
bfd_error = system_call_error;
return NULL;
}
if ((new_areldata = snarf_ar_hdr (archive)) == NULL) return NULL;
n_nfd = _bfd_create_empty_archive_element_shell (archive);
if (n_nfd == NULL) {
free (new_areldata);
return NULL;
}
n_nfd->origin = bfd_tell (archive);
n_nfd->arelt_data = (void *) new_areldata;
n_nfd->filename = new_areldata->filename;
if (add_bfd_to_cache (archive, filepos, n_nfd))
return n_nfd;
/* huh? */
free (new_areldata);
free (n_nfd);
return NULL;
}
bfd *
bfd_get_elt_at_index (abfd, index)
bfd *abfd;
int index;
{
bfd *result =
get_elt_at_filepos
(abfd, (bfd_ardata (abfd)->symdefs + index)->file_offset);
return result;
}
/* If you've got an archive, call this to read each subfile. */
bfd *
bfd_openr_next_archived_file (archive, last_file)
bfd *archive, *last_file;
{
if ((bfd_get_format (archive) != bfd_archive) ||
(archive->direction == write_direction)) {
bfd_error = invalid_operation;
return NULL;
}
return BFD_SEND (archive,
openr_next_archived_file,
(archive,
last_file));
}
bfd *bfd_generic_openr_next_archived_file(archive, last_file)
bfd *archive;
bfd *last_file;
{
file_ptr filestart;
if (!last_file)
filestart = bfd_ardata (archive)->first_file_filepos;
else {
unsigned int size = arelt_size(last_file);
filestart = last_file->origin +size + size %2;
}
return get_elt_at_filepos (archive, filestart);
}
bfd_target *
bfd_generic_archive_p (abfd)
bfd *abfd;
{
char armag[SARMAG+1];
if (bfd_read ((void *)armag, 1, SARMAG, abfd) != SARMAG) {
bfd_error = wrong_format;
return 0;
}
if (strncmp (armag, ARMAG, SARMAG)) return 0;
bfd_set_ardata(abfd, (struct artdata *) zalloc (sizeof (struct artdata)));
if (bfd_ardata (abfd) == NULL) {
bfd_error = no_memory;
return 0;
}
bfd_ardata (abfd)->first_file_filepos = SARMAG;
if (!BFD_SEND (abfd, _bfd_slurp_armap, (abfd))) {
free (bfd_ardata (abfd));
abfd->tdata = NULL;
return 0;
}
/* armap could be left ungc'd! FIXME -- potential storage leak */
if (!BFD_SEND (abfd, _bfd_slurp_extended_name_table, (abfd))) {
free (bfd_ardata (abfd));
abfd->tdata = NULL;
return 0;
}
return abfd->xvec;
}
/* Returns false on error, true otherwise */
boolean
bfd_slurp_bsd_armap (abfd)
bfd *abfd;
{
struct areltdata *mapdata;
char nextname[17];
unsigned int counter = 0;
int *raw_armap, *rbase;
struct artdata *ardata = bfd_ardata (abfd);
char *stringbase;
if (bfd_read ((void *)nextname, 1, 16, abfd) == 16) {
/* The archive has at least 16 bytes in it */
bfd_seek (abfd, -16L, SEEK_CUR);
if (strncmp (nextname, "__.SYMDEF ", 16)) {
bfd_has_map (abfd) = false;
return true;
}
mapdata = snarf_ar_hdr (abfd);
if (mapdata == NULL) return false;
raw_armap = (int *) zalloc (mapdata->parsed_size);
if (raw_armap == NULL) {
bfd_error = no_memory;
byebye:
free (mapdata);
return false;
}
if (bfd_read ((void *)raw_armap, 1, mapdata->parsed_size, abfd) !=
mapdata->parsed_size) {
bfd_error = malformed_archive;
free (raw_armap);
goto byebye;
}
ardata->symdef_count = *(raw_armap) / sizeof (struct symdef);
ardata->cache = 0;
rbase = raw_armap+1;
ardata->symdefs = (carsym *) rbase;
stringbase = ((char *) (ardata->symdefs + ardata->symdef_count)) + 4;
for (;counter < (unsigned)( ardata->symdef_count); counter++) {
struct symdef *sym = ((struct symdef *) rbase) + counter;
sym->s.name = sym->s.string_offset + stringbase;
}
ardata->first_file_filepos = bfd_tell (abfd);
/* Pad to an even boundary if you have to */
ardata->first_file_filepos += (ardata-> first_file_filepos) %2;
free (mapdata);
bfd_has_map (abfd) = true;
}
return true;
}
/* Returns false on error, true otherwise */
boolean
bfd_slurp_coff_armap (abfd)
bfd *abfd;
{
struct areltdata *mapdata;
char nextname;
int *raw_armap, *rawptr;
struct artdata *ardata = bfd_ardata (abfd);
char *stringbase;
unsigned int stringsize;
carsym *carsyms;
if (bfd_read ((void *)&nextname, 1, 1, abfd) != 1) {
bfd_seek (abfd, -1L, SEEK_CUR);
bfd_has_map(abfd) = false;
return true;
}
bfd_seek (abfd, -1L, SEEK_CUR);
if (nextname != '/') {
/* Actually I think this is an error for a COFF archive */
bfd_has_map (abfd) = false;
return true;
}
mapdata = snarf_ar_hdr (abfd);
if (mapdata == NULL) return false;
raw_armap = (int *) zalloc (mapdata->parsed_size);
if (raw_armap == NULL) {
bfd_error = no_memory;
byebye:
free (mapdata);
return false;
}
if (bfd_read ((void *)raw_armap, 1, mapdata->parsed_size, abfd) !=
mapdata->parsed_size) {
bfd_error = malformed_archive;
oops:
free (raw_armap);
goto byebye;
}
/* The coff armap must be read sequentially. So we construct a bsd-style
one in core all at once, for simplicity. */
stringsize = mapdata->parsed_size - (4 * (*raw_armap)) - 4;
{
unsigned int nsymz = *raw_armap;
unsigned int carsym_size = (nsymz * sizeof (carsym));
unsigned int ptrsize = (4 * nsymz);
unsigned int i;
ardata->symdefs = (carsym *) zalloc (carsym_size + stringsize + 1);
if (ardata->symdefs == NULL) {
bfd_error = no_memory;
goto oops;
}
carsyms = ardata->symdefs;
stringbase = ((char *) ardata->symdefs) + carsym_size;
memcpy (stringbase, (char*)raw_armap + ptrsize + 4, stringsize);
/* OK, build the carsyms */
for (i = 0; i < nsymz; i++)
{
rawptr = raw_armap + i + 1;
carsyms->file_offset = *rawptr;
carsyms->name = stringbase;
for (; *(stringbase++););
carsyms++;
}
*stringbase = 0;
}
ardata->symdef_count = *raw_armap;
ardata->first_file_filepos = bfd_tell (abfd);
/* Pad to an even boundary if you have to */
ardata->first_file_filepos += (ardata->first_file_filepos) %2;
free (raw_armap);
free (mapdata);
bfd_has_map (abfd) = true;
return true;
}
/** Extended name table.
Normally archives support only 14-character filenames. Intel has extended
the format: longer names are stored in a special element (the first in the
archive, or second if there is an armap); the name in the ar_hdr is replaced
by <space><index into filename element>. Index is the P.R. of an int (radix:
8). */
/* Returns false on error, true otherwise */
boolean
_bfd_slurp_extended_name_table (abfd)
bfd *abfd;
{
char nextname[17];
struct areltdata *namedata;
if (bfd_read ((void *)nextname, 1, 16, abfd) == 16) {
bfd_seek (abfd, -16L, SEEK_CUR);
if (strncmp (nextname, "ARFILENAMES/ ", 16)) {
bfd_ardata (abfd)->extended_names = NULL;
return true;
}
namedata = snarf_ar_hdr (abfd);
if (namedata == NULL) return false;
bfd_ardata (abfd)->extended_names = zalloc (namedata->parsed_size);
if (bfd_ardata (abfd)->extended_names == NULL) {
bfd_error = no_memory;
byebye:
free (namedata);
return false;
}
if (bfd_read ((void*)bfd_ardata (abfd)->extended_names, 1,
namedata->parsed_size, abfd) != namedata->parsed_size) {
bfd_error = malformed_archive;
free (bfd_ardata (abfd)->extended_names);
bfd_ardata (abfd)->extended_names = NULL;
goto byebye;
}
/* Pad to an even boundary if you have to */
bfd_ardata (abfd)->first_file_filepos = bfd_tell (abfd);
bfd_ardata (abfd)->first_file_filepos +=
(bfd_ardata (abfd)->first_file_filepos) %2;
free (namedata);
}
return true;
}
static
char *normalize(file)
char *file;
{
char * filename = strrchr(file, '/');
if (filename != (char *)NULL) {
filename ++;
}
else {
filename = file;
}
return filename;
}
/* Follows archive_head and produces an extended name table if necessary.
Returns (in tabloc) a pointer to an extended name table, and in tablen
the length of the table. If it makes an entry it clobbers the filename
so that the element may be written without further massage.
Returns true if it ran successfully, false if something went wrong.
A successful return may still involve a zero-length tablen!
*/
boolean
bfd_construct_extended_name_table (abfd, tabloc, tablen)
bfd *abfd;
char **tabloc;
unsigned int *tablen;
{
unsigned int maxname = abfd->xvec->ar_max_namelen;
unsigned int total_namelen = 0;
bfd *current;
char *strptr;
*tablen = 0;
/* Figure out how long the table should be */
for (current = abfd->archive_head; current != NULL; current = current->next){
unsigned int thislen = strlen (normalize(current->filename));
if (thislen > maxname) total_namelen += thislen + 1; /* leave room for \0 */
}
if (total_namelen == 0) return true;
*tabloc = zalloc (total_namelen);
if (*tabloc == NULL) {
bfd_error = no_memory;
return false;
}
*tablen = total_namelen;
strptr = *tabloc;
for (current = abfd->archive_head; current != NULL; current =
current->next) {
char *normal =normalize( current->filename);
unsigned int thislen = strlen (normal);
if (thislen > maxname) {
/* Works for now; may need to be re-engineered if we encounter an oddball
archive format and want to generalise this hack. */
struct ar_hdr *hdr = arch_hdr(current);
strcpy (strptr, normal);
hdr->ar_name[0] = ' ';
/* We know there will always be enough room (one of the few cases
where you may safely use sprintf). */
sprintf ((hdr->ar_name) + 1, "%-o", (unsigned) (strptr - *tabloc));
strptr += thislen + 1;
}
}
return true;
}
/** A couple of functions for creating ar_hdrs */
/* Takes a filename, returns an arelt_data for it, or NULL if it can't make one.
The filename must refer to a filename in the filesystem.
The filename field of the ar_hdr will NOT be initialized
*/
struct areltdata *
bfd_ar_hdr_from_filesystem (filename)
char *filename;
{
struct stat status;
struct areltdata *ared;
struct ar_hdr *hdr;
char *temp, *temp1;
if (stat (filename, &status) != 0) {
bfd_error = system_call_error;
return NULL;
}
ared = (struct areltdata *) zalloc (sizeof (struct ar_hdr) +
sizeof (struct areltdata));
if (ared == NULL) {
bfd_error = no_memory;
return NULL;
}
hdr = (struct ar_hdr *) (((char *) ared) + sizeof (struct areltdata));
/* ar headers are space padded, not null padded! */
temp = (char *) hdr;
temp1 = temp + sizeof (struct ar_hdr) - 2;
for (; temp < temp1; *(temp++) = ' ');
strncpy (hdr->ar_fmag, ARFMAG, 2);
/* Goddamned sprintf doesn't permit MAXIMUM field lengths */
sprintf ((hdr->ar_date), "%-12ld", status.st_mtime);
sprintf ((hdr->ar_uid), "%d", status.st_uid);
sprintf ((hdr->ar_gid), "%d", status.st_gid);
sprintf ((hdr->ar_mode), "%-8o", (unsigned) status.st_mode);
sprintf ((hdr->ar_size), "%-10ld", status.st_size);
/* Correct for a lossage in sprintf whereby it null-terminates. I cannot
understand how these C losers could design such a ramshackle bunch of
IO operations */
temp = (char *) hdr;
temp1 = temp + sizeof (struct ar_hdr) - 2;
for (; temp < temp1; temp++) {
if (*temp == '\0') *temp = ' ';
}
strncpy (hdr->ar_fmag, ARFMAG, 2);
ared->parsed_size = status.st_size;
ared->arch_header = (char *) hdr;
return ared;
}
struct ar_hdr *
bfd_special_undocumented_glue (filename)
char *filename;
{
return (struct ar_hdr *) bfd_ar_hdr_from_filesystem (filename) -> arch_header;
}
/* Analogous to stat call */
int
bfd_generic_stat_arch_elt (abfd, buf)
bfd *abfd;
struct stat *buf;
{
struct ar_hdr *hdr;
char *aloser;
if (abfd->arelt_data == NULL) {
bfd_error = invalid_operation;
return -1;
}
hdr = arch_hdr (abfd);
#define foo(arelt, stelt, size) \
buf->stelt = strtol (hdr->arelt, &aloser, size); \
if (aloser == hdr->arelt) return -1;
foo (ar_date, st_mtime, 10);
foo (ar_uid, st_uid, 10);
foo (ar_gid, st_gid, 10);
foo (ar_mode, st_mode, 8);
foo (ar_size, st_size, 10);
return 0;
}
/* Don't do anything -- it'll be taken care of later */
void
bfd_dont_truncate_arname (ignore_abfd, ignore_filename, ignore_arhdr)
bfd *ignore_abfd;
char *ignore_filename;
char *ignore_arhdr;
{
/* FIXME -- Actually this is incorrect. If the name is short we
should insert into the header; only if it is long should we do
nothing.
Anyway, this interacts unpleasantly with ar's quick-append option,
for now just be compatible with the old system */
return;
}
void
bfd_bsd_truncate_arname (abfd, pathname, arhdr)
bfd *abfd;
char *pathname;
char *arhdr;
{
struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
int length;
char *filename = strrchr (pathname, '/');
int maxlen = ar_maxnamelen (abfd);
if (filename == NULL)
filename = pathname;
else
++filename;
length = strlen (filename);
if (length <= maxlen)
memcpy (hdr->ar_name, filename, length);
else {
/* pathname: meet procrustes */
memcpy (hdr->ar_name, filename, maxlen);
length = maxlen;
}
if (length < 16) (hdr->ar_name)[length] = ar_padchar (abfd);
}
/* Store name into ar header. Truncates the name to fit.
1> strip pathname to be just the basename.
2> if it's short enuf to fit, stuff it in.
3> If it doesn't end with .o, truncate it to fit
4> truncate it before the .o, append .o, stuff THAT in.
*/
/* This is what gnu ar does. It's better but incompatible with the bsd ar. */
void
bfd_gnu_truncate_arname (abfd, pathname, arhdr)
bfd *abfd;
char *pathname;
char *arhdr;
{
struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
int length;
char *filename = strrchr (pathname, '/');
int maxlen = ar_maxnamelen (abfd);
if (filename == NULL)
filename = pathname;
else
++filename;
length = strlen (filename);
if (length <= maxlen)
memcpy (hdr->ar_name, filename, length);
else { /* pathname: meet procrustes */
memcpy (hdr->ar_name, filename, maxlen);
if ((filename[length - 2] == '.') && (filename[length - 1] == 'o')) {
hdr->ar_name[maxlen - 2] = '.';
hdr->ar_name[maxlen - 1] = 'o';
}
length = maxlen;
}
if (length < 16) (hdr->ar_name)[length] = ar_padchar (abfd);
}
PROTO (boolean, compute_and_write_armap, (bfd *arch, unsigned int elength));
/* The bfd is open for write and has its format set to bfd_archive */
boolean
_bfd_write_archive_contents (arch)
bfd *arch;
{
bfd *current;
char *etable = NULL;
unsigned int elength = 0;
boolean makemap = bfd_has_map (arch);
boolean hasobjects = false; /* if no .o's, don't bother to make a map */
unsigned int i;
/* Verify the viability of all entries; if any of them live in the
filesystem (as opposed to living in an archive open for input)
then construct a fresh ar_hdr for them.
*/
for (current = arch->archive_head; current; current = current->next) {
if (bfd_write_p (current)) {
bfd_error = invalid_operation;
return false;
}
if (!current->arelt_data) {
current->arelt_data =
(void *) bfd_ar_hdr_from_filesystem (current->filename);
if (!current->arelt_data) return false;
/* Put in the file name */
BFD_SEND (arch, _bfd_truncate_arname,(arch,
current->filename,
(char *) arch_hdr(current)));
}
if (makemap) { /* don't bother if we won't make a map! */
if ((bfd_check_format (current, bfd_object))
#if 0 /* FIXME -- these are not set correctly */
&& ((bfd_get_file_flags (current) & HAS_SYMS))
#endif
)
hasobjects = true;
}
}
if (!bfd_construct_extended_name_table (arch, &etable, &elength))
return false;
bfd_seek (arch, 0, SEEK_SET);
bfd_write (ARMAG, 1, SARMAG, arch);
if (makemap && hasobjects) {
if (compute_and_write_armap (arch, elength) != true) {
if (etable) free (etable);
return false;
}
}
if (elength != 0) {
struct ar_hdr hdr;
memset ((char *)(&hdr), 0, sizeof (struct ar_hdr));
sprintf (&(hdr.ar_name[0]), "ARFILENAMES/");
sprintf (&(hdr.ar_size[0]), "%-10d", (int) elength);
hdr.ar_fmag[0] = '`'; hdr.ar_fmag[1] = '\n';
for (i = 0; i < sizeof (struct ar_hdr); i++)
if (((char *)(&hdr))[i] == '\0') (((char *)(&hdr))[i]) = ' ';
bfd_write (&hdr, 1, sizeof (struct ar_hdr), arch);
bfd_write (etable, 1, elength, arch);
if ((elength % 2) == 1) bfd_write ("\n", 1, 1, arch);
if (etable) free (etable);
}
for (current = arch->archive_head; current; current = current->next) {
char buffer[DEFAULT_BUFFERSIZE];
unsigned int remaining = arelt_size (current);
struct ar_hdr *hdr = arch_hdr(current);
/* write ar header */
if (bfd_write (hdr, 1, sizeof(*hdr), arch) != sizeof(*hdr)) {
syserr:
bfd_error = system_call_error;
return false;
}
if (bfd_seek (current, 0L, SEEK_SET) != 0L) goto syserr;
while (remaining)
{
unsigned int amt = DEFAULT_BUFFERSIZE;
if (amt > remaining) {
amt = remaining;
}
if (bfd_read (buffer, amt, 1, current) != amt) goto syserr;
if (bfd_write (buffer, amt, 1, arch) != amt) goto syserr;
remaining -= amt;
}
if ((arelt_size (current) % 2) == 1) bfd_write ("\n", 1, 1, arch);
}
return true;
}
/* Note that the namidx for the first symbol is 0 */
boolean
compute_and_write_armap (arch, elength)
bfd *arch;
unsigned int elength;
{
bfd *current;
file_ptr elt_no = 0;
struct orl *map;
int orl_max = 15000; /* fine initial default */
int orl_count = 0;
int stridx = 0; /* string index */
/* Dunno if this is the best place for this info... */
if (elength != 0) elength += sizeof (struct ar_hdr);
elength += elength %2 ;
map = (struct orl *) zalloc (orl_max * sizeof (struct orl));
if (map == NULL) {
bfd_error = no_memory;
return false;
}
/* Map over each element */
for (current = arch->archive_head;
current != (bfd *)NULL;
current = current->next, elt_no++)
{
if ((bfd_check_format (current, bfd_object) == true)
&& ((bfd_get_file_flags (current) & HAS_SYMS))) {
asymbol **syms;
unsigned int storage;
unsigned int symcount;
unsigned int src_count;
storage = get_symtab_upper_bound (current);
if (storage != 0) {
syms = (asymbol **) zalloc (storage);
if (syms == NULL) {
bfd_error = no_memory; /* FIXME -- memory leak */
return false;
}
symcount = bfd_canonicalize_symtab (current, syms);
/* Now map over all the symbols, picking out the ones we want */
for (src_count = 0; src_count <symcount; src_count++) {
flagword flags = (syms[src_count])->flags;
if ((flags & BSF_GLOBAL) ||
(flags & BSF_FORT_COMM)) {
/* This symbol will go into the archive header */
if (orl_count == orl_max)
{
orl_max *= 2;
map = (struct orl *) realloc ((char *) map,
orl_max * sizeof (struct orl));
}
(map[orl_count]).name = &((syms[src_count])->name);
(map[orl_count]).pos = elt_no;
(map[orl_count]).namidx = stridx;
stridx += strlen ((syms[src_count])->name) + 1;
++orl_count;
}
}
}
}
}
/* OK, now we have collected all the data, let's write them out */
if (!BFD_SEND (arch, write_armap,
(arch, elength, map, orl_count, stridx))) {
free (map);
return false;
}
free (map);
return true;
}
/* FIXME -- have to byte-swap this */
boolean
bsd_write_armap (arch, elength, map, orl_count, stridx)
bfd *arch;
unsigned int elength;
struct orl *map;
int orl_count;
int stridx;
{
unsigned int ranlibsize = (orl_count * sizeof (struct ranlib)) + 4;
unsigned int stringsize = stridx + 4;
unsigned int mapsize = stringsize + ranlibsize;
file_ptr firstreal;
bfd *current = arch->archive_head;
int last_eltno = 0; /* last element arch seen */
int temp;
int count;
struct ar_hdr hdr;
struct stat statbuf;
unsigned int i;
int padit = mapsize & 1;
if (padit) mapsize ++;
firstreal = mapsize + elength + sizeof (struct ar_hdr) + SARMAG;
fstat (arch->iostream, &statbuf); /* FIXME -- descriptor must be open! */
memset ((char *)(&hdr), 0, sizeof (struct ar_hdr));
sprintf (hdr.ar_name, "__.SYMDEF");
sprintf (hdr.ar_size, "%-10d", (int) mapsize);
sprintf (hdr.ar_date, "%ld", statbuf.st_mtime);
hdr.ar_fmag[0] = '`'; hdr.ar_fmag[1] = '\n';
for (i = 0; i < sizeof (struct ar_hdr); i++)
if (((char *)(&hdr))[i] == '\0') (((char *)(&hdr))[i]) = ' ';
bfd_write (&hdr, 1, sizeof (struct ar_hdr), arch);
temp = orl_count /* + 4 */;
bfd_write (&temp, 1, sizeof (temp), arch);
for (count = 0; count < orl_count; count++) {
struct symdef outs;
struct symdef *outp = &outs;
if ((map[count]).pos != last_eltno) {
firstreal += arelt_size (current) + sizeof (struct ar_hdr);
firstreal += firstreal % 2;
last_eltno = (map[count]).pos;
current = current->next;
}
outs.s.string_offset = ((map[count]).namidx) +4;
outs.file_offset = firstreal;
bfd_write ((char *)outp, 1, sizeof (outs), arch);
}
/* now write the strings themselves */
temp = stridx + 4;
bfd_write (&temp, 1, sizeof (temp), arch);
for (count = 0; count < orl_count; count++)
bfd_write (*((map[count]).name), 1, strlen (*((map[count]).name))+1, arch);
/* The spec sez this should be a newline. But in order to be
bug-compatible for sun's ar we use a null. */
if (padit)
bfd_write("\0",1,1,arch);
return true;
}
/* A coff armap looks like :
ARMAG
struct ar_hdr with name = '/'
number of symbols
offset of file for symbol 0
offset of file for symbol 1
..
offset of file for symbol n-1
symbol name 0
symbol name 1
..
symbol name n-1
*/
boolean
coff_write_armap (arch, elength, map, orl_count, stridx)
bfd *arch;
unsigned int elength;
struct orl *map;
int orl_count;
int stridx;
{
unsigned int ranlibsize = (orl_count * 4) + 4;
unsigned int stringsize = stridx;
unsigned int mapsize = stringsize + ranlibsize;
file_ptr archive_member_file_ptr;
bfd *current = arch->archive_head;
int last_eltno = 0; /* last element arch seen */
int count;
struct ar_hdr hdr;
unsigned int i;
int padit = mapsize & 1;
if (padit) mapsize ++;
archive_member_file_ptr =
mapsize + elength + sizeof (struct ar_hdr) + SARMAG;
memset ((char *)(&hdr), 0, sizeof (struct ar_hdr));
hdr.ar_name[0] = '/';
sprintf (hdr.ar_size, "%-10d", (int) mapsize);
sprintf (hdr.ar_date, "%ld", time (NULL));
/* This, at least, is what Intel coff sets the values to.: */
sprintf ((hdr.ar_uid), "%d", 0);
sprintf ((hdr.ar_gid), "%d", 0);
sprintf ((hdr.ar_mode), "%-7o", 0);
hdr.ar_fmag[0] = '`'; hdr.ar_fmag[1] = '\n';
for (i = 0; i < sizeof (struct ar_hdr); i++)
if (((char *)(&hdr))[i] == '\0') (((char *)(&hdr))[i]) = ' ';
/* Write the ar header for this item and the number of symbols */
bfd_write (&hdr, 1, sizeof (struct ar_hdr), arch);
bfd_write (&orl_count, 1, sizeof (orl_count), arch);
/* Two passes, first write the file offsets for each symbol -
remembering that each offset is on a two byte boundary
*/
for (count = 0; count < orl_count; count++) {
while ((map[count]).pos != last_eltno) {
/* If this is the first time we've seen a ref to this archive
then remember it's size */
archive_member_file_ptr +=
arelt_size (current) + sizeof (struct ar_hdr);
archive_member_file_ptr += archive_member_file_ptr % 2;
current = current->next;
last_eltno++;
}
bfd_write (&archive_member_file_ptr,
1,
sizeof (archive_member_file_ptr),
arch);
}
/* now write the strings themselves */
for (count = 0; count < orl_count; count++) {
bfd_write (*((map[count]).name),
1,
strlen (*((map[count]).name))+1, arch);
}
/* The spec sez this should be a newline. But in order to be
bug-compatible for arc960 we use a null. */
if (padit)
bfd_write("\0",1,1,arch);
return true;
}
Reference in New Issue View Git Blame Copy Permalink