]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blob - bfd/archive.c
Revert bfd_get_size checks
[thirdparty/binutils-gdb.git] / bfd / archive.c
1 /* BFD back-end for archive files (libraries).
2 Copyright (C) 1990-2014 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 3 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., 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, 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 A BFD returned by <<bfd_openr_next_archived_file>> can be
44 closed manually with <<bfd_close>>. If you do not close it,
45 then a second iteration through the members of an archive may
46 return the same BFD. If you close the archive BFD, then all
47 the member BFDs will automatically be closed as well.
48
49 Archive contents of output BFDs are chained through the
50 <<archive_next>> pointer in a BFD. The first one is findable
51 through the <<archive_head>> slot of the archive. Set it with
52 <<bfd_set_archive_head>> (q.v.). A given BFD may be in only
53 one open output archive at a time.
54
55 As expected, the BFD archive code is more general than the
56 archive code of any given environment. BFD archives may
57 contain files of different formats (e.g., a.out and coff) and
58 even different architectures. You may even place archives
59 recursively into archives!
60
61 This can cause unexpected confusion, since some archive
62 formats are more expressive than others. For instance, Intel
63 COFF archives can preserve long filenames; SunOS a.out archives
64 cannot. If you move a file from the first to the second
65 format and back again, the filename may be truncated.
66 Likewise, different a.out environments have different
67 conventions as to how they truncate filenames, whether they
68 preserve directory names in filenames, etc. When
69 interoperating with native tools, be sure your files are
70 homogeneous.
71
72 Beware: most of these formats do not react well to the
73 presence of spaces in filenames. We do the best we can, but
74 can't always handle this case due to restrictions in the format of
75 archives. Many Unix utilities are braindead in regards to
76 spaces and such in filenames anyway, so this shouldn't be much
77 of a restriction.
78
79 Archives are supported in BFD in <<archive.c>>.
80
81 SUBSECTION
82 Archive functions
83 */
84
85 /* Assumes:
86 o - all archive elements start on an even boundary, newline padded;
87 o - all arch headers are char *;
88 o - all arch headers are the same size (across architectures).
89 */
90
91 /* Some formats provide a way to cram a long filename into the short
92 (16 chars) space provided by a BSD archive. The trick is: make a
93 special "file" in the front of the archive, sort of like the SYMDEF
94 entry. If the filename is too long to fit, put it in the extended
95 name table, and use its index as the filename. To prevent
96 confusion prepend the index with a space. This means you can't
97 have filenames that start with a space, but then again, many Unix
98 utilities can't handle that anyway.
99
100 This scheme unfortunately requires that you stand on your head in
101 order to write an archive since you need to put a magic file at the
102 front, and need to touch every entry to do so. C'est la vie.
103
104 We support two variants of this idea:
105 The SVR4 format (extended name table is named "//"),
106 and an extended pseudo-BSD variant (extended name table is named
107 "ARFILENAMES/"). The origin of the latter format is uncertain.
108
109 BSD 4.4 uses a third scheme: It writes a long filename
110 directly after the header. This allows 'ar q' to work.
111 */
112
113 /* Summary of archive member names:
114
115 Symbol table (must be first):
116 "__.SYMDEF " - Symbol table, Berkeley style, produced by ranlib.
117 "/ " - Symbol table, system 5 style.
118
119 Long name table (must be before regular file members):
120 "// " - Long name table, System 5 R4 style.
121 "ARFILENAMES/ " - Long name table, non-standard extended BSD (not BSD 4.4).
122
123 Regular file members with short names:
124 "filename.o/ " - Regular file, System 5 style (embedded spaces ok).
125 "filename.o " - Regular file, Berkeley style (no embedded spaces).
126
127 Regular files with long names (or embedded spaces, for BSD variants):
128 "/18 " - SVR4 style, name at offset 18 in name table.
129 "#1/23 " - Long name (or embedded spaces) 23 characters long,
130 BSD 4.4 style, full name follows header.
131 " 18 " - Long name 18 characters long, extended pseudo-BSD.
132 */
133
134 #include "sysdep.h"
135 #include "bfd.h"
136 #include "libiberty.h"
137 #include "libbfd.h"
138 #include "aout/ar.h"
139 #include "aout/ranlib.h"
140 #include "safe-ctype.h"
141 #include "hashtab.h"
142 #include "filenames.h"
143 #include "bfdlink.h"
144
145 #ifndef errno
146 extern int errno;
147 #endif
148
149 /* We keep a cache of archive filepointers to archive elements to
150 speed up searching the archive by filepos. We only add an entry to
151 the cache when we actually read one. We also don't sort the cache;
152 it's generally short enough to search linearly.
153 Note that the pointers here point to the front of the ar_hdr, not
154 to the front of the contents! */
155 struct ar_cache
156 {
157 file_ptr ptr;
158 bfd *arbfd;
159 };
160
161 #define ar_padchar(abfd) ((abfd)->xvec->ar_pad_char)
162 #define ar_maxnamelen(abfd) ((abfd)->xvec->ar_max_namelen)
163
164 #define arch_eltdata(bfd) ((struct areltdata *) ((bfd)->arelt_data))
165 #define arch_hdr(bfd) ((struct ar_hdr *) arch_eltdata (bfd)->arch_header)
166
167 /* True iff NAME designated a BSD 4.4 extended name. */
168
169 #define is_bsd44_extended_name(NAME) \
170 (NAME[0] == '#' && NAME[1] == '1' && NAME[2] == '/' && ISDIGIT (NAME[3]))
171 \f
172 void
173 _bfd_ar_spacepad (char *p, size_t n, const char *fmt, long val)
174 {
175 static char buf[20];
176 size_t len;
177
178 snprintf (buf, sizeof (buf), fmt, val);
179 len = strlen (buf);
180 if (len < n)
181 {
182 memcpy (p, buf, len);
183 memset (p + len, ' ', n - len);
184 }
185 else
186 memcpy (p, buf, n);
187 }
188
189 bfd_boolean
190 _bfd_ar_sizepad (char *p, size_t n, bfd_size_type size)
191 {
192 static char buf[21];
193 size_t len;
194
195 snprintf (buf, sizeof (buf), "%-10" BFD_VMA_FMT "u", size);
196 len = strlen (buf);
197 if (len > n)
198 {
199 bfd_set_error (bfd_error_file_too_big);
200 return FALSE;
201 }
202 if (len < n)
203 {
204 memcpy (p, buf, len);
205 memset (p + len, ' ', n - len);
206 }
207 else
208 memcpy (p, buf, n);
209 return TRUE;
210 }
211 \f
212 bfd_boolean
213 _bfd_generic_mkarchive (bfd *abfd)
214 {
215 bfd_size_type amt = sizeof (struct artdata);
216
217 abfd->tdata.aout_ar_data = (struct artdata *) bfd_zalloc (abfd, amt);
218 if (bfd_ardata (abfd) == NULL)
219 return FALSE;
220
221 /* Already cleared by bfd_zalloc above.
222 bfd_ardata (abfd)->cache = NULL;
223 bfd_ardata (abfd)->archive_head = NULL;
224 bfd_ardata (abfd)->symdefs = NULL;
225 bfd_ardata (abfd)->extended_names = NULL;
226 bfd_ardata (abfd)->extended_names_size = 0;
227 bfd_ardata (abfd)->tdata = NULL; */
228
229 return TRUE;
230 }
231
232 /*
233 FUNCTION
234 bfd_get_next_mapent
235
236 SYNOPSIS
237 symindex bfd_get_next_mapent
238 (bfd *abfd, symindex previous, carsym **sym);
239
240 DESCRIPTION
241 Step through archive @var{abfd}'s symbol table (if it
242 has one). Successively update @var{sym} with the next symbol's
243 information, returning that symbol's (internal) index into the
244 symbol table.
245
246 Supply <<BFD_NO_MORE_SYMBOLS>> as the @var{previous} entry to get
247 the first one; returns <<BFD_NO_MORE_SYMBOLS>> when you've already
248 got the last one.
249
250 A <<carsym>> is a canonical archive symbol. The only
251 user-visible element is its name, a null-terminated string.
252 */
253
254 symindex
255 bfd_get_next_mapent (bfd *abfd, symindex prev, carsym **entry)
256 {
257 if (!bfd_has_map (abfd))
258 {
259 bfd_set_error (bfd_error_invalid_operation);
260 return BFD_NO_MORE_SYMBOLS;
261 }
262
263 if (prev == BFD_NO_MORE_SYMBOLS)
264 prev = 0;
265 else
266 ++prev;
267 if (prev >= bfd_ardata (abfd)->symdef_count)
268 return BFD_NO_MORE_SYMBOLS;
269
270 *entry = (bfd_ardata (abfd)->symdefs + prev);
271 return prev;
272 }
273
274 /* To be called by backends only. */
275
276 bfd *
277 _bfd_create_empty_archive_element_shell (bfd *obfd)
278 {
279 return _bfd_new_bfd_contained_in (obfd);
280 }
281
282 /*
283 FUNCTION
284 bfd_set_archive_head
285
286 SYNOPSIS
287 bfd_boolean bfd_set_archive_head (bfd *output, bfd *new_head);
288
289 DESCRIPTION
290 Set the head of the chain of
291 BFDs contained in the archive @var{output} to @var{new_head}.
292 */
293
294 bfd_boolean
295 bfd_set_archive_head (bfd *output_archive, bfd *new_head)
296 {
297 output_archive->archive_head = new_head;
298 return TRUE;
299 }
300
301 bfd *
302 _bfd_look_for_bfd_in_cache (bfd *arch_bfd, file_ptr filepos)
303 {
304 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
305 struct ar_cache m;
306
307 m.ptr = filepos;
308
309 if (hash_table)
310 {
311 struct ar_cache *entry = (struct ar_cache *) htab_find (hash_table, &m);
312 if (!entry)
313 return NULL;
314 else
315 return entry->arbfd;
316 }
317 else
318 return NULL;
319 }
320
321 static hashval_t
322 hash_file_ptr (const void * p)
323 {
324 return (hashval_t) (((struct ar_cache *) p)->ptr);
325 }
326
327 /* Returns non-zero if P1 and P2 are equal. */
328
329 static int
330 eq_file_ptr (const void * p1, const void * p2)
331 {
332 struct ar_cache *arc1 = (struct ar_cache *) p1;
333 struct ar_cache *arc2 = (struct ar_cache *) p2;
334 return arc1->ptr == arc2->ptr;
335 }
336
337 /* The calloc function doesn't always take size_t (e.g. on VMS)
338 so wrap it to avoid a compile time warning. */
339
340 static void *
341 _bfd_calloc_wrapper (size_t a, size_t b)
342 {
343 return calloc (a, b);
344 }
345
346 /* Kind of stupid to call cons for each one, but we don't do too many. */
347
348 bfd_boolean
349 _bfd_add_bfd_to_archive_cache (bfd *arch_bfd, file_ptr filepos, bfd *new_elt)
350 {
351 struct ar_cache *cache;
352 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
353
354 /* If the hash table hasn't been created, create it. */
355 if (hash_table == NULL)
356 {
357 hash_table = htab_create_alloc (16, hash_file_ptr, eq_file_ptr,
358 NULL, _bfd_calloc_wrapper, free);
359 if (hash_table == NULL)
360 return FALSE;
361 bfd_ardata (arch_bfd)->cache = hash_table;
362 }
363
364 /* Insert new_elt into the hash table by filepos. */
365 cache = (struct ar_cache *) bfd_zalloc (arch_bfd, sizeof (struct ar_cache));
366 cache->ptr = filepos;
367 cache->arbfd = new_elt;
368 *htab_find_slot (hash_table, (const void *) cache, INSERT) = cache;
369
370 /* Provide a means of accessing this from child. */
371 arch_eltdata (new_elt)->parent_cache = hash_table;
372 arch_eltdata (new_elt)->key = filepos;
373
374 return TRUE;
375 }
376 \f
377 static bfd *
378 _bfd_find_nested_archive (bfd *arch_bfd, const char *filename)
379 {
380 bfd *abfd;
381 const char *target;
382
383 /* PR 15140: Don't allow a nested archive pointing to itself. */
384 if (filename_cmp (filename, arch_bfd->filename) == 0)
385 {
386 bfd_set_error (bfd_error_malformed_archive);
387 return NULL;
388 }
389
390 for (abfd = arch_bfd->nested_archives;
391 abfd != NULL;
392 abfd = abfd->archive_next)
393 {
394 if (filename_cmp (filename, abfd->filename) == 0)
395 return abfd;
396 }
397 target = NULL;
398 if (!arch_bfd->target_defaulted)
399 target = arch_bfd->xvec->name;
400 abfd = bfd_openr (filename, target);
401 if (abfd)
402 {
403 abfd->archive_next = arch_bfd->nested_archives;
404 arch_bfd->nested_archives = abfd;
405 }
406 return abfd;
407 }
408
409 /* The name begins with space. Hence the rest of the name is an index into
410 the string table. */
411
412 static char *
413 get_extended_arelt_filename (bfd *arch, const char *name, file_ptr *originp)
414 {
415 unsigned long table_index = 0;
416 const char *endp;
417
418 /* Should extract string so that I can guarantee not to overflow into
419 the next region, but I'm too lazy. */
420 errno = 0;
421 /* Skip first char, which is '/' in SVR4 or ' ' in some other variants. */
422 table_index = strtol (name + 1, (char **) &endp, 10);
423 if (errno != 0 || table_index >= bfd_ardata (arch)->extended_names_size)
424 {
425 bfd_set_error (bfd_error_malformed_archive);
426 return NULL;
427 }
428 /* In a thin archive, a member of an archive-within-an-archive
429 will have the offset in the inner archive encoded here. */
430 if (bfd_is_thin_archive (arch) && endp != NULL && *endp == ':')
431 {
432 file_ptr origin = strtol (endp + 1, NULL, 10);
433
434 if (errno != 0)
435 {
436 bfd_set_error (bfd_error_malformed_archive);
437 return NULL;
438 }
439 *originp = origin;
440 }
441 else
442 *originp = 0;
443
444 return bfd_ardata (arch)->extended_names + table_index;
445 }
446
447 /* This functions reads an arch header and returns an areltdata pointer, or
448 NULL on error.
449
450 Presumes the file pointer is already in the right place (ie pointing
451 to the ar_hdr in the file). Moves the file pointer; on success it
452 should be pointing to the front of the file contents; on failure it
453 could have been moved arbitrarily. */
454
455 void *
456 _bfd_generic_read_ar_hdr (bfd *abfd)
457 {
458 return _bfd_generic_read_ar_hdr_mag (abfd, NULL);
459 }
460
461 /* Alpha ECOFF uses an optional different ARFMAG value, so we have a
462 variant of _bfd_generic_read_ar_hdr which accepts a magic string. */
463
464 void *
465 _bfd_generic_read_ar_hdr_mag (bfd *abfd, const char *mag)
466 {
467 struct ar_hdr hdr;
468 char *hdrp = (char *) &hdr;
469 bfd_size_type parsed_size;
470 struct areltdata *ared;
471 char *filename = NULL;
472 bfd_size_type namelen = 0;
473 bfd_size_type allocsize = sizeof (struct areltdata) + sizeof (struct ar_hdr);
474 char *allocptr = 0;
475 file_ptr origin = 0;
476 unsigned int extra_size = 0;
477 char fmag_save;
478 int scan;
479
480 if (bfd_bread (hdrp, sizeof (struct ar_hdr), abfd) != sizeof (struct ar_hdr))
481 {
482 if (bfd_get_error () != bfd_error_system_call)
483 bfd_set_error (bfd_error_no_more_archived_files);
484 return NULL;
485 }
486 if (strncmp (hdr.ar_fmag, ARFMAG, 2) != 0
487 && (mag == NULL
488 || strncmp (hdr.ar_fmag, mag, 2) != 0))
489 {
490 bfd_set_error (bfd_error_malformed_archive);
491 return NULL;
492 }
493
494 errno = 0;
495 fmag_save = hdr.ar_fmag[0];
496 hdr.ar_fmag[0] = 0;
497 scan = sscanf (hdr.ar_size, "%" BFD_VMA_FMT "u", &parsed_size);
498 hdr.ar_fmag[0] = fmag_save;
499 if (scan != 1)
500 {
501 bfd_set_error (bfd_error_malformed_archive);
502 return NULL;
503 }
504
505 /* Extract the filename from the archive - there are two ways to
506 specify an extended name table, either the first char of the
507 name is a space, or it's a slash. */
508 if ((hdr.ar_name[0] == '/'
509 || (hdr.ar_name[0] == ' '
510 && memchr (hdr.ar_name, '/', ar_maxnamelen (abfd)) == NULL))
511 && bfd_ardata (abfd)->extended_names != NULL)
512 {
513 filename = get_extended_arelt_filename (abfd, hdr.ar_name, &origin);
514 if (filename == NULL)
515 return NULL;
516 }
517 /* BSD4.4-style long filename. */
518 else if (is_bsd44_extended_name (hdr.ar_name))
519 {
520 /* BSD-4.4 extended name */
521 namelen = atoi (&hdr.ar_name[3]);
522 allocsize += namelen + 1;
523 parsed_size -= namelen;
524 extra_size = namelen;
525
526 allocptr = (char *) bfd_zmalloc (allocsize);
527 if (allocptr == NULL)
528 return NULL;
529 filename = (allocptr
530 + sizeof (struct areltdata)
531 + sizeof (struct ar_hdr));
532 if (bfd_bread (filename, namelen, abfd) != namelen)
533 {
534 free (allocptr);
535 if (bfd_get_error () != bfd_error_system_call)
536 bfd_set_error (bfd_error_no_more_archived_files);
537 return NULL;
538 }
539 filename[namelen] = '\0';
540 }
541 else
542 {
543 /* We judge the end of the name by looking for '/' or ' '.
544 Note: The SYSV format (terminated by '/') allows embedded
545 spaces, so only look for ' ' if we don't find '/'. */
546
547 char *e;
548 e = (char *) memchr (hdr.ar_name, '\0', ar_maxnamelen (abfd));
549 if (e == NULL)
550 {
551 e = (char *) memchr (hdr.ar_name, '/', ar_maxnamelen (abfd));
552 if (e == NULL)
553 e = (char *) memchr (hdr.ar_name, ' ', ar_maxnamelen (abfd));
554 }
555
556 if (e != NULL)
557 namelen = e - hdr.ar_name;
558 else
559 {
560 /* If we didn't find a termination character, then the name
561 must be the entire field. */
562 namelen = ar_maxnamelen (abfd);
563 }
564
565 allocsize += namelen + 1;
566 }
567
568 if (!allocptr)
569 {
570 allocptr = (char *) bfd_zmalloc (allocsize);
571 if (allocptr == NULL)
572 return NULL;
573 }
574
575 ared = (struct areltdata *) allocptr;
576
577 ared->arch_header = allocptr + sizeof (struct areltdata);
578 memcpy (ared->arch_header, &hdr, sizeof (struct ar_hdr));
579 ared->parsed_size = parsed_size;
580 ared->extra_size = extra_size;
581 ared->origin = origin;
582
583 if (filename != NULL)
584 ared->filename = filename;
585 else
586 {
587 ared->filename = allocptr + (sizeof (struct areltdata) +
588 sizeof (struct ar_hdr));
589 if (namelen)
590 memcpy (ared->filename, hdr.ar_name, namelen);
591 ared->filename[namelen] = '\0';
592 }
593
594 return ared;
595 }
596 \f
597 /* Append the relative pathname for a member of the thin archive
598 to the pathname of the directory containing the archive. */
599
600 char *
601 _bfd_append_relative_path (bfd *arch, char *elt_name)
602 {
603 const char *arch_name = arch->filename;
604 const char *base_name = lbasename (arch_name);
605 size_t prefix_len;
606 char *filename;
607
608 if (base_name == arch_name)
609 return elt_name;
610
611 prefix_len = base_name - arch_name;
612 filename = (char *) bfd_alloc (arch, prefix_len + strlen (elt_name) + 1);
613 if (filename == NULL)
614 return NULL;
615
616 strncpy (filename, arch_name, prefix_len);
617 strcpy (filename + prefix_len, elt_name);
618 return filename;
619 }
620
621 /* This is an internal function; it's mainly used when indexing
622 through the archive symbol table, but also used to get the next
623 element, since it handles the bookkeeping so nicely for us. */
624
625 bfd *
626 _bfd_get_elt_at_filepos (bfd *archive, file_ptr filepos)
627 {
628 struct areltdata *new_areldata;
629 bfd *n_nfd;
630 char *filename;
631
632 n_nfd = _bfd_look_for_bfd_in_cache (archive, filepos);
633 if (n_nfd)
634 return n_nfd;
635
636 if (0 > bfd_seek (archive, filepos, SEEK_SET))
637 return NULL;
638
639 if ((new_areldata = (struct areltdata *) _bfd_read_ar_hdr (archive)) == NULL)
640 return NULL;
641
642 filename = new_areldata->filename;
643
644 if (bfd_is_thin_archive (archive))
645 {
646 const char *target;
647
648 /* This is a proxy entry for an external file. */
649 if (! IS_ABSOLUTE_PATH (filename))
650 {
651 filename = _bfd_append_relative_path (archive, filename);
652 if (filename == NULL)
653 {
654 free (new_areldata);
655 return NULL;
656 }
657 }
658
659 if (new_areldata->origin > 0)
660 {
661 /* This proxy entry refers to an element of a nested archive.
662 Locate the member of that archive and return a bfd for it. */
663 bfd *ext_arch = _bfd_find_nested_archive (archive, filename);
664
665 if (ext_arch == NULL
666 || ! bfd_check_format (ext_arch, bfd_archive))
667 {
668 free (new_areldata);
669 return NULL;
670 }
671 n_nfd = _bfd_get_elt_at_filepos (ext_arch, new_areldata->origin);
672 if (n_nfd == NULL)
673 {
674 free (new_areldata);
675 return NULL;
676 }
677 n_nfd->proxy_origin = bfd_tell (archive);
678 return n_nfd;
679 }
680 /* It's not an element of a nested archive;
681 open the external file as a bfd. */
682 target = NULL;
683 if (!archive->target_defaulted)
684 target = archive->xvec->name;
685 n_nfd = bfd_openr (filename, target);
686 if (n_nfd == NULL)
687 bfd_set_error (bfd_error_malformed_archive);
688 }
689 else
690 {
691 n_nfd = _bfd_create_empty_archive_element_shell (archive);
692 }
693
694 if (n_nfd == NULL)
695 {
696 free (new_areldata);
697 return NULL;
698 }
699
700 n_nfd->proxy_origin = bfd_tell (archive);
701
702 if (bfd_is_thin_archive (archive))
703 {
704 n_nfd->origin = 0;
705 }
706 else
707 {
708 n_nfd->origin = n_nfd->proxy_origin;
709 n_nfd->filename = xstrdup (filename);
710 }
711
712 n_nfd->arelt_data = new_areldata;
713
714 /* Copy BFD_COMPRESS and BFD_DECOMPRESS flags. */
715 n_nfd->flags |= archive->flags & (BFD_COMPRESS | BFD_DECOMPRESS);
716
717 if (_bfd_add_bfd_to_archive_cache (archive, filepos, n_nfd))
718 return n_nfd;
719
720 free (new_areldata);
721 n_nfd->arelt_data = NULL;
722 return NULL;
723 }
724
725 /* Return the BFD which is referenced by the symbol in ABFD indexed by
726 SYM_INDEX. SYM_INDEX should have been returned by bfd_get_next_mapent. */
727
728 bfd *
729 _bfd_generic_get_elt_at_index (bfd *abfd, symindex sym_index)
730 {
731 carsym *entry;
732
733 entry = bfd_ardata (abfd)->symdefs + sym_index;
734 return _bfd_get_elt_at_filepos (abfd, entry->file_offset);
735 }
736
737 /*
738 FUNCTION
739 bfd_openr_next_archived_file
740
741 SYNOPSIS
742 bfd *bfd_openr_next_archived_file (bfd *archive, bfd *previous);
743
744 DESCRIPTION
745 Provided a BFD, @var{archive}, containing an archive and NULL, open
746 an input BFD on the first contained element and returns that.
747 Subsequent calls should pass
748 the archive and the previous return value to return a created
749 BFD to the next contained element. NULL is returned when there
750 are no more.
751 */
752
753 bfd *
754 bfd_openr_next_archived_file (bfd *archive, bfd *last_file)
755 {
756 if ((bfd_get_format (archive) != bfd_archive)
757 || (archive->direction == write_direction))
758 {
759 bfd_set_error (bfd_error_invalid_operation);
760 return NULL;
761 }
762
763 return BFD_SEND (archive,
764 openr_next_archived_file, (archive, last_file));
765 }
766
767 bfd *
768 bfd_generic_openr_next_archived_file (bfd *archive, bfd *last_file)
769 {
770 file_ptr filestart;
771
772 if (!last_file)
773 filestart = bfd_ardata (archive)->first_file_filepos;
774 else
775 {
776 bfd_size_type size = arelt_size (last_file);
777
778 filestart = last_file->proxy_origin;
779 if (! bfd_is_thin_archive (archive))
780 filestart += size;
781 /* Pad to an even boundary...
782 Note that last_file->origin can be odd in the case of
783 BSD-4.4-style element with a long odd size. */
784 filestart += filestart % 2;
785 }
786
787 return _bfd_get_elt_at_filepos (archive, filestart);
788 }
789
790 const bfd_target *
791 bfd_generic_archive_p (bfd *abfd)
792 {
793 struct artdata *tdata_hold;
794 char armag[SARMAG + 1];
795 bfd_size_type amt;
796
797 if (bfd_bread (armag, SARMAG, abfd) != SARMAG)
798 {
799 if (bfd_get_error () != bfd_error_system_call)
800 bfd_set_error (bfd_error_wrong_format);
801 return NULL;
802 }
803
804 bfd_is_thin_archive (abfd) = (strncmp (armag, ARMAGT, SARMAG) == 0);
805
806 if (strncmp (armag, ARMAG, SARMAG) != 0
807 && strncmp (armag, ARMAGB, SARMAG) != 0
808 && ! bfd_is_thin_archive (abfd))
809 return NULL;
810
811 tdata_hold = bfd_ardata (abfd);
812
813 amt = sizeof (struct artdata);
814 bfd_ardata (abfd) = (struct artdata *) bfd_zalloc (abfd, amt);
815 if (bfd_ardata (abfd) == NULL)
816 {
817 bfd_ardata (abfd) = tdata_hold;
818 return NULL;
819 }
820
821 bfd_ardata (abfd)->first_file_filepos = SARMAG;
822 /* Cleared by bfd_zalloc above.
823 bfd_ardata (abfd)->cache = NULL;
824 bfd_ardata (abfd)->archive_head = NULL;
825 bfd_ardata (abfd)->symdefs = NULL;
826 bfd_ardata (abfd)->extended_names = NULL;
827 bfd_ardata (abfd)->extended_names_size = 0;
828 bfd_ardata (abfd)->tdata = NULL; */
829
830 if (!BFD_SEND (abfd, _bfd_slurp_armap, (abfd))
831 || !BFD_SEND (abfd, _bfd_slurp_extended_name_table, (abfd)))
832 {
833 if (bfd_get_error () != bfd_error_system_call)
834 bfd_set_error (bfd_error_wrong_format);
835 bfd_release (abfd, bfd_ardata (abfd));
836 bfd_ardata (abfd) = tdata_hold;
837 return NULL;
838 }
839
840 if (abfd->target_defaulted && bfd_has_map (abfd))
841 {
842 bfd *first;
843
844 /* This archive has a map, so we may presume that the contents
845 are object files. Make sure that if the first file in the
846 archive can be recognized as an object file, it is for this
847 target. If not, assume that this is the wrong format. If
848 the first file is not an object file, somebody is doing
849 something weird, and we permit it so that ar -t will work.
850
851 This is done because any normal format will recognize any
852 normal archive, regardless of the format of the object files.
853 We do accept an empty archive. */
854
855 first = bfd_openr_next_archived_file (abfd, NULL);
856 if (first != NULL)
857 {
858 first->target_defaulted = FALSE;
859 if (bfd_check_format (first, bfd_object)
860 && first->xvec != abfd->xvec)
861 bfd_set_error (bfd_error_wrong_object_format);
862 /* And we ought to close `first' here too. */
863 }
864 }
865
866 return abfd->xvec;
867 }
868
869 /* Some constants for a 32 bit BSD archive structure. We do not
870 support 64 bit archives presently; so far as I know, none actually
871 exist. Supporting them would require changing these constants, and
872 changing some H_GET_32 to H_GET_64. */
873
874 /* The size of an external symdef structure. */
875 #define BSD_SYMDEF_SIZE 8
876
877 /* The offset from the start of a symdef structure to the file offset. */
878 #define BSD_SYMDEF_OFFSET_SIZE 4
879
880 /* The size of the symdef count. */
881 #define BSD_SYMDEF_COUNT_SIZE 4
882
883 /* The size of the string count. */
884 #define BSD_STRING_COUNT_SIZE 4
885
886 /* Read a BSD-style archive symbol table. Returns FALSE on error,
887 TRUE otherwise. */
888
889 static bfd_boolean
890 do_slurp_bsd_armap (bfd *abfd)
891 {
892 struct areltdata *mapdata;
893 unsigned int counter;
894 bfd_byte *raw_armap, *rbase;
895 struct artdata *ardata = bfd_ardata (abfd);
896 char *stringbase;
897 bfd_size_type parsed_size, amt;
898 carsym *set;
899
900 mapdata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
901 if (mapdata == NULL)
902 return FALSE;
903 parsed_size = mapdata->parsed_size;
904 free (mapdata);
905
906 raw_armap = (bfd_byte *) bfd_zalloc (abfd, parsed_size);
907 if (raw_armap == NULL)
908 return FALSE;
909
910 if (bfd_bread (raw_armap, parsed_size, abfd) != parsed_size)
911 {
912 if (bfd_get_error () != bfd_error_system_call)
913 bfd_set_error (bfd_error_malformed_archive);
914 byebye:
915 bfd_release (abfd, raw_armap);
916 return FALSE;
917 }
918
919 ardata->symdef_count = H_GET_32 (abfd, raw_armap) / BSD_SYMDEF_SIZE;
920
921 if (ardata->symdef_count * BSD_SYMDEF_SIZE >
922 parsed_size - BSD_SYMDEF_COUNT_SIZE)
923 {
924 /* Probably we're using the wrong byte ordering. */
925 bfd_set_error (bfd_error_wrong_format);
926 goto byebye;
927 }
928
929 ardata->cache = 0;
930 rbase = raw_armap + BSD_SYMDEF_COUNT_SIZE;
931 stringbase = ((char *) rbase
932 + ardata->symdef_count * BSD_SYMDEF_SIZE
933 + BSD_STRING_COUNT_SIZE);
934 amt = ardata->symdef_count * sizeof (carsym);
935 ardata->symdefs = (struct carsym *) bfd_alloc (abfd, amt);
936 if (!ardata->symdefs)
937 return FALSE;
938
939 for (counter = 0, set = ardata->symdefs;
940 counter < ardata->symdef_count;
941 counter++, set++, rbase += BSD_SYMDEF_SIZE)
942 {
943 set->name = H_GET_32 (abfd, rbase) + stringbase;
944 set->file_offset = H_GET_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE);
945 }
946
947 ardata->first_file_filepos = bfd_tell (abfd);
948 /* Pad to an even boundary if you have to. */
949 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
950 /* FIXME, we should provide some way to free raw_ardata when
951 we are done using the strings from it. For now, it seems
952 to be allocated on an objalloc anyway... */
953 bfd_has_map (abfd) = TRUE;
954 return TRUE;
955 }
956
957 /* Read a COFF archive symbol table. Returns FALSE on error, TRUE
958 otherwise. */
959
960 static bfd_boolean
961 do_slurp_coff_armap (bfd *abfd)
962 {
963 struct areltdata *mapdata;
964 int *raw_armap, *rawptr;
965 struct artdata *ardata = bfd_ardata (abfd);
966 char *stringbase;
967 bfd_size_type stringsize;
968 bfd_size_type parsed_size;
969 carsym *carsyms;
970 bfd_size_type nsymz; /* Number of symbols in armap. */
971 bfd_vma (*swap) (const void *);
972 char int_buf[sizeof (long)];
973 bfd_size_type carsym_size, ptrsize;
974 unsigned int i;
975
976 mapdata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
977 if (mapdata == NULL)
978 return FALSE;
979 parsed_size = mapdata->parsed_size;
980 free (mapdata);
981
982 if (bfd_bread (int_buf, 4, abfd) != 4)
983 {
984 if (bfd_get_error () != bfd_error_system_call)
985 bfd_set_error (bfd_error_malformed_archive);
986 return FALSE;
987 }
988 /* It seems that all numeric information in a coff archive is always
989 in big endian format, nomatter the host or target. */
990 swap = bfd_getb32;
991 nsymz = bfd_getb32 (int_buf);
992 stringsize = parsed_size - (4 * nsymz) - 4;
993
994 /* ... except that some archive formats are broken, and it may be our
995 fault - the i960 little endian coff sometimes has big and sometimes
996 little, because our tools changed. Here's a horrible hack to clean
997 up the crap. */
998
999 if (stringsize > 0xfffff
1000 && bfd_get_arch (abfd) == bfd_arch_i960
1001 && bfd_get_flavour (abfd) == bfd_target_coff_flavour)
1002 {
1003 /* This looks dangerous, let's do it the other way around. */
1004 nsymz = bfd_getl32 (int_buf);
1005 stringsize = parsed_size - (4 * nsymz) - 4;
1006 swap = bfd_getl32;
1007 }
1008
1009 /* The coff armap must be read sequentially. So we construct a
1010 bsd-style one in core all at once, for simplicity. */
1011
1012 if (nsymz > ~ (bfd_size_type) 0 / sizeof (carsym))
1013 return FALSE;
1014
1015 carsym_size = (nsymz * sizeof (carsym));
1016 ptrsize = (4 * nsymz);
1017
1018 if (carsym_size + stringsize + 1 <= carsym_size)
1019 return FALSE;
1020
1021 ardata->symdefs = (struct carsym *) bfd_zalloc (abfd,
1022 carsym_size + stringsize + 1);
1023 if (ardata->symdefs == NULL)
1024 return FALSE;
1025 carsyms = ardata->symdefs;
1026 stringbase = ((char *) ardata->symdefs) + carsym_size;
1027
1028 /* Allocate and read in the raw offsets. */
1029 raw_armap = (int *) bfd_alloc (abfd, ptrsize);
1030 if (raw_armap == NULL)
1031 goto release_symdefs;
1032 if (bfd_bread (raw_armap, ptrsize, abfd) != ptrsize
1033 || (bfd_bread (stringbase, stringsize, abfd) != stringsize))
1034 {
1035 if (bfd_get_error () != bfd_error_system_call)
1036 bfd_set_error (bfd_error_malformed_archive);
1037 goto release_raw_armap;
1038 }
1039
1040 /* OK, build the carsyms. */
1041 for (i = 0; i < nsymz; i++)
1042 {
1043 rawptr = raw_armap + i;
1044 carsyms->file_offset = swap ((bfd_byte *) rawptr);
1045 carsyms->name = stringbase;
1046 stringbase += strlen (stringbase) + 1;
1047 carsyms++;
1048 }
1049 *stringbase = 0;
1050
1051 ardata->symdef_count = nsymz;
1052 ardata->first_file_filepos = bfd_tell (abfd);
1053 /* Pad to an even boundary if you have to. */
1054 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
1055
1056 bfd_has_map (abfd) = TRUE;
1057 bfd_release (abfd, raw_armap);
1058
1059 /* Check for a second archive header (as used by PE). */
1060 {
1061 struct areltdata *tmp;
1062
1063 bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET);
1064 tmp = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1065 if (tmp != NULL)
1066 {
1067 if (tmp->arch_header[0] == '/'
1068 && tmp->arch_header[1] == ' ')
1069 {
1070 ardata->first_file_filepos +=
1071 (tmp->parsed_size + sizeof (struct ar_hdr) + 1) & ~(unsigned) 1;
1072 }
1073 free (tmp);
1074 }
1075 }
1076
1077 return TRUE;
1078
1079 release_raw_armap:
1080 bfd_release (abfd, raw_armap);
1081 release_symdefs:
1082 bfd_release (abfd, (ardata)->symdefs);
1083 return FALSE;
1084 }
1085
1086 /* This routine can handle either coff-style or bsd-style armaps
1087 (archive symbol table). Returns FALSE on error, TRUE otherwise */
1088
1089 bfd_boolean
1090 bfd_slurp_armap (bfd *abfd)
1091 {
1092 char nextname[17];
1093 int i = bfd_bread (nextname, 16, abfd);
1094
1095 if (i == 0)
1096 return TRUE;
1097 if (i != 16)
1098 return FALSE;
1099
1100 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1101 return FALSE;
1102
1103 if (CONST_STRNEQ (nextname, "__.SYMDEF ")
1104 || CONST_STRNEQ (nextname, "__.SYMDEF/ ")) /* Old Linux archives. */
1105 return do_slurp_bsd_armap (abfd);
1106 else if (CONST_STRNEQ (nextname, "/ "))
1107 return do_slurp_coff_armap (abfd);
1108 else if (CONST_STRNEQ (nextname, "/SYM64/ "))
1109 {
1110 /* 64bit ELF (Irix 6) archive. */
1111 #ifdef BFD64
1112 extern bfd_boolean bfd_elf64_archive_slurp_armap (bfd *);
1113 return bfd_elf64_archive_slurp_armap (abfd);
1114 #else
1115 bfd_set_error (bfd_error_wrong_format);
1116 return FALSE;
1117 #endif
1118 }
1119 else if (CONST_STRNEQ (nextname, "#1/20 "))
1120 {
1121 /* Mach-O has a special name for armap when the map is sorted by name.
1122 However because this name has a space it is slightly more difficult
1123 to check it. */
1124 struct ar_hdr hdr;
1125 char extname[21];
1126
1127 if (bfd_bread (&hdr, sizeof (hdr), abfd) != sizeof (hdr))
1128 return FALSE;
1129 /* Read the extended name. We know its length. */
1130 if (bfd_bread (extname, 20, abfd) != 20)
1131 return FALSE;
1132 if (bfd_seek (abfd, -(file_ptr) (sizeof (hdr) + 20), SEEK_CUR) != 0)
1133 return FALSE;
1134 if (CONST_STRNEQ (extname, "__.SYMDEF SORTED")
1135 || CONST_STRNEQ (extname, "__.SYMDEF"))
1136 return do_slurp_bsd_armap (abfd);
1137 }
1138
1139 bfd_has_map (abfd) = FALSE;
1140 return TRUE;
1141 }
1142 \f
1143 /* Returns FALSE on error, TRUE otherwise. */
1144 /* Flavor 2 of a bsd armap, similar to bfd_slurp_bsd_armap except the
1145 header is in a slightly different order and the map name is '/'.
1146 This flavour is used by hp300hpux. */
1147
1148 #define HPUX_SYMDEF_COUNT_SIZE 2
1149
1150 bfd_boolean
1151 bfd_slurp_bsd_armap_f2 (bfd *abfd)
1152 {
1153 struct areltdata *mapdata;
1154 char nextname[17];
1155 unsigned int counter;
1156 bfd_byte *raw_armap, *rbase;
1157 struct artdata *ardata = bfd_ardata (abfd);
1158 char *stringbase;
1159 unsigned int stringsize;
1160 unsigned int left;
1161 bfd_size_type amt;
1162 carsym *set;
1163 int i = bfd_bread (nextname, 16, abfd);
1164
1165 if (i == 0)
1166 return TRUE;
1167 if (i != 16)
1168 return FALSE;
1169
1170 /* The archive has at least 16 bytes in it. */
1171 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1172 return FALSE;
1173
1174 if (CONST_STRNEQ (nextname, "__.SYMDEF ")
1175 || CONST_STRNEQ (nextname, "__.SYMDEF/ ")) /* Old Linux archives. */
1176 return do_slurp_bsd_armap (abfd);
1177
1178 if (! CONST_STRNEQ (nextname, "/ "))
1179 {
1180 bfd_has_map (abfd) = FALSE;
1181 return TRUE;
1182 }
1183
1184 mapdata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1185 if (mapdata == NULL)
1186 return FALSE;
1187
1188 if (mapdata->parsed_size < HPUX_SYMDEF_COUNT_SIZE + BSD_STRING_COUNT_SIZE)
1189 {
1190 free (mapdata);
1191 wrong_format:
1192 bfd_set_error (bfd_error_wrong_format);
1193 byebye:
1194 return FALSE;
1195 }
1196 left = mapdata->parsed_size - HPUX_SYMDEF_COUNT_SIZE - BSD_STRING_COUNT_SIZE;
1197
1198 amt = mapdata->parsed_size;
1199 free (mapdata);
1200
1201 raw_armap = (bfd_byte *) bfd_zalloc (abfd, amt);
1202 if (raw_armap == NULL)
1203 goto byebye;
1204
1205 if (bfd_bread (raw_armap, amt, abfd) != amt)
1206 {
1207 if (bfd_get_error () != bfd_error_system_call)
1208 bfd_set_error (bfd_error_malformed_archive);
1209 goto byebye;
1210 }
1211
1212 ardata->symdef_count = H_GET_16 (abfd, raw_armap);
1213
1214 ardata->cache = 0;
1215
1216 stringsize = H_GET_32 (abfd, raw_armap + HPUX_SYMDEF_COUNT_SIZE);
1217 if (stringsize > left)
1218 goto wrong_format;
1219 left -= stringsize;
1220
1221 /* Skip sym count and string sz. */
1222 stringbase = ((char *) raw_armap
1223 + HPUX_SYMDEF_COUNT_SIZE
1224 + BSD_STRING_COUNT_SIZE);
1225 rbase = (bfd_byte *) stringbase + stringsize;
1226 amt = ardata->symdef_count * BSD_SYMDEF_SIZE;
1227 if (amt > left)
1228 goto wrong_format;
1229
1230 ardata->symdefs = (struct carsym *) bfd_alloc (abfd, amt);
1231 if (!ardata->symdefs)
1232 return FALSE;
1233
1234 for (counter = 0, set = ardata->symdefs;
1235 counter < ardata->symdef_count;
1236 counter++, set++, rbase += BSD_SYMDEF_SIZE)
1237 {
1238 set->name = H_GET_32 (abfd, rbase) + stringbase;
1239 set->file_offset = H_GET_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE);
1240 }
1241
1242 ardata->first_file_filepos = bfd_tell (abfd);
1243 /* Pad to an even boundary if you have to. */
1244 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
1245 /* FIXME, we should provide some way to free raw_ardata when
1246 we are done using the strings from it. For now, it seems
1247 to be allocated on an objalloc anyway... */
1248 bfd_has_map (abfd) = TRUE;
1249 return TRUE;
1250 }
1251 \f
1252 /** Extended name table.
1253
1254 Normally archives support only 14-character filenames.
1255
1256 Intel has extended the format: longer names are stored in a special
1257 element (the first in the archive, or second if there is an armap);
1258 the name in the ar_hdr is replaced by <space><index into filename
1259 element>. Index is the P.R. of an int (decimal). Data General have
1260 extended the format by using the prefix // for the special element. */
1261
1262 /* Returns FALSE on error, TRUE otherwise. */
1263
1264 bfd_boolean
1265 _bfd_slurp_extended_name_table (bfd *abfd)
1266 {
1267 char nextname[17];
1268 struct areltdata *namedata;
1269 bfd_size_type amt;
1270
1271 /* FIXME: Formatting sucks here, and in case of failure of BFD_READ,
1272 we probably don't want to return TRUE. */
1273 if (bfd_seek (abfd, bfd_ardata (abfd)->first_file_filepos, SEEK_SET) != 0)
1274 return FALSE;
1275
1276 if (bfd_bread (nextname, 16, abfd) == 16)
1277 {
1278 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1279 return FALSE;
1280
1281 if (! CONST_STRNEQ (nextname, "ARFILENAMES/ ")
1282 && ! CONST_STRNEQ (nextname, "// "))
1283 {
1284 bfd_ardata (abfd)->extended_names = NULL;
1285 bfd_ardata (abfd)->extended_names_size = 0;
1286 return TRUE;
1287 }
1288
1289 namedata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1290 if (namedata == NULL)
1291 return FALSE;
1292
1293 amt = namedata->parsed_size;
1294 if (amt + 1 == 0)
1295 goto byebye;
1296
1297 bfd_ardata (abfd)->extended_names_size = amt;
1298 bfd_ardata (abfd)->extended_names = (char *) bfd_zalloc (abfd, amt + 1);
1299 if (bfd_ardata (abfd)->extended_names == NULL)
1300 {
1301 byebye:
1302 free (namedata);
1303 bfd_ardata (abfd)->extended_names = NULL;
1304 bfd_ardata (abfd)->extended_names_size = 0;
1305 return FALSE;
1306 }
1307
1308 if (bfd_bread (bfd_ardata (abfd)->extended_names, amt, abfd) != amt)
1309 {
1310 if (bfd_get_error () != bfd_error_system_call)
1311 bfd_set_error (bfd_error_malformed_archive);
1312 bfd_release (abfd, (bfd_ardata (abfd)->extended_names));
1313 goto byebye;
1314 }
1315
1316 /* Since the archive is supposed to be printable if it contains
1317 text, the entries in the list are newline-padded, not null
1318 padded. In SVR4-style archives, the names also have a
1319 trailing '/'. DOS/NT created archive often have \ in them
1320 We'll fix all problems here. */
1321 {
1322 char *ext_names = bfd_ardata (abfd)->extended_names;
1323 char *temp = ext_names;
1324 char *limit = temp + namedata->parsed_size;
1325
1326 for (; temp < limit; ++temp)
1327 {
1328 if (*temp == ARFMAG[1])
1329 temp[temp > ext_names && temp[-1] == '/' ? -1 : 0] = '\0';
1330 if (*temp == '\\')
1331 *temp = '/';
1332 }
1333 *limit = '\0';
1334 }
1335
1336 /* Pad to an even boundary if you have to. */
1337 bfd_ardata (abfd)->first_file_filepos = bfd_tell (abfd);
1338 bfd_ardata (abfd)->first_file_filepos +=
1339 (bfd_ardata (abfd)->first_file_filepos) % 2;
1340
1341 free (namedata);
1342 }
1343 return TRUE;
1344 }
1345
1346 #ifdef VMS
1347
1348 /* Return a copy of the stuff in the filename between any :]> and a
1349 semicolon. */
1350
1351 static const char *
1352 normalize (bfd *abfd, const char *file)
1353 {
1354 const char *first;
1355 const char *last;
1356 char *copy;
1357
1358 first = file + strlen (file) - 1;
1359 last = first + 1;
1360
1361 while (first != file)
1362 {
1363 if (*first == ';')
1364 last = first;
1365 if (*first == ':' || *first == ']' || *first == '>')
1366 {
1367 first++;
1368 break;
1369 }
1370 first--;
1371 }
1372
1373 copy = bfd_alloc (abfd, last - first + 1);
1374 if (copy == NULL)
1375 return NULL;
1376
1377 memcpy (copy, first, last - first);
1378 copy[last - first] = 0;
1379
1380 return copy;
1381 }
1382
1383 #else
1384 static const char *
1385 normalize (bfd *abfd ATTRIBUTE_UNUSED, const char *file)
1386 {
1387 return lbasename (file);
1388 }
1389 #endif
1390
1391 /* Adjust a relative path name based on the reference path.
1392 For example:
1393
1394 Relative path Reference path Result
1395 ------------- -------------- ------
1396 bar.o lib.a bar.o
1397 foo/bar.o lib.a foo/bar.o
1398 bar.o foo/lib.a ../bar.o
1399 foo/bar.o baz/lib.a ../foo/bar.o
1400 bar.o ../lib.a <parent of current dir>/bar.o
1401 ; ../bar.o ../lib.a bar.o
1402 ; ../bar.o lib.a ../bar.o
1403 foo/bar.o ../lib.a <parent of current dir>/foo/bar.o
1404 bar.o ../../lib.a <grandparent>/<parent>/bar.o
1405 bar.o foo/baz/lib.a ../../bar.o
1406
1407 Note - the semicolons above are there to prevent the BFD chew
1408 utility from interpreting those lines as prototypes to put into
1409 the autogenerated bfd.h header...
1410
1411 Note - the string is returned in a static buffer. */
1412
1413 static const char *
1414 adjust_relative_path (const char * path, const char * ref_path)
1415 {
1416 static char *pathbuf = NULL;
1417 static unsigned int pathbuf_len = 0;
1418 const char *pathp;
1419 const char *refp;
1420 char * lpath;
1421 char * rpath;
1422 unsigned int len;
1423 unsigned int dir_up = 0;
1424 unsigned int dir_down = 0;
1425 char *newp;
1426 char * pwd = getpwd ();
1427 const char * down;
1428
1429 /* Remove symlinks, '.' and '..' from the paths, if possible. */
1430 lpath = lrealpath (path);
1431 pathp = lpath == NULL ? path : lpath;
1432
1433 rpath = lrealpath (ref_path);
1434 refp = rpath == NULL ? ref_path : rpath;
1435
1436 /* Remove common leading path elements. */
1437 for (;;)
1438 {
1439 const char *e1 = pathp;
1440 const char *e2 = refp;
1441
1442 while (*e1 && ! IS_DIR_SEPARATOR (*e1))
1443 ++e1;
1444 while (*e2 && ! IS_DIR_SEPARATOR (*e2))
1445 ++e2;
1446 if (*e1 == '\0' || *e2 == '\0' || e1 - pathp != e2 - refp
1447 || filename_ncmp (pathp, refp, e1 - pathp) != 0)
1448 break;
1449 pathp = e1 + 1;
1450 refp = e2 + 1;
1451 }
1452
1453 len = strlen (pathp) + 1;
1454 /* For each leading path element in the reference path,
1455 insert "../" into the path. */
1456 for (; *refp; ++refp)
1457 if (IS_DIR_SEPARATOR (*refp))
1458 {
1459 /* PR 12710: If the path element is "../" then instead of
1460 inserting "../" we need to insert the name of the directory
1461 at the current level. */
1462 if (refp > ref_path + 1
1463 && refp[-1] == '.'
1464 && refp[-2] == '.')
1465 dir_down ++;
1466 else
1467 dir_up ++;
1468 }
1469
1470 /* If the lrealpath calls above succeeded then we should never
1471 see dir_up and dir_down both being non-zero. */
1472
1473 len += 3 * dir_up;
1474
1475 if (dir_down)
1476 {
1477 down = pwd + strlen (pwd) - 1;
1478
1479 while (dir_down && down > pwd)
1480 {
1481 if (IS_DIR_SEPARATOR (*down))
1482 --dir_down;
1483 }
1484 BFD_ASSERT (dir_down == 0);
1485 len += strlen (down) + 1;
1486 }
1487 else
1488 down = NULL;
1489
1490 if (len > pathbuf_len)
1491 {
1492 if (pathbuf != NULL)
1493 free (pathbuf);
1494 pathbuf_len = 0;
1495 pathbuf = (char *) bfd_malloc (len);
1496 if (pathbuf == NULL)
1497 goto out;
1498 pathbuf_len = len;
1499 }
1500
1501 newp = pathbuf;
1502 while (dir_up-- > 0)
1503 {
1504 /* FIXME: Support Windows style path separators as well. */
1505 strcpy (newp, "../");
1506 newp += 3;
1507 }
1508
1509 if (down)
1510 sprintf (newp, "%s/%s", down, pathp);
1511 else
1512 strcpy (newp, pathp);
1513
1514 out:
1515 free (lpath);
1516 free (rpath);
1517 return pathbuf;
1518 }
1519
1520 /* Build a BFD style extended name table. */
1521
1522 bfd_boolean
1523 _bfd_archive_bsd_construct_extended_name_table (bfd *abfd,
1524 char **tabloc,
1525 bfd_size_type *tablen,
1526 const char **name)
1527 {
1528 *name = "ARFILENAMES/";
1529 return _bfd_construct_extended_name_table (abfd, FALSE, tabloc, tablen);
1530 }
1531
1532 /* Build an SVR4 style extended name table. */
1533
1534 bfd_boolean
1535 _bfd_archive_coff_construct_extended_name_table (bfd *abfd,
1536 char **tabloc,
1537 bfd_size_type *tablen,
1538 const char **name)
1539 {
1540 *name = "//";
1541 return _bfd_construct_extended_name_table (abfd, TRUE, tabloc, tablen);
1542 }
1543
1544 /* Follows archive_head and produces an extended name table if
1545 necessary. Returns (in tabloc) a pointer to an extended name
1546 table, and in tablen the length of the table. If it makes an entry
1547 it clobbers the filename so that the element may be written without
1548 further massage. Returns TRUE if it ran successfully, FALSE if
1549 something went wrong. A successful return may still involve a
1550 zero-length tablen! */
1551
1552 bfd_boolean
1553 _bfd_construct_extended_name_table (bfd *abfd,
1554 bfd_boolean trailing_slash,
1555 char **tabloc,
1556 bfd_size_type *tablen)
1557 {
1558 unsigned int maxname = ar_maxnamelen (abfd);
1559 bfd_size_type total_namelen = 0;
1560 bfd *current;
1561 char *strptr;
1562 const char *last_filename;
1563 long last_stroff;
1564
1565 *tablen = 0;
1566 last_filename = NULL;
1567
1568 /* Figure out how long the table should be. */
1569 for (current = abfd->archive_head;
1570 current != NULL;
1571 current = current->archive_next)
1572 {
1573 const char *normal;
1574 unsigned int thislen;
1575
1576 if (bfd_is_thin_archive (abfd))
1577 {
1578 const char *filename = current->filename;
1579
1580 /* If the element being added is a member of another archive
1581 (i.e., we are flattening), use the containing archive's name. */
1582 if (current->my_archive
1583 && ! bfd_is_thin_archive (current->my_archive))
1584 filename = current->my_archive->filename;
1585
1586 /* If the path is the same as the previous path seen,
1587 reuse it. This can happen when flattening a thin
1588 archive that contains other archives. */
1589 if (last_filename && filename_cmp (last_filename, filename) == 0)
1590 continue;
1591
1592 last_filename = filename;
1593
1594 /* If the path is relative, adjust it relative to
1595 the containing archive. */
1596 if (! IS_ABSOLUTE_PATH (filename)
1597 && ! IS_ABSOLUTE_PATH (abfd->filename))
1598 normal = adjust_relative_path (filename, abfd->filename);
1599 else
1600 normal = filename;
1601
1602 /* In a thin archive, always store the full pathname
1603 in the extended name table. */
1604 total_namelen += strlen (normal) + 1;
1605 if (trailing_slash)
1606 /* Leave room for trailing slash. */
1607 ++total_namelen;
1608
1609 continue;
1610 }
1611
1612 normal = normalize (current, current->filename);
1613 if (normal == NULL)
1614 return FALSE;
1615
1616 thislen = strlen (normal);
1617
1618 if (thislen > maxname
1619 && (bfd_get_file_flags (abfd) & BFD_TRADITIONAL_FORMAT) != 0)
1620 thislen = maxname;
1621
1622 if (thislen > maxname)
1623 {
1624 /* Add one to leave room for \n. */
1625 total_namelen += thislen + 1;
1626 if (trailing_slash)
1627 {
1628 /* Leave room for trailing slash. */
1629 ++total_namelen;
1630 }
1631 }
1632 else
1633 {
1634 struct ar_hdr *hdr = arch_hdr (current);
1635 if (filename_ncmp (normal, hdr->ar_name, thislen) != 0
1636 || (thislen < sizeof hdr->ar_name
1637 && hdr->ar_name[thislen] != ar_padchar (current)))
1638 {
1639 /* Must have been using extended format even though it
1640 didn't need to. Fix it to use normal format. */
1641 memcpy (hdr->ar_name, normal, thislen);
1642 if (thislen < maxname
1643 || (thislen == maxname && thislen < sizeof hdr->ar_name))
1644 hdr->ar_name[thislen] = ar_padchar (current);
1645 }
1646 }
1647 }
1648
1649 if (total_namelen == 0)
1650 return TRUE;
1651
1652 *tabloc = (char *) bfd_zalloc (abfd, total_namelen);
1653 if (*tabloc == NULL)
1654 return FALSE;
1655
1656 *tablen = total_namelen;
1657 strptr = *tabloc;
1658
1659 last_filename = NULL;
1660 last_stroff = 0;
1661
1662 for (current = abfd->archive_head;
1663 current != NULL;
1664 current = current->archive_next)
1665 {
1666 const char *normal;
1667 unsigned int thislen;
1668 long stroff;
1669 const char *filename = current->filename;
1670
1671 if (bfd_is_thin_archive (abfd))
1672 {
1673 /* If the element being added is a member of another archive
1674 (i.e., we are flattening), use the containing archive's name. */
1675 if (current->my_archive
1676 && ! bfd_is_thin_archive (current->my_archive))
1677 filename = current->my_archive->filename;
1678 /* If the path is the same as the previous path seen,
1679 reuse it. This can happen when flattening a thin
1680 archive that contains other archives.
1681 If the path is relative, adjust it relative to
1682 the containing archive. */
1683 if (last_filename && filename_cmp (last_filename, filename) == 0)
1684 normal = last_filename;
1685 else if (! IS_ABSOLUTE_PATH (filename)
1686 && ! IS_ABSOLUTE_PATH (abfd->filename))
1687 normal = adjust_relative_path (filename, abfd->filename);
1688 else
1689 normal = filename;
1690 }
1691 else
1692 {
1693 normal = normalize (current, filename);
1694 if (normal == NULL)
1695 return FALSE;
1696 }
1697
1698 thislen = strlen (normal);
1699 if (thislen > maxname || bfd_is_thin_archive (abfd))
1700 {
1701 /* Works for now; may need to be re-engineered if we
1702 encounter an oddball archive format and want to
1703 generalise this hack. */
1704 struct ar_hdr *hdr = arch_hdr (current);
1705 if (normal == last_filename)
1706 stroff = last_stroff;
1707 else
1708 {
1709 strcpy (strptr, normal);
1710 if (! trailing_slash)
1711 strptr[thislen] = ARFMAG[1];
1712 else
1713 {
1714 strptr[thislen] = '/';
1715 strptr[thislen + 1] = ARFMAG[1];
1716 }
1717 stroff = strptr - *tabloc;
1718 last_stroff = stroff;
1719 }
1720 hdr->ar_name[0] = ar_padchar (current);
1721 if (bfd_is_thin_archive (abfd) && current->origin > 0)
1722 {
1723 int len = snprintf (hdr->ar_name + 1, maxname - 1, "%-ld:",
1724 stroff);
1725 _bfd_ar_spacepad (hdr->ar_name + 1 + len, maxname - 1 - len,
1726 "%-ld",
1727 current->origin - sizeof (struct ar_hdr));
1728 }
1729 else
1730 _bfd_ar_spacepad (hdr->ar_name + 1, maxname - 1, "%-ld", stroff);
1731 if (normal != last_filename)
1732 {
1733 strptr += thislen + 1;
1734 if (trailing_slash)
1735 ++strptr;
1736 last_filename = filename;
1737 }
1738 }
1739 }
1740
1741 return TRUE;
1742 }
1743
1744 /* Do not construct an extended name table but transforms name field into
1745 its extended form. */
1746
1747 bfd_boolean
1748 _bfd_archive_bsd44_construct_extended_name_table (bfd *abfd,
1749 char **tabloc,
1750 bfd_size_type *tablen,
1751 const char **name)
1752 {
1753 unsigned int maxname = ar_maxnamelen (abfd);
1754 bfd *current;
1755
1756 *tablen = 0;
1757 *tabloc = NULL;
1758 *name = NULL;
1759
1760 for (current = abfd->archive_head;
1761 current != NULL;
1762 current = current->archive_next)
1763 {
1764 const char *normal = normalize (current, current->filename);
1765 int has_space = 0;
1766 unsigned int len;
1767
1768 if (normal == NULL)
1769 return FALSE;
1770
1771 for (len = 0; normal[len]; len++)
1772 if (normal[len] == ' ')
1773 has_space = 1;
1774
1775 if (len > maxname || has_space)
1776 {
1777 struct ar_hdr *hdr = arch_hdr (current);
1778
1779 len = (len + 3) & ~3;
1780 arch_eltdata (current)->extra_size = len;
1781 _bfd_ar_spacepad (hdr->ar_name, maxname, "#1/%lu", len);
1782 }
1783 }
1784
1785 return TRUE;
1786 }
1787 \f
1788 /* Write an archive header. */
1789
1790 bfd_boolean
1791 _bfd_generic_write_ar_hdr (bfd *archive, bfd *abfd)
1792 {
1793 struct ar_hdr *hdr = arch_hdr (abfd);
1794
1795 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1796 return FALSE;
1797 return TRUE;
1798 }
1799
1800 /* Write an archive header using BSD4.4 convention. */
1801
1802 bfd_boolean
1803 _bfd_bsd44_write_ar_hdr (bfd *archive, bfd *abfd)
1804 {
1805 struct ar_hdr *hdr = arch_hdr (abfd);
1806
1807 if (is_bsd44_extended_name (hdr->ar_name))
1808 {
1809 /* This is a BSD 4.4 extended name. */
1810 const char *fullname = normalize (abfd, abfd->filename);
1811 unsigned int len = strlen (fullname);
1812 unsigned int padded_len = (len + 3) & ~3;
1813
1814 BFD_ASSERT (padded_len == arch_eltdata (abfd)->extra_size);
1815
1816 if (!_bfd_ar_sizepad (hdr->ar_size, sizeof (hdr->ar_size),
1817 arch_eltdata (abfd)->parsed_size + padded_len))
1818 return FALSE;
1819
1820 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1821 return FALSE;
1822
1823 if (bfd_bwrite (fullname, len, archive) != len)
1824 return FALSE;
1825
1826 if (len & 3)
1827 {
1828 static const char pad[3] = { 0, 0, 0 };
1829
1830 len = 4 - (len & 3);
1831 if (bfd_bwrite (pad, len, archive) != len)
1832 return FALSE;
1833 }
1834 }
1835 else
1836 {
1837 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1838 return FALSE;
1839 }
1840 return TRUE;
1841 }
1842 \f
1843 /* A couple of functions for creating ar_hdrs. */
1844
1845 #ifdef HPUX_LARGE_AR_IDS
1846 /* Function to encode large UID/GID values according to HP. */
1847
1848 static void
1849 hpux_uid_gid_encode (char str[6], long int id)
1850 {
1851 int cnt;
1852
1853 str[5] = '@' + (id & 3);
1854 id >>= 2;
1855
1856 for (cnt = 4; cnt >= 0; --cnt, id >>= 6)
1857 str[cnt] = ' ' + (id & 0x3f);
1858 }
1859 #endif /* HPUX_LARGE_AR_IDS */
1860
1861 #ifndef HAVE_GETUID
1862 #define getuid() 0
1863 #endif
1864
1865 #ifndef HAVE_GETGID
1866 #define getgid() 0
1867 #endif
1868
1869 /* Takes a filename, returns an arelt_data for it, or NULL if it can't
1870 make one. The filename must refer to a filename in the filesystem.
1871 The filename field of the ar_hdr will NOT be initialized. If member
1872 is set, and it's an in-memory bfd, we fake it. */
1873
1874 static struct areltdata *
1875 bfd_ar_hdr_from_filesystem (bfd *abfd, const char *filename, bfd *member)
1876 {
1877 struct stat status;
1878 struct areltdata *ared;
1879 struct ar_hdr *hdr;
1880 bfd_size_type amt;
1881
1882 if (member && (member->flags & BFD_IN_MEMORY) != 0)
1883 {
1884 /* Assume we just "made" the member, and fake it. */
1885 struct bfd_in_memory *bim = (struct bfd_in_memory *) member->iostream;
1886 time (&status.st_mtime);
1887 status.st_uid = getuid ();
1888 status.st_gid = getgid ();
1889 status.st_mode = 0644;
1890 status.st_size = bim->size;
1891 }
1892 else if (stat (filename, &status) != 0)
1893 {
1894 bfd_set_error (bfd_error_system_call);
1895 return NULL;
1896 }
1897
1898 /* If the caller requested that the BFD generate deterministic output,
1899 fake values for modification time, UID, GID, and file mode. */
1900 if ((abfd->flags & BFD_DETERMINISTIC_OUTPUT) != 0)
1901 {
1902 status.st_mtime = 0;
1903 status.st_uid = 0;
1904 status.st_gid = 0;
1905 status.st_mode = 0644;
1906 }
1907
1908 amt = sizeof (struct ar_hdr) + sizeof (struct areltdata);
1909 ared = (struct areltdata *) bfd_zmalloc (amt);
1910 if (ared == NULL)
1911 return NULL;
1912 hdr = (struct ar_hdr *) (((char *) ared) + sizeof (struct areltdata));
1913
1914 /* ar headers are space padded, not null padded! */
1915 memset (hdr, ' ', sizeof (struct ar_hdr));
1916
1917 _bfd_ar_spacepad (hdr->ar_date, sizeof (hdr->ar_date), "%-12ld",
1918 status.st_mtime);
1919 #ifdef HPUX_LARGE_AR_IDS
1920 /* HP has a very "special" way to handle UID/GID's with numeric values
1921 > 99999. */
1922 if (status.st_uid > 99999)
1923 hpux_uid_gid_encode (hdr->ar_uid, (long) status.st_uid);
1924 else
1925 #endif
1926 _bfd_ar_spacepad (hdr->ar_uid, sizeof (hdr->ar_uid), "%ld",
1927 status.st_uid);
1928 #ifdef HPUX_LARGE_AR_IDS
1929 /* HP has a very "special" way to handle UID/GID's with numeric values
1930 > 99999. */
1931 if (status.st_gid > 99999)
1932 hpux_uid_gid_encode (hdr->ar_gid, (long) status.st_gid);
1933 else
1934 #endif
1935 _bfd_ar_spacepad (hdr->ar_gid, sizeof (hdr->ar_gid), "%ld",
1936 status.st_gid);
1937 _bfd_ar_spacepad (hdr->ar_mode, sizeof (hdr->ar_mode), "%-8lo",
1938 status.st_mode);
1939 if (!_bfd_ar_sizepad (hdr->ar_size, sizeof (hdr->ar_size), status.st_size))
1940 {
1941 free (ared);
1942 return NULL;
1943 }
1944 memcpy (hdr->ar_fmag, ARFMAG, 2);
1945 ared->parsed_size = status.st_size;
1946 ared->arch_header = (char *) hdr;
1947
1948 return ared;
1949 }
1950
1951 /* Analogous to stat call. */
1952
1953 int
1954 bfd_generic_stat_arch_elt (bfd *abfd, struct stat *buf)
1955 {
1956 struct ar_hdr *hdr;
1957 char *aloser;
1958
1959 if (abfd->arelt_data == NULL)
1960 {
1961 bfd_set_error (bfd_error_invalid_operation);
1962 return -1;
1963 }
1964
1965 hdr = arch_hdr (abfd);
1966
1967 #define foo(arelt, stelt, size) \
1968 buf->stelt = strtol (hdr->arelt, &aloser, size); \
1969 if (aloser == hdr->arelt) \
1970 return -1;
1971
1972 /* Some platforms support special notations for large IDs. */
1973 #ifdef HPUX_LARGE_AR_IDS
1974 # define foo2(arelt, stelt, size) \
1975 if (hdr->arelt[5] == ' ') \
1976 { \
1977 foo (arelt, stelt, size); \
1978 } \
1979 else \
1980 { \
1981 int cnt; \
1982 for (buf->stelt = cnt = 0; cnt < 5; ++cnt) \
1983 { \
1984 if (hdr->arelt[cnt] < ' ' || hdr->arelt[cnt] > ' ' + 0x3f) \
1985 return -1; \
1986 buf->stelt <<= 6; \
1987 buf->stelt += hdr->arelt[cnt] - ' '; \
1988 } \
1989 if (hdr->arelt[5] < '@' || hdr->arelt[5] > '@' + 3) \
1990 return -1; \
1991 buf->stelt <<= 2; \
1992 buf->stelt += hdr->arelt[5] - '@'; \
1993 }
1994 #else
1995 # define foo2(arelt, stelt, size) foo (arelt, stelt, size)
1996 #endif
1997
1998 foo (ar_date, st_mtime, 10);
1999 foo2 (ar_uid, st_uid, 10);
2000 foo2 (ar_gid, st_gid, 10);
2001 foo (ar_mode, st_mode, 8);
2002
2003 buf->st_size = arch_eltdata (abfd)->parsed_size;
2004
2005 return 0;
2006 }
2007
2008 void
2009 bfd_dont_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2010 {
2011 /* FIXME: This interacts unpleasantly with ar's quick-append option.
2012 Fortunately ic960 users will never use that option. Fixing this
2013 is very hard; fortunately I know how to do it and will do so once
2014 intel's release is out the door. */
2015
2016 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2017 size_t length;
2018 const char *filename;
2019 size_t maxlen = ar_maxnamelen (abfd);
2020
2021 if ((bfd_get_file_flags (abfd) & BFD_TRADITIONAL_FORMAT) != 0)
2022 {
2023 bfd_bsd_truncate_arname (abfd, pathname, arhdr);
2024 return;
2025 }
2026
2027 filename = normalize (abfd, pathname);
2028 if (filename == NULL)
2029 {
2030 /* FIXME */
2031 abort ();
2032 }
2033
2034 length = strlen (filename);
2035
2036 if (length <= maxlen)
2037 memcpy (hdr->ar_name, filename, length);
2038
2039 /* Add the padding character if there is room for it. */
2040 if (length < maxlen
2041 || (length == maxlen && length < sizeof hdr->ar_name))
2042 (hdr->ar_name)[length] = ar_padchar (abfd);
2043 }
2044
2045 void
2046 bfd_bsd_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2047 {
2048 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2049 size_t length;
2050 const char *filename = lbasename (pathname);
2051 size_t maxlen = ar_maxnamelen (abfd);
2052
2053 length = strlen (filename);
2054
2055 if (length <= maxlen)
2056 memcpy (hdr->ar_name, filename, length);
2057 else
2058 {
2059 /* pathname: meet procrustes */
2060 memcpy (hdr->ar_name, filename, maxlen);
2061 length = maxlen;
2062 }
2063
2064 if (length < maxlen)
2065 (hdr->ar_name)[length] = ar_padchar (abfd);
2066 }
2067
2068 /* Store name into ar header. Truncates the name to fit.
2069 1> strip pathname to be just the basename.
2070 2> if it's short enuf to fit, stuff it in.
2071 3> If it doesn't end with .o, truncate it to fit
2072 4> truncate it before the .o, append .o, stuff THAT in. */
2073
2074 /* This is what gnu ar does. It's better but incompatible with the
2075 bsd ar. */
2076
2077 void
2078 bfd_gnu_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2079 {
2080 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2081 size_t length;
2082 const char *filename = lbasename (pathname);
2083 size_t maxlen = ar_maxnamelen (abfd);
2084
2085 length = strlen (filename);
2086
2087 if (length <= maxlen)
2088 memcpy (hdr->ar_name, filename, length);
2089 else
2090 {
2091 /* pathname: meet procrustes. */
2092 memcpy (hdr->ar_name, filename, maxlen);
2093 if ((filename[length - 2] == '.') && (filename[length - 1] == 'o'))
2094 {
2095 hdr->ar_name[maxlen - 2] = '.';
2096 hdr->ar_name[maxlen - 1] = 'o';
2097 }
2098 length = maxlen;
2099 }
2100
2101 if (length < 16)
2102 (hdr->ar_name)[length] = ar_padchar (abfd);
2103 }
2104 \f
2105 /* The BFD is open for write and has its format set to bfd_archive. */
2106
2107 bfd_boolean
2108 _bfd_write_archive_contents (bfd *arch)
2109 {
2110 bfd *current;
2111 char *etable = NULL;
2112 bfd_size_type elength = 0;
2113 const char *ename = NULL;
2114 bfd_boolean makemap = bfd_has_map (arch);
2115 /* If no .o's, don't bother to make a map. */
2116 bfd_boolean hasobjects = FALSE;
2117 bfd_size_type wrote;
2118 int tries;
2119 char *armag;
2120
2121 /* Verify the viability of all entries; if any of them live in the
2122 filesystem (as opposed to living in an archive open for input)
2123 then construct a fresh ar_hdr for them. */
2124 for (current = arch->archive_head;
2125 current != NULL;
2126 current = current->archive_next)
2127 {
2128 /* This check is checking the bfds for the objects we're reading
2129 from (which are usually either an object file or archive on
2130 disk), not the archive entries we're writing to. We don't
2131 actually create bfds for the archive members, we just copy
2132 them byte-wise when we write out the archive. */
2133 if (bfd_write_p (current))
2134 {
2135 bfd_set_error (bfd_error_invalid_operation);
2136 goto input_err;
2137 }
2138 if (!current->arelt_data)
2139 {
2140 current->arelt_data =
2141 bfd_ar_hdr_from_filesystem (arch, current->filename, current);
2142 if (!current->arelt_data)
2143 goto input_err;
2144
2145 /* Put in the file name. */
2146 BFD_SEND (arch, _bfd_truncate_arname,
2147 (arch, current->filename, (char *) arch_hdr (current)));
2148 }
2149
2150 if (makemap && ! hasobjects)
2151 { /* Don't bother if we won't make a map! */
2152 if ((bfd_check_format (current, bfd_object)))
2153 hasobjects = TRUE;
2154 }
2155 }
2156
2157 if (!BFD_SEND (arch, _bfd_construct_extended_name_table,
2158 (arch, &etable, &elength, &ename)))
2159 return FALSE;
2160
2161 if (bfd_seek (arch, (file_ptr) 0, SEEK_SET) != 0)
2162 return FALSE;
2163 armag = ARMAG;
2164 if (bfd_is_thin_archive (arch))
2165 armag = ARMAGT;
2166 wrote = bfd_bwrite (armag, SARMAG, arch);
2167 if (wrote != SARMAG)
2168 return FALSE;
2169
2170 if (makemap && hasobjects)
2171 {
2172 if (! _bfd_compute_and_write_armap (arch, (unsigned int) elength))
2173 return FALSE;
2174 }
2175
2176 if (elength != 0)
2177 {
2178 struct ar_hdr hdr;
2179
2180 memset (&hdr, ' ', sizeof (struct ar_hdr));
2181 memcpy (hdr.ar_name, ename, strlen (ename));
2182 /* Round size up to even number in archive header. */
2183 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size),
2184 (elength + 1) & ~(bfd_size_type) 1))
2185 return FALSE;
2186 memcpy (hdr.ar_fmag, ARFMAG, 2);
2187 if ((bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2188 != sizeof (struct ar_hdr))
2189 || bfd_bwrite (etable, elength, arch) != elength)
2190 return FALSE;
2191 if ((elength % 2) == 1)
2192 {
2193 if (bfd_bwrite (&ARFMAG[1], 1, arch) != 1)
2194 return FALSE;
2195 }
2196 }
2197
2198 for (current = arch->archive_head;
2199 current != NULL;
2200 current = current->archive_next)
2201 {
2202 char buffer[DEFAULT_BUFFERSIZE];
2203 bfd_size_type remaining = arelt_size (current);
2204
2205 /* Write ar header. */
2206 if (!_bfd_write_ar_hdr (arch, current))
2207 return FALSE;
2208 if (bfd_is_thin_archive (arch))
2209 continue;
2210 if (bfd_seek (current, (file_ptr) 0, SEEK_SET) != 0)
2211 goto input_err;
2212
2213 while (remaining)
2214 {
2215 unsigned int amt = DEFAULT_BUFFERSIZE;
2216
2217 if (amt > remaining)
2218 amt = remaining;
2219 errno = 0;
2220 if (bfd_bread (buffer, amt, current) != amt)
2221 {
2222 if (bfd_get_error () != bfd_error_system_call)
2223 bfd_set_error (bfd_error_file_truncated);
2224 goto input_err;
2225 }
2226 if (bfd_bwrite (buffer, amt, arch) != amt)
2227 return FALSE;
2228 remaining -= amt;
2229 }
2230
2231 if ((arelt_size (current) % 2) == 1)
2232 {
2233 if (bfd_bwrite (&ARFMAG[1], 1, arch) != 1)
2234 return FALSE;
2235 }
2236 }
2237
2238 if (makemap && hasobjects)
2239 {
2240 /* Verify the timestamp in the archive file. If it would not be
2241 accepted by the linker, rewrite it until it would be. If
2242 anything odd happens, break out and just return. (The
2243 Berkeley linker checks the timestamp and refuses to read the
2244 table-of-contents if it is >60 seconds less than the file's
2245 modified-time. That painful hack requires this painful hack. */
2246 tries = 1;
2247 do
2248 {
2249 if (bfd_update_armap_timestamp (arch))
2250 break;
2251 (*_bfd_error_handler)
2252 (_("Warning: writing archive was slow: rewriting timestamp\n"));
2253 }
2254 while (++tries < 6);
2255 }
2256
2257 return TRUE;
2258
2259 input_err:
2260 bfd_set_error (bfd_error_on_input, current, bfd_get_error ());
2261 return FALSE;
2262 }
2263 \f
2264 /* Note that the namidx for the first symbol is 0. */
2265
2266 bfd_boolean
2267 _bfd_compute_and_write_armap (bfd *arch, unsigned int elength)
2268 {
2269 char *first_name = NULL;
2270 bfd *current;
2271 file_ptr elt_no = 0;
2272 struct orl *map = NULL;
2273 unsigned int orl_max = 1024; /* Fine initial default. */
2274 unsigned int orl_count = 0;
2275 int stridx = 0;
2276 asymbol **syms = NULL;
2277 long syms_max = 0;
2278 bfd_boolean ret;
2279 bfd_size_type amt;
2280
2281 /* Dunno if this is the best place for this info... */
2282 if (elength != 0)
2283 elength += sizeof (struct ar_hdr);
2284 elength += elength % 2;
2285
2286 amt = orl_max * sizeof (struct orl);
2287 map = (struct orl *) bfd_malloc (amt);
2288 if (map == NULL)
2289 goto error_return;
2290
2291 /* We put the symbol names on the arch objalloc, and then discard
2292 them when done. */
2293 first_name = (char *) bfd_alloc (arch, 1);
2294 if (first_name == NULL)
2295 goto error_return;
2296
2297 /* Drop all the files called __.SYMDEF, we're going to make our own. */
2298 while (arch->archive_head
2299 && strcmp (arch->archive_head->filename, "__.SYMDEF") == 0)
2300 arch->archive_head = arch->archive_head->archive_next;
2301
2302 /* Map over each element. */
2303 for (current = arch->archive_head;
2304 current != NULL;
2305 current = current->archive_next, elt_no++)
2306 {
2307 if (bfd_check_format (current, bfd_object)
2308 && (bfd_get_file_flags (current) & HAS_SYMS) != 0)
2309 {
2310 long storage;
2311 long symcount;
2312 long src_count;
2313
2314 storage = bfd_get_symtab_upper_bound (current);
2315 if (storage < 0)
2316 goto error_return;
2317
2318 if (storage != 0)
2319 {
2320 if (storage > syms_max)
2321 {
2322 if (syms_max > 0)
2323 free (syms);
2324 syms_max = storage;
2325 syms = (asymbol **) bfd_malloc (syms_max);
2326 if (syms == NULL)
2327 goto error_return;
2328 }
2329 symcount = bfd_canonicalize_symtab (current, syms);
2330 if (symcount < 0)
2331 goto error_return;
2332
2333 /* Now map over all the symbols, picking out the ones we
2334 want. */
2335 for (src_count = 0; src_count < symcount; src_count++)
2336 {
2337 flagword flags = (syms[src_count])->flags;
2338 asection *sec = syms[src_count]->section;
2339
2340 if (((flags & (BSF_GLOBAL
2341 | BSF_WEAK
2342 | BSF_INDIRECT
2343 | BSF_GNU_UNIQUE)) != 0
2344 || bfd_is_com_section (sec))
2345 && ! bfd_is_und_section (sec))
2346 {
2347 bfd_size_type namelen;
2348 struct orl *new_map;
2349
2350 /* This symbol will go into the archive header. */
2351 if (orl_count == orl_max)
2352 {
2353 orl_max *= 2;
2354 amt = orl_max * sizeof (struct orl);
2355 new_map = (struct orl *) bfd_realloc (map, amt);
2356 if (new_map == NULL)
2357 goto error_return;
2358
2359 map = new_map;
2360 }
2361
2362 if (strcmp (syms[src_count]->name, "__gnu_lto_slim") == 0)
2363 (*_bfd_error_handler)
2364 (_("%s: plugin needed to handle lto object"),
2365 bfd_get_filename (current));
2366 namelen = strlen (syms[src_count]->name);
2367 amt = sizeof (char *);
2368 map[orl_count].name = (char **) bfd_alloc (arch, amt);
2369 if (map[orl_count].name == NULL)
2370 goto error_return;
2371 *(map[orl_count].name) = (char *) bfd_alloc (arch,
2372 namelen + 1);
2373 if (*(map[orl_count].name) == NULL)
2374 goto error_return;
2375 strcpy (*(map[orl_count].name), syms[src_count]->name);
2376 map[orl_count].u.abfd = current;
2377 map[orl_count].namidx = stridx;
2378
2379 stridx += namelen + 1;
2380 ++orl_count;
2381 }
2382 }
2383 }
2384
2385 /* Now ask the BFD to free up any cached information, so we
2386 don't fill all of memory with symbol tables. */
2387 if (! bfd_free_cached_info (current))
2388 goto error_return;
2389 }
2390 }
2391
2392 /* OK, now we have collected all the data, let's write them out. */
2393 ret = BFD_SEND (arch, write_armap,
2394 (arch, elength, map, orl_count, stridx));
2395
2396 if (syms_max > 0)
2397 free (syms);
2398 if (map != NULL)
2399 free (map);
2400 if (first_name != NULL)
2401 bfd_release (arch, first_name);
2402
2403 return ret;
2404
2405 error_return:
2406 if (syms_max > 0)
2407 free (syms);
2408 if (map != NULL)
2409 free (map);
2410 if (first_name != NULL)
2411 bfd_release (arch, first_name);
2412
2413 return FALSE;
2414 }
2415
2416 bfd_boolean
2417 bsd_write_armap (bfd *arch,
2418 unsigned int elength,
2419 struct orl *map,
2420 unsigned int orl_count,
2421 int stridx)
2422 {
2423 int padit = stridx & 1;
2424 unsigned int ranlibsize = orl_count * BSD_SYMDEF_SIZE;
2425 unsigned int stringsize = stridx + padit;
2426 /* Include 8 bytes to store ranlibsize and stringsize in output. */
2427 unsigned int mapsize = ranlibsize + stringsize + 8;
2428 file_ptr firstreal;
2429 bfd *current = arch->archive_head;
2430 bfd *last_elt = current; /* Last element arch seen. */
2431 bfd_byte temp[4];
2432 unsigned int count;
2433 struct ar_hdr hdr;
2434 long uid, gid;
2435
2436 firstreal = mapsize + elength + sizeof (struct ar_hdr) + SARMAG;
2437
2438 /* If deterministic, we use 0 as the timestamp in the map.
2439 Some linkers may require that the archive filesystem modification
2440 time is less than (or near to) the archive map timestamp. Those
2441 linkers should not be used with deterministic mode. (GNU ld and
2442 Gold do not have this restriction.) */
2443 bfd_ardata (arch)->armap_timestamp = 0;
2444 uid = 0;
2445 gid = 0;
2446 if ((arch->flags & BFD_DETERMINISTIC_OUTPUT) == 0)
2447 {
2448 struct stat statbuf;
2449
2450 if (stat (arch->filename, &statbuf) == 0)
2451 bfd_ardata (arch)->armap_timestamp = (statbuf.st_mtime
2452 + ARMAP_TIME_OFFSET);
2453 uid = getuid();
2454 gid = getgid();
2455 }
2456
2457 memset (&hdr, ' ', sizeof (struct ar_hdr));
2458 memcpy (hdr.ar_name, RANLIBMAG, strlen (RANLIBMAG));
2459 bfd_ardata (arch)->armap_datepos = (SARMAG
2460 + offsetof (struct ar_hdr, ar_date[0]));
2461 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2462 bfd_ardata (arch)->armap_timestamp);
2463 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld", uid);
2464 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld", gid);
2465 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size), mapsize))
2466 return FALSE;
2467 memcpy (hdr.ar_fmag, ARFMAG, 2);
2468 if (bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2469 != sizeof (struct ar_hdr))
2470 return FALSE;
2471 H_PUT_32 (arch, ranlibsize, temp);
2472 if (bfd_bwrite (temp, sizeof (temp), arch) != sizeof (temp))
2473 return FALSE;
2474
2475 for (count = 0; count < orl_count; count++)
2476 {
2477 unsigned int offset;
2478 bfd_byte buf[BSD_SYMDEF_SIZE];
2479
2480 if (map[count].u.abfd != last_elt)
2481 {
2482 do
2483 {
2484 struct areltdata *ared = arch_eltdata (current);
2485
2486 firstreal += (ared->parsed_size + ared->extra_size
2487 + sizeof (struct ar_hdr));
2488 firstreal += firstreal % 2;
2489 current = current->archive_next;
2490 }
2491 while (current != map[count].u.abfd);
2492 }
2493
2494 /* The archive file format only has 4 bytes to store the offset
2495 of the member. Check to make sure that firstreal has not grown
2496 too big. */
2497 offset = (unsigned int) firstreal;
2498 if (firstreal != (file_ptr) offset)
2499 {
2500 bfd_set_error (bfd_error_file_truncated);
2501 return FALSE;
2502 }
2503
2504 last_elt = current;
2505 H_PUT_32 (arch, map[count].namidx, buf);
2506 H_PUT_32 (arch, firstreal, buf + BSD_SYMDEF_OFFSET_SIZE);
2507 if (bfd_bwrite (buf, BSD_SYMDEF_SIZE, arch)
2508 != BSD_SYMDEF_SIZE)
2509 return FALSE;
2510 }
2511
2512 /* Now write the strings themselves. */
2513 H_PUT_32 (arch, stringsize, temp);
2514 if (bfd_bwrite (temp, sizeof (temp), arch) != sizeof (temp))
2515 return FALSE;
2516 for (count = 0; count < orl_count; count++)
2517 {
2518 size_t len = strlen (*map[count].name) + 1;
2519
2520 if (bfd_bwrite (*map[count].name, len, arch) != len)
2521 return FALSE;
2522 }
2523
2524 /* The spec sez this should be a newline. But in order to be
2525 bug-compatible for sun's ar we use a null. */
2526 if (padit)
2527 {
2528 if (bfd_bwrite ("", 1, arch) != 1)
2529 return FALSE;
2530 }
2531
2532 return TRUE;
2533 }
2534
2535 /* At the end of archive file handling, update the timestamp in the
2536 file, so the linker will accept it.
2537
2538 Return TRUE if the timestamp was OK, or an unusual problem happened.
2539 Return FALSE if we updated the timestamp. */
2540
2541 bfd_boolean
2542 _bfd_archive_bsd_update_armap_timestamp (bfd *arch)
2543 {
2544 struct stat archstat;
2545 struct ar_hdr hdr;
2546
2547 /* If creating deterministic archives, just leave the timestamp as-is. */
2548 if ((arch->flags & BFD_DETERMINISTIC_OUTPUT) != 0)
2549 return TRUE;
2550
2551 /* Flush writes, get last-write timestamp from file, and compare it
2552 to the timestamp IN the file. */
2553 bfd_flush (arch);
2554 if (bfd_stat (arch, &archstat) == -1)
2555 {
2556 bfd_perror (_("Reading archive file mod timestamp"));
2557
2558 /* Can't read mod time for some reason. */
2559 return TRUE;
2560 }
2561 if (((long) archstat.st_mtime) <= bfd_ardata (arch)->armap_timestamp)
2562 /* OK by the linker's rules. */
2563 return TRUE;
2564
2565 /* Update the timestamp. */
2566 bfd_ardata (arch)->armap_timestamp = archstat.st_mtime + ARMAP_TIME_OFFSET;
2567
2568 /* Prepare an ASCII version suitable for writing. */
2569 memset (hdr.ar_date, ' ', sizeof (hdr.ar_date));
2570 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2571 bfd_ardata (arch)->armap_timestamp);
2572
2573 /* Write it into the file. */
2574 bfd_ardata (arch)->armap_datepos = (SARMAG
2575 + offsetof (struct ar_hdr, ar_date[0]));
2576 if (bfd_seek (arch, bfd_ardata (arch)->armap_datepos, SEEK_SET) != 0
2577 || (bfd_bwrite (hdr.ar_date, sizeof (hdr.ar_date), arch)
2578 != sizeof (hdr.ar_date)))
2579 {
2580 bfd_perror (_("Writing updated armap timestamp"));
2581
2582 /* Some error while writing. */
2583 return TRUE;
2584 }
2585
2586 /* We updated the timestamp successfully. */
2587 return FALSE;
2588 }
2589 \f
2590 /* A coff armap looks like :
2591 lARMAG
2592 struct ar_hdr with name = '/'
2593 number of symbols
2594 offset of file for symbol 0
2595 offset of file for symbol 1
2596
2597 offset of file for symbol n-1
2598 symbol name 0
2599 symbol name 1
2600
2601 symbol name n-1 */
2602
2603 bfd_boolean
2604 coff_write_armap (bfd *arch,
2605 unsigned int elength,
2606 struct orl *map,
2607 unsigned int symbol_count,
2608 int stridx)
2609 {
2610 /* The size of the ranlib is the number of exported symbols in the
2611 archive * the number of bytes in an int, + an int for the count. */
2612 unsigned int ranlibsize = (symbol_count * 4) + 4;
2613 unsigned int stringsize = stridx;
2614 unsigned int mapsize = stringsize + ranlibsize;
2615 file_ptr archive_member_file_ptr;
2616 bfd *current = arch->archive_head;
2617 unsigned int count;
2618 struct ar_hdr hdr;
2619 int padit = mapsize & 1;
2620
2621 if (padit)
2622 mapsize++;
2623
2624 /* Work out where the first object file will go in the archive. */
2625 archive_member_file_ptr = (mapsize
2626 + elength
2627 + sizeof (struct ar_hdr)
2628 + SARMAG);
2629
2630 memset (&hdr, ' ', sizeof (struct ar_hdr));
2631 hdr.ar_name[0] = '/';
2632 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size), mapsize))
2633 return FALSE;
2634 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2635 ((arch->flags & BFD_DETERMINISTIC_OUTPUT) == 0
2636 ? time (NULL) : 0));
2637 /* This, at least, is what Intel coff sets the values to. */
2638 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld", 0);
2639 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld", 0);
2640 _bfd_ar_spacepad (hdr.ar_mode, sizeof (hdr.ar_mode), "%-7lo", 0);
2641 memcpy (hdr.ar_fmag, ARFMAG, 2);
2642
2643 /* Write the ar header for this item and the number of symbols. */
2644 if (bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2645 != sizeof (struct ar_hdr))
2646 return FALSE;
2647
2648 if (!bfd_write_bigendian_4byte_int (arch, symbol_count))
2649 return FALSE;
2650
2651 /* Two passes, first write the file offsets for each symbol -
2652 remembering that each offset is on a two byte boundary. */
2653
2654 /* Write out the file offset for the file associated with each
2655 symbol, and remember to keep the offsets padded out. */
2656
2657 current = arch->archive_head;
2658 count = 0;
2659 while (current != NULL && count < symbol_count)
2660 {
2661 /* For each symbol which is used defined in this object, write
2662 out the object file's address in the archive. */
2663
2664 while (count < symbol_count && map[count].u.abfd == current)
2665 {
2666 unsigned int offset = (unsigned int) archive_member_file_ptr;
2667
2668 /* Catch an attempt to grow an archive past its 4Gb limit. */
2669 if (archive_member_file_ptr != (file_ptr) offset)
2670 {
2671 bfd_set_error (bfd_error_file_truncated);
2672 return FALSE;
2673 }
2674 if (!bfd_write_bigendian_4byte_int (arch, offset))
2675 return FALSE;
2676 count++;
2677 }
2678 archive_member_file_ptr += sizeof (struct ar_hdr);
2679 if (! bfd_is_thin_archive (arch))
2680 {
2681 /* Add size of this archive entry. */
2682 archive_member_file_ptr += arelt_size (current);
2683 /* Remember about the even alignment. */
2684 archive_member_file_ptr += archive_member_file_ptr % 2;
2685 }
2686 current = current->archive_next;
2687 }
2688
2689 /* Now write the strings themselves. */
2690 for (count = 0; count < symbol_count; count++)
2691 {
2692 size_t len = strlen (*map[count].name) + 1;
2693
2694 if (bfd_bwrite (*map[count].name, len, arch) != len)
2695 return FALSE;
2696 }
2697
2698 /* The spec sez this should be a newline. But in order to be
2699 bug-compatible for arc960 we use a null. */
2700 if (padit)
2701 {
2702 if (bfd_bwrite ("", 1, arch) != 1)
2703 return FALSE;
2704 }
2705
2706 return TRUE;
2707 }
2708
2709 static int
2710 archive_close_worker (void **slot, void *inf ATTRIBUTE_UNUSED)
2711 {
2712 struct ar_cache *ent = (struct ar_cache *) *slot;
2713
2714 bfd_close_all_done (ent->arbfd);
2715 return 1;
2716 }
2717
2718 bfd_boolean
2719 _bfd_archive_close_and_cleanup (bfd *abfd)
2720 {
2721 if (bfd_read_p (abfd) && abfd->format == bfd_archive)
2722 {
2723 bfd *nbfd;
2724 bfd *next;
2725 htab_t htab;
2726
2727 /* Close nested archives (if this bfd is a thin archive). */
2728 for (nbfd = abfd->nested_archives; nbfd; nbfd = next)
2729 {
2730 next = nbfd->archive_next;
2731 bfd_close (nbfd);
2732 }
2733
2734 htab = bfd_ardata (abfd)->cache;
2735 if (htab)
2736 {
2737 htab_traverse_noresize (htab, archive_close_worker, NULL);
2738 htab_delete (htab);
2739 bfd_ardata (abfd)->cache = NULL;
2740 }
2741 }
2742 if (arch_eltdata (abfd) != NULL)
2743 {
2744 struct areltdata *ared = arch_eltdata (abfd);
2745 htab_t htab = (htab_t) ared->parent_cache;
2746
2747 if (htab)
2748 {
2749 struct ar_cache ent;
2750 void **slot;
2751
2752 ent.ptr = ared->key;
2753 slot = htab_find_slot (htab, &ent, NO_INSERT);
2754 if (slot != NULL)
2755 {
2756 BFD_ASSERT (((struct ar_cache *) *slot)->arbfd == abfd);
2757 htab_clear_slot (htab, slot);
2758 }
2759 }
2760 }
2761 if (abfd->is_linker_output)
2762 (*abfd->link.hash->hash_table_free) (abfd);
2763
2764 return TRUE;
2765 }