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