blob: 8694f2d8c223c8333b6bedb0dc5dd593758a50eb (
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
|
/*
* Copyright (C) 2019 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 _DNS_LOCKED_QUEUE_H
#define _DNS_LOCKED_QUEUE_H
#include <algorithm>
#include <deque>
#include <mutex>
#include <android-base/thread_annotations.h>
namespace android {
namespace net {
template <typename T>
class LockedQueue {
public:
// Push an item onto the queue.
void push(T item) {
std::lock_guard guard(mLock);
mQueue.push_front(std::move(item));
}
// Swap out the contents of the queue
void swap(std::deque<T>& other) {
std::lock_guard guard(mLock);
mQueue.swap(other);
}
private:
std::mutex mLock;
std::deque<T> mQueue GUARDED_BY(mLock);
};
template <typename T>
class LockedRingBuffer {
public:
explicit LockedRingBuffer(size_t size) : mCapacity(size) {}
void push(T&& record) {
std::lock_guard guard(mLock);
mQueue.push_back(std::move(record));
if (mQueue.size() > mCapacity) {
mQueue.pop_front();
}
}
std::deque<T> copy() const {
std::lock_guard guard(mLock);
return mQueue;
}
private:
mutable std::mutex mLock;
const size_t mCapacity;
std::deque<T> mQueue GUARDED_BY(mLock);
};
} // end of namespace net
} // end of namespace android
#endif // _DNS_LOCKEDQUEUE_H
|
