ieee80211_node.h revision 1.3
1 /* $NetBSD: ieee80211_node.h,v 1.3 2003/09/14 01:14:55 dyoung Exp $ */ 2 /*- 3 * Copyright (c) 2001 Atsushi Onoe 4 * Copyright (c) 2002, 2003 Sam Leffler, Errno Consulting 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. The name of the author may not be used to endorse or promote products 16 * derived from this software without specific prior written permission. 17 * 18 * Alternatively, this software may be distributed under the terms of the 19 * GNU General Public License ("GPL") version 2 as published by the Free 20 * Software Foundation. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 25 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 31 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 * 33 * $FreeBSD: src/sys/net80211/ieee80211_node.h,v 1.5 2003/08/19 22:17:03 sam Exp $ 34 */ 35 #ifndef _NET80211_IEEE80211_NODE_H_ 36 #define _NET80211_IEEE80211_NODE_H_ 37 38 #define IEEE80211_PSCAN_WAIT 5 /* passive scan wait */ 39 #define IEEE80211_TRANS_WAIT 5 /* transition wait */ 40 #define IEEE80211_INACT_WAIT 5 /* inactivity timer interval */ 41 #define IEEE80211_INACT_MAX (300/IEEE80211_INACT_WAIT) 42 43 #define IEEE80211_NODE_HASHSIZE 32 44 /* simple hash is enough for variation of macaddr */ 45 #define IEEE80211_NODE_HASH(addr) \ 46 (((u_int8_t *)(addr))[IEEE80211_ADDR_LEN - 1] % IEEE80211_NODE_HASHSIZE) 47 48 #define IEEE80211_RATE_SIZE 8 /* 802.11 standard */ 49 #define IEEE80211_RATE_MAXSIZE 15 /* max rates we'll handle */ 50 51 struct ieee80211_rateset { 52 u_int8_t rs_nrates; 53 u_int8_t rs_rates[IEEE80211_RATE_MAXSIZE]; 54 }; 55 56 /* 57 * Node specific information. Note that drivers are expected 58 * to derive from this structure to add device-specific per-node 59 * state. This is done by overriding the ic_node_* methods in 60 * the ieee80211com structure. 61 */ 62 struct ieee80211_node { 63 TAILQ_ENTRY(ieee80211_node) ni_list; 64 LIST_ENTRY(ieee80211_node) ni_hash; 65 u_int ni_refcnt; 66 67 /* hardware */ 68 u_int32_t ni_rstamp; /* recv timestamp */ 69 u_int8_t ni_rssi; /* recv ssi */ 70 71 /* header */ 72 u_int8_t ni_macaddr[IEEE80211_ADDR_LEN]; 73 u_int8_t ni_bssid[IEEE80211_ADDR_LEN]; 74 75 /* beacon, probe response */ 76 u_int8_t ni_tstamp[8]; /* from last rcv'd beacon */ 77 u_int16_t ni_intval; /* beacon interval */ 78 u_int16_t ni_capinfo; /* capabilities */ 79 u_int8_t ni_esslen; 80 u_int8_t ni_essid[IEEE80211_NWID_LEN]; 81 struct ieee80211_rateset ni_rates; /* negotiated rate set */ 82 u_int8_t *ni_country; /* country information XXX */ 83 struct ieee80211_channel *ni_chan; 84 u_int16_t ni_fhdwell; /* FH only */ 85 u_int8_t ni_fhindex; /* FH only */ 86 u_int8_t ni_erp; /* 11g only */ 87 88 #ifdef notyet 89 /* DTIM and contention free period (CFP) */ 90 u_int8_t ni_dtimperiod; 91 u_int8_t ni_cfpperiod; /* # of DTIMs between CFPs */ 92 u_int16_t ni_cfpduremain; /* remaining cfp duration */ 93 u_int16_t ni_cfpmaxduration;/* max CFP duration in TU */ 94 u_int16_t ni_nextdtim; /* time to next DTIM */ 95 u_int16_t ni_timoffset; 96 #endif 97 98 /* others */ 99 u_int16_t ni_associd; /* assoc response */ 100 u_int16_t ni_txseq; /* seq to be transmitted */ 101 u_int16_t ni_rxseq; /* seq previous received */ 102 int ni_fails; /* failure count to associate */ 103 int ni_inact; /* inactivity mark count */ 104 int ni_txrate; /* index to ni_rates[] */ 105 }; 106 107 static __inline struct ieee80211_node * 108 ieee80211_ref_node(struct ieee80211_node *ni) 109 { 110 ieee80211_node_incref(ni); 111 return ni; 112 } 113 114 static __inline void 115 ieee80211_unref_node(struct ieee80211_node **ni) 116 { 117 ieee80211_node_decref(ni); 118 *ni = NULL; /* guard against use */ 119 } 120 121 struct ieee80211com; 122 123 extern void ieee80211_node_attach(struct ifnet *); 124 extern void ieee80211_node_lateattach(struct ifnet *); 125 extern void ieee80211_node_detach(struct ifnet *); 126 127 extern void ieee80211_begin_scan(struct ifnet *); 128 extern void ieee80211_next_scan(struct ifnet *); 129 extern void ieee80211_end_scan(struct ifnet *); 130 extern struct ieee80211_node *ieee80211_alloc_node(struct ieee80211com *, 131 u_int8_t *); 132 extern struct ieee80211_node *ieee80211_dup_bss(struct ieee80211com *, 133 u_int8_t *); 134 extern struct ieee80211_node *ieee80211_find_node(struct ieee80211com *, 135 u_int8_t *); 136 extern struct ieee80211_node * ieee80211_lookup_node(struct ieee80211com *, 137 u_int8_t *macaddr, struct ieee80211_channel *); 138 extern void ieee80211_free_node(struct ieee80211com *, 139 struct ieee80211_node *); 140 extern void ieee80211_free_allnodes(struct ieee80211com *); 141 typedef void ieee80211_iter_func(void *, struct ieee80211_node *); 142 extern void ieee80211_iterate_nodes(struct ieee80211com *ic, 143 ieee80211_iter_func *, void *); 144 extern void ieee80211_timeout_nodes(struct ieee80211com *); 145 146 extern void ieee80211_create_ibss(struct ieee80211com* , 147 struct ieee80211_channel *); 148 #endif /* _NET80211_IEEE80211_NODE_H_ */ 149
Indexes created Tue Sep 30 11:09:46 GMT 2025