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
|
/*
*
* 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 "HeadersExchange.h"
#include "qpid/framing/Value.h"
#include "qpid/QpidError.h"
#include <algorithm>
using namespace qpid::broker;
using namespace qpid::framing;
using namespace qpid::sys;
// TODO aconway 2006-09-20: More efficient matching algorithm.
// The current search algorithm really sucks.
// Fieldtables are heavy, maybe use shared_ptr to do handle-body.
using namespace qpid::broker;
namespace {
const std::string all("all");
const std::string any("any");
const std::string x_match("x-match");
}
HeadersExchange::HeadersExchange(const string& _name) : Exchange(_name) { }
HeadersExchange::HeadersExchange(const std::string& _name, bool _durable, const FieldTable& _args) : Exchange(_name, _durable, _args) {}
bool HeadersExchange::bind(Queue::shared_ptr queue, const string& /*routingKey*/, const FieldTable* args){
RWlock::ScopedWlock locker(lock);
std::string what = args->getString("x-match");
if (what != all && what != any) {
THROW_QPID_ERROR(PROTOCOL_ERROR, "Invalid x-match value binding to headers exchange.");
}
Binding binding(*args, queue);
Bindings::iterator i =
std::find(bindings.begin(),bindings.end(), binding);
if (i == bindings.end()) {
bindings.push_back(binding);
return true;
} else {
return false;
}
}
bool HeadersExchange::unbind(Queue::shared_ptr queue, const string& /*routingKey*/, const FieldTable* args){
RWlock::ScopedWlock locker(lock);
Bindings::iterator i =
std::find(bindings.begin(),bindings.end(), Binding(*args, queue));
if (i != bindings.end()) {
bindings.erase(i);
return true;
} else {
return false;
}
}
void HeadersExchange::route(Deliverable& msg, const string& /*routingKey*/, const FieldTable* args){
RWlock::ScopedRlock locker(lock);;
for (Bindings::iterator i = bindings.begin(); i != bindings.end(); ++i) {
if (match(i->first, *args)) msg.deliverTo(i->second);
}
}
bool HeadersExchange::isBound(Queue::shared_ptr queue, const string* const, const FieldTable* const args)
{
for (Bindings::iterator i = bindings.begin(); i != bindings.end(); ++i) {
if ( (!args || equal(i->first, *args)) && (!queue || i->second == queue)) {
return true;
}
}
return false;
}
HeadersExchange::~HeadersExchange() {}
const std::string HeadersExchange::typeName("headers");
namespace
{
bool match_values(const Value& bind, const Value& msg) {
return dynamic_cast<const EmptyValue*>(&bind) || bind == msg;
}
}
bool HeadersExchange::match(const FieldTable& bind, const FieldTable& msg) {
typedef FieldTable::ValueMap Map;
std::string what = bind.getString(x_match);
if (what == all) {
for (Map::const_iterator i = bind.getMap().begin();
i != bind.getMap().end();
++i)
{
if (i->first != x_match)
{
Map::const_iterator j = msg.getMap().find(i->first);
if (j == msg.getMap().end()) return false;
if (!match_values(*(i->second), *(j->second))) return false;
}
}
return true;
} else if (what == any) {
for (Map::const_iterator i = bind.getMap().begin();
i != bind.getMap().end();
++i)
{
if (i->first != x_match)
{
Map::const_iterator j = msg.getMap().find(i->first);
if (j != msg.getMap().end()) {
if (match_values(*(i->second), *(j->second))) return true;
}
}
}
return false;
} else {
return false;
}
}
bool HeadersExchange::equal(const FieldTable& a, const FieldTable& b) {
typedef FieldTable::ValueMap Map;
for (Map::const_iterator i = a.getMap().begin();
i != a.getMap().end();
++i)
{
Map::const_iterator j = b.getMap().find(i->first);
if (j == b.getMap().end()) return false;
if (!match_values(*(i->second), *(j->second))) return false;
}
return true;
}
|
