1 // gold.cc -- main linker functions
3 // Copyright 2006, 2007, 2008, 2009, 2010, 2011, 2012
4 // Free Software Foundation, Inc.
5 // Written by Ian Lance Taylor <iant@google.com>.
7 // This file is part of gold.
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.
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.
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,
22 // MA 02110-1301, USA.
31 #include "libiberty.h"
34 #include "target-select.h"
36 #include "workqueue.h"
37 #include "dirsearch.h"
48 #include "incremental.h"
56 const char* program_name;
59 process_incremental_input(Incremental_binary*, unsigned int, Input_objects*,
60 Symbol_table*, Layout*, Dirsearch*, Mapfile*,
61 Task_token*, Task_token*);
64 gold_exit(Exit_status status)
66 if (parameters != NULL
67 && parameters->options_valid()
68 && parameters->options().has_plugins())
69 parameters->options().plugins()->cleanup();
70 if (status != GOLD_OK && parameters != NULL && parameters->options_valid())
71 unlink_if_ordinary(parameters->options().output_file_name());
78 // We are out of memory, so try hard to print a reasonable message.
79 // Note that we don't try to translate this message, since the
80 // translation process itself will require memory.
82 // LEN only exists to avoid a pointless warning when write is
83 // declared with warn_use_result, as when compiling with
84 // -D_USE_FORTIFY on GNU/Linux. Casting to void does not appear to
85 // work, at least not with gcc 4.3.0.
87 ssize_t len = write(2, program_name, strlen(program_name));
90 const char* const s = ": out of memory\n";
91 len = write(2, s, strlen(s));
96 // Handle an unreachable case.
99 do_gold_unreachable(const char* filename, int lineno, const char* function)
101 fprintf(stderr, _("%s: internal error in %s, at %s:%d\n"),
102 program_name, function, filename, lineno);
106 // This class arranges to run the functions done in the middle of the
107 // link. It is just a closure.
109 class Middle_runner : public Task_function_runner
112 Middle_runner(const General_options& options,
113 const Input_objects* input_objects,
114 Symbol_table* symtab,
115 Layout* layout, Mapfile* mapfile)
116 : options_(options), input_objects_(input_objects), symtab_(symtab),
117 layout_(layout), mapfile_(mapfile)
121 run(Workqueue*, const Task*);
124 const General_options& options_;
125 const Input_objects* input_objects_;
126 Symbol_table* symtab_;
132 Middle_runner::run(Workqueue* workqueue, const Task* task)
134 queue_middle_tasks(this->options_, task, this->input_objects_, this->symtab_,
135 this->layout_, workqueue, this->mapfile_);
138 // This class arranges the tasks to process the relocs for garbage collection.
140 class Gc_runner : public Task_function_runner
143 Gc_runner(const General_options& options,
144 const Input_objects* input_objects,
145 Symbol_table* symtab,
146 Layout* layout, Mapfile* mapfile)
147 : options_(options), input_objects_(input_objects), symtab_(symtab),
148 layout_(layout), mapfile_(mapfile)
152 run(Workqueue*, const Task*);
155 const General_options& options_;
156 const Input_objects* input_objects_;
157 Symbol_table* symtab_;
163 Gc_runner::run(Workqueue* workqueue, const Task* task)
165 queue_middle_gc_tasks(this->options_, task, this->input_objects_,
166 this->symtab_, this->layout_, workqueue,
170 // Queue up the initial set of tasks for this link job.
173 queue_initial_tasks(const General_options& options,
174 Dirsearch& search_path,
175 const Command_line& cmdline,
176 Workqueue* workqueue, Input_objects* input_objects,
177 Symbol_table* symtab, Layout* layout, Mapfile* mapfile)
179 if (cmdline.begin() == cmdline.end())
182 if (options.printed_version())
184 if (options.print_output_format())
186 print_output_format();
191 gold_fatal(_("no input files"));
194 int thread_count = options.thread_count_initial();
195 if (thread_count == 0)
196 thread_count = cmdline.number_of_input_files();
197 workqueue->set_thread_count(thread_count);
199 // For incremental links, the base output file.
200 Incremental_binary* ibase = NULL;
202 if (parameters->incremental_update())
204 Output_file* of = new Output_file(options.output_file_name());
205 if (of->open_base_file(options.incremental_base(), true))
207 ibase = open_incremental_binary(of);
209 && ibase->check_inputs(cmdline, layout->incremental_inputs()))
210 ibase->init_layout(layout);
220 if (set_parameters_incremental_full())
221 gold_info(_("linking with --incremental-full"));
223 gold_fallback(_("restart link with --incremental-full"));
227 // Read the input files. We have to add the symbols to the symbol
228 // table in order. We do this by creating a separate blocker for
229 // each input file. We associate the blocker with the following
230 // input file, to give us a convenient place to delete it.
231 Task_token* this_blocker = NULL;
234 // Normal link. Queue a Read_symbols task for each input file
235 // on the command line.
236 for (Command_line::const_iterator p = cmdline.begin();
240 Task_token* next_blocker = new Task_token(true);
241 next_blocker->add_blocker();
242 workqueue->queue(new Read_symbols(input_objects, symtab, layout,
243 &search_path, 0, mapfile, &*p, NULL,
244 NULL, this_blocker, next_blocker));
245 this_blocker = next_blocker;
250 // Incremental update link. Process the list of input files
251 // stored in the base file, and queue a task for each file:
252 // a Read_symbols task for a changed file, and an Add_symbols task
253 // for an unchanged file. We need to mark all the space used by
254 // unchanged files before we can start any tasks running.
255 unsigned int input_file_count = ibase->input_file_count();
256 std::vector<Task*> tasks;
257 tasks.reserve(input_file_count);
258 for (unsigned int i = 0; i < input_file_count; ++i)
260 Task_token* next_blocker = new Task_token(true);
261 next_blocker->add_blocker();
262 Task* t = process_incremental_input(ibase, i, input_objects, symtab,
263 layout, &search_path, mapfile,
264 this_blocker, next_blocker);
266 this_blocker = next_blocker;
268 // Now we can queue the tasks.
269 for (unsigned int i = 0; i < tasks.size(); i++)
270 workqueue->queue(tasks[i]);
273 if (options.has_plugins())
275 Task_token* next_blocker = new Task_token(true);
276 next_blocker->add_blocker();
277 workqueue->queue(new Plugin_hook(options, input_objects, symtab, layout,
278 &search_path, mapfile, this_blocker,
280 this_blocker = next_blocker;
283 if (options.relocatable()
284 && (options.gc_sections() || options.icf_enabled()))
285 gold_error(_("cannot mix -r with --gc-sections or --icf"));
287 if (options.gc_sections() || options.icf_enabled())
289 workqueue->queue(new Task_function(new Gc_runner(options,
295 "Task_function Gc_runner"));
299 workqueue->queue(new Task_function(new Middle_runner(options,
305 "Task_function Middle_runner"));
309 // Process an incremental input file: if it is unchanged from the previous
310 // link, return a task to add its symbols from the base file's incremental
311 // info; if it has changed, return a normal Read_symbols task. We create a
312 // task for every input file, if only to report the file for rebuilding the
316 process_incremental_input(Incremental_binary* ibase,
317 unsigned int input_file_index,
318 Input_objects* input_objects,
319 Symbol_table* symtab,
321 Dirsearch* search_path,
323 Task_token* this_blocker,
324 Task_token* next_blocker)
326 const Incremental_binary::Input_reader* input_reader =
327 ibase->get_input_reader(input_file_index);
328 Incremental_input_type input_type = input_reader->type();
330 // Get the input argument corresponding to this input file, matching on
331 // the argument serial number. If the input file cannot be matched
332 // to an existing input argument, synthesize a new one.
333 const Input_argument* input_argument =
334 ibase->get_input_argument(input_file_index);
335 if (input_argument == NULL)
337 Input_file_argument file(input_reader->filename(),
338 Input_file_argument::INPUT_FILE_TYPE_FILE,
339 "", false, parameters->options());
340 Input_argument* arg = new Input_argument(file);
341 arg->set_script_info(ibase->get_script_info(input_file_index));
342 input_argument = arg;
345 gold_debug(DEBUG_INCREMENTAL, "Incremental object: %s, type %d",
346 input_reader->filename(), input_type);
348 if (input_type == INCREMENTAL_INPUT_SCRIPT)
350 // Incremental_binary::check_inputs should have cancelled the
351 // incremental update if the script has changed.
352 gold_assert(!ibase->file_has_changed(input_file_index));
353 return new Check_script(layout, ibase, input_file_index, input_reader,
354 this_blocker, next_blocker);
357 if (input_type == INCREMENTAL_INPUT_ARCHIVE)
359 Incremental_library* lib = ibase->get_library(input_file_index);
360 gold_assert(lib != NULL);
361 if (lib->filename() == "/group/"
362 || !ibase->file_has_changed(input_file_index))
364 // Queue a task to check that no references have been added to any
365 // of the library's unused symbols.
366 return new Check_library(symtab, layout, ibase, input_file_index,
367 input_reader, this_blocker, next_blocker);
371 // Queue a Read_symbols task to process the archive normally.
372 return new Read_symbols(input_objects, symtab, layout, search_path,
373 0, mapfile, input_argument, NULL, NULL,
374 this_blocker, next_blocker);
378 if (input_type == INCREMENTAL_INPUT_ARCHIVE_MEMBER)
380 // For archive members, check the timestamp of the containing archive.
381 Incremental_library* lib = ibase->get_library(input_file_index);
382 gold_assert(lib != NULL);
383 // Process members of a --start-lib/--end-lib group as normal objects.
384 if (lib->filename() != "/group/")
386 if (ibase->file_has_changed(lib->input_file_index()))
388 return new Read_member(input_objects, symtab, layout, mapfile,
389 input_reader, this_blocker, next_blocker);
393 // The previous contributions from this file will be kept.
394 // Mark the pieces of output sections contributed by this
396 ibase->reserve_layout(input_file_index);
397 Object* obj = make_sized_incremental_object(ibase,
401 return new Add_symbols(input_objects, symtab, layout,
402 search_path, 0, mapfile, input_argument,
403 obj, lib, NULL, this_blocker,
409 // Normal object file or shared library. Check if the file has changed
410 // since the last incremental link.
411 if (ibase->file_has_changed(input_file_index))
413 return new Read_symbols(input_objects, symtab, layout, search_path, 0,
414 mapfile, input_argument, NULL, NULL,
415 this_blocker, next_blocker);
419 // The previous contributions from this file will be kept.
420 // Mark the pieces of output sections contributed by this object.
421 ibase->reserve_layout(input_file_index);
422 Object* obj = make_sized_incremental_object(ibase,
426 return new Add_symbols(input_objects, symtab, layout, search_path, 0,
427 mapfile, input_argument, obj, NULL, NULL,
428 this_blocker, next_blocker);
432 // Queue up a set of tasks to be done before queueing the middle set
433 // of tasks. This is only necessary when garbage collection
434 // (--gc-sections) of unused sections is desired. The relocs are read
435 // and processed here early to determine the garbage sections before the
436 // relocs can be scanned in later tasks.
439 queue_middle_gc_tasks(const General_options& options,
441 const Input_objects* input_objects,
442 Symbol_table* symtab,
444 Workqueue* workqueue,
447 // Read_relocs for all the objects must be done and processed to find
448 // unused sections before any scanning of the relocs can take place.
449 Task_token* this_blocker = NULL;
450 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
451 p != input_objects->relobj_end();
454 Task_token* next_blocker = new Task_token(true);
455 next_blocker->add_blocker();
456 workqueue->queue(new Read_relocs(symtab, layout, *p, this_blocker,
458 this_blocker = next_blocker;
461 // If we are given only archives in input, we have no regular
462 // objects and THIS_BLOCKER is NULL here. Create a dummy
463 // blocker here so that we can run the middle tasks immediately.
464 if (this_blocker == NULL)
466 gold_assert(input_objects->number_of_relobjs() == 0);
467 this_blocker = new Task_token(true);
470 workqueue->queue(new Task_function(new Middle_runner(options,
476 "Task_function Middle_runner"));
479 // Queue up the middle set of tasks. These are the tasks which run
480 // after all the input objects have been found and all the symbols
481 // have been read, but before we lay out the output file.
484 queue_middle_tasks(const General_options& options,
486 const Input_objects* input_objects,
487 Symbol_table* symtab,
489 Workqueue* workqueue,
492 Timer* timer = parameters->timer();
496 // Add any symbols named with -u options to the symbol table.
497 symtab->add_undefined_symbols_from_command_line(layout);
499 // If garbage collection was chosen, relocs have been read and processed
500 // at this point by pre_middle_tasks. Layout can then be done for all
502 if (parameters->options().gc_sections())
504 // Find the start symbol if any.
505 Symbol* start_sym = symtab->lookup(parameters->entry());
506 if (start_sym != NULL)
507 symtab->gc_mark_symbol(start_sym);
508 // Symbols named with -u should not be considered garbage.
509 symtab->gc_mark_undef_symbols(layout);
510 gold_assert(symtab->gc() != NULL);
511 // Do a transitive closure on all references to determine the worklist.
512 symtab->gc()->do_transitive_closure();
515 // If identical code folding (--icf) is chosen it makes sense to do it
516 // only after garbage collection (--gc-sections) as we do not want to
517 // be folding sections that will be garbage.
518 if (parameters->options().icf_enabled())
520 symtab->icf()->find_identical_sections(input_objects, symtab);
523 // Call Object::layout for the second time to determine the
524 // output_sections for all referenced input sections. When
525 // --gc-sections or --icf is turned on, or when certain input
526 // sections have to be mapped to unique segments, Object::layout
527 // is called twice. It is called the first time when symbols
529 if (parameters->options().gc_sections()
530 || parameters->options().icf_enabled()
531 || layout->is_unique_segment_for_sections_specified())
533 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
534 p != input_objects->relobj_end();
537 Task_lock_obj<Object> tlo(task, *p);
538 (*p)->layout(symtab, layout, NULL);
542 // Layout deferred objects due to plugins.
543 if (parameters->options().has_plugins())
545 Plugin_manager* plugins = parameters->options().plugins();
546 gold_assert(plugins != NULL);
547 plugins->layout_deferred_objects();
550 /* If plugins have specified a section order, re-arrange input sections
551 according to a specified section order. If --section-ordering-file is
552 also specified, do not do anything here. */
553 if (parameters->options().has_plugins()
554 && layout->is_section_ordering_specified()
555 && !parameters->options().section_ordering_file ())
557 for (Layout::Section_list::const_iterator p
558 = layout->section_list().begin();
559 p != layout->section_list().end();
561 (*p)->update_section_layout(layout->get_section_order_map());
564 if (parameters->options().gc_sections()
565 || parameters->options().icf_enabled())
567 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
568 p != input_objects->relobj_end();
571 // Update the value of output_section stored in rd.
572 Read_relocs_data* rd = (*p)->get_relocs_data();
573 for (Read_relocs_data::Relocs_list::iterator q = rd->relocs.begin();
574 q != rd->relocs.end();
577 q->output_section = (*p)->output_section(q->data_shndx);
578 q->needs_special_offset_handling =
579 (*p)->is_output_section_offset_invalid(q->data_shndx);
584 // We have to support the case of not seeing any input objects, and
585 // generate an empty file. Existing builds depend on being able to
586 // pass an empty archive to the linker and get an empty object file
587 // out. In order to do this we need to use a default target.
588 if (input_objects->number_of_input_objects() == 0
589 && layout->incremental_base() == NULL)
590 parameters_force_valid_target();
592 int thread_count = options.thread_count_middle();
593 if (thread_count == 0)
594 thread_count = std::max(2, input_objects->number_of_input_objects());
595 workqueue->set_thread_count(thread_count);
597 // Now we have seen all the input files.
598 const bool doing_static_link =
599 (!input_objects->any_dynamic()
600 && !parameters->options().output_is_position_independent());
601 set_parameters_doing_static_link(doing_static_link);
602 if (!doing_static_link && options.is_static())
604 // We print out just the first .so we see; there may be others.
605 gold_assert(input_objects->dynobj_begin() != input_objects->dynobj_end());
606 gold_error(_("cannot mix -static with dynamic object %s"),
607 (*input_objects->dynobj_begin())->name().c_str());
609 if (!doing_static_link && parameters->options().relocatable())
610 gold_fatal(_("cannot mix -r with dynamic object %s"),
611 (*input_objects->dynobj_begin())->name().c_str());
612 if (!doing_static_link
613 && options.oformat_enum() != General_options::OBJECT_FORMAT_ELF)
614 gold_fatal(_("cannot use non-ELF output format with dynamic object %s"),
615 (*input_objects->dynobj_begin())->name().c_str());
617 if (parameters->options().relocatable())
619 Input_objects::Relobj_iterator p = input_objects->relobj_begin();
620 if (p != input_objects->relobj_end())
622 bool uses_split_stack = (*p)->uses_split_stack();
623 for (++p; p != input_objects->relobj_end(); ++p)
625 if ((*p)->uses_split_stack() != uses_split_stack)
626 gold_fatal(_("cannot mix split-stack '%s' and "
627 "non-split-stack '%s' when using -r"),
628 (*input_objects->relobj_begin())->name().c_str(),
629 (*p)->name().c_str());
634 // For incremental updates, record the existing GOT and PLT entries,
635 // and the COPY relocations.
636 if (parameters->incremental_update())
638 Incremental_binary* ibase = layout->incremental_base();
639 ibase->process_got_plt(symtab, layout);
640 ibase->emit_copy_relocs(symtab);
643 if (is_debugging_enabled(DEBUG_SCRIPT))
644 layout->script_options()->print(stderr);
646 // For each dynamic object, record whether we've seen all the
647 // dynamic objects that it depends upon.
648 input_objects->check_dynamic_dependencies();
650 // See if any of the input definitions violate the One Definition Rule.
651 // TODO: if this is too slow, do this as a task, rather than inline.
652 symtab->detect_odr_violations(task, options.output_file_name());
654 // Do the --no-undefined-version check.
655 if (!parameters->options().undefined_version())
657 Script_options* so = layout->script_options();
658 so->version_script_info()->check_unmatched_names(symtab);
661 // Create any automatic note sections.
662 layout->create_notes();
664 // Create any output sections required by any linker script.
665 layout->create_script_sections();
667 // Define some sections and symbols needed for a dynamic link. This
668 // handles some cases we want to see before we read the relocs.
669 layout->create_initial_dynamic_sections(symtab);
671 // Define symbols from any linker scripts.
672 layout->define_script_symbols(symtab);
674 // TODO(csilvers): figure out a more principled way to get the target
675 Target* target = const_cast<Target*>(¶meters->target());
677 // Attach sections to segments.
678 layout->attach_sections_to_segments(target);
680 if (!parameters->options().relocatable())
682 // Predefine standard symbols.
683 define_standard_symbols(symtab, layout);
685 // Define __start and __stop symbols for output sections where
687 layout->define_section_symbols(symtab);
689 // Define target-specific symbols.
690 target->define_standard_symbols(symtab, layout);
693 // Make sure we have symbols for any required group signatures.
694 layout->define_group_signatures(symtab);
696 Task_token* this_blocker = NULL;
698 // Allocate common symbols. We use a blocker to run this before the
699 // Scan_relocs tasks, because it writes to the symbol table just as
701 if (parameters->options().define_common())
703 this_blocker = new Task_token(true);
704 this_blocker->add_blocker();
705 workqueue->queue(new Allocate_commons_task(symtab, layout, mapfile,
709 // If doing garbage collection, the relocations have already been read.
710 // Otherwise, read and scan the relocations.
711 if (parameters->options().gc_sections()
712 || parameters->options().icf_enabled())
714 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
715 p != input_objects->relobj_end();
718 Task_token* next_blocker = new Task_token(true);
719 next_blocker->add_blocker();
720 workqueue->queue(new Scan_relocs(symtab, layout, *p,
721 (*p)->get_relocs_data(),
722 this_blocker, next_blocker));
723 this_blocker = next_blocker;
728 // Read the relocations of the input files. We do this to find
729 // which symbols are used by relocations which require a GOT and/or
730 // a PLT entry, or a COPY reloc. When we implement garbage
731 // collection we will do it here by reading the relocations in a
732 // breadth first search by references.
734 // We could also read the relocations during the first pass, and
735 // mark symbols at that time. That is how the old GNU linker works.
736 // Doing that is more complex, since we may later decide to discard
737 // some of the sections, and thus change our minds about the types
738 // of references made to the symbols.
739 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
740 p != input_objects->relobj_end();
743 Task_token* next_blocker = new Task_token(true);
744 next_blocker->add_blocker();
745 workqueue->queue(new Read_relocs(symtab, layout, *p, this_blocker,
747 this_blocker = next_blocker;
751 if (this_blocker == NULL)
753 if (input_objects->number_of_relobjs() == 0)
755 // If we are given only archives in input, we have no regular
756 // objects and THIS_BLOCKER is NULL here. Create a dummy
757 // blocker here so that we can run the layout task immediately.
758 this_blocker = new Task_token(true);
762 // If we failed to open any input files, it's possible for
763 // THIS_BLOCKER to be NULL here. There's no real point in
764 // continuing if that happens.
765 gold_assert(parameters->errors()->error_count() > 0);
770 // When all those tasks are complete, we can start laying out the
772 workqueue->queue(new Task_function(new Layout_task_runner(options,
779 "Task_function Layout_task_runner"));
782 // Queue up the final set of tasks. This is called at the end of
786 queue_final_tasks(const General_options& options,
787 const Input_objects* input_objects,
788 const Symbol_table* symtab,
790 Workqueue* workqueue,
793 Timer* timer = parameters->timer();
797 int thread_count = options.thread_count_final();
798 if (thread_count == 0)
799 thread_count = std::max(2, input_objects->number_of_input_objects());
800 workqueue->set_thread_count(thread_count);
802 bool any_postprocessing_sections = layout->any_postprocessing_sections();
804 // Use a blocker to wait until all the input sections have been
806 Task_token* input_sections_blocker = NULL;
807 if (!any_postprocessing_sections)
809 input_sections_blocker = new Task_token(true);
810 input_sections_blocker->add_blockers(input_objects->number_of_relobjs());
813 // Use a blocker to block any objects which have to wait for the
814 // output sections to complete before they can apply relocations.
815 Task_token* output_sections_blocker = new Task_token(true);
816 output_sections_blocker->add_blocker();
818 // Use a blocker to block the final cleanup task.
819 Task_token* final_blocker = new Task_token(true);
820 // Write_symbols_task, Write_sections_task, Write_data_task,
822 final_blocker->add_blockers(3);
823 final_blocker->add_blockers(input_objects->number_of_relobjs());
824 if (!any_postprocessing_sections)
825 final_blocker->add_blocker();
827 // Queue a task to write out the symbol table.
828 workqueue->queue(new Write_symbols_task(layout,
836 // Queue a task to write out the output sections.
837 workqueue->queue(new Write_sections_task(layout, of, output_sections_blocker,
840 // Queue a task to write out everything else.
841 workqueue->queue(new Write_data_task(layout, symtab, of, final_blocker));
843 // Queue a task for each input object to relocate the sections and
844 // write out the local symbols.
845 for (Input_objects::Relobj_iterator p = input_objects->relobj_begin();
846 p != input_objects->relobj_end();
848 workqueue->queue(new Relocate_task(symtab, layout, *p, of,
849 input_sections_blocker,
850 output_sections_blocker,
853 // Queue a task to write out the output sections which depend on
854 // input sections. If there are any sections which require
855 // postprocessing, then we need to do this last, since it may resize
857 if (!any_postprocessing_sections)
859 Task* t = new Write_after_input_sections_task(layout, of,
860 input_sections_blocker,
866 Task_token* new_final_blocker = new Task_token(true);
867 new_final_blocker->add_blocker();
868 Task* t = new Write_after_input_sections_task(layout, of,
872 final_blocker = new_final_blocker;
875 // Queue a task to close the output file. This will be blocked by
877 workqueue->queue(new Task_function(new Close_task_runner(&options, layout,
880 "Task_function Close_task_runner"));
883 } // End namespace gold.