| /netbsd/src/external/gpl3/binutils/dist/gold/ |
| D | workqueue.h | 44 class Task
47 Task() in Task() function
50 virtual ~Task() in ~Task()
82 Task*
88 set_list_next(Task* t) in set_list_next()
117 Task(const Task&);
118 Task& operator=(const Task&);
124 Task* list_next_;
142 run(Workqueue*, const Task*) = 0;
147 class Task_function : public Task
[all …]
|
| D | workqueue.cc | 39 Task_list::push_back(Task* t) in push_back()
57 Task_list::push_front(Task* t) in push_front()
75 inline Task*
78 Task* ret = this->head_; in pop_front()
152 Workqueue::add_to_queue(Task_list* queue, Task* t, bool front) in add_to_queue()
179 Workqueue::queue(Task* t) in queue()
187 Workqueue::queue_soon(Task* t) in queue_soon()
196 Workqueue::queue_next(Task* t) in queue_next()
214 Task*
217 Task* t; in find_runnable_in_list()
[all …]
|
| D | token.h | 30 class Task; variable
53 push_front(Task* t);
57 push_back(Task* t);
61 Task*
66 Task* head_;
68 Task* tail_;
122 add_writer(const Task* t) in add_writer()
130 remove_writer(const Task* t) in remove_writer()
179 add_waiting(Task* t) in add_waiting()
185 add_waiting_front(Task* t) in add_waiting_front()
[all …]
|
| D | archive.h | 35 class Task; variable
69 Library_base(Task* task) in Library_base()
140 Task *task_;
166 bool is_thin_archive, Dirsearch* dirpath, Task* task);
208 lock(const Task* t) in lock()
213 unlock(const Task* t) in unlock()
419 class Add_archive_symbols : public Task
476 Lib_group(const Input_file_lib* lib, Task* task);
524 class Add_lib_group_symbols : public Task
|
| D | readsyms.h | 49 class Read_symbols : public Task
133 class Add_symbols : public Task
182 class Read_member : public Task
227 class Check_script : public Task
273 class Check_library : public Task
351 class Start_group : public Task
387 class Finish_group : public Task
444 class Read_script : public Task
|
| D | fileread.h | 82 open(const Task*, const std::string& name);
88 open(const Task*, const std::string& name, const unsigned char* contents,
110 lock(const Task* t);
114 unlock(const Task* t);
515 Input_file(const Task*, const char* name, const unsigned char* contents,
534 open(const Dirsearch&, const Task*, int* pindex);
604 open_binary(const Task* task, const std::string& name);
|
| D | gold.cc | 57 static Task*
120 run(Workqueue*, const Task*);
131 Middle_runner::run(Workqueue* workqueue, const Task* task) in run()
151 run(Workqueue*, const Task*);
162 Gc_runner::run(Workqueue* workqueue, const Task* task) in run()
255 std::vector<Task*> tasks; in queue_initial_tasks()
261 Task* t = process_incremental_input(ibase, i, input_objects, symtab, in queue_initial_tasks()
314 static Task*
439 const Task* , in queue_middle_gc_tasks() argument
484 const Task* task, in queue_middle_tasks()
[all …]
|
| D | binary.h | 35 class Task; variable
54 convert(const Task*);
82 sized_convert(const Task*);
|
| D | gold.h | 50 class Task; variable
222 const Task*,
232 const Task*,
|
| D | plugin.h | 46 class Task; variable
211 all_symbols_read(Workqueue* workqueue, Task* task,
364 rescan(Task*);
409 Task* task_;
614 class Plugin_hook : public Task
|
| D | layout.h | 187 run(Workqueue*, const Task*);
847 finalize(const Input_objects*, Symbol_table*, Target*, const Task*);
1132 count_local_symbols(const Task*, const Input_objects*);
1536 class Write_sections_task : public Task
1577 class Write_data_task : public Task
1609 class Write_symbols_task : public Task
1650 class Write_after_input_sections_task : public Task
1699 run(Workqueue*, const Task*);
1721 run(Workqueue*, const Task*);
|
| D | fileread.cc | 193 File_read::open(const Task* task, const std::string& name) in open()
226 File_read::open(const Task* task, const std::string& name, in open()
297 File_read::lock(const Task* task) in lock()
308 File_read::unlock(const Task* task) in unlock()
893 Input_file::Input_file(const Task* task, const char* name, in Input_file()
1095 Input_file::open(const Dirsearch& dirpath, const Task* task, int* pindex) in open()
1133 Input_file::open_binary(const Task* task, const std::string& name) in open_binary()
|
| D | icf.cc | 210 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in preprocess_for_unique_sections()
710 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in match_sections()
970 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in find_identical_sections()
|
| D | copy-relocs.cc | 150 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in make_copy_reloc()
|
| D | common.h | 35 class Allocate_commons_task : public Task
|
| D | README | 45 The linker is multi-threaded. The Task class represents a single unit
46 of work. Task objects are stored on a single Workqueue object. Tasks
|
| D | mapfile.cc | 358 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in print_discarded_sections()
|
| D | dwp.h | 50 class Task; variable
|
| D | binary.cc | 74 Binary_to_elf::convert(const Task* task) in convert()
128 Binary_to_elf::sized_convert(const Task* task) in sized_convert()
|
| D | target.h | 63 class Task; variable
394 Layout* layout, const Task* task) in relax()
758 do_relax(int, const Input_objects*, Symbol_table*, Layout*, const Task*) in do_relax() argument
|
| D | archive.cc | 192 bool is_thin_archive, Dirsearch* dirpath, Task* task) in Archive()
965 Thin_archive_object_unlocker(const Task *task, Object* obj) in Thin_archive_object_unlocker()
979 const Task* task_;
1186 Lib_group::Lib_group(const Input_file_lib* lib, Task* task) in Lib_group()
|
| D | plugin.cc | 432 class Plugin_rescan : public Task
833 Plugin_manager::all_symbols_read(Workqueue* workqueue, Task* task, in all_symbols_read()
885 Plugin_manager::rescan(Task* task) in rescan()
1012 const Task* dummy_task = reinterpret_cast<const Task*>(-1); in layout_deferred_objects()
1692 class Plugin_finish : public Task
|
| D | reloc.h | 62 class Read_relocs : public Task
99 class Gc_process_relocs : public Task
140 class Scan_relocs : public Task
180 class Relocate_task : public Task
|
| D | dirsearch.cc | 170 class Dir_cache_task : public gold::Task
|
| /netbsd/src/external/bsd/openldap/dist/doc/drafts/ |
| D | README | 2 Engineering Task Force (IETF), its areas, its working groups, and
|