2 * util/storage/dnstree.c - support for rbtree types suitable for DNS code.
4 * Copyright (c) 2008, NLnet Labs. All rights reserved.
6 * This software is open source.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * Redistributions of source code must retain the above copyright notice,
13 * this list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 * this list of conditions and the following disclaimer in the documentation
17 * and/or other materials provided with the distribution.
19 * Neither the name of the NLNET LABS nor the names of its contributors may
20 * be used to endorse or promote products derived from this software without
21 * specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 * This file contains structures combining types and functions to
40 * manipulate those structures that help building DNS lookup trees.
43 #include "util/storage/dnstree.h"
44 #include "util/data/dname.h"
45 #include "util/net_help.h"
47 int name_tree_compare(const void* k1, const void* k2)
49 struct name_tree_node* x = (struct name_tree_node*)k1;
50 struct name_tree_node* y = (struct name_tree_node*)k2;
52 if(x->dclass != y->dclass) {
53 if(x->dclass < y->dclass)
57 return dname_lab_cmp(x->name, x->labs, y->name, y->labs, &m);
60 int addr_tree_compare(const void* k1, const void* k2)
62 struct addr_tree_node* n1 = (struct addr_tree_node*)k1;
63 struct addr_tree_node* n2 = (struct addr_tree_node*)k2;
64 int r = sockaddr_cmp_addr(&n1->addr, n1->addrlen, &n2->addr,
74 void name_tree_init(rbtree_t* tree)
76 rbtree_init(tree, &name_tree_compare);
79 void addr_tree_init(rbtree_t* tree)
81 rbtree_init(tree, &addr_tree_compare);
84 int name_tree_insert(rbtree_t* tree, struct name_tree_node* node,
85 uint8_t* name, size_t len, int labs, uint16_t dclass)
87 node->node.key = node;
91 node->dclass = dclass;
93 return rbtree_insert(tree, &node->node) != NULL;
96 int addr_tree_insert(rbtree_t* tree, struct addr_tree_node* node,
97 struct sockaddr_storage* addr, socklen_t addrlen, int net)
99 node->node.key = node;
100 memcpy(&node->addr, addr, addrlen);
101 node->addrlen = addrlen;
104 return rbtree_insert(tree, &node->node) != NULL;
107 void addr_tree_init_parents(rbtree_t* tree)
109 struct addr_tree_node* node, *prev = NULL, *p;
111 RBTREE_FOR(node, struct addr_tree_node*, tree) {
113 if(!prev || prev->addrlen != node->addrlen) {
117 m = addr_in_common(&prev->addr, prev->net, &node->addr,
118 node->net, node->addrlen);
119 /* sort order like: ::/0, 1::/2, 1::/4, ... 2::/2 */
120 /* find the previous, or parent-parent-parent */
121 for(p = prev; p; p = p->parent)
123 /* ==: since prev matched m, this is closest*/
124 /* <: prev matches more, but is not a parent,
125 * this one is a (grand)parent */
133 void name_tree_init_parents(rbtree_t* tree)
135 struct name_tree_node* node, *prev = NULL, *p;
137 RBTREE_FOR(node, struct name_tree_node*, tree) {
139 if(!prev || prev->dclass != node->dclass) {
143 (void)dname_lab_cmp(prev->name, prev->labs, node->name,
144 node->labs, &m); /* we know prev is smaller */
145 /* sort order like: . com. bla.com. zwb.com. net. */
146 /* find the previous, or parent-parent-parent */
147 for(p = prev; p; p = p->parent)
149 /* ==: since prev matched m, this is closest*/
150 /* <: prev matches more, but is not a parent,
151 * this one is a (grand)parent */
159 struct name_tree_node* name_tree_find(rbtree_t* tree, uint8_t* name,
160 size_t len, int labs, uint16_t dclass)
162 struct name_tree_node key;
168 return (struct name_tree_node*)rbtree_search(tree, &key);
171 struct name_tree_node* name_tree_lookup(rbtree_t* tree, uint8_t* name,
172 size_t len, int labs, uint16_t dclass)
174 rbnode_t* res = NULL;
175 struct name_tree_node *result;
176 struct name_tree_node key;
182 if(rbtree_find_less_equal(tree, &key, &res)) {
184 result = (struct name_tree_node*)res;
186 /* smaller element (or no element) */
188 result = (struct name_tree_node*)res;
189 if(!result || result->dclass != dclass)
191 /* count number of labels matched */
192 (void)dname_lab_cmp(result->name, result->labs, key.name,
194 while(result) { /* go up until qname is subdomain of stub */
195 if(result->labs <= m)
197 result = result->parent;
203 struct addr_tree_node* addr_tree_lookup(rbtree_t* tree,
204 struct sockaddr_storage* addr, socklen_t addrlen)
206 rbnode_t* res = NULL;
207 struct addr_tree_node* result;
208 struct addr_tree_node key;
210 memcpy(&key.addr, addr, addrlen);
211 key.addrlen = addrlen;
212 key.net = (addr_is_ip6(addr, addrlen)?128:32);
213 if(rbtree_find_less_equal(tree, &key, &res)) {
215 return (struct addr_tree_node*)res;
217 /* smaller element (or no element) */
219 result = (struct addr_tree_node*)res;
220 if(!result || result->addrlen != addrlen)
222 /* count number of bits matched */
223 m = addr_in_common(&result->addr, result->net, addr,
225 while(result) { /* go up until addr is inside netblock */
228 result = result->parent;
235 name_tree_next_root(rbtree_t* tree, uint16_t* dclass)
237 struct name_tree_node key;
239 struct name_tree_node* p;
241 /* first root item is first item in tree */
242 n = rbtree_first(tree);
245 p = (struct name_tree_node*)n;
246 if(dname_is_root(p->name)) {
250 /* root not first item? search for higher items */
251 *dclass = p->dclass + 1;
252 return name_tree_next_root(tree, dclass);
254 /* find class n in tree, we may get a direct hit, or if we don't
255 * this is the last item of the previous class so rbtree_next() takes
256 * us to the next root (if any) */
258 key.name = (uint8_t*)"\000";
261 key.dclass = *dclass;
263 if(rbtree_find_less_equal(tree, &key, &n)) {
267 /* smaller element */
268 if(!n || n == RBTREE_NULL)
269 return 0; /* nothing found */
272 return 0; /* no higher */
273 p = (struct name_tree_node*)n;
274 if(dname_is_root(p->name)) {
278 /* not a root node, return next higher item */
279 *dclass = p->dclass+1;
280 return name_tree_next_root(tree, dclass);