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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
|
/*
*
* 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.
*
*/
#include "InitialStatusMap.h"
#include "StoreStatus.h"
#include <algorithm>
#include <boost/bind.hpp>
namespace qpid {
namespace cluster {
using namespace std;
using namespace boost;
using namespace framing::cluster;
using namespace framing;
InitialStatusMap::InitialStatusMap(const MemberId& self_, size_t size_)
: self(self_), completed(), resendNeeded(), size(size_)
{}
void InitialStatusMap::configChange(const MemberSet& members) {
resendNeeded = false;
bool wasComplete = isComplete();
if (firstConfig.empty()) firstConfig = members;
MemberSet::const_iterator i = members.begin();
Map::iterator j = map.begin();
while (i != members.end() || j != map.end()) {
if (i == members.end()) { // j not in members, member left
Map::iterator k = j++;
map.erase(k);
}
else if (j == map.end()) { // i not in map, member joined
resendNeeded = true;
map[*i] = optional<Status>();
++i;
}
else if (*i < j->first) { // i not in map, member joined
resendNeeded = true;
map[*i] = optional<Status>();
++i;
}
else if (*i > j->first) { // j not in members, member left
Map::iterator k = j++;
map.erase(k);
}
else {
i++; j++;
}
}
if (resendNeeded) { // Clear all status
for (Map::iterator i = map.begin(); i != map.end(); ++i)
i->second = optional<Status>();
}
completed = isComplete() && !wasComplete; // Set completed on the transition.
}
void InitialStatusMap::received(const MemberId& m, const Status& s){
bool wasComplete = isComplete();
map[m] = s;
completed = isComplete() && !wasComplete; // Set completed on the transition.
}
bool InitialStatusMap::notInitialized(const Map::value_type& v) {
return !v.second;
}
bool InitialStatusMap::isComplete() {
return !map.empty() && find_if(map.begin(), map.end(), ¬Initialized) == map.end()
&& (map.size() >= size);
}
bool InitialStatusMap::transitionToComplete() {
return completed;
}
bool InitialStatusMap::isResendNeeded() {
bool ret = resendNeeded;
resendNeeded = false;
return ret;
}
bool InitialStatusMap::isActive(const Map::value_type& v) {
return v.second && v.second->getActive();
}
bool InitialStatusMap::hasStore(const Map::value_type& v) {
return v.second &&
(v.second->getStoreState() == STORE_STATE_CLEAN_STORE ||
v.second->getStoreState() == STORE_STATE_DIRTY_STORE);
}
bool InitialStatusMap::isUpdateNeeded() {
assert(isComplete());
// We need an update if there are any active members.
if (find_if(map.begin(), map.end(), &isActive) != map.end()) return true;
// Otherwise it depends on store status, get my own status:
Map::iterator me = map.find(self);
assert(me != map.end());
assert(me->second);
switch (me->second->getStoreState()) {
case STORE_STATE_NO_STORE:
case STORE_STATE_EMPTY_STORE:
// If anybody has a store then we need an update.
return find_if(map.begin(), map.end(), &hasStore) != map.end();
case STORE_STATE_DIRTY_STORE: return true;
case STORE_STATE_CLEAN_STORE: return false; // Use our own store
}
return false;
}
MemberSet InitialStatusMap::getElders() {
assert(isComplete());
MemberSet elders;
// Elders are from first config change, active or higher node-id.
for (MemberSet::iterator i = firstConfig.begin(); i != firstConfig.end(); ++i) {
if (map.find(*i) != map.end() && (map[*i]->getActive() || *i > self))
elders.insert(*i);
}
return elders;
}
// Get cluster ID from an active member or the youngest newcomer.
framing::Uuid InitialStatusMap::getClusterId() {
assert(isComplete());
assert(!map.empty());
Map::iterator i = find_if(map.begin(), map.end(), &isActive);
if (i != map.end())
return i->second->getClusterId(); // An active member
else
return map.begin()->second->getClusterId(); // Youngest newcomer in node-id order
}
void checkId(Uuid& expect, const Uuid& actual, const string& msg) {
if (!expect) expect = actual;
assert(expect);
if (expect != actual)
throw Exception(msg);
}
void InitialStatusMap::checkConsistent() {
assert(isComplete());
int clean = 0;
int dirty = 0;
int empty = 0;
int none = 0;
int active = 0;
Uuid clusterId;
Uuid shutdownId;
for (Map::iterator i = map.begin(); i != map.end(); ++i) {
if (i->second->getActive()) ++active;
switch (i->second->getStoreState()) {
case STORE_STATE_NO_STORE: ++none; break;
case STORE_STATE_EMPTY_STORE: ++empty; break;
case STORE_STATE_DIRTY_STORE:
++dirty;
checkId(clusterId, i->second->getClusterId(),
"Cluster-ID mismatch. Stores belong to different clusters.");
break;
case STORE_STATE_CLEAN_STORE:
++clean;
checkId(clusterId, i->second->getClusterId(),
"Cluster-ID mismatch. Stores belong to different clusters.");
checkId(shutdownId, i->second->getShutdownId(),
"Shutdown-ID mismatch. Stores were not shut down together");
break;
}
}
// Can't mix transient and persistent members.
if (none && (clean+dirty+empty))
throw Exception("Mixing transient and persistent brokers in a cluster");
// If there are no active members and there are dirty stores there
// must be at least one clean store.
if (!active && dirty && !clean)
throw Exception("Cannot recover, no clean store");
}
}} // namespace qpid::cluster
|
