Searched refs:task (Results 1 - 8 of 8) sorted by relevance

/art/runtime/gc/
H A Dtask_processor.cc36 void TaskProcessor::AddTask(Thread* self, HeapTask* task) { argument
39 tasks_.insert(task);
55 HeapTask* task = *tasks_.begin(); local
56 // If we are shutting down, return the task right away without waiting. Otherwise return the
57 // task if it is late enough.
58 uint64_t target_time = task->GetTargetRunTime();
61 return task;
74 void TaskProcessor::UpdateTargetRunTime(Thread* self, HeapTask* task, uint64_t new_target_time) { argument
76 // Find the task.
77 auto range = tasks_.equal_range(task);
122 HeapTask* task = GetTask(self); local
[all...]
H A Dtask_processor.h39 // Update the updated_target_run_time_, the task processor will re-insert the task when it is
45 // Time in ns at which we want the task to run.
57 void AddTask(Thread* self, HeapTask* task) LOCKS_EXCLUDED(lock_);
H A Dtask_processor_test.cc66 ThreadPool thread_pool("task processor test", 1U);
74 // Add a task which will wait until interrupted to the thread pool.
134 auto* task = new TestOrderTask(pair.first, pair.second, &counter); local
135 task_processor.AddTask(self, task);
137 ThreadPool thread_pool("task processor test", 1U);
139 // Add a task which will wait until interrupted to the thread pool.
H A Dreference_processor.cc255 ClearedReferenceTask task(cleared_references);
256 task.Run(self);
/art/runtime/
H A Dthread_pool.cc51 Task* task = nullptr; local
53 while ((task = thread_pool_->GetTask(self)) != nullptr) {
54 task->Run(self);
55 task->Finalize();
69 void ThreadPool::AddTask(Thread* self, Task* task) { argument
71 tasks_.push_back(task);
80 task_queue_lock_("task queue lock"),
81 task_queue_condition_("task queue condition", task_queue_lock_),
82 completion_condition_("task completion condition", task_queue_lock_),
142 Task* task local
173 Task* task = tasks_.front(); local
182 Task* task = nullptr; local
210 Task* task = nullptr; local
300 WorkStealingTask* task = worker->task_; local
[all...]
H A Dthread_pool.h90 // Add a new task, the first available started worker will process it. Does not delete the task
92 void AddTask(Thread* self, Task* task);
112 // get a task to run, blocks if there are no tasks left
115 // Try to get a task, returning null if there is none available.
158 // How many people are referencing this task.
193 // Find a task to steal from
H A Doat_file_assistant_test.cc916 // A task to generate a dex location. Used by the RaceToGenerate test.
966 std::unique_ptr<RaceGenerateTask> task(new RaceGenerateTask(dex_location, oat_location));
967 thread_pool.AddTask(self, task.get());
968 tasks.push_back(std::move(task));
973 // Verify every task got the same pointer.
975 for (auto& task : tasks) {
976 EXPECT_EQ(expected, task->GetLoadedOatFile());
/art/runtime/gc/collector/
H A Dmark_sweep.cc706 // Thread local mark stack for this task.
713 // Mark stack overflow, give 1/2 the stack to the thread pool as a new work task.
715 auto* task = new MarkStackTask(thread_pool_, mark_sweep_, kMaxSize - mark_stack_pos_, local
717 thread_pool_->AddTask(Thread::Current(), task); local
839 // Calculate how much address range each task gets.
858 // Add the new task to the thread pool.
859 auto* task = new CardScanTask(thread_pool, this, space->GetMarkBitmap(), card_begin, local
862 thread_pool->AddTask(self, task);
971 auto* task = new RecursiveMarkTask(thread_pool, this, current_space_bitmap_, start, local
973 thread_pool->AddTask(self, task);
[all...]

Completed in 132 milliseconds