| 1 |
786 |
skrzyp |
//==========================================================================
|
| 2 |
|
|
//
|
| 3 |
|
|
// include/net/radix.h
|
| 4 |
|
|
//
|
| 5 |
|
|
//==========================================================================
|
| 6 |
|
|
// ####BSDCOPYRIGHTBEGIN####
|
| 7 |
|
|
// -------------------------------------------
|
| 8 |
|
|
// This file is part of eCos, the Embedded Configurable Operating System.
|
| 9 |
|
|
//
|
| 10 |
|
|
// Portions of this software may have been derived from FreeBSD
|
| 11 |
|
|
// or other sources, and if so are covered by the appropriate copyright
|
| 12 |
|
|
// and license included herein.
|
| 13 |
|
|
//
|
| 14 |
|
|
// Portions created by the Free Software Foundation are
|
| 15 |
|
|
// Copyright (C) 2002 Free Software Foundation, Inc.
|
| 16 |
|
|
// -------------------------------------------
|
| 17 |
|
|
// ####BSDCOPYRIGHTEND####
|
| 18 |
|
|
//==========================================================================
|
| 19 |
|
|
|
| 20 |
|
|
/*
|
| 21 |
|
|
* Copyright (c) 1988, 1989, 1993
|
| 22 |
|
|
* The Regents of the University of California. All rights reserved.
|
| 23 |
|
|
*
|
| 24 |
|
|
* Redistribution and use in source and binary forms, with or without
|
| 25 |
|
|
* modification, are permitted provided that the following conditions
|
| 26 |
|
|
* are met:
|
| 27 |
|
|
* 1. Redistributions of source code must retain the above copyright
|
| 28 |
|
|
* notice, this list of conditions and the following disclaimer.
|
| 29 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
| 30 |
|
|
* notice, this list of conditions and the following disclaimer in the
|
| 31 |
|
|
* documentation and/or other materials provided with the distribution.
|
| 32 |
|
|
* 3. All advertising materials mentioning features or use of this software
|
| 33 |
|
|
* must display the following acknowledgement:
|
| 34 |
|
|
* This product includes software developed by the University of
|
| 35 |
|
|
* California, Berkeley and its contributors.
|
| 36 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
| 37 |
|
|
* may be used to endorse or promote products derived from this software
|
| 38 |
|
|
* without specific prior written permission.
|
| 39 |
|
|
*
|
| 40 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
| 41 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 42 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 43 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
| 44 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 45 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
| 46 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 47 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
| 48 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
| 49 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
| 50 |
|
|
* SUCH DAMAGE.
|
| 51 |
|
|
*
|
| 52 |
|
|
* @(#)radix.h 8.2 (Berkeley) 10/31/94
|
| 53 |
|
|
* $FreeBSD: src/sys/net/radix.h,v 1.16.2.1 2000/05/03 19:17:11 wollman Exp $
|
| 54 |
|
|
*/
|
| 55 |
|
|
|
| 56 |
|
|
#ifndef _RADIX_H_
|
| 57 |
|
|
#define _RADIX_H_
|
| 58 |
|
|
|
| 59 |
|
|
/*
|
| 60 |
|
|
* Radix search tree node layout.
|
| 61 |
|
|
*/
|
| 62 |
|
|
|
| 63 |
|
|
struct radix_node {
|
| 64 |
|
|
struct radix_mask *rn_mklist; /* list of masks contained in subtree */
|
| 65 |
|
|
struct radix_node *rn_parent; /* parent */
|
| 66 |
|
|
short rn_bit; /* bit offset; -1-index(netmask) */
|
| 67 |
|
|
char rn_bmask; /* node: mask for bit test*/
|
| 68 |
|
|
u_char rn_flags; /* enumerated next */
|
| 69 |
|
|
#define RNF_NORMAL 1 /* leaf contains normal route */
|
| 70 |
|
|
#define RNF_ROOT 2 /* leaf is root leaf for tree */
|
| 71 |
|
|
#define RNF_ACTIVE 4 /* This node is alive (for rtfree) */
|
| 72 |
|
|
union {
|
| 73 |
|
|
struct { /* leaf only data: */
|
| 74 |
|
|
caddr_t rn_Key; /* object of search */
|
| 75 |
|
|
caddr_t rn_Mask; /* netmask, if present */
|
| 76 |
|
|
struct radix_node *rn_Dupedkey;
|
| 77 |
|
|
} rn_leaf;
|
| 78 |
|
|
struct { /* node only data: */
|
| 79 |
|
|
int rn_Off; /* where to start compare */
|
| 80 |
|
|
struct radix_node *rn_L;/* progeny */
|
| 81 |
|
|
struct radix_node *rn_R;/* progeny */
|
| 82 |
|
|
} rn_node;
|
| 83 |
|
|
} rn_u;
|
| 84 |
|
|
#ifdef RN_DEBUG
|
| 85 |
|
|
int rn_info;
|
| 86 |
|
|
struct radix_node *rn_twin;
|
| 87 |
|
|
struct radix_node *rn_ybro;
|
| 88 |
|
|
#endif
|
| 89 |
|
|
};
|
| 90 |
|
|
|
| 91 |
|
|
#define rn_dupedkey rn_u.rn_leaf.rn_Dupedkey
|
| 92 |
|
|
#define rn_key rn_u.rn_leaf.rn_Key
|
| 93 |
|
|
#define rn_mask rn_u.rn_leaf.rn_Mask
|
| 94 |
|
|
#define rn_offset rn_u.rn_node.rn_Off
|
| 95 |
|
|
#define rn_left rn_u.rn_node.rn_L
|
| 96 |
|
|
#define rn_right rn_u.rn_node.rn_R
|
| 97 |
|
|
|
| 98 |
|
|
/*
|
| 99 |
|
|
* Annotations to tree concerning potential routes applying to subtrees.
|
| 100 |
|
|
*/
|
| 101 |
|
|
|
| 102 |
|
|
struct radix_mask {
|
| 103 |
|
|
short rm_bit; /* bit offset; -1-index(netmask) */
|
| 104 |
|
|
char rm_unused; /* cf. rn_bmask */
|
| 105 |
|
|
u_char rm_flags; /* cf. rn_flags */
|
| 106 |
|
|
struct radix_mask *rm_mklist; /* more masks to try */
|
| 107 |
|
|
union {
|
| 108 |
|
|
caddr_t rmu_mask; /* the mask */
|
| 109 |
|
|
struct radix_node *rmu_leaf; /* for normal routes */
|
| 110 |
|
|
} rm_rmu;
|
| 111 |
|
|
int rm_refs; /* # of references to this struct */
|
| 112 |
|
|
};
|
| 113 |
|
|
|
| 114 |
|
|
#define rm_mask rm_rmu.rmu_mask
|
| 115 |
|
|
#define rm_leaf rm_rmu.rmu_leaf /* extra field would make 32 bytes */
|
| 116 |
|
|
|
| 117 |
|
|
#define MKGet(m) {\
|
| 118 |
|
|
if (rn_mkfreelist) {\
|
| 119 |
|
|
m = rn_mkfreelist; \
|
| 120 |
|
|
rn_mkfreelist = (m)->rm_mklist; \
|
| 121 |
|
|
} else \
|
| 122 |
|
|
R_Malloc(m, struct radix_mask *, sizeof (*(m))); }\
|
| 123 |
|
|
|
| 124 |
|
|
#define MKFree(m) { (m)->rm_mklist = rn_mkfreelist; rn_mkfreelist = (m);}
|
| 125 |
|
|
|
| 126 |
|
|
typedef int walktree_f_t __P((struct radix_node *, void *));
|
| 127 |
|
|
|
| 128 |
|
|
struct radix_node_head {
|
| 129 |
|
|
struct radix_node *rnh_treetop;
|
| 130 |
|
|
int rnh_addrsize; /* permit, but not require fixed keys */
|
| 131 |
|
|
int rnh_pktsize; /* permit, but not require fixed keys */
|
| 132 |
|
|
struct radix_node *(*rnh_addaddr) /* add based on sockaddr */
|
| 133 |
|
|
__P((void *v, void *mask,
|
| 134 |
|
|
struct radix_node_head *head, struct radix_node nodes[]));
|
| 135 |
|
|
struct radix_node *(*rnh_addpkt) /* add based on packet hdr */
|
| 136 |
|
|
__P((void *v, void *mask,
|
| 137 |
|
|
struct radix_node_head *head, struct radix_node nodes[]));
|
| 138 |
|
|
struct radix_node *(*rnh_deladdr) /* remove based on sockaddr */
|
| 139 |
|
|
__P((void *v, void *mask, struct radix_node_head *head));
|
| 140 |
|
|
struct radix_node *(*rnh_delpkt) /* remove based on packet hdr */
|
| 141 |
|
|
__P((void *v, void *mask, struct radix_node_head *head));
|
| 142 |
|
|
struct radix_node *(*rnh_matchaddr) /* locate based on sockaddr */
|
| 143 |
|
|
__P((void *v, struct radix_node_head *head));
|
| 144 |
|
|
struct radix_node *(*rnh_lookup) /* locate based on sockaddr */
|
| 145 |
|
|
__P((void *v, void *mask, struct radix_node_head *head));
|
| 146 |
|
|
struct radix_node *(*rnh_matchpkt) /* locate based on packet hdr */
|
| 147 |
|
|
__P((void *v, struct radix_node_head *head));
|
| 148 |
|
|
int (*rnh_walktree) /* traverse tree */
|
| 149 |
|
|
__P((struct radix_node_head *head, walktree_f_t *f, void *w));
|
| 150 |
|
|
int (*rnh_walktree_from) /* traverse tree below a */
|
| 151 |
|
|
__P((struct radix_node_head *head, void *a, void *m,
|
| 152 |
|
|
walktree_f_t *f, void *w));
|
| 153 |
|
|
void (*rnh_close) /* do something when the last ref drops */
|
| 154 |
|
|
__P((struct radix_node *rn, struct radix_node_head *head));
|
| 155 |
|
|
struct radix_node rnh_nodes[3]; /* empty tree for common case */
|
| 156 |
|
|
};
|
| 157 |
|
|
|
| 158 |
|
|
#ifndef _KERNEL
|
| 159 |
|
|
#define Bcmp(a, b, n) bcmp(((char *)(a)), ((char *)(b)), (n))
|
| 160 |
|
|
#define Bcopy(a, b, n) bcopy(((char *)(a)), ((char *)(b)), (unsigned)(n))
|
| 161 |
|
|
#define Bzero(p, n) bzero((char *)(p), (int)(n));
|
| 162 |
|
|
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
|
| 163 |
|
|
#define R_Free(p) free((char *)p);
|
| 164 |
|
|
#else
|
| 165 |
|
|
#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
|
| 166 |
|
|
#define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
|
| 167 |
|
|
#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
|
| 168 |
|
|
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
|
| 169 |
|
|
#define R_Free(p) free((caddr_t)p, M_RTABLE);
|
| 170 |
|
|
#endif /* _KERNEL */
|
| 171 |
|
|
|
| 172 |
|
|
void rn_init __P((void));
|
| 173 |
|
|
int rn_inithead __P((void **, int));
|
| 174 |
|
|
int rn_refines __P((void *, void *));
|
| 175 |
|
|
struct radix_node
|
| 176 |
|
|
*rn_addmask __P((void *, int, int)),
|
| 177 |
|
|
*rn_addroute __P((void *, void *, struct radix_node_head *,
|
| 178 |
|
|
struct radix_node [2])),
|
| 179 |
|
|
*rn_delete __P((void *, void *, struct radix_node_head *)),
|
| 180 |
|
|
*rn_lookup __P((void *v_arg, void *m_arg,
|
| 181 |
|
|
struct radix_node_head *head)),
|
| 182 |
|
|
*rn_match __P((void *, struct radix_node_head *));
|
| 183 |
|
|
|
| 184 |
|
|
|
| 185 |
|
|
#endif /* _RADIX_H_ */
|
