1 /* $NetBSD: if_bridgevar.h,v 1.4 2003/07/08 07:13:50 itojun Exp $ */
2
3 /*
4 * Copyright 2001 Wasabi Systems, Inc.
5 * All rights reserved.
6 *
7 * Written by Jason R. Thorpe for Wasabi Systems, Inc.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed for the NetBSD Project by
20 * Wasabi Systems, Inc.
21 * 4. The name of Wasabi Systems, Inc. may not be used to endorse
22 * or promote products derived from this software without specific prior
23 * written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
29 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
36 */
37
38 /*
39 * Copyright (c) 1999, 2000 Jason L. Wright (jason@thought.net)
40 * All rights reserved.
41 *
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
44 * are met:
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by Jason L. Wright
53 * 4. The name of the author may not be used to endorse or promote products
54 * derived from this software without specific prior written permission.
55 *
56 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
57 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
58 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
59 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
60 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
61 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
62 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
64 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
65 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
66 * POSSIBILITY OF SUCH DAMAGE.
67 *
68 * OpenBSD: if_bridge.h,v 1.14 2001/03/22 03:48:29 jason Exp
69 *
70 * $FreeBSD: releng/6.0/sys/net/if_bridgevar.h 151571 2005-10-23 02:37:28Z thompsa $
71 */
72
73 /*
74 * Data structure and control definitions for bridge interfaces.
75 */
76
77 #include <sys/callout.h>
78 #include <sys/queue.h>
79 #include <sys/condvar.h>
80
81 /*
82 * Commands used in the SIOCSDRVSPEC ioctl. Note the lookup of the
83 * bridge interface itself is keyed off the ifdrv structure.
84 */
85 #define BRDGADD 0 /* add bridge member (ifbreq) */
86 #define BRDGDEL 1 /* delete bridge member (ifbreq) */
87 #define BRDGGIFFLGS 2 /* get member if flags (ifbreq) */
88 #define BRDGSIFFLGS 3 /* set member if flags (ifbreq) */
89 #define BRDGSCACHE 4 /* set cache size (ifbrparam) */
90 #define BRDGGCACHE 5 /* get cache size (ifbrparam) */
91 #define BRDGGIFS 6 /* get member list (ifbifconf) */
92 #define BRDGRTS 7 /* get address list (ifbaconf) */
93 #define BRDGSADDR 8 /* set static address (ifbareq) */
94 #define BRDGSTO 9 /* set cache timeout (ifbrparam) */
95 #define BRDGGTO 10 /* get cache timeout (ifbrparam) */
96 #define BRDGDADDR 11 /* delete address (ifbareq) */
97 #define BRDGFLUSH 12 /* flush address cache (ifbreq) */
98
99 #define BRDGGPRI 13 /* get priority (ifbrparam) */
100 #define BRDGSPRI 14 /* set priority (ifbrparam) */
101 #define BRDGGHT 15 /* get hello time (ifbrparam) */
102 #define BRDGSHT 16 /* set hello time (ifbrparam) */
103 #define BRDGGFD 17 /* get forward delay (ifbrparam) */
104 #define BRDGSFD 18 /* set forward delay (ifbrparam) */
105 #define BRDGGMA 19 /* get max age (ifbrparam) */
106 #define BRDGSMA 20 /* set max age (ifbrparam) */
107 #define BRDGSIFPRIO 21 /* set if priority (ifbreq) */
108 #define BRDGSIFCOST 22 /* set if path cost (ifbreq) */
109
110 /*
111 * Generic bridge control request.
112 */
113 struct ifbreq {
114 char ifbr_ifsname[IFNAMSIZ]; /* member if name */
115 uint32_t ifbr_ifsflags; /* member if flags */
116 uint8_t ifbr_state; /* member if STP state */
117 uint8_t ifbr_priority; /* member if STP priority */
118 uint8_t ifbr_path_cost; /* member if STP cost */
119 uint8_t ifbr_portno; /* member if port number */
120 };
121
122 /* BRDGGIFFLAGS, BRDGSIFFLAGS */
123 #define IFBIF_LEARNING 0x01 /* if can learn */
124 #define IFBIF_DISCOVER 0x02 /* if sends packets w/ unknown dest. */
125 #define IFBIF_STP 0x04 /* if participates in spanning tree */
126
127 #define IFBIFBITS "\020\1LEARNING\2DISCOVER\3STP"
128
129 /* BRDGFLUSH */
130 #define IFBF_FLUSHDYN 0x00 /* flush learned addresses only */
131 #define IFBF_FLUSHALL 0x01 /* flush all addresses */
132
133 /* STP port states */
134 #define BSTP_IFSTATE_DISABLED 0
135 #define BSTP_IFSTATE_LISTENING 1
136 #define BSTP_IFSTATE_LEARNING 2
137 #define BSTP_IFSTATE_FORWARDING 3
138 #define BSTP_IFSTATE_BLOCKING 4
139
140 /*
141 * Interface list structure.
142 */
143 struct ifbifconf {
144 uint32_t ifbic_len; /* buffer size */
145 union {
146 caddr_t ifbicu_buf;
147 struct ifbreq *ifbicu_req;
148 } ifbic_ifbicu;
149 #define ifbic_buf ifbic_ifbicu.ifbicu_buf
150 #define ifbic_req ifbic_ifbicu.ifbicu_req
151 };
152
153 /*
154 * Bridge address request.
155 */
156 struct ifbareq {
157 char ifba_ifsname[IFNAMSIZ]; /* member if name */
158 unsigned long ifba_expire; /* address expire time */
159 uint8_t ifba_flags; /* address flags */
160 uint8_t ifba_dst[ETHER_ADDR_LEN];/* destination address */
161 };
162
163 #define IFBAF_TYPEMASK 0x03 /* address type mask */
164 #define IFBAF_DYNAMIC 0x00 /* dynamically learned address */
165 #define IFBAF_STATIC 0x01 /* static address */
166
167 #define IFBAFBITS "\020\1STATIC"
168
169 /*
170 * Address list structure.
171 */
172 struct ifbaconf {
173 uint32_t ifbac_len; /* buffer size */
174 union {
175 caddr_t ifbacu_buf;
176 struct ifbareq *ifbacu_req;
177 } ifbac_ifbacu;
178 #define ifbac_buf ifbac_ifbacu.ifbacu_buf
179 #define ifbac_req ifbac_ifbacu.ifbacu_req
180 };
181
182 /*
183 * Bridge parameter structure.
184 */
185 struct ifbrparam {
186 union {
187 uint32_t ifbrpu_int32;
188 uint16_t ifbrpu_int16;
189 uint8_t ifbrpu_int8;
190 } ifbrp_ifbrpu;
191 };
192 #define ifbrp_csize ifbrp_ifbrpu.ifbrpu_int32 /* cache size */
193 #define ifbrp_ctime ifbrp_ifbrpu.ifbrpu_int32 /* cache time (sec) */
194 #define ifbrp_prio ifbrp_ifbrpu.ifbrpu_int16 /* bridge priority */
195 #define ifbrp_hellotime ifbrp_ifbrpu.ifbrpu_int8 /* hello time (sec) */
196 #define ifbrp_fwddelay ifbrp_ifbrpu.ifbrpu_int8 /* fwd time (sec) */
197 #define ifbrp_maxage ifbrp_ifbrpu.ifbrpu_int8 /* max age (sec) */
198
199 #ifdef _KERNEL
200 /*
201 * Timekeeping structure used in spanning tree code.
202 */
203 struct bridge_timer {
204 uint16_t active;
205 uint16_t value;
206 };
207
208 struct bstp_config_unit {
209 uint64_t cu_rootid;
210 uint64_t cu_bridge_id;
211 uint32_t cu_root_path_cost;
212 uint16_t cu_message_age;
213 uint16_t cu_max_age;
214 uint16_t cu_hello_time;
215 uint16_t cu_forward_delay;
216 uint16_t cu_port_id;
217 uint8_t cu_message_type;
218 uint8_t cu_topology_change_acknowledgment;
219 uint8_t cu_topology_change;
220 };
221
222 struct bstp_tcn_unit {
223 uint8_t tu_message_type;
224 };
225
226 /*
227 * Bridge interface list entry.
228 */
229 struct bridge_iflist {
230 LIST_ENTRY(bridge_iflist) bif_next;
231 uint64_t bif_designated_root;
232 uint64_t bif_designated_bridge;
233 uint32_t bif_path_cost;
234 uint32_t bif_designated_cost;
235 struct bridge_timer bif_hold_timer;
236 struct bridge_timer bif_message_age_timer;
237 struct bridge_timer bif_forward_delay_timer;
238 struct bstp_config_unit bif_config_bpdu;
239 uint16_t bif_port_id;
240 uint16_t bif_designated_port;
241 uint8_t bif_state;
242 uint8_t bif_topology_change_acknowledge;
243 uint8_t bif_config_pending;
244 uint8_t bif_change_detection_enabled;
245 uint8_t bif_priority;
246 struct ifnet *bif_ifp; /* member if */
247 uint32_t bif_flags; /* member if flags */
248 };
249
250 /*
251 * Bridge route node.
252 */
253 struct bridge_rtnode {
254 LIST_ENTRY(bridge_rtnode) brt_hash; /* hash table linkage */
255 LIST_ENTRY(bridge_rtnode) brt_list; /* list linkage */
256 struct ifnet *brt_ifp; /* destination if */
257 unsigned long brt_expire; /* expiration time */
258 uint8_t brt_flags; /* address flags */
259 uint8_t brt_addr[ETHER_ADDR_LEN];
260 };
261
262 /*
263 * Software state for each bridge.
264 */
265 struct bridge_softc {
266 struct ifnet *sc_ifp; /* make this an interface */
267 LIST_ENTRY(bridge_softc) sc_list;
268 struct mtx sc_mtx;
269 struct cv sc_cv;
270 uint64_t sc_designated_root;
271 uint64_t sc_bridge_id;
272 struct bridge_iflist *sc_root_port;
273 uint32_t sc_root_path_cost;
274 uint16_t sc_max_age;
275 uint16_t sc_hello_time;
276 uint16_t sc_forward_delay;
277 uint16_t sc_bridge_max_age;
278 uint16_t sc_bridge_hello_time;
279 uint16_t sc_bridge_forward_delay;
280 uint16_t sc_topology_change_time;
281 uint16_t sc_hold_time;
282 uint16_t sc_bridge_priority;
283 uint8_t sc_topology_change_detected;
284 uint8_t sc_topology_change;
285 struct bridge_timer sc_hello_timer;
286 struct bridge_timer sc_topology_change_timer;
287 struct bridge_timer sc_tcn_timer;
288 uint32_t sc_brtmax; /* max # of addresses */
289 uint32_t sc_brtcnt; /* cur. # of addresses */
290 uint32_t sc_brttimeout; /* rt timeout in seconds */
291 struct callout sc_brcallout; /* bridge callout */
292 struct callout sc_bstpcallout; /* STP callout */
293 uint32_t sc_iflist_ref; /* refcount for sc_iflist */
294 uint32_t sc_iflist_xcnt; /* refcount for sc_iflist */
295 LIST_HEAD(, bridge_iflist) sc_iflist; /* member interface list */
296 LIST_HEAD(, bridge_rtnode) *sc_rthash; /* our forwarding table */
297 LIST_HEAD(, bridge_rtnode) sc_rtlist; /* list version of above */
298 uint32_t sc_rthash_key; /* key for hash */
299 };
300
301 #define BRIDGE_LOCK_INIT(_sc) do { \
302 mtx_init(&(_sc)->sc_mtx, "if_bridge", NULL, MTX_DEF); \
303 cv_init(&(_sc)->sc_cv, "if_bridge_cv"); \
304 } while (0)
305 #define BRIDGE_LOCK_DESTROY(_sc) do { \
306 mtx_destroy(&(_sc)->sc_mtx); \
307 cv_destroy(&(_sc)->sc_cv); \
308 } while (0)
309 #define BRIDGE_LOCK(_sc) mtx_lock(&(_sc)->sc_mtx)
310 #define BRIDGE_UNLOCK(_sc) mtx_unlock(&(_sc)->sc_mtx)
311 #define BRIDGE_LOCKED(_sc) mtx_owned(&(_sc)->sc_mtx)
312 #define BRIDGE_LOCK_ASSERT(_sc) mtx_assert(&(_sc)->sc_mtx, MA_OWNED)
313 #define BRIDGE_LOCK2REF(_sc, _err) do { \
314 mtx_assert(&(_sc)->sc_mtx, MA_OWNED); \
315 if ((_sc)->sc_iflist_xcnt > 0) \
316 (_err) = EBUSY; \
317 else \
318 (_sc)->sc_iflist_ref++; \
319 mtx_unlock(&(_sc)->sc_mtx); \
320 } while (0)
321 #define BRIDGE_UNREF(_sc) do { \
322 mtx_lock(&(_sc)->sc_mtx); \
323 (_sc)->sc_iflist_ref--; \
324 if (((_sc)->sc_iflist_xcnt > 0) && ((_sc)->sc_iflist_ref == 0)) \
325 cv_broadcast(&(_sc)->sc_cv); \
326 mtx_unlock(&(_sc)->sc_mtx); \
327 } while (0)
328 #define BRIDGE_XLOCK(_sc) do { \
329 mtx_assert(&(_sc)->sc_mtx, MA_OWNED); \
330 (_sc)->sc_iflist_xcnt++; \
331 while ((_sc)->sc_iflist_ref > 0) \
332 cv_wait(&(_sc)->sc_cv, &(_sc)->sc_mtx); \
333 } while (0)
334 #define BRIDGE_XDROP(_sc) do { \
335 mtx_assert(&(_sc)->sc_mtx, MA_OWNED); \
336 (_sc)->sc_iflist_xcnt--; \
337 } while (0)
338
339 #define BRIDGE_INPUT(_ifp, _m) do { \
340 KASSERT(bridge_input_p != NULL, \
341 ("%s: if_bridge not loaded!", __func__)); \
342 _m = (*bridge_input_p)(_ifp, _m); \
343 if (_m != NULL) \
344 _ifp = _m->m_pkthdr.rcvif; \
345 } while (0)
346
347 #define BRIDGE_OUTPUT(_ifp, _m, _err) do { \
348 KASSERT(bridge_output_p != NULL, \
349 ("%s: if_bridge not loaded!", __func__)); \
350 _err = (*bridge_output_p)(_ifp, _m, NULL, NULL); \
351 } while (0)
352
353 extern const uint8_t bstp_etheraddr[];
354
355 void bridge_enqueue(struct bridge_softc *, struct ifnet *, struct mbuf *);
356 void bridge_rtdelete(struct bridge_softc *, struct ifnet *ifp, int);
357
358 extern struct mbuf *(*bridge_input_p)(struct ifnet *, struct mbuf *);
359 extern int (*bridge_output_p)(struct ifnet *, struct mbuf *,
360 struct sockaddr *, struct rtentry *);
361 extern void (*bridge_dn_p)(struct mbuf *, struct ifnet *);
362 extern void (*bridge_detach_p)(struct ifnet *);
363 extern void (*bstp_linkstate_p)(struct ifnet *ifp, int state);
364
365 void bstp_initialization(struct bridge_softc *);
366 void bstp_linkstate(struct ifnet *, int);
367 void bstp_stop(struct bridge_softc *);
368 struct mbuf *bstp_input(struct ifnet *, struct mbuf *);
369
370
371 #endif /* _KERNEL */
Cache object: d8b174088eedc40d12e9405479e1e49b
|