register struct radix_node *p, *x = top;	cp = v;	do {		p = x;		if (cp[x->rn_off] & x->rn_bmask) 			x = x->rn_r;		else x = x->rn_l;	} while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */#ifdef RN_DEBUG	if (rn_debug)		log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);#endif	t = rn_newpair(v_arg, b, nodes); tt = t->rn_l;	if ((cp[p->rn_off] & p->rn_bmask) == 0)		p->rn_l = t;	else		p->rn_r = t;	x->rn_p = t; t->rn_p = p; /* frees x, p as temp vars below */	if ((cp[t->rn_off] & t->rn_bmask) == 0) {		t->rn_r = x;	} else {		t->rn_r = tt; t->rn_l = x;	}#ifdef RN_DEBUG	if (rn_debug)		log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);#endif    }	return (tt);}struct radix_node *rn_addmask(n_arg, search, skip)	int search, skip;	void *n_arg;{	caddr_t netmask = (caddr_t)n_arg;	register struct radix_node *x;	register caddr_t cp, cplim;	register int b = 0, mlen, j;	int maskduplicated, m0, isnormal;	struct radix_node *saved_x;	static int last_zeroed = 0;	if ((mlen = *(u_char *)netmask) > max_keylen)		mlen = max_keylen;	if (skip == 0)		skip = 1;	if (mlen <= skip)		return (mask_rnhead->rnh_nodes);	if (skip > 1)		Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);	if ((m0 = mlen) > skip)		Bcopy(netmask + skip, addmask_key + skip, mlen - skip);	/*	 * Trim trailing zeroes.	 */	for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)		cp--;	mlen = cp - addmask_key;	if (mlen <= skip) {		if (m0 >= last_zeroed)			last_zeroed = mlen;		return (mask_rnhead->rnh_nodes);	}	if (m0 < last_zeroed)		Bzero(addmask_key + m0, last_zeroed - m0);	*addmask_key = last_zeroed = mlen;	x = rn_search(addmask_key, rn_masktop);	if (Bcmp(addmask_key, x->rn_key, mlen) != 0)		x = 0;	if (x || search)		return (x);	R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));	if ((saved_x = x) == 0)		return (0);	Bzero(x, max_keylen + 2 * sizeof (*x));	netmask = cp = (caddr_t)(x + 2);	Bcopy(addmask_key, cp, mlen);	x = rn_insert(cp, mask_rnhead, &maskduplicated, x);	if (maskduplicated) {#ifdef WV_INSTRUMENTATION#ifdef INCLUDE_WVNET    /* WV_NET_ALERT event */            WV_NET_MARKER_0 (NET_AUX_EVENT, WV_NET_ALERT, 0, 2,                             WV_NETEVENT_RNADD_BADMASK)#endif  /* INCLUDE_WVNET */#endif		logMsg("rn_addmask: mask impossibly already in tree",		       0,0,0,0,0,0);		Free(saved_x);		return (x);	}	/*	 * Calculate index of mask, and check for normalcy.	 */	cplim = netmask + mlen; isnormal = 1;	for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)		cp++;	if (cp != cplim) {		for (j = 0x80; (j & *cp) != 0; j >>= 1)  			b++;		if (*cp != normal_chars[b] || cp != (cplim - 1))			isnormal = 0;	}	b += (cp - netmask) << 3;	x->rn_b = -1 - b;	if (isnormal)		x->rn_flags |= RNF_NORMAL;	return (x);}static int	/* XXX: arbitrary ordering for non-contiguous masks */rn_lexobetter(m_arg, n_arg)	void *m_arg, *n_arg;{	register u_char *mp = m_arg, *np = n_arg, *lim;	if (*mp > *np)		return 1;  /* not really, but need to check longer one first */	if (*mp == *np) 		for (lim = mp + *mp; mp < lim;)			if (*mp++ > *np++)				return 1;	return 0;}static struct radix_mask *rn_new_radix_mask(tt, next)	register struct radix_node *tt;	register struct radix_mask *next;{	register struct radix_mask *m;	MKGet(m);	if (m == 0) {#ifdef WV_INSTRUMENTATION#ifdef INCLUDE_WVNET    /* WV_NET_ALERT event */            WV_NET_MARKER_0 (NET_AUX_EVENT, WV_NET_ALERT, 1, 3,                             WV_NETEVENT_RNADD_NOMASK)#endif  /* INCLUDE_WVNET */#endif		logMsg("Mask for route not entered\n",0,0,0,0,0,0);		return (0);	}	Bzero(m, sizeof *m);	m->rm_b = tt->rn_b;	m->rm_flags = tt->rn_flags;	if (tt->rn_flags & RNF_NORMAL)		m->rm_leaf = tt;	else		m->rm_mask = tt->rn_mask;	m->rm_mklist = next;	tt->rn_mklist = m;	return m;}struct radix_node *rn_addroute(v_arg, n_arg, head, treenodes)	void *v_arg, *n_arg;	struct radix_node_head *head;	struct radix_node treenodes[2];{	caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;	register struct radix_node *t, *x = 0, *tt;	struct radix_node *saved_tt, *top = head->rnh_treetop;	short b = 0, b_leaf = 0;	int keyduplicated;	caddr_t mmask;	struct radix_mask *m, **mp;	/*	 * In dealing with non-contiguous masks, there may be	 * many different routes which have the same mask.	 * We will find it useful to have a unique pointer to	 * the mask to speed avoiding duplicate references at	 * nodes and possibly save time in calculating indices.	 */	if (netmask)  {		if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)			return (0);		b_leaf = x->rn_b;		b = -1 - x->rn_b;		netmask = x->rn_key;	}	/*	 * Deal with duplicated keys: attach node to previous instance	 */	saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);	if (keyduplicated) {		for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {			if (tt->rn_mask == netmask)				return (0);			if (netmask == 0 ||			    (tt->rn_mask &&			     ((b_leaf < tt->rn_b) || /* index(netmask) > node */			       rn_refines(netmask, tt->rn_mask) ||			       rn_lexobetter(netmask, tt->rn_mask))))				break;		}		/*		 * If the mask is not duplicated, we wouldn't		 * find it among possible duplicate key entries		 * anyway, so the above test doesn't hurt.		 *		 * We sort the masks for a duplicated key the same way as		 * in a masklist -- most specific to least specific.		 * This may require the unfortunate nuisance of relocating		 * the head of the list.		 *		 * We also reverse, or doubly link the list through the		 * parent pointer.		 */		if (tt == saved_tt) {			struct	radix_node *xx = x;			/* link in at head of list */			(tt = treenodes)->rn_dupedkey = t;			tt->rn_flags = t->rn_flags;			tt->rn_p = x = t->rn_p;			t->rn_p = tt;			if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt;			saved_tt = tt; x = xx;		} else {			(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;			t->rn_dupedkey = tt;			tt->rn_p = t;			if (tt->rn_dupedkey)				tt->rn_dupedkey->rn_p = tt;		}#ifdef RN_DEBUG		t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;		tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;#endif		tt->rn_key = (caddr_t) v;		tt->rn_b = -1;		tt->rn_flags = RNF_ACTIVE;	}	/*	 * Put mask in tree.	 */	if (netmask) {		tt->rn_mask = netmask;		tt->rn_b = x->rn_b;		tt->rn_flags |= x->rn_flags & RNF_NORMAL;	}	t = saved_tt->rn_p;	if (keyduplicated)		goto on2;	b_leaf = -1 - t->rn_b;	if (t->rn_r == saved_tt) x = t->rn_l; else x = t->rn_r;	/* Promote general routes from below */	if (x->rn_b < 0) { 	    for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)		if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {			*mp = m = rn_new_radix_mask(x, 0);			if (m)				mp = &m->rm_mklist;		}	} else if (x->rn_mklist) {		/*		 * Skip over masks whose index is > that of new node		 */		for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)			if (m->rm_b >= b_leaf)				break;		t->rn_mklist = m; *mp = 0;	}on2:	/* Add new route to highest possible ancestor's list */	if ((netmask == 0) || (b > t->rn_b ))		return tt; /* can't lift at all */	b_leaf = tt->rn_b;	do {		x = t;		t = t->rn_p;	} while (b <= t->rn_b && x != top);	/*	 * Search through routes associated with node to	 * insert new route according to index.	 * Need same criteria as when sorting dupedkeys to avoid	 * double loop on deletion.	 */	for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {		if (m->rm_b < b_leaf)			continue;		if (m->rm_b > b_leaf)			break;		if (m->rm_flags & RNF_NORMAL) {			mmask = m->rm_leaf->rn_mask;			if (tt->rn_flags & RNF_NORMAL) {#ifdef WV_INSTRUMENTATION#ifdef INCLUDE_WVNET    /* WV_NET_ALERT event */                WV_NET_MARKER_0 (NET_AUX_EVENT, WV_NET_ALERT, 2, 4,                                 WV_NETEVENT_RNADD_BADROUTE)#endif  /* INCLUDE_WVNET */#endif				logMsg (				"Non-unique normal route, mask not entered",				0,0,0,0,0,0);				return tt;			}		} else			mmask = m->rm_mask;		if (mmask == netmask) {			m->rm_refs++;			tt->rn_mklist = m;			return tt;		}		if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask))			break;	}	*mp = rn_new_radix_mask(tt, *mp);	return tt;}struct radix_node *rn_delete(v_arg, netmask_arg, head)	void *v_arg, *netmask_arg;	struct radix_node_head *head;{	register struct radix_node *t, *p, *x, *tt;	struct radix_mask *m, *saved_m, **mp;	struct radix_node *dupedkey, *saved_tt, *top;	caddr_t v, netmask;	int b, head_off, vlen;	v = v_arg;	netmask = netmask_arg;	x = head->rnh_treetop;	tt = rn_search(v, x);	head_off = x->rn_off;	vlen =  *(u_char *)v;	saved_tt = tt;	top = x;	if (tt == 0 ||	    Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))		return (0);	/*	 * Delete our route from mask lists.	 */	if (netmask) {		if ((x = rn_addmask(netmask, 1, head_off)) == 0)			return (0);		netmask = x->rn_key;		while (tt->rn_mask != netmask)			if ((tt = tt->rn_dupedkey) == 0)				return (0);	}	if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)		goto on1;	if (tt->rn_flags & RNF_NORMAL) {		if (m->rm_leaf != tt || m->rm_refs > 0) {#ifdef WV_INSTRUMENTATION#ifdef INCLUDE_WVNET    /* WV_NET_ALERT event */            WV_NET_MARKER_0 (NET_AUX_EVENT, WV_NET_ALERT, 3, 5,                             WV_NETEVENT_RNDEL_BADREFCNT)#endif  /* INCLUDE_WVNET */ #endif			logMsg("rn_delete: inconsistent annotation\n",			       0,0,0,0,0,0);			return 0;  /* dangling ref could cause disaster */		}	} else { 		if (m->rm_mask != tt->rn_mask) {#ifdef WV_INSTRUMENTATION#ifdef INCLUDE_WVNET    /* WV_NET_ALERT event */            WV_NET_MARKER_0 (NET_AUX_EVENT, WV_NET_ALERT, 4, 6,                             WV_NETEVENT_RNDEL_BADMASK)#endif  /* INCLUDE_WVNET */#endif			logMsg("rn_delete: inconsistent annotation\n",			       0,0,0,0,0,0);			goto on1;		}		if (--m->rm_refs >= 0)			goto on1;	}	b = -1 - tt->rn_b;	t = saved_tt->rn_p;	if (b > t->rn_b)		goto on1; /* Wasn't lifted at all */	do {		x = t;		t = t->rn_p;	} while (b <= t->rn_b && x != top);	for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)		if (m == saved_m) {			*mp = m->rm_mklist;			MKFree(m);