diff options
author | Alan Conway <aconway@apache.org> | 2009-11-17 18:09:01 +0000 |
---|---|---|
committer | Alan Conway <aconway@apache.org> | 2009-11-17 18:09:01 +0000 |
commit | ef7728a725272b88c3cd2f81f81ee60ed00cde90 (patch) | |
tree | 5083904bb1324c93cf399c6c8b04ee4f0cb03549 /cpp/src/qpid/cluster/InitialStatusMap.cpp | |
parent | 74c1740d54360bb4b091b5486c69f0f945d27abd (diff) | |
download | qpid-python-ef7728a725272b88c3cd2f81f81ee60ed00cde90.tar.gz |
cluster::InitialStatusMap and unit tests, support for improved cluster join protocol.
git-svn-id: https://svn.apache.org/repos/asf/qpid/trunk/qpid@881420 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'cpp/src/qpid/cluster/InitialStatusMap.cpp')
-rw-r--r-- | cpp/src/qpid/cluster/InitialStatusMap.cpp | 110 |
1 files changed, 110 insertions, 0 deletions
diff --git a/cpp/src/qpid/cluster/InitialStatusMap.cpp b/cpp/src/qpid/cluster/InitialStatusMap.cpp new file mode 100644 index 0000000000..8c55a66ed7 --- /dev/null +++ b/cpp/src/qpid/cluster/InitialStatusMap.cpp @@ -0,0 +1,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 |