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