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
|
#ifndef QPID_BROKER_FAIRSHARE_H
#define QPID_BROKER_FAIRSHARE_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/PriorityQueue.h"
namespace qpid {
namespace framing {
class FieldTable;
}
namespace broker {
/**
* Modifies a basic prioirty queue by limiting the number of messages
* from each priority level that are dispatched before allowing
* dispatch from the next level.
*/
class Fairshare : public PriorityQueue
{
public:
Fairshare(size_t levels, uint limit);
bool getState(uint& priority, uint& count) const;
bool setState(uint priority, uint count);
void setLimit(size_t level, uint limit);
bool isNull();
static std::auto_ptr<Messages> create(const qpid::framing::FieldTable& settings);
static bool getState(const Messages&, uint& priority, uint& count);
static bool setState(Messages&, uint priority, uint count);
private:
std::vector<uint> limits;
uint priority;
uint count;
uint currentLevel();
uint nextLevel();
bool limitReached();
bool findFrontLevel(uint& p, PriorityLevels&);
};
}} // namespace qpid::broker
#endif /*!QPID_BROKER_FAIRSHARE_H*/
|
