gold/gold.cc

   1 // gold.cc -- main linker functions
   2
   3 // Copyright 2006, 2007 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 <cstdlib>
  26 #include <cstdio>
  27 #include <cstring>
  28 #include <unistd.h>
  29 #include "libiberty.h"
  30
  31 #include "options.h"
  32 #include "workqueue.h"
  33 #include "dirsearch.h"
  34 #include "readsyms.h"
  35 #include "symtab.h"
  36 #include "common.h"
  37 #include "object.h"
  38 #include "layout.h"
  39 #include "reloc.h"
  40 #include "defstd.h"
  41
  42 namespace gold
  43 {
  44
  45 const char* program_name;
  46
  47 void
  48 gold_exit(bool status)
  49 {
  50   if (!status && parameters != NULL)
  51     unlink_if_ordinary(parameters->output_file_name());
  52   exit(status ? EXIT_SUCCESS : EXIT_FAILURE);
  53 }
  54
  55 void
  56 gold_nomem()
  57 {
  58   // We are out of memory, so try hard to print a reasonable message.
  59   // Note that we don't try to translate this message, since the
  60   // translation process itself will require memory.
  61   write(2, program_name, strlen(program_name));
  62   const char* const s = ": out of memory\n";
  63   write(2, s, strlen(s));
  64   gold_exit(false);
  65 }
  66
  67 // Handle an unreachable case.
  68
  69 void
  70 do_gold_unreachable(const char* filename, int lineno, const char* function)
  71 {
  72   fprintf(stderr, _("%s: internal error in %s, at %s:%d\n"),
  73           program_name, function, filename, lineno);
  74   gold_exit(false);
  75 }
  76
  77 // This class arranges to run the functions done in the middle of the
  78 // link.  It is just a closure.
  79
  80 class Middle_runner : public Task_function_runner
  81 {
  82  public:
  83   Middle_runner(const General_options& options,
  84                 const Input_objects* input_objects,
  85                 Symbol_table* symtab,
  86                 Layout* layout)
  87     : options_(options), input_objects_(input_objects), symtab_(symtab),
  88       layout_(layout)
  89   { }
  90
  91   void
  92   run(Workqueue*);
  93
  94  private:
  95   const General_options& options_;
  96   const Input_objects* input_objects_;
  97   Symbol_table* symtab_;
  98   Layout* layout_;
  99 };
 100
 101 void
 102 Middle_runner::run(Workqueue* workqueue)
 103 {
 104   queue_middle_tasks(this->options_, this->input_objects_, this->symtab_,
 105                      this->layout_, workqueue);
 106 }
 107
 108 // Queue up the initial set of tasks for this link job.
 109
 110 void
 111 queue_initial_tasks(const General_options& options,
 112                     const Dirsearch& search_path,
 113                     const Command_line& cmdline,
 114                     Workqueue* workqueue, Input_objects* input_objects,
 115                     Symbol_table* symtab, Layout* layout)
 116 {
 117   if (cmdline.begin() == cmdline.end())
 118     gold_fatal(_("no input files"));
 119
 120   int thread_count = options.thread_count_initial();
 121   if (thread_count == 0)
 122     thread_count = cmdline.number_of_input_files();
 123   workqueue->set_thread_count(thread_count);
 124
 125   // Read the input files.  We have to add the symbols to the symbol
 126   // table in order.  We do this by creating a separate blocker for
 127   // each input file.  We associate the blocker with the following
 128   // input file, to give us a convenient place to delete it.
 129   Task_token* this_blocker = NULL;
 130   for (Command_line::const_iterator p = cmdline.begin();
 131        p != cmdline.end();
 132        ++p)
 133     {
 134       Task_token* next_blocker = new Task_token();
 135       next_blocker->add_blocker();
 136       workqueue->queue(new Read_symbols(options, input_objects, symtab, layout,
 137                                         search_path, &*p, NULL, this_blocker,
 138                                         next_blocker));
 139       this_blocker = next_blocker;
 140     }
 141
 142   workqueue->queue(new Task_function(new Middle_runner(options,
 143                                                        input_objects,
 144                                                        symtab,
 145                                                        layout),
 146                                      this_blocker));
 147 }
 148
 149 // Queue up the middle set of tasks.  These are the tasks which run
 150 // after all the input objects have been found and all the symbols
 151 // have been read, but before we lay out the output file.
 152
 153 void
 154 queue_middle_tasks(const General_options& options,
 155                    const Input_objects* input_objects,
 156                    Symbol_table* symtab,
 157                    Layout* layout,
 158                    Workqueue* workqueue)
 159 {
 160   if (input_objects->number_of_input_objects() == 0)
 161     {
 162       // We had some input files, but we weren't able to open any of
 163       // them.
 164       gold_fatal(_("no input files"));
 165     }
 166
 167   int thread_count = options.thread_count_middle();
 168   if (thread_count == 0)
 169     thread_count = input_objects->number_of_input_objects();
 170   workqueue->set_thread_count(thread_count);
 171
 172   // Now we have seen all the input files.
 173   const bool doing_static_link = (!input_objects->any_dynamic()
 174                                   && !parameters->output_is_shared());
 175   set_parameters_doing_static_link(doing_static_link);
 176   if (!doing_static_link && options.is_static())
 177     {
 178       // We print out just the first .so we see; there may be others.
 179       gold_error(_("cannot mix -static with dynamic object %s"),
 180                  (*input_objects->dynobj_begin())->name().c_str());
 181     }
 182
 183   // Define some sections and symbols needed for a dynamic link.  This
 184   // handles some cases we want to see before we read the relocs.
 185   layout->create_initial_dynamic_sections(input_objects, symtab);
 186
 187   // Predefine standard symbols.  This should be fast, so we don't
 188   // bother to create a task for it.
 189   define_standard_symbols(symtab, layout, input_objects->target());
 190
 191   // Define __start and __stop symbols for output sections where
 192   // appropriate.
 193   layout->define_section_symbols(symtab, input_objects->target());
 194
 195   // Read the relocations of the input files.  We do this to find
 196   // which symbols are used by relocations which require a GOT and/or
 197   // a PLT entry, or a COPY reloc.  When we implement garbage
 198   // collection we will do it here by reading the relocations in a
 199   // breadth first search by references.
 200   //
 201   // We could also read the relocations during the first pass, and
 202   // mark symbols at that time.  That is how the old GNU linker works.
 203   // Doing that is more complex, since we may later decide to discard
 204   // some of the sections, and thus change our minds about the types
 205   // of references made to the symbols.
 206   Task_token* blocker = new Task_token();
 207   Task_token* symtab_lock = new Task_token();
 208   for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
 209        p != input_objects->relobj_end();
 210        ++p)
 211     {
 212       // We can read and process the relocations in any order.  But we
 213       // only want one task to write to the symbol table at a time.
 214       // So we queue up a task for each object to read the
 215       // relocations.  That task will in turn queue a task to wait
 216       // until it can write to the symbol table.
 217       blocker->add_blocker();
 218       workqueue->queue(new Read_relocs(options, symtab, layout, *p,
 219                                        symtab_lock, blocker));
 220     }
 221
 222   // Allocate common symbols.  This requires write access to the
 223   // symbol table, but is independent of the relocation processing.
 224   blocker->add_blocker();
 225   workqueue->queue(new Allocate_commons_task(options, symtab, layout,
 226                                              symtab_lock, blocker));
 227
 228   // When all those tasks are complete, we can start laying out the
 229   // output file.
 230   workqueue->queue(new Task_function(new Layout_task_runner(options,
 231                                                             input_objects,
 232                                                             symtab,
 233                                                             layout),
 234                                      blocker));
 235 }
 236
 237 // Queue up the final set of tasks.  This is called at the end of
 238 // Layout_task.
 239
 240 void
 241 queue_final_tasks(const General_options& options,
 242                   const Input_objects* input_objects,
 243                   const Symbol_table* symtab,
 244                   const Layout* layout,
 245                   Workqueue* workqueue,
 246                   Output_file* of)
 247 {
 248   int thread_count = options.thread_count_final();
 249   if (thread_count == 0)
 250     thread_count = input_objects->number_of_input_objects();
 251   workqueue->set_thread_count(thread_count);
 252
 253   // Use a blocker to block the final cleanup task.
 254   Task_token* final_blocker = new Task_token();
 255
 256   // Queue a task for each input object to relocate the sections and
 257   // write out the local symbols.
 258   for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
 259        p != input_objects->relobj_end();
 260        ++p)
 261     {
 262       final_blocker->add_blocker();
 263       workqueue->queue(new Relocate_task(options, symtab, layout, *p, of,
 264                                          final_blocker));
 265     }
 266
 267   // Queue a task to write out the symbol table.
 268   final_blocker->add_blocker();
 269   workqueue->queue(new Write_symbols_task(symtab,
 270                                           input_objects->target(),
 271                                           layout->sympool(),
 272                                           layout->dynpool(),
 273                                           of,
 274                                           final_blocker));
 275
 276   // Queue a task to write out everything else.
 277   final_blocker->add_blocker();
 278   workqueue->queue(new Write_data_task(layout, symtab, of, final_blocker));
 279
 280   // Queue a task to close the output file.  This will be blocked by
 281   // FINAL_BLOCKER.
 282   workqueue->queue(new Task_function(new Close_task_runner(of),
 283                                      final_blocker));
 284 }
 285
 286 } // End namespace gold.