scheduler: Add a base directory

components/scheduler/base/task_queue_manager_perftest.cc

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "components/scheduler/child/task_queue_manager.h"
+#include "components/scheduler/base/task_queue_manager.h"
 
 #include "base/bind.h"
 #include "base/threading/thread.h"
-#include "components/scheduler/child/scheduler_task_runner_delegate_impl.h"
-#include "components/scheduler/child/task_queue_impl.h"
-#include "components/scheduler/child/task_queue_selector.h"
-#include "components/scheduler/child/task_queue_sets.h"
+#include "components/scheduler/base/nestable_task_runner_for_test.h"
+#include "components/scheduler/base/task_queue_impl.h"
+#include "components/scheduler/base/task_queue_selector.h"
+#include "components/scheduler/base/task_queue_sets.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "testing/perf/perf_test.h"
 
 namespace scheduler {
 
 class TaskQueueManagerPerfTest : public testing::Test {
  public:
   TaskQueueManagerPerfTest()
       : num_queues_(0),
         max_tasks_in_flight_(0),
         num_tasks_in_flight_(0),
         num_tasks_to_post_(0),
         num_tasks_to_run_(0) {}
 
   void Initialize(size_t num_queues) {
     num_queues_ = num_queues;
     message_loop_.reset(new base::MessageLoop());
     manager_ = make_scoped_ptr(new TaskQueueManager(
-        SchedulerTaskRunnerDelegateImpl::Create(message_loop_.get()),
+        NestableTaskRunnerForTest::Create(message_loop_->task_runner()),
         "fake.category", "fake.category.debug"));
     for (size_t i = 0; i < num_queues; i++)
       queues_.push_back(manager_->NewTaskQueue(TaskQueue::Spec("test")));
   }
 
   void TestDelayedTask() {
     if (--num_tasks_to_run_ == 0) {
       message_loop_->Quit();
     }
 
     num_tasks_in_flight_--;
     // NOTE there are only up to max_tasks_in_flight_ pending delayed tasks at
     // any one time.  Thanks to the lower_num_tasks_to_post going to zero if
     // there are a lot of tasks in flight, the total number of task in flight at
     // any one time is very variable.
     unsigned int lower_num_tasks_to_post =
         num_tasks_in_flight_ < (max_tasks_in_flight_ / 2) ? 1 : 0;
     unsigned int max_tasks_to_post =
         num_tasks_to_post_ % 2 ? lower_num_tasks_to_post : 10;
     for (unsigned int i = 0;
          i < max_tasks_to_post && num_tasks_in_flight_ < max_tasks_in_flight_ &&
-             num_tasks_to_post_ > 0;
+         num_tasks_to_post_ > 0;
          i++) {
       // Choose a queue weighted towards queue 0.
       unsigned int queue = num_tasks_to_post_ % (num_queues_ + 1);
       if (queue == num_queues_) {
         queue = 0;
       }
       // Simulate a mix of short and longer delays.
       unsigned int delay =
           num_tasks_to_post_ % 2 ? 1 : (10 + num_tasks_to_post_ % 10);
       queues_[queue]->PostDelayedTask(
@@ skipping 68 matching lines @@
   max_tasks_in_flight_ = 200;
   Benchmark("run 10000 delayed tasks with eight queues",
             base::Bind(&TaskQueueManagerPerfTest::ResetAndCallTestDelayedTask,
                        base::Unretained(this), 10000));
 }
 
 // TODO(alexclarke): Add additional tests with different mixes of non-delayed vs
 // delayed tasks.
 
 }  // namespace scheduler