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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
|
/*
*
* 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 "unit_test.h"
#include "qpid/Exception.h"
#include "qpid/broker/Queue.h"
#include "qpid/broker/Deliverable.h"
#include "qpid/broker/ExchangeRegistry.h"
#include "qpid/broker/QueueRegistry.h"
#include "qpid/broker/NullMessageStore.h"
#include "qpid/framing/MessageTransferBody.h"
#include "qpid/client/QueueOptions.h"
#include <iostream>
#include "boost/format.hpp"
using boost::intrusive_ptr;
using namespace qpid;
using namespace qpid::broker;
using namespace qpid::framing;
using namespace qpid::sys;
class TestConsumer : public virtual Consumer{
public:
typedef boost::shared_ptr<TestConsumer> shared_ptr;
intrusive_ptr<Message> last;
bool received;
TestConsumer(): received(false) {};
virtual bool deliver(QueuedMessage& msg){
last = msg.payload;
received = true;
return true;
};
void notify() {}
OwnershipToken* getSession() { return 0; }
};
class FailOnDeliver : public Deliverable
{
Message msg;
public:
void deliverTo(const boost::shared_ptr<Queue>& queue)
{
throw Exception(QPID_MSG("Invalid delivery to " << queue->getName()));
}
Message& getMessage() { return msg; }
};
intrusive_ptr<Message> message(std::string exchange, std::string routingKey) {
intrusive_ptr<Message> msg(new Message());
AMQFrame method(in_place<MessageTransferBody>(ProtocolVersion(), exchange, 0, 0));
AMQFrame header(in_place<AMQHeaderBody>());
msg->getFrames().append(method);
msg->getFrames().append(header);
msg->getFrames().getHeaders()->get<DeliveryProperties>(true)->setRoutingKey(routingKey);
return msg;
}
QPID_AUTO_TEST_SUITE(QueueTestSuite)
QPID_AUTO_TEST_CASE(testAsyncMessage) {
Queue::shared_ptr queue(new Queue("my_test_queue", true));
intrusive_ptr<Message> received;
TestConsumer::shared_ptr c1(new TestConsumer());
queue->consume(c1);
//Test basic delivery:
intrusive_ptr<Message> msg1 = message("e", "A");
msg1->enqueueAsync();//this is done on enqueue which is not called from process
queue->process(msg1);
sleep(2);
BOOST_CHECK(!c1->received);
msg1->enqueueComplete();
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg1.get(), received.get());
}
QPID_AUTO_TEST_CASE(testAsyncMessageCount){
Queue::shared_ptr queue(new Queue("my_test_queue", true));
intrusive_ptr<Message> msg1 = message("e", "A");
msg1->enqueueAsync();//this is done on enqueue which is not called from process
queue->process(msg1);
sleep(2);
uint32_t compval=0;
BOOST_CHECK_EQUAL(compval, queue->getMessageCount());
msg1->enqueueComplete();
compval=1;
BOOST_CHECK_EQUAL(compval, queue->getMessageCount());
}
QPID_AUTO_TEST_CASE(testConsumers){
Queue::shared_ptr queue(new Queue("my_queue", true));
//Test adding consumers:
TestConsumer::shared_ptr c1(new TestConsumer());
TestConsumer::shared_ptr c2(new TestConsumer());
queue->consume(c1);
queue->consume(c2);
BOOST_CHECK_EQUAL(uint32_t(2), queue->getConsumerCount());
//Test basic delivery:
intrusive_ptr<Message> msg1 = message("e", "A");
intrusive_ptr<Message> msg2 = message("e", "B");
intrusive_ptr<Message> msg3 = message("e", "C");
queue->deliver(msg1);
BOOST_CHECK(queue->dispatch(c1));
BOOST_CHECK_EQUAL(msg1.get(), c1->last.get());
queue->deliver(msg2);
BOOST_CHECK(queue->dispatch(c2));
BOOST_CHECK_EQUAL(msg2.get(), c2->last.get());
c1->received = false;
queue->deliver(msg3);
BOOST_CHECK(queue->dispatch(c1));
BOOST_CHECK_EQUAL(msg3.get(), c1->last.get());
//Test cancellation:
queue->cancel(c1);
BOOST_CHECK_EQUAL(uint32_t(1), queue->getConsumerCount());
queue->cancel(c2);
BOOST_CHECK_EQUAL(uint32_t(0), queue->getConsumerCount());
}
QPID_AUTO_TEST_CASE(testRegistry){
//Test use of queues in registry:
QueueRegistry registry;
registry.declare("queue1", true, true);
registry.declare("queue2", true, true);
registry.declare("queue3", true, true);
BOOST_CHECK(registry.find("queue1"));
BOOST_CHECK(registry.find("queue2"));
BOOST_CHECK(registry.find("queue3"));
registry.destroy("queue1");
registry.destroy("queue2");
registry.destroy("queue3");
BOOST_CHECK(!registry.find("queue1"));
BOOST_CHECK(!registry.find("queue2"));
BOOST_CHECK(!registry.find("queue3"));
}
QPID_AUTO_TEST_CASE(testDequeue){
Queue::shared_ptr queue(new Queue("my_queue", true));
intrusive_ptr<Message> msg1 = message("e", "A");
intrusive_ptr<Message> msg2 = message("e", "B");
intrusive_ptr<Message> msg3 = message("e", "C");
intrusive_ptr<Message> received;
queue->deliver(msg1);
queue->deliver(msg2);
queue->deliver(msg3);
BOOST_CHECK_EQUAL(uint32_t(3), queue->getMessageCount());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg1.get(), received.get());
BOOST_CHECK_EQUAL(uint32_t(2), queue->getMessageCount());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg2.get(), received.get());
BOOST_CHECK_EQUAL(uint32_t(1), queue->getMessageCount());
TestConsumer::shared_ptr consumer(new TestConsumer());
queue->consume(consumer);
queue->dispatch(consumer);
if (!consumer->received)
sleep(2);
BOOST_CHECK_EQUAL(msg3.get(), consumer->last.get());
BOOST_CHECK_EQUAL(uint32_t(0), queue->getMessageCount());
received = queue->get().payload;
BOOST_CHECK(!received);
BOOST_CHECK_EQUAL(uint32_t(0), queue->getMessageCount());
}
QPID_AUTO_TEST_CASE(testBound)
{
//test the recording of bindings, and use of those to allow a queue to be unbound
string key("my-key");
FieldTable args;
Queue::shared_ptr queue(new Queue("my-queue", true));
ExchangeRegistry exchanges;
//establish bindings from exchange->queue and notify the queue as it is bound:
Exchange::shared_ptr exchange1 = exchanges.declare("my-exchange-1", "direct").first;
exchange1->bind(queue, key, &args);
queue->bound(exchange1->getName(), key, args);
Exchange::shared_ptr exchange2 = exchanges.declare("my-exchange-2", "fanout").first;
exchange2->bind(queue, key, &args);
queue->bound(exchange2->getName(), key, args);
Exchange::shared_ptr exchange3 = exchanges.declare("my-exchange-3", "topic").first;
exchange3->bind(queue, key, &args);
queue->bound(exchange3->getName(), key, args);
//delete one of the exchanges:
exchanges.destroy(exchange2->getName());
exchange2.reset();
//unbind the queue from all exchanges it knows it has been bound to:
queue->unbind(exchanges, queue);
//ensure the remaining exchanges don't still have the queue bound to them:
FailOnDeliver deliverable;
exchange1->route(deliverable, key, &args);
exchange3->route(deliverable, key, &args);
}
QPID_AUTO_TEST_CASE(testPersistLastNodeStanding){
client::QueueOptions args;
args.setPersistLastNode();
Queue::shared_ptr queue(new Queue("my-queue", true));
queue->configure(args);
intrusive_ptr<Message> msg1 = message("e", "A");
intrusive_ptr<Message> msg2 = message("e", "B");
intrusive_ptr<Message> msg3 = message("e", "C");
//enqueue 2 messages
queue->deliver(msg1);
queue->deliver(msg2);
//change mode
queue->setLastNodeFailure();
//enqueue 1 message
queue->deliver(msg3);
//check all have persistent ids.
BOOST_CHECK(msg1->isPersistent());
BOOST_CHECK(msg2->isPersistent());
BOOST_CHECK(msg3->isPersistent());
}
class TestMessageStoreOC : public NullMessageStore
{
public:
virtual void dequeue(TransactionContext*,
const boost::intrusive_ptr<PersistableMessage>& /*msg*/,
const PersistableQueue& /*queue*/)
{
}
virtual void enqueue(TransactionContext*,
const boost::intrusive_ptr<PersistableMessage>& /*msg*/,
const PersistableQueue& /* queue */)
{
}
TestMessageStoreOC() : NullMessageStore(false) {}
~TestMessageStoreOC(){}
};
QPID_AUTO_TEST_CASE(testOptimisticConsume){
client::QueueOptions args;
args.setPersistLastNode();
// set queue mode
TestMessageStoreOC store;
Queue::shared_ptr queue(new Queue("my-queue", true, &store));
queue->setLastNodeFailure();
intrusive_ptr<Message> msg1 = message("e", "A");
msg1->forcePersistent();
//change mode
args.setOptimisticConsume();
queue->configure(args);
//enqueue 1 message
queue->deliver(msg1);
TestConsumer::shared_ptr consumer(new TestConsumer());
queue->consume(consumer);
queue->dispatch(consumer);
if (!consumer->received)
sleep(2);
BOOST_CHECK_EQUAL(msg1.get(), consumer->last.get());
BOOST_CHECK_EQUAL(uint32_t(0), queue->getMessageCount());
}
QPID_AUTO_TEST_CASE(testLVQOrdering){
client::QueueOptions args;
// set queue mode
args.setOrdering(client::LVQ);
Queue::shared_ptr queue(new Queue("my-queue", true ));
queue->configure(args);
intrusive_ptr<Message> msg1 = message("e", "A");
intrusive_ptr<Message> msg2 = message("e", "B");
intrusive_ptr<Message> msg3 = message("e", "C");
intrusive_ptr<Message> msg4 = message("e", "D");
intrusive_ptr<Message> received;
//set deliever match for LVQ a,b,c,a
string key;
args.getLVQKey(key);
BOOST_CHECK_EQUAL(key, "qpid.LVQ_key");
msg1->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"a");
msg2->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"b");
msg3->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"c");
msg4->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"a");
//enqueue 4 message
queue->deliver(msg1);
queue->deliver(msg2);
queue->deliver(msg3);
queue->deliver(msg4);
BOOST_CHECK_EQUAL(queue->getMessageCount(), 3u);
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg4.get(), received.get());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg2.get(), received.get());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg3.get(), received.get());
intrusive_ptr<Message> msg5 = message("e", "A");
intrusive_ptr<Message> msg6 = message("e", "B");
intrusive_ptr<Message> msg7 = message("e", "C");
msg5->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"a");
msg6->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"b");
msg7->getProperties<MessageProperties>()->getApplicationHeaders().setString(key,"c");
queue->deliver(msg5);
queue->deliver(msg6);
queue->deliver(msg7);
BOOST_CHECK_EQUAL(queue->getMessageCount(), 3u);
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg5.get(), received.get());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg6.get(), received.get());
received = queue->get().payload;
BOOST_CHECK_EQUAL(msg7.get(), received.get());
}
QPID_AUTO_TEST_CASE(testLVQSaftyCheck){
// This test is to check std::deque memory copy does not change out under us
// if this test fails, then lvq would no longer be safe.
std::deque<string> deq;
string a;
string b;
deq.push_back(a);
deq.push_back(b);
string* tmp = &deq.back();
for (int a =0; a<=100000; a++){
string z;
deq.push_back(z);
}
deq.pop_front();
BOOST_CHECK_EQUAL(&deq.front(),tmp);
}
QPID_AUTO_TEST_SUITE_END()
|