Fix a range check bug in lseek()
[dragonfly.git] / sys / net / radix.c
CommitLineData
984263bc
MD
1/*
2 * Copyright (c) 1988, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * @(#)radix.c 8.4 (Berkeley) 11/2/94
34 * $FreeBSD: src/sys/net/radix.c,v 1.20.2.3 2002/04/28 05:40:25 suz Exp $
f23061d4 35 * $DragonFly: src/sys/net/radix.c,v 1.8 2004/12/21 02:54:14 hsu Exp $
984263bc
MD
36 */
37
38/*
39 * Routines to build and maintain radix trees for routing lookups.
40 */
984263bc
MD
41#include <sys/param.h>
42#ifdef _KERNEL
43#include <sys/systm.h>
44#include <sys/malloc.h>
984263bc
MD
45#include <sys/domain.h>
46#else
47#include <stdlib.h>
48#endif
49#include <sys/syslog.h>
50#include <net/radix.h>
984263bc 51
2e9572df
JH
52/*
53 * The arguments to the radix functions are really counted byte arrays with
54 * the length in the first byte. struct sockaddr's fit this type structurally.
55 */
56#define clen(c) (*(u_char *)(c))
57
f23061d4 58static int rn_walktree_from(struct radix_node_head *h, char *a, char *m,
2e9572df
JH
59 walktree_f_t *f, void *w);
60static int rn_walktree(struct radix_node_head *, walktree_f_t *, void *);
61
984263bc 62static struct radix_node
2e9572df 63 *rn_insert(char *, struct radix_node_head *, boolean_t *,
f23061d4 64 struct radix_node [2]),
2e9572df
JH
65 *rn_newpair(char *, int, struct radix_node[2]),
66 *rn_search(const char *, struct radix_node *),
67 *rn_search_m(const char *, struct radix_node *, const char *);
984263bc 68
2e9572df 69static int max_keylen;
984263bc
MD
70static struct radix_mask *rn_mkfreelist;
71static struct radix_node_head *mask_rnhead;
72static char *addmask_key;
984263bc
MD
73static char *rn_zeros, *rn_ones;
74
75#define rn_masktop (mask_rnhead->rnh_treetop)
984263bc 76
2e9572df 77static int rn_lexobetter(char *m, char *n);
984263bc 78static struct radix_mask *
2e9572df
JH
79 rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask);
80static int
81 rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip);
82
83static __inline struct radix_mask *
84MKGet(struct radix_mask **l)
85{
86 struct radix_mask *m;
87
88 if (*l != NULL) {
89 m = *l;
90 *l = m->rm_next;
91 } else {
92 R_Malloc(m, struct radix_mask *, sizeof (*(m)));
93 }
94 return m;
95}
96
97static __inline void
98MKFree(struct radix_mask **l, struct radix_mask *m)
99{
100 m->rm_next = *l;
101 *l = m;
102}
984263bc
MD
103
104/*
105 * The data structure for the keys is a radix tree with one way
106 * branching removed. The index rn_bit at an internal node n represents a bit
107 * position to be tested. The tree is arranged so that all descendants
108 * of a node n have keys whose bits all agree up to position rn_bit - 1.
109 * (We say the index of n is rn_bit.)
110 *
111 * There is at least one descendant which has a one bit at position rn_bit,
112 * and at least one with a zero there.
113 *
114 * A route is determined by a pair of key and mask. We require that the
115 * bit-wise logical and of the key and mask to be the key.
116 * We define the index of a route to associated with the mask to be
117 * the first bit number in the mask where 0 occurs (with bit number 0
118 * representing the highest order bit).
119 *
120 * We say a mask is normal if every bit is 0, past the index of the mask.
121 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_bit,
122 * and m is a normal mask, then the route applies to every descendant of n.
123 * If the index(m) < rn_bit, this implies the trailing last few bits of k
124 * before bit b are all 0, (and hence consequently true of every descendant
125 * of n), so the route applies to all descendants of the node as well.
126 *
127 * Similar logic shows that a non-normal mask m such that
128 * index(m) <= index(n) could potentially apply to many children of n.
129 * Thus, for each non-host route, we attach its mask to a list at an internal
130 * node as high in the tree as we can go.
131 *
132 * The present version of the code makes use of normal routes in short-
133 * circuiting an explict mask and compare operation when testing whether
134 * a key satisfies a normal route, and also in remembering the unique leaf
135 * that governs a subtree.
136 */
137
138static struct radix_node *
2e9572df 139rn_search(const char *v, struct radix_node *head)
984263bc 140{
82ed7fc2 141 struct radix_node *x;
984263bc 142
2e9572df
JH
143 x = head;
144 while (x->rn_bit >= 0) {
984263bc
MD
145 if (x->rn_bmask & v[x->rn_offset])
146 x = x->rn_right;
147 else
148 x = x->rn_left;
149 }
150 return (x);
151}
152
153static struct radix_node *
2e9572df 154rn_search_m(const char *v, struct radix_node *head, const char *m)
984263bc 155{
82ed7fc2 156 struct radix_node *x;
984263bc
MD
157
158 for (x = head; x->rn_bit >= 0;) {
159 if ((x->rn_bmask & m[x->rn_offset]) &&
160 (x->rn_bmask & v[x->rn_offset]))
161 x = x->rn_right;
162 else
163 x = x->rn_left;
164 }
165 return x;
166}
167
2e9572df
JH
168boolean_t
169rn_refines(char *m, char *n)
984263bc 170{
2e9572df
JH
171 char *lim, *lim2;
172 int longer = clen(n++) - clen(m++);
173 boolean_t masks_are_equal = TRUE;
984263bc 174
2e9572df 175 lim2 = lim = n + clen(n);
984263bc
MD
176 if (longer > 0)
177 lim -= longer;
178 while (n < lim) {
179 if (*n & ~(*m))
f23061d4 180 return FALSE;
984263bc 181 if (*n++ != *m++)
2e9572df 182 masks_are_equal = FALSE;
984263bc
MD
183 }
184 while (n < lim2)
185 if (*n++)
f23061d4 186 return FALSE;
984263bc
MD
187 if (masks_are_equal && (longer < 0))
188 for (lim2 = m - longer; m < lim2; )
189 if (*m++)
f23061d4 190 return TRUE;
984263bc
MD
191 return (!masks_are_equal);
192}
193
194struct radix_node *
2e9572df 195rn_lookup(char *key, char *mask, struct radix_node_head *head)
984263bc 196{
82ed7fc2 197 struct radix_node *x;
2e9572df 198 char *netmask = NULL;
984263bc 199
2e9572df
JH
200 if (mask != NULL) {
201 x = rn_addmask(mask, TRUE, head->rnh_treetop->rn_offset);
202 if (x == NULL)
203 return (NULL);
984263bc
MD
204 netmask = x->rn_key;
205 }
2e9572df
JH
206 x = rn_match(key, head);
207 if (x != NULL && netmask != NULL) {
208 while (x != NULL && x->rn_mask != netmask)
984263bc
MD
209 x = x->rn_dupedkey;
210 }
211 return x;
212}
213
214static int
2e9572df 215rn_satisfies_leaf(char *trial, struct radix_node *leaf, int skip)
984263bc 216{
82ed7fc2 217 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
984263bc 218 char *cplim;
2e9572df 219 int length = min(clen(cp), clen(cp2));
984263bc 220
2e9572df 221 if (cp3 == NULL)
984263bc
MD
222 cp3 = rn_ones;
223 else
2e9572df
JH
224 length = min(length, clen(cp3));
225 cplim = cp + length;
226 cp3 += skip;
227 cp2 += skip;
984263bc
MD
228 for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
229 if ((*cp ^ *cp2) & *cp3)
230 return 0;
231 return 1;
232}
233
234struct radix_node *
2e9572df 235rn_match(char *key, struct radix_node_head *head)
984263bc 236{
2e9572df
JH
237 struct radix_node *t, *x;
238 char *cp = key, *cp2;
239 char *cplim;
240 struct radix_node *saved_t, *top = head->rnh_treetop;
241 int off = top->rn_offset, klen, matched_off;
82ed7fc2 242 int test, b, rn_bit;
984263bc 243
2e9572df 244 t = rn_search(key, top);
984263bc
MD
245 /*
246 * See if we match exactly as a host destination
247 * or at least learn how many bits match, for normal mask finesse.
248 *
249 * It doesn't hurt us to limit how many bytes to check
250 * to the length of the mask, since if it matches we had a genuine
251 * match and the leaf we have is the most specific one anyway;
252 * if it didn't match with a shorter length it would fail
253 * with a long one. This wins big for class B&C netmasks which
254 * are probably the most common case...
255 */
2e9572df
JH
256 if (t->rn_mask != NULL)
257 klen = clen(t->rn_mask);
258 else
259 klen = clen(key);
260 cp += off; cp2 = t->rn_key + off; cplim = key + klen;
984263bc
MD
261 for (; cp < cplim; cp++, cp2++)
262 if (*cp != *cp2)
263 goto on1;
264 /*
265 * This extra grot is in case we are explicitly asked
266 * to look up the default. Ugh!
267 *
268 * Never return the root node itself, it seems to cause a
269 * lot of confusion.
270 */
271 if (t->rn_flags & RNF_ROOT)
272 t = t->rn_dupedkey;
273 return t;
274on1:
275 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
276 for (b = 7; (test >>= 1) > 0;)
277 b--;
2e9572df 278 matched_off = cp - key;
984263bc
MD
279 b += matched_off << 3;
280 rn_bit = -1 - b;
281 /*
282 * If there is a host route in a duped-key chain, it will be first.
283 */
2e9572df 284 if ((saved_t = t)->rn_mask == NULL)
984263bc 285 t = t->rn_dupedkey;
2e9572df 286 for (; t; t = t->rn_dupedkey) {
984263bc
MD
287 /*
288 * Even if we don't match exactly as a host,
289 * we may match if the leaf we wound up at is
290 * a route to a net.
291 */
292 if (t->rn_flags & RNF_NORMAL) {
293 if (rn_bit <= t->rn_bit)
294 return t;
2e9572df 295 } else if (rn_satisfies_leaf(key, t, matched_off))
984263bc 296 return t;
2e9572df 297 }
984263bc
MD
298 t = saved_t;
299 /* start searching up the tree */
300 do {
82ed7fc2 301 struct radix_mask *m;
2e9572df 302
984263bc 303 t = t->rn_parent;
984263bc
MD
304 /*
305 * If non-contiguous masks ever become important
306 * we can restore the masking and open coding of
307 * the search and satisfaction test and put the
308 * calculation of "off" back before the "do".
309 */
2e9572df
JH
310 m = t->rn_mklist;
311 while (m != NULL) {
984263bc
MD
312 if (m->rm_flags & RNF_NORMAL) {
313 if (rn_bit <= m->rm_bit)
314 return (m->rm_leaf);
315 } else {
316 off = min(t->rn_offset, matched_off);
2e9572df
JH
317 x = rn_search_m(key, t, m->rm_mask);
318 while (x != NULL && x->rn_mask != m->rm_mask)
984263bc 319 x = x->rn_dupedkey;
2e9572df 320 if (x && rn_satisfies_leaf(key, x, off))
984263bc
MD
321 return x;
322 }
2e9572df 323 m = m->rm_next;
984263bc
MD
324 }
325 } while (t != top);
2e9572df 326 return NULL;
984263bc
MD
327}
328
329#ifdef RN_DEBUG
330int rn_nodenum;
331struct radix_node *rn_clist;
332int rn_saveinfo;
333int rn_debug = 1;
334#endif
335
336static struct radix_node *
2e9572df 337rn_newpair(char *key, int indexbit, struct radix_node nodes[2])
984263bc 338{
2e9572df
JH
339 struct radix_node *leaf = nodes, *interior = leaf + 1;
340
341 interior->rn_bit = indexbit;
342 interior->rn_bmask = 0x80 >> (indexbit & 0x7);
343 interior->rn_offset = indexbit >> 3;
344 interior->rn_left = leaf;
345 interior->rn_mklist = NULL;
346
347 leaf->rn_bit = -1;
348 leaf->rn_key = key;
349 leaf->rn_parent = interior;
350 leaf->rn_flags = interior->rn_flags = RNF_ACTIVE;
351 leaf->rn_mklist = NULL;
352
984263bc 353#ifdef RN_DEBUG
2e9572df
JH
354 leaf->rn_info = rn_nodenum++;
355 interior->rn_info = rn_nodenum++;
356 leaf->rn_twin = interior;
357 leaf->rn_ybro = rn_clist;
358 rn_clist = leaf;
984263bc 359#endif
2e9572df 360 return interior;
984263bc
MD
361}
362
363static struct radix_node *
f23061d4
JH
364rn_insert(char *key, struct radix_node_head *head, boolean_t *dupentry,
365 struct radix_node nodes[2])
984263bc 366{
984263bc 367 struct radix_node *top = head->rnh_treetop;
2e9572df
JH
368 int head_off = top->rn_offset, klen = clen(key);
369 struct radix_node *t = rn_search(key, top);
370 char *cp = key + head_off;
82ed7fc2 371 int b;
984263bc 372 struct radix_node *tt;
f23061d4 373 /*
2e9572df 374 * Find first bit at which the key and t->rn_key differ
984263bc
MD
375 */
376 {
2e9572df 377 char *cp2 = t->rn_key + head_off;
82ed7fc2 378 int cmp_res;
2e9572df 379 char *cplim = key + klen;
984263bc
MD
380
381 while (cp < cplim)
382 if (*cp2++ != *cp++)
383 goto on1;
2e9572df 384 *dupentry = TRUE;
984263bc
MD
385 return t;
386on1:
2e9572df 387 *dupentry = FALSE;
984263bc 388 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
2e9572df 389 for (b = (cp - key) << 3; cmp_res; b--)
984263bc
MD
390 cmp_res >>= 1;
391 }
392 {
82ed7fc2 393 struct radix_node *p, *x = top;
2e9572df
JH
394
395 cp = key;
984263bc
MD
396 do {
397 p = x;
398 if (cp[x->rn_offset] & x->rn_bmask)
399 x = x->rn_right;
400 else
401 x = x->rn_left;
402 } while (b > (unsigned) x->rn_bit);
403 /* x->rn_bit < b && x->rn_bit >= 0 */
404#ifdef RN_DEBUG
405 if (rn_debug)
406 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
407#endif
2e9572df 408 t = rn_newpair(key, b, nodes);
984263bc
MD
409 tt = t->rn_left;
410 if ((cp[p->rn_offset] & p->rn_bmask) == 0)
411 p->rn_left = t;
412 else
413 p->rn_right = t;
414 x->rn_parent = t;
415 t->rn_parent = p; /* frees x, p as temp vars below */
416 if ((cp[t->rn_offset] & t->rn_bmask) == 0) {
417 t->rn_right = x;
418 } else {
419 t->rn_right = tt;
420 t->rn_left = x;
421 }
422#ifdef RN_DEBUG
423 if (rn_debug)
424 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
425#endif
426 }
427 return (tt);
428}
429
430struct radix_node *
2e9572df 431rn_addmask(char *netmask, boolean_t search, int skip)
984263bc 432{
2e9572df
JH
433 struct radix_node *x, *saved_x;
434 char *cp, *cplim;
ef87f48d
JH
435 int b = 0, mlen, m0, j;
436 boolean_t maskduplicated, isnormal;
984263bc
MD
437 static int last_zeroed = 0;
438
2e9572df 439 if ((mlen = clen(netmask)) > max_keylen)
984263bc
MD
440 mlen = max_keylen;
441 if (skip == 0)
442 skip = 1;
443 if (mlen <= skip)
444 return (mask_rnhead->rnh_nodes);
445 if (skip > 1)
2e9572df 446 bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
984263bc 447 if ((m0 = mlen) > skip)
2e9572df 448 bcopy(netmask + skip, addmask_key + skip, mlen - skip);
984263bc
MD
449 /*
450 * Trim trailing zeroes.
451 */
452 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
453 cp--;
454 mlen = cp - addmask_key;
455 if (mlen <= skip) {
456 if (m0 >= last_zeroed)
457 last_zeroed = mlen;
458 return (mask_rnhead->rnh_nodes);
459 }
460 if (m0 < last_zeroed)
2e9572df 461 bzero(addmask_key + m0, last_zeroed - m0);
984263bc
MD
462 *addmask_key = last_zeroed = mlen;
463 x = rn_search(addmask_key, rn_masktop);
2e9572df
JH
464 if (bcmp(addmask_key, x->rn_key, mlen) != 0)
465 x = NULL;
466 if (x != NULL || search)
984263bc
MD
467 return (x);
468 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
2e9572df
JH
469 if ((saved_x = x) == NULL)
470 return (NULL);
471 bzero(x, max_keylen + 2 * sizeof (*x));
472 netmask = cp = (char *)(x + 2);
473 bcopy(addmask_key, cp, mlen);
984263bc
MD
474 x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
475 if (maskduplicated) {
476 log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
477 Free(saved_x);
478 return (x);
479 }
480 /*
481 * Calculate index of mask, and check for normalcy.
482 */
ef87f48d
JH
483 isnormal = TRUE;
484 cplim = netmask + mlen;
2e9572df 485 for (cp = netmask + skip; cp < cplim && clen(cp) == 0xff;)
984263bc
MD
486 cp++;
487 if (cp != cplim) {
f23061d4
JH
488 static const char normal_chars[] = {
489 0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1
490 };
491
984263bc
MD
492 for (j = 0x80; (j & *cp) != 0; j >>= 1)
493 b++;
494 if (*cp != normal_chars[b] || cp != (cplim - 1))
ef87f48d 495 isnormal = FALSE;
984263bc
MD
496 }
497 b += (cp - netmask) << 3;
498 x->rn_bit = -1 - b;
499 if (isnormal)
500 x->rn_flags |= RNF_NORMAL;
501 return (x);
502}
503
2e9572df
JH
504static boolean_t /* XXX: arbitrary ordering for non-contiguous masks */
505rn_lexobetter(char *mp, char *np)
984263bc 506{
2e9572df 507 char *lim;
984263bc 508
2e9572df
JH
509 if ((unsigned) *mp > (unsigned) *np)
510 return TRUE;/* not really, but need to check longer one first */
984263bc 511 if (*mp == *np)
2e9572df 512 for (lim = mp + clen(mp); mp < lim;)
984263bc 513 if (*mp++ > *np++)
2e9572df
JH
514 return TRUE;
515 return FALSE;
984263bc
MD
516}
517
518static struct radix_mask *
2e9572df 519rn_new_radix_mask(struct radix_node *tt, struct radix_mask *nextmask)
984263bc 520{
82ed7fc2 521 struct radix_mask *m;
984263bc 522
2e9572df
JH
523 m = MKGet(&rn_mkfreelist);
524 if (m == NULL) {
984263bc 525 log(LOG_ERR, "Mask for route not entered\n");
2e9572df 526 return (NULL);
984263bc 527 }
2e9572df 528 bzero(m, sizeof *m);
984263bc
MD
529 m->rm_bit = tt->rn_bit;
530 m->rm_flags = tt->rn_flags;
531 if (tt->rn_flags & RNF_NORMAL)
532 m->rm_leaf = tt;
533 else
534 m->rm_mask = tt->rn_mask;
2e9572df 535 m->rm_next = nextmask;
984263bc
MD
536 tt->rn_mklist = m;
537 return m;
538}
539
540struct radix_node *
2e9572df
JH
541rn_addroute(char *key, char *netmask, struct radix_node_head *head,
542 struct radix_node treenodes[2])
984263bc 543{
2e9572df 544 struct radix_node *t, *x = NULL, *tt;
984263bc
MD
545 struct radix_node *saved_tt, *top = head->rnh_treetop;
546 short b = 0, b_leaf = 0;
2e9572df
JH
547 boolean_t keyduplicated;
548 char *mmask;
984263bc
MD
549 struct radix_mask *m, **mp;
550
551 /*
552 * In dealing with non-contiguous masks, there may be
553 * many different routes which have the same mask.
554 * We will find it useful to have a unique pointer to
555 * the mask to speed avoiding duplicate references at
556 * nodes and possibly save time in calculating indices.
557 */
2e9572df
JH
558 if (netmask != NULL) {
559 if ((x = rn_addmask(netmask, FALSE, top->rn_offset)) == NULL)
560 return (NULL);
984263bc
MD
561 b_leaf = x->rn_bit;
562 b = -1 - x->rn_bit;
563 netmask = x->rn_key;
564 }
565 /*
566 * Deal with duplicated keys: attach node to previous instance
567 */
2e9572df 568 saved_tt = tt = rn_insert(key, head, &keyduplicated, treenodes);
984263bc
MD
569 if (keyduplicated) {
570 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
571 if (tt->rn_mask == netmask)
2e9572df
JH
572 return (NULL);
573 if (netmask == NULL ||
984263bc
MD
574 (tt->rn_mask &&
575 ((b_leaf < tt->rn_bit) /* index(netmask) > node */
576 || rn_refines(netmask, tt->rn_mask)
577 || rn_lexobetter(netmask, tt->rn_mask))))
578 break;
579 }
580 /*
581 * If the mask is not duplicated, we wouldn't
582 * find it among possible duplicate key entries
583 * anyway, so the above test doesn't hurt.
584 *
585 * We sort the masks for a duplicated key the same way as
586 * in a masklist -- most specific to least specific.
587 * This may require the unfortunate nuisance of relocating
588 * the head of the list.
589 */
590 if (tt == saved_tt) {
591 struct radix_node *xx = x;
592 /* link in at head of list */
593 (tt = treenodes)->rn_dupedkey = t;
594 tt->rn_flags = t->rn_flags;
595 tt->rn_parent = x = t->rn_parent;
f23061d4 596 t->rn_parent = tt; /* parent */
984263bc
MD
597 if (x->rn_left == t)
598 x->rn_left = tt;
599 else
600 x->rn_right = tt;
601 saved_tt = tt; x = xx;
602 } else {
603 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
604 t->rn_dupedkey = tt;
605 tt->rn_parent = t; /* parent */
2e9572df 606 if (tt->rn_dupedkey != NULL) /* parent */
984263bc
MD
607 tt->rn_dupedkey->rn_parent = tt; /* parent */
608 }
609#ifdef RN_DEBUG
610 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
611 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
612#endif
2e9572df 613 tt->rn_key = key;
984263bc
MD
614 tt->rn_bit = -1;
615 tt->rn_flags = RNF_ACTIVE;
616 }
617 /*
618 * Put mask in tree.
619 */
2e9572df 620 if (netmask != NULL) {
984263bc
MD
621 tt->rn_mask = netmask;
622 tt->rn_bit = x->rn_bit;
623 tt->rn_flags |= x->rn_flags & RNF_NORMAL;
624 }
625 t = saved_tt->rn_parent;
626 if (keyduplicated)
627 goto on2;
628 b_leaf = -1 - t->rn_bit;
629 if (t->rn_right == saved_tt)
630 x = t->rn_left;
631 else
632 x = t->rn_right;
633 /* Promote general routes from below */
634 if (x->rn_bit < 0) {
2e9572df
JH
635 mp = &t->rn_mklist;
636 while (x != NULL) {
637 if (x->rn_mask != NULL &&
638 x->rn_bit >= b_leaf &&
639 x->rn_mklist == NULL) {
640 *mp = m = rn_new_radix_mask(x, NULL);
641 if (m != NULL)
642 mp = &m->rm_next;
643 }
644 x = x->rn_dupedkey;
984263bc 645 }
2e9572df 646 } else if (x->rn_mklist != NULL) {
984263bc
MD
647 /*
648 * Skip over masks whose index is > that of new node
649 */
2e9572df 650 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
984263bc
MD
651 if (m->rm_bit >= b_leaf)
652 break;
2e9572df
JH
653 t->rn_mklist = m;
654 *mp = NULL;
984263bc
MD
655 }
656on2:
657 /* Add new route to highest possible ancestor's list */
2e9572df 658 if ((netmask == NULL) || (b > t->rn_bit ))
984263bc
MD
659 return tt; /* can't lift at all */
660 b_leaf = tt->rn_bit;
661 do {
662 x = t;
663 t = t->rn_parent;
664 } while (b <= t->rn_bit && x != top);
665 /*
666 * Search through routes associated with node to
667 * insert new route according to index.
668 * Need same criteria as when sorting dupedkeys to avoid
669 * double loop on deletion.
670 */
2e9572df 671 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next) {
984263bc
MD
672 if (m->rm_bit < b_leaf)
673 continue;
674 if (m->rm_bit > b_leaf)
675 break;
676 if (m->rm_flags & RNF_NORMAL) {
677 mmask = m->rm_leaf->rn_mask;
678 if (tt->rn_flags & RNF_NORMAL) {
679 log(LOG_ERR,
680 "Non-unique normal route, mask not entered\n");
681 return tt;
682 }
683 } else
684 mmask = m->rm_mask;
685 if (mmask == netmask) {
686 m->rm_refs++;
687 tt->rn_mklist = m;
688 return tt;
689 }
2e9572df 690 if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask))
984263bc
MD
691 break;
692 }
693 *mp = rn_new_radix_mask(tt, *mp);
694 return tt;
695}
696
697struct radix_node *
2e9572df 698rn_delete(char *key, char *netmask, struct radix_node_head *head)
984263bc 699{
82ed7fc2 700 struct radix_node *t, *p, *x, *tt;
984263bc
MD
701 struct radix_mask *m, *saved_m, **mp;
702 struct radix_node *dupedkey, *saved_tt, *top;
2e9572df 703 int b, head_off, klen;
984263bc 704
984263bc 705 x = head->rnh_treetop;
2e9572df 706 tt = rn_search(key, x);
984263bc 707 head_off = x->rn_offset;
2e9572df 708 klen = clen(key);
984263bc
MD
709 saved_tt = tt;
710 top = x;
2e9572df
JH
711 if (tt == NULL ||
712 bcmp(key + head_off, tt->rn_key + head_off, klen - head_off))
713 return (NULL);
984263bc
MD
714 /*
715 * Delete our route from mask lists.
716 */
2e9572df
JH
717 if (netmask != NULL) {
718 if ((x = rn_addmask(netmask, TRUE, head_off)) == NULL)
719 return (NULL);
984263bc
MD
720 netmask = x->rn_key;
721 while (tt->rn_mask != netmask)
2e9572df
JH
722 if ((tt = tt->rn_dupedkey) == NULL)
723 return (NULL);
984263bc 724 }
2e9572df 725 if (tt->rn_mask == NULL || (saved_m = m = tt->rn_mklist) == NULL)
984263bc
MD
726 goto on1;
727 if (tt->rn_flags & RNF_NORMAL) {
728 if (m->rm_leaf != tt || m->rm_refs > 0) {
729 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
2e9572df 730 return (NULL); /* dangling ref could cause disaster */
984263bc
MD
731 }
732 } else {
733 if (m->rm_mask != tt->rn_mask) {
734 log(LOG_ERR, "rn_delete: inconsistent annotation\n");
735 goto on1;
736 }
737 if (--m->rm_refs >= 0)
738 goto on1;
739 }
740 b = -1 - tt->rn_bit;
741 t = saved_tt->rn_parent;
742 if (b > t->rn_bit)
743 goto on1; /* Wasn't lifted at all */
744 do {
745 x = t;
746 t = t->rn_parent;
747 } while (b <= t->rn_bit && x != top);
2e9572df 748 for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_next)
984263bc 749 if (m == saved_m) {
2e9572df
JH
750 *mp = m->rm_next;
751 MKFree(&rn_mkfreelist, m);
984263bc
MD
752 break;
753 }
2e9572df 754 if (m == NULL) {
984263bc
MD
755 log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
756 if (tt->rn_flags & RNF_NORMAL)
2e9572df 757 return (NULL); /* Dangling ref to us */
984263bc
MD
758 }
759on1:
760 /*
761 * Eliminate us from tree
762 */
763 if (tt->rn_flags & RNF_ROOT)
2e9572df 764 return (NULL);
984263bc
MD
765#ifdef RN_DEBUG
766 /* Get us out of the creation list */
767 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
768 if (t) t->rn_ybro = tt->rn_ybro;
769#endif
770 t = tt->rn_parent;
771 dupedkey = saved_tt->rn_dupedkey;
2e9572df 772 if (dupedkey != NULL) {
984263bc
MD
773 /*
774 * at this point, tt is the deletion target and saved_tt
775 * is the head of the dupekey chain
776 */
777 if (tt == saved_tt) {
778 /* remove from head of chain */
779 x = dupedkey; x->rn_parent = t;
780 if (t->rn_left == tt)
781 t->rn_left = x;
782 else
783 t->rn_right = x;
784 } else {
785 /* find node in front of tt on the chain */
786 for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
787 p = p->rn_dupedkey;
788 if (p) {
789 p->rn_dupedkey = tt->rn_dupedkey;
790 if (tt->rn_dupedkey) /* parent */
791 tt->rn_dupedkey->rn_parent = p;
792 /* parent */
793 } else log(LOG_ERR, "rn_delete: couldn't find us\n");
794 }
795 t = tt + 1;
796 if (t->rn_flags & RNF_ACTIVE) {
797#ifndef RN_DEBUG
798 *++x = *t;
799 p = t->rn_parent;
800#else
801 b = t->rn_info;
802 *++x = *t;
803 t->rn_info = b;
804 p = t->rn_parent;
805#endif
806 if (p->rn_left == t)
807 p->rn_left = x;
808 else
809 p->rn_right = x;
810 x->rn_left->rn_parent = x;
811 x->rn_right->rn_parent = x;
812 }
813 goto out;
814 }
815 if (t->rn_left == tt)
816 x = t->rn_right;
817 else
818 x = t->rn_left;
819 p = t->rn_parent;
820 if (p->rn_right == t)
821 p->rn_right = x;
822 else
823 p->rn_left = x;
824 x->rn_parent = p;
825 /*
826 * Demote routes attached to us.
827 */
2e9572df 828 if (t->rn_mklist != NULL) {
984263bc
MD
829 if (x->rn_bit >= 0) {
830 for (mp = &x->rn_mklist; (m = *mp);)
2e9572df 831 mp = &m->rm_next;
984263bc
MD
832 *mp = t->rn_mklist;
833 } else {
f23061d4
JH
834 /*
835 * If there are any (key, mask) pairs in a sibling
836 * duped-key chain, some subset will appear sorted
837 * in the same order attached to our mklist.
838 */
984263bc
MD
839 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
840 if (m == x->rn_mklist) {
2e9572df
JH
841 struct radix_mask *mm = m->rm_next;
842
843 x->rn_mklist = NULL;
984263bc 844 if (--(m->rm_refs) < 0)
2e9572df 845 MKFree(&rn_mkfreelist, m);
984263bc
MD
846 m = mm;
847 }
848 if (m)
849 log(LOG_ERR,
850 "rn_delete: Orphaned Mask %p at %p\n",
851 (void *)m, (void *)x);
852 }
853 }
854 /*
855 * We may be holding an active internal node in the tree.
856 */
857 x = tt + 1;
858 if (t != x) {
859#ifndef RN_DEBUG
860 *t = *x;
861#else
862 b = t->rn_info;
863 *t = *x;
864 t->rn_info = b;
865#endif
866 t->rn_left->rn_parent = t;
867 t->rn_right->rn_parent = t;
868 p = x->rn_parent;
869 if (p->rn_left == x)
870 p->rn_left = t;
871 else
872 p->rn_right = t;
873 }
874out:
875 tt->rn_flags &= ~RNF_ACTIVE;
876 tt[1].rn_flags &= ~RNF_ACTIVE;
877 return (tt);
878}
879
880/*
881 * This is the same as rn_walktree() except for the parameters and the
882 * exit.
883 */
884static int
f23061d4 885rn_walktree_from(struct radix_node_head *h, char *xa, char *xm,
2e9572df 886 walktree_f_t *f, void *w)
984263bc 887{
984263bc 888 struct radix_node *base, *next;
2e9572df 889 struct radix_node *rn, *last = NULL /* shut up gcc */;
f23061d4 890 boolean_t stopping = FALSE;
2e9572df 891 int lastb, error;
984263bc
MD
892
893 /*
894 * rn_search_m is sort-of-open-coded here.
895 */
896 /* printf("about to search\n"); */
897 for (rn = h->rnh_treetop; rn->rn_bit >= 0; ) {
898 last = rn;
899 /* printf("rn_bit %d, rn_bmask %x, xm[rn_offset] %x\n",
900 rn->rn_bit, rn->rn_bmask, xm[rn->rn_offset]); */
901 if (!(rn->rn_bmask & xm[rn->rn_offset])) {
902 break;
903 }
904 if (rn->rn_bmask & xa[rn->rn_offset]) {
905 rn = rn->rn_right;
906 } else {
907 rn = rn->rn_left;
908 }
909 }
910 /* printf("done searching\n"); */
911
912 /*
913 * Two cases: either we stepped off the end of our mask,
914 * in which case last == rn, or we reached a leaf, in which
915 * case we want to start from the last node we looked at.
916 * Either way, last is the node we want to start from.
917 */
918 rn = last;
919 lastb = rn->rn_bit;
920
921 /* printf("rn %p, lastb %d\n", rn, lastb);*/
922
923 /*
924 * This gets complicated because we may delete the node
925 * while applying the function f to it, so we need to calculate
926 * the successor node in advance.
927 */
928 while (rn->rn_bit >= 0)
929 rn = rn->rn_left;
930
931 while (!stopping) {
932 /* printf("node %p (%d)\n", rn, rn->rn_bit); */
933 base = rn;
934 /* If at right child go back up, otherwise, go right */
2e9572df
JH
935 while (rn->rn_parent->rn_right == rn &&
936 !(rn->rn_flags & RNF_ROOT)) {
984263bc
MD
937 rn = rn->rn_parent;
938
939 /* if went up beyond last, stop */
940 if (rn->rn_bit < lastb) {
f23061d4 941 stopping = TRUE;
984263bc
MD
942 /* printf("up too far\n"); */
943 }
944 }
945
946 /* Find the next *leaf* since next node might vanish, too */
947 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
948 rn = rn->rn_left;
949 next = rn;
950 /* Process leaves */
2e9572df 951 while ((rn = base) != NULL) {
984263bc
MD
952 base = rn->rn_dupedkey;
953 /* printf("leaf %p\n", rn); */
2e9572df 954 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
984263bc
MD
955 return (error);
956 }
957 rn = next;
958
959 if (rn->rn_flags & RNF_ROOT) {
960 /* printf("root, stopping"); */
f23061d4 961 stopping = TRUE;
984263bc
MD
962 }
963
964 }
965 return 0;
966}
967
968static int
2e9572df 969rn_walktree(struct radix_node_head *h, walktree_f_t *f, void *w)
984263bc 970{
984263bc 971 struct radix_node *base, *next;
82ed7fc2 972 struct radix_node *rn = h->rnh_treetop;
2e9572df
JH
973 int error;
974
984263bc
MD
975 /*
976 * This gets complicated because we may delete the node
977 * while applying the function f to it, so we need to calculate
978 * the successor node in advance.
979 */
980 /* First time through node, go left */
981 while (rn->rn_bit >= 0)
982 rn = rn->rn_left;
983 for (;;) {
984 base = rn;
985 /* If at right child go back up, otherwise, go right */
2e9572df
JH
986 while (rn->rn_parent->rn_right == rn &&
987 !(rn->rn_flags & RNF_ROOT))
984263bc
MD
988 rn = rn->rn_parent;
989 /* Find the next *leaf* since next node might vanish, too */
990 for (rn = rn->rn_parent->rn_right; rn->rn_bit >= 0;)
991 rn = rn->rn_left;
992 next = rn;
993 /* Process leaves */
994 while ((rn = base)) {
995 base = rn->rn_dupedkey;
2e9572df 996 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
984263bc
MD
997 return (error);
998 }
999 rn = next;
1000 if (rn->rn_flags & RNF_ROOT)
1001 return (0);
1002 }
1003 /* NOTREACHED */
1004}
1005
1006int
2e9572df 1007rn_inithead(void **head, int off)
984263bc 1008{
82ed7fc2 1009 struct radix_node_head *rnh;
f23061d4 1010 struct radix_node *root, *left, *right;
2e9572df 1011
984263bc
MD
1012 if (*head)
1013 return (1);
1014 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
2e9572df 1015 if (rnh == NULL)
984263bc 1016 return (0);
2e9572df 1017 bzero(rnh, sizeof (*rnh));
984263bc 1018 *head = rnh;
2e9572df 1019
f23061d4 1020 root = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
2e9572df 1021 right = rnh->rnh_nodes + 2;
f23061d4
JH
1022 root->rn_parent = root;
1023 root->rn_flags = RNF_ROOT | RNF_ACTIVE;
1024 root->rn_right = right;
2e9572df 1025
f23061d4 1026 left = root->rn_left;
2e9572df 1027 left->rn_bit = -1 - off;
f23061d4 1028 left->rn_flags = RNF_ROOT | RNF_ACTIVE;
2e9572df
JH
1029
1030 *right = *left;
1031 right->rn_key = rn_ones;
1032
f23061d4 1033 rnh->rnh_treetop = root;
984263bc
MD
1034 rnh->rnh_addaddr = rn_addroute;
1035 rnh->rnh_deladdr = rn_delete;
1036 rnh->rnh_matchaddr = rn_match;
1037 rnh->rnh_lookup = rn_lookup;
1038 rnh->rnh_walktree = rn_walktree;
1039 rnh->rnh_walktree_from = rn_walktree_from;
2e9572df 1040
984263bc
MD
1041 return (1);
1042}
1043
1044void
1045rn_init()
1046{
1047 char *cp, *cplim;
1048#ifdef _KERNEL
1049 struct domain *dom;
1050
1051 for (dom = domains; dom; dom = dom->dom_next)
1052 if (dom->dom_maxrtkey > max_keylen)
1053 max_keylen = dom->dom_maxrtkey;
1054#endif
1055 if (max_keylen == 0) {
1056 log(LOG_ERR,
1057 "rn_init: radix functions require max_keylen be set\n");
1058 return;
1059 }
1060 R_Malloc(rn_zeros, char *, 3 * max_keylen);
1061 if (rn_zeros == NULL)
1062 panic("rn_init");
2e9572df 1063 bzero(rn_zeros, 3 * max_keylen);
984263bc
MD
1064 rn_ones = cp = rn_zeros + max_keylen;
1065 addmask_key = cplim = rn_ones + max_keylen;
1066 while (cp < cplim)
1067 *cp++ = -1;
1068 if (rn_inithead((void **)&mask_rnhead, 0) == 0)
1069 panic("rn_init 2");
1070}