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