1 // gold.cc -- main linker functions
11 #include "workqueue.h"
12 #include "dirsearch.h"
24 const char* program_name
;
27 gold_exit(bool status
)
29 exit(status
? EXIT_SUCCESS
: EXIT_FAILURE
);
33 gold_fatal(const char* msg
, bool perrno
)
35 fprintf(stderr
, "%s: ", program_name
);
39 fprintf(stderr
, "%s\n", msg
);
46 // We are out of memory, so try hard to print a reasonable message.
47 // Note that we don't try to translate this message, since the
48 // translation process itself will require memory.
49 write(2, program_name
, strlen(program_name
));
50 const char* const s
= ": out of memory\n";
51 write(2, s
, strlen(s
));
55 // Handle an unreachable case.
58 do_gold_unreachable(const char* filename
, int lineno
, const char* function
)
60 fprintf(stderr
, "%s: internal error in %s, at %s:%d\n",
61 program_name
, function
, filename
, lineno
);
65 // This class arranges to run the functions done in the middle of the
66 // link. It is just a closure.
68 class Middle_runner
: public Task_function_runner
71 Middle_runner(const General_options
& options
,
72 const Input_objects
* input_objects
,
75 : options_(options
), input_objects_(input_objects
), symtab_(symtab
),
83 const General_options
& options_
;
84 const Input_objects
* input_objects_
;
85 Symbol_table
* symtab_
;
90 Middle_runner::run(Workqueue
* workqueue
)
92 queue_middle_tasks(this->options_
, this->input_objects_
, this->symtab_
,
93 this->layout_
, workqueue
);
96 // Queue up the initial set of tasks for this link job.
99 queue_initial_tasks(const General_options
& options
,
100 const Dirsearch
& search_path
,
101 const Command_line
& cmdline
,
102 Workqueue
* workqueue
, Input_objects
* input_objects
,
103 Symbol_table
* symtab
, Layout
* layout
)
105 if (cmdline
.begin() == cmdline
.end())
106 gold_fatal(_("no input files"), false);
108 // Read the input files. We have to add the symbols to the symbol
109 // table in order. We do this by creating a separate blocker for
110 // each input file. We associate the blocker with the following
111 // input file, to give us a convenient place to delete it.
112 Task_token
* this_blocker
= NULL
;
113 for (Command_line::const_iterator p
= cmdline
.begin();
117 Task_token
* next_blocker
= new Task_token();
118 next_blocker
->add_blocker();
119 workqueue
->queue(new Read_symbols(options
, input_objects
, symtab
, layout
,
120 search_path
, &*p
, NULL
, this_blocker
,
122 this_blocker
= next_blocker
;
125 workqueue
->queue(new Task_function(new Middle_runner(options
,
132 // Queue up the middle set of tasks. These are the tasks which run
133 // after all the input objects have been found and all the symbols
134 // have been read, but before we lay out the output file.
137 queue_middle_tasks(const General_options
& options
,
138 const Input_objects
* input_objects
,
139 Symbol_table
* symtab
,
141 Workqueue
* workqueue
)
143 // Define some sections and symbols needed for a dynamic link. This
144 // handles some cases we want to see before we read the relocs.
145 layout
->create_initial_dynamic_sections(input_objects
, symtab
);
147 // Predefine standard symbols. This should be fast, so we don't
148 // bother to create a task for it.
149 define_standard_symbols(symtab
, layout
, input_objects
->target());
151 // Read the relocations of the input files. We do this to find
152 // which symbols are used by relocations which require a GOT and/or
153 // a PLT entry, or a COPY reloc. When we implement garbage
154 // collection we will do it here by reading the relocations in a
155 // breadth first search by references.
157 // We could also read the relocations during the first pass, and
158 // mark symbols at that time. That is how the old GNU linker works.
159 // Doing that is more complex, since we may later decide to discard
160 // some of the sections, and thus change our minds about the types
161 // of references made to the symbols.
162 Task_token
* blocker
= new Task_token();
163 Task_token
* symtab_lock
= new Task_token();
164 for (Input_objects::Relobj_iterator p
= input_objects
->relobj_begin();
165 p
!= input_objects
->relobj_end();
168 // We can read and process the relocations in any order. But we
169 // only want one task to write to the symbol table at a time.
170 // So we queue up a task for each object to read the
171 // relocations. That task will in turn queue a task to wait
172 // until it can write to the symbol table.
173 blocker
->add_blocker();
174 workqueue
->queue(new Read_relocs(options
, symtab
, layout
, *p
,
175 symtab_lock
, blocker
));
178 // Allocate common symbols. This requires write access to the
179 // symbol table, but is independent of the relocation processing.
180 blocker
->add_blocker();
181 workqueue
->queue(new Allocate_commons_task(options
, symtab
, layout
,
182 symtab_lock
, blocker
));
184 // When all those tasks are complete, we can start laying out the
186 workqueue
->queue(new Task_function(new Layout_task_runner(options
,
193 // Queue up the final set of tasks. This is called at the end of
197 queue_final_tasks(const General_options
& options
,
198 const Input_objects
* input_objects
,
199 const Symbol_table
* symtab
,
200 const Layout
* layout
,
201 Workqueue
* workqueue
,
204 // Use a blocker to block the final cleanup task.
205 Task_token
* final_blocker
= new Task_token();
207 // Queue a task for each input object to relocate the sections and
208 // write out the local symbols.
209 for (Input_objects::Relobj_iterator p
= input_objects
->relobj_begin();
210 p
!= input_objects
->relobj_end();
213 final_blocker
->add_blocker();
214 workqueue
->queue(new Relocate_task(options
, symtab
, layout
, *p
, of
,
218 // Queue a task to write out the symbol table.
219 final_blocker
->add_blocker();
220 workqueue
->queue(new Write_symbols_task(symtab
,
221 input_objects
->target(),
227 // Queue a task to write out everything else.
228 final_blocker
->add_blocker();
229 workqueue
->queue(new Write_data_task(layout
, symtab
,
230 input_objects
->target(),
233 // Queue a task to close the output file. This will be blocked by
235 workqueue
->queue(new Task_function(new Close_task_runner(of
),
239 } // End namespace gold.
This page took 0.033079 seconds and 4 git commands to generate.