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