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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
//===-- Iterable.h ----------------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef liblldb_Iterable_h_
#define liblldb_Iterable_h_
// C Includes
// C++ Includes
#include <utility>
// Other libraries and framework includes
// Project includes
namespace lldb_private {
template <typename I, typename E> E map_adapter(I &iter) {
return iter->second;
}
template <typename I, typename E> E vector_adapter(I &iter) { return *iter; }
template <typename I, typename E> E list_adapter(I &iter) { return *iter; }
template <typename C, typename E, E (*A)(typename C::const_iterator &)>
class AdaptedConstIterator {
public:
typedef typename C::const_iterator BackingIterator;
// Wrapping constructor
AdaptedConstIterator(BackingIterator backing_iterator)
: m_iter(backing_iterator) {}
// Default-constructible
AdaptedConstIterator() : m_iter() {}
// Copy-constructible
AdaptedConstIterator(const AdaptedConstIterator &rhs) : m_iter(rhs.m_iter) {}
// Copy-assignable
AdaptedConstIterator &operator=(const AdaptedConstIterator &rhs) {
m_iter = rhs.m_iter;
return *this;
}
// Destructible
~AdaptedConstIterator() = default;
// Comparable
bool operator==(const AdaptedConstIterator &rhs) {
return m_iter == rhs.m_iter;
}
bool operator!=(const AdaptedConstIterator &rhs) {
return m_iter != rhs.m_iter;
}
// Rvalue dereferenceable
E operator*() { return (*A)(m_iter); }
E operator->() { return (*A)(m_iter); }
// Offset dereferenceable
E operator[](typename BackingIterator::difference_type offset) {
return AdaptedConstIterator(m_iter + offset);
}
// Incrementable
AdaptedConstIterator &operator++() {
m_iter++;
return *this;
}
// Decrementable
AdaptedConstIterator &operator--() {
m_iter--;
return *this;
}
// Compound assignment
AdaptedConstIterator &
operator+=(typename BackingIterator::difference_type offset) {
m_iter += offset;
return *this;
}
AdaptedConstIterator &
operator-=(typename BackingIterator::difference_type offset) {
m_iter -= offset;
return *this;
}
// Arithmetic
AdaptedConstIterator
operator+(typename BackingIterator::difference_type offset) {
return AdaptedConstIterator(m_iter + offset);
}
AdaptedConstIterator
operator-(typename BackingIterator::difference_type offset) {
return AdaptedConstIterator(m_iter - offset);
}
// Comparable
bool operator<(AdaptedConstIterator &rhs) { return m_iter < rhs.m_iter; }
bool operator<=(AdaptedConstIterator &rhs) { return m_iter <= rhs.m_iter; }
bool operator>(AdaptedConstIterator &rhs) { return m_iter > rhs.m_iter; }
bool operator>=(AdaptedConstIterator &rhs) { return m_iter >= rhs.m_iter; }
template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
friend AdaptedConstIterator<C1, E1, A1>
operator+(typename C1::const_iterator::difference_type,
AdaptedConstIterator<C1, E1, A1> &);
template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
friend typename C1::const_iterator::difference_type
operator-(AdaptedConstIterator<C1, E1, A1> &,
AdaptedConstIterator<C1, E1, A1> &);
template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
friend void swap(AdaptedConstIterator<C1, E1, A1> &,
AdaptedConstIterator<C1, E1, A1> &);
private:
BackingIterator m_iter;
};
template <typename C, typename E, E (*A)(typename C::const_iterator &)>
AdaptedConstIterator<C, E, A> operator+(
typename AdaptedConstIterator<C, E, A>::BackingIterator::difference_type
offset,
AdaptedConstIterator<C, E, A> &rhs) {
return rhs.operator+(offset);
}
template <typename C, typename E, E (*A)(typename C::const_iterator &)>
typename AdaptedConstIterator<C, E, A>::BackingIterator::difference_type
operator-(AdaptedConstIterator<C, E, A> &lhs,
AdaptedConstIterator<C, E, A> &rhs) {
return (lhs.m_iter - rhs.m_iter);
}
template <typename C, typename E, E (*A)(typename C::const_iterator &)>
void swap(AdaptedConstIterator<C, E, A> &lhs,
AdaptedConstIterator<C, E, A> &rhs) {
std::swap(lhs.m_iter, rhs.m_iter);
}
template <typename C, typename E, E (*A)(typename C::const_iterator &)>
class AdaptedIterable {
private:
const C &m_container;
public:
AdaptedIterable(const C &container) : m_container(container) {}
AdaptedConstIterator<C, E, A> begin() {
return AdaptedConstIterator<C, E, A>(m_container.begin());
}
AdaptedConstIterator<C, E, A> end() {
return AdaptedConstIterator<C, E, A>(m_container.end());
}
};
template <typename C, typename E, E (*A)(typename C::const_iterator &),
typename MutexType>
class LockingAdaptedIterable : public AdaptedIterable<C, E, A> {
public:
LockingAdaptedIterable(C &container, MutexType &mutex)
: AdaptedIterable<C, E, A>(container), m_mutex(&mutex) {
m_mutex->lock();
}
LockingAdaptedIterable(LockingAdaptedIterable &&rhs)
: AdaptedIterable<C, E, A>(rhs), m_mutex(rhs.m_mutex) {
rhs.m_mutex = nullptr;
}
~LockingAdaptedIterable() {
if (m_mutex)
m_mutex->unlock();
}
private:
MutexType *m_mutex = nullptr;
LockingAdaptedIterable(const LockingAdaptedIterable &) = delete;
LockingAdaptedIterable &operator=(const LockingAdaptedIterable &) = delete;
};
} // namespace lldb_private
#endif // liblldb_Iterable_h_
|
