1 /* $NetBSD: ieee80211_node.c,v 1.62 2008/12/17 20:51:37 cegger Exp $ */
3 * Copyright (c) 2001 Atsushi Onoe
4 * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
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.
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.
34 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD: src/sys/net80211/ieee80211_node.c,v 1.65 2005/08/13 17:50:21 sam Exp $");
39 __KERNEL_RCSID(0, "$NetBSD: ieee80211_node.c,v 1.62 2008/12/17 20:51:37 cegger Exp $");
44 #include <sys/param.h>
45 #include <sys/systm.h>
47 #include <sys/malloc.h>
48 #include <sys/kernel.h>
50 #include <sys/socket.h>
51 #include <sys/sockio.h>
52 #include <sys/endian.h>
53 #include <sys/errno.h>
55 #include <sys/sysctl.h>
58 #include <net/if_media.h>
59 #include <net/if_arp.h>
60 #include <net/if_ether.h>
61 #include <net/if_llc.h>
63 #include <net80211/ieee80211_netbsd.h>
64 #include <net80211/ieee80211_var.h>
69 #include <netinet/in.h>
70 #include <net/if_ether.h>
74 * Association id's are managed with a bit vector.
76 #define IEEE80211_AID_SET(b, w) \
77 ((w)[IEEE80211_AID(b) / 32] |= (1 << (IEEE80211_AID(b) % 32)))
78 #define IEEE80211_AID_CLR(b, w) \
79 ((w)[IEEE80211_AID(b) / 32] &= ~(1 << (IEEE80211_AID(b) % 32)))
80 #define IEEE80211_AID_ISSET(b, w) \
81 ((w)[IEEE80211_AID(b) / 32] & (1 << (IEEE80211_AID(b) % 32)))
83 static struct ieee80211_node
*node_alloc(struct ieee80211_node_table
*);
84 static void node_cleanup(struct ieee80211_node
*);
85 static void node_free(struct ieee80211_node
*);
86 static u_int8_t
node_getrssi(const struct ieee80211_node
*);
88 static void ieee80211_setup_node(struct ieee80211_node_table
*,
89 struct ieee80211_node
*, const u_int8_t
*);
90 static void _ieee80211_free_node(struct ieee80211_node
*);
91 static void ieee80211_free_allnodes(struct ieee80211_node_table
*);
93 static void ieee80211_timeout_scan_candidates(struct ieee80211_node_table
*);
94 static void ieee80211_timeout_stations(struct ieee80211_node_table
*);
96 static void ieee80211_set_tim(struct ieee80211_node
*, int set
);
98 static void ieee80211_node_table_init(struct ieee80211com
*ic
,
99 struct ieee80211_node_table
*nt
, const char *name
,
100 int inact
, int keyixmax
,
101 void (*timeout
)(struct ieee80211_node_table
*));
102 static void ieee80211_node_table_cleanup(struct ieee80211_node_table
*nt
);
104 MALLOC_DEFINE(M_80211_NODE
, "80211node", "802.11 node state");
107 ieee80211_node_attach(struct ieee80211com
*ic
)
110 ic
->ic_node_alloc
= node_alloc
;
111 ic
->ic_node_free
= node_free
;
112 ic
->ic_node_cleanup
= node_cleanup
;
113 ic
->ic_node_getrssi
= node_getrssi
;
115 /* default station inactivity timer setings */
116 ic
->ic_inact_init
= IEEE80211_INACT_INIT
;
117 ic
->ic_inact_auth
= IEEE80211_INACT_AUTH
;
118 ic
->ic_inact_run
= IEEE80211_INACT_RUN
;
119 ic
->ic_inact_probe
= IEEE80211_INACT_PROBE
;
121 /* NB: driver should override */
122 ic
->ic_max_aid
= IEEE80211_AID_DEF
;
123 ic
->ic_set_tim
= ieee80211_set_tim
;
127 ieee80211_node_lateattach(struct ieee80211com
*ic
)
129 struct ieee80211_rsnparms
*rsn
;
131 if (ic
->ic_max_aid
> IEEE80211_AID_MAX
)
132 ic
->ic_max_aid
= IEEE80211_AID_MAX
;
133 ic
->ic_aid_bitmap
= malloc(howmany(ic
->ic_max_aid
, 32) *
134 sizeof(u_int32_t
), M_DEVBUF
, M_NOWAIT
| M_ZERO
);
135 if (ic
->ic_aid_bitmap
== NULL
) {
136 /* XXX no way to recover */
137 printf("%s: no memory for AID bitmap!\n", __func__
);
141 /* XXX defer until using hostap/ibss mode */
142 ic
->ic_tim_len
= howmany(ic
->ic_max_aid
, 8) * sizeof(u_int8_t
);
143 ic
->ic_tim_bitmap
= malloc(ic
->ic_tim_len
, M_DEVBUF
, M_NOWAIT
| M_ZERO
);
144 if (ic
->ic_tim_bitmap
== NULL
) {
145 /* XXX no way to recover */
146 printf("%s: no memory for TIM bitmap!\n", __func__
);
149 ieee80211_node_table_init(ic
, &ic
->ic_sta
, "station",
150 IEEE80211_INACT_INIT
, ic
->ic_crypto
.cs_max_keyix
,
151 ieee80211_timeout_stations
);
152 ieee80211_node_table_init(ic
, &ic
->ic_scan
, "scan",
153 IEEE80211_INACT_SCAN
, 0,
154 ieee80211_timeout_scan_candidates
);
156 ieee80211_reset_bss(ic
);
158 * Setup "global settings" in the bss node so that
159 * each new station automatically inherits them.
161 rsn
= &ic
->ic_bss
->ni_rsn
;
162 /* WEP, TKIP, and AES-CCM are always supported */
163 rsn
->rsn_ucastcipherset
|= 1<<IEEE80211_CIPHER_WEP
;
164 rsn
->rsn_ucastcipherset
|= 1<<IEEE80211_CIPHER_TKIP
;
165 rsn
->rsn_ucastcipherset
|= 1<<IEEE80211_CIPHER_AES_CCM
;
166 if (ic
->ic_caps
& IEEE80211_C_AES
)
167 rsn
->rsn_ucastcipherset
|= 1<<IEEE80211_CIPHER_AES_OCB
;
168 if (ic
->ic_caps
& IEEE80211_C_CKIP
)
169 rsn
->rsn_ucastcipherset
|= 1<<IEEE80211_CIPHER_CKIP
;
171 * Default unicast cipher to WEP for 802.1x use. If
172 * WPA is enabled the management code will set these
175 rsn
->rsn_ucastcipher
= IEEE80211_CIPHER_WEP
;
176 rsn
->rsn_ucastkeylen
= 104 / NBBY
;
178 * WPA says the multicast cipher is the lowest unicast
179 * cipher supported. But we skip WEP which would
180 * otherwise be used based on this criteria.
182 rsn
->rsn_mcastcipher
= IEEE80211_CIPHER_TKIP
;
183 rsn
->rsn_mcastkeylen
= 128 / NBBY
;
186 * We support both WPA-PSK and 802.1x; the one used
187 * is determined by the authentication mode and the
188 * setting of the PSK state.
190 rsn
->rsn_keymgmtset
= WPA_ASE_8021X_UNSPEC
| WPA_ASE_8021X_PSK
;
191 rsn
->rsn_keymgmt
= WPA_ASE_8021X_PSK
;
193 ic
->ic_auth
= ieee80211_authenticator_get(ic
->ic_bss
->ni_authmode
);
197 ieee80211_node_detach(struct ieee80211com
*ic
)
200 if (ic
->ic_bss
!= NULL
) {
201 ieee80211_free_node(ic
->ic_bss
);
204 ieee80211_node_table_cleanup(&ic
->ic_scan
);
205 ieee80211_node_table_cleanup(&ic
->ic_sta
);
206 if (ic
->ic_aid_bitmap
!= NULL
) {
207 free(ic
->ic_aid_bitmap
, M_DEVBUF
);
208 ic
->ic_aid_bitmap
= NULL
;
210 if (ic
->ic_tim_bitmap
!= NULL
) {
211 free(ic
->ic_tim_bitmap
, M_DEVBUF
);
212 ic
->ic_tim_bitmap
= NULL
;
217 * Port authorize/unauthorize interfaces for use by an authenticator.
221 ieee80211_node_authorize(struct ieee80211_node
*ni
)
223 struct ieee80211com
*ic
= ni
->ni_ic
;
225 ni
->ni_flags
|= IEEE80211_NODE_AUTH
;
226 ni
->ni_inact_reload
= ic
->ic_inact_run
;
230 ieee80211_node_unauthorize(struct ieee80211_node
*ni
)
232 ni
->ni_flags
&= ~IEEE80211_NODE_AUTH
;
236 * Set/change the channel. The rate set is also updated as
237 * to insure a consistent view by drivers.
240 ieee80211_set_chan(struct ieee80211com
*ic
,
241 struct ieee80211_node
*ni
, struct ieee80211_channel
*chan
)
243 if (chan
== IEEE80211_CHAN_ANYC
) /* XXX while scanning */
244 chan
= ic
->ic_curchan
;
246 ni
->ni_rates
= ic
->ic_sup_rates
[ieee80211_chan2mode(ic
, chan
)];
250 * AP scanning support.
253 #ifdef IEEE80211_DEBUG
255 dump_chanlist(const u_char chans
[])
261 for (i
= 0; i
< IEEE80211_CHAN_MAX
; i
++)
262 if (isset(chans
, i
)) {
263 printf("%s%u", sep
, i
);
267 #endif /* IEEE80211_DEBUG */
270 * Initialize the channel set to scan based on the
271 * of available channels and the current PHY mode.
274 ieee80211_reset_scan(struct ieee80211com
*ic
)
277 /* XXX ic_des_chan should be handled with ic_chan_active */
278 if (ic
->ic_des_chan
!= IEEE80211_CHAN_ANYC
) {
279 memset(ic
->ic_chan_scan
, 0, sizeof(ic
->ic_chan_scan
));
280 setbit(ic
->ic_chan_scan
,
281 ieee80211_chan2ieee(ic
, ic
->ic_des_chan
));
283 memcpy(ic
->ic_chan_scan
, ic
->ic_chan_active
,
284 sizeof(ic
->ic_chan_active
));
285 #ifdef IEEE80211_DEBUG
286 if (ieee80211_msg_scan(ic
)) {
287 printf("%s: scan set:", __func__
);
288 dump_chanlist(ic
->ic_chan_scan
);
289 printf(" start chan %u\n",
290 ieee80211_chan2ieee(ic
, ic
->ic_curchan
));
292 #endif /* IEEE80211_DEBUG */
296 * Begin an active scan.
299 ieee80211_begin_scan(struct ieee80211com
*ic
, int reset
)
302 ic
->ic_scan
.nt_scangen
++;
304 * In all but hostap mode scanning starts off in
305 * an active mode before switching to passive.
307 if (ic
->ic_opmode
!= IEEE80211_M_HOSTAP
) {
308 ic
->ic_flags
|= IEEE80211_F_ASCAN
;
309 ic
->ic_stats
.is_scan_active
++;
311 ic
->ic_stats
.is_scan_passive
++;
312 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
,
313 "begin %s scan in %s mode, scangen %u\n",
314 (ic
->ic_flags
& IEEE80211_F_ASCAN
) ? "active" : "passive",
315 ieee80211_phymode_name
[ic
->ic_curmode
], ic
->ic_scan
.nt_scangen
);
317 * Clear scan state and flush any previously seen AP's.
319 ieee80211_reset_scan(ic
);
321 ieee80211_free_allnodes(&ic
->ic_scan
);
323 ic
->ic_flags
|= IEEE80211_F_SCAN
;
325 /* Scan the next channel. */
326 ieee80211_next_scan(ic
);
330 * Switch to the next channel marked for scanning.
333 ieee80211_next_scan(struct ieee80211com
*ic
)
335 struct ieee80211_channel
*chan
;
338 * Insure any previous mgt frame timeouts don't fire.
339 * This assumes the driver does the right thing in
340 * flushing anything queued in the driver and below.
342 ic
->ic_mgt_timer
= 0;
343 ic
->ic_flags_ext
&= ~IEEE80211_FEXT_PROBECHAN
;
345 chan
= ic
->ic_curchan
;
347 if (++chan
> &ic
->ic_channels
[IEEE80211_CHAN_MAX
])
348 chan
= &ic
->ic_channels
[0];
349 if (isset(ic
->ic_chan_scan
, ieee80211_chan2ieee(ic
, chan
))) {
350 clrbit(ic
->ic_chan_scan
, ieee80211_chan2ieee(ic
, chan
));
351 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
,
352 "%s: chan %d->%d\n", __func__
,
353 ieee80211_chan2ieee(ic
, ic
->ic_curchan
),
354 ieee80211_chan2ieee(ic
, chan
));
355 ic
->ic_curchan
= chan
;
357 * XXX drivers should do this as needed,
358 * XXX for now maintain compatibility
360 ic
->ic_bss
->ni_rates
=
361 ic
->ic_sup_rates
[ieee80211_chan2mode(ic
, chan
)];
362 ieee80211_new_state(ic
, IEEE80211_S_SCAN
, -1);
365 } while (chan
!= ic
->ic_curchan
);
366 ieee80211_end_scan(ic
);
371 * Probe the curent channel, if allowed, while scanning.
372 * If the channel is not marked passive-only then send
373 * a probe request immediately. Otherwise mark state and
374 * listen for beacons on the channel; if we receive something
375 * then we'll transmit a probe request.
378 ieee80211_probe_curchan(struct ieee80211com
*ic
, int force
)
380 struct ifnet
*ifp
= ic
->ic_ifp
;
382 if ((ic
->ic_curchan
->ic_flags
& IEEE80211_CHAN_PASSIVE
) == 0 || force
) {
384 * XXX send both broadcast+directed probe request
386 ieee80211_send_probereq(ic
->ic_bss
,
387 ic
->ic_myaddr
, ifp
->if_broadcastaddr
,
388 ifp
->if_broadcastaddr
,
389 ic
->ic_des_essid
, ic
->ic_des_esslen
,
390 ic
->ic_opt_ie
, ic
->ic_opt_ie_len
);
392 ic
->ic_flags_ext
|= IEEE80211_FEXT_PROBECHAN
;
396 copy_bss(struct ieee80211_node
*nbss
, const struct ieee80211_node
*obss
)
398 /* propagate useful state */
399 nbss
->ni_authmode
= obss
->ni_authmode
;
400 nbss
->ni_txpower
= obss
->ni_txpower
;
401 nbss
->ni_vlan
= obss
->ni_vlan
;
402 nbss
->ni_rsn
= obss
->ni_rsn
;
403 /* XXX statistics? */
407 ieee80211_create_ibss(struct ieee80211com
* ic
, struct ieee80211_channel
*chan
)
409 struct ieee80211_node_table
*nt
;
410 struct ieee80211_node
*ni
;
412 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
,
413 "%s: creating ibss\n", __func__
);
416 * Create the station/neighbor table. Note that for adhoc
417 * mode we make the initial inactivity timer longer since
418 * we create nodes only through discovery and they typically
419 * are long-lived associations.
422 IEEE80211_NODE_LOCK(nt
);
423 if (ic
->ic_opmode
== IEEE80211_M_HOSTAP
) {
424 nt
->nt_name
= "station";
425 nt
->nt_inact_init
= ic
->ic_inact_init
;
427 nt
->nt_name
= "neighbor";
428 nt
->nt_inact_init
= ic
->ic_inact_run
;
430 IEEE80211_NODE_UNLOCK(nt
);
432 ni
= ieee80211_alloc_node(&ic
->ic_sta
, ic
->ic_myaddr
);
437 IEEE80211_ADDR_COPY(ni
->ni_bssid
, ic
->ic_myaddr
);
438 ni
->ni_esslen
= ic
->ic_des_esslen
;
439 memcpy(ni
->ni_essid
, ic
->ic_des_essid
, ni
->ni_esslen
);
440 copy_bss(ni
, ic
->ic_bss
);
441 ni
->ni_intval
= ic
->ic_bintval
;
442 if (ic
->ic_flags
& IEEE80211_F_PRIVACY
)
443 ni
->ni_capinfo
|= IEEE80211_CAPINFO_PRIVACY
;
444 if (ic
->ic_phytype
== IEEE80211_T_FH
) {
445 ni
->ni_fhdwell
= 200; /* XXX */
448 if (ic
->ic_opmode
== IEEE80211_M_IBSS
) {
449 ic
->ic_flags
|= IEEE80211_F_SIBSS
;
450 ni
->ni_capinfo
|= IEEE80211_CAPINFO_IBSS
; /* XXX */
451 if (ic
->ic_flags
& IEEE80211_F_DESBSSID
)
452 IEEE80211_ADDR_COPY(ni
->ni_bssid
, ic
->ic_des_bssid
);
454 ni
->ni_bssid
[0] |= 0x02; /* local bit for IBSS */
457 * Fix the channel and related attributes.
459 ieee80211_set_chan(ic
, ni
, chan
);
460 ic
->ic_curchan
= chan
;
461 ic
->ic_curmode
= ieee80211_chan2mode(ic
, chan
);
463 * Do mode-specific rate setup.
465 if (ic
->ic_curmode
== IEEE80211_MODE_11G
) {
467 * Use a mixed 11b/11g rate set.
469 ieee80211_set11gbasicrates(&ni
->ni_rates
, IEEE80211_MODE_11G
);
470 } else if (ic
->ic_curmode
== IEEE80211_MODE_11B
) {
472 * Force pure 11b rate set.
474 ieee80211_set11gbasicrates(&ni
->ni_rates
, IEEE80211_MODE_11B
);
477 (void) ieee80211_sta_join(ic
, ieee80211_ref_node(ni
));
481 ieee80211_reset_bss(struct ieee80211com
*ic
)
483 struct ieee80211_node
*ni
, *obss
;
485 ieee80211_node_table_reset(&ic
->ic_scan
);
486 ieee80211_node_table_reset(&ic
->ic_sta
);
488 ni
= ieee80211_alloc_node(&ic
->ic_scan
, ic
->ic_myaddr
);
489 IASSERT(ni
!= NULL
, ("unable to setup inital BSS node"));
491 ic
->ic_bss
= ieee80211_ref_node(ni
);
494 ni
->ni_intval
= ic
->ic_bintval
;
495 ieee80211_free_node(obss
);
500 #define STA_FAILS_MAX 2 /* assoc failures before ignored */
503 ieee80211_match_bss(struct ieee80211com
*ic
, struct ieee80211_node
*ni
)
509 if (isclr(ic
->ic_chan_active
, ieee80211_chan2ieee(ic
, ni
->ni_chan
)))
511 if (ic
->ic_des_chan
!= IEEE80211_CHAN_ANYC
&&
512 ni
->ni_chan
!= ic
->ic_des_chan
)
514 if (ic
->ic_opmode
== IEEE80211_M_IBSS
) {
515 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_IBSS
) == 0)
518 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_ESS
) == 0)
521 if (ic
->ic_flags
& IEEE80211_F_PRIVACY
) {
522 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
) == 0)
525 /* XXX does this mean privacy is supported or required? */
526 if (ni
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
)
529 rate
= ieee80211_fix_rate(ni
, IEEE80211_F_DONEGO
| IEEE80211_F_DOFRATE
);
530 if (rate
& IEEE80211_RATE_BASIC
)
532 if (ic
->ic_des_esslen
!= 0 &&
533 (ni
->ni_esslen
!= ic
->ic_des_esslen
||
534 memcmp(ni
->ni_essid
, ic
->ic_des_essid
, ic
->ic_des_esslen
) != 0))
536 if ((ic
->ic_flags
& IEEE80211_F_DESBSSID
) &&
537 !IEEE80211_ADDR_EQ(ic
->ic_des_bssid
, ni
->ni_bssid
))
539 if (ni
->ni_fails
>= STA_FAILS_MAX
)
541 #ifdef IEEE80211_DEBUG
542 if (ieee80211_msg_scan(ic
)) {
544 fail
& 0x40 ? '=' : fail
& 0x80 ? '^' : fail
? '-' : '+',
545 ether_sprintf(ni
->ni_macaddr
));
546 printf(" %s%c", ether_sprintf(ni
->ni_bssid
),
547 fail
& 0x20 ? '!' : ' ');
548 printf(" %3d%c", ieee80211_chan2ieee(ic
, ni
->ni_chan
),
549 fail
& 0x01 ? '!' : ' ');
550 printf(" %+4d", ni
->ni_rssi
);
551 printf(" %2dM%c", (rate
& IEEE80211_RATE_VAL
) / 2,
552 fail
& 0x08 ? '!' : ' ');
554 (ni
->ni_capinfo
& IEEE80211_CAPINFO_ESS
) ? "ess" :
555 (ni
->ni_capinfo
& IEEE80211_CAPINFO_IBSS
) ? "ibss" :
557 fail
& 0x02 ? '!' : ' ');
559 (ni
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
) ?
561 fail
& 0x04 ? '!' : ' ');
562 ieee80211_print_essid(ni
->ni_essid
, ni
->ni_esslen
);
563 printf("%s\n", fail
& 0x10 ? "!" : "");
569 static __inline u_int8_t
570 maxrate(const struct ieee80211_node
*ni
)
572 const struct ieee80211_rateset
*rs
= &ni
->ni_rates
;
573 /* NB: assumes rate set is sorted (happens on frame receive) */
574 return rs
->rs_rates
[rs
->rs_nrates
-1] & IEEE80211_RATE_VAL
;
578 * Compare the capabilities of two nodes and decide which is
579 * more desirable (return >0 if a is considered better). Note
580 * that we assume compatibility/usability has already been checked
581 * so we don't need to (e.g. validate whether privacy is supported).
582 * Used to select the best scan candidate for association in a BSS.
585 ieee80211_node_compare(struct ieee80211com
*ic
,
586 const struct ieee80211_node
*a
,
587 const struct ieee80211_node
*b
)
590 u_int8_t rssia
, rssib
;
593 /* privacy support preferred */
594 if ((a
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
) &&
595 (b
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
) == 0)
597 if ((a
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
) == 0 &&
598 (b
->ni_capinfo
& IEEE80211_CAPINFO_PRIVACY
))
601 /* compare count of previous failures */
602 weight
= b
->ni_fails
- a
->ni_fails
;
606 rssia
= ic
->ic_node_getrssi(a
);
607 rssib
= ic
->ic_node_getrssi(b
);
608 if (abs(rssib
- rssia
) < 5) {
609 /* best/max rate preferred if signal level close enough XXX */
614 /* XXX use freq for channel preference */
615 /* for now just prefer 5 GHz band to all other bands */
616 if (IEEE80211_IS_CHAN_5GHZ(a
->ni_chan
) &&
617 !IEEE80211_IS_CHAN_5GHZ(b
->ni_chan
))
619 if (!IEEE80211_IS_CHAN_5GHZ(a
->ni_chan
) &&
620 IEEE80211_IS_CHAN_5GHZ(b
->ni_chan
))
623 /* all things being equal, use signal level */
624 return rssia
- rssib
;
628 * Mark an ongoing scan stopped.
631 ieee80211_cancel_scan(struct ieee80211com
*ic
)
634 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
, "%s: end %s scan\n",
636 (ic
->ic_flags
& IEEE80211_F_ASCAN
) ? "active" : "passive");
638 ic
->ic_flags
&= ~(IEEE80211_F_SCAN
| IEEE80211_F_ASCAN
);
639 ic
->ic_flags_ext
&= ~IEEE80211_FEXT_PROBECHAN
;
643 * Complete a scan of potential channels.
646 ieee80211_end_scan(struct ieee80211com
*ic
)
648 struct ieee80211_node_table
*nt
= &ic
->ic_scan
;
649 struct ieee80211_node
*ni
, *selbs
;
651 ieee80211_cancel_scan(ic
);
652 ieee80211_notify_scan_done(ic
);
654 #ifndef IEEE80211_NO_HOSTAP
655 if (ic
->ic_opmode
== IEEE80211_M_HOSTAP
) {
656 u_int8_t maxrssi
[IEEE80211_CHAN_MAX
]; /* XXX off stack? */
661 * The passive scan to look for existing AP's completed,
662 * select a channel to camp on. Identify the channels
663 * that already have one or more AP's and try to locate
664 * an unoccupied one. If that fails, pick a channel that
665 * looks to be quietest.
667 memset(maxrssi
, 0, sizeof(maxrssi
));
668 IEEE80211_NODE_LOCK(nt
);
669 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
670 rssi
= ic
->ic_node_getrssi(ni
);
671 i
= ieee80211_chan2ieee(ic
, ni
->ni_chan
);
672 if (rssi
> maxrssi
[i
])
675 IEEE80211_NODE_UNLOCK(nt
);
676 /* XXX select channel more intelligently */
678 for (i
= 0; i
< IEEE80211_CHAN_MAX
; i
++)
679 if (isset(ic
->ic_chan_active
, i
)) {
681 * If the channel is unoccupied the max rssi
682 * should be zero; just take it. Otherwise
683 * track the channel with the lowest rssi and
684 * use that when all channels appear occupied.
686 if (maxrssi
[i
] == 0) {
690 if (bestchan
== -1 ||
691 maxrssi
[i
] < maxrssi
[bestchan
])
694 if (bestchan
!= -1) {
695 ieee80211_create_ibss(ic
, &ic
->ic_channels
[bestchan
]);
698 /* no suitable channel, should not happen */
700 #endif /* !IEEE80211_NO_HOSTAP */
703 * When manually sequencing the state machine; scan just once
704 * regardless of whether we have a candidate or not. The
705 * controlling application is expected to setup state and
706 * initiate an association.
708 if (ic
->ic_roaming
== IEEE80211_ROAMING_MANUAL
)
711 * Automatic sequencing; look for a candidate and
712 * if found join the network.
714 /* NB: unlocked read should be ok */
715 if (TAILQ_FIRST(&nt
->nt_node
) == NULL
) {
716 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
,
717 "%s: no scan candidate\n", __func__
);
719 if (ic
->ic_opmode
== IEEE80211_M_IBSS
&&
720 (ic
->ic_flags
& IEEE80211_F_IBSSON
) &&
721 ic
->ic_des_esslen
!= 0) {
722 ieee80211_create_ibss(ic
, ic
->ic_ibss_chan
);
726 * Decrement the failure counts so entries will be
727 * reconsidered the next time around. We really want
728 * to do this only for sta's where we've previously
731 IEEE80211_NODE_LOCK(nt
);
732 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
)
735 IEEE80211_NODE_UNLOCK(nt
);
737 * Reset the list of channels to scan and start again.
739 ieee80211_reset_scan(ic
);
740 ic
->ic_flags
|= IEEE80211_F_SCAN
;
741 ieee80211_next_scan(ic
);
745 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_SCAN
, "\t%s\n",
746 "macaddr bssid chan rssi rate flag wep essid");
747 IEEE80211_NODE_LOCK(nt
);
748 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
749 if (ieee80211_match_bss(ic
, ni
) == 0) {
752 else if (ieee80211_node_compare(ic
, ni
, selbs
) > 0)
756 if (selbs
!= NULL
) /* NB: grab ref while dropping lock */
757 (void) ieee80211_ref_node(selbs
);
758 IEEE80211_NODE_UNLOCK(nt
);
761 if (!ieee80211_sta_join(ic
, selbs
)) {
762 ieee80211_free_node(selbs
);
768 * Handle 802.11 ad hoc network merge. The
769 * convention, set by the Wireless Ethernet Compatibility Alliance
770 * (WECA), is that an 802.11 station will change its BSSID to match
771 * the "oldest" 802.11 ad hoc network, on the same channel, that
772 * has the station's desired SSID. The "oldest" 802.11 network
773 * sends beacons with the greatest TSF timestamp.
775 * The caller is assumed to validate TSF's before attempting a merge.
777 * Return !0 if the BSSID changed, 0 otherwise.
780 ieee80211_ibss_merge(struct ieee80211_node
*ni
)
782 struct ieee80211com
*ic
= ni
->ni_ic
;
784 if (ni
== ic
->ic_bss
||
785 IEEE80211_ADDR_EQ(ni
->ni_bssid
, ic
->ic_bss
->ni_bssid
)) {
786 /* unchanged, nothing to do */
789 if (ieee80211_match_bss(ic
, ni
) != 0) { /* capabilities mismatch */
790 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
791 "%s: merge failed, capabilities mismatch\n", __func__
);
792 ic
->ic_stats
.is_ibss_capmismatch
++;
795 if (!ieee80211_sta_join(ic
, ieee80211_ref_node(ni
)))
797 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
798 "%s: new bssid %s: %s preamble, %s slot time%s\n", __func__
,
799 ether_sprintf(ni
->ni_bssid
),
800 ic
->ic_flags
&IEEE80211_F_SHPREAMBLE
? "short" : "long",
801 ic
->ic_flags
&IEEE80211_F_SHSLOT
? "short" : "long",
802 ic
->ic_flags
&IEEE80211_F_USEPROT
? ", protection" : ""
804 ic
->ic_flags
&= ~IEEE80211_F_SIBSS
;
809 * Join the specified IBSS/BSS network. The node is assumed to
810 * be passed in with a held reference.
813 ieee80211_sta_join(struct ieee80211com
*ic
, struct ieee80211_node
*selbs
)
815 struct ieee80211_node
*obss
;
817 if (ic
->ic_opmode
== IEEE80211_M_IBSS
) {
818 struct ieee80211_node_table
*nt
;
820 * Delete unusable rates; we've already checked
821 * that the negotiated rate set is acceptable.
823 ieee80211_fix_rate(selbs
, IEEE80211_F_DODEL
);
825 * Fillin the neighbor table; it will already
826 * exist if we are simply switching mastership.
827 * XXX ic_sta always setup so this is unnecessary?
830 IEEE80211_NODE_LOCK(nt
);
831 nt
->nt_name
= "neighbor";
832 nt
->nt_inact_init
= ic
->ic_inact_run
;
833 IEEE80211_NODE_UNLOCK(nt
);
837 * Committed to selbs, setup state.
840 ic
->ic_bss
= selbs
; /* NB: caller assumed to bump refcnt */
842 copy_bss(selbs
, obss
);
843 ieee80211_free_node(obss
);
846 * Set the erp state (mostly the slot time) to deal with
847 * the auto-select case; this should be redundant if the
850 ic
->ic_curmode
= ieee80211_chan2mode(ic
, selbs
->ni_chan
);
851 ic
->ic_curchan
= selbs
->ni_chan
;
852 ieee80211_reset_erp(ic
);
853 ieee80211_wme_initparams(ic
);
855 if (ic
->ic_opmode
== IEEE80211_M_STA
)
856 ieee80211_new_state(ic
, IEEE80211_S_AUTH
, -1);
858 ieee80211_new_state(ic
, IEEE80211_S_RUN
, -1);
863 * Leave the specified IBSS/BSS network. The node is assumed to
864 * be passed in with a held reference.
867 ieee80211_sta_leave(struct ieee80211com
*ic
, struct ieee80211_node
*ni
)
869 ic
->ic_node_cleanup(ni
);
870 ieee80211_notify_node_leave(ic
, ni
);
874 ieee80211_get_rate(const struct ieee80211_node
* const ni
)
876 #define RATE(_ix) (ni->ni_rates.rs_rates[(_ix)] & IEEE80211_RATE_VAL)
878 struct ieee80211com
*ic
= ni
->ni_ic
;
879 const struct ieee80211_rateset
*rs
;
881 IASSERT(ni
!= NULL
, ("ni != NULL"));
882 IASSERT(ieee80211_node_refcnt(ni
) > 0,
883 ("refcnt(ni) == %d", ieee80211_node_refcnt(ni
)));
884 IASSERT(ic
!= NULL
, ("ic != NULL"));
885 if (ic
->ic_fixed_rate
!= IEEE80211_FIXED_RATE_NONE
) {
886 rs
= &ic
->ic_sup_rates
[ic
->ic_curmode
];
887 rate
= rs
->rs_rates
[ic
->ic_fixed_rate
] & IEEE80211_RATE_VAL
;
888 for (ix
= ni
->ni_rates
.rs_nrates
- 1;
889 ix
>= 0 && RATE(ix
) != rate
; ix
--)
892 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_DEBUG
,
893 "%s: fixed rate %d (%d.%d Mb/s) not in rate set",
894 __func__
, ic
->ic_fixed_rate
, (rate
* 5) / 10,
898 } else if (ic
->ic_state
== IEEE80211_S_RUN
)
899 rate
= ni
->ni_rates
.rs_rates
[ni
->ni_txrate
];
903 /* Choose node's lowest basic rate, or else its lowest rate. */
904 for (ix
= 0; ix
< rs
->rs_nrates
; ix
++) {
905 if (rs
->rs_rates
[ix
] & IEEE80211_RATE_BASIC
)
906 return rs
->rs_rates
[ix
] & IEEE80211_RATE_VAL
;
908 return ni
->ni_rates
.rs_rates
[0] & IEEE80211_RATE_VAL
;
910 return rate
& IEEE80211_RATE_VAL
;
913 static struct ieee80211_node
*
914 node_alloc(struct ieee80211_node_table
*nt
)
916 struct ieee80211_node
*ni
;
918 ni
= malloc(sizeof(struct ieee80211_node
),
919 M_80211_NODE
, M_NOWAIT
| M_ZERO
);
924 * Reclaim any resources in a node and reset any critical
925 * state. Typically nodes are free'd immediately after,
926 * but in some cases the storage may be reused so we need
927 * to insure consistent state (should probably fix that).
930 node_cleanup(struct ieee80211_node
*ni
)
932 #define N(a) (sizeof(a)/sizeof(a[0]))
933 struct ieee80211com
*ic
= ni
->ni_ic
;
936 /* NB: preserve ni_table */
937 if (ni
->ni_flags
& IEEE80211_NODE_PWR_MGT
) {
939 ni
->ni_flags
&= ~IEEE80211_NODE_PWR_MGT
;
940 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_POWER
,
941 "[%s] power save mode off, %u sta's in ps mode\n",
942 ether_sprintf(ni
->ni_macaddr
), ic
->ic_ps_sta
);
945 * Clear AREF flag that marks the authorization refcnt bump
946 * has happened. This is probably not needed as the node
947 * should always be removed from the table so not found but
948 * do it just in case.
950 ni
->ni_flags
&= ~IEEE80211_NODE_AREF
;
953 * Drain power save queue and, if needed, clear TIM.
955 IEEE80211_NODE_SAVEQ_DRAIN(ni
, qlen
);
956 if (qlen
!= 0 && ic
->ic_set_tim
!= NULL
)
957 ic
->ic_set_tim(ni
, 0);
960 if (ni
->ni_challenge
!= NULL
) {
961 free(ni
->ni_challenge
, M_DEVBUF
);
962 ni
->ni_challenge
= NULL
;
965 * Preserve SSID, WPA, and WME ie's so the bss node is
966 * reusable during a re-auth/re-assoc state transition.
967 * If we remove these data they will not be recreated
968 * because they come from a probe-response or beacon frame
969 * which cannot be expected prior to the association-response.
970 * This should not be an issue when operating in other modes
971 * as stations leaving always go through a full state transition
972 * which will rebuild this state.
974 * XXX does this leave us open to inheriting old state?
976 for (i
= 0; i
< N(ni
->ni_rxfrag
); i
++)
977 if (ni
->ni_rxfrag
[i
] != NULL
) {
978 m_freem(ni
->ni_rxfrag
[i
]);
979 ni
->ni_rxfrag
[i
] = NULL
;
982 * Must be careful here to remove any key map entry w/o a LOR.
984 ieee80211_node_delucastkey(ni
);
989 node_free(struct ieee80211_node
*ni
)
991 struct ieee80211com
*ic
= ni
->ni_ic
;
993 ic
->ic_node_cleanup(ni
);
994 if (ni
->ni_wpa_ie
!= NULL
)
995 free(ni
->ni_wpa_ie
, M_DEVBUF
);
996 if (ni
->ni_wme_ie
!= NULL
)
997 free(ni
->ni_wme_ie
, M_DEVBUF
);
998 IEEE80211_NODE_SAVEQ_DESTROY(ni
);
999 free(ni
, M_80211_NODE
);
1003 node_getrssi(const struct ieee80211_node
*ni
)
1009 ieee80211_setup_node(struct ieee80211_node_table
*nt
,
1010 struct ieee80211_node
*ni
, const u_int8_t
*macaddr
)
1012 struct ieee80211com
*ic
= nt
->nt_ic
;
1015 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1016 "%s %p<%s> in %s table\n", __func__
, ni
,
1017 ether_sprintf(macaddr
), nt
->nt_name
);
1019 IEEE80211_ADDR_COPY(ni
->ni_macaddr
, macaddr
);
1020 hash
= IEEE80211_NODE_HASH(macaddr
);
1021 ieee80211_node_initref(ni
); /* mark referenced */
1022 ni
->ni_chan
= IEEE80211_CHAN_ANYC
;
1023 ni
->ni_authmode
= IEEE80211_AUTH_OPEN
;
1024 ni
->ni_txpower
= ic
->ic_txpowlimit
; /* max power */
1025 ieee80211_crypto_resetkey(ic
, &ni
->ni_ucastkey
, IEEE80211_KEYIX_NONE
);
1026 ni
->ni_inact_reload
= nt
->nt_inact_init
;
1027 ni
->ni_inact
= ni
->ni_inact_reload
;
1028 IEEE80211_NODE_SAVEQ_INIT(ni
, "unknown");
1030 IEEE80211_NODE_LOCK(nt
);
1031 TAILQ_INSERT_TAIL(&nt
->nt_node
, ni
, ni_list
);
1032 LIST_INSERT_HEAD(&nt
->nt_hash
[hash
], ni
, ni_hash
);
1035 IEEE80211_NODE_UNLOCK(nt
);
1038 struct ieee80211_node
*
1039 ieee80211_alloc_node(struct ieee80211_node_table
*nt
, const u_int8_t
*macaddr
)
1041 struct ieee80211com
*ic
= nt
->nt_ic
;
1042 struct ieee80211_node
*ni
;
1044 ni
= ic
->ic_node_alloc(nt
);
1046 ieee80211_setup_node(nt
, ni
, macaddr
);
1048 ic
->ic_stats
.is_rx_nodealloc
++;
1053 * Craft a temporary node suitable for sending a management frame
1054 * to the specified station. We craft only as much state as we
1055 * need to do the work since the node will be immediately reclaimed
1056 * once the send completes.
1058 struct ieee80211_node
*
1059 ieee80211_tmp_node(struct ieee80211com
*ic
, const u_int8_t
*macaddr
)
1061 struct ieee80211_node
*ni
;
1063 ni
= ic
->ic_node_alloc(&ic
->ic_sta
);
1065 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1066 "%s %p<%s>\n", __func__
, ni
, ether_sprintf(macaddr
));
1068 IEEE80211_ADDR_COPY(ni
->ni_macaddr
, macaddr
);
1069 IEEE80211_ADDR_COPY(ni
->ni_bssid
, ic
->ic_bss
->ni_bssid
);
1070 ieee80211_node_initref(ni
); /* mark referenced */
1071 ni
->ni_txpower
= ic
->ic_bss
->ni_txpower
;
1072 /* NB: required by ieee80211_fix_rate */
1073 ieee80211_set_chan(ic
, ni
, ic
->ic_bss
->ni_chan
);
1074 ieee80211_crypto_resetkey(ic
, &ni
->ni_ucastkey
,
1075 IEEE80211_KEYIX_NONE
);
1076 /* XXX optimize away */
1077 IEEE80211_NODE_SAVEQ_INIT(ni
, "unknown");
1079 ni
->ni_table
= NULL
; /* NB: pedantic */
1083 ic
->ic_stats
.is_rx_nodealloc
++;
1088 struct ieee80211_node
*
1089 ieee80211_dup_bss(struct ieee80211_node_table
*nt
, const u_int8_t
*macaddr
)
1091 struct ieee80211com
*ic
= nt
->nt_ic
;
1092 struct ieee80211_node
*ni
;
1094 ni
= ic
->ic_node_alloc(nt
);
1096 ieee80211_setup_node(nt
, ni
, macaddr
);
1098 * Inherit from ic_bss.
1100 ni
->ni_authmode
= ic
->ic_bss
->ni_authmode
;
1101 ni
->ni_txpower
= ic
->ic_bss
->ni_txpower
;
1102 ni
->ni_vlan
= ic
->ic_bss
->ni_vlan
; /* XXX?? */
1103 IEEE80211_ADDR_COPY(ni
->ni_bssid
, ic
->ic_bss
->ni_bssid
);
1104 ieee80211_set_chan(ic
, ni
, ic
->ic_bss
->ni_chan
);
1105 ni
->ni_rsn
= ic
->ic_bss
->ni_rsn
;
1107 ic
->ic_stats
.is_rx_nodealloc
++;
1111 static struct ieee80211_node
*
1112 #ifdef IEEE80211_DEBUG_REFCNT
1113 _ieee80211_find_node_debug(struct ieee80211_node_table
*nt
,
1114 const u_int8_t
*macaddr
, const char *func
, int line
)
1116 _ieee80211_find_node(struct ieee80211_node_table
*nt
,
1117 const u_int8_t
*macaddr
)
1120 struct ieee80211_node
*ni
;
1123 IEEE80211_NODE_LOCK_ASSERT(nt
);
1125 hash
= IEEE80211_NODE_HASH(macaddr
);
1126 LIST_FOREACH(ni
, &nt
->nt_hash
[hash
], ni_hash
) {
1127 if (IEEE80211_ADDR_EQ(ni
->ni_macaddr
, macaddr
)) {
1128 ieee80211_ref_node(ni
); /* mark referenced */
1129 #ifdef IEEE80211_DEBUG_REFCNT
1130 IEEE80211_DPRINTF(nt
->nt_ic
, IEEE80211_MSG_NODE
,
1131 "%s (%s:%u) %p<%s> refcnt %d\n", __func__
,
1133 ni
, ether_sprintf(ni
->ni_macaddr
),
1134 ieee80211_node_refcnt(ni
));
1141 #ifdef IEEE80211_DEBUG_REFCNT
1142 #define _ieee80211_find_node(nt, mac) \
1143 _ieee80211_find_node_debug(nt, mac, func, line)
1146 struct ieee80211_node
*
1147 #ifdef IEEE80211_DEBUG_REFCNT
1148 ieee80211_find_node_debug(struct ieee80211_node_table
*nt
,
1149 const u_int8_t
*macaddr
, const char *func
, int line
)
1151 ieee80211_find_node(struct ieee80211_node_table
*nt
, const u_int8_t
*macaddr
)
1154 struct ieee80211_node
*ni
;
1156 IEEE80211_NODE_LOCK(nt
);
1157 ni
= _ieee80211_find_node(nt
, macaddr
);
1158 IEEE80211_NODE_UNLOCK(nt
);
1163 * Fake up a node; this handles node discovery in adhoc mode.
1164 * Note that for the driver's benefit we we treat this like
1165 * an association so the driver has an opportunity to setup
1166 * it's private state.
1168 struct ieee80211_node
*
1169 ieee80211_fakeup_adhoc_node(struct ieee80211_node_table
*nt
,
1170 const u_int8_t macaddr
[IEEE80211_ADDR_LEN
])
1172 struct ieee80211com
*ic
= nt
->nt_ic
;
1173 struct ieee80211_node
*ni
;
1175 ni
= ieee80211_dup_bss(nt
, macaddr
);
1177 /* XXX no rate negotiation; just dup */
1178 ni
->ni_rates
= ic
->ic_bss
->ni_rates
;
1179 if (ic
->ic_newassoc
!= NULL
)
1180 ic
->ic_newassoc(ni
, 1);
1181 /* XXX not right for 802.1x/WPA */
1182 ieee80211_node_authorize(ni
);
1187 #ifdef IEEE80211_DEBUG
1189 dump_probe_beacon(u_int8_t subtype
, int isnew
,
1190 const u_int8_t mac
[IEEE80211_ADDR_LEN
],
1191 const struct ieee80211_scanparams
*sp
)
1194 printf("[%s] %s%s on chan %u (bss chan %u) ",
1195 ether_sprintf(mac
), isnew
? "new " : "",
1196 ieee80211_mgt_subtype_name
[subtype
>> IEEE80211_FC0_SUBTYPE_SHIFT
],
1197 sp
->chan
, sp
->bchan
);
1198 ieee80211_print_essid(sp
->ssid
+ 2, sp
->ssid
[1]);
1202 printf("[%s] caps 0x%x bintval %u erp 0x%x",
1203 ether_sprintf(mac
), sp
->capinfo
, sp
->bintval
, sp
->erp
);
1204 if (sp
->country
!= NULL
) {
1206 printf(" country info %*D",
1207 sp
->country
[1], sp
->country
+2, " ");
1210 printf(" country info");
1211 for (i
= 0; i
< sp
->country
[1]; i
++)
1212 printf(" %02x", sp
->country
[i
+2]);
1218 #endif /* IEEE80211_DEBUG */
1221 saveie(u_int8_t
**iep
, const u_int8_t
*ie
)
1227 ieee80211_saveie(iep
, ie
);
1231 * Process a beacon or probe response frame.
1234 ieee80211_add_scan(struct ieee80211com
*ic
,
1235 const struct ieee80211_scanparams
*sp
,
1236 const struct ieee80211_frame
*wh
,
1237 int subtype
, int rssi
, int rstamp
)
1239 #define ISPROBE(_st) ((_st) == IEEE80211_FC0_SUBTYPE_PROBE_RESP)
1240 struct ieee80211_node_table
*nt
= &ic
->ic_scan
;
1241 struct ieee80211_node
*ni
;
1244 ni
= ieee80211_find_node(nt
, wh
->i_addr2
);
1247 * Create a new entry.
1249 ni
= ic
->ic_node_alloc(nt
);
1251 ic
->ic_stats
.is_rx_nodealloc
++;
1254 ieee80211_setup_node(nt
, ni
, wh
->i_addr2
);
1256 * XXX inherit from ic_bss.
1258 ni
->ni_authmode
= ic
->ic_bss
->ni_authmode
;
1259 ni
->ni_txpower
= ic
->ic_bss
->ni_txpower
;
1260 ni
->ni_vlan
= ic
->ic_bss
->ni_vlan
; /* XXX?? */
1261 ieee80211_set_chan(ic
, ni
, ic
->ic_curchan
);
1262 ni
->ni_rsn
= ic
->ic_bss
->ni_rsn
;
1265 #ifdef IEEE80211_DEBUG
1266 if (ieee80211_msg_scan(ic
) && (ic
->ic_flags
& IEEE80211_F_SCAN
))
1267 dump_probe_beacon(subtype
, newnode
, wh
->i_addr2
, sp
);
1269 /* XXX ap beaconing multiple ssid w/ same bssid */
1270 if (sp
->ssid
[1] != 0 &&
1271 (ISPROBE(subtype
) || ni
->ni_esslen
== 0)) {
1272 ni
->ni_esslen
= sp
->ssid
[1];
1273 memset(ni
->ni_essid
, 0, sizeof(ni
->ni_essid
));
1274 memcpy(ni
->ni_essid
, sp
->ssid
+ 2, sp
->ssid
[1]);
1276 ni
->ni_scangen
= ic
->ic_scan
.nt_scangen
;
1277 IEEE80211_ADDR_COPY(ni
->ni_bssid
, wh
->i_addr3
);
1279 ni
->ni_rstamp
= rstamp
;
1280 memcpy(ni
->ni_tstamp
.data
, sp
->tstamp
, sizeof(ni
->ni_tstamp
));
1281 ni
->ni_intval
= sp
->bintval
;
1282 ni
->ni_capinfo
= sp
->capinfo
;
1283 ni
->ni_chan
= &ic
->ic_channels
[sp
->chan
];
1284 ni
->ni_fhdwell
= sp
->fhdwell
;
1285 ni
->ni_fhindex
= sp
->fhindex
;
1286 ni
->ni_erp
= sp
->erp
;
1287 if (sp
->tim
!= NULL
) {
1288 struct ieee80211_tim_ie
*ie
=
1289 (struct ieee80211_tim_ie
*) sp
->tim
;
1291 ni
->ni_dtim_count
= ie
->tim_count
;
1292 ni
->ni_dtim_period
= ie
->tim_period
;
1295 * Record the byte offset from the mac header to
1296 * the start of the TIM information element for
1297 * use by hardware and/or to speedup software
1298 * processing of beacon frames.
1300 ni
->ni_timoff
= sp
->timoff
;
1302 * Record optional information elements that might be
1303 * used by applications or drivers.
1305 saveie(&ni
->ni_wme_ie
, sp
->wme
);
1306 saveie(&ni
->ni_wpa_ie
, sp
->wpa
);
1308 /* NB: must be after ni_chan is setup */
1309 ieee80211_setup_rates(ni
, sp
->rates
, sp
->xrates
, IEEE80211_F_DOSORT
);
1312 ieee80211_free_node(ni
);
1317 ieee80211_init_neighbor(struct ieee80211com
*ic
, struct ieee80211_node
*ni
,
1318 const struct ieee80211_frame
*wh
, const struct ieee80211_scanparams
*sp
,
1321 ni
->ni_esslen
= sp
->ssid
[1];
1322 memcpy(ni
->ni_essid
, sp
->ssid
+ 2, sp
->ssid
[1]);
1323 IEEE80211_ADDR_COPY(ni
->ni_bssid
, wh
->i_addr3
);
1324 memcpy(ni
->ni_tstamp
.data
, sp
->tstamp
, sizeof(ni
->ni_tstamp
));
1325 ni
->ni_intval
= sp
->bintval
;
1326 ni
->ni_capinfo
= sp
->capinfo
;
1327 ni
->ni_chan
= ic
->ic_bss
->ni_chan
;
1328 ni
->ni_fhdwell
= sp
->fhdwell
;
1329 ni
->ni_fhindex
= sp
->fhindex
;
1330 ni
->ni_erp
= sp
->erp
;
1331 ni
->ni_timoff
= sp
->timoff
;
1332 if (sp
->wme
!= NULL
)
1333 ieee80211_saveie(&ni
->ni_wme_ie
, sp
->wme
);
1334 if (sp
->wpa
!= NULL
)
1335 ieee80211_saveie(&ni
->ni_wpa_ie
, sp
->wpa
);
1337 /* NB: must be after ni_chan is setup */
1338 ieee80211_setup_rates(ni
, sp
->rates
, sp
->xrates
,
1339 IEEE80211_F_DODEL
| IEEE80211_F_DONEGO
| IEEE80211_F_DOSORT
);
1341 if (ic
->ic_newassoc
!= NULL
)
1342 ic
->ic_newassoc(ni
, isnew
);
1346 * Do node discovery in adhoc mode on receipt of a beacon
1347 * or probe response frame. Note that for the driver's
1348 * benefit we we treat this like an association so the
1349 * driver has an opportunity to setup it's private state.
1351 struct ieee80211_node
*
1352 ieee80211_add_neighbor(struct ieee80211com
*ic
,
1353 const struct ieee80211_frame
*wh
,
1354 const struct ieee80211_scanparams
*sp
)
1356 struct ieee80211_node
*ni
;
1358 ni
= ieee80211_dup_bss(&ic
->ic_sta
, wh
->i_addr2
);/* XXX alloc_node? */
1360 ieee80211_init_neighbor(ic
, ni
, wh
, sp
, 1);
1361 /* XXX not right for 802.1x/WPA */
1362 ieee80211_node_authorize(ni
);
1367 #define IS_CTL(wh) \
1368 ((wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) == IEEE80211_FC0_TYPE_CTL)
1369 #define IS_PSPOLL(wh) \
1370 ((wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) == IEEE80211_FC0_SUBTYPE_PS_POLL)
1372 * Locate the node for sender, track state, and then pass the
1373 * (referenced) node up to the 802.11 layer for its use. We
1374 * are required to pass some node so we fall back to ic_bss
1375 * when this frame is from an unknown sender. The 802.11 layer
1376 * knows this means the sender wasn't in the node table and
1379 struct ieee80211_node
*
1380 #ifdef IEEE80211_DEBUG_REFCNT
1381 ieee80211_find_rxnode_debug(struct ieee80211com
*ic
,
1382 const struct ieee80211_frame_min
*wh
, const char *func
, int line
)
1384 ieee80211_find_rxnode(struct ieee80211com
*ic
,
1385 const struct ieee80211_frame_min
*wh
)
1388 struct ieee80211_node_table
*nt
;
1389 struct ieee80211_node
*ni
;
1391 /* XXX may want scanned nodes in the neighbor table for adhoc */
1392 if (ic
->ic_opmode
== IEEE80211_M_STA
||
1393 ic
->ic_opmode
== IEEE80211_M_MONITOR
||
1394 (ic
->ic_flags
& IEEE80211_F_SCAN
))
1398 /* XXX check ic_bss first in station mode */
1399 /* XXX 4-address frames? */
1400 IEEE80211_NODE_LOCK(nt
);
1401 if (IS_CTL(wh
) && !IS_PSPOLL(wh
) /*&& !IS_RTS(ah)*/)
1402 ni
= _ieee80211_find_node(nt
, wh
->i_addr1
);
1404 ni
= _ieee80211_find_node(nt
, wh
->i_addr2
);
1406 ni
= ieee80211_ref_node(ic
->ic_bss
);
1407 IEEE80211_NODE_UNLOCK(nt
);
1413 * Like ieee80211_find_rxnode but use the supplied h/w
1414 * key index as a hint to locate the node in the key
1415 * mapping table. If an entry is present at the key
1416 * index we return it; otherwise do a normal lookup and
1417 * update the mapping table if the station has a unicast
1418 * key assigned to it.
1420 struct ieee80211_node
*
1421 #ifdef IEEE80211_DEBUG_REFCNT
1422 ieee80211_find_rxnode_withkey_debug(struct ieee80211com
*ic
,
1423 const struct ieee80211_frame_min
*wh
, ieee80211_keyix keyix
,
1424 const char *func
, int line
)
1426 ieee80211_find_rxnode_withkey(struct ieee80211com
*ic
,
1427 const struct ieee80211_frame_min
*wh
, ieee80211_keyix keyix
)
1430 struct ieee80211_node_table
*nt
;
1431 struct ieee80211_node
*ni
;
1433 if (ic
->ic_opmode
== IEEE80211_M_STA
||
1434 ic
->ic_opmode
== IEEE80211_M_MONITOR
||
1435 (ic
->ic_flags
& IEEE80211_F_SCAN
))
1439 IEEE80211_NODE_LOCK(nt
);
1440 if (nt
->nt_keyixmap
!= NULL
&& keyix
< nt
->nt_keyixmax
)
1441 ni
= nt
->nt_keyixmap
[keyix
];
1445 if (IS_CTL(wh
) && !IS_PSPOLL(wh
) /*&& !IS_RTS(ah)*/)
1446 ni
= _ieee80211_find_node(nt
, wh
->i_addr1
);
1448 ni
= _ieee80211_find_node(nt
, wh
->i_addr2
);
1450 ni
= ieee80211_ref_node(ic
->ic_bss
);
1451 if (nt
->nt_keyixmap
!= NULL
) {
1453 * If the station has a unicast key cache slot
1454 * assigned update the key->node mapping table.
1456 keyix
= ni
->ni_ucastkey
.wk_rxkeyix
;
1457 /* XXX can keyixmap[keyix] != NULL? */
1458 if (keyix
< nt
->nt_keyixmax
&&
1459 nt
->nt_keyixmap
[keyix
] == NULL
) {
1460 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1461 "%s: add key map entry %p<%s> refcnt %d\n",
1462 __func__
, ni
, ether_sprintf(ni
->ni_macaddr
),
1463 ieee80211_node_refcnt(ni
)+1);
1464 nt
->nt_keyixmap
[keyix
] = ieee80211_ref_node(ni
);
1468 ieee80211_ref_node(ni
);
1470 IEEE80211_NODE_UNLOCK(nt
);
1478 * Return a reference to the appropriate node for sending
1479 * a data frame. This handles node discovery in adhoc networks.
1481 struct ieee80211_node
*
1482 #ifdef IEEE80211_DEBUG_REFCNT
1483 ieee80211_find_txnode_debug(struct ieee80211com
*ic
, const u_int8_t
*macaddr
,
1484 const char *func
, int line
)
1486 ieee80211_find_txnode(struct ieee80211com
*ic
, const u_int8_t
*macaddr
)
1489 struct ieee80211_node_table
*nt
= &ic
->ic_sta
;
1490 struct ieee80211_node
*ni
;
1493 * The destination address should be in the node table
1494 * unless this is a multicast/broadcast frame. We can
1495 * also optimize station mode operation, all frames go
1498 /* XXX can't hold lock across dup_bss 'cuz of recursive locking */
1499 IEEE80211_NODE_LOCK(nt
);
1500 if (ic
->ic_opmode
== IEEE80211_M_STA
|| IEEE80211_IS_MULTICAST(macaddr
))
1501 ni
= ieee80211_ref_node(ic
->ic_bss
);
1503 ni
= _ieee80211_find_node(nt
, macaddr
);
1504 IEEE80211_NODE_UNLOCK(nt
);
1507 if (ic
->ic_opmode
== IEEE80211_M_IBSS
||
1508 ic
->ic_opmode
== IEEE80211_M_AHDEMO
) {
1510 * In adhoc mode cons up a node for the destination.
1511 * Note that we need an additional reference for the
1512 * caller to be consistent with _ieee80211_find_node.
1514 ni
= ieee80211_fakeup_adhoc_node(nt
, macaddr
);
1516 (void) ieee80211_ref_node(ni
);
1518 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_OUTPUT
,
1519 "[%s] no node, discard frame (%s)\n",
1520 ether_sprintf(macaddr
), __func__
);
1521 ic
->ic_stats
.is_tx_nonode
++;
1528 * Like find but search based on the channel too.
1530 struct ieee80211_node
*
1531 #ifdef IEEE80211_DEBUG_REFCNT
1532 ieee80211_find_node_with_channel_debug(struct ieee80211_node_table
*nt
,
1533 const u_int8_t
*macaddr
, struct ieee80211_channel
*chan
,
1534 const char *func
, int line
)
1536 ieee80211_find_node_with_channel(struct ieee80211_node_table
*nt
,
1537 const u_int8_t
*macaddr
, struct ieee80211_channel
*chan
)
1540 struct ieee80211_node
*ni
;
1543 hash
= IEEE80211_NODE_HASH(macaddr
);
1544 IEEE80211_NODE_LOCK(nt
);
1545 LIST_FOREACH(ni
, &nt
->nt_hash
[hash
], ni_hash
) {
1546 if (IEEE80211_ADDR_EQ(ni
->ni_macaddr
, macaddr
) &&
1547 ni
->ni_chan
== chan
) {
1548 ieee80211_ref_node(ni
); /* mark referenced */
1549 #ifdef IEEE80211_DEBUG_REFCNT
1550 IEEE80211_DPRINTF(nt
->nt_ic
, IEEE80211_MSG_NODE
,
1551 "%s (%s:%u) %p<%s> refcnt %d\n", __func__
,
1553 ni
, ether_sprintf(ni
->ni_macaddr
),
1554 ieee80211_node_refcnt(ni
));
1556 IEEE80211_DPRINTF(nt
->nt_ic
, IEEE80211_MSG_NODE
,
1557 "%s %p<%s> refcnt %d\n", __func__
,
1558 ni
, ether_sprintf(ni
->ni_macaddr
),
1559 ieee80211_node_refcnt(ni
));
1564 IEEE80211_NODE_UNLOCK(nt
);
1568 struct ieee80211_node
*
1569 ieee80211_refine_node_for_beacon(struct ieee80211com
*ic
,
1570 struct ieee80211_node
*ni0
, struct ieee80211_channel
*chan
,
1571 const u_int8_t
*ssid
)
1573 struct ieee80211_node_table
*nt
= ni0
->ni_table
;
1574 struct ieee80211_node
*best
, *ni
;
1575 int best_score
= 0, score
;
1581 if (ssid
[1] == 0 || best
->ni_esslen
== 0)
1583 else if (ssid
[1] == best
->ni_esslen
&&
1584 memcmp(ssid
+ 2, best
->ni_essid
, ssid
[1]) == 0)
1589 IEEE80211_NODE_LOCK(nt
);
1590 for (ni
= LIST_NEXT(ni0
, ni_hash
); ni
!= NULL
;
1591 ni
= LIST_NEXT(ni
, ni_hash
)) {
1592 if (!IEEE80211_ADDR_EQ(ni
->ni_macaddr
, best
->ni_macaddr
) ||
1593 ni
->ni_ic
!= best
->ni_ic
|| ni
->ni_chan
!= chan
)
1596 if (ssid
[1] == 0 || ni
->ni_esslen
== 0)
1598 else if (ssid
[1] == ni
->ni_esslen
&&
1599 memcmp(ssid
+ 2, ni
->ni_essid
, ssid
[1]) == 0)
1604 if (score
> best_score
) {
1609 IEEE80211_NODE_UNLOCK(nt
);
1614 * Like find but search based on the ssid too.
1616 struct ieee80211_node
*
1617 #ifdef IEEE80211_DEBUG_REFCNT
1618 ieee80211_find_node_with_ssid_debug(struct ieee80211_node_table
*nt
,
1619 const u_int8_t
*macaddr
, u_int ssidlen
, const u_int8_t
*ssid
,
1620 const char *func
, int line
)
1622 ieee80211_find_node_with_ssid(struct ieee80211_node_table
*nt
,
1623 const u_int8_t
*macaddr
, u_int ssidlen
, const u_int8_t
*ssid
)
1626 #define MATCH_SSID(ni, ssid, ssidlen) \
1627 (ni->ni_esslen == ssidlen && memcmp(ni->ni_essid, ssid, ssidlen) == 0)
1628 static const u_int8_t zeromac
[IEEE80211_ADDR_LEN
];
1629 struct ieee80211com
*ic
= nt
->nt_ic
;
1630 struct ieee80211_node
*ni
;
1633 IEEE80211_NODE_LOCK(nt
);
1635 * A mac address that is all zero means match only the ssid;
1636 * otherwise we must match both.
1638 if (IEEE80211_ADDR_EQ(macaddr
, zeromac
)) {
1639 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
1640 if (MATCH_SSID(ni
, ssid
, ssidlen
))
1644 hash
= IEEE80211_NODE_HASH(macaddr
);
1645 LIST_FOREACH(ni
, &nt
->nt_hash
[hash
], ni_hash
) {
1646 if (IEEE80211_ADDR_EQ(ni
->ni_macaddr
, macaddr
) &&
1647 MATCH_SSID(ni
, ssid
, ssidlen
))
1652 ieee80211_ref_node(ni
); /* mark referenced */
1653 #ifdef IEEE80211_DEBUG_REFCNT
1654 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1655 "%s (%s:%u) %p<%s> refcnt %d\n", __func__
,
1657 ni
, ether_sprintf(ni
->ni_macaddr
),
1658 ieee80211_node_refcnt(ni
));
1660 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1661 "%s %p<%s> refcnt %d\n", __func__
,
1662 ni
, ether_sprintf(ni
->ni_macaddr
),
1663 ieee80211_node_refcnt(ni
));
1666 IEEE80211_NODE_UNLOCK(nt
);
1672 _ieee80211_free_node(struct ieee80211_node
*ni
)
1674 struct ieee80211com
*ic
= ni
->ni_ic
;
1675 struct ieee80211_node_table
*nt
= ni
->ni_table
;
1677 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1678 "%s %p<%s> in %s table\n", __func__
, ni
,
1679 ether_sprintf(ni
->ni_macaddr
),
1680 nt
!= NULL
? nt
->nt_name
: "<gone>");
1682 IEEE80211_AID_CLR(ni
->ni_associd
, ic
->ic_aid_bitmap
);
1684 TAILQ_REMOVE(&nt
->nt_node
, ni
, ni_list
);
1685 LIST_REMOVE(ni
, ni_hash
);
1687 ic
->ic_node_free(ni
);
1691 #ifdef IEEE80211_DEBUG_REFCNT
1692 ieee80211_free_node_debug(struct ieee80211_node
*ni
, const char *func
, int line
)
1694 ieee80211_free_node(struct ieee80211_node
*ni
)
1697 struct ieee80211_node_table
*nt
= ni
->ni_table
;
1699 #ifdef IEEE80211_DEBUG_REFCNT
1700 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1701 "%s (%s:%u) %p<%s> refcnt %d\n", __func__
, func
, line
, ni
,
1702 ether_sprintf(ni
->ni_macaddr
), ieee80211_node_refcnt(ni
)-1);
1705 IEEE80211_NODE_LOCK(nt
);
1706 if (ieee80211_node_dectestref(ni
)) {
1708 * Last reference, reclaim state.
1710 _ieee80211_free_node(ni
);
1711 } else if (ieee80211_node_refcnt(ni
) == 1 &&
1712 nt
->nt_keyixmap
!= NULL
) {
1713 ieee80211_keyix keyix
;
1715 * Check for a last reference in the key mapping table.
1717 keyix
= ni
->ni_ucastkey
.wk_rxkeyix
;
1718 if (keyix
< nt
->nt_keyixmax
&&
1719 nt
->nt_keyixmap
[keyix
] == ni
) {
1720 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1721 "%s: %p<%s> clear key map entry", __func__
,
1722 ni
, ether_sprintf(ni
->ni_macaddr
));
1723 nt
->nt_keyixmap
[keyix
] = NULL
;
1724 ieee80211_node_decref(ni
); /* XXX needed? */
1725 _ieee80211_free_node(ni
);
1728 IEEE80211_NODE_UNLOCK(nt
);
1730 if (ieee80211_node_dectestref(ni
))
1731 _ieee80211_free_node(ni
);
1736 * Reclaim a unicast key and clear any key cache state.
1739 ieee80211_node_delucastkey(struct ieee80211_node
*ni
)
1741 struct ieee80211com
*ic
= ni
->ni_ic
;
1742 struct ieee80211_node_table
*nt
= &ic
->ic_sta
;
1743 struct ieee80211_node
*nikey
;
1744 ieee80211_keyix keyix
;
1745 int isowned
, status
;
1748 * NB: We must beware of LOR here; deleting the key
1749 * can cause the crypto layer to block traffic updates
1750 * which can generate a LOR against the node table lock;
1751 * grab it here and stash the key index for our use below.
1753 * Must also beware of recursion on the node table lock.
1754 * When called from node_cleanup we may already have
1755 * the node table lock held. Unfortunately there's no
1756 * way to separate out this path so we must do this
1759 isowned
= IEEE80211_NODE_IS_LOCKED(nt
);
1761 IEEE80211_NODE_LOCK(nt
);
1762 keyix
= ni
->ni_ucastkey
.wk_rxkeyix
;
1763 status
= ieee80211_crypto_delkey(ic
, &ni
->ni_ucastkey
);
1764 if (nt
->nt_keyixmap
!= NULL
&& keyix
< nt
->nt_keyixmax
) {
1765 nikey
= nt
->nt_keyixmap
[keyix
];
1766 nt
->nt_keyixmap
[keyix
] = NULL
;
1770 IEEE80211_NODE_UNLOCK(&ic
->ic_sta
);
1772 if (nikey
!= NULL
) {
1773 IASSERT(nikey
== ni
,
1774 ("key map out of sync, ni %p nikey %p", ni
, nikey
));
1775 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1776 "%s: delete key map entry %p<%s> refcnt %d\n",
1777 __func__
, ni
, ether_sprintf(ni
->ni_macaddr
),
1778 ieee80211_node_refcnt(ni
)-1);
1779 ieee80211_free_node(ni
);
1785 * Reclaim a node. If this is the last reference count then
1786 * do the normal free work. Otherwise remove it from the node
1787 * table and mark it gone by clearing the back-reference.
1790 node_reclaim(struct ieee80211_node_table
*nt
, struct ieee80211_node
*ni
)
1792 ieee80211_keyix keyix
;
1794 IEEE80211_NODE_LOCK_ASSERT(nt
);
1796 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1797 "%s: remove %p<%s> from %s table, refcnt %d\n",
1798 __func__
, ni
, ether_sprintf(ni
->ni_macaddr
),
1799 nt
->nt_name
, ieee80211_node_refcnt(ni
)-1);
1801 * Clear any entry in the unicast key mapping table.
1802 * We need to do it here so rx lookups don't find it
1803 * in the mapping table even if it's not in the hash
1804 * table. We cannot depend on the mapping table entry
1805 * being cleared because the node may not be free'd.
1807 keyix
= ni
->ni_ucastkey
.wk_rxkeyix
;
1808 if (nt
->nt_keyixmap
!= NULL
&& keyix
< nt
->nt_keyixmax
&&
1809 nt
->nt_keyixmap
[keyix
] == ni
) {
1810 IEEE80211_DPRINTF(ni
->ni_ic
, IEEE80211_MSG_NODE
,
1811 "%s: %p<%s> clear key map entry\n",
1812 __func__
, ni
, ether_sprintf(ni
->ni_macaddr
));
1813 nt
->nt_keyixmap
[keyix
] = NULL
;
1814 ieee80211_node_decref(ni
); /* NB: don't need free */
1816 if (!ieee80211_node_dectestref(ni
)) {
1818 * Other references are present, just remove the
1819 * node from the table so it cannot be found. When
1820 * the references are dropped storage will be
1823 TAILQ_REMOVE(&nt
->nt_node
, ni
, ni_list
);
1824 LIST_REMOVE(ni
, ni_hash
);
1825 ni
->ni_table
= NULL
; /* clear reference */
1827 _ieee80211_free_node(ni
);
1831 ieee80211_free_allnodes_locked(struct ieee80211_node_table
*nt
)
1833 struct ieee80211com
*ic
= nt
->nt_ic
;
1834 struct ieee80211_node
*ni
;
1836 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1837 "%s: free all nodes in %s table\n", __func__
, nt
->nt_name
);
1839 while ((ni
= TAILQ_FIRST(&nt
->nt_node
)) != NULL
) {
1840 if (ni
->ni_associd
!= 0) {
1841 if (ic
->ic_auth
->ia_node_leave
!= NULL
)
1842 ic
->ic_auth
->ia_node_leave(ic
, ni
);
1843 IEEE80211_AID_CLR(ni
->ni_associd
, ic
->ic_aid_bitmap
);
1845 node_reclaim(nt
, ni
);
1847 ieee80211_reset_erp(ic
);
1851 ieee80211_free_allnodes(struct ieee80211_node_table
*nt
)
1854 IEEE80211_NODE_LOCK(nt
);
1855 ieee80211_free_allnodes_locked(nt
);
1856 IEEE80211_NODE_UNLOCK(nt
);
1860 * Timeout entries in the scan cache.
1863 ieee80211_timeout_scan_candidates(struct ieee80211_node_table
*nt
)
1865 struct ieee80211com
*ic
= nt
->nt_ic
;
1866 struct ieee80211_node
*ni
, *tni
;
1868 IEEE80211_NODE_LOCK(nt
);
1870 /* XXX belongs elsewhere */
1871 if (ni
->ni_rxfrag
[0] != NULL
&& ticks
> ni
->ni_rxfragstamp
+ hz
) {
1872 m_freem(ni
->ni_rxfrag
[0]);
1873 ni
->ni_rxfrag
[0] = NULL
;
1875 TAILQ_FOREACH_SAFE(ni
, &nt
->nt_node
, ni_list
, tni
) {
1876 if (ni
->ni_inact
&& --ni
->ni_inact
== 0) {
1877 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1878 "[%s] scan candidate purged from cache "
1879 "(refcnt %u)\n", ether_sprintf(ni
->ni_macaddr
),
1880 ieee80211_node_refcnt(ni
));
1881 node_reclaim(nt
, ni
);
1884 IEEE80211_NODE_UNLOCK(nt
);
1886 nt
->nt_inact_timer
= IEEE80211_INACT_WAIT
;
1890 * Timeout inactive stations and do related housekeeping.
1891 * Note that we cannot hold the node lock while sending a
1892 * frame as this would lead to a LOR. Instead we use a
1893 * generation number to mark nodes that we've scanned and
1894 * drop the lock and restart a scan if we have to time out
1895 * a node. Since we are single-threaded by virtue of
1896 * controlling the inactivity timer we can be sure this will
1897 * process each node only once.
1900 ieee80211_timeout_stations(struct ieee80211_node_table
*nt
)
1902 struct ieee80211com
*ic
= nt
->nt_ic
;
1903 struct ieee80211_node
*ni
;
1907 isadhoc
= (ic
->ic_opmode
== IEEE80211_M_IBSS
||
1908 ic
->ic_opmode
== IEEE80211_M_AHDEMO
);
1909 IEEE80211_SCAN_LOCK(nt
);
1910 gen
= ++nt
->nt_scangen
;
1911 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
1912 "%s: %s scangen %u\n", __func__
, nt
->nt_name
, gen
);
1914 IEEE80211_NODE_LOCK(nt
);
1915 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
1916 if (ni
->ni_scangen
== gen
) /* previously handled */
1918 ni
->ni_scangen
= gen
;
1920 * Ignore entries for which have yet to receive an
1921 * authentication frame. These are transient and
1922 * will be reclaimed when the last reference to them
1923 * goes away (when frame xmits complete).
1925 if (ic
->ic_opmode
== IEEE80211_M_HOSTAP
&&
1926 (ni
->ni_flags
& IEEE80211_NODE_AREF
) == 0)
1929 * Free fragment if not needed anymore
1930 * (last fragment older than 1s).
1931 * XXX doesn't belong here
1933 if (ni
->ni_rxfrag
[0] != NULL
&&
1934 ticks
> ni
->ni_rxfragstamp
+ hz
) {
1935 m_freem(ni
->ni_rxfrag
[0]);
1936 ni
->ni_rxfrag
[0] = NULL
;
1939 * Special case ourself; we may be idle for extended periods
1940 * of time and regardless reclaiming our state is wrong.
1942 if (ni
== ic
->ic_bss
)
1945 if (ni
->ni_associd
!= 0 || isadhoc
) {
1947 * Age frames on the power save queue. The
1948 * aging interval is 4 times the listen
1949 * interval specified by the station. This
1950 * number is factored into the age calculations
1951 * when the frame is placed on the queue. We
1952 * store ages as time differences we can check
1953 * and/or adjust only the head of the list.
1955 if (IEEE80211_NODE_SAVEQ_QLEN(ni
) != 0) {
1959 IEEE80211_NODE_SAVEQ_LOCK(ni
);
1960 while (IF_POLL(&ni
->ni_savedq
, m
) != NULL
&&
1961 M_AGE_GET(m
) < IEEE80211_INACT_WAIT
) {
1962 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_POWER
, "[%s] discard frame, age %u\n", ether_sprintf(ni
->ni_macaddr
), M_AGE_GET(m
));/*XXX*/
1963 _IEEE80211_NODE_SAVEQ_DEQUEUE_HEAD(ni
, m
);
1968 M_AGE_SUB(m
, IEEE80211_INACT_WAIT
);
1969 IEEE80211_NODE_SAVEQ_UNLOCK(ni
);
1972 IEEE80211_DPRINTF(ic
,
1973 IEEE80211_MSG_POWER
,
1974 "[%s] discard %u frames for age\n",
1975 ether_sprintf(ni
->ni_macaddr
),
1977 IEEE80211_NODE_STAT_ADD(ni
,
1978 ps_discard
, discard
);
1979 if (IEEE80211_NODE_SAVEQ_QLEN(ni
) == 0)
1980 ic
->ic_set_tim(ni
, 0);
1984 * Probe the station before time it out. We
1985 * send a null data frame which may not be
1986 * universally supported by drivers (need it
1987 * for ps-poll support so it should be...).
1989 if (0 < ni
->ni_inact
&&
1990 ni
->ni_inact
<= ic
->ic_inact_probe
) {
1992 IEEE80211_MSG_INACT
| IEEE80211_MSG_NODE
,
1994 "probe station due to inactivity");
1996 * Grab a reference before unlocking the table
1997 * so the node cannot be reclaimed before we
1998 * send the frame. ieee80211_send_nulldata
1999 * understands we've done this and reclaims the
2000 * ref for us as needed.
2002 ieee80211_ref_node(ni
);
2003 IEEE80211_NODE_UNLOCK(nt
);
2004 ieee80211_send_nulldata(ni
);
2009 if (ni
->ni_inact
<= 0) {
2011 IEEE80211_MSG_INACT
| IEEE80211_MSG_NODE
, ni
,
2012 "station timed out due to inactivity "
2013 "(refcnt %u)", ieee80211_node_refcnt(ni
));
2015 * Send a deauthenticate frame and drop the station.
2016 * This is somewhat complicated due to reference counts
2017 * and locking. At this point a station will typically
2018 * have a reference count of 1. ieee80211_node_leave
2019 * will do a "free" of the node which will drop the
2020 * reference count. But in the meantime a reference
2021 * will be held by the deauth frame. The actual reclaim
2022 * of the node will happen either after the tx is
2023 * completed or by ieee80211_node_leave.
2025 * Separately we must drop the node lock before sending
2026 * in case the driver takes a lock, as this will result
2027 * in LOR between the node lock and the driver lock.
2029 IEEE80211_NODE_UNLOCK(nt
);
2030 if (ni
->ni_associd
!= 0) {
2031 IEEE80211_SEND_MGMT(ic
, ni
,
2032 IEEE80211_FC0_SUBTYPE_DEAUTH
,
2033 IEEE80211_REASON_AUTH_EXPIRE
);
2035 ieee80211_node_leave(ic
, ni
);
2036 ic
->ic_stats
.is_node_timeout
++;
2040 IEEE80211_NODE_UNLOCK(nt
);
2042 IEEE80211_SCAN_UNLOCK(nt
);
2044 nt
->nt_inact_timer
= IEEE80211_INACT_WAIT
;
2048 ieee80211_iterate_nodes(struct ieee80211_node_table
*nt
, ieee80211_iter_func
*f
, void *arg
)
2050 struct ieee80211_node
*ni
;
2053 IEEE80211_SCAN_LOCK(nt
);
2054 gen
= ++nt
->nt_scangen
;
2056 IEEE80211_NODE_LOCK(nt
);
2057 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
2058 if (ni
->ni_scangen
!= gen
) {
2059 ni
->ni_scangen
= gen
;
2060 (void) ieee80211_ref_node(ni
);
2061 IEEE80211_NODE_UNLOCK(nt
);
2063 ieee80211_free_node(ni
);
2067 IEEE80211_NODE_UNLOCK(nt
);
2069 IEEE80211_SCAN_UNLOCK(nt
);
2073 ieee80211_dump_node(struct ieee80211_node_table
*nt
,
2074 struct ieee80211_node
*ni
)
2076 printf("0x%p: mac %s refcnt %d\n", ni
,
2077 ether_sprintf(ni
->ni_macaddr
), ieee80211_node_refcnt(ni
));
2078 printf("\tscangen %u authmode %u flags 0x%x\n",
2079 ni
->ni_scangen
, ni
->ni_authmode
, ni
->ni_flags
);
2080 printf("\tassocid 0x%x txpower %u vlan %u\n",
2081 ni
->ni_associd
, ni
->ni_txpower
, ni
->ni_vlan
);
2082 printf("\ttxseq %u rxseq %u fragno %u rxfragstamp %u\n",
2084 ni
->ni_rxseqs
[0] >> IEEE80211_SEQ_SEQ_SHIFT
,
2085 ni
->ni_rxseqs
[0] & IEEE80211_SEQ_FRAG_MASK
,
2086 ni
->ni_rxfragstamp
);
2087 printf("\trstamp %u rssi %u intval %u capinfo 0x%x\n",
2088 ni
->ni_rstamp
, ni
->ni_rssi
, ni
->ni_intval
, ni
->ni_capinfo
);
2089 printf("\tbssid %s essid \"%.*s\" channel %u:0x%x\n",
2090 ether_sprintf(ni
->ni_bssid
),
2091 ni
->ni_esslen
, ni
->ni_essid
,
2092 ni
->ni_chan
->ic_freq
, ni
->ni_chan
->ic_flags
);
2093 printf("\tfails %u inact %u txrate %u\n",
2094 ni
->ni_fails
, ni
->ni_inact
, ni
->ni_txrate
);
2098 ieee80211_dump_nodes(struct ieee80211_node_table
*nt
)
2100 ieee80211_iterate_nodes(nt
,
2101 (ieee80211_iter_func
*) ieee80211_dump_node
, nt
);
2105 * Handle a station joining an 11g network.
2108 ieee80211_node_join_11g(struct ieee80211com
*ic
, struct ieee80211_node
*ni
)
2112 * Station isn't capable of short slot time. Bump
2113 * the count of long slot time stations and disable
2114 * use of short slot time. Note that the actual switch
2115 * over to long slot time use may not occur until the
2116 * next beacon transmission (per sec. 7.3.1.4 of 11g).
2118 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_SHORT_SLOTTIME
) == 0) {
2119 ic
->ic_longslotsta
++;
2120 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2121 "[%s] station needs long slot time, count %d\n",
2122 ether_sprintf(ni
->ni_macaddr
), ic
->ic_longslotsta
);
2123 /* XXX vap's w/ conflicting needs won't work */
2124 ieee80211_set_shortslottime(ic
, 0);
2127 * If the new station is not an ERP station
2128 * then bump the counter and enable protection
2131 if (!ieee80211_iserp_rateset(ic
, &ni
->ni_rates
)) {
2133 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2134 "[%s] station is !ERP, %d non-ERP stations associated\n",
2135 ether_sprintf(ni
->ni_macaddr
), ic
->ic_nonerpsta
);
2137 * If protection is configured, enable it.
2139 if (ic
->ic_protmode
!= IEEE80211_PROT_NONE
) {
2140 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2141 "%s: enable use of protection\n", __func__
);
2142 ic
->ic_flags
|= IEEE80211_F_USEPROT
;
2145 * If station does not support short preamble
2146 * then we must enable use of Barker preamble.
2148 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_SHORT_PREAMBLE
) == 0) {
2149 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2150 "[%s] station needs long preamble\n",
2151 ether_sprintf(ni
->ni_macaddr
));
2152 ic
->ic_flags
|= IEEE80211_F_USEBARKER
;
2153 ic
->ic_flags
&= ~IEEE80211_F_SHPREAMBLE
;
2156 ni
->ni_flags
|= IEEE80211_NODE_ERP
;
2160 ieee80211_node_join(struct ieee80211com
*ic
, struct ieee80211_node
*ni
, int resp
)
2164 if (ni
->ni_associd
== 0) {
2168 * It would be good to search the bitmap
2169 * more efficiently, but this will do for now.
2171 for (aid
= 1; aid
< ic
->ic_max_aid
; aid
++) {
2172 if (!IEEE80211_AID_ISSET(aid
,
2176 if (aid
>= ic
->ic_max_aid
) {
2177 IEEE80211_SEND_MGMT(ic
, ni
, resp
,
2178 IEEE80211_REASON_ASSOC_TOOMANY
);
2179 ieee80211_node_leave(ic
, ni
);
2182 ni
->ni_associd
= aid
| 0xc000;
2183 IEEE80211_AID_SET(ni
->ni_associd
, ic
->ic_aid_bitmap
);
2186 if (ic
->ic_curmode
== IEEE80211_MODE_11G
)
2187 ieee80211_node_join_11g(ic
, ni
);
2191 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
| IEEE80211_MSG_DEBUG
,
2192 "[%s] station %sassociated at aid %d: %s preamble, %s slot time%s%s\n",
2193 ether_sprintf(ni
->ni_macaddr
), newassoc
? "" : "re",
2194 IEEE80211_NODE_AID(ni
),
2195 ic
->ic_flags
& IEEE80211_F_SHPREAMBLE
? "short" : "long",
2196 ic
->ic_flags
& IEEE80211_F_SHSLOT
? "short" : "long",
2197 ic
->ic_flags
& IEEE80211_F_USEPROT
? ", protection" : "",
2198 ni
->ni_flags
& IEEE80211_NODE_QOS
? ", QoS" : ""
2201 /* give driver a chance to setup state like ni_txrate */
2202 if (ic
->ic_newassoc
!= NULL
)
2203 ic
->ic_newassoc(ni
, newassoc
);
2204 ni
->ni_inact_reload
= ic
->ic_inact_auth
;
2205 ni
->ni_inact
= ni
->ni_inact_reload
;
2206 IEEE80211_SEND_MGMT(ic
, ni
, resp
, IEEE80211_STATUS_SUCCESS
);
2207 /* tell the authenticator about new station */
2208 if (ic
->ic_auth
->ia_node_join
!= NULL
)
2209 ic
->ic_auth
->ia_node_join(ic
, ni
);
2210 ieee80211_notify_node_join(ic
, ni
, newassoc
);
2214 * Handle a station leaving an 11g network.
2217 ieee80211_node_leave_11g(struct ieee80211com
*ic
, struct ieee80211_node
*ni
)
2220 IASSERT(ic
->ic_curmode
== IEEE80211_MODE_11G
,
2221 ("not in 11g, bss %u:0x%x, curmode %u", ni
->ni_chan
->ic_freq
,
2222 ni
->ni_chan
->ic_flags
, ic
->ic_curmode
));
2225 * If a long slot station do the slot time bookkeeping.
2227 if ((ni
->ni_capinfo
& IEEE80211_CAPINFO_SHORT_SLOTTIME
) == 0) {
2228 IASSERT(ic
->ic_longslotsta
> 0,
2229 ("bogus long slot station count %d", ic
->ic_longslotsta
));
2230 ic
->ic_longslotsta
--;
2231 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2232 "[%s] long slot time station leaves, count now %d\n",
2233 ether_sprintf(ni
->ni_macaddr
), ic
->ic_longslotsta
);
2234 if (ic
->ic_longslotsta
== 0) {
2236 * Re-enable use of short slot time if supported
2237 * and not operating in IBSS mode (per spec).
2239 if ((ic
->ic_caps
& IEEE80211_C_SHSLOT
) &&
2240 ic
->ic_opmode
!= IEEE80211_M_IBSS
) {
2241 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2242 "%s: re-enable use of short slot time\n",
2244 ieee80211_set_shortslottime(ic
, 1);
2249 * If a non-ERP station do the protection-related bookkeeping.
2251 if ((ni
->ni_flags
& IEEE80211_NODE_ERP
) == 0) {
2252 IASSERT(ic
->ic_nonerpsta
> 0,
2253 ("bogus non-ERP station count %d", ic
->ic_nonerpsta
));
2255 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2256 "[%s] non-ERP station leaves, count now %d\n",
2257 ether_sprintf(ni
->ni_macaddr
), ic
->ic_nonerpsta
);
2258 if (ic
->ic_nonerpsta
== 0) {
2259 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2260 "%s: disable use of protection\n", __func__
);
2261 ic
->ic_flags
&= ~IEEE80211_F_USEPROT
;
2262 /* XXX verify mode? */
2263 if (ic
->ic_caps
& IEEE80211_C_SHPREAMBLE
) {
2264 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
,
2265 "%s: re-enable use of short preamble\n",
2267 ic
->ic_flags
|= IEEE80211_F_SHPREAMBLE
;
2268 ic
->ic_flags
&= ~IEEE80211_F_USEBARKER
;
2275 * Handle bookkeeping for station deauthentication/disassociation
2276 * when operating as an ap.
2279 ieee80211_node_leave(struct ieee80211com
*ic
, struct ieee80211_node
*ni
)
2281 struct ieee80211_node_table
*nt
= ni
->ni_table
;
2283 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_ASSOC
| IEEE80211_MSG_DEBUG
,
2284 "[%s] station with aid %d leaves\n",
2285 ether_sprintf(ni
->ni_macaddr
), IEEE80211_NODE_AID(ni
));
2287 IASSERT(ic
->ic_opmode
== IEEE80211_M_HOSTAP
||
2288 ic
->ic_opmode
== IEEE80211_M_IBSS
||
2289 ic
->ic_opmode
== IEEE80211_M_AHDEMO
,
2290 ("unexpected operating mode %u", ic
->ic_opmode
));
2292 * If node wasn't previously associated all
2293 * we need to do is reclaim the reference.
2295 /* XXX ibss mode bypasses 11g and notification */
2296 if (ni
->ni_associd
== 0)
2299 * Tell the authenticator the station is leaving.
2300 * Note that we must do this before yanking the
2301 * association id as the authenticator uses the
2302 * associd to locate it's state block.
2304 if (ic
->ic_auth
->ia_node_leave
!= NULL
)
2305 ic
->ic_auth
->ia_node_leave(ic
, ni
);
2306 IEEE80211_AID_CLR(ni
->ni_associd
, ic
->ic_aid_bitmap
);
2310 if (ic
->ic_curmode
== IEEE80211_MODE_11G
)
2311 ieee80211_node_leave_11g(ic
, ni
);
2313 * Cleanup station state. In particular clear various
2314 * state that might otherwise be reused if the node
2315 * is reused before the reference count goes to zero
2316 * (and memory is reclaimed).
2318 ieee80211_sta_leave(ic
, ni
);
2321 * Remove the node from any table it's recorded in and
2322 * drop the caller's reference. Removal from the table
2323 * is important to insure the node is not reprocessed
2327 IEEE80211_NODE_LOCK(nt
);
2328 node_reclaim(nt
, ni
);
2329 IEEE80211_NODE_UNLOCK(nt
);
2331 ieee80211_free_node(ni
);
2335 ieee80211_getrssi(struct ieee80211com
*ic
)
2337 #define NZ(x) ((x) == 0 ? 1 : (x))
2338 struct ieee80211_node_table
*nt
= &ic
->ic_sta
;
2339 u_int32_t rssi_samples
, rssi_total
;
2340 struct ieee80211_node
*ni
;
2344 switch (ic
->ic_opmode
) {
2345 case IEEE80211_M_IBSS
: /* average of all ibss neighbors */
2347 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
)
2348 if (ni
->ni_capinfo
& IEEE80211_CAPINFO_IBSS
) {
2350 rssi_total
+= ic
->ic_node_getrssi(ni
);
2353 case IEEE80211_M_AHDEMO
: /* average of all neighbors */
2355 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
) {
2357 rssi_total
+= ic
->ic_node_getrssi(ni
);
2360 case IEEE80211_M_HOSTAP
: /* average of all associated stations */
2361 #ifndef IEEE80211_NO_HOSTAP
2363 TAILQ_FOREACH(ni
, &nt
->nt_node
, ni_list
)
2364 if (IEEE80211_AID(ni
->ni_associd
) != 0) {
2366 rssi_total
+= ic
->ic_node_getrssi(ni
);
2368 #endif /* !IEEE80211_NO_HOSTAP */
2370 case IEEE80211_M_MONITOR
: /* XXX */
2371 case IEEE80211_M_STA
: /* use stats from associated ap */
2373 if (ic
->ic_bss
!= NULL
)
2374 rssi_total
= ic
->ic_node_getrssi(ic
->ic_bss
);
2378 return rssi_total
/ NZ(rssi_samples
);
2383 * Indicate whether there are frames queued for a station in power-save mode.
2386 ieee80211_set_tim(struct ieee80211_node
*ni
, int set
)
2388 struct ieee80211com
*ic
= ni
->ni_ic
;
2391 IASSERT(ic
->ic_opmode
== IEEE80211_M_HOSTAP
||
2392 ic
->ic_opmode
== IEEE80211_M_IBSS
,
2393 ("operating mode %u", ic
->ic_opmode
));
2395 aid
= IEEE80211_AID(ni
->ni_associd
);
2396 IASSERT(aid
< ic
->ic_max_aid
,
2397 ("bogus aid %u, max %u", aid
, ic
->ic_max_aid
));
2399 IEEE80211_BEACON_LOCK(ic
);
2400 if (set
!= (isset(ic
->ic_tim_bitmap
, aid
) != 0)) {
2402 setbit(ic
->ic_tim_bitmap
, aid
);
2403 ic
->ic_ps_pending
++;
2405 clrbit(ic
->ic_tim_bitmap
, aid
);
2406 ic
->ic_ps_pending
--;
2408 ic
->ic_flags
|= IEEE80211_F_TIMUPDATE
;
2410 IEEE80211_BEACON_UNLOCK(ic
);
2414 * Node table support.
2418 ieee80211_node_table_init(struct ieee80211com
*ic
,
2419 struct ieee80211_node_table
*nt
,
2420 const char *name
, int inact
, int keyixmax
,
2421 void (*timeout
)(struct ieee80211_node_table
*))
2424 IEEE80211_DPRINTF(ic
, IEEE80211_MSG_NODE
,
2425 "%s %s table, inact %u\n", __func__
, name
, inact
);
2429 IEEE80211_NODE_LOCK_INIT(nt
, ic
->ic_ifp
->if_xname
);
2430 IEEE80211_SCAN_LOCK_INIT(nt
, ic
->ic_ifp
->if_xname
);
2431 TAILQ_INIT(&nt
->nt_node
);
2434 nt
->nt_inact_init
= inact
;
2435 nt
->nt_timeout
= timeout
;
2436 nt
->nt_keyixmax
= keyixmax
;
2437 if (nt
->nt_keyixmax
> 0) {
2438 nt
->nt_keyixmap
= malloc(keyixmax
*
2439 sizeof(struct ieee80211_node
*), M_80211_NODE
,
2441 if (nt
->nt_keyixmap
== NULL
)
2442 if_printf(ic
->ic_ifp
,
2443 "Cannot allocate key index map with %u entries\n",
2446 nt
->nt_keyixmap
= NULL
;
2450 ieee80211_node_table_reset(struct ieee80211_node_table
*nt
)
2453 IEEE80211_DPRINTF(nt
->nt_ic
, IEEE80211_MSG_NODE
,
2454 "%s %s table\n", __func__
, nt
->nt_name
);
2456 IEEE80211_NODE_LOCK(nt
);
2457 nt
->nt_inact_timer
= 0;
2458 ieee80211_free_allnodes_locked(nt
);
2459 IEEE80211_NODE_UNLOCK(nt
);
2463 ieee80211_node_table_cleanup(struct ieee80211_node_table
*nt
)
2466 IEEE80211_DPRINTF(nt
->nt_ic
, IEEE80211_MSG_NODE
,
2467 "%s %s table\n", __func__
, nt
->nt_name
);
2469 IEEE80211_NODE_LOCK(nt
);
2470 ieee80211_free_allnodes_locked(nt
);
2471 IEEE80211_NODE_UNLOCK(nt
);
2472 if (nt
->nt_keyixmap
!= NULL
) {
2473 /* XXX verify all entries are NULL */
2475 for (i
= 0; i
< nt
->nt_keyixmax
; i
++)
2476 if (nt
->nt_keyixmap
[i
] != NULL
)
2477 printf("%s: %s[%u] still active\n", __func__
,
2479 free(nt
->nt_keyixmap
, M_80211_NODE
);
2480 nt
->nt_keyixmap
= NULL
;
2482 IEEE80211_SCAN_LOCK_DESTROY(nt
);
2483 IEEE80211_NODE_LOCK_DESTROY(nt
);