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
|
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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 QPID_LINEARSTORE_ATOMICCOUNTER_H_
#define QPID_LINEARSTORE_ATOMICCOUNTER_H_
#include "qpid/linearstore/jrnl/slock.h"
namespace qpid {
namespace qls_jrnl {
template <class T>
class AtomicCounter
{
private:
T count_;
mutable smutex countMutex;
public:
AtomicCounter(const T& initValue = T(0)) : count_(initValue) {}
virtual ~AtomicCounter() {}
T get() const {
slock l(countMutex);
return count_;
}
T increment() {
slock l(countMutex);
return ++count_;
}
T add(const T& a) {
slock l(countMutex);
count_ += a;
return count_;
}
T addLimit(const T& a, const T& limit, const uint32_t jerr) {
slock l(countMutex);
if (count_ + a > limit) throw jexception(jerr, "AtomicCounter", "addLimit");
count_ += a;
return count_;
}
T decrement() {
slock l(countMutex);
return --count_;
}
T decrementLimit(const T& limit = T(0), const uint32_t jerr = jerrno::JERR__UNDERFLOW) {
slock l(countMutex);
if (count_ < limit + 1) {
throw jexception(jerr, "AtomicCounter", "decrementLimit");
}
return --count_;
}
T subtract(const T& s) {
slock l(countMutex);
count_ -= s;
return count_;
}
T subtractLimit(const T& s, const T& limit = T(0), const uint32_t jerr = jerrno::JERR__UNDERFLOW) {
slock l(countMutex);
if (count_ < limit + s) throw jexception(jerr, "AtomicCounter", "subtractLimit");
count_ -= s;
return count_;
}
bool operator==(const T& o) const {
slock l(countMutex);
return count_ == o;
}
bool operator<(const T& o) const {
slock l(countMutex);
return count_ < o;
}
bool operator<=(const T& o) const {
slock l(countMutex);
return count_ <= o;
}
friend T operator-(const T& a, const AtomicCounter& b) {
slock l(b.countMutex);
return a - b.count_;
}
friend T operator-(const AtomicCounter& a, const T& b) {
slock l(a.countMutex);
return a.count_ - b;
}
friend T operator-(const AtomicCounter&a, const AtomicCounter& b) {
slock l1(a.countMutex);
slock l2(b.countMutex);
return a.count_ - b.count_;
}
};
}} // namespace qpid::qls_jrnl
#endif // QPID_LINEARSTORE_ATOMICCOUNTER_H_
|
