blob: 60da0619f416f9d0aee7b276d50324efd82d6fba (
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
|
/*
*
* 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.
*
*/
#ifndef _QueueRegistry_
#define _QueueRegistry_
#include <map>
#include "qpid/sys/Mutex.h"
#include "Queue.h"
#include "qpid/management/Manageable.h"
namespace qpid {
namespace broker {
/**
* A registry of queues indexed by queue name.
*
* Queues are reference counted using shared_ptr to ensure that they
* are deleted when and only when they are no longer in use.
*
*/
class QueueRegistry{
public:
QueueRegistry();
~QueueRegistry();
/**
* Declare a queue.
*
* @return The queue and a boolean flag which is true if the queue
* was created by this declare call false if it already existed.
*/
std::pair<Queue::shared_ptr, bool> declare(const string& name, bool durable = false, bool autodelete = false,
const OwnershipToken* const owner = 0);
/**
* Destroy the named queue.
*
* Note: if the queue is in use it is not actually destroyed until
* all shared_ptrs to it are destroyed. During that time it is
* possible that a new queue with the same name may be
* created. This should not create any problems as the new and
* old queues exist independently. The registry has
* forgotten the old queue so there can be no confusion for
* subsequent calls to find or declare with the same name.
*
*/
void destroy (const string& name);
template <class Test> bool destroyIf(const string& name, Test test)
{
qpid::sys::RWlock::ScopedWlock locker(lock);
if (test()) {
destroyLH (name);
return true;
} else {
return false;
}
}
/**
* Find the named queue. Return 0 if not found.
*/
Queue::shared_ptr find(const string& name);
/**
* Generate unique queue name.
*/
string generateName();
/**
* Set the store to use. May only be called once.
*/
void setStore (MessageStore*);
/**
* Return the message store used.
*/
MessageStore* getStore() const;
/**
* Register the manageable parent for declared queues
*/
void setParent (management::Manageable* _parent) { parent = _parent; }
private:
typedef std::map<string, Queue::shared_ptr> QueueMap;
QueueMap queues;
qpid::sys::RWlock lock;
int counter;
MessageStore* store;
management::Manageable* parent;
//destroy impl that assumes lock is already held:
void destroyLH (const string& name);
};
}
}
#endif
|
