2010-03-15 Rafael Espindola <espindola@google.com>
[external/binutils.git] / gold / readsyms.cc
1 // readsyms.cc -- read input file symbols for gold
2
3 // Copyright 2006, 2007, 2008, 2009, 2010 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 <cstring>
26
27 #include "elfcpp.h"
28 #include "options.h"
29 #include "dirsearch.h"
30 #include "symtab.h"
31 #include "object.h"
32 #include "archive.h"
33 #include "script.h"
34 #include "readsyms.h"
35 #include "plugin.h"
36 #include "layout.h"
37 #include "incremental.h"
38
39 namespace gold
40 {
41
42 // If we fail to open the object, then we won't create an Add_symbols
43 // task.  However, we still need to unblock the token, or else the
44 // link won't proceed to generate more error messages.  We can only
45 // unblock tokens when the workqueue lock is held, so we need a dummy
46 // task to do that.  The dummy task has to maintain the right sequence
47 // of blocks, so we need both this_blocker and next_blocker.
48
49 class Unblock_token : public Task
50 {
51  public:
52   Unblock_token(Task_token* this_blocker, Task_token* next_blocker)
53     : this_blocker_(this_blocker), next_blocker_(next_blocker)
54   { }
55
56   ~Unblock_token()
57   {
58     if (this->this_blocker_ != NULL)
59       delete this->this_blocker_;
60   }
61
62   Task_token*
63   is_runnable()
64   {
65     if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
66       return this->this_blocker_;
67     return NULL;
68   }
69
70   void
71   locks(Task_locker* tl)
72   { tl->add(this, this->next_blocker_); }
73
74   void
75   run(Workqueue*)
76   { }
77
78   std::string
79   get_name() const
80   { return "Unblock_token"; }
81
82  private:
83   Task_token* this_blocker_;
84   Task_token* next_blocker_;
85 };
86
87 // Class read_symbols.
88
89 Read_symbols::~Read_symbols()
90 {
91   // The this_blocker_ and next_blocker_ pointers are passed on to the
92   // Add_symbols task.
93 }
94
95 // If appropriate, issue a warning about skipping an incompatible
96 // file.
97
98 void
99 Read_symbols::incompatible_warning(const Input_argument* input_argument,
100                                    const Input_file* input_file)
101 {
102   if (parameters->options().warn_search_mismatch())
103     gold_warning("skipping incompatible %s while searching for %s",
104                  input_file->filename().c_str(),
105                  input_argument->file().name());
106 }
107
108 // Requeue a Read_symbols task to search for the next object with the
109 // same name.
110
111 void
112 Read_symbols::requeue(Workqueue* workqueue, Input_objects* input_objects,
113                       Symbol_table* symtab, Layout* layout, Dirsearch* dirpath,
114                       int dirindex, Mapfile* mapfile,
115                       const Input_argument* input_argument,
116                       Input_group* input_group, Task_token* next_blocker)
117 {
118   // Bump the directory search index.
119   ++dirindex;
120
121   // We don't need to worry about this_blocker, since we already
122   // reached it.  However, we are removing the blocker on next_blocker
123   // because the calling task is completing.  So we need to add a new
124   // blocker.  Since next_blocker may be shared by several tasks, we
125   // need to increment the count with the workqueue lock held.
126   workqueue->add_blocker(next_blocker);
127
128   workqueue->queue(new Read_symbols(input_objects, symtab, layout, dirpath,
129                                     dirindex, mapfile, input_argument,
130                                     input_group, NULL, next_blocker));
131 }
132
133 // Return whether a Read_symbols task is runnable.  We can read an
134 // ordinary input file immediately.  For an archive specified using
135 // -l, we have to wait until the search path is complete.
136
137 Task_token*
138 Read_symbols::is_runnable()
139 {
140   if (this->input_argument_->is_file()
141       && this->input_argument_->file().may_need_search()
142       && this->dirpath_->token()->is_blocked())
143     return this->dirpath_->token();
144
145   return NULL;
146 }
147
148 // Return a Task_locker for a Read_symbols task.  We don't need any
149 // locks here.
150
151 void
152 Read_symbols::locks(Task_locker*)
153 {
154 }
155
156 // Run a Read_symbols task.
157
158 void
159 Read_symbols::run(Workqueue* workqueue)
160 {
161   // If we didn't queue a new task, then we need to explicitly unblock
162   // the token.
163   if (!this->do_read_symbols(workqueue))
164     workqueue->queue_soon(new Unblock_token(this->this_blocker_,
165                                             this->next_blocker_));
166 }
167
168 // Open the file and read the symbols.  Return true if a new task was
169 // queued, false if that could not happen due to some error.
170
171 bool
172 Read_symbols::do_read_symbols(Workqueue* workqueue)
173 {
174   if (this->input_argument_->is_group())
175     {
176       gold_assert(this->input_group_ == NULL);
177       this->do_group(workqueue);
178       return true;
179     }
180
181   Input_file* input_file = new Input_file(&this->input_argument_->file());
182   if (!input_file->open(*this->dirpath_, this, &this->dirindex_))
183     return false;
184
185   // Read enough of the file to pick up the entire ELF header.
186
187   off_t filesize = input_file->file().filesize();
188
189   if (filesize == 0)
190     {
191       gold_error(_("%s: file is empty"),
192                  input_file->file().filename().c_str());
193       return false;
194     }
195
196   const unsigned char* ehdr;
197   int read_size;
198   bool is_elf = is_elf_object(input_file, 0, &ehdr, &read_size);
199
200   if (read_size >= Archive::sarmag)
201     {
202       bool is_thin_archive
203           = memcmp(ehdr, Archive::armagt, Archive::sarmag) == 0;
204       if (is_thin_archive
205           || memcmp(ehdr, Archive::armag, Archive::sarmag) == 0)
206         {
207           // This is an archive.
208           Archive* arch = new Archive(this->input_argument_->file().name(),
209                                       input_file, is_thin_archive,
210                                       this->dirpath_, this);
211           arch->setup();
212
213           if (this->layout_->incremental_inputs())
214             {
215               const Input_argument* ia = this->input_argument_;       
216               this->layout_->incremental_inputs()->report_archive(ia, arch);
217             }
218
219           // Unlock the archive so it can be used in the next task.
220           arch->unlock(this);
221
222           workqueue->queue_next(new Add_archive_symbols(this->symtab_,
223                                                         this->layout_,
224                                                         this->input_objects_,
225                                                         this->dirpath_,
226                                                         this->dirindex_,
227                                                         this->mapfile_,
228                                                         this->input_argument_,
229                                                         arch,
230                                                         this->input_group_,
231                                                         this->this_blocker_,
232                                                         this->next_blocker_));
233           return true;
234         }
235     }
236
237   if (parameters->options().has_plugins())
238     {
239       Pluginobj* obj = parameters->options().plugins()->claim_file(input_file,
240                                                                    0, filesize);
241       if (obj != NULL)
242         {
243           // The input file was claimed by a plugin, and its symbols
244           // have been provided by the plugin.
245
246           // We are done with the file at this point, so unlock it.
247           obj->unlock(this);
248
249           workqueue->queue_next(new Add_symbols(this->input_objects_,
250                                                 this->symtab_,
251                                                 this->layout_,
252                                                 this->dirpath_,
253                                                 this->dirindex_,
254                                                 this->mapfile_,
255                                                 this->input_argument_,
256                                                 obj,
257                                                 NULL,
258                                                 this->this_blocker_,
259                                                 this->next_blocker_));
260           return true;
261         }
262     }
263
264   if (is_elf)
265     {
266       // This is an ELF object.
267
268       bool unconfigured = false;
269       bool* punconfigured = (input_file->will_search_for()
270                              ? &unconfigured
271                              : NULL);
272       Object* obj = make_elf_object(input_file->filename(),
273                                     input_file, 0, ehdr, read_size,
274                                     punconfigured);
275       if (obj == NULL)
276         {
277           if (unconfigured)
278             {
279               Read_symbols::incompatible_warning(this->input_argument_,
280                                                  input_file);
281               input_file->file().release();
282               input_file->file().unlock(this);
283               delete input_file;
284               ++this->dirindex_;
285               return this->do_read_symbols(workqueue);
286             }
287           return false;
288         }
289
290       Read_symbols_data* sd = new Read_symbols_data;
291       obj->read_symbols(sd);
292
293       if (this->layout_->incremental_inputs())
294         {
295           const Input_argument* ia = this->input_argument_;
296           this->layout_->incremental_inputs()->report_object(ia, obj);
297         }
298
299       // Opening the file locked it, so now we need to unlock it.  We
300       // need to unlock it before queuing the Add_symbols task,
301       // because the workqueue doesn't know about our lock on the
302       // file.  If we queue the Add_symbols task first, it will be
303       // stuck on the end of the file lock, but since the workqueue
304       // doesn't know about that lock, it will never release the
305       // Add_symbols task.
306
307       input_file->file().unlock(this);
308
309       // We use queue_next because everything is cached for this
310       // task to run right away if possible.
311
312       workqueue->queue_next(new Add_symbols(this->input_objects_,
313                                             this->symtab_, this->layout_,
314                                             this->dirpath_,
315                                             this->dirindex_,
316                                             this->mapfile_,
317                                             this->input_argument_,
318                                             obj,
319                                             sd,
320                                             this->this_blocker_,
321                                             this->next_blocker_));
322
323       return true;
324     }
325
326   // Queue up a task to try to parse this file as a script.  We use a
327   // separate task so that the script will be read in order with other
328   // objects named on the command line.  Also so that we don't try to
329   // read multiple scripts simultaneously, which could lead to
330   // unpredictable changes to the General_options structure.
331
332   workqueue->queue_soon(new Read_script(this->symtab_,
333                                         this->layout_,
334                                         this->dirpath_,
335                                         this->dirindex_,
336                                         this->input_objects_,
337                                         this->mapfile_,
338                                         this->input_group_,
339                                         this->input_argument_,
340                                         input_file,
341                                         this->this_blocker_,
342                                         this->next_blocker_));
343   return true;
344 }
345
346 // Handle a group.  We need to walk through the arguments over and
347 // over until we don't see any new undefined symbols.  We do this by
348 // setting off Read_symbols Tasks as usual, but recording the archive
349 // entries instead of deleting them.  We also start a Finish_group
350 // Task which runs after we've read all the symbols.  In that task we
351 // process the archives in a loop until we are done.
352
353 void
354 Read_symbols::do_group(Workqueue* workqueue)
355 {
356   Input_group* input_group = new Input_group();
357
358   const Input_file_group* group = this->input_argument_->group();
359   Task_token* this_blocker = this->this_blocker_;
360
361   Finish_group* finish_group = new Finish_group(this->input_objects_,
362                                                 this->symtab_,
363                                                 this->layout_,
364                                                 this->mapfile_,
365                                                 input_group,
366                                                 this->next_blocker_);
367
368   Task_token* next_blocker = new Task_token(true);
369   next_blocker->add_blocker();
370   workqueue->queue_soon(new Start_group(this->symtab_, finish_group,
371                                         this_blocker, next_blocker));
372   this_blocker = next_blocker;
373
374   for (Input_file_group::const_iterator p = group->begin();
375        p != group->end();
376        ++p)
377     {
378       const Input_argument* arg = &*p;
379       gold_assert(arg->is_file());
380
381       next_blocker = new Task_token(true);
382       next_blocker->add_blocker();
383       workqueue->queue_soon(new Read_symbols(this->input_objects_,
384                                              this->symtab_, this->layout_,
385                                              this->dirpath_, this->dirindex_,
386                                              this->mapfile_, arg, input_group,
387                                              this_blocker, next_blocker));
388       this_blocker = next_blocker;
389     }
390
391   finish_group->set_blocker(this_blocker);
392
393   workqueue->queue_soon(finish_group);
394 }
395
396 // Return a debugging name for a Read_symbols task.
397
398 std::string
399 Read_symbols::get_name() const
400 {
401   if (!this->input_argument_->is_group())
402     {
403       std::string ret("Read_symbols ");
404       if (this->input_argument_->file().is_lib())
405         ret += "-l";
406       else if (this->input_argument_->file().is_searched_file())
407         ret += "-l:";
408       ret += this->input_argument_->file().name();
409       return ret;
410     }
411
412   std::string ret("Read_symbols group (");
413   bool add_space = false;
414   const Input_file_group* group = this->input_argument_->group();
415   for (Input_file_group::const_iterator p = group->begin();
416        p != group->end();
417        ++p)
418     {
419       if (add_space)
420         ret += ' ';
421       ret += p->file().name();
422       add_space = true;
423     }
424   return ret + ')';
425 }
426
427 // Class Add_symbols.
428
429 Add_symbols::~Add_symbols()
430 {
431   if (this->this_blocker_ != NULL)
432     delete this->this_blocker_;
433   // next_blocker_ is deleted by the task associated with the next
434   // input file.
435 }
436
437 // We are blocked by this_blocker_.  We block next_blocker_.  We also
438 // lock the file.
439
440 Task_token*
441 Add_symbols::is_runnable()
442 {
443   if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
444     return this->this_blocker_;
445   if (this->object_->is_locked())
446     return this->object_->token();
447   return NULL;
448 }
449
450 void
451 Add_symbols::locks(Task_locker* tl)
452 {
453   tl->add(this, this->next_blocker_);
454   tl->add(this, this->object_->token());
455 }
456
457 // Add the symbols in the object to the symbol table.
458
459 void
460 Add_symbols::run(Workqueue*)
461 {
462   Pluginobj* pluginobj = this->object_->pluginobj();
463   if (pluginobj != NULL)
464     {
465       this->object_->add_symbols(this->symtab_, this->sd_, this->layout_);
466       return;
467     }
468
469   if (!this->input_objects_->add_object(this->object_))
470     {
471       delete this->sd_;
472       this->sd_ = NULL;
473       this->object_->release();
474       delete this->object_;
475     }
476   else
477     {
478       this->object_->layout(this->symtab_, this->layout_, this->sd_);
479       this->object_->add_symbols(this->symtab_, this->sd_, this->layout_);
480       delete this->sd_;
481       this->sd_ = NULL;
482       this->object_->release();
483     }
484 }
485
486 // Class Start_group.
487
488 Start_group::~Start_group()
489 {
490   if (this->this_blocker_ != NULL)
491     delete this->this_blocker_;
492   // next_blocker_ is deleted by the task associated with the first
493   // file in the group.
494 }
495
496 // We need to wait for THIS_BLOCKER_ and unblock NEXT_BLOCKER_.
497
498 Task_token*
499 Start_group::is_runnable()
500 {
501   if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
502     return this->this_blocker_;
503   return NULL;
504 }
505
506 void
507 Start_group::locks(Task_locker* tl)
508 {
509   tl->add(this, this->next_blocker_);
510 }
511
512 // Store the number of undefined symbols we see now.
513
514 void
515 Start_group::run(Workqueue*)
516 {
517   this->finish_group_->set_saw_undefined(this->symtab_->saw_undefined());
518 }
519
520 // Class Finish_group.
521
522 Finish_group::~Finish_group()
523 {
524   if (this->this_blocker_ != NULL)
525     delete this->this_blocker_;
526   // next_blocker_ is deleted by the task associated with the next
527   // input file following the group.
528 }
529
530 // We need to wait for THIS_BLOCKER_ and unblock NEXT_BLOCKER_.
531
532 Task_token*
533 Finish_group::is_runnable()
534 {
535   if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
536     return this->this_blocker_;
537   return NULL;
538 }
539
540 void
541 Finish_group::locks(Task_locker* tl)
542 {
543   tl->add(this, this->next_blocker_);
544 }
545
546 // Loop over the archives until there are no new undefined symbols.
547
548 void
549 Finish_group::run(Workqueue*)
550 {
551   size_t saw_undefined = this->saw_undefined_;
552   while (saw_undefined != this->symtab_->saw_undefined())
553     {
554       saw_undefined = this->symtab_->saw_undefined();
555
556       for (Input_group::const_iterator p = this->input_group_->begin();
557            p != this->input_group_->end();
558            ++p)
559         {
560           Task_lock_obj<Archive> tl(this, *p);
561
562           (*p)->add_symbols(this->symtab_, this->layout_,
563                             this->input_objects_, this->mapfile_);
564         }
565     }
566
567   // Delete all the archives now that we no longer need them.
568   for (Input_group::const_iterator p = this->input_group_->begin();
569        p != this->input_group_->end();
570        ++p)
571     delete *p;
572   delete this->input_group_;
573 }
574
575 // Class Read_script
576
577 Read_script::~Read_script()
578 {
579   if (this->this_blocker_ != NULL)
580     delete this->this_blocker_;
581   // next_blocker_ is deleted by the task associated with the next
582   // input file.
583 }
584
585 // We are blocked by this_blocker_.
586
587 Task_token*
588 Read_script::is_runnable()
589 {
590   if (this->this_blocker_ != NULL && this->this_blocker_->is_blocked())
591     return this->this_blocker_;
592   return NULL;
593 }
594
595 // We don't unlock next_blocker_ here.  If the script names any input
596 // files, then the last file will be responsible for unlocking it.
597
598 void
599 Read_script::locks(Task_locker*)
600 {
601 }
602
603 // Read the script, if it is a script.
604
605 void
606 Read_script::run(Workqueue* workqueue)
607 {
608   bool used_next_blocker;
609   if (!read_input_script(workqueue, this->symtab_, this->layout_,
610                          this->dirpath_, this->dirindex_, this->input_objects_,
611                          this->mapfile_, this->input_group_,
612                          this->input_argument_, this->input_file_,
613                          this->next_blocker_, &used_next_blocker))
614     {
615       // Here we have to handle any other input file types we need.
616       gold_error(_("%s: not an object or archive"),
617                  this->input_file_->file().filename().c_str());
618     }
619
620   if (!used_next_blocker)
621     {
622       // Queue up a task to unlock next_blocker.  We can't just unlock
623       // it here, as we don't hold the workqueue lock.
624       workqueue->queue_soon(new Unblock_token(NULL, this->next_blocker_));
625     }
626 }
627
628 // Return a debugging name for a Read_script task.
629
630 std::string
631 Read_script::get_name() const
632 {
633   std::string ret("Read_script ");
634   if (this->input_argument_->file().is_lib())
635     ret += "-l";
636   else if (this->input_argument_->file().is_searched_file())
637     ret += "-l:";
638   ret += this->input_argument_->file().name();
639   return ret;
640 }
641
642 } // End namespace gold.