blob: 7ed54c0ff0ade935ea7df60ca876944748526ae4 (
plain)
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
|
#ifndef _broker_PersistableMessage_h
#define _broker_PersistableMessage_h
/*
*
* 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 <string>
#include <list>
#include <boost/shared_ptr.hpp>
#include <boost/weak_ptr.hpp>
#include "Persistable.h"
#include "qpid/framing/amqp_types.h"
#include "qpid/sys/Monitor.h"
#include "PersistableQueue.h"
namespace qpid {
namespace broker {
class MessageStore;
/**
* Base class for persistable messages.
*/
class PersistableMessage : public Persistable
{
sys::Monitor asyncEnqueueLock;
sys::Monitor asyncDequeueLock;
sys::Mutex storeLock;
/**
* Tracks the number of outstanding asynchronous enqueue
* operations. When the message is enqueued asynchronously the
* count is incremented; when that enqueue completes it is
* decremented. Thus when it is 0, there are no outstanding
* enqueues.
*/
int asyncEnqueueCounter;
/**
* Tracks the number of outstanding asynchronous dequeue
* operations. When the message is dequeued asynchronously the
* count is incremented; when that dequeue completes it is
* decremented. Thus when it is 0, there are no outstanding
* dequeues.
*/
int asyncDequeueCounter;
protected:
typedef std::list< boost::weak_ptr<PersistableQueue> > syncList;
syncList synclist;
MessageStore* store;
bool contentReleased;
inline void setContentReleased() {contentReleased = true; }
public:
typedef boost::shared_ptr<PersistableMessage> shared_ptr;
/**
* @returns the size of the headers when encoded
*/
virtual uint32_t encodedHeaderSize() const = 0;
virtual ~PersistableMessage() {};
PersistableMessage():
asyncEnqueueCounter(0),
asyncDequeueCounter(0),
store(0),
contentReleased(false)
{}
void flush();
inline bool isContentReleased()const {return contentReleased; }
inline void waitForEnqueueComplete() {
sys::ScopedLock<sys::Monitor> l(asyncEnqueueLock);
while (asyncEnqueueCounter > 0) {
asyncEnqueueLock.wait();
}
}
inline bool isEnqueueComplete() {
sys::ScopedLock<sys::Monitor> l(asyncEnqueueLock);
return asyncEnqueueCounter == 0;
}
inline void enqueueComplete() {
bool notify = false;
{
sys::ScopedLock<sys::Monitor> l(asyncEnqueueLock);
if (asyncEnqueueCounter > 0) {
if (--asyncEnqueueCounter == 0) {
asyncEnqueueLock.notify();
notify = true;
}
}
}
if (notify) {
sys::ScopedLock<sys::Mutex> l(storeLock);
if (store) {
for (syncList::iterator i = synclist.begin(); i != synclist.end(); ++i) {
PersistableQueue::shared_ptr q(i->lock());
if (q) q->notifyDurableIOComplete();
}
}
}
}
inline void enqueueAsync(PersistableQueue::shared_ptr queue, MessageStore* _store) {
if (_store){
sys::ScopedLock<sys::Mutex> l(storeLock);
store = _store;
boost::weak_ptr<PersistableQueue> q(queue);
synclist.push_back(q);
}
enqueueAsync();
}
inline void enqueueAsync() {
sys::ScopedLock<sys::Monitor> l(asyncEnqueueLock);
asyncEnqueueCounter++;
}
inline bool isDequeueComplete() {
sys::ScopedLock<sys::Monitor> l(asyncDequeueLock);
return asyncDequeueCounter == 0;
}
inline void dequeueComplete() {
sys::ScopedLock<sys::Monitor> l(asyncDequeueLock);
if (asyncDequeueCounter > 0) {
if (--asyncDequeueCounter == 0) {
asyncDequeueLock.notify();
}
}
}
inline void waitForDequeueComplete() {
sys::ScopedLock<sys::Monitor> l(asyncDequeueLock);
while (asyncDequeueCounter > 0) {
asyncDequeueLock.wait();
}
}
inline void dequeueAsync(PersistableQueue::shared_ptr queue, MessageStore* _store) {
if (_store){
sys::ScopedLock<sys::Mutex> l(storeLock);
store = _store;
boost::weak_ptr<PersistableQueue> q(queue);
synclist.push_back(q);
}
dequeueAsync();
}
inline void dequeueAsync() {
sys::ScopedLock<sys::Monitor> l(asyncDequeueLock);
asyncDequeueCounter++;
}
};
}}
#endif
|
