TaskScheduler [7] SchedulerThreadPool

base/task_scheduler/priority_queue.h

 // 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.
 
 #ifndef BASE_TASK_SCHEDULER_PRIORITY_QUEUE_H_
 #define BASE_TASK_SCHEDULER_PRIORITY_QUEUE_H_
 
 #include <memory>
 #include <queue>
 #include <vector>
@@ skipping 78 matching lines @@
   PriorityQueue(const PriorityQueue* predecessor_priority_queue);
 
   ~PriorityQueue();
 
   // Begins a Transaction. This method cannot be called on a thread which has an
   // active Transaction unless the last Transaction created on the thread was
   // for the allowed predecessor specified in the constructor of this
   // PriorityQueue.
   std::unique_ptr<Transaction> BeginTransaction();
 
+  const SchedulerLock* container_lock() const { return &container_lock_; }
+
  private:
   struct SequenceAndSortKeyComparator {
     bool operator()(const std::unique_ptr<SequenceAndSortKey>& left,
                     const std::unique_ptr<SequenceAndSortKey>& right) const {
       return left->sort_key < right->sort_key;
     }
   };
   using ContainerType =
       std::priority_queue<std::unique_ptr<SequenceAndSortKey>,
                           std::vector<std::unique_ptr<SequenceAndSortKey>>,
                           SequenceAndSortKeyComparator>;
 
   // Synchronizes access to |container_|.
   SchedulerLock container_lock_;
 
   ContainerType container_;
 
   // A null SequenceAndSortKey returned by Peek() when the PriorityQueue is
   // empty.
   const SequenceAndSortKey empty_sequence_and_sort_key_;
 
   DISALLOW_COPY_AND_ASSIGN(PriorityQueue);
 };
 
 }  // namespace internal
 }  // namespace base
 
 #endif  // BASE_TASK_SCHEDULER_PRIORITY_QUEUE_H_