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