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
|
/*
*
* 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 "QueueGuard.h"
#include "ReplicatingSubscription.h"
#include "qpid/broker/Queue.h"
#include "qpid/broker/QueuedMessage.h"
#include "qpid/broker/QueueObserver.h"
#include "qpid/log/Statement.h"
#include <boost/bind.hpp>
#include <sstream>
namespace qpid {
namespace ha {
using namespace broker;
using sys::Mutex;
using framing::SequenceNumber;
using framing::SequenceSet;
class QueueGuard::QueueObserver : public broker::QueueObserver
{
public:
QueueObserver(QueueGuard& g) : guard(g) {}
void enqueued(const broker::QueuedMessage& qm) { guard.enqueued(qm); }
void dequeued(const broker::QueuedMessage& qm) { guard.dequeued(qm); }
void acquired(const broker::QueuedMessage&) {}
void requeued(const broker::QueuedMessage&) {}
private:
QueueGuard& guard;
};
QueueGuard::QueueGuard(broker::Queue& q, const BrokerInfo& info)
: queue(q), subscription(0)
{
std::ostringstream os;
os << "Primary guard " << queue.getName() << "@" << info.getLogId() << ": ";
logPrefix = os.str();
observer.reset(new QueueObserver(*this));
queue.addObserver(observer);
// Set range after addObserver so we know that range.back+1 is a guarded position.
range = QueueRange(q);
}
QueueGuard::~QueueGuard() { cancel(); }
// NOTE: Called with message lock held.
void QueueGuard::enqueued(const QueuedMessage& qm) {
assert(qm.queue == &queue);
// Delay completion
QPID_LOG(trace, logPrefix << "Delayed completion of " << qm);
qm.payload->getIngressCompletion().startCompleter();
{
Mutex::ScopedLock l(lock);
assert(!delayed.contains(qm.position));
delayed += qm.position;
}
}
// NOTE: Called with message lock held.
void QueueGuard::dequeued(const QueuedMessage& qm) {
assert(qm.queue == &queue);
QPID_LOG(trace, logPrefix << "Dequeued " << qm);
ReplicatingSubscription* rs=0;
{
Mutex::ScopedLock l(lock);
rs = subscription;
}
if (rs) rs->dequeued(qm);
complete(qm);
}
void QueueGuard::cancel() {
queue.removeObserver(observer);
{
Mutex::ScopedLock l(lock);
if (delayed.empty()) return; // No need if no delayed messages.
}
// FIXME aconway 2012-06-15: optimize, only messages in delayed set.
queue.eachMessage(boost::bind(&QueueGuard::complete, this, _1));
}
void QueueGuard::attach(ReplicatingSubscription& rs) {
Mutex::ScopedLock l(lock);
subscription = &rs;
}
namespace {
void completeBefore(QueueGuard* guard, SequenceNumber position, const QueuedMessage& qm) {
if (qm.position <= position) guard->complete(qm);
}
}
bool QueueGuard::subscriptionStart(SequenceNumber position) {
// Complete any messages before or at the ReplicatingSubscription start position.
// Those messages are already on the backup.
if (!delayed.empty() && delayed.front() <= position) {
// FIXME aconway 2012-06-15: queue iteration, only messages in delayed
queue.eachMessage(boost::bind(&completeBefore, this, position, _1));
}
return position >= range.back;
}
void QueueGuard::complete(const QueuedMessage& qm) {
assert(qm.queue == &queue);
{
Mutex::ScopedLock l(lock);
// The same message can be completed twice, by
// ReplicatingSubscription::acknowledged and dequeued. Remove it
// from the set so we only call finishCompleter() once
if (delayed.contains(qm.position))
delayed -= qm.position;
else
return;
}
QPID_LOG(trace, logPrefix << "Completed " << qm);
qm.payload->getIngressCompletion().finishCompleter();
}
}} // namespaces qpid::ha
|
