| 1 | /* BFD back-end for archive files (libraries). |
| 2 | Copyright 1990, 91, 92, 93, 94 Free Software Foundation, Inc. |
| 3 | Written by Cygnus Support. Mostly Gumby Henkel-Wallace's fault. |
| 4 | |
| 5 | This file is part of BFD, the Binary File Descriptor library. |
| 6 | |
| 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. |
| 11 | |
| 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. |
| 16 | |
| 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ |
| 20 | |
| 21 | /* |
| 22 | @setfilename archive-info |
| 23 | SECTION |
| 24 | Archives |
| 25 | |
| 26 | DESCRIPTION |
| 27 | An archive (or library) is just another BFD. It has a symbol |
| 28 | table, although there's not much a user program will do with it. |
| 29 | |
| 30 | The big difference between an archive BFD and an ordinary BFD |
| 31 | is that the archive doesn't have sections. Instead it has a |
| 32 | chain of BFDs that are considered its contents. These BFDs can |
| 33 | be manipulated like any other. The BFDs contained in an |
| 34 | archive opened for reading will all be opened for reading. You |
| 35 | may put either input or output BFDs into an archive opened for |
| 36 | output; they will be handled correctly when the archive is closed. |
| 37 | |
| 38 | Use <<bfd_openr_next_archived_file>> to step through |
| 39 | the contents of an archive opened for input. You don't |
| 40 | have to read the entire archive if you don't want |
| 41 | to! Read it until you find what you want. |
| 42 | |
| 43 | Archive contents of output BFDs are chained through the |
| 44 | <<next>> pointer in a BFD. The first one is findable through |
| 45 | the <<archive_head>> slot of the archive. Set it with |
| 46 | <<bfd_set_archive_head>> (q.v.). A given BFD may be in only one |
| 47 | open output archive at a time. |
| 48 | |
| 49 | As expected, the BFD archive code is more general than the |
| 50 | archive code of any given environment. BFD archives may |
| 51 | contain files of different formats (e.g., a.out and coff) and |
| 52 | even different architectures. You may even place archives |
| 53 | recursively into archives! |
| 54 | |
| 55 | This can cause unexpected confusion, since some archive |
| 56 | formats are more expressive than others. For instance, Intel |
| 57 | COFF archives can preserve long filenames; SunOS a.out archives |
| 58 | cannot. If you move a file from the first to the second |
| 59 | format and back again, the filename may be truncated. |
| 60 | Likewise, different a.out environments have different |
| 61 | conventions as to how they truncate filenames, whether they |
| 62 | preserve directory names in filenames, etc. When |
| 63 | interoperating with native tools, be sure your files are |
| 64 | homogeneous. |
| 65 | |
| 66 | Beware: most of these formats do not react well to the |
| 67 | presence of spaces in filenames. We do the best we can, but |
| 68 | can't always handle this case due to restrictions in the format of |
| 69 | archives. Many Unix utilities are braindead in regards to |
| 70 | spaces and such in filenames anyway, so this shouldn't be much |
| 71 | of a restriction. |
| 72 | |
| 73 | Archives are supported in BFD in <<archive.c>>. |
| 74 | |
| 75 | */ |
| 76 | |
| 77 | /* Assumes: |
| 78 | o - all archive elements start on an even boundary, newline padded; |
| 79 | o - all arch headers are char *; |
| 80 | o - all arch headers are the same size (across architectures). |
| 81 | */ |
| 82 | |
| 83 | /* Some formats provide a way to cram a long filename into the short |
| 84 | (16 chars) space provided by a BSD archive. The trick is: make a |
| 85 | special "file" in the front of the archive, sort of like the SYMDEF |
| 86 | entry. If the filename is too long to fit, put it in the extended |
| 87 | name table, and use its index as the filename. To prevent |
| 88 | confusion prepend the index with a space. This means you can't |
| 89 | have filenames that start with a space, but then again, many Unix |
| 90 | utilities can't handle that anyway. |
| 91 | |
| 92 | This scheme unfortunately requires that you stand on your head in |
| 93 | order to write an archive since you need to put a magic file at the |
| 94 | front, and need to touch every entry to do so. C'est la vie. |
| 95 | |
| 96 | We support two variants of this idea: |
| 97 | The SVR4 format (extended name table is named "//"), |
| 98 | and an extended pseudo-BSD variant (extended name table is named |
| 99 | "ARFILENAMES/"). The origin of the latter format is uncertain. |
| 100 | |
| 101 | BSD 4.4 uses a third scheme: It writes a long filename |
| 102 | directly after the header. This allows 'ar q' to work. |
| 103 | We currently can read BSD 4.4 archives, but not write them. |
| 104 | */ |
| 105 | |
| 106 | /* Summary of archive member names: |
| 107 | |
| 108 | Symbol table (must be first): |
| 109 | "__.SYMDEF " - Symbol table, Berkeley style, produced by ranlib. |
| 110 | "/ " - Symbol table, system 5 style. |
| 111 | |
| 112 | Long name table (must be before regular file members): |
| 113 | "// " - Long name table, System 5 R4 style. |
| 114 | "ARFILENAMES/ " - Long name table, non-standard extended BSD (not BSD 4.4). |
| 115 | |
| 116 | Regular file members with short names: |
| 117 | "filename.o/ " - Regular file, System 5 style (embedded spaces ok). |
| 118 | "filename.o " - Regular file, Berkeley style (no embedded spaces). |
| 119 | |
| 120 | Regular files with long names (or embedded spaces, for BSD variants): |
| 121 | "/18 " - SVR4 style, name at offset 18 in name table. |
| 122 | "#1/23 " - Long name (or embedded paces) 23 characters long, |
| 123 | BSD 4.4 style, full name follows header. |
| 124 | Implemented for reading, not writing. |
| 125 | " 18 " - Long name 18 characters long, extended pseudo-BSD. |
| 126 | */ |
| 127 | |
| 128 | #include "bfd.h" |
| 129 | #include "sysdep.h" |
| 130 | #include "libbfd.h" |
| 131 | #include "aout/ar.h" |
| 132 | #include "aout/ranlib.h" |
| 133 | #include <errno.h> |
| 134 | #include <string.h> /* For memchr, strrchr and friends */ |
| 135 | #include <ctype.h> |
| 136 | |
| 137 | #ifndef errno |
| 138 | extern int errno; |
| 139 | #endif |
| 140 | |
| 141 | #ifdef GNU960 |
| 142 | #define BFD_GNU960_ARMAG(abfd) (BFD_COFF_FILE_P((abfd)) ? ARMAG : ARMAGB) |
| 143 | #endif |
| 144 | |
| 145 | /* Can't define this in hosts/foo.h, because (e.g. in gprof) the hosts file |
| 146 | is included, then obstack.h, which thinks if offsetof is defined, it |
| 147 | doesn't need to include stddef.h. */ |
| 148 | /* Define offsetof for those systems which lack it */ |
| 149 | |
| 150 | #if !defined (offsetof) |
| 151 | #define offsetof(TYPE, MEMBER) ((unsigned long) &((TYPE *)0)->MEMBER) |
| 152 | #endif |
| 153 | |
| 154 | /* We keep a cache of archive filepointers to archive elements to |
| 155 | speed up searching the archive by filepos. We only add an entry to |
| 156 | the cache when we actually read one. We also don't sort the cache; |
| 157 | it's generally short enough to search linearly. |
| 158 | Note that the pointers here point to the front of the ar_hdr, not |
| 159 | to the front of the contents! |
| 160 | */ |
| 161 | struct ar_cache |
| 162 | { |
| 163 | file_ptr ptr; |
| 164 | bfd *arelt; |
| 165 | struct ar_cache *next; |
| 166 | }; |
| 167 | |
| 168 | #define ar_padchar(abfd) ((abfd)->xvec->ar_pad_char) |
| 169 | #define ar_maxnamelen(abfd) ((abfd)->xvec->ar_max_namelen) |
| 170 | |
| 171 | #define arch_eltdata(bfd) ((struct areltdata *)((bfd)->arelt_data)) |
| 172 | #define arch_hdr(bfd) ((struct ar_hdr *)arch_eltdata(bfd)->arch_header) |
| 173 | |
| 174 | static char *get_extended_arelt_filename PARAMS ((bfd *arch, |
| 175 | const char *name)); |
| 176 | static boolean do_slurp_bsd_armap PARAMS ((bfd *abfd)); |
| 177 | static boolean do_slurp_coff_armap PARAMS ((bfd *abfd)); |
| 178 | static const char *normalize PARAMS ((const char *file)); |
| 179 | static boolean bfd_construct_extended_name_table PARAMS ((bfd *abfd, |
| 180 | char **tabloc, |
| 181 | unsigned int *)); |
| 182 | static struct areltdata *bfd_ar_hdr_from_filesystem PARAMS ((bfd *abfd, |
| 183 | const char *)); |
| 184 | static boolean compute_and_write_armap PARAMS ((bfd *arch, |
| 185 | unsigned int elength)); |
| 186 | static boolean bsd_update_armap_timestamp PARAMS ((bfd *arch)); |
| 187 | \f |
| 188 | boolean |
| 189 | _bfd_generic_mkarchive (abfd) |
| 190 | bfd *abfd; |
| 191 | { |
| 192 | abfd->tdata.aout_ar_data = ((struct artdata *) |
| 193 | bfd_zalloc (abfd, sizeof (struct artdata))); |
| 194 | |
| 195 | if (bfd_ardata (abfd) == NULL) |
| 196 | { |
| 197 | bfd_set_error (bfd_error_no_memory); |
| 198 | return false; |
| 199 | } |
| 200 | |
| 201 | bfd_ardata (abfd)->cache = NULL; |
| 202 | bfd_ardata (abfd)->archive_head = NULL; |
| 203 | bfd_ardata (abfd)->symdefs = NULL; |
| 204 | bfd_ardata (abfd)->extended_names = NULL; |
| 205 | bfd_ardata (abfd)->tdata = NULL; |
| 206 | |
| 207 | return true; |
| 208 | } |
| 209 | |
| 210 | /* |
| 211 | FUNCTION |
| 212 | bfd_get_next_mapent |
| 213 | |
| 214 | SYNOPSIS |
| 215 | symindex bfd_get_next_mapent(bfd *abfd, symindex previous, carsym **sym); |
| 216 | |
| 217 | DESCRIPTION |
| 218 | Step through archive @var{abfd}'s symbol table (if it |
| 219 | has one). Successively update @var{sym} with the next symbol's |
| 220 | information, returning that symbol's (internal) index into the |
| 221 | symbol table. |
| 222 | |
| 223 | Supply <<BFD_NO_MORE_SYMBOLS>> as the @var{previous} entry to get |
| 224 | the first one; returns <<BFD_NO_MORE_SYMBOLS>> when you've already |
| 225 | got the last one. |
| 226 | |
| 227 | A <<carsym>> is a canonical archive symbol. The only |
| 228 | user-visible element is its name, a null-terminated string. |
| 229 | */ |
| 230 | |
| 231 | symindex |
| 232 | bfd_get_next_mapent (abfd, prev, entry) |
| 233 | bfd *abfd; |
| 234 | symindex prev; |
| 235 | carsym **entry; |
| 236 | { |
| 237 | if (!bfd_has_map (abfd)) |
| 238 | { |
| 239 | bfd_set_error (bfd_error_invalid_operation); |
| 240 | return BFD_NO_MORE_SYMBOLS; |
| 241 | } |
| 242 | |
| 243 | if (prev == BFD_NO_MORE_SYMBOLS) |
| 244 | prev = 0; |
| 245 | else if (++prev >= bfd_ardata (abfd)->symdef_count) |
| 246 | return BFD_NO_MORE_SYMBOLS; |
| 247 | |
| 248 | *entry = (bfd_ardata (abfd)->symdefs + prev); |
| 249 | return prev; |
| 250 | } |
| 251 | |
| 252 | /* To be called by backends only */ |
| 253 | |
| 254 | bfd * |
| 255 | _bfd_create_empty_archive_element_shell (obfd) |
| 256 | bfd *obfd; |
| 257 | { |
| 258 | bfd *nbfd; |
| 259 | |
| 260 | nbfd = _bfd_new_bfd_contained_in (obfd); |
| 261 | if (nbfd == NULL) |
| 262 | { |
| 263 | bfd_set_error (bfd_error_no_memory); |
| 264 | return NULL; |
| 265 | } |
| 266 | return nbfd; |
| 267 | } |
| 268 | |
| 269 | /* |
| 270 | FUNCTION |
| 271 | bfd_set_archive_head |
| 272 | |
| 273 | SYNOPSIS |
| 274 | boolean bfd_set_archive_head(bfd *output, bfd *new_head); |
| 275 | |
| 276 | DESCRIPTION |
| 277 | Set the head of the chain of |
| 278 | BFDs contained in the archive @var{output} to @var{new_head}. |
| 279 | */ |
| 280 | |
| 281 | boolean |
| 282 | bfd_set_archive_head (output_archive, new_head) |
| 283 | bfd *output_archive; |
| 284 | bfd *new_head; |
| 285 | { |
| 286 | |
| 287 | output_archive->archive_head = new_head; |
| 288 | return true; |
| 289 | } |
| 290 | |
| 291 | bfd * |
| 292 | _bfd_look_for_bfd_in_cache (arch_bfd, filepos) |
| 293 | bfd *arch_bfd; |
| 294 | file_ptr filepos; |
| 295 | { |
| 296 | struct ar_cache *current; |
| 297 | |
| 298 | for (current = bfd_ardata (arch_bfd)->cache; current != NULL; |
| 299 | current = current->next) |
| 300 | if (current->ptr == filepos) |
| 301 | return current->arelt; |
| 302 | |
| 303 | return NULL; |
| 304 | } |
| 305 | |
| 306 | /* Kind of stupid to call cons for each one, but we don't do too many */ |
| 307 | boolean |
| 308 | _bfd_add_bfd_to_archive_cache (arch_bfd, filepos, new_elt) |
| 309 | bfd *arch_bfd, *new_elt; |
| 310 | file_ptr filepos; |
| 311 | { |
| 312 | struct ar_cache *new_cache = ((struct ar_cache *) |
| 313 | bfd_zalloc (arch_bfd, |
| 314 | sizeof (struct ar_cache))); |
| 315 | |
| 316 | if (new_cache == NULL) |
| 317 | { |
| 318 | bfd_set_error (bfd_error_no_memory); |
| 319 | return false; |
| 320 | } |
| 321 | |
| 322 | new_cache->ptr = filepos; |
| 323 | new_cache->arelt = new_elt; |
| 324 | new_cache->next = (struct ar_cache *) NULL; |
| 325 | if (bfd_ardata (arch_bfd)->cache == NULL) |
| 326 | bfd_ardata (arch_bfd)->cache = new_cache; |
| 327 | else |
| 328 | { |
| 329 | struct ar_cache *current = bfd_ardata (arch_bfd)->cache; |
| 330 | |
| 331 | while (current->next != NULL) |
| 332 | current = current->next; |
| 333 | current->next = new_cache; |
| 334 | } |
| 335 | |
| 336 | return true; |
| 337 | } |
| 338 | \f |
| 339 | /* The name begins with space. Hence the rest of the name is an index into |
| 340 | the string table. */ |
| 341 | |
| 342 | static char * |
| 343 | get_extended_arelt_filename (arch, name) |
| 344 | bfd *arch; |
| 345 | const char *name; |
| 346 | { |
| 347 | unsigned long index = 0; |
| 348 | |
| 349 | /* Should extract string so that I can guarantee not to overflow into |
| 350 | the next region, but I'm too lazy. */ |
| 351 | errno = 0; |
| 352 | /* Skip first char, which is '/' in SVR4 or ' ' in some other variants. */ |
| 353 | index = strtol (name + 1, NULL, 10); |
| 354 | if (errno != 0) |
| 355 | { |
| 356 | bfd_set_error (bfd_error_malformed_archive); |
| 357 | return NULL; |
| 358 | } |
| 359 | |
| 360 | return bfd_ardata (arch)->extended_names + index; |
| 361 | } |
| 362 | |
| 363 | /* This functions reads an arch header and returns an areltdata pointer, or |
| 364 | NULL on error. |
| 365 | |
| 366 | Presumes the file pointer is already in the right place (ie pointing |
| 367 | to the ar_hdr in the file). Moves the file pointer; on success it |
| 368 | should be pointing to the front of the file contents; on failure it |
| 369 | could have been moved arbitrarily. |
| 370 | */ |
| 371 | |
| 372 | struct areltdata * |
| 373 | _bfd_snarf_ar_hdr (abfd) |
| 374 | bfd *abfd; |
| 375 | { |
| 376 | #ifndef errno |
| 377 | extern int errno; |
| 378 | #endif |
| 379 | |
| 380 | struct ar_hdr hdr; |
| 381 | char *hdrp = (char *) &hdr; |
| 382 | unsigned int parsed_size; |
| 383 | struct areltdata *ared; |
| 384 | char *filename = NULL; |
| 385 | unsigned int namelen = 0; |
| 386 | unsigned int allocsize = sizeof (struct areltdata) + sizeof (struct ar_hdr); |
| 387 | char *allocptr = 0; |
| 388 | |
| 389 | if (bfd_read ((PTR) hdrp, 1, sizeof (struct ar_hdr), abfd) |
| 390 | != sizeof (struct ar_hdr)) |
| 391 | { |
| 392 | if (bfd_get_error () != bfd_error_system_call) |
| 393 | bfd_set_error (bfd_error_no_more_archived_files); |
| 394 | return NULL; |
| 395 | } |
| 396 | if (strncmp (hdr.ar_fmag, ARFMAG, 2)) |
| 397 | { |
| 398 | bfd_set_error (bfd_error_malformed_archive); |
| 399 | return NULL; |
| 400 | } |
| 401 | |
| 402 | errno = 0; |
| 403 | parsed_size = strtol (hdr.ar_size, NULL, 10); |
| 404 | if (errno != 0) |
| 405 | { |
| 406 | bfd_set_error (bfd_error_malformed_archive); |
| 407 | return NULL; |
| 408 | } |
| 409 | |
| 410 | /* Extract the filename from the archive - there are two ways to |
| 411 | specify an extendend name table, either the first char of the |
| 412 | name is a space, or it's a slash. */ |
| 413 | if ((hdr.ar_name[0] == '/' |
| 414 | || (hdr.ar_name[0] == ' ' |
| 415 | && memchr (hdr.ar_name, '/', ar_maxnamelen (abfd)) == NULL)) |
| 416 | && bfd_ardata (abfd)->extended_names != NULL) |
| 417 | { |
| 418 | filename = get_extended_arelt_filename (abfd, hdr.ar_name); |
| 419 | if (filename == NULL) |
| 420 | { |
| 421 | bfd_set_error (bfd_error_malformed_archive); |
| 422 | return NULL; |
| 423 | } |
| 424 | } |
| 425 | /* BSD4.4-style long filename. |
| 426 | Only implemented for reading, so far! */ |
| 427 | else if (hdr.ar_name[0] == '#' && hdr.ar_name[1] == '1' |
| 428 | && hdr.ar_name[2] == '/' && isdigit (hdr.ar_name[3])) |
| 429 | { |
| 430 | /* BSD-4.4 extended name */ |
| 431 | namelen = atoi (&hdr.ar_name[3]); |
| 432 | allocsize += namelen + 1; |
| 433 | parsed_size -= namelen; |
| 434 | |
| 435 | allocptr = bfd_zalloc (abfd, allocsize); |
| 436 | if (allocptr == NULL) |
| 437 | { |
| 438 | bfd_set_error (bfd_error_no_memory); |
| 439 | return NULL; |
| 440 | } |
| 441 | filename = (allocptr |
| 442 | + sizeof (struct areltdata) |
| 443 | + sizeof (struct ar_hdr)); |
| 444 | if (bfd_read (filename, 1, namelen, abfd) != namelen) |
| 445 | { |
| 446 | if (bfd_get_error () != bfd_error_system_call) |
| 447 | bfd_set_error (bfd_error_no_more_archived_files); |
| 448 | return NULL; |
| 449 | } |
| 450 | filename[namelen] = '\0'; |
| 451 | } |
| 452 | else |
| 453 | { |
| 454 | /* We judge the end of the name by looking for '/' or ' '. |
| 455 | Note: The SYSV format (terminated by '/') allows embedded |
| 456 | spaces, so only look for ' ' if we don't find '/'. */ |
| 457 | |
| 458 | namelen = 0; |
| 459 | while (hdr.ar_name[namelen] != '\0' && |
| 460 | hdr.ar_name[namelen] != '/') |
| 461 | { |
| 462 | namelen++; |
| 463 | if (namelen == (unsigned) ar_maxnamelen (abfd)) |
| 464 | { |
| 465 | namelen = 0; |
| 466 | while (hdr.ar_name[namelen] != ' ' |
| 467 | && namelen < (unsigned) ar_maxnamelen (abfd)) |
| 468 | namelen++; |
| 469 | break; |
| 470 | } |
| 471 | } |
| 472 | |
| 473 | allocsize += namelen + 1; |
| 474 | } |
| 475 | |
| 476 | if (!allocptr) |
| 477 | { |
| 478 | allocptr = bfd_zalloc (abfd, allocsize); |
| 479 | if (allocptr == NULL) |
| 480 | { |
| 481 | bfd_set_error (bfd_error_no_memory); |
| 482 | return NULL; |
| 483 | } |
| 484 | } |
| 485 | |
| 486 | ared = (struct areltdata *) allocptr; |
| 487 | |
| 488 | ared->arch_header = allocptr + sizeof (struct areltdata); |
| 489 | memcpy ((char *) ared->arch_header, (char *) &hdr, sizeof (struct ar_hdr)); |
| 490 | ared->parsed_size = parsed_size; |
| 491 | |
| 492 | if (filename != NULL) |
| 493 | ared->filename = filename; |
| 494 | else |
| 495 | { |
| 496 | ared->filename = allocptr + (sizeof (struct areltdata) + |
| 497 | sizeof (struct ar_hdr)); |
| 498 | if (namelen) |
| 499 | memcpy (ared->filename, hdr.ar_name, namelen); |
| 500 | ared->filename[namelen] = '\0'; |
| 501 | } |
| 502 | |
| 503 | return ared; |
| 504 | } |
| 505 | \f |
| 506 | /* This is an internal function; it's mainly used when indexing |
| 507 | through the archive symbol table, but also used to get the next |
| 508 | element, since it handles the bookkeeping so nicely for us. */ |
| 509 | |
| 510 | bfd * |
| 511 | _bfd_get_elt_at_filepos (archive, filepos) |
| 512 | bfd *archive; |
| 513 | file_ptr filepos; |
| 514 | { |
| 515 | struct areltdata *new_areldata; |
| 516 | bfd *n_nfd; |
| 517 | |
| 518 | n_nfd = _bfd_look_for_bfd_in_cache (archive, filepos); |
| 519 | if (n_nfd) |
| 520 | return n_nfd; |
| 521 | |
| 522 | if (0 > bfd_seek (archive, filepos, SEEK_SET)) |
| 523 | return NULL; |
| 524 | |
| 525 | if ((new_areldata = _bfd_snarf_ar_hdr (archive)) == NULL) |
| 526 | return NULL; |
| 527 | |
| 528 | n_nfd = _bfd_create_empty_archive_element_shell (archive); |
| 529 | if (n_nfd == NULL) |
| 530 | { |
| 531 | bfd_release (archive, (PTR) new_areldata); |
| 532 | return NULL; |
| 533 | } |
| 534 | |
| 535 | n_nfd->origin = bfd_tell (archive); |
| 536 | n_nfd->arelt_data = (PTR) new_areldata; |
| 537 | n_nfd->filename = new_areldata->filename; |
| 538 | |
| 539 | if (_bfd_add_bfd_to_archive_cache (archive, filepos, n_nfd)) |
| 540 | return n_nfd; |
| 541 | |
| 542 | /* huh? */ |
| 543 | bfd_release (archive, (PTR) n_nfd); |
| 544 | bfd_release (archive, (PTR) new_areldata); |
| 545 | return NULL; |
| 546 | } |
| 547 | |
| 548 | /* |
| 549 | FUNCTION |
| 550 | bfd_get_elt_at_index |
| 551 | |
| 552 | SYNOPSIS |
| 553 | bfd *bfd_get_elt_at_index(bfd *archive, int index); |
| 554 | |
| 555 | DESCRIPTION |
| 556 | Return the BFD which is referenced by the symbol in @var{archive} |
| 557 | indexed by @var{index}. @var{index} should have been returned by |
| 558 | <<bfd_get_next_mapent>> (q.v.). |
| 559 | |
| 560 | */ |
| 561 | bfd * |
| 562 | bfd_get_elt_at_index (abfd, index) |
| 563 | bfd *abfd; |
| 564 | int index; |
| 565 | { |
| 566 | carsym *entry; |
| 567 | |
| 568 | entry = bfd_ardata (abfd)->symdefs + index; |
| 569 | return _bfd_get_elt_at_filepos (abfd, entry->file_offset); |
| 570 | } |
| 571 | |
| 572 | /* |
| 573 | FUNCTION |
| 574 | bfd_openr_next_archived_file |
| 575 | |
| 576 | SYNOPSIS |
| 577 | bfd *bfd_openr_next_archived_file(bfd *archive, bfd *previous); |
| 578 | |
| 579 | DESCRIPTION |
| 580 | Provided a BFD, @var{archive}, containing an archive and NULL, open |
| 581 | an input BFD on the first contained element and returns that. |
| 582 | Subsequent calls should pass |
| 583 | the archive and the previous return value to return a created |
| 584 | BFD to the next contained element. NULL is returned when there |
| 585 | are no more. |
| 586 | |
| 587 | */ |
| 588 | |
| 589 | bfd * |
| 590 | bfd_openr_next_archived_file (archive, last_file) |
| 591 | bfd *archive; |
| 592 | bfd *last_file; |
| 593 | { |
| 594 | if ((bfd_get_format (archive) != bfd_archive) || |
| 595 | (archive->direction == write_direction)) |
| 596 | { |
| 597 | bfd_set_error (bfd_error_invalid_operation); |
| 598 | return NULL; |
| 599 | } |
| 600 | |
| 601 | return BFD_SEND (archive, |
| 602 | openr_next_archived_file, |
| 603 | (archive, |
| 604 | last_file)); |
| 605 | } |
| 606 | |
| 607 | bfd * |
| 608 | bfd_generic_openr_next_archived_file (archive, last_file) |
| 609 | bfd *archive; |
| 610 | bfd *last_file; |
| 611 | { |
| 612 | file_ptr filestart; |
| 613 | |
| 614 | if (!last_file) |
| 615 | filestart = bfd_ardata (archive)->first_file_filepos; |
| 616 | else |
| 617 | { |
| 618 | unsigned int size = arelt_size (last_file); |
| 619 | /* Pad to an even boundary... |
| 620 | Note that last_file->origin can be odd in the case of |
| 621 | BSD-4.4-style element with a long odd size. */ |
| 622 | filestart = last_file->origin + size; |
| 623 | filestart += filestart % 2; |
| 624 | } |
| 625 | |
| 626 | return _bfd_get_elt_at_filepos (archive, filestart); |
| 627 | } |
| 628 | |
| 629 | |
| 630 | bfd_target * |
| 631 | bfd_generic_archive_p (abfd) |
| 632 | bfd *abfd; |
| 633 | { |
| 634 | char armag[SARMAG + 1]; |
| 635 | |
| 636 | if (bfd_read ((PTR) armag, 1, SARMAG, abfd) != SARMAG) |
| 637 | { |
| 638 | if (bfd_get_error () != bfd_error_system_call) |
| 639 | bfd_set_error (bfd_error_wrong_format); |
| 640 | return NULL; |
| 641 | } |
| 642 | |
| 643 | #ifdef GNU960 |
| 644 | if (strncmp (armag, BFD_GNU960_ARMAG (abfd), SARMAG) != 0) |
| 645 | return 0; |
| 646 | #else |
| 647 | if (strncmp (armag, ARMAG, SARMAG) != 0 && |
| 648 | strncmp (armag, ARMAGB, SARMAG) != 0) |
| 649 | return 0; |
| 650 | #endif |
| 651 | |
| 652 | /* We are setting bfd_ardata(abfd) here, but since bfd_ardata |
| 653 | involves a cast, we can't do it as the left operand of assignment. */ |
| 654 | abfd->tdata.aout_ar_data = ((struct artdata *) |
| 655 | bfd_zalloc (abfd, sizeof (struct artdata))); |
| 656 | |
| 657 | if (bfd_ardata (abfd) == NULL) |
| 658 | { |
| 659 | bfd_set_error (bfd_error_no_memory); |
| 660 | return NULL; |
| 661 | } |
| 662 | |
| 663 | bfd_ardata (abfd)->first_file_filepos = SARMAG; |
| 664 | bfd_ardata (abfd)->cache = NULL; |
| 665 | bfd_ardata (abfd)->archive_head = NULL; |
| 666 | bfd_ardata (abfd)->symdefs = NULL; |
| 667 | bfd_ardata (abfd)->extended_names = NULL; |
| 668 | bfd_ardata (abfd)->tdata = NULL; |
| 669 | |
| 670 | if (!BFD_SEND (abfd, _bfd_slurp_armap, (abfd))) |
| 671 | { |
| 672 | bfd_release (abfd, bfd_ardata (abfd)); |
| 673 | abfd->tdata.aout_ar_data = NULL; |
| 674 | return NULL; |
| 675 | } |
| 676 | |
| 677 | if (!BFD_SEND (abfd, _bfd_slurp_extended_name_table, (abfd))) |
| 678 | { |
| 679 | bfd_release (abfd, bfd_ardata (abfd)); |
| 680 | abfd->tdata.aout_ar_data = NULL; |
| 681 | return NULL; |
| 682 | } |
| 683 | |
| 684 | return abfd->xvec; |
| 685 | } |
| 686 | |
| 687 | /* Some constants for a 32 bit BSD archive structure. We do not |
| 688 | support 64 bit archives presently; so far as I know, none actually |
| 689 | exist. Supporting them would require changing these constants, and |
| 690 | changing some bfd_h_get_32 to bfd_h_get_64. */ |
| 691 | |
| 692 | /* The size of an external symdef structure. */ |
| 693 | #define BSD_SYMDEF_SIZE 8 |
| 694 | |
| 695 | /* The offset from the start of a symdef structure to the file offset. */ |
| 696 | #define BSD_SYMDEF_OFFSET_SIZE 4 |
| 697 | |
| 698 | /* The size of the symdef count. */ |
| 699 | #define BSD_SYMDEF_COUNT_SIZE 4 |
| 700 | |
| 701 | /* The size of the string count. */ |
| 702 | #define BSD_STRING_COUNT_SIZE 4 |
| 703 | |
| 704 | /* Returns false on error, true otherwise */ |
| 705 | |
| 706 | static boolean |
| 707 | do_slurp_bsd_armap (abfd) |
| 708 | bfd *abfd; |
| 709 | { |
| 710 | struct areltdata *mapdata; |
| 711 | unsigned int counter; |
| 712 | bfd_byte *raw_armap, *rbase; |
| 713 | struct artdata *ardata = bfd_ardata (abfd); |
| 714 | char *stringbase; |
| 715 | unsigned int parsed_size; |
| 716 | carsym *set; |
| 717 | |
| 718 | mapdata = _bfd_snarf_ar_hdr (abfd); |
| 719 | if (mapdata == NULL) |
| 720 | return false; |
| 721 | parsed_size = mapdata->parsed_size; |
| 722 | bfd_release (abfd, (PTR) mapdata); /* Don't need it any more. */ |
| 723 | |
| 724 | raw_armap = (bfd_byte *) bfd_zalloc (abfd, parsed_size); |
| 725 | if (raw_armap == (bfd_byte *) NULL) |
| 726 | { |
| 727 | bfd_set_error (bfd_error_no_memory); |
| 728 | return false; |
| 729 | } |
| 730 | |
| 731 | if (bfd_read ((PTR) raw_armap, 1, parsed_size, abfd) != parsed_size) |
| 732 | { |
| 733 | if (bfd_get_error () != bfd_error_system_call) |
| 734 | bfd_set_error (bfd_error_malformed_archive); |
| 735 | byebye: |
| 736 | bfd_release (abfd, (PTR) raw_armap); |
| 737 | return false; |
| 738 | } |
| 739 | |
| 740 | ardata->symdef_count = bfd_h_get_32 (abfd, raw_armap) / BSD_SYMDEF_SIZE; |
| 741 | |
| 742 | if (ardata->symdef_count * BSD_SYMDEF_SIZE > |
| 743 | parsed_size - BSD_SYMDEF_COUNT_SIZE) |
| 744 | { |
| 745 | /* Probably we're using the wrong byte ordering. */ |
| 746 | bfd_set_error (bfd_error_wrong_format); |
| 747 | goto byebye; |
| 748 | } |
| 749 | |
| 750 | ardata->cache = 0; |
| 751 | rbase = raw_armap + BSD_SYMDEF_COUNT_SIZE; |
| 752 | stringbase = ((char *) rbase |
| 753 | + ardata->symdef_count * BSD_SYMDEF_SIZE |
| 754 | + BSD_STRING_COUNT_SIZE); |
| 755 | ardata->symdefs = (carsym *) bfd_alloc (abfd, |
| 756 | (ardata->symdef_count |
| 757 | * sizeof (carsym))); |
| 758 | if (!ardata->symdefs) |
| 759 | { |
| 760 | bfd_set_error (bfd_error_no_memory); |
| 761 | return false; |
| 762 | } |
| 763 | |
| 764 | for (counter = 0, set = ardata->symdefs; |
| 765 | counter < ardata->symdef_count; |
| 766 | counter++, set++, rbase += BSD_SYMDEF_SIZE) |
| 767 | { |
| 768 | set->name = bfd_h_get_32 (abfd, rbase) + stringbase; |
| 769 | set->file_offset = bfd_h_get_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE); |
| 770 | } |
| 771 | |
| 772 | ardata->first_file_filepos = bfd_tell (abfd); |
| 773 | /* Pad to an even boundary if you have to */ |
| 774 | ardata->first_file_filepos += (ardata->first_file_filepos) % 2; |
| 775 | /* FIXME, we should provide some way to free raw_ardata when |
| 776 | we are done using the strings from it. For now, it seems |
| 777 | to be allocated on an obstack anyway... */ |
| 778 | bfd_has_map (abfd) = true; |
| 779 | return true; |
| 780 | } |
| 781 | |
| 782 | /* Returns false on error, true otherwise */ |
| 783 | static boolean |
| 784 | do_slurp_coff_armap (abfd) |
| 785 | bfd *abfd; |
| 786 | { |
| 787 | struct areltdata *mapdata; |
| 788 | int *raw_armap, *rawptr; |
| 789 | struct artdata *ardata = bfd_ardata (abfd); |
| 790 | char *stringbase; |
| 791 | unsigned int stringsize; |
| 792 | unsigned int parsed_size; |
| 793 | carsym *carsyms; |
| 794 | unsigned int nsymz; /* Number of symbols in armap. */ |
| 795 | bfd_vma (*swap) PARAMS ((const bfd_byte *)); |
| 796 | char int_buf[sizeof (long)]; |
| 797 | unsigned int carsym_size, ptrsize, i; |
| 798 | |
| 799 | mapdata = _bfd_snarf_ar_hdr (abfd); |
| 800 | if (mapdata == NULL) |
| 801 | return false; |
| 802 | parsed_size = mapdata->parsed_size; |
| 803 | bfd_release (abfd, (PTR) mapdata); /* Don't need it any more. */ |
| 804 | |
| 805 | if (bfd_read ((PTR) int_buf, 1, 4, abfd) != 4) |
| 806 | { |
| 807 | if (bfd_get_error () != bfd_error_system_call) |
| 808 | bfd_set_error (bfd_error_malformed_archive); |
| 809 | return false; |
| 810 | } |
| 811 | /* It seems that all numeric information in a coff archive is always |
| 812 | in big endian format, nomatter the host or target. */ |
| 813 | swap = bfd_getb32; |
| 814 | nsymz = bfd_getb32 ((PTR) int_buf); |
| 815 | stringsize = parsed_size - (4 * nsymz) - 4; |
| 816 | |
| 817 | #if 1 |
| 818 | /* ... except that some archive formats are broken, and it may be our |
| 819 | fault - the i960 little endian coff sometimes has big and sometimes |
| 820 | little, because our tools changed. Here's a horrible hack to clean |
| 821 | up the crap. */ |
| 822 | |
| 823 | if (stringsize > 0xfffff) |
| 824 | { |
| 825 | /* This looks dangerous, let's do it the other way around */ |
| 826 | nsymz = bfd_getl32 ((PTR) int_buf); |
| 827 | stringsize = parsed_size - (4 * nsymz) - 4; |
| 828 | swap = bfd_getl32; |
| 829 | } |
| 830 | #endif |
| 831 | |
| 832 | /* The coff armap must be read sequentially. So we construct a |
| 833 | bsd-style one in core all at once, for simplicity. */ |
| 834 | |
| 835 | carsym_size = (nsymz * sizeof (carsym)); |
| 836 | ptrsize = (4 * nsymz); |
| 837 | |
| 838 | ardata->symdefs = (carsym *) bfd_zalloc (abfd, carsym_size + stringsize + 1); |
| 839 | if (ardata->symdefs == NULL) |
| 840 | { |
| 841 | bfd_set_error (bfd_error_no_memory); |
| 842 | return false; |
| 843 | } |
| 844 | carsyms = ardata->symdefs; |
| 845 | stringbase = ((char *) ardata->symdefs) + carsym_size; |
| 846 | |
| 847 | /* Allocate and read in the raw offsets. */ |
| 848 | raw_armap = (int *) bfd_alloc (abfd, ptrsize); |
| 849 | if (raw_armap == NULL) |
| 850 | { |
| 851 | bfd_set_error (bfd_error_no_memory); |
| 852 | goto release_symdefs; |
| 853 | } |
| 854 | if (bfd_read ((PTR) raw_armap, 1, ptrsize, abfd) != ptrsize |
| 855 | || bfd_read ((PTR) stringbase, 1, stringsize, abfd) != stringsize) |
| 856 | { |
| 857 | if (bfd_get_error () != bfd_error_system_call) |
| 858 | bfd_set_error (bfd_error_malformed_archive); |
| 859 | goto release_raw_armap; |
| 860 | } |
| 861 | |
| 862 | /* OK, build the carsyms */ |
| 863 | for (i = 0; i < nsymz; i++) |
| 864 | { |
| 865 | rawptr = raw_armap + i; |
| 866 | carsyms->file_offset = swap ((PTR) rawptr); |
| 867 | carsyms->name = stringbase; |
| 868 | stringbase += strlen (stringbase) + 1; |
| 869 | carsyms++; |
| 870 | } |
| 871 | *stringbase = 0; |
| 872 | |
| 873 | ardata->symdef_count = nsymz; |
| 874 | ardata->first_file_filepos = bfd_tell (abfd); |
| 875 | /* Pad to an even boundary if you have to */ |
| 876 | ardata->first_file_filepos += (ardata->first_file_filepos) % 2; |
| 877 | |
| 878 | bfd_has_map (abfd) = true; |
| 879 | bfd_release (abfd, (PTR) raw_armap); |
| 880 | return true; |
| 881 | |
| 882 | release_raw_armap: |
| 883 | bfd_release (abfd, (PTR) raw_armap); |
| 884 | release_symdefs: |
| 885 | bfd_release (abfd, (PTR) (ardata)->symdefs); |
| 886 | return false; |
| 887 | } |
| 888 | |
| 889 | /* This routine can handle either coff-style or bsd-style armaps. |
| 890 | Returns false on error, true otherwise */ |
| 891 | |
| 892 | boolean |
| 893 | bfd_slurp_armap (abfd) |
| 894 | bfd *abfd; |
| 895 | { |
| 896 | char nextname[17]; |
| 897 | int i = bfd_read ((PTR) nextname, 1, 16, abfd); |
| 898 | |
| 899 | if (i == 0) |
| 900 | return true; |
| 901 | if (i != 16) |
| 902 | return false; |
| 903 | |
| 904 | if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) != 0) |
| 905 | return false; |
| 906 | |
| 907 | if (!strncmp (nextname, "__.SYMDEF ", 16) |
| 908 | || !strncmp (nextname, "__.SYMDEF/ ", 16)) /* old Linux archives */ |
| 909 | return do_slurp_bsd_armap (abfd); |
| 910 | else if (!strncmp (nextname, "/ ", 16)) |
| 911 | return do_slurp_coff_armap (abfd); |
| 912 | |
| 913 | bfd_has_map (abfd) = false; |
| 914 | return true; |
| 915 | } |
| 916 | \f |
| 917 | /* Returns false on error, true otherwise */ |
| 918 | /* flavor 2 of a bsd armap, similar to bfd_slurp_bsd_armap except the |
| 919 | header is in a slightly different order and the map name is '/'. |
| 920 | This flavour is used by hp300hpux. */ |
| 921 | |
| 922 | #define HPUX_SYMDEF_COUNT_SIZE 2 |
| 923 | |
| 924 | boolean |
| 925 | bfd_slurp_bsd_armap_f2 (abfd) |
| 926 | bfd *abfd; |
| 927 | { |
| 928 | struct areltdata *mapdata; |
| 929 | char nextname[17]; |
| 930 | unsigned int counter; |
| 931 | bfd_byte *raw_armap, *rbase; |
| 932 | struct artdata *ardata = bfd_ardata (abfd); |
| 933 | char *stringbase; |
| 934 | unsigned int stringsize; |
| 935 | carsym *set; |
| 936 | int i = bfd_read ((PTR) nextname, 1, 16, abfd); |
| 937 | |
| 938 | if (i == 0) |
| 939 | return true; |
| 940 | if (i != 16) |
| 941 | return false; |
| 942 | |
| 943 | /* The archive has at least 16 bytes in it */ |
| 944 | if (bfd_seek (abfd, -16L, SEEK_CUR) != 0) |
| 945 | return false; |
| 946 | |
| 947 | if (!strncmp (nextname, "__.SYMDEF ", 16) |
| 948 | || !strncmp (nextname, "__.SYMDEF/ ", 16)) /* old Linux archives */ |
| 949 | return do_slurp_bsd_armap (abfd); |
| 950 | |
| 951 | if (strncmp (nextname, "/ ", 16)) |
| 952 | { |
| 953 | bfd_has_map (abfd) = false; |
| 954 | return true; |
| 955 | } |
| 956 | |
| 957 | mapdata = _bfd_snarf_ar_hdr (abfd); |
| 958 | if (mapdata == NULL) |
| 959 | return false; |
| 960 | |
| 961 | raw_armap = (bfd_byte *) bfd_zalloc (abfd, mapdata->parsed_size); |
| 962 | if (raw_armap == NULL) |
| 963 | { |
| 964 | bfd_set_error (bfd_error_no_memory); |
| 965 | byebye: |
| 966 | bfd_release (abfd, (PTR) mapdata); |
| 967 | return false; |
| 968 | } |
| 969 | |
| 970 | if (bfd_read ((PTR) raw_armap, 1, mapdata->parsed_size, abfd) != |
| 971 | mapdata->parsed_size) |
| 972 | { |
| 973 | if (bfd_get_error () != bfd_error_system_call) |
| 974 | bfd_set_error (bfd_error_malformed_archive); |
| 975 | byebyebye: |
| 976 | bfd_release (abfd, (PTR) raw_armap); |
| 977 | goto byebye; |
| 978 | } |
| 979 | |
| 980 | ardata->symdef_count = bfd_h_get_16 (abfd, (PTR) raw_armap); |
| 981 | |
| 982 | if (ardata->symdef_count * BSD_SYMDEF_SIZE |
| 983 | > mapdata->parsed_size - HPUX_SYMDEF_COUNT_SIZE) |
| 984 | { |
| 985 | /* Probably we're using the wrong byte ordering. */ |
| 986 | bfd_set_error (bfd_error_wrong_format); |
| 987 | goto byebyebye; |
| 988 | } |
| 989 | |
| 990 | ardata->cache = 0; |
| 991 | |
| 992 | stringsize = bfd_h_get_32 (abfd, raw_armap + HPUX_SYMDEF_COUNT_SIZE); |
| 993 | /* skip sym count and string sz */ |
| 994 | stringbase = ((char *) raw_armap |
| 995 | + HPUX_SYMDEF_COUNT_SIZE |
| 996 | + BSD_STRING_COUNT_SIZE); |
| 997 | rbase = (bfd_byte *) stringbase + stringsize; |
| 998 | ardata->symdefs = (carsym *) bfd_alloc (abfd, |
| 999 | (ardata->symdef_count |
| 1000 | * BSD_SYMDEF_SIZE)); |
| 1001 | if (!ardata->symdefs) |
| 1002 | { |
| 1003 | bfd_set_error (bfd_error_no_memory); |
| 1004 | return false; |
| 1005 | } |
| 1006 | |
| 1007 | for (counter = 0, set = ardata->symdefs; |
| 1008 | counter < ardata->symdef_count; |
| 1009 | counter++, set++, rbase += BSD_SYMDEF_SIZE) |
| 1010 | { |
| 1011 | set->name = bfd_h_get_32 (abfd, rbase) + stringbase; |
| 1012 | set->file_offset = bfd_h_get_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE); |
| 1013 | } |
| 1014 | |
| 1015 | ardata->first_file_filepos = bfd_tell (abfd); |
| 1016 | /* Pad to an even boundary if you have to */ |
| 1017 | ardata->first_file_filepos += (ardata->first_file_filepos) % 2; |
| 1018 | /* FIXME, we should provide some way to free raw_ardata when |
| 1019 | we are done using the strings from it. For now, it seems |
| 1020 | to be allocated on an obstack anyway... */ |
| 1021 | bfd_has_map (abfd) = true; |
| 1022 | return true; |
| 1023 | } |
| 1024 | \f |
| 1025 | /** Extended name table. |
| 1026 | |
| 1027 | Normally archives support only 14-character filenames. |
| 1028 | |
| 1029 | Intel has extended the format: longer names are stored in a special |
| 1030 | element (the first in the archive, or second if there is an armap); |
| 1031 | the name in the ar_hdr is replaced by <space><index into filename |
| 1032 | element>. Index is the P.R. of an int (decimal). Data General have |
| 1033 | extended the format by using the prefix // for the special element */ |
| 1034 | |
| 1035 | /* Returns false on error, true otherwise */ |
| 1036 | boolean |
| 1037 | _bfd_slurp_extended_name_table (abfd) |
| 1038 | bfd *abfd; |
| 1039 | { |
| 1040 | char nextname[17]; |
| 1041 | struct areltdata *namedata; |
| 1042 | |
| 1043 | /* FIXME: Formatting sucks here, and in case of failure of BFD_READ, |
| 1044 | we probably don't want to return true. */ |
| 1045 | if (bfd_read ((PTR) nextname, 1, 16, abfd) == 16) |
| 1046 | { |
| 1047 | |
| 1048 | if (bfd_seek (abfd, (file_ptr) - 16, SEEK_CUR) != 0) |
| 1049 | return false; |
| 1050 | |
| 1051 | if (strncmp (nextname, "ARFILENAMES/ ", 16) != 0 && |
| 1052 | strncmp (nextname, "// ", 16) != 0) |
| 1053 | { |
| 1054 | bfd_ardata (abfd)->extended_names = NULL; |
| 1055 | return true; |
| 1056 | } |
| 1057 | |
| 1058 | namedata = _bfd_snarf_ar_hdr (abfd); |
| 1059 | if (namedata == NULL) |
| 1060 | return false; |
| 1061 | |
| 1062 | bfd_ardata (abfd)->extended_names = |
| 1063 | bfd_zalloc (abfd, namedata->parsed_size); |
| 1064 | if (bfd_ardata (abfd)->extended_names == NULL) |
| 1065 | { |
| 1066 | bfd_set_error (bfd_error_no_memory); |
| 1067 | byebye: |
| 1068 | bfd_release (abfd, (PTR) namedata); |
| 1069 | return false; |
| 1070 | } |
| 1071 | |
| 1072 | if (bfd_read ((PTR) bfd_ardata (abfd)->extended_names, 1, |
| 1073 | namedata->parsed_size, abfd) != namedata->parsed_size) |
| 1074 | { |
| 1075 | if (bfd_get_error () != bfd_error_system_call) |
| 1076 | bfd_set_error (bfd_error_malformed_archive); |
| 1077 | bfd_release (abfd, (PTR) (bfd_ardata (abfd)->extended_names)); |
| 1078 | bfd_ardata (abfd)->extended_names = NULL; |
| 1079 | goto byebye; |
| 1080 | } |
| 1081 | |
| 1082 | /* Since the archive is supposed to be printable if it contains |
| 1083 | text, the entries in the list are newline-padded, not null |
| 1084 | padded. In SVR4-style archives, the names also have a |
| 1085 | trailing '/'. We'll fix both problems here.. */ |
| 1086 | { |
| 1087 | char *temp = bfd_ardata (abfd)->extended_names; |
| 1088 | char *limit = temp + namedata->parsed_size; |
| 1089 | for (; temp < limit; ++temp) |
| 1090 | if (*temp == '\012') |
| 1091 | temp[temp[-1] == '/' ? -1 : 0] = '\0'; |
| 1092 | } |
| 1093 | |
| 1094 | /* Pad to an even boundary if you have to */ |
| 1095 | bfd_ardata (abfd)->first_file_filepos = bfd_tell (abfd); |
| 1096 | bfd_ardata (abfd)->first_file_filepos += |
| 1097 | (bfd_ardata (abfd)->first_file_filepos) % 2; |
| 1098 | |
| 1099 | /* FIXME, we can't release namedata here because it was allocated |
| 1100 | below extended_names on the obstack... */ |
| 1101 | /* bfd_release (abfd, namedata); */ |
| 1102 | } |
| 1103 | return true; |
| 1104 | } |
| 1105 | |
| 1106 | #ifdef VMS |
| 1107 | |
| 1108 | /* Return a copy of the stuff in the filename between any :]> and a |
| 1109 | semicolon */ |
| 1110 | static const char * |
| 1111 | normalize (file) |
| 1112 | const char *file; |
| 1113 | { |
| 1114 | CONST char *first; |
| 1115 | CONST char *last; |
| 1116 | char *copy; |
| 1117 | |
| 1118 | first = file + strlen (file) - 1; |
| 1119 | last = first + 1; |
| 1120 | |
| 1121 | while (first != file) |
| 1122 | { |
| 1123 | if (*first == ';') |
| 1124 | last = first; |
| 1125 | if (*first == ':' || *first == ']' || *first == '>') |
| 1126 | { |
| 1127 | first++; |
| 1128 | break; |
| 1129 | } |
| 1130 | first--; |
| 1131 | } |
| 1132 | |
| 1133 | |
| 1134 | copy = malloc (last - first + 1); |
| 1135 | if (!copy) |
| 1136 | return copy; |
| 1137 | |
| 1138 | memcpy (copy, first, last - first); |
| 1139 | copy[last - first] = 0; |
| 1140 | |
| 1141 | return copy; |
| 1142 | } |
| 1143 | |
| 1144 | #else |
| 1145 | static const char * |
| 1146 | normalize (file) |
| 1147 | const char *file; |
| 1148 | { |
| 1149 | CONST char *filename = strrchr (file, '/'); |
| 1150 | |
| 1151 | if (filename != (char *) NULL) |
| 1152 | filename++; |
| 1153 | else |
| 1154 | filename = file; |
| 1155 | return filename; |
| 1156 | } |
| 1157 | #endif |
| 1158 | |
| 1159 | /* Follows archive_head and produces an extended name table if |
| 1160 | necessary. Returns (in tabloc) a pointer to an extended name |
| 1161 | table, and in tablen the length of the table. If it makes an entry |
| 1162 | it clobbers the filename so that the element may be written without |
| 1163 | further massage. Returns true if it ran successfully, false if |
| 1164 | something went wrong. A successful return may still involve a |
| 1165 | zero-length tablen! */ |
| 1166 | |
| 1167 | static boolean |
| 1168 | bfd_construct_extended_name_table (abfd, tabloc, tablen) |
| 1169 | bfd *abfd; |
| 1170 | char **tabloc; |
| 1171 | unsigned int *tablen; |
| 1172 | { |
| 1173 | unsigned int maxname = abfd->xvec->ar_max_namelen; |
| 1174 | unsigned int total_namelen = 0; |
| 1175 | bfd *current; |
| 1176 | char *strptr; |
| 1177 | |
| 1178 | *tablen = 0; |
| 1179 | |
| 1180 | /* Figure out how long the table should be */ |
| 1181 | for (current = abfd->archive_head; current != NULL; current = current->next) |
| 1182 | { |
| 1183 | CONST char *normal = normalize (current->filename); |
| 1184 | unsigned int thislen; |
| 1185 | |
| 1186 | if (!normal) |
| 1187 | { |
| 1188 | bfd_set_error (bfd_error_no_memory); |
| 1189 | return false; |
| 1190 | } |
| 1191 | thislen = strlen (normal); |
| 1192 | if (thislen > maxname) |
| 1193 | total_namelen += thislen + 1; /* leave room for \n */ |
| 1194 | } |
| 1195 | |
| 1196 | if (total_namelen == 0) |
| 1197 | return true; |
| 1198 | |
| 1199 | *tabloc = bfd_zalloc (abfd, total_namelen); |
| 1200 | if (*tabloc == NULL) |
| 1201 | { |
| 1202 | bfd_set_error (bfd_error_no_memory); |
| 1203 | return false; |
| 1204 | } |
| 1205 | |
| 1206 | *tablen = total_namelen; |
| 1207 | strptr = *tabloc; |
| 1208 | |
| 1209 | for (current = abfd->archive_head; current != NULL; current = |
| 1210 | current->next) |
| 1211 | { |
| 1212 | CONST char *normal = normalize (current->filename); |
| 1213 | unsigned int thislen; |
| 1214 | |
| 1215 | if (!normal) |
| 1216 | { |
| 1217 | bfd_set_error (bfd_error_no_memory); |
| 1218 | return false; |
| 1219 | } |
| 1220 | thislen = strlen (normal); |
| 1221 | if (thislen > maxname) |
| 1222 | { |
| 1223 | /* Works for now; may need to be re-engineered if we |
| 1224 | encounter an oddball archive format and want to |
| 1225 | generalise this hack. */ |
| 1226 | struct ar_hdr *hdr = arch_hdr (current); |
| 1227 | strcpy (strptr, normal); |
| 1228 | strptr[thislen] = '\012'; |
| 1229 | hdr->ar_name[0] = ar_padchar (current); |
| 1230 | /* We know there will always be enough room (one of the few |
| 1231 | cases where you may safely use sprintf). */ |
| 1232 | sprintf ((hdr->ar_name) + 1, "%-d", (unsigned) (strptr - *tabloc)); |
| 1233 | /* Kinda Kludgy. We should just use the returned value of |
| 1234 | sprintf but not all implementations get this right */ |
| 1235 | { |
| 1236 | char *temp = hdr->ar_name + 2; |
| 1237 | for (; temp < hdr->ar_name + maxname; temp++) |
| 1238 | if (*temp == '\0') |
| 1239 | *temp = ' '; |
| 1240 | } |
| 1241 | strptr += thislen + 1; |
| 1242 | } |
| 1243 | } |
| 1244 | |
| 1245 | return true; |
| 1246 | } |
| 1247 | \f |
| 1248 | /** A couple of functions for creating ar_hdrs */ |
| 1249 | |
| 1250 | /* Takes a filename, returns an arelt_data for it, or NULL if it can't |
| 1251 | make one. The filename must refer to a filename in the filesystem. |
| 1252 | The filename field of the ar_hdr will NOT be initialized */ |
| 1253 | |
| 1254 | static struct areltdata * |
| 1255 | bfd_ar_hdr_from_filesystem (abfd, filename) |
| 1256 | bfd *abfd; |
| 1257 | const char *filename; |
| 1258 | { |
| 1259 | struct stat status; |
| 1260 | struct areltdata *ared; |
| 1261 | struct ar_hdr *hdr; |
| 1262 | char *temp, *temp1; |
| 1263 | |
| 1264 | if (stat (filename, &status) != 0) |
| 1265 | { |
| 1266 | bfd_set_error (bfd_error_system_call); |
| 1267 | return NULL; |
| 1268 | } |
| 1269 | |
| 1270 | ared = (struct areltdata *) bfd_zalloc (abfd, sizeof (struct ar_hdr) + |
| 1271 | sizeof (struct areltdata)); |
| 1272 | if (ared == NULL) |
| 1273 | { |
| 1274 | bfd_set_error (bfd_error_no_memory); |
| 1275 | return NULL; |
| 1276 | } |
| 1277 | hdr = (struct ar_hdr *) (((char *) ared) + sizeof (struct areltdata)); |
| 1278 | |
| 1279 | /* ar headers are space padded, not null padded! */ |
| 1280 | memset ((PTR) hdr, ' ', sizeof (struct ar_hdr)); |
| 1281 | |
| 1282 | strncpy (hdr->ar_fmag, ARFMAG, 2); |
| 1283 | |
| 1284 | /* Goddamned sprintf doesn't permit MAXIMUM field lengths */ |
| 1285 | sprintf ((hdr->ar_date), "%-12ld", (long) status.st_mtime); |
| 1286 | sprintf ((hdr->ar_uid), "%ld", (long) status.st_uid); |
| 1287 | sprintf ((hdr->ar_gid), "%ld", (long) status.st_gid); |
| 1288 | sprintf ((hdr->ar_mode), "%-8o", (unsigned int) status.st_mode); |
| 1289 | sprintf ((hdr->ar_size), "%-10ld", (long) status.st_size); |
| 1290 | /* Correct for a lossage in sprintf whereby it null-terminates. I cannot |
| 1291 | understand how these C losers could design such a ramshackle bunch of |
| 1292 | IO operations */ |
| 1293 | temp = (char *) hdr; |
| 1294 | temp1 = temp + sizeof (struct ar_hdr) - 2; |
| 1295 | for (; temp < temp1; temp++) |
| 1296 | { |
| 1297 | if (*temp == '\0') |
| 1298 | *temp = ' '; |
| 1299 | } |
| 1300 | strncpy (hdr->ar_fmag, ARFMAG, 2); |
| 1301 | ared->parsed_size = status.st_size; |
| 1302 | ared->arch_header = (char *) hdr; |
| 1303 | |
| 1304 | return ared; |
| 1305 | } |
| 1306 | |
| 1307 | /* This is magic required by the "ar" program. Since it's |
| 1308 | undocumented, it's undocumented. You may think that it would take |
| 1309 | a strong stomach to write this, and it does, but it takes even a |
| 1310 | stronger stomach to try to code around such a thing! */ |
| 1311 | |
| 1312 | struct ar_hdr * |
| 1313 | bfd_special_undocumented_glue (abfd, filename) |
| 1314 | bfd *abfd; |
| 1315 | char *filename; |
| 1316 | { |
| 1317 | struct areltdata *ar_elt = bfd_ar_hdr_from_filesystem (abfd, filename); |
| 1318 | if (ar_elt == NULL) |
| 1319 | return NULL; |
| 1320 | return (struct ar_hdr *) ar_elt->arch_header; |
| 1321 | } |
| 1322 | |
| 1323 | |
| 1324 | /* Analogous to stat call */ |
| 1325 | int |
| 1326 | bfd_generic_stat_arch_elt (abfd, buf) |
| 1327 | bfd *abfd; |
| 1328 | struct stat *buf; |
| 1329 | { |
| 1330 | struct ar_hdr *hdr; |
| 1331 | char *aloser; |
| 1332 | |
| 1333 | if (abfd->arelt_data == NULL) |
| 1334 | { |
| 1335 | bfd_set_error (bfd_error_invalid_operation); |
| 1336 | return -1; |
| 1337 | } |
| 1338 | |
| 1339 | hdr = arch_hdr (abfd); |
| 1340 | |
| 1341 | #define foo(arelt, stelt, size) \ |
| 1342 | buf->stelt = strtol (hdr->arelt, &aloser, size); \ |
| 1343 | if (aloser == hdr->arelt) return -1; |
| 1344 | |
| 1345 | foo (ar_date, st_mtime, 10); |
| 1346 | foo (ar_uid, st_uid, 10); |
| 1347 | foo (ar_gid, st_gid, 10); |
| 1348 | foo (ar_mode, st_mode, 8); |
| 1349 | |
| 1350 | buf->st_size = arch_eltdata (abfd)->parsed_size; |
| 1351 | |
| 1352 | return 0; |
| 1353 | } |
| 1354 | |
| 1355 | void |
| 1356 | bfd_dont_truncate_arname (abfd, pathname, arhdr) |
| 1357 | bfd *abfd; |
| 1358 | CONST char *pathname; |
| 1359 | char *arhdr; |
| 1360 | { |
| 1361 | /* FIXME: This interacts unpleasantly with ar's quick-append option. |
| 1362 | Fortunately ic960 users will never use that option. Fixing this |
| 1363 | is very hard; fortunately I know how to do it and will do so once |
| 1364 | intel's release is out the door. */ |
| 1365 | |
| 1366 | struct ar_hdr *hdr = (struct ar_hdr *) arhdr; |
| 1367 | int length; |
| 1368 | CONST char *filename = normalize (pathname); |
| 1369 | int maxlen = ar_maxnamelen (abfd); |
| 1370 | |
| 1371 | length = strlen (filename); |
| 1372 | |
| 1373 | if (length <= maxlen) |
| 1374 | memcpy (hdr->ar_name, filename, length); |
| 1375 | |
| 1376 | if (length < maxlen) |
| 1377 | (hdr->ar_name)[length] = ar_padchar (abfd); |
| 1378 | } |
| 1379 | |
| 1380 | void |
| 1381 | bfd_bsd_truncate_arname (abfd, pathname, arhdr) |
| 1382 | bfd *abfd; |
| 1383 | CONST char *pathname; |
| 1384 | char *arhdr; |
| 1385 | { |
| 1386 | struct ar_hdr *hdr = (struct ar_hdr *) arhdr; |
| 1387 | int length; |
| 1388 | CONST char *filename = strrchr (pathname, '/'); |
| 1389 | int maxlen = ar_maxnamelen (abfd); |
| 1390 | |
| 1391 | if (filename == NULL) |
| 1392 | filename = pathname; |
| 1393 | else |
| 1394 | ++filename; |
| 1395 | |
| 1396 | length = strlen (filename); |
| 1397 | |
| 1398 | if (length <= maxlen) |
| 1399 | memcpy (hdr->ar_name, filename, length); |
| 1400 | else |
| 1401 | { |
| 1402 | /* pathname: meet procrustes */ |
| 1403 | memcpy (hdr->ar_name, filename, maxlen); |
| 1404 | length = maxlen; |
| 1405 | } |
| 1406 | |
| 1407 | if (length < maxlen) |
| 1408 | (hdr->ar_name)[length] = ar_padchar (abfd); |
| 1409 | } |
| 1410 | |
| 1411 | /* Store name into ar header. Truncates the name to fit. |
| 1412 | 1> strip pathname to be just the basename. |
| 1413 | 2> if it's short enuf to fit, stuff it in. |
| 1414 | 3> If it doesn't end with .o, truncate it to fit |
| 1415 | 4> truncate it before the .o, append .o, stuff THAT in. */ |
| 1416 | |
| 1417 | /* This is what gnu ar does. It's better but incompatible with the |
| 1418 | bsd ar. */ |
| 1419 | |
| 1420 | void |
| 1421 | bfd_gnu_truncate_arname (abfd, pathname, arhdr) |
| 1422 | bfd *abfd; |
| 1423 | CONST char *pathname; |
| 1424 | char *arhdr; |
| 1425 | { |
| 1426 | struct ar_hdr *hdr = (struct ar_hdr *) arhdr; |
| 1427 | int length; |
| 1428 | CONST char *filename = strrchr (pathname, '/'); |
| 1429 | int maxlen = ar_maxnamelen (abfd); |
| 1430 | |
| 1431 | if (filename == NULL) |
| 1432 | filename = pathname; |
| 1433 | else |
| 1434 | ++filename; |
| 1435 | |
| 1436 | length = strlen (filename); |
| 1437 | |
| 1438 | if (length <= maxlen) |
| 1439 | memcpy (hdr->ar_name, filename, length); |
| 1440 | else |
| 1441 | { /* pathname: meet procrustes */ |
| 1442 | memcpy (hdr->ar_name, filename, maxlen); |
| 1443 | if ((filename[length - 2] == '.') && (filename[length - 1] == 'o')) |
| 1444 | { |
| 1445 | hdr->ar_name[maxlen - 2] = '.'; |
| 1446 | hdr->ar_name[maxlen - 1] = 'o'; |
| 1447 | } |
| 1448 | length = maxlen; |
| 1449 | } |
| 1450 | |
| 1451 | if (length < 16) |
| 1452 | (hdr->ar_name)[length] = ar_padchar (abfd); |
| 1453 | } |
| 1454 | \f |
| 1455 | /* The BFD is open for write and has its format set to bfd_archive */ |
| 1456 | |
| 1457 | boolean |
| 1458 | _bfd_write_archive_contents (arch) |
| 1459 | bfd *arch; |
| 1460 | { |
| 1461 | bfd *current; |
| 1462 | char *etable = NULL; |
| 1463 | unsigned int elength = 0; |
| 1464 | boolean makemap = bfd_has_map (arch); |
| 1465 | boolean hasobjects = false; /* if no .o's, don't bother to make a map */ |
| 1466 | bfd_size_type wrote; |
| 1467 | unsigned int i; |
| 1468 | int tries; |
| 1469 | |
| 1470 | /* Verify the viability of all entries; if any of them live in the |
| 1471 | filesystem (as opposed to living in an archive open for input) |
| 1472 | then construct a fresh ar_hdr for them. */ |
| 1473 | for (current = arch->archive_head; current; current = current->next) |
| 1474 | { |
| 1475 | if (bfd_write_p (current)) |
| 1476 | { |
| 1477 | bfd_set_error (bfd_error_invalid_operation); |
| 1478 | return false; |
| 1479 | } |
| 1480 | if (!current->arelt_data) |
| 1481 | { |
| 1482 | current->arelt_data = |
| 1483 | (PTR) bfd_ar_hdr_from_filesystem (arch, current->filename); |
| 1484 | if (!current->arelt_data) |
| 1485 | return false; |
| 1486 | |
| 1487 | /* Put in the file name */ |
| 1488 | BFD_SEND (arch, _bfd_truncate_arname, (arch, |
| 1489 | current->filename, |
| 1490 | (char *) arch_hdr (current))); |
| 1491 | } |
| 1492 | |
| 1493 | if (makemap && ! hasobjects) |
| 1494 | { /* don't bother if we won't make a map! */ |
| 1495 | if ((bfd_check_format (current, bfd_object)) |
| 1496 | #if 0 /* FIXME -- these are not set correctly */ |
| 1497 | && ((bfd_get_file_flags (current) & HAS_SYMS)) |
| 1498 | #endif |
| 1499 | ) |
| 1500 | hasobjects = true; |
| 1501 | } |
| 1502 | } |
| 1503 | |
| 1504 | if (!bfd_construct_extended_name_table (arch, &etable, &elength)) |
| 1505 | return false; |
| 1506 | |
| 1507 | if (bfd_seek (arch, (file_ptr) 0, SEEK_SET) != 0) |
| 1508 | return false; |
| 1509 | #ifdef GNU960 |
| 1510 | wrote = bfd_write (BFD_GNU960_ARMAG (arch), 1, SARMAG, arch); |
| 1511 | #else |
| 1512 | wrote = bfd_write (ARMAG, 1, SARMAG, arch); |
| 1513 | #endif |
| 1514 | if (wrote != SARMAG) |
| 1515 | return false; |
| 1516 | |
| 1517 | if (makemap && hasobjects) |
| 1518 | { |
| 1519 | if (compute_and_write_armap (arch, elength) != true) |
| 1520 | return false; |
| 1521 | } |
| 1522 | |
| 1523 | if (elength != 0) |
| 1524 | { |
| 1525 | struct ar_hdr hdr; |
| 1526 | |
| 1527 | memset ((char *) (&hdr), 0, sizeof (struct ar_hdr)); |
| 1528 | if (ar_padchar (arch) == '/') |
| 1529 | sprintf (&(hdr.ar_name[0]), "//"); |
| 1530 | else |
| 1531 | sprintf (&(hdr.ar_name[0]), "ARFILENAMES/"); |
| 1532 | sprintf (&(hdr.ar_size[0]), "%-10d", (int) elength); |
| 1533 | strncpy (hdr.ar_fmag, ARFMAG, 2); |
| 1534 | for (i = 0; i < sizeof (struct ar_hdr); i++) |
| 1535 | if (((char *) (&hdr))[i] == '\0') |
| 1536 | (((char *) (&hdr))[i]) = ' '; |
| 1537 | if ((bfd_write ((char *) &hdr, 1, sizeof (struct ar_hdr), arch) |
| 1538 | != sizeof (struct ar_hdr)) |
| 1539 | || bfd_write (etable, 1, elength, arch) != elength) |
| 1540 | return false; |
| 1541 | if ((elength % 2) == 1) |
| 1542 | { |
| 1543 | if (bfd_write ("\012", 1, 1, arch) != 1) |
| 1544 | return false; |
| 1545 | } |
| 1546 | } |
| 1547 | |
| 1548 | for (current = arch->archive_head; current; current = current->next) |
| 1549 | { |
| 1550 | char buffer[DEFAULT_BUFFERSIZE]; |
| 1551 | unsigned int remaining = arelt_size (current); |
| 1552 | struct ar_hdr *hdr = arch_hdr (current); |
| 1553 | |
| 1554 | /* write ar header */ |
| 1555 | if (bfd_write ((char *) hdr, 1, sizeof (*hdr), arch) != sizeof (*hdr)) |
| 1556 | return false; |
| 1557 | if (bfd_seek (current, (file_ptr) 0, SEEK_SET) != 0) |
| 1558 | return false; |
| 1559 | while (remaining) |
| 1560 | { |
| 1561 | unsigned int amt = DEFAULT_BUFFERSIZE; |
| 1562 | if (amt > remaining) |
| 1563 | amt = remaining; |
| 1564 | errno = 0; |
| 1565 | if (bfd_read (buffer, amt, 1, current) != amt) |
| 1566 | { |
| 1567 | if (bfd_get_error () != bfd_error_system_call) |
| 1568 | bfd_set_error (bfd_error_malformed_archive); |
| 1569 | return false; |
| 1570 | } |
| 1571 | if (bfd_write (buffer, amt, 1, arch) != amt) |
| 1572 | return false; |
| 1573 | remaining -= amt; |
| 1574 | } |
| 1575 | if ((arelt_size (current) % 2) == 1) |
| 1576 | { |
| 1577 | if (bfd_write ("\012", 1, 1, arch) != 1) |
| 1578 | return false; |
| 1579 | } |
| 1580 | } |
| 1581 | |
| 1582 | /* Verify the timestamp in the archive file. If it would not be |
| 1583 | accepted by the linker, rewrite it until it would be. If |
| 1584 | anything odd happens, break out and just return. (The Berkeley |
| 1585 | linker checks the timestamp and refuses to read the |
| 1586 | table-of-contents if it is >60 seconds less than the file's |
| 1587 | modified-time. That painful hack requires this painful hack. */ |
| 1588 | |
| 1589 | tries = 1; |
| 1590 | do |
| 1591 | { |
| 1592 | /* FIXME! This kludge is to avoid adding a member to the xvec, |
| 1593 | while generating a small patch for Adobe. FIXME! The |
| 1594 | update_armap_timestamp function call should be in the xvec, |
| 1595 | thus: |
| 1596 | |
| 1597 | if (bfd_update_armap_timestamp (arch) == true) break; |
| 1598 | ^ |
| 1599 | |
| 1600 | Instead, we check whether in a BSD archive, and call |
| 1601 | directly. */ |
| 1602 | |
| 1603 | if (arch->xvec->write_armap != bsd_write_armap) |
| 1604 | break; |
| 1605 | if (bsd_update_armap_timestamp (arch) == true) /* FIXME!!! Vector it */ |
| 1606 | break; |
| 1607 | if (tries > 0) |
| 1608 | fprintf (stderr, |
| 1609 | "Warning: writing archive was slow: rewriting timestamp\n"); |
| 1610 | } |
| 1611 | while (++tries < 6); |
| 1612 | |
| 1613 | return true; |
| 1614 | } |
| 1615 | \f |
| 1616 | /* Note that the namidx for the first symbol is 0 */ |
| 1617 | |
| 1618 | static boolean |
| 1619 | compute_and_write_armap (arch, elength) |
| 1620 | bfd *arch; |
| 1621 | unsigned int elength; |
| 1622 | { |
| 1623 | char *first_name = NULL; |
| 1624 | bfd *current; |
| 1625 | file_ptr elt_no = 0; |
| 1626 | struct orl *map = NULL; |
| 1627 | int orl_max = 1024; /* fine initial default */ |
| 1628 | int orl_count = 0; |
| 1629 | int stridx = 0; /* string index */ |
| 1630 | asymbol **syms = NULL; |
| 1631 | long syms_max = 0; |
| 1632 | boolean ret; |
| 1633 | |
| 1634 | /* Dunno if this is the best place for this info... */ |
| 1635 | if (elength != 0) |
| 1636 | elength += sizeof (struct ar_hdr); |
| 1637 | elength += elength % 2; |
| 1638 | |
| 1639 | map = (struct orl *) malloc (orl_max * sizeof (struct orl)); |
| 1640 | if (map == NULL) |
| 1641 | goto no_memory_return; |
| 1642 | |
| 1643 | /* We put the symbol names on the arch obstack, and then discard |
| 1644 | them when done. */ |
| 1645 | first_name = bfd_alloc (arch, 1); |
| 1646 | if (first_name == NULL) |
| 1647 | goto no_memory_return; |
| 1648 | |
| 1649 | /* Drop all the files called __.SYMDEF, we're going to make our |
| 1650 | own */ |
| 1651 | while (arch->archive_head && |
| 1652 | strcmp (arch->archive_head->filename, "__.SYMDEF") == 0) |
| 1653 | arch->archive_head = arch->archive_head->next; |
| 1654 | |
| 1655 | /* Map over each element */ |
| 1656 | for (current = arch->archive_head; |
| 1657 | current != (bfd *) NULL; |
| 1658 | current = current->next, elt_no++) |
| 1659 | { |
| 1660 | if ((bfd_check_format (current, bfd_object) == true) |
| 1661 | && ((bfd_get_file_flags (current) & HAS_SYMS))) |
| 1662 | { |
| 1663 | long storage; |
| 1664 | long symcount; |
| 1665 | long src_count; |
| 1666 | |
| 1667 | storage = bfd_get_symtab_upper_bound (current); |
| 1668 | if (storage < 0) |
| 1669 | goto error_return; |
| 1670 | |
| 1671 | if (storage != 0) |
| 1672 | { |
| 1673 | if (storage > syms_max) |
| 1674 | { |
| 1675 | if (syms_max > 0) |
| 1676 | free (syms); |
| 1677 | syms_max = storage; |
| 1678 | syms = (asymbol **) malloc ((size_t) syms_max); |
| 1679 | if (syms == NULL) |
| 1680 | goto no_memory_return; |
| 1681 | } |
| 1682 | symcount = bfd_canonicalize_symtab (current, syms); |
| 1683 | if (symcount < 0) |
| 1684 | goto error_return; |
| 1685 | |
| 1686 | /* Now map over all the symbols, picking out the ones we want */ |
| 1687 | for (src_count = 0; src_count < symcount; src_count++) |
| 1688 | { |
| 1689 | flagword flags = (syms[src_count])->flags; |
| 1690 | asection *sec = syms[src_count]->section; |
| 1691 | |
| 1692 | if ((flags & BSF_GLOBAL || |
| 1693 | flags & BSF_WEAK || |
| 1694 | flags & BSF_INDIRECT || |
| 1695 | bfd_is_com_section (sec)) |
| 1696 | && (sec != &bfd_und_section)) |
| 1697 | { |
| 1698 | size_t namelen; |
| 1699 | struct orl *new_map; |
| 1700 | |
| 1701 | /* This symbol will go into the archive header */ |
| 1702 | if (orl_count == orl_max) |
| 1703 | { |
| 1704 | orl_max *= 2; |
| 1705 | new_map = ((struct orl *) |
| 1706 | realloc ((PTR) map, |
| 1707 | orl_max * sizeof (struct orl))); |
| 1708 | if (new_map == (struct orl *) NULL) |
| 1709 | goto no_memory_return; |
| 1710 | |
| 1711 | map = new_map; |
| 1712 | } |
| 1713 | |
| 1714 | namelen = strlen (syms[src_count]->name); |
| 1715 | map[orl_count].name = ((char **) |
| 1716 | bfd_alloc (arch, |
| 1717 | sizeof (char *))); |
| 1718 | if (map[orl_count].name == NULL) |
| 1719 | goto no_memory_return; |
| 1720 | *(map[orl_count].name) = bfd_alloc (arch, namelen + 1); |
| 1721 | if (*(map[orl_count].name) == NULL) |
| 1722 | goto no_memory_return; |
| 1723 | strcpy (*(map[orl_count].name), syms[src_count]->name); |
| 1724 | (map[orl_count]).pos = (file_ptr) current; |
| 1725 | (map[orl_count]).namidx = stridx; |
| 1726 | |
| 1727 | stridx += namelen + 1; |
| 1728 | ++orl_count; |
| 1729 | } |
| 1730 | } |
| 1731 | } |
| 1732 | |
| 1733 | /* Now ask the BFD to free up any cached information, so we |
| 1734 | don't fill all of memory with symbol tables. */ |
| 1735 | if (! bfd_free_cached_info (current)) |
| 1736 | goto error_return; |
| 1737 | } |
| 1738 | } |
| 1739 | |
| 1740 | /* OK, now we have collected all the data, let's write them out */ |
| 1741 | ret = BFD_SEND (arch, write_armap, |
| 1742 | (arch, elength, map, orl_count, stridx)); |
| 1743 | |
| 1744 | if (syms_max > 0) |
| 1745 | free (syms); |
| 1746 | if (map != NULL) |
| 1747 | free (map); |
| 1748 | if (first_name != NULL) |
| 1749 | bfd_release (arch, first_name); |
| 1750 | |
| 1751 | return ret; |
| 1752 | |
| 1753 | no_memory_return: |
| 1754 | bfd_set_error (bfd_error_no_memory); |
| 1755 | |
| 1756 | error_return: |
| 1757 | if (syms_max > 0) |
| 1758 | free (syms); |
| 1759 | if (map != NULL) |
| 1760 | free (map); |
| 1761 | if (first_name != NULL) |
| 1762 | bfd_release (arch, first_name); |
| 1763 | |
| 1764 | return false; |
| 1765 | } |
| 1766 | |
| 1767 | boolean |
| 1768 | bsd_write_armap (arch, elength, map, orl_count, stridx) |
| 1769 | bfd *arch; |
| 1770 | unsigned int elength; |
| 1771 | struct orl *map; |
| 1772 | unsigned int orl_count; |
| 1773 | int stridx; |
| 1774 | { |
| 1775 | int padit = stridx & 1; |
| 1776 | unsigned int ranlibsize = orl_count * sizeof (struct ranlib); |
| 1777 | unsigned int stringsize = stridx + padit; |
| 1778 | /* Include 8 bytes to store ranlibsize and stringsize in output. */ |
| 1779 | unsigned int mapsize = ranlibsize + stringsize + 8; |
| 1780 | file_ptr firstreal; |
| 1781 | bfd *current = arch->archive_head; |
| 1782 | bfd *last_elt = current; /* last element arch seen */ |
| 1783 | int temp; |
| 1784 | int count; |
| 1785 | struct ar_hdr hdr; |
| 1786 | struct stat statbuf; |
| 1787 | unsigned int i; |
| 1788 | |
| 1789 | firstreal = mapsize + elength + sizeof (struct ar_hdr) + SARMAG; |
| 1790 | |
| 1791 | stat (arch->filename, &statbuf); |
| 1792 | memset ((char *) (&hdr), 0, sizeof (struct ar_hdr)); |
| 1793 | sprintf (hdr.ar_name, RANLIBMAG); |
| 1794 | /* Remember the timestamp, to keep it holy. But fudge it a little. */ |
| 1795 | bfd_ardata (arch)->armap_timestamp = statbuf.st_mtime + ARMAP_TIME_OFFSET; |
| 1796 | bfd_ardata (arch)->armap_datepos = (SARMAG |
| 1797 | + offsetof (struct ar_hdr, ar_date[0])); |
| 1798 | sprintf (hdr.ar_date, "%ld", bfd_ardata (arch)->armap_timestamp); |
| 1799 | sprintf (hdr.ar_uid, "%d", getuid ()); |
| 1800 | sprintf (hdr.ar_gid, "%d", getgid ()); |
| 1801 | sprintf (hdr.ar_size, "%-10d", (int) mapsize); |
| 1802 | strncpy (hdr.ar_fmag, ARFMAG, 2); |
| 1803 | for (i = 0; i < sizeof (struct ar_hdr); i++) |
| 1804 | if (((char *) (&hdr))[i] == '\0') |
| 1805 | (((char *) (&hdr))[i]) = ' '; |
| 1806 | if (bfd_write ((char *) &hdr, 1, sizeof (struct ar_hdr), arch) |
| 1807 | != sizeof (struct ar_hdr)) |
| 1808 | return false; |
| 1809 | bfd_h_put_32 (arch, (bfd_vma) ranlibsize, (PTR) &temp); |
| 1810 | if (bfd_write (&temp, 1, sizeof (temp), arch) != sizeof (temp)) |
| 1811 | return false; |
| 1812 | |
| 1813 | for (count = 0; count < orl_count; count++) |
| 1814 | { |
| 1815 | struct symdef outs; |
| 1816 | struct symdef *outp = &outs; |
| 1817 | |
| 1818 | if (((bfd *) (map[count]).pos) != last_elt) |
| 1819 | { |
| 1820 | do |
| 1821 | { |
| 1822 | firstreal += arelt_size (current) + sizeof (struct ar_hdr); |
| 1823 | firstreal += firstreal % 2; |
| 1824 | current = current->next; |
| 1825 | } |
| 1826 | while (current != (bfd *) (map[count]).pos); |
| 1827 | } /* if new archive element */ |
| 1828 | |
| 1829 | last_elt = current; |
| 1830 | bfd_h_put_32 (arch, ((map[count]).namidx), (PTR) &outs.s.string_offset); |
| 1831 | bfd_h_put_32 (arch, firstreal, (PTR) &outs.file_offset); |
| 1832 | if (bfd_write ((char *) outp, 1, sizeof (outs), arch) != sizeof (outs)) |
| 1833 | return false; |
| 1834 | } |
| 1835 | |
| 1836 | /* now write the strings themselves */ |
| 1837 | bfd_h_put_32 (arch, stringsize, (PTR) &temp); |
| 1838 | if (bfd_write ((PTR) &temp, 1, sizeof (temp), arch) != sizeof (temp)) |
| 1839 | return false; |
| 1840 | for (count = 0; count < orl_count; count++) |
| 1841 | { |
| 1842 | size_t len = strlen (*map[count].name) + 1; |
| 1843 | |
| 1844 | if (bfd_write (*map[count].name, 1, len, arch) != len) |
| 1845 | return false; |
| 1846 | } |
| 1847 | |
| 1848 | /* The spec sez this should be a newline. But in order to be |
| 1849 | bug-compatible for sun's ar we use a null. */ |
| 1850 | if (padit) |
| 1851 | { |
| 1852 | if (bfd_write ("", 1, 1, arch) != 1) |
| 1853 | return false; |
| 1854 | } |
| 1855 | |
| 1856 | return true; |
| 1857 | } |
| 1858 | |
| 1859 | /* At the end of archive file handling, update the timestamp in the |
| 1860 | file, so the linker will accept it. |
| 1861 | |
| 1862 | Return true if the timestamp was OK, or an unusual problem happened. |
| 1863 | Return false if we updated the timestamp. */ |
| 1864 | |
| 1865 | static boolean |
| 1866 | bsd_update_armap_timestamp (arch) |
| 1867 | bfd *arch; |
| 1868 | { |
| 1869 | struct stat archstat; |
| 1870 | struct ar_hdr hdr; |
| 1871 | int i; |
| 1872 | |
| 1873 | /* Flush writes, get last-write timestamp from file, and compare it |
| 1874 | to the timestamp IN the file. */ |
| 1875 | bfd_flush (arch); |
| 1876 | if (bfd_stat (arch, &archstat) == -1) |
| 1877 | { |
| 1878 | perror ("Reading archive file mod timestamp"); |
| 1879 | return true; /* Can't read mod time for some reason */ |
| 1880 | } |
| 1881 | if (archstat.st_mtime <= bfd_ardata (arch)->armap_timestamp) |
| 1882 | return true; /* OK by the linker's rules */ |
| 1883 | |
| 1884 | /* Update the timestamp. */ |
| 1885 | bfd_ardata (arch)->armap_timestamp = archstat.st_mtime + ARMAP_TIME_OFFSET; |
| 1886 | |
| 1887 | /* Prepare an ASCII version suitable for writing. */ |
| 1888 | memset (hdr.ar_date, 0, sizeof (hdr.ar_date)); |
| 1889 | sprintf (hdr.ar_date, "%ld", bfd_ardata (arch)->armap_timestamp); |
| 1890 | for (i = 0; i < sizeof (hdr.ar_date); i++) |
| 1891 | if (hdr.ar_date[i] == '\0') |
| 1892 | (hdr.ar_date)[i] = ' '; |
| 1893 | |
| 1894 | /* Write it into the file. */ |
| 1895 | if (bfd_seek (arch, bfd_ardata (arch)->armap_datepos, SEEK_SET) != 0 |
| 1896 | || (bfd_write (hdr.ar_date, sizeof (hdr.ar_date), 1, arch) |
| 1897 | != sizeof (hdr.ar_date))) |
| 1898 | { |
| 1899 | /* FIXME: bfd can't call perror. */ |
| 1900 | perror ("Writing updated armap timestamp"); |
| 1901 | return true; /* Some error while writing */ |
| 1902 | } |
| 1903 | |
| 1904 | return false; /* We updated the timestamp successfully. */ |
| 1905 | } |
| 1906 | \f |
| 1907 | /* A coff armap looks like : |
| 1908 | lARMAG |
| 1909 | struct ar_hdr with name = '/' |
| 1910 | number of symbols |
| 1911 | offset of file for symbol 0 |
| 1912 | offset of file for symbol 1 |
| 1913 | |
| 1914 | offset of file for symbol n-1 |
| 1915 | symbol name 0 |
| 1916 | symbol name 1 |
| 1917 | |
| 1918 | symbol name n-1 |
| 1919 | */ |
| 1920 | |
| 1921 | boolean |
| 1922 | coff_write_armap (arch, elength, map, symbol_count, stridx) |
| 1923 | bfd *arch; |
| 1924 | unsigned int elength; |
| 1925 | struct orl *map; |
| 1926 | unsigned int symbol_count; |
| 1927 | int stridx; |
| 1928 | { |
| 1929 | /* The size of the ranlib is the number of exported symbols in the |
| 1930 | archive * the number of bytes in a int, + an int for the count */ |
| 1931 | unsigned int ranlibsize = (symbol_count * 4) + 4; |
| 1932 | unsigned int stringsize = stridx; |
| 1933 | unsigned int mapsize = stringsize + ranlibsize; |
| 1934 | file_ptr archive_member_file_ptr; |
| 1935 | bfd *current = arch->archive_head; |
| 1936 | int count; |
| 1937 | struct ar_hdr hdr; |
| 1938 | unsigned int i; |
| 1939 | int padit = mapsize & 1; |
| 1940 | |
| 1941 | if (padit) |
| 1942 | mapsize++; |
| 1943 | |
| 1944 | /* work out where the first object file will go in the archive */ |
| 1945 | archive_member_file_ptr = (mapsize |
| 1946 | + elength |
| 1947 | + sizeof (struct ar_hdr) |
| 1948 | + SARMAG); |
| 1949 | |
| 1950 | memset ((char *) (&hdr), 0, sizeof (struct ar_hdr)); |
| 1951 | hdr.ar_name[0] = '/'; |
| 1952 | sprintf (hdr.ar_size, "%-10d", (int) mapsize); |
| 1953 | sprintf (hdr.ar_date, "%ld", (long) time (NULL)); |
| 1954 | /* This, at least, is what Intel coff sets the values to.: */ |
| 1955 | sprintf ((hdr.ar_uid), "%d", 0); |
| 1956 | sprintf ((hdr.ar_gid), "%d", 0); |
| 1957 | sprintf ((hdr.ar_mode), "%-7o", (unsigned) 0); |
| 1958 | strncpy (hdr.ar_fmag, ARFMAG, 2); |
| 1959 | |
| 1960 | for (i = 0; i < sizeof (struct ar_hdr); i++) |
| 1961 | if (((char *) (&hdr))[i] == '\0') |
| 1962 | (((char *) (&hdr))[i]) = ' '; |
| 1963 | |
| 1964 | /* Write the ar header for this item and the number of symbols */ |
| 1965 | |
| 1966 | if (bfd_write ((PTR) &hdr, 1, sizeof (struct ar_hdr), arch) |
| 1967 | != sizeof (struct ar_hdr)) |
| 1968 | return false; |
| 1969 | |
| 1970 | bfd_write_bigendian_4byte_int (arch, symbol_count); |
| 1971 | |
| 1972 | /* Two passes, first write the file offsets for each symbol - |
| 1973 | remembering that each offset is on a two byte boundary. */ |
| 1974 | |
| 1975 | /* Write out the file offset for the file associated with each |
| 1976 | symbol, and remember to keep the offsets padded out. */ |
| 1977 | |
| 1978 | current = arch->archive_head; |
| 1979 | count = 0; |
| 1980 | while (current != (bfd *) NULL && count < symbol_count) |
| 1981 | { |
| 1982 | /* For each symbol which is used defined in this object, write out |
| 1983 | the object file's address in the archive */ |
| 1984 | |
| 1985 | while (((bfd *) (map[count]).pos) == current) |
| 1986 | { |
| 1987 | bfd_write_bigendian_4byte_int (arch, archive_member_file_ptr); |
| 1988 | count++; |
| 1989 | } |
| 1990 | /* Add size of this archive entry */ |
| 1991 | archive_member_file_ptr += (arelt_size (current) |
| 1992 | + sizeof (struct ar_hdr)); |
| 1993 | /* remember aboout the even alignment */ |
| 1994 | archive_member_file_ptr += archive_member_file_ptr % 2; |
| 1995 | current = current->next; |
| 1996 | } |
| 1997 | |
| 1998 | /* now write the strings themselves */ |
| 1999 | for (count = 0; count < symbol_count; count++) |
| 2000 | { |
| 2001 | size_t len = strlen (*map[count].name) + 1; |
| 2002 | |
| 2003 | if (bfd_write (*map[count].name, 1, len, arch) != len) |
| 2004 | return false; |
| 2005 | } |
| 2006 | |
| 2007 | /* The spec sez this should be a newline. But in order to be |
| 2008 | bug-compatible for arc960 we use a null. */ |
| 2009 | if (padit) |
| 2010 | { |
| 2011 | if (bfd_write ("", 1, 1, arch) != 1) |
| 2012 | return false; |
| 2013 | } |
| 2014 | |
| 2015 | return true; |
| 2016 | } |