1 /* 2 * Copyright (c) 1988, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 * 7 * @(#)radix.c 8.2.2.1 (Berkeley) 10/09/94 8 */ 9 10 /* 11 * Routines to build and maintain radix trees for routing lookups. 12 */ 13 #ifndef _RADIX_H_ 14 #include <sys/param.h> 15 #ifdef KERNEL 16 #include <sys/systm.h> 17 #include <sys/malloc.h> 18 #define M_DONTWAIT M_NOWAIT 19 #include <sys/domain.h> 20 #else 21 #include <stdlib.h> 22 #endif 23 #include <sys/syslog.h> 24 #include <net/radix.h> 25 #endif 26 27 int max_keylen; 28 struct radix_mask *rn_mkfreelist; 29 struct radix_node_head *mask_rnhead; 30 static char *addmask_key; 31 static char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1}; 32 static char *rn_zeros, *rn_ones; 33 34 #define rn_masktop (mask_rnhead->rnh_treetop) 35 #undef Bcmp 36 #define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l)) 37 /* 38 * The data structure for the keys is a radix tree with one way 39 * branching removed. The index rn_b at an internal node n represents a bit 40 * position to be tested. The tree is arranged so that all descendants 41 * of a node n have keys whose bits all agree up to position rn_b - 1. 42 * (We say the index of n is rn_b.) 43 * 44 * There is at least one descendant which has a one bit at position rn_b, 45 * and at least one with a zero there. 46 * 47 * A route is determined by a pair of key and mask. We require that the 48 * bit-wise logical and of the key and mask to be the key. 49 * We define the index of a route to associated with the mask to be 50 * the first bit number in the mask where 0 occurs (with bit number 0 51 * representing the highest order bit). 52 * 53 * We say a mask is normal if every bit is 0, past the index of the mask. 54 * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b, 55 * and m is a normal mask, then the route applies to every descendant of n. 56 * If the index(m) < rn_b, this implies the trailing last few bits of k 57 * before bit b are all 0, (and hence consequently true of every descendant 58 * of n), so the route applies to all descendants of the node as well. 59 * 60 * Similar logic shows that a non-normal mask m such that 61 * index(m) <= index(n) could potentially apply to many children of n. 62 * Thus, for each non-host route, we attach its mask to a list at an internal 63 * node as high in the tree as we can go. 64 * 65 * The present version of the code makes use of normal routes in short- 66 * circuiting an explict mask and compare operation when testing whether 67 * a key satisfies a normal route, and also in remembering the unique leaf 68 * that governs a subtree. 69 */ 70 71 struct radix_node * 72 rn_search(v_arg, head) 73 void *v_arg; 74 struct radix_node *head; 75 { 76 register struct radix_node *x; 77 register caddr_t v; 78 79 for (x = head, v = v_arg; x->rn_b >= 0;) { 80 if (x->rn_bmask & v[x->rn_off]) 81 x = x->rn_r; 82 else 83 x = x->rn_l; 84 } 85 return (x); 86 }; 87 88 struct radix_node * 89 rn_search_m(v_arg, head, m_arg) 90 struct radix_node *head; 91 void *v_arg, *m_arg; 92 { 93 register struct radix_node *x; 94 register caddr_t v = v_arg, m = m_arg; 95 96 for (x = head; x->rn_b >= 0;) { 97 if ((x->rn_bmask & m[x->rn_off]) && 98 (x->rn_bmask & v[x->rn_off])) 99 x = x->rn_r; 100 else 101 x = x->rn_l; 102 } 103 return x; 104 }; 105 106 int 107 rn_refines(m_arg, n_arg) 108 void *m_arg, *n_arg; 109 { 110 register caddr_t m = m_arg, n = n_arg; 111 register caddr_t lim, lim2 = lim = n + *(u_char *)n; 112 int longer = (*(u_char *)n++) - (int)(*(u_char *)m++); 113 int masks_are_equal = 1; 114 115 if (longer > 0) 116 lim -= longer; 117 while (n < lim) { 118 if (*n & ~(*m)) 119 return 0; 120 if (*n++ != *m++) 121 masks_are_equal = 0; 122 } 123 while (n < lim2) 124 if (*n++) 125 return 0; 126 if (masks_are_equal && (longer < 0)) 127 for (lim2 = m - longer; m < lim2; ) 128 if (*m++) 129 return 1; 130 return (!masks_are_equal); 131 } 132 133 struct radix_node * 134 rn_lookup(v_arg, m_arg, head) 135 void *v_arg, *m_arg; 136 struct radix_node_head *head; 137 { 138 register struct radix_node *x; 139 caddr_t netmask = 0; 140 141 if (m_arg) { 142 if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0) 143 return (0); 144 netmask = x->rn_key; 145 } 146 x = rn_match(v_arg, head); 147 if (x && netmask) { 148 while (x && x->rn_mask != netmask) 149 x = x->rn_dupedkey; 150 } 151 return x; 152 } 153 154 static 155 rn_satsifies_leaf(trial, leaf, skip) 156 char *trial; 157 register struct radix_node *leaf; 158 int skip; 159 { 160 register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 161 char *cplim; 162 int length = min(*(u_char *)cp, *(u_char *)cp2); 163 164 if (cp3 == 0) 165 cp3 = rn_ones; 166 else 167 length = min(length, *(u_char *)cp3); 168 cplim = cp + length; cp3 += skip; cp2 += skip; 169 for (cp += skip; cp < cplim; cp++, cp2++, cp3++) 170 if ((*cp ^ *cp2) & *cp3) 171 return 0; 172 return 1; 173 } 174 175 struct radix_node * 176 rn_match(v_arg, head) 177 void *v_arg; 178 struct radix_node_head *head; 179 { 180 caddr_t v = v_arg; 181 register struct radix_node *t = head->rnh_treetop, *x; 182 register caddr_t cp = v, cp2; 183 caddr_t cplim; 184 struct radix_node *saved_t, *top = t; 185 int off = t->rn_off, vlen = *(u_char *)cp, matched_off; 186 register int test, b, rn_b; 187 188 /* 189 * Open code rn_search(v, top) to avoid overhead of extra 190 * subroutine call. 191 */ 192 for (; t->rn_b >= 0; ) { 193 if (t->rn_bmask & cp[t->rn_off]) 194 t = t->rn_r; 195 else 196 t = t->rn_l; 197 } 198 /* 199 * See if we match exactly as a host destination 200 * or at least learn how many bits match, for normal mask finesse. 201 * 202 * It doesn't hurt us to limit how many bytes to check 203 * to the length of the mask, since if it matches we had a genuine 204 * match and the leaf we have is the most specific one anyway; 205 * if it didn't match with a shorter length it would fail 206 * with a long one. This wins big for class B&C netmasks which 207 * are probably the most common case... 208 */ 209 if (t->rn_mask) 210 vlen = *(u_char *)t->rn_mask; 211 cp += off; cp2 = t->rn_key + off; cplim = v + vlen; 212 for (; cp < cplim; cp++, cp2++) 213 if (*cp != *cp2) 214 goto on1; 215 /* 216 * This extra grot is in case we are explicitly asked 217 * to look up the default. Ugh! 218 */ 219 if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey) 220 t = t->rn_dupedkey; 221 return t; 222 on1: 223 test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */ 224 for (b = 7; (test >>= 1) > 0;) 225 b--; 226 matched_off = cp - v; 227 b += matched_off << 3; 228 rn_b = -1 - b; 229 /* 230 * If there is a host route in a duped-key chain, it will be first. 231 */ 232 if ((saved_t = t)->rn_mask == 0) 233 t = t->rn_dupedkey; 234 for (; t; t = t->rn_dupedkey) 235 /* 236 * Even if we don't match exactly as a host, 237 * we may match if the leaf we wound up at is 238 * a route to a net. 239 */ 240 if (t->rn_flags & RNF_NORMAL) { 241 if (rn_b <= t->rn_b) 242 return t; 243 } else if (rn_satsifies_leaf(v, t, matched_off)) 244 return t; 245 t = saved_t; 246 /* start searching up the tree */ 247 do { 248 register struct radix_mask *m; 249 t = t->rn_p; 250 if (m = t->rn_mklist) { 251 /* 252 * If non-contiguous masks ever become important 253 * we can restore the masking and open coding of 254 * the search and satisfaction test and put the 255 * calculation of "off" back before the "do". 256 */ 257 do { 258 if (m->rm_flags & RNF_NORMAL) { 259 if (rn_b <= m->rm_b) 260 return (m->rm_leaf); 261 } else { 262 off = min(t->rn_off, matched_off); 263 x = rn_search_m(v, t, m->rm_mask); 264 while (x && x->rn_mask != m->rm_mask) 265 x = x->rn_dupedkey; 266 if (x && rn_satsifies_leaf(v, x, off)) 267 return x; 268 } 269 } while (m = m->rm_mklist); 270 } 271 } while (t != top); 272 return 0; 273 }; 274 275 #ifdef RN_DEBUG 276 int rn_nodenum; 277 struct radix_node *rn_clist; 278 int rn_saveinfo; 279 int rn_debug = 1; 280 #endif 281 282 struct radix_node * 283 rn_newpair(v, b, nodes) 284 void *v; 285 int b; 286 struct radix_node nodes[2]; 287 { 288 register struct radix_node *tt = nodes, *t = tt + 1; 289 t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7); 290 t->rn_l = tt; t->rn_off = b >> 3; 291 tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t; 292 tt->rn_flags = t->rn_flags = RNF_ACTIVE; 293 #ifdef RN_DEBUG 294 tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++; 295 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt; 296 #endif 297 return t; 298 } 299 300 struct radix_node * 301 rn_insert(v_arg, head, dupentry, nodes) 302 void *v_arg; 303 struct radix_node_head *head; 304 int *dupentry; 305 struct radix_node nodes[2]; 306 { 307 caddr_t v = v_arg; 308 struct radix_node *top = head->rnh_treetop; 309 int head_off = top->rn_off, vlen = (int)*((u_char *)v); 310 register struct radix_node *t = rn_search(v_arg, top); 311 register caddr_t cp = v + head_off; 312 register int b; 313 struct radix_node *tt; 314 /* 315 * Find first bit at which v and t->rn_key differ 316 */ 317 { 318 register caddr_t cp2 = t->rn_key + head_off; 319 register int cmp_res; 320 caddr_t cplim = v + vlen; 321 322 while (cp < cplim) 323 if (*cp2++ != *cp++) 324 goto on1; 325 *dupentry = 1; 326 return t; 327 on1: 328 *dupentry = 0; 329 cmp_res = (cp[-1] ^ cp2[-1]) & 0xff; 330 for (b = (cp - v) << 3; cmp_res; b--) 331 cmp_res >>= 1; 332 } 333 { 334 register struct radix_node *p, *x = top; 335 cp = v; 336 do { 337 p = x; 338 if (cp[x->rn_off] & x->rn_bmask) 339 x = x->rn_r; 340 else x = x->rn_l; 341 } while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */ 342 #ifdef RN_DEBUG 343 if (rn_debug) 344 log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p); 345 #endif 346 t = rn_newpair(v_arg, b, nodes); tt = t->rn_l; 347 if ((cp[p->rn_off] & p->rn_bmask) == 0) 348 p->rn_l = t; 349 else 350 p->rn_r = t; 351 x->rn_p = t; t->rn_p = p; /* frees x, p as temp vars below */ 352 if ((cp[t->rn_off] & t->rn_bmask) == 0) { 353 t->rn_r = x; 354 } else { 355 t->rn_r = tt; t->rn_l = x; 356 } 357 #ifdef RN_DEBUG 358 if (rn_debug) 359 log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p); 360 #endif 361 } 362 return (tt); 363 } 364 365 struct radix_node * 366 rn_addmask(n_arg, search, skip) 367 int search, skip; 368 void *n_arg; 369 { 370 caddr_t netmask = (caddr_t)n_arg; 371 register struct radix_node *x; 372 register caddr_t cp, cplim; 373 register int b = 0, mlen, j; 374 int maskduplicated, m0, isnormal; 375 struct radix_node *saved_x; 376 static int last_zeroed = 0; 377 378 if ((mlen = *(u_char *)netmask) > max_keylen) 379 mlen = max_keylen; 380 if (skip == 0) 381 skip = 1; 382 if (mlen <= skip) 383 return (mask_rnhead->rnh_nodes); 384 if (skip > 1) 385 Bcopy(rn_ones + 1, addmask_key + 1, skip - 1); 386 if ((m0 = mlen) > skip) 387 Bcopy(netmask + skip, addmask_key + skip, mlen - skip); 388 /* 389 * Trim trailing zeroes. 390 */ 391 for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;) 392 cp--; 393 mlen = cp - addmask_key; 394 if (mlen <= skip) { 395 if (m0 >= last_zeroed) 396 last_zeroed = mlen; 397 return (mask_rnhead->rnh_nodes); 398 } 399 if (m0 < last_zeroed) 400 Bzero(addmask_key + m0, last_zeroed - m0); 401 *addmask_key = last_zeroed = mlen; 402 x = rn_search(addmask_key, rn_masktop); 403 if (Bcmp(addmask_key, x->rn_key, mlen) != 0) 404 x = 0; 405 if (x || search) 406 return (x); 407 R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x)); 408 if ((saved_x = x) == 0) 409 return (0); 410 Bzero(x, max_keylen + 2 * sizeof (*x)); 411 netmask = cp = (caddr_t)(x + 2); 412 Bcopy(addmask_key, cp, mlen); 413 x = rn_insert(cp, mask_rnhead, &maskduplicated, x); 414 if (maskduplicated) { 415 log(LOG_ERR, "rn_addmask: mask impossibly already in tree"); 416 Free(saved_x); 417 return (x); 418 } 419 /* 420 * Calculate index of mask, and check for normalcy. 421 */ 422 cplim = netmask + mlen; isnormal = 1; 423 for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;) 424 cp++; 425 if (cp != cplim) { 426 for (j = 0x80; (j & *cp) != 0; j >>= 1) 427 b++; 428 if (*cp != normal_chars[b] || cp != (cplim - 1)) 429 isnormal = 0; 430 } 431 b += (cp - netmask) << 3; 432 x->rn_b = -1 - b; 433 if (isnormal) 434 x->rn_flags |= RNF_NORMAL; 435 return (x); 436 } 437 438 static int /* XXX: arbitrary ordering for non-contiguous masks */ 439 rn_lexobetter(m_arg, n_arg) 440 void *m_arg, *n_arg; 441 { 442 register u_char *mp = m_arg, *np = n_arg, *lim; 443 444 if (*mp > *np) 445 return 1; /* not really, but need to check longer one first */ 446 if (*mp == *np) 447 for (lim = mp + *mp; mp < lim;) 448 if (*mp++ > *np++) 449 return 1; 450 return 0; 451 } 452 453 static struct radix_mask * 454 rn_new_radix_mask(tt, next) 455 register struct radix_node *tt; 456 register struct radix_mask *next; 457 { 458 register struct radix_mask *m; 459 460 MKGet(m); 461 if (m == 0) { 462 log(LOG_ERR, "Mask for route not entered\n"); 463 return (0); 464 } 465 Bzero(m, sizeof *m); 466 m->rm_b = tt->rn_b; 467 m->rm_flags = tt->rn_flags; 468 if (tt->rn_flags & RNF_NORMAL) 469 m->rm_leaf = tt; 470 else 471 m->rm_mask = tt->rn_mask; 472 m->rm_mklist = next; 473 tt->rn_mklist = m; 474 return m; 475 } 476 477 struct radix_node * 478 rn_addroute(v_arg, n_arg, head, treenodes) 479 void *v_arg, *n_arg; 480 struct radix_node_head *head; 481 struct radix_node treenodes[2]; 482 { 483 caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg; 484 register struct radix_node *t, *x, *tt; 485 struct radix_node *saved_tt, *top = head->rnh_treetop; 486 short b = 0, b_leaf; 487 int keyduplicated; 488 caddr_t mmask; 489 struct radix_mask *m, **mp; 490 491 /* 492 * In dealing with non-contiguous masks, there may be 493 * many different routes which have the same mask. 494 * We will find it useful to have a unique pointer to 495 * the mask to speed avoiding duplicate references at 496 * nodes and possibly save time in calculating indices. 497 */ 498 if (netmask) { 499 if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0) 500 return (0); 501 b_leaf = x->rn_b; 502 b = -1 - x->rn_b; 503 netmask = x->rn_key; 504 } 505 /* 506 * Deal with duplicated keys: attach node to previous instance 507 */ 508 saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes); 509 if (keyduplicated) { 510 for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) { 511 if (tt->rn_mask == netmask) 512 return (0); 513 if (netmask == 0 || 514 (tt->rn_mask && 515 ((b_leaf < tt->rn_b) || /* index(netmask) > node */ 516 rn_refines(netmask, tt->rn_mask) || 517 rn_lexobetter(netmask, tt->rn_mask)))) 518 break; 519 } 520 /* 521 * If the mask is not duplicated, we wouldn't 522 * find it among possible duplicate key entries 523 * anyway, so the above test doesn't hurt. 524 * 525 * We sort the masks for a duplicated key the same way as 526 * in a masklist -- most specific to least specific. 527 * This may require the unfortunate nuisance of relocating 528 * the head of the list. 529 */ 530 if (tt == saved_tt) { 531 struct radix_node *xx = x; 532 /* link in at head of list */ 533 (tt = treenodes)->rn_dupedkey = t; 534 tt->rn_flags = t->rn_flags; 535 tt->rn_p = x = t->rn_p; 536 if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt; 537 saved_tt = tt; x = xx; 538 } else { 539 (tt = treenodes)->rn_dupedkey = t->rn_dupedkey; 540 t->rn_dupedkey = tt; 541 } 542 #ifdef RN_DEBUG 543 t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++; 544 tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt; 545 #endif 546 tt->rn_key = (caddr_t) v; 547 tt->rn_b = -1; 548 tt->rn_flags = RNF_ACTIVE; 549 } 550 /* 551 * Put mask in tree. 552 */ 553 if (netmask) { 554 tt->rn_mask = netmask; 555 tt->rn_b = x->rn_b; 556 tt->rn_flags = x->rn_flags; 557 } 558 t = saved_tt->rn_p; 559 if (keyduplicated) 560 goto on2; 561 b_leaf = -1 - t->rn_b; 562 if (t->rn_r == saved_tt) x = t->rn_l; else x = t->rn_r; 563 /* Promote general routes from below */ 564 if (x->rn_b < 0) { 565 for (mp = &t->rn_mklist; x; x = x->rn_dupedkey) 566 if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) { 567 if (*mp = m = rn_new_radix_mask(x, 0)) 568 mp = &m->rm_mklist; 569 } 570 } else if (x->rn_mklist) { 571 /* 572 * Skip over masks whose index is > that of new node 573 */ 574 for (mp = &x->rn_mklist; m = *mp; mp = &m->rm_mklist) 575 if (m->rm_b >= b_leaf) 576 break; 577 t->rn_mklist = m; *mp = 0; 578 } 579 on2: 580 /* Add new route to highest possible ancestor's list */ 581 if ((netmask == 0) || (b > t->rn_b )) 582 return tt; /* can't lift at all */ 583 b_leaf = tt->rn_b; 584 do { 585 x = t; 586 t = t->rn_p; 587 } while (b <= t->rn_b && x != top); 588 /* 589 * Search through routes associated with node to 590 * insert new route according to index. 591 * Need same criteria as when sorting dupedkeys to avoid 592 * double loop on deletion. 593 */ 594 for (mp = &x->rn_mklist; m = *mp; mp = &m->rm_mklist) { 595 if (m->rm_b < b_leaf) 596 continue; 597 if (m->rm_b > b_leaf) 598 break; 599 if (m->rm_flags & RNF_NORMAL) { 600 mmask = m->rm_leaf->rn_mask; 601 if (tt->rn_flags & RNF_NORMAL) { 602 log(LOG_ERR, 603 "Non-unique normal route, mask not entered"); 604 return tt; 605 } 606 } else 607 mmask = m->rm_mask; 608 if (mmask == netmask) { 609 m->rm_refs++; 610 tt->rn_mklist = m; 611 return tt; 612 } 613 if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask)) 614 break; 615 } 616 *mp = rn_new_radix_mask(tt, *mp); 617 return tt; 618 } 619 620 struct radix_node * 621 rn_delete(v_arg, netmask_arg, head) 622 void *v_arg, *netmask_arg; 623 struct radix_node_head *head; 624 { 625 register struct radix_node *t, *p, *x, *tt; 626 struct radix_mask *m, *saved_m, **mp; 627 struct radix_node *dupedkey, *saved_tt, *top; 628 caddr_t v, netmask; 629 int b, head_off, vlen; 630 631 v = v_arg; 632 netmask = netmask_arg; 633 x = head->rnh_treetop; 634 tt = rn_search(v, x); 635 head_off = x->rn_off; 636 vlen = *(u_char *)v; 637 saved_tt = tt; 638 top = x; 639 if (tt == 0 || 640 Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off)) 641 return (0); 642 /* 643 * Delete our route from mask lists. 644 */ 645 if (netmask) { 646 if ((x = rn_addmask(netmask, 1, head_off)) == 0) 647 return (0); 648 netmask = x->rn_key; 649 while (tt->rn_mask != netmask) 650 if ((tt = tt->rn_dupedkey) == 0) 651 return (0); 652 } 653 if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0) 654 goto on1; 655 if (tt->rn_flags & RNF_NORMAL) { 656 if (m->rm_leaf != tt || m->rm_refs > 0) { 657 log(LOG_ERR, "rn_delete: inconsistent annotation\n"); 658 return 0; /* dangling ref could cause disaster */ 659 } 660 } else { 661 if (m->rm_mask != tt->rn_mask) { 662 log(LOG_ERR, "rn_delete: inconsistent annotation\n"); 663 goto on1; 664 } 665 if (--m->rm_refs >= 0) 666 goto on1; 667 } 668 b = -1 - tt->rn_b; 669 t = saved_tt->rn_p; 670 if (b > t->rn_b) 671 goto on1; /* Wasn't lifted at all */ 672 do { 673 x = t; 674 t = t->rn_p; 675 } while (b <= t->rn_b && x != top); 676 for (mp = &x->rn_mklist; m = *mp; mp = &m->rm_mklist) 677 if (m == saved_m) { 678 *mp = m->rm_mklist; 679 MKFree(m); 680 break; 681 } 682 if (m == 0) { 683 log(LOG_ERR, "rn_delete: couldn't find our annotation\n"); 684 if (tt->rn_flags & RNF_NORMAL) 685 return (0); /* Dangling ref to us */ 686 } 687 on1: 688 /* 689 * Eliminate us from tree 690 */ 691 if (tt->rn_flags & RNF_ROOT) 692 return (0); 693 #ifdef RN_DEBUG 694 /* Get us out of the creation list */ 695 for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {} 696 if (t) t->rn_ybro = tt->rn_ybro; 697 #endif 698 t = tt->rn_p; 699 if (dupedkey = saved_tt->rn_dupedkey) { 700 if (tt == saved_tt) { 701 x = dupedkey; x->rn_p = t; 702 if (t->rn_l == tt) t->rn_l = x; else t->rn_r = x; 703 } else { 704 for (x = p = saved_tt; p && p->rn_dupedkey != tt;) 705 p = p->rn_dupedkey; 706 if (p) p->rn_dupedkey = tt->rn_dupedkey; 707 else log(LOG_ERR, "rn_delete: couldn't find us\n"); 708 } 709 t = tt + 1; 710 if (t->rn_flags & RNF_ACTIVE) { 711 #ifndef RN_DEBUG 712 *++x = *t; p = t->rn_p; 713 #else 714 b = t->rn_info; *++x = *t; t->rn_info = b; p = t->rn_p; 715 #endif 716 if (p->rn_l == t) p->rn_l = x; else p->rn_r = x; 717 x->rn_l->rn_p = x; x->rn_r->rn_p = x; 718 } 719 goto out; 720 } 721 if (t->rn_l == tt) x = t->rn_r; else x = t->rn_l; 722 p = t->rn_p; 723 if (p->rn_r == t) p->rn_r = x; else p->rn_l = x; 724 x->rn_p = p; 725 /* 726 * Demote routes attached to us. 727 */ 728 if (t->rn_mklist) { 729 if (x->rn_b >= 0) { 730 for (mp = &x->rn_mklist; m = *mp;) 731 mp = &m->rm_mklist; 732 *mp = t->rn_mklist; 733 } else { 734 /* If there are any key,mask pairs in a sibling 735 duped-key chain, some subset will appear sorted 736 in the same order attached to our mklist */ 737 for (m = t->rn_mklist; m && x; x = x->rn_dupedkey) 738 if (m == x->rn_mklist) { 739 struct radix_mask *mm = m->rm_mklist; 740 x->rn_mklist = 0; 741 if (--(m->rm_refs) < 0) 742 MKFree(m); 743 m = mm; 744 } 745 if (m) 746 log(LOG_ERR, "%s %x at %x\n", 747 "rn_delete: Orphaned Mask", m, x); 748 } 749 } 750 /* 751 * We may be holding an active internal node in the tree. 752 */ 753 x = tt + 1; 754 if (t != x) { 755 #ifndef RN_DEBUG 756 *t = *x; 757 #else 758 b = t->rn_info; *t = *x; t->rn_info = b; 759 #endif 760 t->rn_l->rn_p = t; t->rn_r->rn_p = t; 761 p = x->rn_p; 762 if (p->rn_l == x) p->rn_l = t; else p->rn_r = t; 763 } 764 out: 765 tt->rn_flags &= ~RNF_ACTIVE; 766 tt[1].rn_flags &= ~RNF_ACTIVE; 767 return (tt); 768 } 769 770 int 771 rn_walktree(h, f, w) 772 struct radix_node_head *h; 773 register int (*f)(); 774 void *w; 775 { 776 int error; 777 struct radix_node *base, *next; 778 register struct radix_node *rn = h->rnh_treetop; 779 /* 780 * This gets complicated because we may delete the node 781 * while applying the function f to it, so we need to calculate 782 * the successor node in advance. 783 */ 784 /* First time through node, go left */ 785 while (rn->rn_b >= 0) 786 rn = rn->rn_l; 787 for (;;) { 788 base = rn; 789 /* If at right child go back up, otherwise, go right */ 790 while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0) 791 rn = rn->rn_p; 792 /* Find the next *leaf* since next node might vanish, too */ 793 for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;) 794 rn = rn->rn_l; 795 next = rn; 796 /* Process leaves */ 797 while (rn = base) { 798 base = rn->rn_dupedkey; 799 if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w))) 800 return (error); 801 } 802 rn = next; 803 if (rn->rn_flags & RNF_ROOT) 804 return (0); 805 } 806 /* NOTREACHED */ 807 } 808 809 int 810 rn_inithead(head, off) 811 void **head; 812 int off; 813 { 814 register struct radix_node_head *rnh; 815 register struct radix_node *t, *tt, *ttt; 816 if (*head) 817 return (1); 818 R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh)); 819 if (rnh == 0) 820 return (0); 821 Bzero(rnh, sizeof (*rnh)); 822 *head = rnh; 823 t = rn_newpair(rn_zeros, off, rnh->rnh_nodes); 824 ttt = rnh->rnh_nodes + 2; 825 t->rn_r = ttt; 826 t->rn_p = t; 827 tt = t->rn_l; 828 tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE; 829 tt->rn_b = -1 - off; 830 *ttt = *tt; 831 ttt->rn_key = rn_ones; 832 rnh->rnh_addaddr = rn_addroute; 833 rnh->rnh_deladdr = rn_delete; 834 rnh->rnh_matchaddr = rn_match; 835 rnh->rnh_lookup = rn_lookup; 836 rnh->rnh_walktree = rn_walktree; 837 rnh->rnh_treetop = t; 838 return (1); 839 } 840 841 void 842 rn_init() 843 { 844 char *cp, *cplim; 845 #ifdef KERNEL 846 struct domain *dom; 847 848 for (dom = domains; dom; dom = dom->dom_next) 849 if (dom->dom_maxrtkey > max_keylen) 850 max_keylen = dom->dom_maxrtkey; 851 #endif 852 if (max_keylen == 0) { 853 log(LOG_ERR, 854 "rn_init: radix functions require max_keylen be set\n"); 855 return; 856 } 857 R_Malloc(rn_zeros, char *, 3 * max_keylen); 858 if (rn_zeros == NULL) 859 panic("rn_init"); 860 Bzero(rn_zeros, 3 * max_keylen); 861 rn_ones = cp = rn_zeros + max_keylen; 862 addmask_key = cplim = rn_ones + max_keylen; 863 while (cp < cplim) 864 *cp++ = -1; 865 if (rn_inithead((void **)&mask_rnhead, 0) == 0) 866 panic("rn_init 2"); 867 } 868