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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
/*
Copyright (c) 2007-2010 iMatix Corporation
This file is part of 0MQ.
0MQ is free software; you can redistribute it and/or modify it under
the terms of the Lesser GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
0MQ is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Lesser GNU General Public License for more details.
You should have received a copy of the Lesser GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include <new>
#include <algorithm>
#include "err.hpp"
#include "prefix_tree.hpp"
zmq::prefix_tree_t::prefix_tree_t () :
refcnt (0),
min (0),
count (0)
{
}
zmq::prefix_tree_t::~prefix_tree_t ()
{
if (count == 1)
delete next.node;
else if (count > 1) {
for (unsigned char i = 0; i != count; ++i)
if (next.table [i])
delete next.table [i];
free (next.table);
}
}
void zmq::prefix_tree_t::add (unsigned char *prefix_, size_t size_)
{
// We are at the node corresponding to the prefix. We are done.
if (!size_) {
++refcnt;
return;
}
unsigned char c = *prefix_;
if (c < min || c >= min + count) {
// The character is out of range of currently handled
// charcters. We have to extend the table.
if (!count) {
min = c;
count = 1;
next.node = NULL;
}
else if (count == 1) {
unsigned char oldc = min;
prefix_tree_t *oldp = next.node;
count = (min < c ? c - min : min - c) + 1;
next.table = (prefix_tree_t**)
malloc (sizeof (prefix_tree_t*) * count);
zmq_assert (next.table);
for (unsigned char i = 0; i != count; ++i)
next.table [i] = 0;
min = std::min (min, c);
next.table [oldc - min] = oldp;
}
else if (min < c) {
// The new character is above the current character range.
unsigned char old_count = count;
count = c - min + 1;
next.table = (prefix_tree_t**) realloc ((void*) next.table,
sizeof (prefix_tree_t*) * count);
zmq_assert (next.table);
for (unsigned char i = old_count; i != count; i++)
next.table [i] = NULL;
}
else {
// The new character is below the current character range.
unsigned char old_count = count;
count = (min + old_count) - c;
next.table = (prefix_tree_t**) realloc ((void*) next.table,
sizeof (prefix_tree_t*) * count);
zmq_assert (next.table);
memmove (next.table + min - c, next.table,
old_count * sizeof (prefix_tree_t*));
for (unsigned char i = 0; i != min - c; i++)
next.table [i] = NULL;
min = c;
}
}
// If next node does not exist, create one.
if (count == 1) {
if (!next.node) {
next.node = new (std::nothrow) prefix_tree_t;
zmq_assert (next.node);
}
next.node->add (prefix_ + 1, size_ - 1);
}
else {
if (!next.table [c - min]) {
next.table [c - min] = new (std::nothrow) prefix_tree_t;
zmq_assert (next.table [c - min]);
}
next.table [c - min]->add (prefix_ + 1, size_ - 1);
}
}
bool zmq::prefix_tree_t::rm (unsigned char *prefix_, size_t size_)
{
if (!size_) {
if (!refcnt)
return false;
refcnt--;
return true;
}
unsigned char c = *prefix_;
if (!count || c < min || c >= min + count)
return false;
prefix_tree_t *next_node =
count == 1 ? next.node : next.table [c - min];
if (!next_node)
return false;
return next_node->rm (prefix_ + 1, size_ - 1);
}
bool zmq::prefix_tree_t::check (unsigned char *data_, size_t size_)
{
// This function is on critical path. It deliberately doesn't use
// recursion to get a bit better performance.
prefix_tree_t *current = this;
while (true) {
// We've found a corresponding subscription!
if (current->refcnt)
return true;
// We've checked all the data and haven't found matching subscription.
if (!size_)
return false;
// If there's no corresponding slot for the first character
// of the prefix, the message does not match.
unsigned char c = *data_;
if (c < current->min || c >= current->min + current->count)
return false;
// Move to the next character.
if (current->count == 1)
current = current->next.node;
else {
current = current->next.table [c - current->min];
if (!current)
return false;
}
data_++;
size_--;
}
}