/*
|
/*
|
* Copyright (c) 1988, 1989, 1993
|
* Copyright (c) 1988, 1989, 1993
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of its contributors
|
* 4. Neither the name of the University nor the names of its contributors
|
* may be used to endorse or promote products derived from this software
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*
|
*
|
* @(#)radix.c 8.4 (Berkeley) 11/2/94
|
* @(#)radix.c 8.4 (Berkeley) 11/2/94
|
* $Id: radix.c,v 1.2 2001-09-27 12:01:54 chris Exp $
|
* $Id: radix.c,v 1.2 2001-09-27 12:01:54 chris Exp $
|
*/
|
*/
|
|
|
/*
|
/*
|
* Routines to build and maintain radix trees for routing lookups.
|
* Routines to build and maintain radix trees for routing lookups.
|
*/
|
*/
|
#ifndef _RADIX_H_
|
#ifndef _RADIX_H_
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#ifdef KERNEL
|
#ifdef KERNEL
|
#include <sys/systm.h>
|
#include <sys/systm.h>
|
#include <sys/malloc.h>
|
#include <sys/malloc.h>
|
#define M_DONTWAIT M_NOWAIT
|
#define M_DONTWAIT M_NOWAIT
|
#include <sys/domain.h>
|
#include <sys/domain.h>
|
#else
|
#else
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#endif
|
#endif
|
#include <sys/syslog.h>
|
#include <sys/syslog.h>
|
#include <net/radix.h>
|
#include <net/radix.h>
|
#endif
|
#endif
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_lookup __P((void *v_arg, void *m_arg,
|
rn_lookup __P((void *v_arg, void *m_arg,
|
struct radix_node_head *head));
|
struct radix_node_head *head));
|
static int rn_walktree_from __P((struct radix_node_head *h, void *a,
|
static int rn_walktree_from __P((struct radix_node_head *h, void *a,
|
void *m, walktree_f_t *f, void *w));
|
void *m, walktree_f_t *f, void *w));
|
static int rn_walktree __P((struct radix_node_head *, walktree_f_t *, void *));
|
static int rn_walktree __P((struct radix_node_head *, walktree_f_t *, void *));
|
static struct radix_node
|
static struct radix_node
|
*rn_delete __P((void *, void *, struct radix_node_head *)),
|
*rn_delete __P((void *, void *, struct radix_node_head *)),
|
*rn_insert __P((void *, struct radix_node_head *, int *,
|
*rn_insert __P((void *, struct radix_node_head *, int *,
|
struct radix_node [2])),
|
struct radix_node [2])),
|
*rn_newpair __P((void *, int, struct radix_node[2])),
|
*rn_newpair __P((void *, int, struct radix_node[2])),
|
*rn_search __P((void *, struct radix_node *)),
|
*rn_search __P((void *, struct radix_node *)),
|
*rn_search_m __P((void *, struct radix_node *, void *));
|
*rn_search_m __P((void *, struct radix_node *, void *));
|
|
|
static int max_keylen;
|
static int max_keylen;
|
static struct radix_mask *rn_mkfreelist;
|
static struct radix_mask *rn_mkfreelist;
|
static struct radix_node_head *mask_rnhead;
|
static struct radix_node_head *mask_rnhead;
|
static char *addmask_key;
|
static char *addmask_key;
|
static char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1};
|
static char normal_chars[] = {0, 0x80, 0xc0, 0xe0, 0xf0, 0xf8, 0xfc, 0xfe, -1};
|
static char *rn_zeros, *rn_ones;
|
static char *rn_zeros, *rn_ones;
|
|
|
#define rn_masktop (mask_rnhead->rnh_treetop)
|
#define rn_masktop (mask_rnhead->rnh_treetop)
|
#undef Bcmp
|
#undef Bcmp
|
#define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
|
#define Bcmp(a, b, l) (l == 0 ? 0 : bcmp((caddr_t)(a), (caddr_t)(b), (u_long)l))
|
|
|
static int rn_lexobetter __P((void *m_arg, void *n_arg));
|
static int rn_lexobetter __P((void *m_arg, void *n_arg));
|
static struct radix_mask *
|
static struct radix_mask *
|
rn_new_radix_mask __P((struct radix_node *tt,
|
rn_new_radix_mask __P((struct radix_node *tt,
|
struct radix_mask *next));
|
struct radix_mask *next));
|
static int rn_satsifies_leaf __P((char *trial, struct radix_node *leaf,
|
static int rn_satsifies_leaf __P((char *trial, struct radix_node *leaf,
|
int skip));
|
int skip));
|
|
|
/*
|
/*
|
* The data structure for the keys is a radix tree with one way
|
* The data structure for the keys is a radix tree with one way
|
* branching removed. The index rn_b at an internal node n represents a bit
|
* branching removed. The index rn_b at an internal node n represents a bit
|
* position to be tested. The tree is arranged so that all descendants
|
* position to be tested. The tree is arranged so that all descendants
|
* of a node n have keys whose bits all agree up to position rn_b - 1.
|
* of a node n have keys whose bits all agree up to position rn_b - 1.
|
* (We say the index of n is rn_b.)
|
* (We say the index of n is rn_b.)
|
*
|
*
|
* There is at least one descendant which has a one bit at position rn_b,
|
* There is at least one descendant which has a one bit at position rn_b,
|
* and at least one with a zero there.
|
* and at least one with a zero there.
|
*
|
*
|
* A route is determined by a pair of key and mask. We require that the
|
* A route is determined by a pair of key and mask. We require that the
|
* bit-wise logical and of the key and mask to be the key.
|
* bit-wise logical and of the key and mask to be the key.
|
* We define the index of a route to associated with the mask to be
|
* We define the index of a route to associated with the mask to be
|
* the first bit number in the mask where 0 occurs (with bit number 0
|
* the first bit number in the mask where 0 occurs (with bit number 0
|
* representing the highest order bit).
|
* representing the highest order bit).
|
*
|
*
|
* We say a mask is normal if every bit is 0, past the index of the mask.
|
* We say a mask is normal if every bit is 0, past the index of the mask.
|
* If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
|
* If a node n has a descendant (k, m) with index(m) == index(n) == rn_b,
|
* and m is a normal mask, then the route applies to every descendant of n.
|
* and m is a normal mask, then the route applies to every descendant of n.
|
* If the index(m) < rn_b, this implies the trailing last few bits of k
|
* If the index(m) < rn_b, this implies the trailing last few bits of k
|
* before bit b are all 0, (and hence consequently true of every descendant
|
* before bit b are all 0, (and hence consequently true of every descendant
|
* of n), so the route applies to all descendants of the node as well.
|
* of n), so the route applies to all descendants of the node as well.
|
*
|
*
|
* Similar logic shows that a non-normal mask m such that
|
* Similar logic shows that a non-normal mask m such that
|
* index(m) <= index(n) could potentially apply to many children of n.
|
* index(m) <= index(n) could potentially apply to many children of n.
|
* Thus, for each non-host route, we attach its mask to a list at an internal
|
* Thus, for each non-host route, we attach its mask to a list at an internal
|
* node as high in the tree as we can go.
|
* node as high in the tree as we can go.
|
*
|
*
|
* The present version of the code makes use of normal routes in short-
|
* The present version of the code makes use of normal routes in short-
|
* circuiting an explict mask and compare operation when testing whether
|
* circuiting an explict mask and compare operation when testing whether
|
* a key satisfies a normal route, and also in remembering the unique leaf
|
* a key satisfies a normal route, and also in remembering the unique leaf
|
* that governs a subtree.
|
* that governs a subtree.
|
*/
|
*/
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_search(v_arg, head)
|
rn_search(v_arg, head)
|
void *v_arg;
|
void *v_arg;
|
struct radix_node *head;
|
struct radix_node *head;
|
{
|
{
|
register struct radix_node *x;
|
register struct radix_node *x;
|
register caddr_t v;
|
register caddr_t v;
|
|
|
for (x = head, v = v_arg; x->rn_b >= 0;) {
|
for (x = head, v = v_arg; x->rn_b >= 0;) {
|
if (x->rn_bmask & v[x->rn_off])
|
if (x->rn_bmask & v[x->rn_off])
|
x = x->rn_r;
|
x = x->rn_r;
|
else
|
else
|
x = x->rn_l;
|
x = x->rn_l;
|
}
|
}
|
return (x);
|
return (x);
|
};
|
};
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_search_m(v_arg, head, m_arg)
|
rn_search_m(v_arg, head, m_arg)
|
struct radix_node *head;
|
struct radix_node *head;
|
void *v_arg, *m_arg;
|
void *v_arg, *m_arg;
|
{
|
{
|
register struct radix_node *x;
|
register struct radix_node *x;
|
register caddr_t v = v_arg, m = m_arg;
|
register caddr_t v = v_arg, m = m_arg;
|
|
|
for (x = head; x->rn_b >= 0;) {
|
for (x = head; x->rn_b >= 0;) {
|
if ((x->rn_bmask & m[x->rn_off]) &&
|
if ((x->rn_bmask & m[x->rn_off]) &&
|
(x->rn_bmask & v[x->rn_off]))
|
(x->rn_bmask & v[x->rn_off]))
|
x = x->rn_r;
|
x = x->rn_r;
|
else
|
else
|
x = x->rn_l;
|
x = x->rn_l;
|
}
|
}
|
return x;
|
return x;
|
};
|
};
|
|
|
int
|
int
|
rn_refines(m_arg, n_arg)
|
rn_refines(m_arg, n_arg)
|
void *m_arg, *n_arg;
|
void *m_arg, *n_arg;
|
{
|
{
|
register caddr_t m = m_arg, n = n_arg;
|
register caddr_t m = m_arg, n = n_arg;
|
register caddr_t lim, lim2 = lim = n + *(u_char *)n;
|
register caddr_t lim, lim2 = lim = n + *(u_char *)n;
|
int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
|
int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
|
int masks_are_equal = 1;
|
int masks_are_equal = 1;
|
|
|
if (longer > 0)
|
if (longer > 0)
|
lim -= longer;
|
lim -= longer;
|
while (n < lim) {
|
while (n < lim) {
|
if (*n & ~(*m))
|
if (*n & ~(*m))
|
return 0;
|
return 0;
|
if (*n++ != *m++)
|
if (*n++ != *m++)
|
masks_are_equal = 0;
|
masks_are_equal = 0;
|
}
|
}
|
while (n < lim2)
|
while (n < lim2)
|
if (*n++)
|
if (*n++)
|
return 0;
|
return 0;
|
if (masks_are_equal && (longer < 0))
|
if (masks_are_equal && (longer < 0))
|
for (lim2 = m - longer; m < lim2; )
|
for (lim2 = m - longer; m < lim2; )
|
if (*m++)
|
if (*m++)
|
return 1;
|
return 1;
|
return (!masks_are_equal);
|
return (!masks_are_equal);
|
}
|
}
|
|
|
struct radix_node *
|
struct radix_node *
|
rn_lookup(v_arg, m_arg, head)
|
rn_lookup(v_arg, m_arg, head)
|
void *v_arg, *m_arg;
|
void *v_arg, *m_arg;
|
struct radix_node_head *head;
|
struct radix_node_head *head;
|
{
|
{
|
register struct radix_node *x;
|
register struct radix_node *x;
|
caddr_t netmask = 0;
|
caddr_t netmask = 0;
|
|
|
if (m_arg) {
|
if (m_arg) {
|
if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
|
if ((x = rn_addmask(m_arg, 1, head->rnh_treetop->rn_off)) == 0)
|
return (0);
|
return (0);
|
netmask = x->rn_key;
|
netmask = x->rn_key;
|
}
|
}
|
x = rn_match(v_arg, head);
|
x = rn_match(v_arg, head);
|
if (x && netmask) {
|
if (x && netmask) {
|
while (x && x->rn_mask != netmask)
|
while (x && x->rn_mask != netmask)
|
x = x->rn_dupedkey;
|
x = x->rn_dupedkey;
|
}
|
}
|
return x;
|
return x;
|
}
|
}
|
|
|
static int
|
static int
|
rn_satsifies_leaf(trial, leaf, skip)
|
rn_satsifies_leaf(trial, leaf, skip)
|
char *trial;
|
char *trial;
|
register struct radix_node *leaf;
|
register struct radix_node *leaf;
|
int skip;
|
int skip;
|
{
|
{
|
register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
|
register char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
|
char *cplim;
|
char *cplim;
|
int length = min(*(u_char *)cp, *(u_char *)cp2);
|
int length = min(*(u_char *)cp, *(u_char *)cp2);
|
|
|
if (cp3 == 0)
|
if (cp3 == 0)
|
cp3 = rn_ones;
|
cp3 = rn_ones;
|
else
|
else
|
length = min(length, *(u_char *)cp3);
|
length = min(length, *(u_char *)cp3);
|
cplim = cp + length; cp3 += skip; cp2 += skip;
|
cplim = cp + length; cp3 += skip; cp2 += skip;
|
for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
|
for (cp += skip; cp < cplim; cp++, cp2++, cp3++)
|
if ((*cp ^ *cp2) & *cp3)
|
if ((*cp ^ *cp2) & *cp3)
|
return 0;
|
return 0;
|
return 1;
|
return 1;
|
}
|
}
|
|
|
struct radix_node *
|
struct radix_node *
|
rn_match(v_arg, head)
|
rn_match(v_arg, head)
|
void *v_arg;
|
void *v_arg;
|
struct radix_node_head *head;
|
struct radix_node_head *head;
|
{
|
{
|
caddr_t v = v_arg;
|
caddr_t v = v_arg;
|
register struct radix_node *t = head->rnh_treetop, *x;
|
register struct radix_node *t = head->rnh_treetop, *x;
|
register caddr_t cp = v, cp2;
|
register caddr_t cp = v, cp2;
|
caddr_t cplim;
|
caddr_t cplim;
|
struct radix_node *saved_t, *top = t;
|
struct radix_node *saved_t, *top = t;
|
int off = t->rn_off, vlen = *(u_char *)cp, matched_off;
|
int off = t->rn_off, vlen = *(u_char *)cp, matched_off;
|
register int test, b, rn_b;
|
register int test, b, rn_b;
|
|
|
/*
|
/*
|
* Open code rn_search(v, top) to avoid overhead of extra
|
* Open code rn_search(v, top) to avoid overhead of extra
|
* subroutine call.
|
* subroutine call.
|
*/
|
*/
|
for (; t->rn_b >= 0; ) {
|
for (; t->rn_b >= 0; ) {
|
if (t->rn_bmask & cp[t->rn_off])
|
if (t->rn_bmask & cp[t->rn_off])
|
t = t->rn_r;
|
t = t->rn_r;
|
else
|
else
|
t = t->rn_l;
|
t = t->rn_l;
|
}
|
}
|
/*
|
/*
|
* See if we match exactly as a host destination
|
* See if we match exactly as a host destination
|
* or at least learn how many bits match, for normal mask finesse.
|
* or at least learn how many bits match, for normal mask finesse.
|
*
|
*
|
* It doesn't hurt us to limit how many bytes to check
|
* It doesn't hurt us to limit how many bytes to check
|
* to the length of the mask, since if it matches we had a genuine
|
* to the length of the mask, since if it matches we had a genuine
|
* match and the leaf we have is the most specific one anyway;
|
* match and the leaf we have is the most specific one anyway;
|
* if it didn't match with a shorter length it would fail
|
* if it didn't match with a shorter length it would fail
|
* with a long one. This wins big for class B&C netmasks which
|
* with a long one. This wins big for class B&C netmasks which
|
* are probably the most common case...
|
* are probably the most common case...
|
*/
|
*/
|
if (t->rn_mask)
|
if (t->rn_mask)
|
vlen = *(u_char *)t->rn_mask;
|
vlen = *(u_char *)t->rn_mask;
|
cp += off; cp2 = t->rn_key + off; cplim = v + vlen;
|
cp += off; cp2 = t->rn_key + off; cplim = v + vlen;
|
for (; cp < cplim; cp++, cp2++)
|
for (; cp < cplim; cp++, cp2++)
|
if (*cp != *cp2)
|
if (*cp != *cp2)
|
goto on1;
|
goto on1;
|
/*
|
/*
|
* This extra grot is in case we are explicitly asked
|
* This extra grot is in case we are explicitly asked
|
* to look up the default. Ugh!
|
* to look up the default. Ugh!
|
*/
|
*/
|
if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
|
if ((t->rn_flags & RNF_ROOT) && t->rn_dupedkey)
|
t = t->rn_dupedkey;
|
t = t->rn_dupedkey;
|
return t;
|
return t;
|
on1:
|
on1:
|
test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
|
test = (*cp ^ *cp2) & 0xff; /* find first bit that differs */
|
for (b = 7; (test >>= 1) > 0;)
|
for (b = 7; (test >>= 1) > 0;)
|
b--;
|
b--;
|
matched_off = cp - v;
|
matched_off = cp - v;
|
b += matched_off << 3;
|
b += matched_off << 3;
|
rn_b = -1 - b;
|
rn_b = -1 - b;
|
/*
|
/*
|
* If there is a host route in a duped-key chain, it will be first.
|
* If there is a host route in a duped-key chain, it will be first.
|
*/
|
*/
|
if ((saved_t = t)->rn_mask == 0)
|
if ((saved_t = t)->rn_mask == 0)
|
t = t->rn_dupedkey;
|
t = t->rn_dupedkey;
|
for (; t; t = t->rn_dupedkey)
|
for (; t; t = t->rn_dupedkey)
|
/*
|
/*
|
* Even if we don't match exactly as a host,
|
* Even if we don't match exactly as a host,
|
* we may match if the leaf we wound up at is
|
* we may match if the leaf we wound up at is
|
* a route to a net.
|
* a route to a net.
|
*/
|
*/
|
if (t->rn_flags & RNF_NORMAL) {
|
if (t->rn_flags & RNF_NORMAL) {
|
if (rn_b <= t->rn_b)
|
if (rn_b <= t->rn_b)
|
return t;
|
return t;
|
} else if (rn_satsifies_leaf(v, t, matched_off))
|
} else if (rn_satsifies_leaf(v, t, matched_off))
|
return t;
|
return t;
|
t = saved_t;
|
t = saved_t;
|
/* start searching up the tree */
|
/* start searching up the tree */
|
do {
|
do {
|
register struct radix_mask *m;
|
register struct radix_mask *m;
|
t = t->rn_p;
|
t = t->rn_p;
|
m = t->rn_mklist;
|
m = t->rn_mklist;
|
if (m) {
|
if (m) {
|
/*
|
/*
|
* If non-contiguous masks ever become important
|
* If non-contiguous masks ever become important
|
* we can restore the masking and open coding of
|
* we can restore the masking and open coding of
|
* the search and satisfaction test and put the
|
* the search and satisfaction test and put the
|
* calculation of "off" back before the "do".
|
* calculation of "off" back before the "do".
|
*/
|
*/
|
do {
|
do {
|
if (m->rm_flags & RNF_NORMAL) {
|
if (m->rm_flags & RNF_NORMAL) {
|
if (rn_b <= m->rm_b)
|
if (rn_b <= m->rm_b)
|
return (m->rm_leaf);
|
return (m->rm_leaf);
|
} else {
|
} else {
|
off = min(t->rn_off, matched_off);
|
off = min(t->rn_off, matched_off);
|
x = rn_search_m(v, t, m->rm_mask);
|
x = rn_search_m(v, t, m->rm_mask);
|
while (x && x->rn_mask != m->rm_mask)
|
while (x && x->rn_mask != m->rm_mask)
|
x = x->rn_dupedkey;
|
x = x->rn_dupedkey;
|
if (x && rn_satsifies_leaf(v, x, off))
|
if (x && rn_satsifies_leaf(v, x, off))
|
return x;
|
return x;
|
}
|
}
|
m = m->rm_mklist;
|
m = m->rm_mklist;
|
} while (m);
|
} while (m);
|
}
|
}
|
} while (t != top);
|
} while (t != top);
|
return 0;
|
return 0;
|
};
|
};
|
|
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
int rn_nodenum;
|
int rn_nodenum;
|
struct radix_node *rn_clist;
|
struct radix_node *rn_clist;
|
int rn_saveinfo;
|
int rn_saveinfo;
|
int rn_debug = 1;
|
int rn_debug = 1;
|
#endif
|
#endif
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_newpair(v, b, nodes)
|
rn_newpair(v, b, nodes)
|
void *v;
|
void *v;
|
int b;
|
int b;
|
struct radix_node nodes[2];
|
struct radix_node nodes[2];
|
{
|
{
|
register struct radix_node *tt = nodes, *t = tt + 1;
|
register struct radix_node *tt = nodes, *t = tt + 1;
|
t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7);
|
t->rn_b = b; t->rn_bmask = 0x80 >> (b & 7);
|
t->rn_l = tt; t->rn_off = b >> 3;
|
t->rn_l = tt; t->rn_off = b >> 3;
|
tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t;
|
tt->rn_b = -1; tt->rn_key = (caddr_t)v; tt->rn_p = t;
|
tt->rn_flags = t->rn_flags = RNF_ACTIVE;
|
tt->rn_flags = t->rn_flags = RNF_ACTIVE;
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
|
tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
|
tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
|
tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
|
#endif
|
#endif
|
return t;
|
return t;
|
}
|
}
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_insert(v_arg, head, dupentry, nodes)
|
rn_insert(v_arg, head, dupentry, nodes)
|
void *v_arg;
|
void *v_arg;
|
struct radix_node_head *head;
|
struct radix_node_head *head;
|
int *dupentry;
|
int *dupentry;
|
struct radix_node nodes[2];
|
struct radix_node nodes[2];
|
{
|
{
|
caddr_t v = v_arg;
|
caddr_t v = v_arg;
|
struct radix_node *top = head->rnh_treetop;
|
struct radix_node *top = head->rnh_treetop;
|
int head_off = top->rn_off, vlen = (int)*((u_char *)v);
|
int head_off = top->rn_off, vlen = (int)*((u_char *)v);
|
register struct radix_node *t = rn_search(v_arg, top);
|
register struct radix_node *t = rn_search(v_arg, top);
|
register caddr_t cp = v + head_off;
|
register caddr_t cp = v + head_off;
|
register int b;
|
register int b;
|
struct radix_node *tt;
|
struct radix_node *tt;
|
/*
|
/*
|
* Find first bit at which v and t->rn_key differ
|
* Find first bit at which v and t->rn_key differ
|
*/
|
*/
|
{
|
{
|
register caddr_t cp2 = t->rn_key + head_off;
|
register caddr_t cp2 = t->rn_key + head_off;
|
register int cmp_res;
|
register int cmp_res;
|
caddr_t cplim = v + vlen;
|
caddr_t cplim = v + vlen;
|
|
|
while (cp < cplim)
|
while (cp < cplim)
|
if (*cp2++ != *cp++)
|
if (*cp2++ != *cp++)
|
goto on1;
|
goto on1;
|
*dupentry = 1;
|
*dupentry = 1;
|
return t;
|
return t;
|
on1:
|
on1:
|
*dupentry = 0;
|
*dupentry = 0;
|
cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
|
cmp_res = (cp[-1] ^ cp2[-1]) & 0xff;
|
for (b = (cp - v) << 3; cmp_res; b--)
|
for (b = (cp - v) << 3; cmp_res; b--)
|
cmp_res >>= 1;
|
cmp_res >>= 1;
|
}
|
}
|
{
|
{
|
register struct radix_node *p, *x = top;
|
register struct radix_node *p, *x = top;
|
cp = v;
|
cp = v;
|
do {
|
do {
|
p = x;
|
p = x;
|
if (cp[x->rn_off] & x->rn_bmask)
|
if (cp[x->rn_off] & x->rn_bmask)
|
x = x->rn_r;
|
x = x->rn_r;
|
else x = x->rn_l;
|
else x = x->rn_l;
|
} while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
|
} while (b > (unsigned) x->rn_b); /* x->rn_b < b && x->rn_b >= 0 */
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
if (rn_debug)
|
if (rn_debug)
|
log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
|
log(LOG_DEBUG, "rn_insert: Going In:\n"), traverse(p);
|
#endif
|
#endif
|
t = rn_newpair(v_arg, b, nodes); tt = t->rn_l;
|
t = rn_newpair(v_arg, b, nodes); tt = t->rn_l;
|
if ((cp[p->rn_off] & p->rn_bmask) == 0)
|
if ((cp[p->rn_off] & p->rn_bmask) == 0)
|
p->rn_l = t;
|
p->rn_l = t;
|
else
|
else
|
p->rn_r = t;
|
p->rn_r = t;
|
x->rn_p = t; t->rn_p = p; /* frees x, p as temp vars below */
|
x->rn_p = t; t->rn_p = p; /* frees x, p as temp vars below */
|
if ((cp[t->rn_off] & t->rn_bmask) == 0) {
|
if ((cp[t->rn_off] & t->rn_bmask) == 0) {
|
t->rn_r = x;
|
t->rn_r = x;
|
} else {
|
} else {
|
t->rn_r = tt; t->rn_l = x;
|
t->rn_r = tt; t->rn_l = x;
|
}
|
}
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
if (rn_debug)
|
if (rn_debug)
|
log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
|
log(LOG_DEBUG, "rn_insert: Coming Out:\n"), traverse(p);
|
#endif
|
#endif
|
}
|
}
|
return (tt);
|
return (tt);
|
}
|
}
|
|
|
struct radix_node *
|
struct radix_node *
|
rn_addmask(n_arg, search, skip)
|
rn_addmask(n_arg, search, skip)
|
int search, skip;
|
int search, skip;
|
void *n_arg;
|
void *n_arg;
|
{
|
{
|
caddr_t netmask = (caddr_t)n_arg;
|
caddr_t netmask = (caddr_t)n_arg;
|
register struct radix_node *x;
|
register struct radix_node *x;
|
register caddr_t cp, cplim;
|
register caddr_t cp, cplim;
|
register int b = 0, mlen, j;
|
register int b = 0, mlen, j;
|
int maskduplicated, m0, isnormal;
|
int maskduplicated, m0, isnormal;
|
struct radix_node *saved_x;
|
struct radix_node *saved_x;
|
static int last_zeroed = 0;
|
static int last_zeroed = 0;
|
|
|
if ((mlen = *(u_char *)netmask) > max_keylen)
|
if ((mlen = *(u_char *)netmask) > max_keylen)
|
mlen = max_keylen;
|
mlen = max_keylen;
|
if (skip == 0)
|
if (skip == 0)
|
skip = 1;
|
skip = 1;
|
if (mlen <= skip)
|
if (mlen <= skip)
|
return (mask_rnhead->rnh_nodes);
|
return (mask_rnhead->rnh_nodes);
|
if (skip > 1)
|
if (skip > 1)
|
Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
|
Bcopy(rn_ones + 1, addmask_key + 1, skip - 1);
|
if ((m0 = mlen) > skip)
|
if ((m0 = mlen) > skip)
|
Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
|
Bcopy(netmask + skip, addmask_key + skip, mlen - skip);
|
/*
|
/*
|
* Trim trailing zeroes.
|
* Trim trailing zeroes.
|
*/
|
*/
|
for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
|
for (cp = addmask_key + mlen; (cp > addmask_key) && cp[-1] == 0;)
|
cp--;
|
cp--;
|
mlen = cp - addmask_key;
|
mlen = cp - addmask_key;
|
if (mlen <= skip) {
|
if (mlen <= skip) {
|
if (m0 >= last_zeroed)
|
if (m0 >= last_zeroed)
|
last_zeroed = mlen;
|
last_zeroed = mlen;
|
return (mask_rnhead->rnh_nodes);
|
return (mask_rnhead->rnh_nodes);
|
}
|
}
|
if (m0 < last_zeroed)
|
if (m0 < last_zeroed)
|
Bzero(addmask_key + m0, last_zeroed - m0);
|
Bzero(addmask_key + m0, last_zeroed - m0);
|
*addmask_key = last_zeroed = mlen;
|
*addmask_key = last_zeroed = mlen;
|
x = rn_search(addmask_key, rn_masktop);
|
x = rn_search(addmask_key, rn_masktop);
|
if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
|
if (Bcmp(addmask_key, x->rn_key, mlen) != 0)
|
x = 0;
|
x = 0;
|
if (x || search)
|
if (x || search)
|
return (x);
|
return (x);
|
R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
|
R_Malloc(x, struct radix_node *, max_keylen + 2 * sizeof (*x));
|
if ((saved_x = x) == 0)
|
if ((saved_x = x) == 0)
|
return (0);
|
return (0);
|
Bzero(x, max_keylen + 2 * sizeof (*x));
|
Bzero(x, max_keylen + 2 * sizeof (*x));
|
netmask = cp = (caddr_t)(x + 2);
|
netmask = cp = (caddr_t)(x + 2);
|
Bcopy(addmask_key, cp, mlen);
|
Bcopy(addmask_key, cp, mlen);
|
x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
|
x = rn_insert(cp, mask_rnhead, &maskduplicated, x);
|
if (maskduplicated) {
|
if (maskduplicated) {
|
log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
|
log(LOG_ERR, "rn_addmask: mask impossibly already in tree");
|
Free(saved_x);
|
Free(saved_x);
|
return (x);
|
return (x);
|
}
|
}
|
/*
|
/*
|
* Calculate index of mask, and check for normalcy.
|
* Calculate index of mask, and check for normalcy.
|
*/
|
*/
|
cplim = netmask + mlen; isnormal = 1;
|
cplim = netmask + mlen; isnormal = 1;
|
for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
|
for (cp = netmask + skip; (cp < cplim) && *(u_char *)cp == 0xff;)
|
cp++;
|
cp++;
|
if (cp != cplim) {
|
if (cp != cplim) {
|
for (j = 0x80; (j & *cp) != 0; j >>= 1)
|
for (j = 0x80; (j & *cp) != 0; j >>= 1)
|
b++;
|
b++;
|
if (*cp != normal_chars[b] || cp != (cplim - 1))
|
if (*cp != normal_chars[b] || cp != (cplim - 1))
|
isnormal = 0;
|
isnormal = 0;
|
}
|
}
|
b += (cp - netmask) << 3;
|
b += (cp - netmask) << 3;
|
x->rn_b = -1 - b;
|
x->rn_b = -1 - b;
|
if (isnormal)
|
if (isnormal)
|
x->rn_flags |= RNF_NORMAL;
|
x->rn_flags |= RNF_NORMAL;
|
return (x);
|
return (x);
|
}
|
}
|
|
|
static int /* XXX: arbitrary ordering for non-contiguous masks */
|
static int /* XXX: arbitrary ordering for non-contiguous masks */
|
rn_lexobetter(m_arg, n_arg)
|
rn_lexobetter(m_arg, n_arg)
|
void *m_arg, *n_arg;
|
void *m_arg, *n_arg;
|
{
|
{
|
register u_char *mp = m_arg, *np = n_arg, *lim;
|
register u_char *mp = m_arg, *np = n_arg, *lim;
|
|
|
if (*mp > *np)
|
if (*mp > *np)
|
return 1; /* not really, but need to check longer one first */
|
return 1; /* not really, but need to check longer one first */
|
if (*mp == *np)
|
if (*mp == *np)
|
for (lim = mp + *mp; mp < lim;)
|
for (lim = mp + *mp; mp < lim;)
|
if (*mp++ > *np++)
|
if (*mp++ > *np++)
|
return 1;
|
return 1;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
static struct radix_mask *
|
static struct radix_mask *
|
rn_new_radix_mask(tt, next)
|
rn_new_radix_mask(tt, next)
|
register struct radix_node *tt;
|
register struct radix_node *tt;
|
register struct radix_mask *next;
|
register struct radix_mask *next;
|
{
|
{
|
register struct radix_mask *m;
|
register struct radix_mask *m;
|
|
|
MKGet(m);
|
MKGet(m);
|
if (m == 0) {
|
if (m == 0) {
|
log(LOG_ERR, "Mask for route not entered\n");
|
log(LOG_ERR, "Mask for route not entered\n");
|
return (0);
|
return (0);
|
}
|
}
|
Bzero(m, sizeof *m);
|
Bzero(m, sizeof *m);
|
m->rm_b = tt->rn_b;
|
m->rm_b = tt->rn_b;
|
m->rm_flags = tt->rn_flags;
|
m->rm_flags = tt->rn_flags;
|
if (tt->rn_flags & RNF_NORMAL)
|
if (tt->rn_flags & RNF_NORMAL)
|
m->rm_leaf = tt;
|
m->rm_leaf = tt;
|
else
|
else
|
m->rm_mask = tt->rn_mask;
|
m->rm_mask = tt->rn_mask;
|
m->rm_mklist = next;
|
m->rm_mklist = next;
|
tt->rn_mklist = m;
|
tt->rn_mklist = m;
|
return m;
|
return m;
|
}
|
}
|
|
|
struct radix_node *
|
struct radix_node *
|
rn_addroute(v_arg, n_arg, head, treenodes)
|
rn_addroute(v_arg, n_arg, head, treenodes)
|
void *v_arg, *n_arg;
|
void *v_arg, *n_arg;
|
struct radix_node_head *head;
|
struct radix_node_head *head;
|
struct radix_node treenodes[2];
|
struct radix_node treenodes[2];
|
{
|
{
|
caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
|
caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
|
register struct radix_node *t, *x = 0, *tt;
|
register struct radix_node *t, *x = 0, *tt;
|
struct radix_node *saved_tt, *top = head->rnh_treetop;
|
struct radix_node *saved_tt, *top = head->rnh_treetop;
|
short b = 0, b_leaf = 0;
|
short b = 0, b_leaf = 0;
|
int keyduplicated;
|
int keyduplicated;
|
caddr_t mmask;
|
caddr_t mmask;
|
struct radix_mask *m, **mp;
|
struct radix_mask *m, **mp;
|
|
|
/*
|
/*
|
* In dealing with non-contiguous masks, there may be
|
* In dealing with non-contiguous masks, there may be
|
* many different routes which have the same mask.
|
* many different routes which have the same mask.
|
* We will find it useful to have a unique pointer to
|
* We will find it useful to have a unique pointer to
|
* the mask to speed avoiding duplicate references at
|
* the mask to speed avoiding duplicate references at
|
* nodes and possibly save time in calculating indices.
|
* nodes and possibly save time in calculating indices.
|
*/
|
*/
|
if (netmask) {
|
if (netmask) {
|
if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)
|
if ((x = rn_addmask(netmask, 0, top->rn_off)) == 0)
|
return (0);
|
return (0);
|
b_leaf = x->rn_b;
|
b_leaf = x->rn_b;
|
b = -1 - x->rn_b;
|
b = -1 - x->rn_b;
|
netmask = x->rn_key;
|
netmask = x->rn_key;
|
}
|
}
|
/*
|
/*
|
* Deal with duplicated keys: attach node to previous instance
|
* Deal with duplicated keys: attach node to previous instance
|
*/
|
*/
|
saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
|
saved_tt = tt = rn_insert(v, head, &keyduplicated, treenodes);
|
if (keyduplicated) {
|
if (keyduplicated) {
|
for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
|
for (t = tt; tt; t = tt, tt = tt->rn_dupedkey) {
|
if (tt->rn_mask == netmask)
|
if (tt->rn_mask == netmask)
|
return (0);
|
return (0);
|
if (netmask == 0 ||
|
if (netmask == 0 ||
|
(tt->rn_mask &&
|
(tt->rn_mask &&
|
((b_leaf < tt->rn_b) || /* index(netmask) > node */
|
((b_leaf < tt->rn_b) || /* index(netmask) > node */
|
rn_refines(netmask, tt->rn_mask) ||
|
rn_refines(netmask, tt->rn_mask) ||
|
rn_lexobetter(netmask, tt->rn_mask))))
|
rn_lexobetter(netmask, tt->rn_mask))))
|
break;
|
break;
|
}
|
}
|
/*
|
/*
|
* If the mask is not duplicated, we wouldn't
|
* If the mask is not duplicated, we wouldn't
|
* find it among possible duplicate key entries
|
* find it among possible duplicate key entries
|
* anyway, so the above test doesn't hurt.
|
* anyway, so the above test doesn't hurt.
|
*
|
*
|
* We sort the masks for a duplicated key the same way as
|
* We sort the masks for a duplicated key the same way as
|
* in a masklist -- most specific to least specific.
|
* in a masklist -- most specific to least specific.
|
* This may require the unfortunate nuisance of relocating
|
* This may require the unfortunate nuisance of relocating
|
* the head of the list.
|
* the head of the list.
|
*/
|
*/
|
if (tt == saved_tt) {
|
if (tt == saved_tt) {
|
struct radix_node *xx = x;
|
struct radix_node *xx = x;
|
/* link in at head of list */
|
/* link in at head of list */
|
(tt = treenodes)->rn_dupedkey = t;
|
(tt = treenodes)->rn_dupedkey = t;
|
tt->rn_flags = t->rn_flags;
|
tt->rn_flags = t->rn_flags;
|
tt->rn_p = x = t->rn_p;
|
tt->rn_p = x = t->rn_p;
|
t->rn_p = tt; /* parent */
|
t->rn_p = tt; /* parent */
|
if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt;
|
if (x->rn_l == t) x->rn_l = tt; else x->rn_r = tt;
|
saved_tt = tt; x = xx;
|
saved_tt = tt; x = xx;
|
} else {
|
} else {
|
(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
|
(tt = treenodes)->rn_dupedkey = t->rn_dupedkey;
|
t->rn_dupedkey = tt;
|
t->rn_dupedkey = tt;
|
tt->rn_p = t; /* parent */
|
tt->rn_p = t; /* parent */
|
if (tt->rn_dupedkey) /* parent */
|
if (tt->rn_dupedkey) /* parent */
|
tt->rn_dupedkey->rn_p = tt; /* parent */
|
tt->rn_dupedkey->rn_p = tt; /* parent */
|
}
|
}
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
t=tt+1; tt->rn_info = rn_nodenum++; t->rn_info = rn_nodenum++;
|
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;
|
tt->rn_twin = t; tt->rn_ybro = rn_clist; rn_clist = tt;
|
#endif
|
#endif
|
tt->rn_key = (caddr_t) v;
|
tt->rn_key = (caddr_t) v;
|
tt->rn_b = -1;
|
tt->rn_b = -1;
|
tt->rn_flags = RNF_ACTIVE;
|
tt->rn_flags = RNF_ACTIVE;
|
}
|
}
|
/*
|
/*
|
* Put mask in tree.
|
* Put mask in tree.
|
*/
|
*/
|
if (netmask) {
|
if (netmask) {
|
tt->rn_mask = netmask;
|
tt->rn_mask = netmask;
|
tt->rn_b = x->rn_b;
|
tt->rn_b = x->rn_b;
|
tt->rn_flags |= x->rn_flags & RNF_NORMAL;
|
tt->rn_flags |= x->rn_flags & RNF_NORMAL;
|
}
|
}
|
t = saved_tt->rn_p;
|
t = saved_tt->rn_p;
|
if (keyduplicated)
|
if (keyduplicated)
|
goto on2;
|
goto on2;
|
b_leaf = -1 - t->rn_b;
|
b_leaf = -1 - t->rn_b;
|
if (t->rn_r == saved_tt) x = t->rn_l; else x = t->rn_r;
|
if (t->rn_r == saved_tt) x = t->rn_l; else x = t->rn_r;
|
/* Promote general routes from below */
|
/* Promote general routes from below */
|
if (x->rn_b < 0) {
|
if (x->rn_b < 0) {
|
for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
|
for (mp = &t->rn_mklist; x; x = x->rn_dupedkey)
|
if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
|
if (x->rn_mask && (x->rn_b >= b_leaf) && x->rn_mklist == 0) {
|
*mp = m = rn_new_radix_mask(x, 0);
|
*mp = m = rn_new_radix_mask(x, 0);
|
if (m)
|
if (m)
|
mp = &m->rm_mklist;
|
mp = &m->rm_mklist;
|
}
|
}
|
} else if (x->rn_mklist) {
|
} else if (x->rn_mklist) {
|
/*
|
/*
|
* Skip over masks whose index is > that of new node
|
* Skip over masks whose index is > that of new node
|
*/
|
*/
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
|
if (m->rm_b >= b_leaf)
|
if (m->rm_b >= b_leaf)
|
break;
|
break;
|
t->rn_mklist = m; *mp = 0;
|
t->rn_mklist = m; *mp = 0;
|
}
|
}
|
on2:
|
on2:
|
/* Add new route to highest possible ancestor's list */
|
/* Add new route to highest possible ancestor's list */
|
if ((netmask == 0) || (b > t->rn_b ))
|
if ((netmask == 0) || (b > t->rn_b ))
|
return tt; /* can't lift at all */
|
return tt; /* can't lift at all */
|
b_leaf = tt->rn_b;
|
b_leaf = tt->rn_b;
|
do {
|
do {
|
x = t;
|
x = t;
|
t = t->rn_p;
|
t = t->rn_p;
|
} while (b <= t->rn_b && x != top);
|
} while (b <= t->rn_b && x != top);
|
/*
|
/*
|
* Search through routes associated with node to
|
* Search through routes associated with node to
|
* insert new route according to index.
|
* insert new route according to index.
|
* Need same criteria as when sorting dupedkeys to avoid
|
* Need same criteria as when sorting dupedkeys to avoid
|
* double loop on deletion.
|
* double loop on deletion.
|
*/
|
*/
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist) {
|
if (m->rm_b < b_leaf)
|
if (m->rm_b < b_leaf)
|
continue;
|
continue;
|
if (m->rm_b > b_leaf)
|
if (m->rm_b > b_leaf)
|
break;
|
break;
|
if (m->rm_flags & RNF_NORMAL) {
|
if (m->rm_flags & RNF_NORMAL) {
|
mmask = m->rm_leaf->rn_mask;
|
mmask = m->rm_leaf->rn_mask;
|
if (tt->rn_flags & RNF_NORMAL) {
|
if (tt->rn_flags & RNF_NORMAL) {
|
log(LOG_ERR,
|
log(LOG_ERR,
|
"Non-unique normal route, mask not entered");
|
"Non-unique normal route, mask not entered");
|
return tt;
|
return tt;
|
}
|
}
|
} else
|
} else
|
mmask = m->rm_mask;
|
mmask = m->rm_mask;
|
if (mmask == netmask) {
|
if (mmask == netmask) {
|
m->rm_refs++;
|
m->rm_refs++;
|
tt->rn_mklist = m;
|
tt->rn_mklist = m;
|
return tt;
|
return tt;
|
}
|
}
|
if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask))
|
if (rn_refines(netmask, mmask) || rn_lexobetter(netmask, mmask))
|
break;
|
break;
|
}
|
}
|
*mp = rn_new_radix_mask(tt, *mp);
|
*mp = rn_new_radix_mask(tt, *mp);
|
return tt;
|
return tt;
|
}
|
}
|
|
|
static struct radix_node *
|
static struct radix_node *
|
rn_delete(v_arg, netmask_arg, head)
|
rn_delete(v_arg, netmask_arg, head)
|
void *v_arg, *netmask_arg;
|
void *v_arg, *netmask_arg;
|
struct radix_node_head *head;
|
struct radix_node_head *head;
|
{
|
{
|
register struct radix_node *t, *p, *x, *tt;
|
register struct radix_node *t, *p, *x, *tt;
|
struct radix_mask *m, *saved_m, **mp;
|
struct radix_mask *m, *saved_m, **mp;
|
struct radix_node *dupedkey, *saved_tt, *top;
|
struct radix_node *dupedkey, *saved_tt, *top;
|
caddr_t v, netmask;
|
caddr_t v, netmask;
|
int b, head_off, vlen;
|
int b, head_off, vlen;
|
|
|
v = v_arg;
|
v = v_arg;
|
netmask = netmask_arg;
|
netmask = netmask_arg;
|
x = head->rnh_treetop;
|
x = head->rnh_treetop;
|
tt = rn_search(v, x);
|
tt = rn_search(v, x);
|
head_off = x->rn_off;
|
head_off = x->rn_off;
|
vlen = *(u_char *)v;
|
vlen = *(u_char *)v;
|
saved_tt = tt;
|
saved_tt = tt;
|
top = x;
|
top = x;
|
if (tt == 0 ||
|
if (tt == 0 ||
|
Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
|
Bcmp(v + head_off, tt->rn_key + head_off, vlen - head_off))
|
return (0);
|
return (0);
|
/*
|
/*
|
* Delete our route from mask lists.
|
* Delete our route from mask lists.
|
*/
|
*/
|
if (netmask) {
|
if (netmask) {
|
if ((x = rn_addmask(netmask, 1, head_off)) == 0)
|
if ((x = rn_addmask(netmask, 1, head_off)) == 0)
|
return (0);
|
return (0);
|
netmask = x->rn_key;
|
netmask = x->rn_key;
|
while (tt->rn_mask != netmask)
|
while (tt->rn_mask != netmask)
|
if ((tt = tt->rn_dupedkey) == 0)
|
if ((tt = tt->rn_dupedkey) == 0)
|
return (0);
|
return (0);
|
}
|
}
|
if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
|
if (tt->rn_mask == 0 || (saved_m = m = tt->rn_mklist) == 0)
|
goto on1;
|
goto on1;
|
if (tt->rn_flags & RNF_NORMAL) {
|
if (tt->rn_flags & RNF_NORMAL) {
|
if (m->rm_leaf != tt || m->rm_refs > 0) {
|
if (m->rm_leaf != tt || m->rm_refs > 0) {
|
log(LOG_ERR, "rn_delete: inconsistent annotation\n");
|
log(LOG_ERR, "rn_delete: inconsistent annotation\n");
|
return 0; /* dangling ref could cause disaster */
|
return 0; /* dangling ref could cause disaster */
|
}
|
}
|
} else {
|
} else {
|
if (m->rm_mask != tt->rn_mask) {
|
if (m->rm_mask != tt->rn_mask) {
|
log(LOG_ERR, "rn_delete: inconsistent annotation\n");
|
log(LOG_ERR, "rn_delete: inconsistent annotation\n");
|
goto on1;
|
goto on1;
|
}
|
}
|
if (--m->rm_refs >= 0)
|
if (--m->rm_refs >= 0)
|
goto on1;
|
goto on1;
|
}
|
}
|
b = -1 - tt->rn_b;
|
b = -1 - tt->rn_b;
|
t = saved_tt->rn_p;
|
t = saved_tt->rn_p;
|
if (b > t->rn_b)
|
if (b > t->rn_b)
|
goto on1; /* Wasn't lifted at all */
|
goto on1; /* Wasn't lifted at all */
|
do {
|
do {
|
x = t;
|
x = t;
|
t = t->rn_p;
|
t = t->rn_p;
|
} while (b <= t->rn_b && x != top);
|
} while (b <= t->rn_b && x != top);
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
|
for (mp = &x->rn_mklist; (m = *mp); mp = &m->rm_mklist)
|
if (m == saved_m) {
|
if (m == saved_m) {
|
*mp = m->rm_mklist;
|
*mp = m->rm_mklist;
|
MKFree(m);
|
MKFree(m);
|
break;
|
break;
|
}
|
}
|
if (m == 0) {
|
if (m == 0) {
|
log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
|
log(LOG_ERR, "rn_delete: couldn't find our annotation\n");
|
if (tt->rn_flags & RNF_NORMAL)
|
if (tt->rn_flags & RNF_NORMAL)
|
return (0); /* Dangling ref to us */
|
return (0); /* Dangling ref to us */
|
}
|
}
|
on1:
|
on1:
|
/*
|
/*
|
* Eliminate us from tree
|
* Eliminate us from tree
|
*/
|
*/
|
if (tt->rn_flags & RNF_ROOT)
|
if (tt->rn_flags & RNF_ROOT)
|
return (0);
|
return (0);
|
#ifdef RN_DEBUG
|
#ifdef RN_DEBUG
|
/* Get us out of the creation list */
|
/* Get us out of the creation list */
|
for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
|
for (t = rn_clist; t && t->rn_ybro != tt; t = t->rn_ybro) {}
|
if (t) t->rn_ybro = tt->rn_ybro;
|
if (t) t->rn_ybro = tt->rn_ybro;
|
#endif
|
#endif
|
t = tt->rn_p;
|
t = tt->rn_p;
|
dupedkey = saved_tt->rn_dupedkey;
|
dupedkey = saved_tt->rn_dupedkey;
|
if (dupedkey) {
|
if (dupedkey) {
|
/*
|
/*
|
* at this point, tt is the deletion target and saved_tt
|
* at this point, tt is the deletion target and saved_tt
|
* is the head of the dupekey chain
|
* is the head of the dupekey chain
|
*/
|
*/
|
if (tt == saved_tt) {
|
if (tt == saved_tt) {
|
/* remove from head of chain */
|
/* remove from head of chain */
|
x = dupedkey; x->rn_p = t;
|
x = dupedkey; x->rn_p = t;
|
if (t->rn_l == tt) t->rn_l = x; else t->rn_r = x;
|
if (t->rn_l == tt) t->rn_l = x; else t->rn_r = x;
|
} else {
|
} else {
|
/* find node in front of tt on the chain */
|
/* find node in front of tt on the chain */
|
for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
|
for (x = p = saved_tt; p && p->rn_dupedkey != tt;)
|
p = p->rn_dupedkey;
|
p = p->rn_dupedkey;
|
if (p) {
|
if (p) {
|
p->rn_dupedkey = tt->rn_dupedkey;
|
p->rn_dupedkey = tt->rn_dupedkey;
|
if (tt->rn_dupedkey) /* parent */
|
if (tt->rn_dupedkey) /* parent */
|
tt->rn_dupedkey->rn_p = p; /* parent */
|
tt->rn_dupedkey->rn_p = p; /* parent */
|
} else log(LOG_ERR, "rn_delete: couldn't find us\n");
|
} else log(LOG_ERR, "rn_delete: couldn't find us\n");
|
}
|
}
|
t = tt + 1;
|
t = tt + 1;
|
if (t->rn_flags & RNF_ACTIVE) {
|
if (t->rn_flags & RNF_ACTIVE) {
|
#ifndef RN_DEBUG
|
#ifndef RN_DEBUG
|
*++x = *t; p = t->rn_p;
|
*++x = *t; p = t->rn_p;
|
#else
|
#else
|
b = t->rn_info; *++x = *t; t->rn_info = b; p = t->rn_p;
|
b = t->rn_info; *++x = *t; t->rn_info = b; p = t->rn_p;
|
#endif
|
#endif
|
if (p->rn_l == t) p->rn_l = x; else p->rn_r = x;
|
if (p->rn_l == t) p->rn_l = x; else p->rn_r = x;
|
x->rn_l->rn_p = x; x->rn_r->rn_p = x;
|
x->rn_l->rn_p = x; x->rn_r->rn_p = x;
|
}
|
}
|
goto out;
|
goto out;
|
}
|
}
|
if (t->rn_l == tt) x = t->rn_r; else x = t->rn_l;
|
if (t->rn_l == tt) x = t->rn_r; else x = t->rn_l;
|
p = t->rn_p;
|
p = t->rn_p;
|
if (p->rn_r == t) p->rn_r = x; else p->rn_l = x;
|
if (p->rn_r == t) p->rn_r = x; else p->rn_l = x;
|
x->rn_p = p;
|
x->rn_p = p;
|
/*
|
/*
|
* Demote routes attached to us.
|
* Demote routes attached to us.
|
*/
|
*/
|
if (t->rn_mklist) {
|
if (t->rn_mklist) {
|
if (x->rn_b >= 0) {
|
if (x->rn_b >= 0) {
|
for (mp = &x->rn_mklist; (m = *mp);)
|
for (mp = &x->rn_mklist; (m = *mp);)
|
mp = &m->rm_mklist;
|
mp = &m->rm_mklist;
|
*mp = t->rn_mklist;
|
*mp = t->rn_mklist;
|
} else {
|
} else {
|
/* If there are any key,mask pairs in a sibling
|
/* If there are any key,mask pairs in a sibling
|
duped-key chain, some subset will appear sorted
|
duped-key chain, some subset will appear sorted
|
in the same order attached to our mklist */
|
in the same order attached to our mklist */
|
for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
|
for (m = t->rn_mklist; m && x; x = x->rn_dupedkey)
|
if (m == x->rn_mklist) {
|
if (m == x->rn_mklist) {
|
struct radix_mask *mm = m->rm_mklist;
|
struct radix_mask *mm = m->rm_mklist;
|
x->rn_mklist = 0;
|
x->rn_mklist = 0;
|
if (--(m->rm_refs) < 0)
|
if (--(m->rm_refs) < 0)
|
MKFree(m);
|
MKFree(m);
|
m = mm;
|
m = mm;
|
}
|
}
|
if (m)
|
if (m)
|
log(LOG_ERR, "%s %p at %x\n",
|
log(LOG_ERR, "%s %p at %x\n",
|
"rn_delete: Orphaned Mask", m, x);
|
"rn_delete: Orphaned Mask", m, x);
|
}
|
}
|
}
|
}
|
/*
|
/*
|
* We may be holding an active internal node in the tree.
|
* We may be holding an active internal node in the tree.
|
*/
|
*/
|
x = tt + 1;
|
x = tt + 1;
|
if (t != x) {
|
if (t != x) {
|
#ifndef RN_DEBUG
|
#ifndef RN_DEBUG
|
*t = *x;
|
*t = *x;
|
#else
|
#else
|
b = t->rn_info; *t = *x; t->rn_info = b;
|
b = t->rn_info; *t = *x; t->rn_info = b;
|
#endif
|
#endif
|
t->rn_l->rn_p = t; t->rn_r->rn_p = t;
|
t->rn_l->rn_p = t; t->rn_r->rn_p = t;
|
p = x->rn_p;
|
p = x->rn_p;
|
if (p->rn_l == x) p->rn_l = t; else p->rn_r = t;
|
if (p->rn_l == x) p->rn_l = t; else p->rn_r = t;
|
}
|
}
|
out:
|
out:
|
tt->rn_flags &= ~RNF_ACTIVE;
|
tt->rn_flags &= ~RNF_ACTIVE;
|
tt[1].rn_flags &= ~RNF_ACTIVE;
|
tt[1].rn_flags &= ~RNF_ACTIVE;
|
return (tt);
|
return (tt);
|
}
|
}
|
|
|
/*
|
/*
|
* This is the same as rn_walktree() except for the parameters and the
|
* This is the same as rn_walktree() except for the parameters and the
|
* exit.
|
* exit.
|
*/
|
*/
|
static int
|
static int
|
rn_walktree_from(h, a, m, f, w)
|
rn_walktree_from(h, a, m, f, w)
|
struct radix_node_head *h;
|
struct radix_node_head *h;
|
void *a, *m;
|
void *a, *m;
|
walktree_f_t *f;
|
walktree_f_t *f;
|
void *w;
|
void *w;
|
{
|
{
|
int error;
|
int error;
|
struct radix_node *base, *next;
|
struct radix_node *base, *next;
|
u_char *xa = (u_char *)a;
|
u_char *xa = (u_char *)a;
|
u_char *xm = (u_char *)m;
|
u_char *xm = (u_char *)m;
|
register struct radix_node *rn, *last = 0 /* shut up gcc */;
|
register struct radix_node *rn, *last = 0 /* shut up gcc */;
|
int stopping = 0;
|
int stopping = 0;
|
int lastb;
|
int lastb;
|
|
|
/*
|
/*
|
* rn_search_m is sort-of-open-coded here.
|
* rn_search_m is sort-of-open-coded here.
|
*/
|
*/
|
/* printf("about to search\n"); */
|
/* printf("about to search\n"); */
|
for (rn = h->rnh_treetop; rn->rn_b >= 0; ) {
|
for (rn = h->rnh_treetop; rn->rn_b >= 0; ) {
|
last = rn;
|
last = rn;
|
/* printf("rn_b %d, rn_bmask %x, xm[rn_off] %x\n",
|
/* printf("rn_b %d, rn_bmask %x, xm[rn_off] %x\n",
|
rn->rn_b, rn->rn_bmask, xm[rn->rn_off]); */
|
rn->rn_b, rn->rn_bmask, xm[rn->rn_off]); */
|
if (!(rn->rn_bmask & xm[rn->rn_off])) {
|
if (!(rn->rn_bmask & xm[rn->rn_off])) {
|
break;
|
break;
|
}
|
}
|
if (rn->rn_bmask & xa[rn->rn_off]) {
|
if (rn->rn_bmask & xa[rn->rn_off]) {
|
rn = rn->rn_r;
|
rn = rn->rn_r;
|
} else {
|
} else {
|
rn = rn->rn_l;
|
rn = rn->rn_l;
|
}
|
}
|
}
|
}
|
/* printf("done searching\n"); */
|
/* printf("done searching\n"); */
|
|
|
/*
|
/*
|
* Two cases: either we stepped off the end of our mask,
|
* Two cases: either we stepped off the end of our mask,
|
* in which case last == rn, or we reached a leaf, in which
|
* in which case last == rn, or we reached a leaf, in which
|
* case we want to start from the last node we looked at.
|
* case we want to start from the last node we looked at.
|
* Either way, last is the node we want to start from.
|
* Either way, last is the node we want to start from.
|
*/
|
*/
|
rn = last;
|
rn = last;
|
lastb = rn->rn_b;
|
lastb = rn->rn_b;
|
|
|
/* printf("rn %p, lastb %d\n", rn, lastb);*/
|
/* printf("rn %p, lastb %d\n", rn, lastb);*/
|
|
|
/*
|
/*
|
* This gets complicated because we may delete the node
|
* This gets complicated because we may delete the node
|
* while applying the function f to it, so we need to calculate
|
* while applying the function f to it, so we need to calculate
|
* the successor node in advance.
|
* the successor node in advance.
|
*/
|
*/
|
while (rn->rn_b >= 0)
|
while (rn->rn_b >= 0)
|
rn = rn->rn_l;
|
rn = rn->rn_l;
|
|
|
while (!stopping) {
|
while (!stopping) {
|
/* printf("node %p (%d)\n", rn, rn->rn_b); */
|
/* printf("node %p (%d)\n", rn, rn->rn_b); */
|
base = rn;
|
base = rn;
|
/* If at right child go back up, otherwise, go right */
|
/* If at right child go back up, otherwise, go right */
|
while (rn->rn_p->rn_r == rn && !(rn->rn_flags & RNF_ROOT)) {
|
while (rn->rn_p->rn_r == rn && !(rn->rn_flags & RNF_ROOT)) {
|
rn = rn->rn_p;
|
rn = rn->rn_p;
|
|
|
/* if went up beyond last, stop */
|
/* if went up beyond last, stop */
|
if (rn->rn_b < lastb) {
|
if (rn->rn_b < lastb) {
|
stopping = 1;
|
stopping = 1;
|
/* printf("up too far\n"); */
|
/* printf("up too far\n"); */
|
}
|
}
|
}
|
}
|
|
|
/* Find the next *leaf* since next node might vanish, too */
|
/* Find the next *leaf* since next node might vanish, too */
|
for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
|
for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
|
rn = rn->rn_l;
|
rn = rn->rn_l;
|
next = rn;
|
next = rn;
|
/* Process leaves */
|
/* Process leaves */
|
while ((rn = base) != 0) {
|
while ((rn = base) != 0) {
|
base = rn->rn_dupedkey;
|
base = rn->rn_dupedkey;
|
/* printf("leaf %p\n", rn); */
|
/* printf("leaf %p\n", rn); */
|
if (!(rn->rn_flags & RNF_ROOT)
|
if (!(rn->rn_flags & RNF_ROOT)
|
&& (error = (*f)(rn, w)))
|
&& (error = (*f)(rn, w)))
|
return (error);
|
return (error);
|
}
|
}
|
rn = next;
|
rn = next;
|
|
|
if (rn->rn_flags & RNF_ROOT) {
|
if (rn->rn_flags & RNF_ROOT) {
|
/* printf("root, stopping"); */
|
/* printf("root, stopping"); */
|
stopping = 1;
|
stopping = 1;
|
}
|
}
|
|
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
static int
|
static int
|
rn_walktree(h, f, w)
|
rn_walktree(h, f, w)
|
struct radix_node_head *h;
|
struct radix_node_head *h;
|
walktree_f_t *f;
|
walktree_f_t *f;
|
void *w;
|
void *w;
|
{
|
{
|
int error;
|
int error;
|
struct radix_node *base, *next;
|
struct radix_node *base, *next;
|
register struct radix_node *rn = h->rnh_treetop;
|
register struct radix_node *rn = h->rnh_treetop;
|
/*
|
/*
|
* This gets complicated because we may delete the node
|
* This gets complicated because we may delete the node
|
* while applying the function f to it, so we need to calculate
|
* while applying the function f to it, so we need to calculate
|
* the successor node in advance.
|
* the successor node in advance.
|
*/
|
*/
|
/* First time through node, go left */
|
/* First time through node, go left */
|
while (rn->rn_b >= 0)
|
while (rn->rn_b >= 0)
|
rn = rn->rn_l;
|
rn = rn->rn_l;
|
for (;;) {
|
for (;;) {
|
base = rn;
|
base = rn;
|
/* If at right child go back up, otherwise, go right */
|
/* If at right child go back up, otherwise, go right */
|
while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0)
|
while (rn->rn_p->rn_r == rn && (rn->rn_flags & RNF_ROOT) == 0)
|
rn = rn->rn_p;
|
rn = rn->rn_p;
|
/* Find the next *leaf* since next node might vanish, too */
|
/* Find the next *leaf* since next node might vanish, too */
|
for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
|
for (rn = rn->rn_p->rn_r; rn->rn_b >= 0;)
|
rn = rn->rn_l;
|
rn = rn->rn_l;
|
next = rn;
|
next = rn;
|
/* Process leaves */
|
/* Process leaves */
|
while ((rn = base)) {
|
while ((rn = base)) {
|
base = rn->rn_dupedkey;
|
base = rn->rn_dupedkey;
|
if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
|
if (!(rn->rn_flags & RNF_ROOT) && (error = (*f)(rn, w)))
|
return (error);
|
return (error);
|
}
|
}
|
rn = next;
|
rn = next;
|
if (rn->rn_flags & RNF_ROOT)
|
if (rn->rn_flags & RNF_ROOT)
|
return (0);
|
return (0);
|
}
|
}
|
/* NOTREACHED */
|
/* NOTREACHED */
|
}
|
}
|
|
|
int
|
int
|
rn_inithead(head, off)
|
rn_inithead(head, off)
|
void **head;
|
void **head;
|
int off;
|
int off;
|
{
|
{
|
register struct radix_node_head *rnh;
|
register struct radix_node_head *rnh;
|
register struct radix_node *t, *tt, *ttt;
|
register struct radix_node *t, *tt, *ttt;
|
if (*head)
|
if (*head)
|
return (1);
|
return (1);
|
R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
|
R_Malloc(rnh, struct radix_node_head *, sizeof (*rnh));
|
if (rnh == 0)
|
if (rnh == 0)
|
return (0);
|
return (0);
|
Bzero(rnh, sizeof (*rnh));
|
Bzero(rnh, sizeof (*rnh));
|
*head = rnh;
|
*head = rnh;
|
t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
|
t = rn_newpair(rn_zeros, off, rnh->rnh_nodes);
|
ttt = rnh->rnh_nodes + 2;
|
ttt = rnh->rnh_nodes + 2;
|
t->rn_r = ttt;
|
t->rn_r = ttt;
|
t->rn_p = t;
|
t->rn_p = t;
|
tt = t->rn_l;
|
tt = t->rn_l;
|
tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
|
tt->rn_flags = t->rn_flags = RNF_ROOT | RNF_ACTIVE;
|
tt->rn_b = -1 - off;
|
tt->rn_b = -1 - off;
|
*ttt = *tt;
|
*ttt = *tt;
|
ttt->rn_key = rn_ones;
|
ttt->rn_key = rn_ones;
|
rnh->rnh_addaddr = rn_addroute;
|
rnh->rnh_addaddr = rn_addroute;
|
rnh->rnh_deladdr = rn_delete;
|
rnh->rnh_deladdr = rn_delete;
|
rnh->rnh_matchaddr = rn_match;
|
rnh->rnh_matchaddr = rn_match;
|
rnh->rnh_lookup = rn_lookup;
|
rnh->rnh_lookup = rn_lookup;
|
rnh->rnh_walktree = rn_walktree;
|
rnh->rnh_walktree = rn_walktree;
|
rnh->rnh_walktree_from = rn_walktree_from;
|
rnh->rnh_walktree_from = rn_walktree_from;
|
rnh->rnh_treetop = t;
|
rnh->rnh_treetop = t;
|
return (1);
|
return (1);
|
}
|
}
|
|
|
void
|
void
|
rn_init()
|
rn_init()
|
{
|
{
|
char *cp, *cplim;
|
char *cp, *cplim;
|
#ifdef KERNEL
|
#ifdef KERNEL
|
struct domain *dom;
|
struct domain *dom;
|
|
|
for (dom = domains; dom; dom = dom->dom_next)
|
for (dom = domains; dom; dom = dom->dom_next)
|
if (dom->dom_maxrtkey > max_keylen)
|
if (dom->dom_maxrtkey > max_keylen)
|
max_keylen = dom->dom_maxrtkey;
|
max_keylen = dom->dom_maxrtkey;
|
#endif
|
#endif
|
if (max_keylen == 0) {
|
if (max_keylen == 0) {
|
log(LOG_ERR,
|
log(LOG_ERR,
|
"rn_init: radix functions require max_keylen be set\n");
|
"rn_init: radix functions require max_keylen be set\n");
|
return;
|
return;
|
}
|
}
|
R_Malloc(rn_zeros, char *, 3 * max_keylen);
|
R_Malloc(rn_zeros, char *, 3 * max_keylen);
|
if (rn_zeros == NULL)
|
if (rn_zeros == NULL)
|
panic("rn_init");
|
panic("rn_init");
|
Bzero(rn_zeros, 3 * max_keylen);
|
Bzero(rn_zeros, 3 * max_keylen);
|
rn_ones = cp = rn_zeros + max_keylen;
|
rn_ones = cp = rn_zeros + max_keylen;
|
addmask_key = cplim = rn_ones + max_keylen;
|
addmask_key = cplim = rn_ones + max_keylen;
|
while (cp < cplim)
|
while (cp < cplim)
|
*cp++ = -1;
|
*cp++ = -1;
|
if (rn_inithead((void **)&mask_rnhead, 0) == 0)
|
if (rn_inithead((void **)&mask_rnhead, 0) == 0)
|
panic("rn_init 2");
|
panic("rn_init 2");
|
}
|
}
|
|
|
