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
|
/*
*
* Copyright (c) 2006 The Apache Software Foundation
*
* Licensed 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 "Queue.h"
#include "MonitorImpl.h"
#include <iostream>
using namespace qpid::broker;
using namespace qpid::concurrent;
Queue::Queue(const string& _name, bool _durable, u_int32_t _autodelete, const ConnectionToken* const _owner) :
name(_name),
autodelete(_autodelete),
durable(_durable),
owner(_owner),
queueing(false),
dispatching(false),
next(0),
lastUsed(0),
exclusive(0)
{
if(autodelete) lastUsed = apr_time_as_msec(apr_time_now());
}
Queue::~Queue(){
for(Binding* b = bindings.front(); !bindings.empty(); b = bindings.front()){
b->cancel();
bindings.pop();
}
}
void Queue::bound(Binding* b){
bindings.push(b);
}
void Queue::deliver(Message::shared_ptr& msg){
Locker locker(lock);
if(queueing || !dispatch(msg)){
queueing = true;
messages.push(msg);
}
}
bool Queue::dispatch(Message::shared_ptr& msg){
if(consumers.empty()){
return false;
}else if(exclusive){
if(!exclusive->deliver(msg)){
std::cout << "WARNING: Dropping undeliverable message from queue with exclusive consumer." << std::endl;
}
return true;
}else{
//deliver to next consumer
next = next % consumers.size();
Consumer* c = consumers[next];
int start = next;
while(c){
next++;
if(c->deliver(msg)) return true;
next = next % consumers.size();
c = next == start ? 0 : consumers[next];
}
return false;
}
}
bool Queue::startDispatching(){
Locker locker(lock);
if(queueing && !dispatching){
dispatching = true;
return true;
}else{
return false;
}
}
void Queue::dispatch(){
bool proceed = startDispatching();
while(proceed){
Locker locker(lock);
if(!messages.empty() && dispatch(messages.front())){
messages.pop();
}else{
dispatching = false;
proceed = false;
queueing = !messages.empty();
}
}
}
void Queue::consume(Consumer* c, bool requestExclusive){
Locker locker(lock);
if(exclusive) throw ExclusiveAccessException();
if(requestExclusive){
if(!consumers.empty()) throw ExclusiveAccessException();
exclusive = c;
}
if(autodelete && consumers.empty()) lastUsed = 0;
consumers.push_back(c);
}
void Queue::cancel(Consumer* c){
Locker locker(lock);
consumers.erase(find(consumers.begin(), consumers.end(), c));
if(autodelete && consumers.empty()) lastUsed = apr_time_as_msec(apr_time_now());
if(exclusive == c) exclusive = 0;
}
Message::shared_ptr Queue::dequeue(){
Locker locker(lock);
Message::shared_ptr msg;
if(!messages.empty()){
msg = messages.front();
messages.pop();
}
return msg;
}
u_int32_t Queue::purge(){
Locker locker(lock);
int count = messages.size();
while(!messages.empty()) messages.pop();
return count;
}
u_int32_t Queue::getMessageCount() const{
Locker locker(lock);
return messages.size();
}
u_int32_t Queue::getConsumerCount() const{
Locker locker(lock);
return consumers.size();
}
bool Queue::canAutoDelete() const{
Locker locker(lock);
return lastUsed && ((apr_time_as_msec(apr_time_now()) - lastUsed) > autodelete);
}
|
