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