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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/include/util/locked/queue.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* Contributors Listed Below - COPYRIGHT 2010,2018 */
/* [+] International Business Machines Corp. */
/* */
/* */
/* 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. */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __UTIL_LOCKED_QUEUE_H
#define __UTIL_LOCKED_QUEUE_H
#include <stddef.h>
#include <util/locked/lock.H>
namespace Util
{
namespace Locked
{
template <typename _T, bool locked = false, typename _S = int>
class Queue
{
public:
Queue() : head(NULL), tail(NULL), count(0), lock() {};
~Queue() {};
_T* remove();
void insert(_T*);
size_t size();
protected:
_T* head;
_T* tail;
size_t count;
_S lock;
void __lock();
void __unlock();
};
template <typename _T, bool locked, typename _S>
_T* Queue<_T,locked,_S>::remove()
{
_T* item = NULL;
__lock();
if (tail != NULL)
{
item = tail;
if (head == tail)
head = tail = NULL;
else
tail = item->prev;
count--;
}
__unlock();
return item;
}
template <typename _T, bool locked, typename _S>
void Queue<_T,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;
}
count++;
__unlock();
}
template <typename _T, bool locked, typename _S>
size_t Queue<_T,locked,_S>::size()
{
return count;
}
template <typename _T, bool locked, typename _S>
void Queue<_T,locked,_S>::__lock()
{
Util::Locked::LockHelper<locked,_S>(lock).lock();
}
template <typename _T, bool locked, typename _S>
void Queue<_T,locked,_S>::__unlock()
{
Util::Locked::LockHelper<locked,_S>(lock).unlock();
}
};
};
#endif
|
