Home | History | Annotate | Line # | Download | only in net
if_bridgevar.h revision 1.4
      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 (at) 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 
     71 /*
     72  * Data structure and control definitions for bridge interfaces.
     73  */
     74 
     75 #include <sys/callout.h>
     76 #include <sys/queue.h>
     77 
     78 /*
     79  * Commands used in the SIOCSDRVSPEC ioctl.  Note the lookup of the
     80  * bridge interface itself is keyed off the ifdrv structure.
     81  */
     82 #define	BRDGADD			0	/* add bridge member (ifbreq) */
     83 #define	BRDGDEL			1	/* delete bridge member (ifbreq) */
     84 #define	BRDGGIFFLGS		2	/* get member if flags (ifbreq) */
     85 #define	BRDGSIFFLGS		3	/* set member if flags (ifbreq) */
     86 #define	BRDGSCACHE		4	/* set cache size (ifbrparam) */
     87 #define	BRDGGCACHE		5	/* get cache size (ifbrparam) */
     88 #define	BRDGGIFS		6	/* get member list (ifbifconf) */
     89 #define	BRDGRTS			7	/* get address list (ifbaconf) */
     90 #define	BRDGSADDR		8	/* set static address (ifbareq) */
     91 #define	BRDGSTO			9	/* set cache timeout (ifbrparam) */
     92 #define	BRDGGTO			10	/* get cache timeout (ifbrparam) */
     93 #define	BRDGDADDR		11	/* delete address (ifbareq) */
     94 #define	BRDGFLUSH		12	/* flush address cache (ifbreq) */
     95 
     96 #define	BRDGGPRI		13	/* get priority (ifbrparam) */
     97 #define	BRDGSPRI		14	/* set priority (ifbrparam) */
     98 #define	BRDGGHT			15	/* get hello time (ifbrparam) */
     99 #define	BRDGSHT			16	/* set hello time (ifbrparam) */
    100 #define	BRDGGFD			17	/* get forward delay (ifbrparam) */
    101 #define	BRDGSFD			18	/* set forward delay (ifbrparam) */
    102 #define	BRDGGMA			19	/* get max age (ifbrparam) */
    103 #define	BRDGSMA			20	/* set max age (ifbrparam) */
    104 #define	BRDGSIFPRIO		21	/* set if priority (ifbreq) */
    105 #define BRDGSIFCOST		22	/* set if path cost (ifbreq) */
    106 #define BRDGGFILT	        23	/* get filter flags (ifbrparam) */
    107 #define BRDGSFILT	        24	/* set filter flags (ifbrparam) */
    108 
    109 /*
    110  * Generic bridge control request.
    111  */
    112 struct ifbreq {
    113 	char		ifbr_ifsname[IFNAMSIZ];	/* member if name */
    114 	uint32_t	ifbr_ifsflags;		/* member if flags */
    115 	uint8_t		ifbr_state;		/* member if STP state */
    116 	uint8_t		ifbr_priority;		/* member if STP priority */
    117 	uint8_t		ifbr_path_cost;		/* member if STP cost */
    118 	uint8_t		ifbr_portno;		/* member if port number */
    119 };
    120 
    121 /* BRDGGIFFLAGS, BRDGSIFFLAGS */
    122 #define	IFBIF_LEARNING		0x01	/* if can learn */
    123 #define	IFBIF_DISCOVER		0x02	/* if sends packets w/ unknown dest. */
    124 #define	IFBIF_STP		0x04	/* if participates in spanning tree */
    125 
    126 #define	IFBIFBITS	"\020\1LEARNING\2DISCOVER\3STP"
    127 
    128 /* BRDGFLUSH */
    129 #define	IFBF_FLUSHDYN		0x00	/* flush learned addresses only */
    130 #define	IFBF_FLUSHALL		0x01	/* flush all addresses */
    131 
    132 /* BRDGSFILT */
    133 #define IFBF_FILT_USEIPF	0x00000001 /* enable ipf on bridge */
    134 #define IFBF_FILT_MASK		0x00000001 /* mask of valid values */
    135 
    136 /* STP port states */
    137 #define	BSTP_IFSTATE_DISABLED	0
    138 #define	BSTP_IFSTATE_LISTENING	1
    139 #define	BSTP_IFSTATE_LEARNING	2
    140 #define	BSTP_IFSTATE_FORWARDING	3
    141 #define	BSTP_IFSTATE_BLOCKING	4
    142 
    143 /*
    144  * Interface list structure.
    145  */
    146 struct ifbifconf {
    147 	uint32_t	ifbic_len;	/* buffer size */
    148 	union {
    149 		caddr_t	ifbicu_buf;
    150 		struct ifbreq *ifbicu_req;
    151 	} ifbic_ifbicu;
    152 #define	ifbic_buf	ifbic_ifbicu.ifbicu_buf
    153 #define	ifbic_req	ifbic_ifbicu.ifbicu_req
    154 };
    155 
    156 /*
    157  * Bridge address request.
    158  */
    159 struct ifbareq {
    160 	char		ifba_ifsname[IFNAMSIZ];	/* member if name */
    161 	unsigned long	ifba_expire;		/* address expire time */
    162 	uint8_t		ifba_flags;		/* address flags */
    163 	uint8_t		ifba_dst[ETHER_ADDR_LEN];/* destination address */
    164 };
    165 
    166 #define	IFBAF_TYPEMASK	0x03	/* address type mask */
    167 #define	IFBAF_DYNAMIC	0x00	/* dynamically learned address */
    168 #define	IFBAF_STATIC	0x01	/* static address */
    169 
    170 #define	IFBAFBITS	"\020\1STATIC"
    171 
    172 /*
    173  * Address list structure.
    174  */
    175 struct ifbaconf {
    176 	uint32_t	ifbac_len;	/* buffer size */
    177 	union {
    178 		caddr_t ifbacu_buf;
    179 		struct ifbareq *ifbacu_req;
    180 	} ifbac_ifbacu;
    181 #define	ifbac_buf	ifbac_ifbacu.ifbacu_buf
    182 #define	ifbac_req	ifbac_ifbacu.ifbacu_req
    183 };
    184 
    185 /*
    186  * Bridge parameter structure.
    187  */
    188 struct ifbrparam {
    189 	union {
    190 		uint32_t ifbrpu_int32;
    191 		uint16_t ifbrpu_int16;
    192 		uint8_t ifbrpu_int8;
    193 	} ifbrp_ifbrpu;
    194 };
    195 #define	ifbrp_csize	ifbrp_ifbrpu.ifbrpu_int32	/* cache size */
    196 #define	ifbrp_ctime	ifbrp_ifbrpu.ifbrpu_int32	/* cache time (sec) */
    197 #define	ifbrp_prio	ifbrp_ifbrpu.ifbrpu_int16	/* bridge priority */
    198 #define	ifbrp_hellotime	ifbrp_ifbrpu.ifbrpu_int8	/* hello time (sec) */
    199 #define	ifbrp_fwddelay	ifbrp_ifbrpu.ifbrpu_int8	/* fwd time (sec) */
    200 #define	ifbrp_maxage	ifbrp_ifbrpu.ifbrpu_int8	/* max age (sec) */
    201 #define	ifbrp_filter	ifbrp_ifbrpu.ifbrpu_int32	/* filtering flags */
    202 
    203 #ifdef _KERNEL
    204 /*
    205  * Timekeeping structure used in spanning tree code.
    206  */
    207 struct bridge_timer {
    208 	uint16_t	active;
    209 	uint16_t	value;
    210 };
    211 
    212 struct bstp_config_unit {
    213 	uint64_t	cu_rootid;
    214 	uint64_t	cu_bridge_id;
    215 	uint32_t	cu_root_path_cost;
    216 	uint16_t	cu_message_age;
    217 	uint16_t	cu_max_age;
    218 	uint16_t	cu_hello_time;
    219 	uint16_t	cu_forward_delay;
    220 	uint16_t	cu_port_id;
    221 	uint8_t		cu_message_type;
    222 	uint8_t		cu_topology_change_acknowledgment;
    223 	uint8_t		cu_topology_change;
    224 };
    225 
    226 struct bstp_tcn_unit {
    227 	uint8_t		tu_message_type;
    228 };
    229 
    230 /*
    231  * Bridge interface list entry.
    232  */
    233 struct bridge_iflist {
    234 	LIST_ENTRY(bridge_iflist) bif_next;
    235 	uint64_t		bif_designated_root;
    236 	uint64_t		bif_designated_bridge;
    237 	uint32_t		bif_path_cost;
    238 	uint32_t		bif_designated_cost;
    239 	struct bridge_timer	bif_hold_timer;
    240 	struct bridge_timer	bif_message_age_timer;
    241 	struct bridge_timer	bif_forward_delay_timer;
    242 	struct bstp_config_unit	bif_config_bpdu;
    243 	uint16_t		bif_port_id;
    244 	uint16_t		bif_designated_port;
    245 	uint8_t			bif_state;
    246 	uint8_t			bif_topology_change_acknowledge;
    247 	uint8_t			bif_config_pending;
    248 	uint8_t			bif_change_detection_enabled;
    249 	uint8_t			bif_priority;
    250 	struct ifnet		*bif_ifp;	/* member if */
    251 	uint32_t		bif_flags;	/* member if flags */
    252 };
    253 
    254 /*
    255  * Bridge route node.
    256  */
    257 struct bridge_rtnode {
    258 	LIST_ENTRY(bridge_rtnode) brt_hash;	/* hash table linkage */
    259 	LIST_ENTRY(bridge_rtnode) brt_list;	/* list linkage */
    260 	struct ifnet		*brt_ifp;	/* destination if */
    261 	unsigned long		brt_expire;	/* expiration time */
    262 	uint8_t			brt_flags;	/* address flags */
    263 	uint8_t			brt_addr[ETHER_ADDR_LEN];
    264 };
    265 
    266 /*
    267  * Software state for each bridge.
    268  */
    269 struct bridge_softc {
    270 	struct ifnet		sc_if;
    271 	LIST_ENTRY(bridge_softc) sc_list;
    272 	uint64_t		sc_designated_root;
    273 	uint64_t		sc_bridge_id;
    274 	struct bridge_iflist	*sc_root_port;
    275 	uint32_t		sc_root_path_cost;
    276 	uint16_t		sc_max_age;
    277 	uint16_t		sc_hello_time;
    278 	uint16_t		sc_forward_delay;
    279 	uint16_t		sc_bridge_max_age;
    280 	uint16_t		sc_bridge_hello_time;
    281 	uint16_t		sc_bridge_forward_delay;
    282 	uint16_t		sc_topology_change_time;
    283 	uint16_t		sc_hold_time;
    284 	uint16_t		sc_bridge_priority;
    285 	uint8_t			sc_topology_change_detected;
    286 	uint8_t			sc_topology_change;
    287 	struct bridge_timer	sc_hello_timer;
    288 	struct bridge_timer	sc_topology_change_timer;
    289 	struct bridge_timer	sc_tcn_timer;
    290 	uint32_t		sc_brtmax;	/* max # of addresses */
    291 	uint32_t		sc_brtcnt;	/* cur. # of addresses */
    292 	uint32_t		sc_brttimeout;	/* rt timeout in seconds */
    293 	struct callout		sc_brcallout;	/* bridge callout */
    294 	struct callout		sc_bstpcallout;	/* STP callout */
    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 	uint32_t		sc_filter_flags; /* ipf and flags */
    300 };
    301 
    302 extern const uint8_t bstp_etheraddr[];
    303 
    304 void	bridge_ifdetach(struct ifnet *);
    305 
    306 int	bridge_output(struct ifnet *, struct mbuf *, struct sockaddr *,
    307 	    struct rtentry *);
    308 struct mbuf *bridge_input(struct ifnet *, struct mbuf *);
    309 
    310 void	bstp_initialization(struct bridge_softc *);
    311 void	bstp_stop(struct bridge_softc *);
    312 struct mbuf *bstp_input(struct ifnet *, struct mbuf *);
    313 
    314 void	bridge_enqueue(struct bridge_softc *, struct ifnet *, struct mbuf *);
    315 
    316 #endif /* _KERNEL */
    317