forked from PX4/DriverFramework
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDFList.cpp
More file actions
348 lines (279 loc) · 5.91 KB
/
DFList.cpp
File metadata and controls
348 lines (279 loc) · 5.91 KB
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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
/**********************************************************************
* Copyright (c) 2015 Mark Charlebois
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted (subject to the limitations in the
* disclaimer below) provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
*
* * Neither the name of Dronecode Project nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE
* GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT
* HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
* IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*************************************************************************/
#include "DFList.hpp"
using namespace DriverFramework;
DFPointerList::~DFPointerList()
{
m_sync.lock();
Index next_del = m_head;
while (next_del != nullptr) {
Index curr = next_del;
next_del = curr->m_next;
delete curr;
}
m_head = nullptr;
m_sync.unlock();
}
unsigned int DFPointerList::size()
{
m_sync.lock();
unsigned int rv = m_size;
m_sync.unlock();
return rv;
}
bool DFPointerList::pushBack(void *item)
{
m_sync.lock();
Index t = new DFListNode(item);
if (t == nullptr) {
m_sync.unlock();
return false;
}
if (m_head == nullptr) {
m_head = t;
m_end = t;
} else {
m_end->m_next = t;
m_end = t;
}
++m_size;
m_sync.unlock();
return true;
}
bool DFPointerList::pushFront(void *item)
{
m_sync.lock();
Index t = new DFListNode(item);
if (t == nullptr) {
m_sync.unlock();
return false;
}
if (m_head == nullptr) {
m_head = t;
m_end = t;
} else {
t->m_next = m_head;
m_head = t;
}
++m_size;
m_sync.unlock();
return true;
}
DFPointerList::Index DFPointerList::erase(Index idx)
{
m_sync.lock();
if (idx != nullptr && idx == m_head) {
Index next_erase = m_head->m_next;
delete m_head;
m_head = next_erase;
if (next_erase == nullptr) {
m_end = nullptr;
}
--m_size;
m_sync.unlock();
return m_head;
} else {
for (Index curr = m_head; curr->m_next != nullptr;) {
Index next_erase = curr->m_next;
if (idx == next_erase) {
curr->m_next = next_erase->m_next;
if (next_erase == m_end) {
m_end = curr;
}
delete next_erase;
--m_size;
m_sync.unlock();
return curr->m_next;
}
curr = next_erase;
}
}
m_sync.unlock();
return nullptr;
}
void DFPointerList::clear()
{
m_sync.lock();
while (m_head != nullptr) {
Index tmp = m_head;
m_head = m_head->m_next;
delete tmp;
}
m_sync.unlock();
}
bool DFPointerList::empty()
{
m_sync.lock();
bool is_empty = (m_head == nullptr);
m_sync.unlock();
return is_empty;
}
DFPointerList::Index DFPointerList::next(Index &idx)
{
m_sync.lock();
if (idx == nullptr) {
idx = m_head;
} else {
idx = idx->m_next;
}
m_sync.unlock();
return idx;
}
void *DFPointerList::get(Index idx)
{
if (idx) {
return idx->m_item;
}
return nullptr;
}
DFUIntList::~DFUIntList()
{
m_sync.lock();
Index next_del = m_head;
while (next_del != nullptr) {
Index curr = next_del;
next_del = curr->m_next;
delete curr;
}
m_head = nullptr;
m_sync.unlock();
}
unsigned int DFUIntList::size()
{
return m_size;
}
bool DFUIntList::pushBack(unsigned int item)
{
m_sync.lock();
Index t = new DFUIntListNode(item);
if (t == nullptr) {
m_sync.unlock();
return false;
}
if (m_head == nullptr) {
m_head = t;
m_end = t;
} else {
m_end->m_next = t;
m_end = t;
}
++m_size;
m_sync.unlock();
return true;
}
bool DFUIntList::pushFront(unsigned int item)
{
m_sync.lock();
Index t = new DFUIntListNode(item);
if (t == nullptr) {
m_sync.unlock();
return false;
}
if (m_head == nullptr) {
m_head = t;
m_end = t;
} else {
t->m_next = m_head;
m_head = t;
}
++m_size;
m_sync.unlock();
return true;
}
DFUIntList::Index DFUIntList::erase(Index idx)
{
m_sync.lock();
if (idx != nullptr && idx == m_head) {
Index t = m_head->m_next;
delete (m_head);
m_head = t;
if (t == nullptr) {
m_end = nullptr;
}
--m_size;
m_sync.unlock();
return m_head;
} else {
for (Index p = m_head; p->m_next != nullptr;) {
Index t = p->m_next;
if (idx == t) {
p->m_next = t->m_next;
if (t == m_end) {
m_end = p;
}
delete (t);
--m_size;
m_sync.unlock();
return p->m_next;
}
p = t;
}
}
m_sync.unlock();
return nullptr;
}
void DFUIntList::clear()
{
while (m_head != nullptr) {
erase(m_head);
}
}
bool DFUIntList::empty()
{
m_sync.lock();
bool is_empty = (m_head == nullptr);
m_sync.unlock();
return is_empty;
}
DFUIntList::Index DFUIntList::next(Index &idx)
{
m_sync.lock();
if (idx == nullptr) {
idx = m_head;
} else {
idx = idx->m_next;
}
m_sync.unlock();
return idx;
}
bool DFUIntList::get(Index idx, unsigned int &val)
{
if (idx) {
val = idx->m_item;
return true;
}
return false;
}