bridgestp.h revision 164880
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: head/sys/net/bridgestp.h 164880 2006-12-04 14:45:02Z syrinx $ 71 */ 72 73/* 74 * Data structure and control definitions for STP interfaces. 75 */ 76 77#include <sys/callout.h> 78#include <sys/queue.h> 79 80/* STP port states */ 81#define BSTP_IFSTATE_DISABLED 0 82#define BSTP_IFSTATE_LISTENING 1 83#define BSTP_IFSTATE_LEARNING 2 84#define BSTP_IFSTATE_FORWARDING 3 85#define BSTP_IFSTATE_BLOCKING 4 86#define BSTP_IFSTATE_DISCARDING 5 87 88#define BSTP_TCSTATE_ACTIVE 1 89#define BSTP_TCSTATE_DETECTED 2 90#define BSTP_TCSTATE_INACTIVE 3 91#define BSTP_TCSTATE_LEARNING 4 92#define BSTP_TCSTATE_PROPAG 5 93#define BSTP_TCSTATE_ACK 6 94#define BSTP_TCSTATE_TC 7 95#define BSTP_TCSTATE_TCN 8 96 97#define BSTP_ROLE_DISABLED 0 98#define BSTP_ROLE_ROOT 1 99#define BSTP_ROLE_DESIGNATED 2 100#define BSTP_ROLE_ALTERNATE 3 101#define BSTP_ROLE_BACKUP 4 102 103#ifdef _KERNEL 104 105/* STP port flags */ 106#define BSTP_PORT_CANMIGRATE 0x0001 107#define BSTP_PORT_NEWINFO 0x0002 108#define BSTP_PORT_DISPUTED 0x0004 109#define BSTP_PORT_ADMCOST 0x0008 110#define BSTP_PORT_AUTOEDGE 0x0010 111#define BSTP_PORT_AUTOP2P 0x0020 112#define BSTP_PORT_ADMEDGE 0x0040 113 114/* BPDU priority */ 115#define BSTP_PDU_SUPERIOR 1 116#define BSTP_PDU_REPEATED 2 117#define BSTP_PDU_INFERIOR 3 118#define BSTP_PDU_INFERIORALT 4 119#define BSTP_PDU_OTHER 5 120 121/* BPDU flags */ 122#define BSTP_PDU_PRMASK 0x0c /* Port Role */ 123#define BSTP_PDU_PRSHIFT 2 /* Port Role offset */ 124#define BSTP_PDU_F_UNKN 0x00 /* Unknown port (00) */ 125#define BSTP_PDU_F_ALT 0x01 /* Alt/Backup port (01) */ 126#define BSTP_PDU_F_ROOT 0x02 /* Root port (10) */ 127#define BSTP_PDU_F_DESG 0x03 /* Designated port (11) */ 128 129#define BSTP_PDU_STPMASK 0x81 /* strip unused STP flags */ 130#define BSTP_PDU_RSTPMASK 0x7f /* strip unused RSTP flags */ 131#define BSTP_PDU_F_TC 0x01 /* Topology change */ 132#define BSTP_PDU_F_P 0x02 /* Proposal flag */ 133#define BSTP_PDU_F_L 0x10 /* Learning flag */ 134#define BSTP_PDU_F_F 0x20 /* Forwarding flag */ 135#define BSTP_PDU_F_A 0x40 /* Agreement flag */ 136#define BSTP_PDU_F_TCA 0x80 /* Topology change ack */ 137 138/* 139 * Spanning tree defaults. 140 */ 141#define BSTP_DEFAULT_MAX_AGE (20 * 256) 142#define BSTP_DEFAULT_HELLO_TIME (2 * 256) 143#define BSTP_DEFAULT_FORWARD_DELAY (15 * 256) 144#define BSTP_DEFAULT_HOLD_TIME (1 * 256) 145#define BSTP_DEFAULT_MIGRATE_DELAY (3 * 256) 146#define BSTP_DEFAULT_HOLD_COUNT 6 147#define BSTP_DEFAULT_BRIDGE_PRIORITY 0x8000 148#define BSTP_DEFAULT_PORT_PRIORITY 0x80 149#define BSTP_DEFAULT_PATH_COST 55 150#define BSTP_MIN_HELLO_TIME (1 * 256) 151#define BSTP_MIN_MAX_AGE (6 * 256) 152#define BSTP_MIN_FORWARD_DELAY (4 * 256) 153#define BSTP_MIN_HOLD_COUNT 1 154#define BSTP_MAX_HELLO_TIME (2 * 256) 155#define BSTP_MAX_MAX_AGE (40 * 256) 156#define BSTP_MAX_FORWARD_DELAY (30 * 256) 157#define BSTP_MAX_HOLD_COUNT 10 158#define BSTP_MAX_PRIORITY 61440 159#define BSTP_MAX_PORT_PRIORITY 240 160#define BSTP_MAX_PATH_COST 200000000 161 162/* BPDU message types */ 163#define BSTP_MSGTYPE_CFG 0x00 /* Configuration */ 164#define BSTP_MSGTYPE_RSTP 0x02 /* Rapid STP */ 165#define BSTP_MSGTYPE_TCN 0x80 /* Topology chg notification */ 166 167/* Protocol versions */ 168#define BSTP_PROTO_ID 0x00 169#define BSTP_PROTO_STP 0x00 170#define BSTP_PROTO_RSTP 0x02 171#define BSTP_PROTO_MAX BSTP_PROTO_RSTP 172 173#define BSTP_INFO_RECIEVED 1 174#define BSTP_INFO_MINE 2 175#define BSTP_INFO_AGED 3 176#define BSTP_INFO_DISABLED 4 177 178 179#define BSTP_MESSAGE_AGE_INCR (1 * 256) /* in 256ths of a second */ 180#define BSTP_TICK_VAL (1 * 256) /* in 256ths of a second */ 181#define BSTP_LINK_TIMER (BSTP_TICK_VAL * 15) 182 183/* 184 * Driver callbacks for STP state changes 185 */ 186typedef void (*bstp_state_cb_t)(struct ifnet *, int); 187typedef void (*bstp_rtage_cb_t)(struct ifnet *, int); 188 189/* 190 * Because BPDU's do not make nicely aligned structures, two different 191 * declarations are used: bstp_?bpdu (wire representation, packed) and 192 * bstp_*_unit (internal, nicely aligned version). 193 */ 194 195/* configuration bridge protocol data unit */ 196struct bstp_cbpdu { 197 uint8_t cbu_dsap; /* LLC: destination sap */ 198 uint8_t cbu_ssap; /* LLC: source sap */ 199 uint8_t cbu_ctl; /* LLC: control */ 200 uint16_t cbu_protoid; /* protocol id */ 201 uint8_t cbu_protover; /* protocol version */ 202 uint8_t cbu_bpdutype; /* message type */ 203 uint8_t cbu_flags; /* flags (below) */ 204 205 /* root id */ 206 uint16_t cbu_rootpri; /* root priority */ 207 uint8_t cbu_rootaddr[6]; /* root address */ 208 209 uint32_t cbu_rootpathcost; /* root path cost */ 210 211 /* bridge id */ 212 uint16_t cbu_bridgepri; /* bridge priority */ 213 uint8_t cbu_bridgeaddr[6]; /* bridge address */ 214 215 uint16_t cbu_portid; /* port id */ 216 uint16_t cbu_messageage; /* current message age */ 217 uint16_t cbu_maxage; /* maximum age */ 218 uint16_t cbu_hellotime; /* hello time */ 219 uint16_t cbu_forwarddelay; /* forwarding delay */ 220 uint8_t cbu_versionlen; /* version 1 length */ 221} __packed; 222#define BSTP_BPDU_STP_LEN (3 + 35) /* LLC + STP pdu */ 223#define BSTP_BPDU_RSTP_LEN (3 + 36) /* LLC + RSTP pdu */ 224 225/* topology change notification bridge protocol data unit */ 226struct bstp_tbpdu { 227 uint8_t tbu_dsap; /* LLC: destination sap */ 228 uint8_t tbu_ssap; /* LLC: source sap */ 229 uint8_t tbu_ctl; /* LLC: control */ 230 uint16_t tbu_protoid; /* protocol id */ 231 uint8_t tbu_protover; /* protocol version */ 232 uint8_t tbu_bpdutype; /* message type */ 233} __packed; 234 235/* 236 * Timekeeping structure used in spanning tree code. 237 */ 238struct bstp_timer { 239 int active; 240 int latched; 241 int value; 242}; 243 244struct bstp_pri_vector { 245 uint64_t pv_root_id; 246 uint32_t pv_cost; 247 uint64_t pv_dbridge_id; 248 uint16_t pv_dport_id; 249 uint16_t pv_port_id; 250}; 251 252struct bstp_config_unit { 253 struct bstp_pri_vector cu_pv; 254 uint16_t cu_message_age; 255 uint16_t cu_max_age; 256 uint16_t cu_forward_delay; 257 uint16_t cu_hello_time; 258 uint8_t cu_message_type; 259 uint8_t cu_topology_change_ack; 260 uint8_t cu_topology_change; 261 uint8_t cu_proposal; 262 uint8_t cu_agree; 263 uint8_t cu_learning; 264 uint8_t cu_forwarding; 265 uint8_t cu_role; 266}; 267 268struct bstp_tcn_unit { 269 uint8_t tu_message_type; 270}; 271 272struct bstp_port { 273 LIST_ENTRY(bstp_port) bp_next; 274 struct ifnet *bp_ifp; /* parent if */ 275 struct bstp_state *bp_bs; 276 uint8_t bp_active; 277 uint8_t bp_protover; 278 uint32_t bp_flags; 279 uint32_t bp_path_cost; 280 uint16_t bp_port_msg_age; 281 uint16_t bp_port_max_age; 282 uint16_t bp_port_fdelay; 283 uint16_t bp_port_htime; 284 uint16_t bp_desg_msg_age; 285 uint16_t bp_desg_max_age; 286 uint16_t bp_desg_fdelay; 287 uint16_t bp_desg_htime; 288 struct bstp_timer bp_edge_delay_timer; 289 struct bstp_timer bp_forward_delay_timer; 290 struct bstp_timer bp_hello_timer; 291 struct bstp_timer bp_message_age_timer; 292 struct bstp_timer bp_migrate_delay_timer; 293 struct bstp_timer bp_recent_backup_timer; 294 struct bstp_timer bp_recent_root_timer; 295 struct bstp_timer bp_tc_timer; 296 struct bstp_config_unit bp_msg_cu; 297 struct bstp_pri_vector bp_desg_pv; 298 struct bstp_pri_vector bp_port_pv; 299 uint16_t bp_port_id; 300 uint8_t bp_state; 301 uint8_t bp_tcstate; 302 uint8_t bp_role; 303 uint8_t bp_infois; 304 uint8_t bp_tc_ack; 305 uint8_t bp_tc_prop; 306 uint8_t bp_fdbflush; 307 uint8_t bp_priority; 308 uint8_t bp_p2p_link; 309 uint8_t bp_agree; 310 uint8_t bp_agreed; 311 uint8_t bp_sync; 312 uint8_t bp_synced; 313 uint8_t bp_proposing; 314 uint8_t bp_proposed; 315 uint8_t bp_operedge; 316 uint8_t bp_reroot; 317 uint8_t bp_rcvdtc; 318 uint8_t bp_rcvdtca; 319 uint8_t bp_rcvdtcn; 320 uint32_t bp_forward_transitions; 321 uint8_t bp_txcount; 322 struct task bp_statetask; 323 struct task bp_rtagetask; 324}; 325 326/* 327 * Software state for each bridge STP. 328 */ 329struct bstp_state { 330 LIST_ENTRY(bstp_state) bs_list; 331 uint8_t bs_running; 332 struct mtx bs_mtx; 333 struct bstp_pri_vector bs_bridge_pv; 334 struct bstp_pri_vector bs_root_pv; 335 struct bstp_port *bs_root_port; 336 uint8_t bs_protover; 337 uint16_t bs_migration_delay; 338 uint16_t bs_edge_delay; 339 uint16_t bs_bridge_max_age; 340 uint16_t bs_bridge_fdelay; 341 uint16_t bs_bridge_htime; 342 uint16_t bs_root_msg_age; 343 uint16_t bs_root_max_age; 344 uint16_t bs_root_fdelay; 345 uint16_t bs_root_htime; 346 uint16_t bs_hold_time; 347 uint16_t bs_bridge_priority; 348 uint8_t bs_txholdcount; 349 uint8_t bs_allsynced; 350 struct callout bs_bstpcallout; /* STP callout */ 351 struct bstp_timer bs_link_timer; 352 struct timeval bs_last_tc_time; 353 LIST_HEAD(, bstp_port) bs_bplist; 354 bstp_state_cb_t bs_state_cb; 355 bstp_rtage_cb_t bs_rtage_cb; 356}; 357 358#define BSTP_LOCK_INIT(_bs) mtx_init(&(_bs)->bs_mtx, "bstp", NULL, MTX_DEF) 359#define BSTP_LOCK_DESTROY(_bs) mtx_destroy(&(_bs)->bs_mtx) 360#define BSTP_LOCK(_bs) mtx_lock(&(_bs)->bs_mtx) 361#define BSTP_UNLOCK(_bs) mtx_unlock(&(_bs)->bs_mtx) 362#define BSTP_LOCK_ASSERT(_bs) mtx_assert(&(_bs)->bs_mtx, MA_OWNED) 363 364extern const uint8_t bstp_etheraddr[]; 365 366extern void (*bstp_linkstate_p)(struct ifnet *ifp, int state); 367 368void bstp_attach(struct bstp_state *, bstp_state_cb_t, bstp_rtage_cb_t); 369void bstp_detach(struct bstp_state *); 370void bstp_init(struct bstp_state *); 371void bstp_stop(struct bstp_state *); 372int bstp_create(struct bstp_state *, struct bstp_port *, struct ifnet *); 373int bstp_enable(struct bstp_port *); 374void bstp_disable(struct bstp_port *); 375void bstp_destroy(struct bstp_port *); 376void bstp_linkstate(struct ifnet *, int); 377int bstp_set_htime(struct bstp_state *, int); 378int bstp_set_fdelay(struct bstp_state *, int); 379int bstp_set_maxage(struct bstp_state *, int); 380int bstp_set_holdcount(struct bstp_state *, int); 381int bstp_set_protocol(struct bstp_state *, int); 382int bstp_set_priority(struct bstp_state *, int); 383int bstp_set_port_priority(struct bstp_port *, int); 384int bstp_set_path_cost(struct bstp_port *, uint32_t); 385int bstp_set_edge(struct bstp_port *, int); 386int bstp_set_autoedge(struct bstp_port *, int); 387int bstp_set_p2p(struct bstp_port *, int); 388int bstp_set_autop2p(struct bstp_port *, int); 389struct mbuf *bstp_input(struct bstp_port *, struct ifnet *, struct mbuf *); 390 391#endif /* _KERNEL */ 392