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
|
/*
*
* 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 "QueueReplica.h"
#include "QueueContext.h"
#include "PrettyId.h"
#include "qpid/broker/Queue.h"
#include "qpid/log/Statement.h"
#include <algorithm>
namespace qpid {
namespace cluster {
QueueReplica::QueueReplica(QueueContext& qc, const MemberId& self_)
: self(self_), context(qc)
{}
struct PrintSubscribers {
const QueueReplica::MemberQueue& mq;
MemberId self;
PrintSubscribers(const QueueReplica::MemberQueue& m, const MemberId& s) : mq(m), self(s) {}
};
std::ostream& operator<<(std::ostream& o, const PrintSubscribers& ps) {
for (QueueReplica::MemberQueue::const_iterator i = ps.mq.begin(); i != ps.mq.end(); ++i)
o << PrettyId(*i, ps.self) << " ";
return o;
}
std::ostream& operator<<(std::ostream& o, QueueOwnership s) {
static char* tags[] = { "unsubscribed", "subscribed", "sole_owner", "shared_owner" };
return o << tags[s];
}
void QueueReplica::subscribe(const MemberId& member) {
QueueOwnership before = getState();
subscribers.push_back(member);
update(before);
}
void QueueReplica::unsubscribe(const MemberId& member, bool resubscribe)
{
assert(!resubscribe || member == subscribers.front());
QueueOwnership before = getState();
MemberQueue::iterator i = std::remove(subscribers.begin(), subscribers.end(), member);
subscribers.erase(i, subscribers.end());
if (resubscribe) subscribers.push_back(member);
update(before);
}
void QueueReplica::consumed(const MemberId& member,
const framing::SequenceSet& acquired,
const framing::SequenceSet& dequeued)
{
context.consumed(member, acquired, dequeued);
}
void QueueReplica::update(QueueOwnership before) {
QueueOwnership after = getState();
QPID_LOG(trace, "cluster: queue replica: " << context.getQueue().getName() << ": "
<< before << "->" << after << " [" << PrintSubscribers(subscribers, self) << "]");
context.replicaState(before, after);
}
QueueOwnership QueueReplica::getState() const {
if (isOwner())
return (subscribers.size() > 1) ? SHARED_OWNER : SOLE_OWNER;
else
return (isSubscriber(self)) ? SUBSCRIBED : UNSUBSCRIBED;
}
bool QueueReplica::isOwner() const {
return !subscribers.empty() && subscribers.front() == self;
}
bool QueueReplica::isSubscriber(const MemberId& member) const {
return std::find(subscribers.begin(), subscribers.end(), member) != subscribers.end();
}
}} // namespace qpid::cluster::exp
|
