1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// Copyright 2016 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/task/thread_pool/worker_thread_set.h"
#include <algorithm>
#include "base/check_op.h"
#include "base/task/thread_pool/worker_thread.h"
namespace base::internal {
bool WorkerThreadSet::Compare::operator()(const WorkerThread* a,
const WorkerThread* b) const {
return a->sequence_num() < b->sequence_num();
}
WorkerThreadSet::WorkerThreadSet() = default;
WorkerThreadSet::~WorkerThreadSet() = default;
void WorkerThreadSet::Insert(WorkerThread* worker) {
DCHECK(!Contains(worker)) << "WorkerThread already on stack";
auto old_first = set_.begin();
set_.insert(worker);
if (worker != *set_.begin()) {
worker->BeginUnusedPeriod();
} else if (old_first != set_.end()) {
(*old_first)->BeginUnusedPeriod();
}
}
WorkerThread* WorkerThreadSet::Take() {
if (IsEmpty()) {
return nullptr;
}
WorkerThread* const worker = *set_.begin();
set_.erase(set_.begin());
if (!IsEmpty()) {
(*set_.begin())->EndUnusedPeriod();
}
return worker;
}
WorkerThread* WorkerThreadSet::Peek() const {
if (IsEmpty()) {
return nullptr;
}
return *set_.begin();
}
bool WorkerThreadSet::Contains(const WorkerThread* worker) const {
return set_.count(const_cast<WorkerThread*>(worker)) > 0;
}
void WorkerThreadSet::Remove(const WorkerThread* worker) {
DCHECK(!IsEmpty());
DCHECK_NE(worker, *set_.begin());
auto it = set_.find(const_cast<WorkerThread*>(worker));
CHECK(it != set_.end());
DCHECK_NE(TimeTicks(), (*it)->GetLastUsedTime());
set_.erase(it);
}
} // namespace base::internal
|
