ChangeLog rotatation and copyright year update
[deliverable/binutils-gdb.git] / bfd / archive.c
1 /* BFD back-end for archive files (libraries).
2 Copyright (C) 1990-2015 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 /* PR 17512: file: 883ff754. */
906 if (parsed_size == 0)
907 return FALSE;
908
909 raw_armap = (bfd_byte *) bfd_zalloc (abfd, parsed_size);
910 if (raw_armap == NULL)
911 return FALSE;
912
913 if (bfd_bread (raw_armap, parsed_size, abfd) != parsed_size)
914 {
915 if (bfd_get_error () != bfd_error_system_call)
916 bfd_set_error (bfd_error_malformed_archive);
917 byebye:
918 bfd_release (abfd, raw_armap);
919 return FALSE;
920 }
921
922 ardata->symdef_count = H_GET_32 (abfd, raw_armap) / BSD_SYMDEF_SIZE;
923 if (ardata->symdef_count * BSD_SYMDEF_SIZE >
924 parsed_size - BSD_SYMDEF_COUNT_SIZE)
925 {
926 /* Probably we're using the wrong byte ordering. */
927 bfd_set_error (bfd_error_wrong_format);
928 goto byebye;
929 }
930
931 ardata->cache = 0;
932 rbase = raw_armap + BSD_SYMDEF_COUNT_SIZE;
933 stringbase = ((char *) rbase
934 + ardata->symdef_count * BSD_SYMDEF_SIZE
935 + BSD_STRING_COUNT_SIZE);
936 amt = ardata->symdef_count * sizeof (carsym);
937 ardata->symdefs = (struct carsym *) bfd_alloc (abfd, amt);
938 if (!ardata->symdefs)
939 return FALSE;
940
941 for (counter = 0, set = ardata->symdefs;
942 counter < ardata->symdef_count;
943 counter++, set++, rbase += BSD_SYMDEF_SIZE)
944 {
945 set->name = H_GET_32 (abfd, rbase) + stringbase;
946 set->file_offset = H_GET_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE);
947 }
948
949 ardata->first_file_filepos = bfd_tell (abfd);
950 /* Pad to an even boundary if you have to. */
951 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
952 /* FIXME, we should provide some way to free raw_ardata when
953 we are done using the strings from it. For now, it seems
954 to be allocated on an objalloc anyway... */
955 bfd_has_map (abfd) = TRUE;
956 return TRUE;
957 }
958
959 /* Read a COFF archive symbol table. Returns FALSE on error, TRUE
960 otherwise. */
961
962 static bfd_boolean
963 do_slurp_coff_armap (bfd *abfd)
964 {
965 struct areltdata *mapdata;
966 int *raw_armap, *rawptr;
967 struct artdata *ardata = bfd_ardata (abfd);
968 char *stringbase;
969 bfd_size_type stringsize;
970 bfd_size_type parsed_size;
971 carsym *carsyms;
972 bfd_size_type nsymz; /* Number of symbols in armap. */
973 bfd_vma (*swap) (const void *);
974 char int_buf[sizeof (long)];
975 bfd_size_type carsym_size, ptrsize;
976 unsigned int i;
977
978 mapdata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
979 if (mapdata == NULL)
980 return FALSE;
981 parsed_size = mapdata->parsed_size;
982 free (mapdata);
983
984 if (bfd_bread (int_buf, 4, abfd) != 4)
985 {
986 if (bfd_get_error () != bfd_error_system_call)
987 bfd_set_error (bfd_error_malformed_archive);
988 return FALSE;
989 }
990 /* It seems that all numeric information in a coff archive is always
991 in big endian format, nomatter the host or target. */
992 swap = bfd_getb32;
993 nsymz = bfd_getb32 (int_buf);
994 stringsize = parsed_size - (4 * nsymz) - 4;
995
996 /* ... except that some archive formats are broken, and it may be our
997 fault - the i960 little endian coff sometimes has big and sometimes
998 little, because our tools changed. Here's a horrible hack to clean
999 up the crap. */
1000
1001 if (stringsize > 0xfffff
1002 && bfd_get_arch (abfd) == bfd_arch_i960
1003 && bfd_get_flavour (abfd) == bfd_target_coff_flavour)
1004 {
1005 /* This looks dangerous, let's do it the other way around. */
1006 nsymz = bfd_getl32 (int_buf);
1007 stringsize = parsed_size - (4 * nsymz) - 4;
1008 swap = bfd_getl32;
1009 }
1010
1011 /* The coff armap must be read sequentially. So we construct a
1012 bsd-style one in core all at once, for simplicity. */
1013
1014 if (nsymz > ~ (bfd_size_type) 0 / sizeof (carsym))
1015 return FALSE;
1016
1017 carsym_size = (nsymz * sizeof (carsym));
1018 ptrsize = (4 * nsymz);
1019
1020 if (carsym_size + stringsize + 1 <= carsym_size)
1021 return FALSE;
1022
1023 ardata->symdefs = (struct carsym *) bfd_zalloc (abfd,
1024 carsym_size + stringsize + 1);
1025 if (ardata->symdefs == NULL)
1026 return FALSE;
1027 carsyms = ardata->symdefs;
1028 stringbase = ((char *) ardata->symdefs) + carsym_size;
1029
1030 /* Allocate and read in the raw offsets. */
1031 raw_armap = (int *) bfd_alloc (abfd, ptrsize);
1032 if (raw_armap == NULL)
1033 goto release_symdefs;
1034 if (bfd_bread (raw_armap, ptrsize, abfd) != ptrsize
1035 || (bfd_bread (stringbase, stringsize, abfd) != stringsize))
1036 {
1037 if (bfd_get_error () != bfd_error_system_call)
1038 bfd_set_error (bfd_error_malformed_archive);
1039 goto release_raw_armap;
1040 }
1041
1042 /* OK, build the carsyms. */
1043 for (i = 0; i < nsymz && stringsize > 0; i++)
1044 {
1045 bfd_size_type len;
1046
1047 rawptr = raw_armap + i;
1048 carsyms->file_offset = swap ((bfd_byte *) rawptr);
1049 carsyms->name = stringbase;
1050 /* PR 17512: file: 4a1d50c1. */
1051 len = strnlen (stringbase, stringsize);
1052 if (len < stringsize)
1053 len ++;
1054 stringbase += len;
1055 stringsize -= len;
1056 carsyms++;
1057 }
1058 *stringbase = 0;
1059
1060 ardata->symdef_count = nsymz;
1061 ardata->first_file_filepos = bfd_tell (abfd);
1062 /* Pad to an even boundary if you have to. */
1063 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
1064
1065 bfd_has_map (abfd) = TRUE;
1066 bfd_release (abfd, raw_armap);
1067
1068 /* Check for a second archive header (as used by PE). */
1069 {
1070 struct areltdata *tmp;
1071
1072 bfd_seek (abfd, ardata->first_file_filepos, SEEK_SET);
1073 tmp = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1074 if (tmp != NULL)
1075 {
1076 if (tmp->arch_header[0] == '/'
1077 && tmp->arch_header[1] == ' ')
1078 {
1079 ardata->first_file_filepos +=
1080 (tmp->parsed_size + sizeof (struct ar_hdr) + 1) & ~(unsigned) 1;
1081 }
1082 free (tmp);
1083 }
1084 }
1085
1086 return TRUE;
1087
1088 release_raw_armap:
1089 bfd_release (abfd, raw_armap);
1090 release_symdefs:
1091 bfd_release (abfd, (ardata)->symdefs);
1092 return FALSE;
1093 }
1094
1095 /* This routine can handle either coff-style or bsd-style armaps
1096 (archive symbol table). Returns FALSE on error, TRUE otherwise */
1097
1098 bfd_boolean
1099 bfd_slurp_armap (bfd *abfd)
1100 {
1101 char nextname[17];
1102 int i = bfd_bread (nextname, 16, abfd);
1103
1104 if (i == 0)
1105 return TRUE;
1106 if (i != 16)
1107 return FALSE;
1108
1109 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1110 return FALSE;
1111
1112 if (CONST_STRNEQ (nextname, "__.SYMDEF ")
1113 || CONST_STRNEQ (nextname, "__.SYMDEF/ ")) /* Old Linux archives. */
1114 return do_slurp_bsd_armap (abfd);
1115 else if (CONST_STRNEQ (nextname, "/ "))
1116 return do_slurp_coff_armap (abfd);
1117 else if (CONST_STRNEQ (nextname, "/SYM64/ "))
1118 {
1119 /* 64bit ELF (Irix 6) archive. */
1120 #ifdef BFD64
1121 extern bfd_boolean bfd_elf64_archive_slurp_armap (bfd *);
1122 return bfd_elf64_archive_slurp_armap (abfd);
1123 #else
1124 bfd_set_error (bfd_error_wrong_format);
1125 return FALSE;
1126 #endif
1127 }
1128 else if (CONST_STRNEQ (nextname, "#1/20 "))
1129 {
1130 /* Mach-O has a special name for armap when the map is sorted by name.
1131 However because this name has a space it is slightly more difficult
1132 to check it. */
1133 struct ar_hdr hdr;
1134 char extname[21];
1135
1136 if (bfd_bread (&hdr, sizeof (hdr), abfd) != sizeof (hdr))
1137 return FALSE;
1138 /* Read the extended name. We know its length. */
1139 if (bfd_bread (extname, 20, abfd) != 20)
1140 return FALSE;
1141 if (bfd_seek (abfd, -(file_ptr) (sizeof (hdr) + 20), SEEK_CUR) != 0)
1142 return FALSE;
1143 extname[20] = 0;
1144 if (CONST_STRNEQ (extname, "__.SYMDEF SORTED")
1145 || CONST_STRNEQ (extname, "__.SYMDEF"))
1146 return do_slurp_bsd_armap (abfd);
1147 }
1148
1149 bfd_has_map (abfd) = FALSE;
1150 return TRUE;
1151 }
1152 \f
1153 /* Returns FALSE on error, TRUE otherwise. */
1154 /* Flavor 2 of a bsd armap, similar to bfd_slurp_bsd_armap except the
1155 header is in a slightly different order and the map name is '/'.
1156 This flavour is used by hp300hpux. */
1157
1158 #define HPUX_SYMDEF_COUNT_SIZE 2
1159
1160 bfd_boolean
1161 bfd_slurp_bsd_armap_f2 (bfd *abfd)
1162 {
1163 struct areltdata *mapdata;
1164 char nextname[17];
1165 unsigned int counter;
1166 bfd_byte *raw_armap, *rbase;
1167 struct artdata *ardata = bfd_ardata (abfd);
1168 char *stringbase;
1169 unsigned int stringsize;
1170 unsigned int left;
1171 bfd_size_type amt;
1172 carsym *set;
1173 int i = bfd_bread (nextname, 16, abfd);
1174
1175 if (i == 0)
1176 return TRUE;
1177 if (i != 16)
1178 return FALSE;
1179
1180 /* The archive has at least 16 bytes in it. */
1181 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1182 return FALSE;
1183
1184 if (CONST_STRNEQ (nextname, "__.SYMDEF ")
1185 || CONST_STRNEQ (nextname, "__.SYMDEF/ ")) /* Old Linux archives. */
1186 return do_slurp_bsd_armap (abfd);
1187
1188 if (! CONST_STRNEQ (nextname, "/ "))
1189 {
1190 bfd_has_map (abfd) = FALSE;
1191 return TRUE;
1192 }
1193
1194 mapdata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1195 if (mapdata == NULL)
1196 return FALSE;
1197
1198 if (mapdata->parsed_size < HPUX_SYMDEF_COUNT_SIZE + BSD_STRING_COUNT_SIZE)
1199 {
1200 free (mapdata);
1201 wrong_format:
1202 bfd_set_error (bfd_error_wrong_format);
1203 byebye:
1204 return FALSE;
1205 }
1206 left = mapdata->parsed_size - HPUX_SYMDEF_COUNT_SIZE - BSD_STRING_COUNT_SIZE;
1207
1208 amt = mapdata->parsed_size;
1209 free (mapdata);
1210
1211 raw_armap = (bfd_byte *) bfd_zalloc (abfd, amt);
1212 if (raw_armap == NULL)
1213 goto byebye;
1214
1215 if (bfd_bread (raw_armap, amt, abfd) != amt)
1216 {
1217 if (bfd_get_error () != bfd_error_system_call)
1218 bfd_set_error (bfd_error_malformed_archive);
1219 goto byebye;
1220 }
1221
1222 ardata->symdef_count = H_GET_16 (abfd, raw_armap);
1223
1224 ardata->cache = 0;
1225
1226 stringsize = H_GET_32 (abfd, raw_armap + HPUX_SYMDEF_COUNT_SIZE);
1227 if (stringsize > left)
1228 goto wrong_format;
1229 left -= stringsize;
1230
1231 /* Skip sym count and string sz. */
1232 stringbase = ((char *) raw_armap
1233 + HPUX_SYMDEF_COUNT_SIZE
1234 + BSD_STRING_COUNT_SIZE);
1235 rbase = (bfd_byte *) stringbase + stringsize;
1236 amt = ardata->symdef_count * BSD_SYMDEF_SIZE;
1237 if (amt > left)
1238 goto wrong_format;
1239
1240 ardata->symdefs = (struct carsym *) bfd_alloc (abfd, amt);
1241 if (!ardata->symdefs)
1242 return FALSE;
1243
1244 for (counter = 0, set = ardata->symdefs;
1245 counter < ardata->symdef_count;
1246 counter++, set++, rbase += BSD_SYMDEF_SIZE)
1247 {
1248 set->name = H_GET_32 (abfd, rbase) + stringbase;
1249 set->file_offset = H_GET_32 (abfd, rbase + BSD_SYMDEF_OFFSET_SIZE);
1250 }
1251
1252 ardata->first_file_filepos = bfd_tell (abfd);
1253 /* Pad to an even boundary if you have to. */
1254 ardata->first_file_filepos += (ardata->first_file_filepos) % 2;
1255 /* FIXME, we should provide some way to free raw_ardata when
1256 we are done using the strings from it. For now, it seems
1257 to be allocated on an objalloc anyway... */
1258 bfd_has_map (abfd) = TRUE;
1259 return TRUE;
1260 }
1261 \f
1262 /** Extended name table.
1263
1264 Normally archives support only 14-character filenames.
1265
1266 Intel has extended the format: longer names are stored in a special
1267 element (the first in the archive, or second if there is an armap);
1268 the name in the ar_hdr is replaced by <space><index into filename
1269 element>. Index is the P.R. of an int (decimal). Data General have
1270 extended the format by using the prefix // for the special element. */
1271
1272 /* Returns FALSE on error, TRUE otherwise. */
1273
1274 bfd_boolean
1275 _bfd_slurp_extended_name_table (bfd *abfd)
1276 {
1277 char nextname[17];
1278 struct areltdata *namedata;
1279 bfd_size_type amt;
1280
1281 /* FIXME: Formatting sucks here, and in case of failure of BFD_READ,
1282 we probably don't want to return TRUE. */
1283 if (bfd_seek (abfd, bfd_ardata (abfd)->first_file_filepos, SEEK_SET) != 0)
1284 return FALSE;
1285
1286 if (bfd_bread (nextname, 16, abfd) == 16)
1287 {
1288 if (bfd_seek (abfd, (file_ptr) -16, SEEK_CUR) != 0)
1289 return FALSE;
1290
1291 if (! CONST_STRNEQ (nextname, "ARFILENAMES/ ")
1292 && ! CONST_STRNEQ (nextname, "// "))
1293 {
1294 bfd_ardata (abfd)->extended_names = NULL;
1295 bfd_ardata (abfd)->extended_names_size = 0;
1296 return TRUE;
1297 }
1298
1299 namedata = (struct areltdata *) _bfd_read_ar_hdr (abfd);
1300 if (namedata == NULL)
1301 return FALSE;
1302
1303 amt = namedata->parsed_size;
1304 if (amt + 1 == 0)
1305 goto byebye;
1306
1307 bfd_ardata (abfd)->extended_names_size = amt;
1308 bfd_ardata (abfd)->extended_names = (char *) bfd_zalloc (abfd, amt + 1);
1309 if (bfd_ardata (abfd)->extended_names == NULL)
1310 {
1311 byebye:
1312 free (namedata);
1313 bfd_ardata (abfd)->extended_names = NULL;
1314 bfd_ardata (abfd)->extended_names_size = 0;
1315 return FALSE;
1316 }
1317
1318 if (bfd_bread (bfd_ardata (abfd)->extended_names, amt, abfd) != amt)
1319 {
1320 if (bfd_get_error () != bfd_error_system_call)
1321 bfd_set_error (bfd_error_malformed_archive);
1322 bfd_release (abfd, (bfd_ardata (abfd)->extended_names));
1323 bfd_ardata (abfd)->extended_names = NULL;
1324 goto byebye;
1325 }
1326
1327 /* Since the archive is supposed to be printable if it contains
1328 text, the entries in the list are newline-padded, not null
1329 padded. In SVR4-style archives, the names also have a
1330 trailing '/'. DOS/NT created archive often have \ in them
1331 We'll fix all problems here. */
1332 {
1333 char *ext_names = bfd_ardata (abfd)->extended_names;
1334 char *temp = ext_names;
1335 char *limit = temp + namedata->parsed_size;
1336
1337 for (; temp < limit; ++temp)
1338 {
1339 if (*temp == ARFMAG[1])
1340 temp[temp > ext_names && temp[-1] == '/' ? -1 : 0] = '\0';
1341 if (*temp == '\\')
1342 *temp = '/';
1343 }
1344 *limit = '\0';
1345 }
1346
1347 /* Pad to an even boundary if you have to. */
1348 bfd_ardata (abfd)->first_file_filepos = bfd_tell (abfd);
1349 bfd_ardata (abfd)->first_file_filepos +=
1350 (bfd_ardata (abfd)->first_file_filepos) % 2;
1351
1352 free (namedata);
1353 }
1354 return TRUE;
1355 }
1356
1357 #ifdef VMS
1358
1359 /* Return a copy of the stuff in the filename between any :]> and a
1360 semicolon. */
1361
1362 static const char *
1363 normalize (bfd *abfd, const char *file)
1364 {
1365 const char *first;
1366 const char *last;
1367 char *copy;
1368
1369 first = file + strlen (file) - 1;
1370 last = first + 1;
1371
1372 while (first != file)
1373 {
1374 if (*first == ';')
1375 last = first;
1376 if (*first == ':' || *first == ']' || *first == '>')
1377 {
1378 first++;
1379 break;
1380 }
1381 first--;
1382 }
1383
1384 copy = bfd_alloc (abfd, last - first + 1);
1385 if (copy == NULL)
1386 return NULL;
1387
1388 memcpy (copy, first, last - first);
1389 copy[last - first] = 0;
1390
1391 return copy;
1392 }
1393
1394 #else
1395 static const char *
1396 normalize (bfd *abfd ATTRIBUTE_UNUSED, const char *file)
1397 {
1398 return lbasename (file);
1399 }
1400 #endif
1401
1402 /* Adjust a relative path name based on the reference path.
1403 For example:
1404
1405 Relative path Reference path Result
1406 ------------- -------------- ------
1407 bar.o lib.a bar.o
1408 foo/bar.o lib.a foo/bar.o
1409 bar.o foo/lib.a ../bar.o
1410 foo/bar.o baz/lib.a ../foo/bar.o
1411 bar.o ../lib.a <parent of current dir>/bar.o
1412 ; ../bar.o ../lib.a bar.o
1413 ; ../bar.o lib.a ../bar.o
1414 foo/bar.o ../lib.a <parent of current dir>/foo/bar.o
1415 bar.o ../../lib.a <grandparent>/<parent>/bar.o
1416 bar.o foo/baz/lib.a ../../bar.o
1417
1418 Note - the semicolons above are there to prevent the BFD chew
1419 utility from interpreting those lines as prototypes to put into
1420 the autogenerated bfd.h header...
1421
1422 Note - the string is returned in a static buffer. */
1423
1424 static const char *
1425 adjust_relative_path (const char * path, const char * ref_path)
1426 {
1427 static char *pathbuf = NULL;
1428 static unsigned int pathbuf_len = 0;
1429 const char *pathp;
1430 const char *refp;
1431 char * lpath;
1432 char * rpath;
1433 unsigned int len;
1434 unsigned int dir_up = 0;
1435 unsigned int dir_down = 0;
1436 char *newp;
1437 char * pwd = getpwd ();
1438 const char * down;
1439
1440 /* Remove symlinks, '.' and '..' from the paths, if possible. */
1441 lpath = lrealpath (path);
1442 pathp = lpath == NULL ? path : lpath;
1443
1444 rpath = lrealpath (ref_path);
1445 refp = rpath == NULL ? ref_path : rpath;
1446
1447 /* Remove common leading path elements. */
1448 for (;;)
1449 {
1450 const char *e1 = pathp;
1451 const char *e2 = refp;
1452
1453 while (*e1 && ! IS_DIR_SEPARATOR (*e1))
1454 ++e1;
1455 while (*e2 && ! IS_DIR_SEPARATOR (*e2))
1456 ++e2;
1457 if (*e1 == '\0' || *e2 == '\0' || e1 - pathp != e2 - refp
1458 || filename_ncmp (pathp, refp, e1 - pathp) != 0)
1459 break;
1460 pathp = e1 + 1;
1461 refp = e2 + 1;
1462 }
1463
1464 len = strlen (pathp) + 1;
1465 /* For each leading path element in the reference path,
1466 insert "../" into the path. */
1467 for (; *refp; ++refp)
1468 if (IS_DIR_SEPARATOR (*refp))
1469 {
1470 /* PR 12710: If the path element is "../" then instead of
1471 inserting "../" we need to insert the name of the directory
1472 at the current level. */
1473 if (refp > ref_path + 1
1474 && refp[-1] == '.'
1475 && refp[-2] == '.')
1476 dir_down ++;
1477 else
1478 dir_up ++;
1479 }
1480
1481 /* If the lrealpath calls above succeeded then we should never
1482 see dir_up and dir_down both being non-zero. */
1483
1484 len += 3 * dir_up;
1485
1486 if (dir_down)
1487 {
1488 down = pwd + strlen (pwd) - 1;
1489
1490 while (dir_down && down > pwd)
1491 {
1492 if (IS_DIR_SEPARATOR (*down))
1493 --dir_down;
1494 }
1495 BFD_ASSERT (dir_down == 0);
1496 len += strlen (down) + 1;
1497 }
1498 else
1499 down = NULL;
1500
1501 if (len > pathbuf_len)
1502 {
1503 if (pathbuf != NULL)
1504 free (pathbuf);
1505 pathbuf_len = 0;
1506 pathbuf = (char *) bfd_malloc (len);
1507 if (pathbuf == NULL)
1508 goto out;
1509 pathbuf_len = len;
1510 }
1511
1512 newp = pathbuf;
1513 while (dir_up-- > 0)
1514 {
1515 /* FIXME: Support Windows style path separators as well. */
1516 strcpy (newp, "../");
1517 newp += 3;
1518 }
1519
1520 if (down)
1521 sprintf (newp, "%s/%s", down, pathp);
1522 else
1523 strcpy (newp, pathp);
1524
1525 out:
1526 free (lpath);
1527 free (rpath);
1528 return pathbuf;
1529 }
1530
1531 /* Build a BFD style extended name table. */
1532
1533 bfd_boolean
1534 _bfd_archive_bsd_construct_extended_name_table (bfd *abfd,
1535 char **tabloc,
1536 bfd_size_type *tablen,
1537 const char **name)
1538 {
1539 *name = "ARFILENAMES/";
1540 return _bfd_construct_extended_name_table (abfd, FALSE, tabloc, tablen);
1541 }
1542
1543 /* Build an SVR4 style extended name table. */
1544
1545 bfd_boolean
1546 _bfd_archive_coff_construct_extended_name_table (bfd *abfd,
1547 char **tabloc,
1548 bfd_size_type *tablen,
1549 const char **name)
1550 {
1551 *name = "//";
1552 return _bfd_construct_extended_name_table (abfd, TRUE, tabloc, tablen);
1553 }
1554
1555 /* Follows archive_head and produces an extended name table if
1556 necessary. Returns (in tabloc) a pointer to an extended name
1557 table, and in tablen the length of the table. If it makes an entry
1558 it clobbers the filename so that the element may be written without
1559 further massage. Returns TRUE if it ran successfully, FALSE if
1560 something went wrong. A successful return may still involve a
1561 zero-length tablen! */
1562
1563 bfd_boolean
1564 _bfd_construct_extended_name_table (bfd *abfd,
1565 bfd_boolean trailing_slash,
1566 char **tabloc,
1567 bfd_size_type *tablen)
1568 {
1569 unsigned int maxname = ar_maxnamelen (abfd);
1570 bfd_size_type total_namelen = 0;
1571 bfd *current;
1572 char *strptr;
1573 const char *last_filename;
1574 long last_stroff;
1575
1576 *tablen = 0;
1577 last_filename = NULL;
1578
1579 /* Figure out how long the table should be. */
1580 for (current = abfd->archive_head;
1581 current != NULL;
1582 current = current->archive_next)
1583 {
1584 const char *normal;
1585 unsigned int thislen;
1586
1587 if (bfd_is_thin_archive (abfd))
1588 {
1589 const char *filename = current->filename;
1590
1591 /* If the element being added is a member of another archive
1592 (i.e., we are flattening), use the containing archive's name. */
1593 if (current->my_archive
1594 && ! bfd_is_thin_archive (current->my_archive))
1595 filename = current->my_archive->filename;
1596
1597 /* If the path is the same as the previous path seen,
1598 reuse it. This can happen when flattening a thin
1599 archive that contains other archives. */
1600 if (last_filename && filename_cmp (last_filename, filename) == 0)
1601 continue;
1602
1603 last_filename = filename;
1604
1605 /* If the path is relative, adjust it relative to
1606 the containing archive. */
1607 if (! IS_ABSOLUTE_PATH (filename)
1608 && ! IS_ABSOLUTE_PATH (abfd->filename))
1609 normal = adjust_relative_path (filename, abfd->filename);
1610 else
1611 normal = filename;
1612
1613 /* In a thin archive, always store the full pathname
1614 in the extended name table. */
1615 total_namelen += strlen (normal) + 1;
1616 if (trailing_slash)
1617 /* Leave room for trailing slash. */
1618 ++total_namelen;
1619
1620 continue;
1621 }
1622
1623 normal = normalize (current, current->filename);
1624 if (normal == NULL)
1625 return FALSE;
1626
1627 thislen = strlen (normal);
1628
1629 if (thislen > maxname
1630 && (bfd_get_file_flags (abfd) & BFD_TRADITIONAL_FORMAT) != 0)
1631 thislen = maxname;
1632
1633 if (thislen > maxname)
1634 {
1635 /* Add one to leave room for \n. */
1636 total_namelen += thislen + 1;
1637 if (trailing_slash)
1638 {
1639 /* Leave room for trailing slash. */
1640 ++total_namelen;
1641 }
1642 }
1643 else
1644 {
1645 struct ar_hdr *hdr = arch_hdr (current);
1646 if (filename_ncmp (normal, hdr->ar_name, thislen) != 0
1647 || (thislen < sizeof hdr->ar_name
1648 && hdr->ar_name[thislen] != ar_padchar (current)))
1649 {
1650 /* Must have been using extended format even though it
1651 didn't need to. Fix it to use normal format. */
1652 memcpy (hdr->ar_name, normal, thislen);
1653 if (thislen < maxname
1654 || (thislen == maxname && thislen < sizeof hdr->ar_name))
1655 hdr->ar_name[thislen] = ar_padchar (current);
1656 }
1657 }
1658 }
1659
1660 if (total_namelen == 0)
1661 return TRUE;
1662
1663 *tabloc = (char *) bfd_zalloc (abfd, total_namelen);
1664 if (*tabloc == NULL)
1665 return FALSE;
1666
1667 *tablen = total_namelen;
1668 strptr = *tabloc;
1669
1670 last_filename = NULL;
1671 last_stroff = 0;
1672
1673 for (current = abfd->archive_head;
1674 current != NULL;
1675 current = current->archive_next)
1676 {
1677 const char *normal;
1678 unsigned int thislen;
1679 long stroff;
1680 const char *filename = current->filename;
1681
1682 if (bfd_is_thin_archive (abfd))
1683 {
1684 /* If the element being added is a member of another archive
1685 (i.e., we are flattening), use the containing archive's name. */
1686 if (current->my_archive
1687 && ! bfd_is_thin_archive (current->my_archive))
1688 filename = current->my_archive->filename;
1689 /* If the path is the same as the previous path seen,
1690 reuse it. This can happen when flattening a thin
1691 archive that contains other archives.
1692 If the path is relative, adjust it relative to
1693 the containing archive. */
1694 if (last_filename && filename_cmp (last_filename, filename) == 0)
1695 normal = last_filename;
1696 else if (! IS_ABSOLUTE_PATH (filename)
1697 && ! IS_ABSOLUTE_PATH (abfd->filename))
1698 normal = adjust_relative_path (filename, abfd->filename);
1699 else
1700 normal = filename;
1701 }
1702 else
1703 {
1704 normal = normalize (current, filename);
1705 if (normal == NULL)
1706 return FALSE;
1707 }
1708
1709 thislen = strlen (normal);
1710 if (thislen > maxname || bfd_is_thin_archive (abfd))
1711 {
1712 /* Works for now; may need to be re-engineered if we
1713 encounter an oddball archive format and want to
1714 generalise this hack. */
1715 struct ar_hdr *hdr = arch_hdr (current);
1716 if (normal == last_filename)
1717 stroff = last_stroff;
1718 else
1719 {
1720 strcpy (strptr, normal);
1721 if (! trailing_slash)
1722 strptr[thislen] = ARFMAG[1];
1723 else
1724 {
1725 strptr[thislen] = '/';
1726 strptr[thislen + 1] = ARFMAG[1];
1727 }
1728 stroff = strptr - *tabloc;
1729 last_stroff = stroff;
1730 }
1731 hdr->ar_name[0] = ar_padchar (current);
1732 if (bfd_is_thin_archive (abfd) && current->origin > 0)
1733 {
1734 int len = snprintf (hdr->ar_name + 1, maxname - 1, "%-ld:",
1735 stroff);
1736 _bfd_ar_spacepad (hdr->ar_name + 1 + len, maxname - 1 - len,
1737 "%-ld",
1738 current->origin - sizeof (struct ar_hdr));
1739 }
1740 else
1741 _bfd_ar_spacepad (hdr->ar_name + 1, maxname - 1, "%-ld", stroff);
1742 if (normal != last_filename)
1743 {
1744 strptr += thislen + 1;
1745 if (trailing_slash)
1746 ++strptr;
1747 last_filename = filename;
1748 }
1749 }
1750 }
1751
1752 return TRUE;
1753 }
1754
1755 /* Do not construct an extended name table but transforms name field into
1756 its extended form. */
1757
1758 bfd_boolean
1759 _bfd_archive_bsd44_construct_extended_name_table (bfd *abfd,
1760 char **tabloc,
1761 bfd_size_type *tablen,
1762 const char **name)
1763 {
1764 unsigned int maxname = ar_maxnamelen (abfd);
1765 bfd *current;
1766
1767 *tablen = 0;
1768 *tabloc = NULL;
1769 *name = NULL;
1770
1771 for (current = abfd->archive_head;
1772 current != NULL;
1773 current = current->archive_next)
1774 {
1775 const char *normal = normalize (current, current->filename);
1776 int has_space = 0;
1777 unsigned int len;
1778
1779 if (normal == NULL)
1780 return FALSE;
1781
1782 for (len = 0; normal[len]; len++)
1783 if (normal[len] == ' ')
1784 has_space = 1;
1785
1786 if (len > maxname || has_space)
1787 {
1788 struct ar_hdr *hdr = arch_hdr (current);
1789
1790 len = (len + 3) & ~3;
1791 arch_eltdata (current)->extra_size = len;
1792 _bfd_ar_spacepad (hdr->ar_name, maxname, "#1/%lu", len);
1793 }
1794 }
1795
1796 return TRUE;
1797 }
1798 \f
1799 /* Write an archive header. */
1800
1801 bfd_boolean
1802 _bfd_generic_write_ar_hdr (bfd *archive, bfd *abfd)
1803 {
1804 struct ar_hdr *hdr = arch_hdr (abfd);
1805
1806 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1807 return FALSE;
1808 return TRUE;
1809 }
1810
1811 /* Write an archive header using BSD4.4 convention. */
1812
1813 bfd_boolean
1814 _bfd_bsd44_write_ar_hdr (bfd *archive, bfd *abfd)
1815 {
1816 struct ar_hdr *hdr = arch_hdr (abfd);
1817
1818 if (is_bsd44_extended_name (hdr->ar_name))
1819 {
1820 /* This is a BSD 4.4 extended name. */
1821 const char *fullname = normalize (abfd, abfd->filename);
1822 unsigned int len = strlen (fullname);
1823 unsigned int padded_len = (len + 3) & ~3;
1824
1825 BFD_ASSERT (padded_len == arch_eltdata (abfd)->extra_size);
1826
1827 if (!_bfd_ar_sizepad (hdr->ar_size, sizeof (hdr->ar_size),
1828 arch_eltdata (abfd)->parsed_size + padded_len))
1829 return FALSE;
1830
1831 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1832 return FALSE;
1833
1834 if (bfd_bwrite (fullname, len, archive) != len)
1835 return FALSE;
1836
1837 if (len & 3)
1838 {
1839 static const char pad[3] = { 0, 0, 0 };
1840
1841 len = 4 - (len & 3);
1842 if (bfd_bwrite (pad, len, archive) != len)
1843 return FALSE;
1844 }
1845 }
1846 else
1847 {
1848 if (bfd_bwrite (hdr, sizeof (*hdr), archive) != sizeof (*hdr))
1849 return FALSE;
1850 }
1851 return TRUE;
1852 }
1853 \f
1854 /* A couple of functions for creating ar_hdrs. */
1855
1856 #ifdef HPUX_LARGE_AR_IDS
1857 /* Function to encode large UID/GID values according to HP. */
1858
1859 static void
1860 hpux_uid_gid_encode (char str[6], long int id)
1861 {
1862 int cnt;
1863
1864 str[5] = '@' + (id & 3);
1865 id >>= 2;
1866
1867 for (cnt = 4; cnt >= 0; --cnt, id >>= 6)
1868 str[cnt] = ' ' + (id & 0x3f);
1869 }
1870 #endif /* HPUX_LARGE_AR_IDS */
1871
1872 #ifndef HAVE_GETUID
1873 #define getuid() 0
1874 #endif
1875
1876 #ifndef HAVE_GETGID
1877 #define getgid() 0
1878 #endif
1879
1880 /* Takes a filename, returns an arelt_data for it, or NULL if it can't
1881 make one. The filename must refer to a filename in the filesystem.
1882 The filename field of the ar_hdr will NOT be initialized. If member
1883 is set, and it's an in-memory bfd, we fake it. */
1884
1885 static struct areltdata *
1886 bfd_ar_hdr_from_filesystem (bfd *abfd, const char *filename, bfd *member)
1887 {
1888 struct stat status;
1889 struct areltdata *ared;
1890 struct ar_hdr *hdr;
1891 bfd_size_type amt;
1892
1893 if (member && (member->flags & BFD_IN_MEMORY) != 0)
1894 {
1895 /* Assume we just "made" the member, and fake it. */
1896 struct bfd_in_memory *bim = (struct bfd_in_memory *) member->iostream;
1897 time (&status.st_mtime);
1898 status.st_uid = getuid ();
1899 status.st_gid = getgid ();
1900 status.st_mode = 0644;
1901 status.st_size = bim->size;
1902 }
1903 else if (stat (filename, &status) != 0)
1904 {
1905 bfd_set_error (bfd_error_system_call);
1906 return NULL;
1907 }
1908
1909 /* If the caller requested that the BFD generate deterministic output,
1910 fake values for modification time, UID, GID, and file mode. */
1911 if ((abfd->flags & BFD_DETERMINISTIC_OUTPUT) != 0)
1912 {
1913 status.st_mtime = 0;
1914 status.st_uid = 0;
1915 status.st_gid = 0;
1916 status.st_mode = 0644;
1917 }
1918
1919 amt = sizeof (struct ar_hdr) + sizeof (struct areltdata);
1920 ared = (struct areltdata *) bfd_zmalloc (amt);
1921 if (ared == NULL)
1922 return NULL;
1923 hdr = (struct ar_hdr *) (((char *) ared) + sizeof (struct areltdata));
1924
1925 /* ar headers are space padded, not null padded! */
1926 memset (hdr, ' ', sizeof (struct ar_hdr));
1927
1928 _bfd_ar_spacepad (hdr->ar_date, sizeof (hdr->ar_date), "%-12ld",
1929 status.st_mtime);
1930 #ifdef HPUX_LARGE_AR_IDS
1931 /* HP has a very "special" way to handle UID/GID's with numeric values
1932 > 99999. */
1933 if (status.st_uid > 99999)
1934 hpux_uid_gid_encode (hdr->ar_uid, (long) status.st_uid);
1935 else
1936 #endif
1937 _bfd_ar_spacepad (hdr->ar_uid, sizeof (hdr->ar_uid), "%ld",
1938 status.st_uid);
1939 #ifdef HPUX_LARGE_AR_IDS
1940 /* HP has a very "special" way to handle UID/GID's with numeric values
1941 > 99999. */
1942 if (status.st_gid > 99999)
1943 hpux_uid_gid_encode (hdr->ar_gid, (long) status.st_gid);
1944 else
1945 #endif
1946 _bfd_ar_spacepad (hdr->ar_gid, sizeof (hdr->ar_gid), "%ld",
1947 status.st_gid);
1948 _bfd_ar_spacepad (hdr->ar_mode, sizeof (hdr->ar_mode), "%-8lo",
1949 status.st_mode);
1950 if (!_bfd_ar_sizepad (hdr->ar_size, sizeof (hdr->ar_size), status.st_size))
1951 {
1952 free (ared);
1953 return NULL;
1954 }
1955 memcpy (hdr->ar_fmag, ARFMAG, 2);
1956 ared->parsed_size = status.st_size;
1957 ared->arch_header = (char *) hdr;
1958
1959 return ared;
1960 }
1961
1962 /* Analogous to stat call. */
1963
1964 int
1965 bfd_generic_stat_arch_elt (bfd *abfd, struct stat *buf)
1966 {
1967 struct ar_hdr *hdr;
1968 char *aloser;
1969
1970 if (abfd->arelt_data == NULL)
1971 {
1972 bfd_set_error (bfd_error_invalid_operation);
1973 return -1;
1974 }
1975
1976 hdr = arch_hdr (abfd);
1977 /* PR 17512: file: 3d9e9fe9. */
1978 if (hdr == NULL)
1979 return -1;
1980 #define foo(arelt, stelt, size) \
1981 buf->stelt = strtol (hdr->arelt, &aloser, size); \
1982 if (aloser == hdr->arelt) \
1983 return -1;
1984
1985 /* Some platforms support special notations for large IDs. */
1986 #ifdef HPUX_LARGE_AR_IDS
1987 # define foo2(arelt, stelt, size) \
1988 if (hdr->arelt[5] == ' ') \
1989 { \
1990 foo (arelt, stelt, size); \
1991 } \
1992 else \
1993 { \
1994 int cnt; \
1995 for (buf->stelt = cnt = 0; cnt < 5; ++cnt) \
1996 { \
1997 if (hdr->arelt[cnt] < ' ' || hdr->arelt[cnt] > ' ' + 0x3f) \
1998 return -1; \
1999 buf->stelt <<= 6; \
2000 buf->stelt += hdr->arelt[cnt] - ' '; \
2001 } \
2002 if (hdr->arelt[5] < '@' || hdr->arelt[5] > '@' + 3) \
2003 return -1; \
2004 buf->stelt <<= 2; \
2005 buf->stelt += hdr->arelt[5] - '@'; \
2006 }
2007 #else
2008 # define foo2(arelt, stelt, size) foo (arelt, stelt, size)
2009 #endif
2010
2011 foo (ar_date, st_mtime, 10);
2012 foo2 (ar_uid, st_uid, 10);
2013 foo2 (ar_gid, st_gid, 10);
2014 foo (ar_mode, st_mode, 8);
2015
2016 buf->st_size = arch_eltdata (abfd)->parsed_size;
2017
2018 return 0;
2019 }
2020
2021 void
2022 bfd_dont_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2023 {
2024 /* FIXME: This interacts unpleasantly with ar's quick-append option.
2025 Fortunately ic960 users will never use that option. Fixing this
2026 is very hard; fortunately I know how to do it and will do so once
2027 intel's release is out the door. */
2028
2029 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2030 size_t length;
2031 const char *filename;
2032 size_t maxlen = ar_maxnamelen (abfd);
2033
2034 if ((bfd_get_file_flags (abfd) & BFD_TRADITIONAL_FORMAT) != 0)
2035 {
2036 bfd_bsd_truncate_arname (abfd, pathname, arhdr);
2037 return;
2038 }
2039
2040 filename = normalize (abfd, pathname);
2041 if (filename == NULL)
2042 {
2043 /* FIXME */
2044 abort ();
2045 }
2046
2047 length = strlen (filename);
2048
2049 if (length <= maxlen)
2050 memcpy (hdr->ar_name, filename, length);
2051
2052 /* Add the padding character if there is room for it. */
2053 if (length < maxlen
2054 || (length == maxlen && length < sizeof hdr->ar_name))
2055 (hdr->ar_name)[length] = ar_padchar (abfd);
2056 }
2057
2058 void
2059 bfd_bsd_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2060 {
2061 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2062 size_t length;
2063 const char *filename = lbasename (pathname);
2064 size_t maxlen = ar_maxnamelen (abfd);
2065
2066 length = strlen (filename);
2067
2068 if (length <= maxlen)
2069 memcpy (hdr->ar_name, filename, length);
2070 else
2071 {
2072 /* pathname: meet procrustes */
2073 memcpy (hdr->ar_name, filename, maxlen);
2074 length = maxlen;
2075 }
2076
2077 if (length < maxlen)
2078 (hdr->ar_name)[length] = ar_padchar (abfd);
2079 }
2080
2081 /* Store name into ar header. Truncates the name to fit.
2082 1> strip pathname to be just the basename.
2083 2> if it's short enuf to fit, stuff it in.
2084 3> If it doesn't end with .o, truncate it to fit
2085 4> truncate it before the .o, append .o, stuff THAT in. */
2086
2087 /* This is what gnu ar does. It's better but incompatible with the
2088 bsd ar. */
2089
2090 void
2091 bfd_gnu_truncate_arname (bfd *abfd, const char *pathname, char *arhdr)
2092 {
2093 struct ar_hdr *hdr = (struct ar_hdr *) arhdr;
2094 size_t length;
2095 const char *filename = lbasename (pathname);
2096 size_t maxlen = ar_maxnamelen (abfd);
2097
2098 length = strlen (filename);
2099
2100 if (length <= maxlen)
2101 memcpy (hdr->ar_name, filename, length);
2102 else
2103 {
2104 /* pathname: meet procrustes. */
2105 memcpy (hdr->ar_name, filename, maxlen);
2106 if ((filename[length - 2] == '.') && (filename[length - 1] == 'o'))
2107 {
2108 hdr->ar_name[maxlen - 2] = '.';
2109 hdr->ar_name[maxlen - 1] = 'o';
2110 }
2111 length = maxlen;
2112 }
2113
2114 if (length < 16)
2115 (hdr->ar_name)[length] = ar_padchar (abfd);
2116 }
2117 \f
2118 /* The BFD is open for write and has its format set to bfd_archive. */
2119
2120 bfd_boolean
2121 _bfd_write_archive_contents (bfd *arch)
2122 {
2123 bfd *current;
2124 char *etable = NULL;
2125 bfd_size_type elength = 0;
2126 const char *ename = NULL;
2127 bfd_boolean makemap = bfd_has_map (arch);
2128 /* If no .o's, don't bother to make a map. */
2129 bfd_boolean hasobjects = FALSE;
2130 bfd_size_type wrote;
2131 int tries;
2132 char *armag;
2133
2134 /* Verify the viability of all entries; if any of them live in the
2135 filesystem (as opposed to living in an archive open for input)
2136 then construct a fresh ar_hdr for them. */
2137 for (current = arch->archive_head;
2138 current != NULL;
2139 current = current->archive_next)
2140 {
2141 /* This check is checking the bfds for the objects we're reading
2142 from (which are usually either an object file or archive on
2143 disk), not the archive entries we're writing to. We don't
2144 actually create bfds for the archive members, we just copy
2145 them byte-wise when we write out the archive. */
2146 if (bfd_write_p (current))
2147 {
2148 bfd_set_error (bfd_error_invalid_operation);
2149 goto input_err;
2150 }
2151 if (!current->arelt_data)
2152 {
2153 current->arelt_data =
2154 bfd_ar_hdr_from_filesystem (arch, current->filename, current);
2155 if (!current->arelt_data)
2156 goto input_err;
2157
2158 /* Put in the file name. */
2159 BFD_SEND (arch, _bfd_truncate_arname,
2160 (arch, current->filename, (char *) arch_hdr (current)));
2161 }
2162
2163 if (makemap && ! hasobjects)
2164 { /* Don't bother if we won't make a map! */
2165 if ((bfd_check_format (current, bfd_object)))
2166 hasobjects = TRUE;
2167 }
2168 }
2169
2170 if (!BFD_SEND (arch, _bfd_construct_extended_name_table,
2171 (arch, &etable, &elength, &ename)))
2172 return FALSE;
2173
2174 if (bfd_seek (arch, (file_ptr) 0, SEEK_SET) != 0)
2175 return FALSE;
2176 armag = ARMAG;
2177 if (bfd_is_thin_archive (arch))
2178 armag = ARMAGT;
2179 wrote = bfd_bwrite (armag, SARMAG, arch);
2180 if (wrote != SARMAG)
2181 return FALSE;
2182
2183 if (makemap && hasobjects)
2184 {
2185 if (! _bfd_compute_and_write_armap (arch, (unsigned int) elength))
2186 return FALSE;
2187 }
2188
2189 if (elength != 0)
2190 {
2191 struct ar_hdr hdr;
2192
2193 memset (&hdr, ' ', sizeof (struct ar_hdr));
2194 memcpy (hdr.ar_name, ename, strlen (ename));
2195 /* Round size up to even number in archive header. */
2196 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size),
2197 (elength + 1) & ~(bfd_size_type) 1))
2198 return FALSE;
2199 memcpy (hdr.ar_fmag, ARFMAG, 2);
2200 if ((bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2201 != sizeof (struct ar_hdr))
2202 || bfd_bwrite (etable, elength, arch) != elength)
2203 return FALSE;
2204 if ((elength % 2) == 1)
2205 {
2206 if (bfd_bwrite (&ARFMAG[1], 1, arch) != 1)
2207 return FALSE;
2208 }
2209 }
2210
2211 for (current = arch->archive_head;
2212 current != NULL;
2213 current = current->archive_next)
2214 {
2215 char buffer[DEFAULT_BUFFERSIZE];
2216 bfd_size_type remaining = arelt_size (current);
2217
2218 /* Write ar header. */
2219 if (!_bfd_write_ar_hdr (arch, current))
2220 return FALSE;
2221 if (bfd_is_thin_archive (arch))
2222 continue;
2223 if (bfd_seek (current, (file_ptr) 0, SEEK_SET) != 0)
2224 goto input_err;
2225
2226 while (remaining)
2227 {
2228 unsigned int amt = DEFAULT_BUFFERSIZE;
2229
2230 if (amt > remaining)
2231 amt = remaining;
2232 errno = 0;
2233 if (bfd_bread (buffer, amt, current) != amt)
2234 {
2235 if (bfd_get_error () != bfd_error_system_call)
2236 bfd_set_error (bfd_error_file_truncated);
2237 goto input_err;
2238 }
2239 if (bfd_bwrite (buffer, amt, arch) != amt)
2240 return FALSE;
2241 remaining -= amt;
2242 }
2243
2244 if ((arelt_size (current) % 2) == 1)
2245 {
2246 if (bfd_bwrite (&ARFMAG[1], 1, arch) != 1)
2247 return FALSE;
2248 }
2249 }
2250
2251 if (makemap && hasobjects)
2252 {
2253 /* Verify the timestamp in the archive file. If it would not be
2254 accepted by the linker, rewrite it until it would be. If
2255 anything odd happens, break out and just return. (The
2256 Berkeley linker checks the timestamp and refuses to read the
2257 table-of-contents if it is >60 seconds less than the file's
2258 modified-time. That painful hack requires this painful hack. */
2259 tries = 1;
2260 do
2261 {
2262 if (bfd_update_armap_timestamp (arch))
2263 break;
2264 (*_bfd_error_handler)
2265 (_("Warning: writing archive was slow: rewriting timestamp\n"));
2266 }
2267 while (++tries < 6);
2268 }
2269
2270 return TRUE;
2271
2272 input_err:
2273 bfd_set_error (bfd_error_on_input, current, bfd_get_error ());
2274 return FALSE;
2275 }
2276 \f
2277 /* Note that the namidx for the first symbol is 0. */
2278
2279 bfd_boolean
2280 _bfd_compute_and_write_armap (bfd *arch, unsigned int elength)
2281 {
2282 char *first_name = NULL;
2283 bfd *current;
2284 file_ptr elt_no = 0;
2285 struct orl *map = NULL;
2286 unsigned int orl_max = 1024; /* Fine initial default. */
2287 unsigned int orl_count = 0;
2288 int stridx = 0;
2289 asymbol **syms = NULL;
2290 long syms_max = 0;
2291 bfd_boolean ret;
2292 bfd_size_type amt;
2293
2294 /* Dunno if this is the best place for this info... */
2295 if (elength != 0)
2296 elength += sizeof (struct ar_hdr);
2297 elength += elength % 2;
2298
2299 amt = orl_max * sizeof (struct orl);
2300 map = (struct orl *) bfd_malloc (amt);
2301 if (map == NULL)
2302 goto error_return;
2303
2304 /* We put the symbol names on the arch objalloc, and then discard
2305 them when done. */
2306 first_name = (char *) bfd_alloc (arch, 1);
2307 if (first_name == NULL)
2308 goto error_return;
2309
2310 /* Drop all the files called __.SYMDEF, we're going to make our own. */
2311 while (arch->archive_head
2312 && strcmp (arch->archive_head->filename, "__.SYMDEF") == 0)
2313 arch->archive_head = arch->archive_head->archive_next;
2314
2315 /* Map over each element. */
2316 for (current = arch->archive_head;
2317 current != NULL;
2318 current = current->archive_next, elt_no++)
2319 {
2320 if (bfd_check_format (current, bfd_object)
2321 && (bfd_get_file_flags (current) & HAS_SYMS) != 0)
2322 {
2323 long storage;
2324 long symcount;
2325 long src_count;
2326
2327 storage = bfd_get_symtab_upper_bound (current);
2328 if (storage < 0)
2329 goto error_return;
2330
2331 if (storage != 0)
2332 {
2333 if (storage > syms_max)
2334 {
2335 if (syms_max > 0)
2336 free (syms);
2337 syms_max = storage;
2338 syms = (asymbol **) bfd_malloc (syms_max);
2339 if (syms == NULL)
2340 goto error_return;
2341 }
2342 symcount = bfd_canonicalize_symtab (current, syms);
2343 if (symcount < 0)
2344 goto error_return;
2345
2346 /* Now map over all the symbols, picking out the ones we
2347 want. */
2348 for (src_count = 0; src_count < symcount; src_count++)
2349 {
2350 flagword flags = (syms[src_count])->flags;
2351 asection *sec = syms[src_count]->section;
2352
2353 if (((flags & (BSF_GLOBAL
2354 | BSF_WEAK
2355 | BSF_INDIRECT
2356 | BSF_GNU_UNIQUE)) != 0
2357 || bfd_is_com_section (sec))
2358 && ! bfd_is_und_section (sec))
2359 {
2360 bfd_size_type namelen;
2361 struct orl *new_map;
2362
2363 /* This symbol will go into the archive header. */
2364 if (orl_count == orl_max)
2365 {
2366 orl_max *= 2;
2367 amt = orl_max * sizeof (struct orl);
2368 new_map = (struct orl *) bfd_realloc (map, amt);
2369 if (new_map == NULL)
2370 goto error_return;
2371
2372 map = new_map;
2373 }
2374
2375 if (strcmp (syms[src_count]->name, "__gnu_lto_slim") == 0)
2376 (*_bfd_error_handler)
2377 (_("%s: plugin needed to handle lto object"),
2378 bfd_get_filename (current));
2379 namelen = strlen (syms[src_count]->name);
2380 amt = sizeof (char *);
2381 map[orl_count].name = (char **) bfd_alloc (arch, amt);
2382 if (map[orl_count].name == NULL)
2383 goto error_return;
2384 *(map[orl_count].name) = (char *) bfd_alloc (arch,
2385 namelen + 1);
2386 if (*(map[orl_count].name) == NULL)
2387 goto error_return;
2388 strcpy (*(map[orl_count].name), syms[src_count]->name);
2389 map[orl_count].u.abfd = current;
2390 map[orl_count].namidx = stridx;
2391
2392 stridx += namelen + 1;
2393 ++orl_count;
2394 }
2395 }
2396 }
2397
2398 /* Now ask the BFD to free up any cached information, so we
2399 don't fill all of memory with symbol tables. */
2400 if (! bfd_free_cached_info (current))
2401 goto error_return;
2402 }
2403 }
2404
2405 /* OK, now we have collected all the data, let's write them out. */
2406 ret = BFD_SEND (arch, write_armap,
2407 (arch, elength, map, orl_count, stridx));
2408
2409 if (syms_max > 0)
2410 free (syms);
2411 if (map != NULL)
2412 free (map);
2413 if (first_name != NULL)
2414 bfd_release (arch, first_name);
2415
2416 return ret;
2417
2418 error_return:
2419 if (syms_max > 0)
2420 free (syms);
2421 if (map != NULL)
2422 free (map);
2423 if (first_name != NULL)
2424 bfd_release (arch, first_name);
2425
2426 return FALSE;
2427 }
2428
2429 bfd_boolean
2430 bsd_write_armap (bfd *arch,
2431 unsigned int elength,
2432 struct orl *map,
2433 unsigned int orl_count,
2434 int stridx)
2435 {
2436 int padit = stridx & 1;
2437 unsigned int ranlibsize = orl_count * BSD_SYMDEF_SIZE;
2438 unsigned int stringsize = stridx + padit;
2439 /* Include 8 bytes to store ranlibsize and stringsize in output. */
2440 unsigned int mapsize = ranlibsize + stringsize + 8;
2441 file_ptr firstreal;
2442 bfd *current = arch->archive_head;
2443 bfd *last_elt = current; /* Last element arch seen. */
2444 bfd_byte temp[4];
2445 unsigned int count;
2446 struct ar_hdr hdr;
2447 long uid, gid;
2448
2449 firstreal = mapsize + elength + sizeof (struct ar_hdr) + SARMAG;
2450
2451 /* If deterministic, we use 0 as the timestamp in the map.
2452 Some linkers may require that the archive filesystem modification
2453 time is less than (or near to) the archive map timestamp. Those
2454 linkers should not be used with deterministic mode. (GNU ld and
2455 Gold do not have this restriction.) */
2456 bfd_ardata (arch)->armap_timestamp = 0;
2457 uid = 0;
2458 gid = 0;
2459 if ((arch->flags & BFD_DETERMINISTIC_OUTPUT) == 0)
2460 {
2461 struct stat statbuf;
2462
2463 if (stat (arch->filename, &statbuf) == 0)
2464 bfd_ardata (arch)->armap_timestamp = (statbuf.st_mtime
2465 + ARMAP_TIME_OFFSET);
2466 uid = getuid();
2467 gid = getgid();
2468 }
2469
2470 memset (&hdr, ' ', sizeof (struct ar_hdr));
2471 memcpy (hdr.ar_name, RANLIBMAG, strlen (RANLIBMAG));
2472 bfd_ardata (arch)->armap_datepos = (SARMAG
2473 + offsetof (struct ar_hdr, ar_date[0]));
2474 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2475 bfd_ardata (arch)->armap_timestamp);
2476 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld", uid);
2477 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld", gid);
2478 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size), mapsize))
2479 return FALSE;
2480 memcpy (hdr.ar_fmag, ARFMAG, 2);
2481 if (bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2482 != sizeof (struct ar_hdr))
2483 return FALSE;
2484 H_PUT_32 (arch, ranlibsize, temp);
2485 if (bfd_bwrite (temp, sizeof (temp), arch) != sizeof (temp))
2486 return FALSE;
2487
2488 for (count = 0; count < orl_count; count++)
2489 {
2490 unsigned int offset;
2491 bfd_byte buf[BSD_SYMDEF_SIZE];
2492
2493 if (map[count].u.abfd != last_elt)
2494 {
2495 do
2496 {
2497 struct areltdata *ared = arch_eltdata (current);
2498
2499 firstreal += (ared->parsed_size + ared->extra_size
2500 + sizeof (struct ar_hdr));
2501 firstreal += firstreal % 2;
2502 current = current->archive_next;
2503 }
2504 while (current != map[count].u.abfd);
2505 }
2506
2507 /* The archive file format only has 4 bytes to store the offset
2508 of the member. Check to make sure that firstreal has not grown
2509 too big. */
2510 offset = (unsigned int) firstreal;
2511 if (firstreal != (file_ptr) offset)
2512 {
2513 bfd_set_error (bfd_error_file_truncated);
2514 return FALSE;
2515 }
2516
2517 last_elt = current;
2518 H_PUT_32 (arch, map[count].namidx, buf);
2519 H_PUT_32 (arch, firstreal, buf + BSD_SYMDEF_OFFSET_SIZE);
2520 if (bfd_bwrite (buf, BSD_SYMDEF_SIZE, arch)
2521 != BSD_SYMDEF_SIZE)
2522 return FALSE;
2523 }
2524
2525 /* Now write the strings themselves. */
2526 H_PUT_32 (arch, stringsize, temp);
2527 if (bfd_bwrite (temp, sizeof (temp), arch) != sizeof (temp))
2528 return FALSE;
2529 for (count = 0; count < orl_count; count++)
2530 {
2531 size_t len = strlen (*map[count].name) + 1;
2532
2533 if (bfd_bwrite (*map[count].name, len, arch) != len)
2534 return FALSE;
2535 }
2536
2537 /* The spec sez this should be a newline. But in order to be
2538 bug-compatible for sun's ar we use a null. */
2539 if (padit)
2540 {
2541 if (bfd_bwrite ("", 1, arch) != 1)
2542 return FALSE;
2543 }
2544
2545 return TRUE;
2546 }
2547
2548 /* At the end of archive file handling, update the timestamp in the
2549 file, so the linker will accept it.
2550
2551 Return TRUE if the timestamp was OK, or an unusual problem happened.
2552 Return FALSE if we updated the timestamp. */
2553
2554 bfd_boolean
2555 _bfd_archive_bsd_update_armap_timestamp (bfd *arch)
2556 {
2557 struct stat archstat;
2558 struct ar_hdr hdr;
2559
2560 /* If creating deterministic archives, just leave the timestamp as-is. */
2561 if ((arch->flags & BFD_DETERMINISTIC_OUTPUT) != 0)
2562 return TRUE;
2563
2564 /* Flush writes, get last-write timestamp from file, and compare it
2565 to the timestamp IN the file. */
2566 bfd_flush (arch);
2567 if (bfd_stat (arch, &archstat) == -1)
2568 {
2569 bfd_perror (_("Reading archive file mod timestamp"));
2570
2571 /* Can't read mod time for some reason. */
2572 return TRUE;
2573 }
2574 if (((long) archstat.st_mtime) <= bfd_ardata (arch)->armap_timestamp)
2575 /* OK by the linker's rules. */
2576 return TRUE;
2577
2578 /* Update the timestamp. */
2579 bfd_ardata (arch)->armap_timestamp = archstat.st_mtime + ARMAP_TIME_OFFSET;
2580
2581 /* Prepare an ASCII version suitable for writing. */
2582 memset (hdr.ar_date, ' ', sizeof (hdr.ar_date));
2583 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2584 bfd_ardata (arch)->armap_timestamp);
2585
2586 /* Write it into the file. */
2587 bfd_ardata (arch)->armap_datepos = (SARMAG
2588 + offsetof (struct ar_hdr, ar_date[0]));
2589 if (bfd_seek (arch, bfd_ardata (arch)->armap_datepos, SEEK_SET) != 0
2590 || (bfd_bwrite (hdr.ar_date, sizeof (hdr.ar_date), arch)
2591 != sizeof (hdr.ar_date)))
2592 {
2593 bfd_perror (_("Writing updated armap timestamp"));
2594
2595 /* Some error while writing. */
2596 return TRUE;
2597 }
2598
2599 /* We updated the timestamp successfully. */
2600 return FALSE;
2601 }
2602 \f
2603 /* A coff armap looks like :
2604 lARMAG
2605 struct ar_hdr with name = '/'
2606 number of symbols
2607 offset of file for symbol 0
2608 offset of file for symbol 1
2609
2610 offset of file for symbol n-1
2611 symbol name 0
2612 symbol name 1
2613
2614 symbol name n-1 */
2615
2616 bfd_boolean
2617 coff_write_armap (bfd *arch,
2618 unsigned int elength,
2619 struct orl *map,
2620 unsigned int symbol_count,
2621 int stridx)
2622 {
2623 /* The size of the ranlib is the number of exported symbols in the
2624 archive * the number of bytes in an int, + an int for the count. */
2625 unsigned int ranlibsize = (symbol_count * 4) + 4;
2626 unsigned int stringsize = stridx;
2627 unsigned int mapsize = stringsize + ranlibsize;
2628 file_ptr archive_member_file_ptr;
2629 bfd *current = arch->archive_head;
2630 unsigned int count;
2631 struct ar_hdr hdr;
2632 int padit = mapsize & 1;
2633
2634 if (padit)
2635 mapsize++;
2636
2637 /* Work out where the first object file will go in the archive. */
2638 archive_member_file_ptr = (mapsize
2639 + elength
2640 + sizeof (struct ar_hdr)
2641 + SARMAG);
2642
2643 memset (&hdr, ' ', sizeof (struct ar_hdr));
2644 hdr.ar_name[0] = '/';
2645 if (!_bfd_ar_sizepad (hdr.ar_size, sizeof (hdr.ar_size), mapsize))
2646 return FALSE;
2647 _bfd_ar_spacepad (hdr.ar_date, sizeof (hdr.ar_date), "%ld",
2648 ((arch->flags & BFD_DETERMINISTIC_OUTPUT) == 0
2649 ? time (NULL) : 0));
2650 /* This, at least, is what Intel coff sets the values to. */
2651 _bfd_ar_spacepad (hdr.ar_uid, sizeof (hdr.ar_uid), "%ld", 0);
2652 _bfd_ar_spacepad (hdr.ar_gid, sizeof (hdr.ar_gid), "%ld", 0);
2653 _bfd_ar_spacepad (hdr.ar_mode, sizeof (hdr.ar_mode), "%-7lo", 0);
2654 memcpy (hdr.ar_fmag, ARFMAG, 2);
2655
2656 /* Write the ar header for this item and the number of symbols. */
2657 if (bfd_bwrite (&hdr, sizeof (struct ar_hdr), arch)
2658 != sizeof (struct ar_hdr))
2659 return FALSE;
2660
2661 if (!bfd_write_bigendian_4byte_int (arch, symbol_count))
2662 return FALSE;
2663
2664 /* Two passes, first write the file offsets for each symbol -
2665 remembering that each offset is on a two byte boundary. */
2666
2667 /* Write out the file offset for the file associated with each
2668 symbol, and remember to keep the offsets padded out. */
2669
2670 current = arch->archive_head;
2671 count = 0;
2672 while (current != NULL && count < symbol_count)
2673 {
2674 /* For each symbol which is used defined in this object, write
2675 out the object file's address in the archive. */
2676
2677 while (count < symbol_count && map[count].u.abfd == current)
2678 {
2679 unsigned int offset = (unsigned int) archive_member_file_ptr;
2680
2681 /* Catch an attempt to grow an archive past its 4Gb limit. */
2682 if (archive_member_file_ptr != (file_ptr) offset)
2683 {
2684 bfd_set_error (bfd_error_file_truncated);
2685 return FALSE;
2686 }
2687 if (!bfd_write_bigendian_4byte_int (arch, offset))
2688 return FALSE;
2689 count++;
2690 }
2691 archive_member_file_ptr += sizeof (struct ar_hdr);
2692 if (! bfd_is_thin_archive (arch))
2693 {
2694 /* Add size of this archive entry. */
2695 archive_member_file_ptr += arelt_size (current);
2696 /* Remember about the even alignment. */
2697 archive_member_file_ptr += archive_member_file_ptr % 2;
2698 }
2699 current = current->archive_next;
2700 }
2701
2702 /* Now write the strings themselves. */
2703 for (count = 0; count < symbol_count; count++)
2704 {
2705 size_t len = strlen (*map[count].name) + 1;
2706
2707 if (bfd_bwrite (*map[count].name, len, arch) != len)
2708 return FALSE;
2709 }
2710
2711 /* The spec sez this should be a newline. But in order to be
2712 bug-compatible for arc960 we use a null. */
2713 if (padit)
2714 {
2715 if (bfd_bwrite ("", 1, arch) != 1)
2716 return FALSE;
2717 }
2718
2719 return TRUE;
2720 }
2721
2722 static int
2723 archive_close_worker (void **slot, void *inf ATTRIBUTE_UNUSED)
2724 {
2725 struct ar_cache *ent = (struct ar_cache *) *slot;
2726
2727 bfd_close_all_done (ent->arbfd);
2728 return 1;
2729 }
2730
2731 bfd_boolean
2732 _bfd_archive_close_and_cleanup (bfd *abfd)
2733 {
2734 if (bfd_read_p (abfd) && abfd->format == bfd_archive)
2735 {
2736 bfd *nbfd;
2737 bfd *next;
2738 htab_t htab;
2739
2740 /* Close nested archives (if this bfd is a thin archive). */
2741 for (nbfd = abfd->nested_archives; nbfd; nbfd = next)
2742 {
2743 next = nbfd->archive_next;
2744 bfd_close (nbfd);
2745 }
2746
2747 htab = bfd_ardata (abfd)->cache;
2748 if (htab)
2749 {
2750 htab_traverse_noresize (htab, archive_close_worker, NULL);
2751 htab_delete (htab);
2752 bfd_ardata (abfd)->cache = NULL;
2753 }
2754 }
2755 if (arch_eltdata (abfd) != NULL)
2756 {
2757 struct areltdata *ared = arch_eltdata (abfd);
2758 htab_t htab = (htab_t) ared->parent_cache;
2759
2760 if (htab)
2761 {
2762 struct ar_cache ent;
2763 void **slot;
2764
2765 ent.ptr = ared->key;
2766 slot = htab_find_slot (htab, &ent, NO_INSERT);
2767 if (slot != NULL)
2768 {
2769 BFD_ASSERT (((struct ar_cache *) *slot)->arbfd == abfd);
2770 htab_clear_slot (htab, slot);
2771 }
2772 }
2773 }
2774 if (abfd->is_linker_output)
2775 (*abfd->link.hash->hash_table_free) (abfd);
2776
2777 return TRUE;
2778 }
This page took 0.1493 seconds and 5 git commands to generate.