* readsyms.cc (Read_symbols::incompatible_warning): New function.
[deliverable/binutils-gdb.git] / gold / archive.cc
1 // archive.cc -- archive support for gold
2
3 // Copyright 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
4 // Written by Ian Lance Taylor <iant@google.com>.
5
6 // This file is part of gold.
7
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 3 of the License, or
11 // (at your option) any later version.
12
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
17
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the Free Software
20 // Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
21 // MA 02110-1301, USA.
22
23 #include "gold.h"
24
25 #include <cerrno>
26 #include <cstring>
27 #include <climits>
28 #include <vector>
29 #include "libiberty.h"
30 #include "filenames.h"
31
32 #include "elfcpp.h"
33 #include "options.h"
34 #include "mapfile.h"
35 #include "fileread.h"
36 #include "readsyms.h"
37 #include "symtab.h"
38 #include "object.h"
39 #include "archive.h"
40 #include "plugin.h"
41
42 namespace gold
43 {
44
45 // The header of an entry in the archive. This is all readable text,
46 // padded with spaces where necesary. If the contents of an archive
47 // are all text file, the entire archive is readable.
48
49 struct Archive::Archive_header
50 {
51 // The entry name.
52 char ar_name[16];
53 // The file modification time.
54 char ar_date[12];
55 // The user's UID in decimal.
56 char ar_uid[6];
57 // The user's GID in decimal.
58 char ar_gid[6];
59 // The file mode in octal.
60 char ar_mode[8];
61 // The file size in decimal.
62 char ar_size[10];
63 // The final magic code.
64 char ar_fmag[2];
65 };
66
67 // Class Archive static variables.
68 unsigned int Archive::total_archives;
69 unsigned int Archive::total_members;
70 unsigned int Archive::total_members_loaded;
71
72 // Archive methods.
73
74 const char Archive::armag[sarmag] =
75 {
76 '!', '<', 'a', 'r', 'c', 'h', '>', '\n'
77 };
78
79 const char Archive::armagt[sarmag] =
80 {
81 '!', '<', 't', 'h', 'i', 'n', '>', '\n'
82 };
83
84 const char Archive::arfmag[2] = { '`', '\n' };
85
86 // Set up the archive: read the symbol map and the extended name
87 // table.
88
89 void
90 Archive::setup()
91 {
92 // We need to ignore empty archives.
93 if (this->input_file_->file().filesize() == sarmag)
94 return;
95
96 // The first member of the archive should be the symbol table.
97 std::string armap_name;
98 section_size_type armap_size =
99 convert_to_section_size_type(this->read_header(sarmag, false,
100 &armap_name, NULL));
101 off_t off = sarmag;
102 if (armap_name.empty())
103 {
104 this->read_armap(sarmag + sizeof(Archive_header), armap_size);
105 off = sarmag + sizeof(Archive_header) + armap_size;
106 }
107 else if (!this->input_file_->options().whole_archive())
108 gold_error(_("%s: no archive symbol table (run ranlib)"),
109 this->name().c_str());
110
111 // See if there is an extended name table. We cache these views
112 // because it is likely that we will want to read the following
113 // header in the add_symbols routine.
114 if ((off & 1) != 0)
115 ++off;
116 std::string xname;
117 section_size_type extended_size =
118 convert_to_section_size_type(this->read_header(off, true, &xname, NULL));
119 if (xname == "/")
120 {
121 const unsigned char* p = this->get_view(off + sizeof(Archive_header),
122 extended_size, false, true);
123 const char* px = reinterpret_cast<const char*>(p);
124 this->extended_names_.assign(px, extended_size);
125 }
126 bool preread_syms = (parameters->options().threads()
127 && parameters->options().preread_archive_symbols());
128 #ifndef ENABLE_THREADS
129 preread_syms = false;
130 #else
131 if (parameters->options().has_plugins())
132 preread_syms = false;
133 #endif
134 if (preread_syms)
135 this->read_all_symbols();
136 }
137
138 // Unlock any nested archives.
139
140 void
141 Archive::unlock_nested_archives()
142 {
143 for (Nested_archive_table::iterator p = this->nested_archives_.begin();
144 p != this->nested_archives_.end();
145 ++p)
146 {
147 p->second->unlock(this->task_);
148 }
149 }
150
151 // Read the archive symbol map.
152
153 void
154 Archive::read_armap(off_t start, section_size_type size)
155 {
156 // To count the total number of archive members, we'll just count
157 // the number of times the file offset changes. Since most archives
158 // group the symbols in the armap by object, this ought to give us
159 // an accurate count.
160 off_t last_seen_offset = -1;
161
162 // Read in the entire armap.
163 const unsigned char* p = this->get_view(start, size, true, false);
164
165 // Numbers in the armap are always big-endian.
166 const elfcpp::Elf_Word* pword = reinterpret_cast<const elfcpp::Elf_Word*>(p);
167 unsigned int nsyms = elfcpp::Swap<32, true>::readval(pword);
168 ++pword;
169
170 // Note that the addition is in units of sizeof(elfcpp::Elf_Word).
171 const char* pnames = reinterpret_cast<const char*>(pword + nsyms);
172 section_size_type names_size =
173 reinterpret_cast<const char*>(p) + size - pnames;
174 this->armap_names_.assign(pnames, names_size);
175
176 this->armap_.resize(nsyms);
177
178 section_offset_type name_offset = 0;
179 for (unsigned int i = 0; i < nsyms; ++i)
180 {
181 this->armap_[i].name_offset = name_offset;
182 this->armap_[i].file_offset = elfcpp::Swap<32, true>::readval(pword);
183 name_offset += strlen(pnames + name_offset) + 1;
184 ++pword;
185 if (this->armap_[i].file_offset != last_seen_offset)
186 {
187 last_seen_offset = this->armap_[i].file_offset;
188 ++this->num_members_;
189 }
190 }
191
192 if (static_cast<section_size_type>(name_offset) > names_size)
193 gold_error(_("%s: bad archive symbol table names"),
194 this->name().c_str());
195
196 // This array keeps track of which symbols are for archive elements
197 // which we have already included in the link.
198 this->armap_checked_.resize(nsyms);
199 }
200
201 // Read the header of an archive member at OFF. Fail if something
202 // goes wrong. Return the size of the member. Set *PNAME to the name
203 // of the member.
204
205 off_t
206 Archive::read_header(off_t off, bool cache, std::string* pname,
207 off_t* nested_off)
208 {
209 const unsigned char* p = this->get_view(off, sizeof(Archive_header), true,
210 cache);
211 const Archive_header* hdr = reinterpret_cast<const Archive_header*>(p);
212 return this->interpret_header(hdr, off, pname, nested_off);
213 }
214
215 // Interpret the header of HDR, the header of the archive member at
216 // file offset OFF. Fail if something goes wrong. Return the size of
217 // the member. Set *PNAME to the name of the member.
218
219 off_t
220 Archive::interpret_header(const Archive_header* hdr, off_t off,
221 std::string* pname, off_t* nested_off) const
222 {
223 if (memcmp(hdr->ar_fmag, arfmag, sizeof arfmag) != 0)
224 {
225 gold_error(_("%s: malformed archive header at %zu"),
226 this->name().c_str(), static_cast<size_t>(off));
227 return this->input_file_->file().filesize() - off;
228 }
229
230 const int size_string_size = sizeof hdr->ar_size;
231 char size_string[size_string_size + 1];
232 memcpy(size_string, hdr->ar_size, size_string_size);
233 char* ps = size_string + size_string_size;
234 while (ps[-1] == ' ')
235 --ps;
236 *ps = '\0';
237
238 errno = 0;
239 char* end;
240 off_t member_size = strtol(size_string, &end, 10);
241 if (*end != '\0'
242 || member_size < 0
243 || (member_size == LONG_MAX && errno == ERANGE))
244 {
245 gold_error(_("%s: malformed archive header size at %zu"),
246 this->name().c_str(), static_cast<size_t>(off));
247 return this->input_file_->file().filesize() - off;
248 }
249
250 if (hdr->ar_name[0] != '/')
251 {
252 const char* name_end = strchr(hdr->ar_name, '/');
253 if (name_end == NULL
254 || name_end - hdr->ar_name >= static_cast<int>(sizeof hdr->ar_name))
255 {
256 gold_error(_("%s: malformed archive header name at %zu"),
257 this->name().c_str(), static_cast<size_t>(off));
258 return this->input_file_->file().filesize() - off;
259 }
260 pname->assign(hdr->ar_name, name_end - hdr->ar_name);
261 if (nested_off != NULL)
262 *nested_off = 0;
263 }
264 else if (hdr->ar_name[1] == ' ')
265 {
266 // This is the symbol table.
267 pname->clear();
268 }
269 else if (hdr->ar_name[1] == '/')
270 {
271 // This is the extended name table.
272 pname->assign(1, '/');
273 }
274 else
275 {
276 errno = 0;
277 long x = strtol(hdr->ar_name + 1, &end, 10);
278 long y = 0;
279 if (*end == ':')
280 y = strtol(end + 1, &end, 10);
281 if (*end != ' '
282 || x < 0
283 || (x == LONG_MAX && errno == ERANGE)
284 || static_cast<size_t>(x) >= this->extended_names_.size())
285 {
286 gold_error(_("%s: bad extended name index at %zu"),
287 this->name().c_str(), static_cast<size_t>(off));
288 return this->input_file_->file().filesize() - off;
289 }
290
291 const char* name = this->extended_names_.data() + x;
292 const char* name_end = strchr(name, '\n');
293 if (static_cast<size_t>(name_end - name) > this->extended_names_.size()
294 || name_end[-1] != '/')
295 {
296 gold_error(_("%s: bad extended name entry at header %zu"),
297 this->name().c_str(), static_cast<size_t>(off));
298 return this->input_file_->file().filesize() - off;
299 }
300 pname->assign(name, name_end - 1 - name);
301 if (nested_off != NULL)
302 *nested_off = y;
303 }
304
305 return member_size;
306 }
307
308 // An archive member iterator.
309
310 class Archive::const_iterator
311 {
312 public:
313 // The header of an archive member. This is what this iterator
314 // points to.
315 struct Header
316 {
317 // The name of the member.
318 std::string name;
319 // The file offset of the member.
320 off_t off;
321 // The file offset of a nested archive member.
322 off_t nested_off;
323 // The size of the member.
324 off_t size;
325 };
326
327 const_iterator(Archive* archive, off_t off)
328 : archive_(archive), off_(off)
329 { this->read_next_header(); }
330
331 const Header&
332 operator*() const
333 { return this->header_; }
334
335 const Header*
336 operator->() const
337 { return &this->header_; }
338
339 const_iterator&
340 operator++()
341 {
342 if (this->off_ == this->archive_->file().filesize())
343 return *this;
344 this->off_ += sizeof(Archive_header);
345 if (!this->archive_->is_thin_archive())
346 this->off_ += this->header_.size;
347 if ((this->off_ & 1) != 0)
348 ++this->off_;
349 this->read_next_header();
350 return *this;
351 }
352
353 const_iterator
354 operator++(int)
355 {
356 const_iterator ret = *this;
357 ++*this;
358 return ret;
359 }
360
361 bool
362 operator==(const const_iterator p) const
363 { return this->off_ == p->off; }
364
365 bool
366 operator!=(const const_iterator p) const
367 { return this->off_ != p->off; }
368
369 private:
370 void
371 read_next_header();
372
373 // The underlying archive.
374 Archive* archive_;
375 // The current offset in the file.
376 off_t off_;
377 // The current archive header.
378 Header header_;
379 };
380
381 // Read the next archive header.
382
383 void
384 Archive::const_iterator::read_next_header()
385 {
386 off_t filesize = this->archive_->file().filesize();
387 while (true)
388 {
389 if (filesize - this->off_ < static_cast<off_t>(sizeof(Archive_header)))
390 {
391 if (filesize != this->off_)
392 {
393 gold_error(_("%s: short archive header at %zu"),
394 this->archive_->filename().c_str(),
395 static_cast<size_t>(this->off_));
396 this->off_ = filesize;
397 }
398 this->header_.off = filesize;
399 return;
400 }
401
402 unsigned char buf[sizeof(Archive_header)];
403 this->archive_->file().read(this->off_, sizeof(Archive_header), buf);
404
405 const Archive_header* hdr = reinterpret_cast<const Archive_header*>(buf);
406 this->header_.size =
407 this->archive_->interpret_header(hdr, this->off_, &this->header_.name,
408 &this->header_.nested_off);
409 this->header_.off = this->off_;
410
411 // Skip special members.
412 if (!this->header_.name.empty() && this->header_.name != "/")
413 return;
414
415 this->off_ += sizeof(Archive_header) + this->header_.size;
416 if ((this->off_ & 1) != 0)
417 ++this->off_;
418 }
419 }
420
421 // Initial iterator.
422
423 Archive::const_iterator
424 Archive::begin()
425 {
426 return Archive::const_iterator(this, sarmag);
427 }
428
429 // Final iterator.
430
431 Archive::const_iterator
432 Archive::end()
433 {
434 return Archive::const_iterator(this, this->input_file_->file().filesize());
435 }
436
437 // Get the file and offset for an archive member, which may be an
438 // external member of a thin archive. Set *INPUT_FILE to the
439 // file containing the actual member, *MEMOFF to the offset
440 // within that file (0 if not a nested archive), and *MEMBER_NAME
441 // to the name of the archive member. Return TRUE on success.
442
443 bool
444 Archive::get_file_and_offset(off_t off, Input_file** input_file, off_t* memoff,
445 off_t* memsize, std::string* member_name)
446 {
447 off_t nested_off;
448
449 *memsize = this->read_header(off, false, member_name, &nested_off);
450
451 *input_file = this->input_file_;
452 *memoff = off + static_cast<off_t>(sizeof(Archive_header));
453
454 if (!this->is_thin_archive_)
455 return true;
456
457 // Adjust a relative pathname so that it is relative
458 // to the directory containing the archive.
459 if (!IS_ABSOLUTE_PATH(member_name->c_str()))
460 {
461 const char* arch_path = this->filename().c_str();
462 const char* basename = lbasename(arch_path);
463 if (basename > arch_path)
464 member_name->replace(0, 0,
465 this->filename().substr(0, basename - arch_path));
466 }
467
468 if (nested_off > 0)
469 {
470 // This is a member of a nested archive. Open the containing
471 // archive if we don't already have it open, then do a recursive
472 // call to include the member from that archive.
473 Archive* arch;
474 Nested_archive_table::const_iterator p =
475 this->nested_archives_.find(*member_name);
476 if (p != this->nested_archives_.end())
477 arch = p->second;
478 else
479 {
480 Input_file_argument* input_file_arg =
481 new Input_file_argument(member_name->c_str(), false, "", false,
482 parameters->options());
483 *input_file = new Input_file(input_file_arg);
484 int dummy = 0;
485 if (!(*input_file)->open(*this->dirpath_, this->task_, &dummy))
486 return false;
487 arch = new Archive(*member_name, *input_file, false, this->dirpath_,
488 this->task_);
489 arch->setup();
490 std::pair<Nested_archive_table::iterator, bool> ins =
491 this->nested_archives_.insert(std::make_pair(*member_name, arch));
492 gold_assert(ins.second);
493 }
494 return arch->get_file_and_offset(nested_off, input_file, memoff,
495 memsize, member_name);
496 }
497
498 // This is an external member of a thin archive. Open the
499 // file as a regular relocatable object file.
500 Input_file_argument* input_file_arg =
501 new Input_file_argument(member_name->c_str(), false, "", false,
502 this->input_file_->options());
503 *input_file = new Input_file(input_file_arg);
504 int dummy = 0;
505 if (!(*input_file)->open(*this->dirpath_, this->task_, &dummy))
506 return false;
507
508 *memoff = 0;
509 *memsize = (*input_file)->file().filesize();
510 return true;
511 }
512
513 // Return an ELF object for the member at offset OFF. If the ELF
514 // object has an unsupported target type, set *PUNCONFIGURED to true
515 // and return NULL.
516
517 Object*
518 Archive::get_elf_object_for_member(off_t off, bool* punconfigured)
519 {
520 *punconfigured = false;
521
522 Input_file* input_file;
523 off_t memoff;
524 off_t memsize;
525 std::string member_name;
526 if (!this->get_file_and_offset(off, &input_file, &memoff, &memsize,
527 &member_name))
528 return NULL;
529
530 if (parameters->options().has_plugins())
531 {
532 Object* obj = parameters->options().plugins()->claim_file(input_file,
533 memoff,
534 memsize);
535 if (obj != NULL)
536 {
537 // The input file was claimed by a plugin, and its symbols
538 // have been provided by the plugin.
539 return obj;
540 }
541 }
542
543 off_t filesize = input_file->file().filesize();
544 int read_size = elfcpp::Elf_sizes<64>::ehdr_size;
545 if (filesize - memoff < read_size)
546 read_size = filesize - memoff;
547
548 if (read_size < 4)
549 {
550 gold_error(_("%s: member at %zu is not an ELF object"),
551 this->name().c_str(), static_cast<size_t>(off));
552 return NULL;
553 }
554
555 const unsigned char* ehdr = input_file->file().get_view(memoff, 0, read_size,
556 true, false);
557
558 static unsigned char elfmagic[4] =
559 {
560 elfcpp::ELFMAG0, elfcpp::ELFMAG1,
561 elfcpp::ELFMAG2, elfcpp::ELFMAG3
562 };
563 if (memcmp(ehdr, elfmagic, 4) != 0)
564 {
565 gold_error(_("%s: member at %zu is not an ELF object"),
566 this->name().c_str(), static_cast<size_t>(off));
567 return NULL;
568 }
569
570 return make_elf_object((std::string(this->input_file_->filename())
571 + "(" + member_name + ")"),
572 input_file, memoff, ehdr, read_size,
573 punconfigured);
574 }
575
576 // Read the symbols from all the archive members in the link.
577
578 void
579 Archive::read_all_symbols()
580 {
581 for (Archive::const_iterator p = this->begin();
582 p != this->end();
583 ++p)
584 this->read_symbols(p->off);
585 }
586
587 // Read the symbols from an archive member in the link. OFF is the file
588 // offset of the member header.
589
590 void
591 Archive::read_symbols(off_t off)
592 {
593 bool dummy;
594 Object* obj = this->get_elf_object_for_member(off, &dummy);
595
596 if (obj == NULL)
597 return;
598
599 Read_symbols_data* sd = new Read_symbols_data;
600 obj->read_symbols(sd);
601 Archive_member member(obj, sd);
602 this->members_[off] = member;
603 }
604
605 // Select members from the archive and add them to the link. We walk
606 // through the elements in the archive map, and look each one up in
607 // the symbol table. If it exists as a strong undefined symbol, we
608 // pull in the corresponding element. We have to do this in a loop,
609 // since pulling in one element may create new undefined symbols which
610 // may be satisfied by other objects in the archive. Return true in
611 // the normal case, false if the first member we tried to add from
612 // this archive had an incompatible target.
613
614 bool
615 Archive::add_symbols(Symbol_table* symtab, Layout* layout,
616 Input_objects* input_objects, Mapfile* mapfile)
617 {
618 ++Archive::total_archives;
619
620 if (this->input_file_->options().whole_archive())
621 return this->include_all_members(symtab, layout, input_objects,
622 mapfile);
623
624 Archive::total_members += this->num_members_;
625
626 input_objects->archive_start(this);
627
628 const size_t armap_size = this->armap_.size();
629
630 // This is a quick optimization, since we usually see many symbols
631 // in a row with the same offset. last_seen_offset holds the last
632 // offset we saw that was present in the seen_offsets_ set.
633 off_t last_seen_offset = -1;
634
635 // Track which symbols in the symbol table we've already found to be
636 // defined.
637
638 bool added_new_object;
639 do
640 {
641 added_new_object = false;
642 for (size_t i = 0; i < armap_size; ++i)
643 {
644 if (this->armap_checked_[i])
645 continue;
646 if (this->armap_[i].file_offset == last_seen_offset)
647 {
648 this->armap_checked_[i] = true;
649 continue;
650 }
651 if (this->seen_offsets_.find(this->armap_[i].file_offset)
652 != this->seen_offsets_.end())
653 {
654 this->armap_checked_[i] = true;
655 last_seen_offset = this->armap_[i].file_offset;
656 continue;
657 }
658
659 const char* sym_name = (this->armap_names_.data()
660 + this->armap_[i].name_offset);
661 Symbol* sym = symtab->lookup(sym_name);
662 if (sym == NULL)
663 {
664 // Check whether the symbol was named in a -u option.
665 if (!parameters->options().is_undefined(sym_name))
666 continue;
667 }
668 else if (!sym->is_undefined())
669 {
670 this->armap_checked_[i] = true;
671 continue;
672 }
673 else if (sym->binding() == elfcpp::STB_WEAK)
674 continue;
675
676 // We want to include this object in the link.
677 last_seen_offset = this->armap_[i].file_offset;
678 this->seen_offsets_.insert(last_seen_offset);
679 this->armap_checked_[i] = true;
680
681 std::string why;
682 if (sym == NULL)
683 {
684 why = "-u ";
685 why += sym_name;
686 }
687 if (!this->include_member(symtab, layout, input_objects,
688 last_seen_offset, mapfile, sym,
689 why.c_str()))
690 return false;
691
692 added_new_object = true;
693 }
694 }
695 while (added_new_object);
696
697 input_objects->archive_stop(this);
698
699 return true;
700 }
701
702 // Include all the archive members in the link. This is for --whole-archive.
703
704 bool
705 Archive::include_all_members(Symbol_table* symtab, Layout* layout,
706 Input_objects* input_objects, Mapfile* mapfile)
707 {
708 input_objects->archive_start(this);
709
710 if (this->members_.size() > 0)
711 {
712 std::map<off_t, Archive_member>::const_iterator p;
713 for (p = this->members_.begin();
714 p != this->members_.end();
715 ++p)
716 {
717 if (!this->include_member(symtab, layout, input_objects, p->first,
718 mapfile, NULL, "--whole-archive"))
719 return false;
720 ++Archive::total_members;
721 }
722 }
723 else
724 {
725 for (Archive::const_iterator p = this->begin();
726 p != this->end();
727 ++p)
728 {
729 if (!this->include_member(symtab, layout, input_objects, p->off,
730 mapfile, NULL, "--whole-archive"))
731 return false;
732 ++Archive::total_members;
733 }
734 }
735
736 input_objects->archive_stop(this);
737
738 return true;
739 }
740
741 // Return the number of members in the archive. This is only used for
742 // reports.
743
744 size_t
745 Archive::count_members()
746 {
747 size_t ret = 0;
748 for (Archive::const_iterator p = this->begin();
749 p != this->end();
750 ++p)
751 ++ret;
752 return ret;
753 }
754
755 // Include an archive member in the link. OFF is the file offset of
756 // the member header. WHY is the reason we are including this member.
757 // Return true if we added the member or if we had an error, return
758 // false if this was the first member we tried to add from this
759 // archive and it had an incompatible format.
760
761 bool
762 Archive::include_member(Symbol_table* symtab, Layout* layout,
763 Input_objects* input_objects, off_t off,
764 Mapfile* mapfile, Symbol* sym, const char* why)
765 {
766 ++Archive::total_members_loaded;
767
768 std::map<off_t, Archive_member>::const_iterator p = this->members_.find(off);
769 if (p != this->members_.end())
770 {
771 Object *obj = p->second.obj_;
772
773 if (!this->included_member_
774 && this->searched_for()
775 && !parameters->is_compatible_target(obj->target()))
776 return false;
777
778 Read_symbols_data *sd = p->second.sd_;
779 if (mapfile != NULL)
780 mapfile->report_include_archive_member(obj->name(), sym, why);
781 if (input_objects->add_object(obj))
782 {
783 obj->layout(symtab, layout, sd);
784 obj->add_symbols(symtab, sd, layout);
785 this->included_member_ = true;
786 }
787 delete sd;
788 return true;
789 }
790
791 bool unconfigured;
792 Object* obj = this->get_elf_object_for_member(off, &unconfigured);
793
794 if (!this->included_member_
795 && this->searched_for()
796 && (obj == NULL
797 ? unconfigured
798 : !parameters->is_compatible_target(obj->target())))
799 {
800 if (obj != NULL)
801 delete obj;
802 return false;
803 }
804
805 if (obj == NULL)
806 return true;
807
808 if (mapfile != NULL)
809 mapfile->report_include_archive_member(obj->name(), sym, why);
810
811 Pluginobj* pluginobj = obj->pluginobj();
812 if (pluginobj != NULL)
813 {
814 pluginobj->add_symbols(symtab, NULL, layout);
815 this->included_member_ = true;
816 return true;
817 }
818
819 if (!input_objects->add_object(obj))
820 delete obj;
821 else
822 {
823 Read_symbols_data sd;
824 obj->read_symbols(&sd);
825 obj->layout(symtab, layout, &sd);
826 obj->add_symbols(symtab, &sd, layout);
827
828 // If this is an external member of a thin archive, unlock the file
829 // for the next task.
830 if (obj->offset() == 0)
831 obj->unlock(this->task_);
832
833 this->included_member_ = true;
834 }
835
836 return true;
837 }
838
839 // Print statistical information to stderr. This is used for --stats.
840
841 void
842 Archive::print_stats()
843 {
844 fprintf(stderr, _("%s: archive libraries: %u\n"),
845 program_name, Archive::total_archives);
846 fprintf(stderr, _("%s: total archive members: %u\n"),
847 program_name, Archive::total_members);
848 fprintf(stderr, _("%s: loaded archive members: %u\n"),
849 program_name, Archive::total_members_loaded);
850 }
851
852 // Add_archive_symbols methods.
853
854 Add_archive_symbols::~Add_archive_symbols()
855 {
856 if (this->this_blocker_ != NULL)
857 delete this->this_blocker_;
858 // next_blocker_ is deleted by the task associated with the next
859 // input file.
860 }
861
862 // Return whether we can add the archive symbols. We are blocked by
863 // this_blocker_. We block next_blocker_. We also lock the file.
864
865 Task_token*
866 Add_archive_symbols::is_runnable()
867 {
868 if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
869 return this->this_blocker_;
870 return NULL;
871 }
872
873 void
874 Add_archive_symbols::locks(Task_locker* tl)
875 {
876 tl->add(this, this->next_blocker_);
877 tl->add(this, this->archive_->token());
878 }
879
880 void
881 Add_archive_symbols::run(Workqueue* workqueue)
882 {
883 bool added = this->archive_->add_symbols(this->symtab_, this->layout_,
884 this->input_objects_,
885 this->mapfile_);
886 this->archive_->unlock_nested_archives();
887
888 this->archive_->release();
889 this->archive_->clear_uncached_views();
890
891 if (!added)
892 {
893 // This archive holds object files which are incompatible with
894 // our output file.
895 Read_symbols::incompatible_warning(this->input_argument_,
896 this->archive_->input_file());
897 Read_symbols::requeue(workqueue, this->input_objects_, this->symtab_,
898 this->layout_, this->dirpath_, this->dirindex_,
899 this->mapfile_, this->input_argument_,
900 this->input_group_, this->next_blocker_);
901 delete this->archive_;
902 return;
903 }
904
905 if (this->input_group_ != NULL)
906 this->input_group_->add_archive(this->archive_);
907 else
908 {
909 // We no longer need to know about this archive.
910 delete this->archive_;
911 this->archive_ = NULL;
912 }
913 }
914
915 } // End namespace gold.
This page took 0.051684 seconds and 5 git commands to generate.