blob: 356c72caed9371547e5f42f758c21e470de2b2c3 (
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/*
* Copyright (C) 2016 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 ANDROID_HIDL_SYNCHRONIZED_QUEUE_H
#define ANDROID_HIDL_SYNCHRONIZED_QUEUE_H
#include <condition_variable>
#include <mutex>
#include <queue>
#include <thread>
namespace android {
namespace hardware {
namespace details {
/* Threadsafe queue.
*/
template <typename T>
struct SynchronizedQueue {
SynchronizedQueue(size_t limit);
/* Gets an item from the front of the queue.
*
* Blocks until the item is available.
*/
T wait_pop();
/* Puts an item onto the end of the queue.
*/
bool push(const T& item);
/* Gets the size of the array.
*/
size_t size();
std::unique_lock<std::mutex> lock() {
return std::unique_lock<std::mutex>(mMutex);
}
bool isInitializedLocked() {
return mInitialized;
}
void setInitializedLocked(bool isInitialized) {
mInitialized = isInitialized;
}
private:
std::condition_variable mCondition;
std::mutex mMutex;
std::queue<T> mQueue;
const size_t mQueueLimit;
bool mInitialized = false;
};
template <typename T>
SynchronizedQueue<T>::SynchronizedQueue(size_t limit) : mQueueLimit(limit) {
}
template <typename T>
T SynchronizedQueue<T>::wait_pop() {
std::unique_lock<std::mutex> lock(mMutex);
mCondition.wait(lock, [this]{
return !this->mQueue.empty();
});
T item = mQueue.front();
mQueue.pop();
return item;
}
template <typename T>
bool SynchronizedQueue<T>::push(const T &item) {
bool success;
{
std::unique_lock<std::mutex> lock(mMutex);
if (mQueue.size() < mQueueLimit) {
mQueue.push(item);
success = true;
} else {
success = false;
}
}
mCondition.notify_one();
return success;
}
template <typename T>
size_t SynchronizedQueue<T>::size() {
std::unique_lock<std::mutex> lock(mMutex);
return mQueue.size();
}
} // namespace details
} // namespace hardware
} // namespace android
#endif // ANDROID_HIDL_SYNCHRONIZED_QUEUE_H
|
