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
|
/*
*
* Copyright (c) 2006 The Apache Software Foundation
*
* Licensed 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/HeadersExchange.h"
#include "./qpid/broker/ExchangeBinding.h"
#include "./qpid/framing/Value.h"
#include "./qpid/QpidError.h"
#include <algorithm>
using namespace qpid::broker;
using namespace qpid::framing;
using namespace qpid::concurrent;
// 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) { }
void HeadersExchange::bind(Queue::shared_ptr queue, const string& routingKey, FieldTable* args){
std::cout << "HeadersExchange::bind" << std::endl;
Locker 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.");
}
bindings.push_back(Binding(*args, queue));
queue->bound(new ExchangeBinding(this, queue, routingKey, args));
}
void HeadersExchange::unbind(Queue::shared_ptr queue, const string& /*routingKey*/, FieldTable* args){
Locker locker(lock);
Bindings::iterator i =
std::find(bindings.begin(),bindings.end(), Binding(*args, queue));
if (i != bindings.end()) bindings.erase(i);
}
void HeadersExchange::route(Message::shared_ptr& msg, const string& /*routingKey*/, FieldTable* args){
std::cout << "route: " << *args << std::endl;
Locker locker(lock);;
for (Bindings::iterator i = bindings.begin(); i != bindings.end(); ++i) {
if (match(i->first, *args)) i->second->deliver(msg);
}
}
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;
}
}
|
