SchedulerWorker Refcounting for Destruction in Production

base/task_scheduler/scheduler_worker_stack_unittest.cc

 // Copyright 2016 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 "base/task_scheduler/scheduler_worker_stack.h"
 
 #include "base/logging.h"
 #include "base/memory/ptr_util.h"
 #include "base/memory/ref_counted.h"
 #include "base/task_scheduler/scheduler_worker.h"
@@ skipping 49 matching lines @@
         SchedulerWorker::InitialState::ALIVE);
     ASSERT_TRUE(worker_c_);
   }
 
   void TearDown() override {
     worker_a_->JoinForTesting();
     worker_b_->JoinForTesting();
     worker_c_->JoinForTesting();
   }
 
-  std::unique_ptr<SchedulerWorker> worker_a_;
-  std::unique_ptr<SchedulerWorker> worker_b_;
-  std::unique_ptr<SchedulerWorker> worker_c_;
+  scoped_refptr<SchedulerWorker> worker_a_;
+  scoped_refptr<SchedulerWorker> worker_b_;
+  scoped_refptr<SchedulerWorker> worker_c_;
 
  private:
   TaskTracker task_tracker_;
 };
 
 }  // namespace
 
 // Verify that Push() and Pop() add/remove values in FIFO order.
 TEST_F(TaskSchedulerWorkerStackTest, PushPop) {
   SchedulerWorkerStack stack;
@@ skipping 167 matching lines @@
 
 // Verify that Push() DCHECKs when a value is inserted twice.
 TEST_F(TaskSchedulerWorkerStackTest, PushTwice) {
   SchedulerWorkerStack stack;
   stack.Push(worker_a_.get());
   EXPECT_DCHECK_DEATH({ stack.Push(worker_a_.get()); });
 }
 
 }  // namespace internal
 }  // namespace base