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