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
|
/* 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; version 2 of the License.
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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA */
#include "SimulatedBlock.hpp"
#include "SafeCounter.hpp"
#include <signaldata/NodeFailRep.hpp>
SafeCounterManager::SafeCounterManager(class SimulatedBlock & block)
: m_block(block),
m_activeCounters(m_counterPool)
{}
bool
SafeCounterManager::setSize(Uint32 maxNoOfActiveMutexes, bool exit_on_error) {
return m_counterPool.setSize(maxNoOfActiveMutexes, false, exit_on_error);
}
Uint32
SafeCounterManager::getSize() const {
return m_counterPool.getSize();
}
bool
SafeCounterManager::seize(ActiveCounterPtr& ptr){
return m_activeCounters.seize(ptr);
}
void
SafeCounterManager::release(ActiveCounterPtr& ptr){
m_activeCounters.release(ptr);
}
void
SafeCounterManager::getPtr(ActiveCounterPtr& ptr, Uint32 ptrI){
m_activeCounters.getPtr(ptr, ptrI);
}
void
SafeCounterManager::printNODE_FAILREP(){
ActiveCounterPtr ptr;
NodeBitmask nodes;
nodes.clear();
// nodes.bitORC(nodes);
for(m_activeCounters.first(ptr); !ptr.isNull(); m_activeCounters.next(ptr)){
ActiveCounter::SignalDesc desc = ptr.p->m_signalDesc;
ndbout_c("theData[desc.m_senderDataOffset=%u] = %u",
desc.m_senderDataOffset, ptr.p->m_senderData);
ndbout_c("theData[desc.m_errorCodeOffset=%u] = %u",
desc.m_errorCodeOffset, desc.m_nodeFailErrorCode);
Uint32 len = MAX(MAX(desc.m_senderDataOffset, desc.m_errorCodeOffset),
desc.m_senderRefOffset);
NodeBitmask overlapping = ptr.p->m_nodes;
Uint32 i = 0;
while((i = overlapping.find(i)) != NodeBitmask::NotFound){
ndbout_c(" theData[desc.m_senderRefOffset=%u] = %x",
desc.m_senderRefOffset, numberToRef(desc.m_block, i));
ndbout_c(" sendSignal(%x,%u,signal,%u,JBB",
m_block.reference(), desc.m_gsn, len+1);
i++;
}
}
}
void
SafeCounterManager::execNODE_FAILREP(Signal* signal){
Uint32 * theData = signal->getDataPtrSend();
ActiveCounterPtr ptr;
NodeBitmask nodes;
nodes.assign(NodeBitmask::Size,
((const NodeFailRep*)signal->getDataPtr())->theNodes);
for(m_activeCounters.first(ptr); !ptr.isNull(); m_activeCounters.next(ptr)){
if(nodes.overlaps(ptr.p->m_nodes)){
ActiveCounter::SignalDesc desc = ptr.p->m_signalDesc;
theData[desc.m_senderDataOffset] = ptr.p->m_senderData;
theData[desc.m_errorCodeOffset] = desc.m_nodeFailErrorCode;
Uint32 len = MAX(MAX(desc.m_senderDataOffset, desc.m_errorCodeOffset),
desc.m_senderRefOffset);
NodeBitmask overlapping = ptr.p->m_nodes;
overlapping.bitAND(nodes);
Uint32 i = 0;
while((i = overlapping.find(i)) != NodeBitmask::NotFound){
theData[desc.m_senderRefOffset] = numberToRef(desc.m_block, i);
m_block.sendSignal(m_block.reference(), desc.m_gsn, signal, len+1,JBB);
i++;
}
}
}
}
BlockReference
SafeCounterManager::reference() const {
return m_block.reference();
}
void
SafeCounterManager::progError(int line, int err_code, const char* extra){
m_block.progError(line, err_code, extra);
}
bool
SafeCounterHandle::clearWaitingFor(SafeCounterManager& mgr, Uint32 nodeId)
{
SafeCounterManager::ActiveCounterPtr ptr;
mgr.getPtr(ptr, m_activeCounterPtrI);
ptr.p->m_nodes.clear(nodeId);
if (ptr.p->m_nodes.isclear()){
mgr.release(ptr);
m_activeCounterPtrI = RNIL;
return true;
}
return false;
}
SafeCounter::~SafeCounter(){
bool clear = m_count == 0;
bool isnull = m_ptr.i == RNIL;
m_activeCounterPtrI = m_ptr.i;
if(clear && isnull)
return;
if(clear && !isnull){
m_mgr.release(m_ptr);
m_activeCounterPtrI = RNIL;
return;
}
/**
* !clear && !isnull
*/
if(!isnull){
m_ptr.p->m_nodes = m_nodes;
return;
}
ErrorReporter::handleAssert("~SafeCounter:: wo/ init", __FILE__, __LINE__);
}
|
