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
|
#ifndef __UTIL_LOCKED_LIST_H
#define __UTIL_LOCKED_LIST_H
#include <stddef.h>
#include <util/locked/lock.H>
namespace Util
{
namespace Locked
{
template <typename _T, typename _K,
bool locked = false, typename _S = int>
class List
{
public:
List() : head(NULL), tail(NULL), lock() {};
~List() {};
_T* remove();
void insert(_T*);
void erase(_T* node);
void erase(_K& key);
_T* find(_K& key);
protected:
_T* head;
_T* tail;
_S lock;
void __lock();
void __unlock();
};
template <typename _T, typename _K, bool locked, typename _S>
_T* List<_T,_K,locked,_S>::remove()
{
_T* item = NULL;
__lock();
if (tail != NULL)
{
item = tail;
if (head == tail)
head = tail = NULL;
else
tail = item->prev;
}
__unlock();
return item;
}
template <typename _T, typename _K, bool locked, typename _S>
void List<_T,_K,locked,_S>::insert(_T* item)
{
__lock();
if (head == NULL)
{
item->next = item->prev = NULL;
head = tail = item;
}
else
{
item->prev = NULL;
item->next = head;
head = head->prev = item;
}
__unlock();
}
template <typename _T, typename _K, bool locked, typename _S>
void List<_T,_K,locked,_S>::__lock()
{
Util::Locked::LockHelper<locked,_S>(lock).lock();
}
template <typename _T, typename _K, bool locked, typename _S>
void List<_T,_K,locked,_S>::__unlock()
{
Util::Locked::LockHelper<locked,_S>(lock).unlock();
}
template <typename _T, typename _K, bool locked, typename _S>
void List<_T,_K,locked,_S>::erase(_T* node)
{
__lock();
if (node == head)
head = node->next;
else
node->prev->next = node->next;
if (node == tail)
tail = node->prev;
else
node->next->prev = node->prev;
__unlock();
}
template <typename _T, typename _K, bool locked, typename _S>
void List<_T,_K,locked,_S>::erase(_K& key)
{
__lock();
_T* node = head;
while((node != NULL) && (node->key != key))
node = node->next;
if (node != NULL)
{
if (node == head)
head = node->next;
else
node->prev->next = node->next;
if (node == tail)
tail = node->prev;
else
node->next->prev = node->prev;
}
__unlock();
return node;
}
template <typename _T, typename _K, bool locked, typename _S>
_T* List<_T,_K,locked,_S>::find(_K& key)
{
__lock();
_T* node = head;
while((node != NULL) && (node->key != key))
node = node->next;
__unlock();
return node;
}
}
}
#endif
|
