1331722Seadler/* 218316Swollman * Copyright (c) 1988, 1989, 1993 318316Swollman * The Regents of the University of California. All rights reserved. 418316Swollman * 518316Swollman * Redistribution and use in source and binary forms, with or without 618316Swollman * modification, are permitted provided that the following conditions 718316Swollman * are met: 818316Swollman * 1. Redistributions of source code must retain the above copyright 918316Swollman * notice, this list of conditions and the following disclaimer. 1018316Swollman * 2. Redistributions in binary form must reproduce the above copyright 1118316Swollman * notice, this list of conditions and the following disclaimer in the 1218316Swollman * documentation and/or other materials provided with the distribution. 1318316Swollman * 4. Neither the name of the University nor the names of its contributors 1418316Swollman * may be used to endorse or promote products derived from this software 1518316Swollman * without specific prior written permission. 1618316Swollman * 1718316Swollman * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 1818316Swollman * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1918316Swollman * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2018316Swollman * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2118316Swollman * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2218316Swollman * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2318316Swollman * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2418316Swollman * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2518316Swollman * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2618316Swollman * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2718316Swollman * SUCH DAMAGE. 2818316Swollman * 2946303Smarkm * @(#)radix.c 8.4 (Berkeley) 11/2/94 3046303Smarkm * 3150476Speter * $FreeBSD$ 3218316Swollman */ 3318316Swollman 3418316Swollman/* 3518316Swollman * Routines to build and maintain radix trees for routing lookups. 3618316Swollman */ 3718316Swollman 3818316Swollman#include "defs.h" 3918316Swollman 40126250Sbms#ifdef __NetBSD__ 4146303Smarkm__RCSID("$NetBSD$"); 42126250Sbms#elif defined(__FreeBSD__) 43126250Sbms__RCSID("$FreeBSD$"); 44126250Sbms#else 45126250Sbms__RCSID("$Revision: 2.23 $"); 46126250Sbms#ident "$Revision: 2.23 $" 4746303Smarkm#endif 4846303Smarkm 4918316Swollman#define log(x, msg) syslog(x, msg) 5018316Swollman#define panic(s) {log(LOG_ERR,s); exit(1);} 5118316Swollman#define min(a,b) (((a)<(b))?(a):(b)) 5218316Swollman 5318316Swollmanint max_keylen; 54190715Sphkstatic struct radix_mask *rn_mkfreelist; 55190715Sphkstatic struct radix_node_head *mask_rnhead; 5618316Swollmanstatic char *addmask_key; 57190718Sphkstatic const uint8_t normal_chars[] = 58190715Sphk { 0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, 0xff}; 5918316Swollmanstatic char *rn_zeros, *rn_ones; 6018316Swollman 6118316Swollman#define rn_masktop (mask_rnhead->rnh_treetop) 6246303Smarkm#define Bcmp(a, b, l) (l == 0 ? 0 \ 6346303Smarkm : memcmp((caddr_t)(a), (caddr_t)(b), (size_t)l)) 6418316Swollman 6546303Smarkmstatic int rn_satisfies_leaf(char *, struct radix_node *, int); 66190715Sphkstatic struct radix_node *rn_addmask(void *n_arg, int search, int skip); 67190715Sphkstatic struct radix_node *rn_addroute(void *v_arg, void *n_arg, 68190715Sphk struct radix_node_head *head, struct radix_node treenodes[2]); 69190715Sphkstatic struct radix_node *rn_match(void *v_arg, struct radix_node_head *head); 7018316Swollman 7118316Swollman/* 7218316Swollman * The data structure for the keys is a radix tree with one way 7318316Swollman * branching removed. The index rn_b at an internal node n represents a bit 7418316Swollman * position to be tested. The tree is arranged so that all descendants 7518316Swollman * of a node n have keys whose bits all agree up to position rn_b - 1. 7618316Swollman * (We say the index of n is rn_b.) 7718316Swollman * 7818316Swollman * There is at least one descendant which has a one bit at position rn_b, 7918316Swollman * and at least one with a zero there. 8018316Swollman * 8118316Swollman * A route is determined by a pair of key and mask. We require that the 8218316Swollman * bit-wise logical and of the key and mask to be the key. 8318316Swollman * We define the index of a route to associated with the mask to be 8418316Swollman * the first bit number in the mask where 0 occurs (with bit number 0 8518316Swollman * representing the highest order bit). 8618316Swollman * 8718316Swollman * We say a mask is normal if every bit is 0, past the index of the mask. 8818316Swollman * If a node n has a descendant (k, m) with index(m) == index(n) == rn_b, 8918316Swollman * and m is a normal mask, then the route applies to every descendant of n. 9018316Swollman * If the index(m) < rn_b, this implies the trailing last few bits of k 9118316Swollman * before bit b are all 0, (and hence consequently true of every descendant 9218316Swollman * of n), so the route applies to all descendants of the node as well. 9318316Swollman * 9418316Swollman * Similar logic shows that a non-normal mask m such that 9518316Swollman * index(m) <= index(n) could potentially apply to many children of n. 9618316Swollman * Thus, for each non-host route, we attach its mask to a list at an internal 9718316Swollman * node as high in the tree as we can go. 9818316Swollman * 9918316Swollman * The present version of the code makes use of normal routes in short- 100229778Suqs * circuiting an explicit mask and compare operation when testing whether 10118316Swollman * a key satisfies a normal route, and also in remembering the unique leaf 10218316Swollman * that governs a subtree. 10318316Swollman */ 10418316Swollman 105190715Sphkstatic struct radix_node * 10618316Swollmanrn_search(void *v_arg, 10718316Swollman struct radix_node *head) 10818316Swollman{ 10946303Smarkm struct radix_node *x; 11046303Smarkm caddr_t v; 11118316Swollman 11218316Swollman for (x = head, v = v_arg; x->rn_b >= 0;) { 11318316Swollman if (x->rn_bmask & v[x->rn_off]) 11418316Swollman x = x->rn_r; 11518316Swollman else 11618316Swollman x = x->rn_l; 11718316Swollman } 11818316Swollman return (x); 11918316Swollman} 12018316Swollman 121190715Sphkstatic struct radix_node * 12218316Swollmanrn_search_m(void *v_arg, 12318316Swollman struct radix_node *head, 12418316Swollman void *m_arg) 12518316Swollman{ 12646303Smarkm struct radix_node *x; 12746303Smarkm caddr_t v = v_arg, m = m_arg; 12818316Swollman 12918316Swollman for (x = head; x->rn_b >= 0;) { 13018316Swollman if ((x->rn_bmask & m[x->rn_off]) && 13118316Swollman (x->rn_bmask & v[x->rn_off])) 13218316Swollman x = x->rn_r; 13318316Swollman else 13418316Swollman x = x->rn_l; 13518316Swollman } 13618316Swollman return x; 13718316Swollman} 13818316Swollman 139190715Sphkstatic int 14018316Swollmanrn_refines(void* m_arg, void *n_arg) 14118316Swollman{ 14246303Smarkm caddr_t m = m_arg, n = n_arg; 14346303Smarkm caddr_t lim, lim2 = lim = n + *(u_char *)n; 14418316Swollman int longer = (*(u_char *)n++) - (int)(*(u_char *)m++); 14518316Swollman int masks_are_equal = 1; 14618316Swollman 14718316Swollman if (longer > 0) 14818316Swollman lim -= longer; 14918316Swollman while (n < lim) { 15018316Swollman if (*n & ~(*m)) 15118316Swollman return 0; 15218316Swollman if (*n++ != *m++) 15318316Swollman masks_are_equal = 0; 15418316Swollman } 15518316Swollman while (n < lim2) 15618316Swollman if (*n++) 15718316Swollman return 0; 15818316Swollman if (masks_are_equal && (longer < 0)) 15918316Swollman for (lim2 = m - longer; m < lim2; ) 16018316Swollman if (*m++) 16118316Swollman return 1; 16218316Swollman return (!masks_are_equal); 16318316Swollman} 16418316Swollman 165190715Sphkstatic struct radix_node * 16646303Smarkmrn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head) 16718316Swollman{ 16846303Smarkm struct radix_node *x; 16918316Swollman caddr_t netmask = 0; 17018316Swollman 17118316Swollman if (m_arg) { 172299768Spfg if ((x = rn_addmask(m_arg, 1, 173299768Spfg head->rnh_treetop->rn_off)) == NULL) 17418316Swollman return (0); 17518316Swollman netmask = x->rn_key; 17618316Swollman } 17718316Swollman x = rn_match(v_arg, head); 17818316Swollman if (x && netmask) { 17918316Swollman while (x && x->rn_mask != netmask) 18018316Swollman x = x->rn_dupedkey; 18118316Swollman } 18218316Swollman return x; 18318316Swollman} 18418316Swollman 18518316Swollmanstatic int 18646303Smarkmrn_satisfies_leaf(char *trial, 18746303Smarkm struct radix_node *leaf, 18818316Swollman int skip) 18918316Swollman{ 19046303Smarkm char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask; 19118316Swollman char *cplim; 19218316Swollman int length = min(*(u_char *)cp, *(u_char *)cp2); 19318316Swollman 194299768Spfg if (cp3 == NULL) 19518316Swollman cp3 = rn_ones; 19618316Swollman else 19718316Swollman length = min(length, *(u_char *)cp3); 19818316Swollman cplim = cp + length; cp3 += skip; cp2 += skip; 19918316Swollman for (cp += skip; cp < cplim; cp++, cp2++, cp3++) 20018316Swollman if ((*cp ^ *cp2) & *cp3) 20118316Swollman return 0; 20218316Swollman return 1; 20318316Swollman} 20418316Swollman 205190715Sphkstatic struct radix_node * 20618316Swollmanrn_match(void *v_arg, 20718316Swollman struct radix_node_head *head) 20818316Swollman{ 20918316Swollman caddr_t v = v_arg; 21046303Smarkm struct radix_node *t = head->rnh_treetop, *x; 21146303Smarkm caddr_t cp = v, cp2; 21218316Swollman caddr_t cplim; 21318316Swollman struct radix_node *saved_t, *top = t; 21418316Swollman int off = t->rn_off, vlen = *(u_char *)cp, matched_off; 21546303Smarkm int test, b, rn_b; 21618316Swollman 21718316Swollman /* 21818316Swollman * Open code rn_search(v, top) to avoid overhead of extra 21918316Swollman * subroutine call. 22018316Swollman */ 22118316Swollman for (; t->rn_b >= 0; ) { 22218316Swollman if (t->rn_bmask & cp[t->rn_off]) 22318316Swollman t = t->rn_r; 22418316Swollman else 22518316Swollman t = t->rn_l; 22618316Swollman } 22718316Swollman /* 22818316Swollman * See if we match exactly as a host destination 22918316Swollman * or at least learn how many bits match, for normal mask finesse. 23018316Swollman * 23118316Swollman * It doesn't hurt us to limit how many bytes to check 23218316Swollman * to the length of the mask, since if it matches we had a genuine 23318316Swollman * match and the leaf we have is the most specific one anyway; 23418316Swollman * if it didn't match with a shorter length it would fail 23518316Swollman * with a long one. This wins big for class B&C netmasks which 23618316Swollman * are probably the most common case... 23718316Swollman */ 23818316Swollman if (t->rn_mask) 23918316Swollman vlen = *(u_char *)t->rn_mask; 24018316Swollman cp += off; cp2 = t->rn_key + off; cplim = v + vlen; 24118316Swollman for (; cp < cplim; cp++, cp2++) 24218316Swollman if (*cp != *cp2) 24318316Swollman goto on1; 24418316Swollman /* 24518316Swollman * This extra grot is in case we are explicitly asked 24618316Swollman * to look up the default. Ugh! 24718316Swollman * Or 255.255.255.255 24818316Swollman * 24918316Swollman * In this case, we have a complete match of the key. Unless 25018316Swollman * the node is one of the roots, we are finished. 251229778Suqs * If it is the zeros root, then take what we have, preferring 25218316Swollman * any real data. 25318316Swollman * If it is the ones root, then pretend the target key was followed 25418316Swollman * by a byte of zeros. 25518316Swollman */ 25618316Swollman if (!(t->rn_flags & RNF_ROOT)) 25718316Swollman return t; /* not a root */ 25818316Swollman if (t->rn_dupedkey) { 25918316Swollman t = t->rn_dupedkey; 26018316Swollman return t; /* have some real data */ 26118316Swollman } 26218316Swollman if (*(cp-1) == 0) 26318316Swollman return t; /* not the ones root */ 26418316Swollman b = 0; /* fake a zero after 255.255.255.255 */ 26518316Swollman goto on2; 26618316Swollmanon1: 26718316Swollman test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */ 26818316Swollman for (b = 7; (test >>= 1) > 0;) 26918316Swollman b--; 27018316Swollmanon2: 27118316Swollman matched_off = cp - v; 27218316Swollman b += matched_off << 3; 27318316Swollman rn_b = -1 - b; 27418316Swollman /* 27518316Swollman * If there is a host route in a duped-key chain, it will be first. 27618316Swollman */ 27718316Swollman if ((saved_t = t)->rn_mask == 0) 27818316Swollman t = t->rn_dupedkey; 27946303Smarkm for (; t; t = t->rn_dupedkey) { 28018316Swollman /* 28118316Swollman * Even if we don't match exactly as a host, 28218316Swollman * we may match if the leaf we wound up at is 28318316Swollman * a route to a net. 28418316Swollman */ 28518316Swollman if (t->rn_flags & RNF_NORMAL) { 28618316Swollman if (rn_b <= t->rn_b) 28718316Swollman return t; 28846303Smarkm } else if (rn_satisfies_leaf(v, t, matched_off)) { 28946303Smarkm return t; 29046303Smarkm } 29146303Smarkm } 29218316Swollman t = saved_t; 29318316Swollman /* start searching up the tree */ 29418316Swollman do { 29546303Smarkm struct radix_mask *m; 29618316Swollman t = t->rn_p; 29718316Swollman if ((m = t->rn_mklist)) { 29818316Swollman /* 29918316Swollman * If non-contiguous masks ever become important 30018316Swollman * we can restore the masking and open coding of 30118316Swollman * the search and satisfaction test and put the 30218316Swollman * calculation of "off" back before the "do". 30318316Swollman */ 30418316Swollman do { 30518316Swollman if (m->rm_flags & RNF_NORMAL) { 30618316Swollman if (rn_b <= m->rm_b) 30718316Swollman return (m->rm_leaf); 30818316Swollman } else { 30918316Swollman off = min(t->rn_off, matched_off); 31018316Swollman x = rn_search_m(v, t, m->rm_mask); 31118316Swollman while (x && x->rn_mask != m->rm_mask) 31218316Swollman x = x->rn_dupedkey; 31346303Smarkm if (x && rn_satisfies_leaf(v, x, off)) 31418316Swollman return x; 31518316Swollman } 31618316Swollman } while ((m = m->rm_mklist)); 31718316Swollman } 31818316Swollman } while (t != top); 31918316Swollman return 0; 32018316Swollman} 32118316Swollman 32218316Swollman#ifdef RN_DEBUG 32318316Swollmanint rn_nodenum; 32418316Swollmanstruct radix_node *rn_clist; 32518316Swollmanint rn_saveinfo; 32618316Swollmanint rn_debug = 1; 32718316Swollman#endif 32818316Swollman 329190715Sphkstatic struct radix_node * 33018316Swollmanrn_newpair(void *v, int b, struct radix_node nodes[2]) 33118316Swollman{ 33246303Smarkm struct radix_node *tt = nodes, *t = tt + 1; 33318316Swollman t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7); 33418316Swollman t->rn_l = tt; t->rn_off = b >> 3; 33518316Swollman tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t; 33618316Swollman tt->rn_flags = t->rn_flags = RNF_ACTIVE; 33718316Swollman#ifdef RN_DEBUG 33818316Swollman tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++; 33918316Swollman tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt; 34018316Swollman#endif 34118316Swollman return t; 34218316Swollman} 34318316Swollman 344190715Sphkstatic struct radix_node * 34518316Swollmanrn_insert(void* v_arg, 34618316Swollman struct radix_node_head *head, 34718316Swollman int *dupentry, 34818316Swollman struct radix_node nodes[2]) 34918316Swollman{ 35018316Swollman caddr_t v = v_arg; 35118316Swollman struct radix_node *top = head->rnh_treetop; 35218316Swollman int head_off = top->rn_off, vlen = (int)*((u_char *)v); 35346303Smarkm struct radix_node *t = rn_search(v_arg, top); 35446303Smarkm caddr_t cp = v + head_off; 35546303Smarkm int b; 35618316Swollman struct radix_node *tt; 35718316Swollman 35818316Swollman /* 35918316Swollman * Find first bit at which v and t->rn_key differ 36018316Swollman */ 36118316Swollman { 36246303Smarkm caddr_t cp2 = t->rn_key + head_off; 36346303Smarkm int cmp_res; 36418316Swollman caddr_t cplim = v + vlen; 36518316Swollman 36618316Swollman while (cp < cplim) 36718316Swollman if (*cp2++ != *cp++) 36818316Swollman goto on1; 36918316Swollman /* handle adding 255.255.255.255 */ 37018316Swollman if (!(t->rn_flags & RNF_ROOT) || *(cp2-1) == 0) { 37118316Swollman *dupentry = 1; 37218316Swollman return t; 37318316Swollman } 37418316Swollmanon1: 37518316Swollman *dupentry = 0; 37618316Swollman cmp_res = (cp[-1] ^ cp2[-1]) & 0xff; 37718316Swollman for (b = (cp - v) << 3; cmp_res; b--) 37818316Swollman cmp_res >>= 1; 37918316Swollman } 38018316Swollman { 38146303Smarkm struct radix_node *p, *x = top; 38218316Swollman cp = v; 38318316Swollman do { 38418316Swollman p = x; 38518316Swollman if (cp[x->rn_off] & x->rn_bmask) 38618316Swollman x = x->rn_r; 38718316Swollman else x = x->rn_l; 38846303Smarkm } while ((unsigned)b > (unsigned)x->rn_b); 38918316Swollman#ifdef RN_DEBUG 39018316Swollman if (rn_debug) 39118316Swollman log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p); 39218316Swollman#endif 39318316Swollman t = rn_newpair(v_arg, b, nodes); tt = t->rn_l; 39418316Swollman if ((cp[p->rn_off] & p->rn_bmask) == 0) 39518316Swollman p->rn_l = t; 39618316Swollman else 39718316Swollman p->rn_r = t; 39818316Swollman x->rn_p = t; t->rn_p = p; /* frees x, p as temp vars below */ 39918316Swollman if ((cp[t->rn_off] & t->rn_bmask) == 0) { 40018316Swollman t->rn_r = x; 40118316Swollman } else { 40218316Swollman t->rn_r = tt; t->rn_l = x; 40318316Swollman } 40418316Swollman#ifdef RN_DEBUG 40518316Swollman if (rn_debug) 40618316Swollman log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p); 40718316Swollman#endif 40818316Swollman } 40918316Swollman return (tt); 41018316Swollman} 41118316Swollman 412190715Sphkstatic struct radix_node * 41318316Swollmanrn_addmask(void *n_arg, int search, int skip) 41418316Swollman{ 41518316Swollman caddr_t netmask = (caddr_t)n_arg; 41646303Smarkm struct radix_node *x; 41746303Smarkm caddr_t cp, cplim; 41846303Smarkm int b = 0, mlen, j; 41918316Swollman int maskduplicated, m0, isnormal; 42018316Swollman struct radix_node *saved_x; 42118316Swollman static int last_zeroed = 0; 42218316Swollman 42318316Swollman if ((mlen = *(u_char *)netmask) > max_keylen) 42418316Swollman mlen = max_keylen; 42518316Swollman if (skip == 0) 42618316Swollman skip = 1; 42718316Swollman if (mlen <= skip) 42818316Swollman return (mask_rnhead->rnh_nodes); 42918316Swollman if (skip > 1) 43018316Swollman Bcopy(rn_ones + 1, addmask_key + 1, skip - 1); 43118316Swollman if ((m0 = mlen) > skip) 43218316Swollman Bcopy(netmask + skip, addmask_key + skip, mlen - skip); 43318316Swollman /* 43418316Swollman * Trim trailing zeroes. 43518316Swollman */ 43618316Swollman for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;) 43718316Swollman cp--; 43818316Swollman mlen = cp - addmask_key; 43918316Swollman if (mlen <= skip) { 44018316Swollman if (m0 >= last_zeroed) 44118316Swollman last_zeroed = mlen; 44218316Swollman return (mask_rnhead->rnh_nodes); 44318316Swollman } 44418316Swollman if (m0 < last_zeroed) 44518316Swollman Bzero(addmask_key + m0, last_zeroed - m0); 44618316Swollman *addmask_key = last_zeroed = mlen; 44718316Swollman x = rn_search(addmask_key, rn_masktop); 44818316Swollman if (Bcmp(addmask_key, x->rn_key, mlen) != 0) 449299768Spfg x = NULL; 45018316Swollman if (x || search) 45118316Swollman return (x); 45246303Smarkm x = (struct radix_node *)rtmalloc(max_keylen + 2*sizeof(*x), 45346303Smarkm "rn_addmask"); 45446303Smarkm saved_x = x; 45518316Swollman Bzero(x, max_keylen + 2 * sizeof (*x)); 45618316Swollman netmask = cp = (caddr_t)(x + 2); 45718316Swollman Bcopy(addmask_key, cp, mlen); 45818316Swollman x = rn_insert(cp, mask_rnhead, &maskduplicated, x); 45918316Swollman if (maskduplicated) { 46018316Swollman log(LOG_ERR, "rn_addmask: mask impossibly already in tree"); 46118316Swollman Free(saved_x); 46218316Swollman return (x); 46318316Swollman } 46418316Swollman /* 46518316Swollman * Calculate index of mask, and check for normalcy. 46618316Swollman */ 46718316Swollman cplim = netmask + mlen; isnormal = 1; 46818316Swollman for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;) 46918316Swollman cp++; 47018316Swollman if (cp != cplim) { 47118316Swollman for (j = 0x80; (j & *cp) != 0; j >>= 1) 47218316Swollman b++; 47318316Swollman if (*cp != normal_chars[b] || cp != (cplim - 1)) 47418316Swollman isnormal = 0; 47518316Swollman } 47618316Swollman b += (cp - netmask) << 3; 47718316Swollman x->rn_b = -1 - b; 47818316Swollman if (isnormal) 47918316Swollman x->rn_flags |= RNF_NORMAL; 48018316Swollman return (x); 48118316Swollman} 48218316Swollman 48318316Swollmanstatic int /* XXX: arbitrary ordering for non-contiguous masks */ 48418316Swollmanrn_lexobetter(void *m_arg, void *n_arg) 48518316Swollman{ 48646303Smarkm u_char *mp = m_arg, *np = n_arg, *lim; 48718316Swollman 48818316Swollman if (*mp > *np) 48918316Swollman return 1; /* not really, but need to check longer one first */ 49018316Swollman if (*mp == *np) 49118316Swollman for (lim = mp + *mp; mp < lim;) 49218316Swollman if (*mp++ > *np++) 49318316Swollman return 1; 49418316Swollman return 0; 49518316Swollman} 49618316Swollman 49718316Swollmanstatic struct radix_mask * 49846303Smarkmrn_new_radix_mask(struct radix_node *tt, 49946303Smarkm struct radix_mask *next) 50018316Swollman{ 50146303Smarkm struct radix_mask *m; 50218316Swollman 50318316Swollman MKGet(m); 504299768Spfg if (m == NULL) { 50518316Swollman log(LOG_ERR, "Mask for route not entered\n"); 50618316Swollman return (0); 50718316Swollman } 50818316Swollman Bzero(m, sizeof *m); 50918316Swollman m->rm_b = tt->rn_b; 51018316Swollman m->rm_flags = tt->rn_flags; 51118316Swollman if (tt->rn_flags & RNF_NORMAL) 51218316Swollman m->rm_leaf = tt; 51318316Swollman else 51418316Swollman m->rm_mask = tt->rn_mask; 51518316Swollman m->rm_mklist = next; 51618316Swollman tt->rn_mklist = m; 51718316Swollman return m; 51818316Swollman} 51918316Swollman 520190715Sphkstatic struct radix_node * 52118316Swollmanrn_addroute(void *v_arg, 52218316Swollman void *n_arg, 52318316Swollman struct radix_node_head *head, 52418316Swollman struct radix_node treenodes[2]) 52518316Swollman{ 52618316Swollman caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg; 527299768Spfg struct radix_node *t, *x = NULL, *tt; 52818316Swollman struct radix_node *saved_tt, *top = head->rnh_treetop; 52918316Swollman short b = 0, b_leaf = 0; 53018316Swollman int keyduplicated; 53118316Swollman caddr_t mmask; 53218316Swollman struct radix_mask *m, **mp; 53318316Swollman 53418316Swollman /* 53518316Swollman * In dealing with non-contiguous masks, there may be 53618316Swollman * many different routes which have the same mask. 53718316Swollman * We will find it useful to have a unique pointer to 53818316Swollman * the mask to speed avoiding duplicate references at 53918316Swollman * nodes and possibly save time in calculating indices. 54018316Swollman */ 54118316Swollman if (netmask) { 542299768Spfg if ((x = rn_addmask(netmask, 0, top->rn_off)) == NULL) 54318316Swollman return (0); 54418316Swollman b_leaf = x->rn_b; 54518316Swollman b = -1 - x->rn_b; 54618316Swollman netmask = x->rn_key; 54718316Swollman } 54818316Swollman /* 54918316Swollman * Deal with duplicated keys: attach node to previous instance 55018316Swollman */ 55118316Swollman saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes); 55218316Swollman if (keyduplicated) { 55318316Swollman for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) { 55418316Swollman if (tt->rn_mask == netmask) 55518316Swollman return (0); 55618316Swollman if (netmask == 0 || 55718316Swollman (tt->rn_mask && 55818316Swollman ((b_leaf < tt->rn_b) || /* index(netmask) > node */ 55918316Swollman rn_refines(netmask, tt->rn_mask) || 56018316Swollman rn_lexobetter(netmask, tt->rn_mask)))) 56118316Swollman break; 56218316Swollman } 56318316Swollman /* 56418316Swollman * If the mask is not duplicated, we wouldn't 56518316Swollman * find it among possible duplicate key entries 56618316Swollman * anyway, so the above test doesn't hurt. 56718316Swollman * 56818316Swollman * We sort the masks for a duplicated key the same way as 56918316Swollman * in a masklist -- most specific to least specific. 57018316Swollman * This may require the unfortunate nuisance of relocating 57118316Swollman * the head of the list. 57218316Swollman */ 57318316Swollman if (tt == saved_tt) { 57418316Swollman struct radix_node *xx = x; 57518316Swollman /* link in at head of list */ 57618316Swollman (tt = treenodes)->rn_dupedkey = t; 57718316Swollman tt->rn_flags = t->rn_flags; 57818316Swollman tt->rn_p = x = t->rn_p; 57918316Swollman if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt; 58018316Swollman saved_tt = tt; x = xx; 58118316Swollman } else { 58218316Swollman (tt = treenodes)->rn_dupedkey = t->rn_dupedkey; 58318316Swollman t->rn_dupedkey = tt; 58418316Swollman } 58518316Swollman#ifdef RN_DEBUG 58618316Swollman t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++; 58718316Swollman tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt; 58818316Swollman#endif 58918316Swollman tt->rn_key = (caddr_t) v; 59018316Swollman tt->rn_b = -1; 59118316Swollman tt->rn_flags = RNF_ACTIVE; 59218316Swollman } 59318316Swollman /* 59418316Swollman * Put mask in tree. 59518316Swollman */ 59618316Swollman if (netmask) { 59718316Swollman tt->rn_mask = netmask; 59818316Swollman tt->rn_b = x->rn_b; 59918316Swollman tt->rn_flags |= x->rn_flags & RNF_NORMAL; 60018316Swollman } 60118316Swollman t = saved_tt->rn_p; 60218316Swollman if (keyduplicated) 60318316Swollman goto on2; 60418316Swollman b_leaf = -1 - t->rn_b; 60518316Swollman if (t->rn_r == saved_tt) x = t->rn_l; else x = t->rn_r; 60618316Swollman /* Promote general routes from below */ 60718316Swollman if (x->rn_b < 0) { 60818316Swollman for (mp = &t->rn_mklist; x; x = x->rn_dupedkey) 60918316Swollman if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) { 61018316Swollman if ((*mp = m = rn_new_radix_mask(x, 0))) 61118316Swollman mp = &m->rm_mklist; 61218316Swollman } 61318316Swollman } else if (x->rn_mklist) { 61418316Swollman /* 61518316Swollman * Skip over masks whose index is > that of new node 61618316Swollman */ 61718316Swollman for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) 61818316Swollman if (m->rm_b >= b_leaf) 61918316Swollman break; 620299768Spfg t->rn_mklist = m; *mp = NULL; 62118316Swollman } 62218316Swollmanon2: 62318316Swollman /* Add new route to highest possible ancestor's list */ 62418316Swollman if ((netmask == 0) || (b > t->rn_b )) 62518316Swollman return tt; /* can't lift at all */ 62618316Swollman b_leaf = tt->rn_b; 62718316Swollman do { 62818316Swollman x = t; 62918316Swollman t = t->rn_p; 63018316Swollman } while (b <= t->rn_b && x != top); 63118316Swollman /* 63218316Swollman * Search through routes associated with node to 63318316Swollman * insert new route according to index. 63418316Swollman * Need same criteria as when sorting dupedkeys to avoid 63518316Swollman * double loop on deletion. 63618316Swollman */ 63718316Swollman for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) { 63818316Swollman if (m->rm_b < b_leaf) 63918316Swollman continue; 64018316Swollman if (m->rm_b > b_leaf) 64118316Swollman break; 64218316Swollman if (m->rm_flags & RNF_NORMAL) { 64318316Swollman mmask = m->rm_leaf->rn_mask; 64418316Swollman if (tt->rn_flags & RNF_NORMAL) { 64518316Swollman log(LOG_ERR, 64618316Swollman "Non-unique normal route, mask not entered"); 64718316Swollman return tt; 64818316Swollman } 64918316Swollman } else 65018316Swollman mmask = m->rm_mask; 65118316Swollman if (mmask == netmask) { 65218316Swollman m->rm_refs++; 65318316Swollman tt->rn_mklist = m; 65418316Swollman return tt; 65518316Swollman } 65618316Swollman if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask)) 65718316Swollman break; 65818316Swollman } 65918316Swollman *mp = rn_new_radix_mask(tt, *mp); 66018316Swollman return tt; 66118316Swollman} 66218316Swollman 663190715Sphkstatic struct radix_node * 66418316Swollmanrn_delete(void *v_arg, 66518316Swollman void *netmask_arg, 66618316Swollman struct radix_node_head *head) 66718316Swollman{ 66846303Smarkm struct radix_node *t, *p, *x, *tt; 66918316Swollman struct radix_mask *m, *saved_m, **mp; 67018316Swollman struct radix_node *dupedkey, *saved_tt, *top; 67118316Swollman caddr_t v, netmask; 67218316Swollman int b, head_off, vlen; 67318316Swollman 67418316Swollman v = v_arg; 67518316Swollman netmask = netmask_arg; 67618316Swollman x = head->rnh_treetop; 67718316Swollman tt = rn_search(v, x); 67818316Swollman head_off = x->rn_off; 67918316Swollman vlen = *(u_char *)v; 68018316Swollman saved_tt = tt; 68118316Swollman top = x; 682299768Spfg if (tt == NULL || 68318316Swollman Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off)) 68418316Swollman return (0); 68518316Swollman /* 68618316Swollman * Delete our route from mask lists. 68718316Swollman */ 68818316Swollman if (netmask) { 689299768Spfg if ((x = rn_addmask(netmask, 1, head_off)) == NULL) 69018316Swollman return (0); 69118316Swollman netmask = x->rn_key; 69218316Swollman while (tt->rn_mask != netmask) 693299768Spfg if ((tt = tt->rn_dupedkey) == NULL) 69418316Swollman return (0); 69518316Swollman } 696299768Spfg if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == NULL) 69718316Swollman goto on1; 69818316Swollman if (tt->rn_flags & RNF_NORMAL) { 69918316Swollman if (m->rm_leaf != tt || m->rm_refs > 0) { 70018316Swollman log(LOG_ERR, "rn_delete: inconsistent annotation\n"); 70118316Swollman return 0; /* dangling ref could cause disaster */ 70218316Swollman } 70318316Swollman } else { 70418316Swollman if (m->rm_mask != tt->rn_mask) { 70518316Swollman log(LOG_ERR, "rn_delete: inconsistent annotation\n"); 70618316Swollman goto on1; 70718316Swollman } 70818316Swollman if (--m->rm_refs >= 0) 70918316Swollman goto on1; 71018316Swollman } 71118316Swollman b = -1 - tt->rn_b; 71218316Swollman t = saved_tt->rn_p; 71318316Swollman if (b > t->rn_b) 71418316Swollman goto on1; /* Wasn't lifted at all */ 71518316Swollman do { 71618316Swollman x = t; 71718316Swollman t = t->rn_p; 71818316Swollman } while (b <= t->rn_b && x != top); 71918316Swollman for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) 72018316Swollman if (m == saved_m) { 72118316Swollman *mp = m->rm_mklist; 72218316Swollman MKFree(m); 72318316Swollman break; 72418316Swollman } 725299768Spfg if (m == NULL) { 72618316Swollman log(LOG_ERR, "rn_delete: couldn't find our annotation\n"); 72718316Swollman if (tt->rn_flags & RNF_NORMAL) 72818316Swollman return (0); /* Dangling ref to us */ 72918316Swollman } 73018316Swollmanon1: 73118316Swollman /* 73218316Swollman * Eliminate us from tree 73318316Swollman */ 73418316Swollman if (tt->rn_flags & RNF_ROOT) 73518316Swollman return (0); 73618316Swollman#ifdef RN_DEBUG 73718316Swollman /* Get us out of the creation list */ 73818316Swollman for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {} 73918316Swollman if (t) t->rn_ybro = tt->rn_ybro; 74018316Swollman#endif 74118316Swollman t = tt->rn_p; 74218316Swollman if ((dupedkey = saved_tt->rn_dupedkey)) { 74318316Swollman if (tt == saved_tt) { 74418316Swollman x = dupedkey; x->rn_p = t; 74518316Swollman if (t->rn_l == tt) t->rn_l = x; else t->rn_r = x; 74618316Swollman } else { 74718316Swollman for (x = p = saved_tt; p && p->rn_dupedkey != tt;) 74818316Swollman p = p->rn_dupedkey; 74918316Swollman if (p) p->rn_dupedkey = tt->rn_dupedkey; 75018316Swollman else log(LOG_ERR, "rn_delete: couldn't find us\n"); 75118316Swollman } 75218316Swollman t = tt + 1; 75318316Swollman if (t->rn_flags & RNF_ACTIVE) { 75418316Swollman#ifndef RN_DEBUG 75518316Swollman *++x = *t; p = t->rn_p; 75618316Swollman#else 75718316Swollman b = t->rn_info; *++x = *t; t->rn_info = b; p = t->rn_p; 75818316Swollman#endif 75918316Swollman if (p->rn_l == t) p->rn_l = x; else p->rn_r = x; 76018316Swollman x->rn_l->rn_p = x; x->rn_r->rn_p = x; 76118316Swollman } 76218316Swollman goto out; 76318316Swollman } 76418316Swollman if (t->rn_l == tt) x = t->rn_r; else x = t->rn_l; 76518316Swollman p = t->rn_p; 76618316Swollman if (p->rn_r == t) p->rn_r = x; else p->rn_l = x; 76718316Swollman x->rn_p = p; 76818316Swollman /* 76918316Swollman * Demote routes attached to us. 77018316Swollman */ 77118316Swollman if (t->rn_mklist) { 77218316Swollman if (x->rn_b >= 0) { 77318316Swollman for (mp = &x->rn_mklist; (m = *mp);) 77418316Swollman mp = &m->rm_mklist; 77518316Swollman *mp = t->rn_mklist; 77618316Swollman } else { 77718316Swollman /* If there are any key,mask pairs in a sibling 77818316Swollman duped-key chain, some subset will appear sorted 77918316Swollman in the same order attached to our mklist */ 78018316Swollman for (m = t->rn_mklist; m && x; x = x->rn_dupedkey) 78118316Swollman if (m == x->rn_mklist) { 78218316Swollman struct radix_mask *mm = m->rm_mklist; 78318316Swollman x->rn_mklist = 0; 78418316Swollman if (--(m->rm_refs) < 0) 78518316Swollman MKFree(m); 78618316Swollman m = mm; 78718316Swollman } 78818316Swollman if (m) 78946303Smarkm syslog(LOG_ERR, "%s 0x%lx at 0x%lx\n", 79018316Swollman "rn_delete: Orphaned Mask", 79118316Swollman (unsigned long)m, 79218316Swollman (unsigned long)x); 79318316Swollman } 79418316Swollman } 79518316Swollman /* 79618316Swollman * We may be holding an active internal node in the tree. 79718316Swollman */ 79818316Swollman x = tt + 1; 79918316Swollman if (t != x) { 80018316Swollman#ifndef RN_DEBUG 80118316Swollman *t = *x; 80218316Swollman#else 80318316Swollman b = t->rn_info; *t = *x; t->rn_info = b; 80418316Swollman#endif 80518316Swollman t->rn_l->rn_p = t; t->rn_r->rn_p = t; 80618316Swollman p = x->rn_p; 80718316Swollman if (p->rn_l == x) p->rn_l = t; else p->rn_r = t; 80818316Swollman } 80918316Swollmanout: 81018316Swollman tt->rn_flags &= ~RNF_ACTIVE; 81118316Swollman tt[1].rn_flags &= ~RNF_ACTIVE; 81218316Swollman return (tt); 81318316Swollman} 81418316Swollman 81518316Swollmanint 81618316Swollmanrn_walktree(struct radix_node_head *h, 81746303Smarkm int (*f)(struct radix_node *, struct walkarg *), 81818316Swollman struct walkarg *w) 81918316Swollman{ 82018316Swollman int error; 82118316Swollman struct radix_node *base, *next; 82246303Smarkm struct radix_node *rn = h->rnh_treetop; 82318316Swollman /* 82418316Swollman * This gets complicated because we may delete the node 82518316Swollman * while applying the function f to it, so we need to calculate 82618316Swollman * the successor node in advance. 82718316Swollman */ 82818316Swollman /* First time through node, go left */ 82918316Swollman while (rn->rn_b >= 0) 83018316Swollman rn = rn->rn_l; 83118316Swollman for (;;) { 83218316Swollman base = rn; 83318316Swollman /* If at right child go back up, otherwise, go right */ 83418316Swollman while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0) 83518316Swollman rn = rn->rn_p; 83618316Swollman /* Find the next *leaf* since next node might vanish, too */ 83718316Swollman for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;) 83818316Swollman rn = rn->rn_l; 83918316Swollman next = rn; 84018316Swollman /* Process leaves */ 84118316Swollman while ((rn = base)) { 84218316Swollman base = rn->rn_dupedkey; 84318316Swollman if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w))) 84418316Swollman return (error); 84518316Swollman } 84618316Swollman rn = next; 84718316Swollman if (rn->rn_flags & RNF_ROOT) 84818316Swollman return (0); 84918316Swollman } 85018316Swollman /* NOTREACHED */ 85118316Swollman} 85218316Swollman 85318316Swollmanint 854190712Sphkrn_inithead(struct radix_node_head **head, int off) 85518316Swollman{ 85646303Smarkm struct radix_node_head *rnh; 85746303Smarkm struct radix_node *t, *tt, *ttt; 85818316Swollman if (*head) 85918316Swollman return (1); 86046303Smarkm rnh = (struct radix_node_head *)rtmalloc(sizeof(*rnh), "rn_inithead"); 86118316Swollman Bzero(rnh, sizeof (*rnh)); 86218316Swollman *head = rnh; 86318316Swollman t = rn_newpair(rn_zeros, off, rnh->rnh_nodes); 86418316Swollman ttt = rnh->rnh_nodes + 2; 86518316Swollman t->rn_r = ttt; 86618316Swollman t->rn_p = t; 86718316Swollman tt = t->rn_l; 86818316Swollman tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE; 86918316Swollman tt->rn_b = -1 - off; 87018316Swollman *ttt = *tt; 87118316Swollman ttt->rn_key = rn_ones; 87218316Swollman rnh->rnh_addaddr = rn_addroute; 87318316Swollman rnh->rnh_deladdr = rn_delete; 87418316Swollman rnh->rnh_matchaddr = rn_match; 87518316Swollman rnh->rnh_lookup = rn_lookup; 87618316Swollman rnh->rnh_walktree = rn_walktree; 87718316Swollman rnh->rnh_treetop = t; 87818316Swollman return (1); 87918316Swollman} 88018316Swollman 88118316Swollmanvoid 88218316Swollmanrn_init(void) 88318316Swollman{ 88418316Swollman char *cp, *cplim; 88518316Swollman if (max_keylen == 0) { 88618316Swollman printf("rn_init: radix functions require max_keylen be set\n"); 88718316Swollman return; 88818316Swollman } 88937908Scharnier rn_zeros = (char *)rtmalloc(3 * max_keylen, "rn_init"); 89018316Swollman Bzero(rn_zeros, 3 * max_keylen); 89118316Swollman rn_ones = cp = rn_zeros + max_keylen; 89218316Swollman addmask_key = cplim = rn_ones + max_keylen; 89318316Swollman while (cp < cplim) 89418316Swollman *cp++ = -1; 895190712Sphk if (rn_inithead(&mask_rnhead, 0) == 0) 89618316Swollman panic("rn_init 2"); 89718316Swollman} 89818316Swollman 899