blob: 301367358bdad3d4ce35f64af4884ea02d12fa2e (
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
|
#ifndef QPID_BROKER_PRIORITYQUEUE_H
#define QPID_BROKER_PRIORITYQUEUE_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 "qpid/broker/MessageDeque.h"
#include "qpid/sys/IntegerTypes.h"
#include <deque>
#include <vector>
namespace qpid {
namespace broker {
/**
* Basic priority queue with a configurable number of recognised
* priority levels. This is implemented as a separate deque per
* priority level.
*
* Browsing is FIFO not priority order. There is a MessageDeque
* for fast browsing.
*/
class PriorityQueue : public Messages
{
public:
PriorityQueue(int levels);
virtual ~PriorityQueue() {}
size_t size();
bool deleted(const QueuedMessage&);
void release(const QueuedMessage&);
bool acquire(const framing::SequenceNumber&, QueuedMessage&);
bool find(const framing::SequenceNumber&, QueuedMessage&);
bool browse(const framing::SequenceNumber&, QueuedMessage&, bool);
bool consume(QueuedMessage&);
bool push(const QueuedMessage& added, QueuedMessage& removed);
void updateAcquired(const QueuedMessage& acquired);
void setPosition(const framing::SequenceNumber&);
void foreach(Functor);
void removeIf(Predicate);
static uint getPriority(const QueuedMessage&);
protected:
typedef std::deque<QueuedMessage*> Deque;
typedef std::vector<Deque> PriorityLevels;
virtual bool findFrontLevel(uint& p, PriorityLevels&);
const int levels;
private:
/** Available messages separated by priority and sorted in priority order.
* Holds pointers to the QueuedMessages in fifo
*/
PriorityLevels messages;
/** FIFO index of all messsagse (including acquired messages) for fast browsing and indexing */
MessageDeque fifo;
uint frontLevel;
bool haveFront;
bool cached;
void erase(const QueuedMessage&);
uint getPriorityLevel(const QueuedMessage&) const;
void clearCache();
bool checkFront();
};
}} // namespace qpid::broker
#endif /*!QPID_BROKER_PRIORITYQUEUE_H*/
|
