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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/*
* Copyright (c) 1989 Stephen Deering.
* Copyright (c) 1992, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Stephen Deering of Stanford University.
*
* 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and 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
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*
* @(#)ip_mroute.h 8.1 (Berkeley) 6/10/93
*/
/*
* Definitions for the kernel part of DVMRP,
* a Distance-Vector Multicast Routing Protocol.
* (See RFC-1075.)
*
* Written by David Waitzman, BBN Labs, August 1988.
* Modified by Steve Deering, Stanford, February 1989.
*
* MROUTING 1.0
*/
/*
* DVMRP-specific setsockopt commands.
*/
#define DVMRP_INIT 100
#define DVMRP_DONE 101
#define DVMRP_ADD_VIF 102
#define DVMRP_DEL_VIF 103
#define DVMRP_ADD_LGRP 104
#define DVMRP_DEL_LGRP 105
#define DVMRP_ADD_MRT 106
#define DVMRP_DEL_MRT 107
/*
* Types and macros for handling bitmaps with one bit per virtual interface.
*/
#define MAXVIFS 32
typedef u_long vifbitmap_t;
typedef u_short vifi_t; /* type of a vif index */
#define VIFM_SET(n, m) ((m) |= (1 << (n)))
#define VIFM_CLR(n, m) ((m) &= ~(1 << (n)))
#define VIFM_ISSET(n, m) ((m) & (1 << (n)))
#define VIFM_CLRALL(m) ((m) = 0x00000000)
#define VIFM_COPY(mfrom, mto) ((mto) = (mfrom))
#define VIFM_SAME(m1, m2) ((m1) == (m2))
/*
* Agument structure for DVMRP_ADD_VIF.
* (DVMRP_DEL_VIF takes a single vifi_t argument.)
*/
struct vifctl {
vifi_t vifc_vifi; /* the index of the vif to be added */
u_char vifc_flags; /* VIFF_ flags defined below */
u_char vifc_threshold; /* min ttl required to forward on vif */
struct in_addr vifc_lcl_addr; /* local interface address */
struct in_addr vifc_rmt_addr; /* remote address (tunnels only) */
};
#define VIFF_TUNNEL 0x1 /* vif represents a tunnel end-point */
/*
* Argument structure for DVMRP_ADD_LGRP and DVMRP_DEL_LGRP.
*/
struct lgrplctl {
vifi_t lgc_vifi;
struct in_addr lgc_gaddr;
};
/*
* Argument structure for DVMRP_ADD_MRT.
* (DVMRP_DEL_MRT takes a single struct in_addr argument, containing origin.)
*/
struct mrtctl {
struct in_addr mrtc_origin; /* subnet origin of multicasts */
struct in_addr mrtc_originmask; /* subnet mask for origin */
vifi_t mrtc_parent; /* incoming vif */
vifbitmap_t mrtc_children; /* outgoing children vifs */
vifbitmap_t mrtc_leaves; /* subset of outgoing children vifs */
};
#ifdef KERNEL
/*
* The kernel's virtual-interface structure.
*/
struct vif {
u_char v_flags; /* VIFF_ flags defined above */
u_char v_threshold; /* min ttl required to forward on vif */
struct in_addr v_lcl_addr; /* local interface address */
struct in_addr v_rmt_addr; /* remote address (tunnels only) */
struct ifnet *v_ifp; /* pointer to interface */
struct in_addr *v_lcl_grps; /* list of local grps (phyints only) */
int v_lcl_grps_max; /* malloc'ed number of v_lcl_grps */
int v_lcl_grps_n; /* used number of v_lcl_grps */
u_long v_cached_group; /* last grp looked-up (phyints only) */
int v_cached_result; /* last look-up result (phyints only) */
};
/*
* The kernel's multicast route structure.
*/
struct mrt {
struct in_addr mrt_origin; /* subnet origin of multicasts */
struct in_addr mrt_originmask; /* subnet mask for origin */
vifi_t mrt_parent; /* incoming vif */
vifbitmap_t mrt_children; /* outgoing children vifs */
vifbitmap_t mrt_leaves; /* subset of outgoing children vifs */
struct mrt *mrt_next; /* forward link */
};
#define MRTHASHSIZ 64
#if (MRTHASHSIZ & (MRTHASHSIZ - 1)) == 0 /* from sys:route.h */
#define MRTHASHMOD(h) ((h) & (MRTHASHSIZ - 1))
#else
#define MRTHASHMOD(h) ((h) % MRTHASHSIZ)
#endif
/*
* The kernel's multicast routing statistics.
*/
struct mrtstat {
u_long mrts_mrt_lookups; /* # multicast route lookups */
u_long mrts_mrt_misses; /* # multicast route cache misses */
u_long mrts_grp_lookups; /* # group address lookups */
u_long mrts_grp_misses; /* # group address cache misses */
u_long mrts_no_route; /* no route for packet's origin */
u_long mrts_bad_tunnel; /* malformed tunnel options */
u_long mrts_cant_tunnel; /* no room for tunnel options */
};
int ip_mrouter_cmd __P((int, struct socket *, struct mbuf *));
int ip_mrouter_done __P((void));
#endif /* KERNEL */
|
