1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* 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
* SUCH DAMAGE.
*
*/
/*
* radish.h
*
* Version: 0.5
* Created: May 27, 1995
* Modified: January 11, 1997
* Author: Kazu YAMAMOTO
* Email: kazu@is.aist-nara.ac.jp
*/
#ifndef __P
#ifdef __STDC__
#define __P(x) x
#else
#define __P(x) ()
#endif /* __STDC__ */
#endif /* __P */
#ifdef RADISH
#ifndef _NET_RADISH_H_
#define _NET_RADISH_H_
struct radish {
struct sockaddr *rd_route; /* destination route */
struct sockaddr *rd_mask; /* destination mask */
u_int rd_masklen; /* length of mask */
u_short rd_masklim; /* length of mask / 8 : test point */
u_char rd_bmask; /* byte mask */
u_char rd_btest; /* bit to test */
struct radish *rd_p; /* parent */
struct radish *rd_l; /* left child */
struct radish *rd_r; /* right child */
#ifndef GENERIC_USE
struct rtentry *rd_rtent; /* rtentry */
#else /* GENERIC_USE */
void *rd_rtent; /* rtentry */
#endif /* GENERIC_USE */
};
struct radish_head {
int rdh_slen; /* socket address length */
int rdh_offset; /* address start byte */
int rdh_alen; /* address length */
void *rdh_masks;
struct radish *rdh_top;
int (*rdh_match)(void *, void *);
};
#ifdef KERNEL
#define Bcmp(a, b, n) bcmp(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
#define Bcopy(a, b, n) bcopy(((caddr_t)(a)), ((caddr_t)(b)), (unsigned)(n))
#define Bzero(p, n) bzero((caddr_t)(p), (unsigned)(n));
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned long)(n), M_RTABLE, M_DONTWAIT))
#define Free(p) free((caddr_t)p, M_RTABLE);
#else /* KERNEL */
#ifndef Bcmp
#define Bcmp(a, b, n) memcmp(((char *)(a)), ((char *)(b)), (size_t)(n))
#endif
#ifndef Bzero
#define Bzero(p, n) memset((char *)(p), 0, (size_t)(n))
#endif
#define R_Malloc(p, t, n) (p = (t) malloc((unsigned int)(n)))
#define Free(p) free((char *)p);
#endif /* KERNEL */
/*
* prototype for radish functions
*/
int rd_inithead __P((void **, int, int, int, int, int (*)(void *, void *)));
struct sockaddr *rd_mask __P((struct sockaddr *, struct radish_head *, int *));
#ifndef GENERIC_USE
int rd_insert __P((struct sockaddr *, struct sockaddr *,
struct radish_head *, struct rtentry *));
#else /* GENERIC_USE */
int rd_insert __P((struct sockaddr *, struct sockaddr *,
struct radish_head *, void *));
#endif /* GENERIC_USE */
int rd_glue __P((struct radish *, struct radish *, int, struct radish_head *));
int rd_match __P((struct sockaddr *, struct radish_head *, struct radish **));
int rd_match_next __P((struct sockaddr *, struct radish_head *, struct radish **, struct radish *));
#ifndef GENERIC_USE
struct rtentry *rd_lookup __P((struct sockaddr *,
struct sockaddr *, struct radish_head *));
int rd_delete __P((struct sockaddr *, struct sockaddr *,
struct radish_head *, struct rtentry **));
#else /* GENERIC_USE */
void *rd_lookup __P((struct sockaddr *,
struct sockaddr *, struct radish_head *));
int rd_delete __P((struct sockaddr *, struct sockaddr *,
struct radish_head *, void **));
#endif /* GENERIC_USE */
void rd_unlink __P((struct radish *, struct radish *));
int rd_walktree __P((struct radish_head *, int (*)(struct radish *, void *), void *));
int rd_refines __P((void *, void *));
#endif /* !_NET_RADISH_H_ */
#endif /* RADISH */
|
