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
|
/*
*
* 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 <algorithm>
#include <boost/bind.hpp>
using namespace std;
using namespace boost;
namespace qpid {
namespace cluster {
InitialStatusMap::InitialStatusMap(const MemberId& self_)
: self(self_), complete(), updateNeeded(), resendNeeded()
{
map[self] = optional<Status>();
}
void InitialStatusMap::configChange(const MemberSet& members) {
resendNeeded = false;
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>();
}
}
void InitialStatusMap::received(const MemberId& m, const Status& s){
map[m] = s;
}
bool InitialStatusMap::notInitialized(const Map::value_type& v) {
return !v.second;
}
bool InitialStatusMap::isActive(const Map::value_type& v) {
return v.second && v.second->getActive();
}
bool InitialStatusMap::isComplete() {
return find_if(map.begin(), map.end(), ¬Initialized) == map.end();
}
bool InitialStatusMap::isResendNeeded() {
bool ret = resendNeeded;
resendNeeded = false;
return ret;
}
bool InitialStatusMap::isUpdateNeeded() {
assert(isComplete());
// If there are any active members we need an update.
return find_if(map.begin(), map.end(), &isActive) != map.end();
}
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;
}
}} // namespace qpid::cluster
|
