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
|
/* Copyright (C) 2003 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifndef SIGNAL_COUNTER_HPP
#define SIGNAL_COUNTER_HPP
#include <NodeBitmask.hpp>
#include <ErrorReporter.hpp>
class SignalCounter {
friend struct NodeReceiverGroup;
private:
Uint32 m_count;
NdbNodeBitmask m_nodes;
public:
SignalCounter() { clearWaitingFor();}
void clearWaitingFor();
/**
* When sending to different node
*/
void setWaitingFor(Uint32 nodeId);
void clearWaitingFor(Uint32 nodeId);
void forceClearWaitingFor(Uint32 nodeId);
bool isWaitingFor(Uint32 nodeId) const;
bool done() const;
const char * getText() const;
SignalCounter& operator=(const NdbNodeBitmask & bitmask);
SignalCounter& operator=(const NodeReceiverGroup& rg) {
return (* this) = rg.m_nodes;
}
/**
* When sending to same node
*/
SignalCounter& operator=(Uint32 count);
SignalCounter& operator--(int);
SignalCounter& operator++(int);
SignalCounter& operator+=(Uint32);
Uint32 getCount() const;
};
inline
void
SignalCounter::setWaitingFor(Uint32 nodeId) {
if(!m_nodes.get(nodeId)){
m_nodes.set(nodeId);
m_count++;
return;
}
ErrorReporter::handleAssert("SignalCounter::set", __FILE__, __LINE__);
}
inline
bool
SignalCounter::isWaitingFor(Uint32 nodeId) const {
return m_nodes.get(nodeId);
}
inline
bool
SignalCounter::done() const {
return m_count == 0;
}
inline
Uint32
SignalCounter::getCount() const {
return m_count;
}
inline
void
SignalCounter::clearWaitingFor(Uint32 nodeId) {
if(m_nodes.get(nodeId) && m_count > 0){
m_count--;
m_nodes.clear(nodeId);
return;
}
ErrorReporter::handleAssert("SignalCounter::clear", __FILE__, __LINE__);
}
inline
void
SignalCounter::clearWaitingFor(){
m_count = 0;
m_nodes.clear();
}
inline
void
SignalCounter::forceClearWaitingFor(Uint32 nodeId){
if(isWaitingFor(nodeId)){
clearWaitingFor(nodeId);
}
}
inline
SignalCounter&
SignalCounter::operator=(Uint32 count){
m_count = count;
m_nodes.clear();
return * this;
}
inline
SignalCounter&
SignalCounter::operator--(int){
if(m_count > 0){
m_count--;
return * this;
}
ErrorReporter::handleAssert("SignalCounter::operator--", __FILE__, __LINE__);
return * this;
}
inline
SignalCounter&
SignalCounter::operator++(int){
m_count++;
return * this;
}
inline
SignalCounter&
SignalCounter::operator+=(Uint32 n){
m_count += n;
return * this;
}
inline
const char *
SignalCounter::getText() const {
static char buf[255];
static char nodes[NodeBitmask::TextLength+1];
BaseString::snprintf(buf, sizeof(buf), "[SignalCounter: m_count=%d %s]", m_count, m_nodes.getText(nodes));
return buf;
}
inline
SignalCounter&
SignalCounter::operator=(const NdbNodeBitmask & bitmask){
m_nodes = bitmask;
m_count = bitmask.count();
return * this;
}
#endif
|
