Move throttling of background timers into the renderer scheduler

components/scheduler/base/task_queue_selector_unittest.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/base/task_queue_selector.h"
 
 #include "base/bind.h"
 #include "base/memory/scoped_ptr.h"
 #include "base/pending_task.h"
 #include "components/scheduler/base/task_queue_impl.h"
@@ skipping 57 matching lines @@
       chosen_queue->PopTaskFromWorkQueueForTest();
       selector_.GetTaskQueueSets()->OnPopQueue(chosen_queue);
     }
     return order;
   }
 
   static void TestFunction() {}
 
  protected:
   void SetUp() final {
-    virtual_time_domain_ = make_scoped_refptr<VirtualTimeDomain>(
-        new VirtualTimeDomain(base::TimeTicks()));
+    virtual_time_domain_ = make_scoped_ptr<VirtualTimeDomain>(
+        new VirtualTimeDomain(nullptr, base::TimeTicks()));
     for (size_t i = 0; i < kTaskQueueCount; i++) {
       scoped_refptr<TaskQueueImpl> task_queue = make_scoped_refptr(
-          new TaskQueueImpl(nullptr, virtual_time_domain_,
+          new TaskQueueImpl(nullptr, virtual_time_domain_.get(),
                             TaskQueue::Spec("test queue"), "test", "test"));
       selector_.AddQueue(task_queue.get());
       task_queues_.push_back(task_queue);
     }
     for (size_t i = 0; i < kTaskQueueCount; i++) {
       EXPECT_TRUE(selector_.IsQueueEnabled(task_queues_[i].get())) << i;
       queue_to_index_map_.insert(std::make_pair(task_queues_[i].get(), i));
     }
   }
 
   const size_t kTaskQueueCount = 5;
   base::Closure test_closure_;
   TaskQueueSelector selector_;
-  scoped_refptr<VirtualTimeDomain> virtual_time_domain_;
+  scoped_ptr<VirtualTimeDomain> virtual_time_domain_;
   std::vector<scoped_refptr<TaskQueueImpl>> task_queues_;
   std::map<TaskQueueImpl*, size_t> queue_to_index_map_;
 };
 
 TEST_F(TaskQueueSelectorTest, TestDefaultPriority) {
   std::vector<TaskQueueImpl::Task> tasks = GetTasks(5);
   size_t queue_order[] = {4, 3, 2, 1, 0};
   PushTasks(tasks, queue_order);
   EXPECT_THAT(PopTasks(), testing::ElementsAre(4, 3, 2, 1, 0));
 }
@@ skipping 171 matching lines @@
   size_t queue_order[] = {0, 1};
   PushTasks(tasks, queue_order);
 
   EXPECT_FALSE(selector_.EnabledWorkQueuesEmpty());
   PopTasks();
   EXPECT_TRUE(selector_.EnabledWorkQueuesEmpty());
 }
 
 }  // namespace internal
 }  // namespace scheduler