blob: 0b6a9a173a563bef997330da47e3fdb16921c6fa (
plain)
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
67
68
69
70
71
72
73
74
75
76
77
78
79
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef LINKEDBLOCKINGQUEUE_H_
#define LINKEDBLOCKINGQUEUE_H_
#include <utils/List.h>
#include <utils/Mutex.h>
#include <utils/Condition.h>
namespace android {
template<typename T>
class LinkedBlockingQueue {
List<T> mList;
Mutex mLock;
Condition mContentAvailableCondition;
T front(bool remove) {
Mutex::Autolock autolock(mLock);
while (mList.empty()) {
mContentAvailableCondition.wait(mLock);
}
T e = *(mList.begin());
if (remove) {
mList.erase(mList.begin());
}
return e;
}
DISALLOW_EVIL_CONSTRUCTORS(LinkedBlockingQueue);
public:
LinkedBlockingQueue() {
}
~LinkedBlockingQueue() {
}
bool empty() {
Mutex::Autolock autolock(mLock);
return mList.empty();
}
void clear() {
Mutex::Autolock autolock(mLock);
mList.clear();
}
T peek() {
return front(false);
}
T take() {
return front(true);
}
void push(T e) {
Mutex::Autolock autolock(mLock);
mList.push_back(e);
mContentAvailableCondition.signal();
}
};
} /* namespace android */
#endif /* LINKEDBLOCKINGQUEUE_H_ */
|
