1 /*-
2 * Copyright (c) 2001 Atsushi Onoe
3 * Copyright (c) 2002-2005 Sam Leffler, Errno Consulting
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software without specific prior written permission.
16 *
17 * Alternatively, this software may be distributed under the terms of the
18 * GNU General Public License ("GPL") version 2 as published by the Free
19 * Software Foundation.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 */
32
33 #include <sys/cdefs.h>
34 __FBSDID("$FreeBSD: releng/6.2/sys/net80211/ieee80211_node.c 160223 2006-07-10 00:46:27Z sam $");
35
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/mbuf.h>
39 #include <sys/malloc.h>
40 #include <sys/kernel.h>
41
42 #include <sys/socket.h>
43
44 #include <net/if.h>
45 #include <net/if_media.h>
46 #include <net/ethernet.h>
47
48 #include <net80211/ieee80211_var.h>
49
50 #include <net/bpf.h>
51
52 /*
53 * Association id's are managed with a bit vector.
54 */
55 #define IEEE80211_AID_SET(b, w) \
56 ((w)[IEEE80211_AID(b) / 32] |= (1 << (IEEE80211_AID(b) % 32)))
57 #define IEEE80211_AID_CLR(b, w) \
58 ((w)[IEEE80211_AID(b) / 32] &= ~(1 << (IEEE80211_AID(b) % 32)))
59 #define IEEE80211_AID_ISSET(b, w) \
60 ((w)[IEEE80211_AID(b) / 32] & (1 << (IEEE80211_AID(b) % 32)))
61
62 #ifdef IEEE80211_DEBUG_REFCNT
63 #define REFCNT_LOC "%s (%s:%u) %p<%s> refcnt %d\n", __func__, func, line
64 #else
65 #define REFCNT_LOC "%s %p<%s> refcnt %d\n", __func__
66 #endif
67
68 static struct ieee80211_node *node_alloc(struct ieee80211_node_table *);
69 static void node_cleanup(struct ieee80211_node *);
70 static void node_free(struct ieee80211_node *);
71 static u_int8_t node_getrssi(const struct ieee80211_node *);
72
73 static void ieee80211_setup_node(struct ieee80211_node_table *,
74 struct ieee80211_node *, const u_int8_t *);
75 static void _ieee80211_free_node(struct ieee80211_node *);
76 static void ieee80211_free_allnodes(struct ieee80211_node_table *);
77
78 static void ieee80211_timeout_scan_candidates(struct ieee80211_node_table *);
79 static void ieee80211_timeout_stations(struct ieee80211_node_table *);
80
81 static void ieee80211_set_tim(struct ieee80211_node *, int set);
82
83 static void ieee80211_node_table_init(struct ieee80211com *ic,
84 struct ieee80211_node_table *nt, const char *name,
85 int inact, int keyixmax,
86 void (*timeout)(struct ieee80211_node_table *));
87 static void ieee80211_node_table_cleanup(struct ieee80211_node_table *nt);
88
89 MALLOC_DEFINE(M_80211_NODE, "80211node", "802.11 node state");
90
91 void
92 ieee80211_node_attach(struct ieee80211com *ic)
93 {
94
95 ic->ic_node_alloc = node_alloc;
96 ic->ic_node_free = node_free;
97 ic->ic_node_cleanup = node_cleanup;
98 ic->ic_node_getrssi = node_getrssi;
99
100 /* default station inactivity timer setings */
101 ic->ic_inact_init = IEEE80211_INACT_INIT;
102 ic->ic_inact_auth = IEEE80211_INACT_AUTH;
103 ic->ic_inact_run = IEEE80211_INACT_RUN;
104 ic->ic_inact_probe = IEEE80211_INACT_PROBE;
105
106 /* NB: driver should override */
107 ic->ic_max_aid = IEEE80211_AID_DEF;
108 ic->ic_set_tim = ieee80211_set_tim;
109 }
110
111 void
112 ieee80211_node_lateattach(struct ieee80211com *ic)
113 {
114 struct ieee80211_rsnparms *rsn;
115
116 if (ic->ic_max_aid > IEEE80211_AID_MAX)
117 ic->ic_max_aid = IEEE80211_AID_MAX;
118 MALLOC(ic->ic_aid_bitmap, u_int32_t *,
119 howmany(ic->ic_max_aid, 32) * sizeof(u_int32_t),
120 M_DEVBUF, M_NOWAIT | M_ZERO);
121 if (ic->ic_aid_bitmap == NULL) {
122 /* XXX no way to recover */
123 printf("%s: no memory for AID bitmap!\n", __func__);
124 ic->ic_max_aid = 0;
125 }
126
127 /* XXX defer until using hostap/ibss mode */
128 ic->ic_tim_len = howmany(ic->ic_max_aid, 8) * sizeof(u_int8_t);
129 MALLOC(ic->ic_tim_bitmap, u_int8_t *, ic->ic_tim_len,
130 M_DEVBUF, M_NOWAIT | M_ZERO);
131 if (ic->ic_tim_bitmap == NULL) {
132 /* XXX no way to recover */
133 printf("%s: no memory for TIM bitmap!\n", __func__);
134 }
135
136 ieee80211_node_table_init(ic, &ic->ic_sta, "station",
137 IEEE80211_INACT_INIT, ic->ic_crypto.cs_max_keyix,
138 ieee80211_timeout_stations);
139 ieee80211_node_table_init(ic, &ic->ic_scan, "scan",
140 IEEE80211_INACT_SCAN, 0,
141 ieee80211_timeout_scan_candidates);
142
143 ieee80211_reset_bss(ic);
144 /*
145 * Setup "global settings" in the bss node so that
146 * each new station automatically inherits them.
147 */
148 rsn = &ic->ic_bss->ni_rsn;
149 /* WEP, TKIP, and AES-CCM are always supported */
150 rsn->rsn_ucastcipherset |= 1<<IEEE80211_CIPHER_WEP;
151 rsn->rsn_ucastcipherset |= 1<<IEEE80211_CIPHER_TKIP;
152 rsn->rsn_ucastcipherset |= 1<<IEEE80211_CIPHER_AES_CCM;
153 if (ic->ic_caps & IEEE80211_C_AES)
154 rsn->rsn_ucastcipherset |= 1<<IEEE80211_CIPHER_AES_OCB;
155 if (ic->ic_caps & IEEE80211_C_CKIP)
156 rsn->rsn_ucastcipherset |= 1<<IEEE80211_CIPHER_CKIP;
157 /*
158 * Default unicast cipher to WEP for 802.1x use. If
159 * WPA is enabled the management code will set these
160 * values to reflect.
161 */
162 rsn->rsn_ucastcipher = IEEE80211_CIPHER_WEP;
163 rsn->rsn_ucastkeylen = 104 / NBBY;
164 /*
165 * WPA says the multicast cipher is the lowest unicast
166 * cipher supported. But we skip WEP which would
167 * otherwise be used based on this criteria.
168 */
169 rsn->rsn_mcastcipher = IEEE80211_CIPHER_TKIP;
170 rsn->rsn_mcastkeylen = 128 / NBBY;
171
172 /*
173 * We support both WPA-PSK and 802.1x; the one used
174 * is determined by the authentication mode and the
175 * setting of the PSK state.
176 */
177 rsn->rsn_keymgmtset = WPA_ASE_8021X_UNSPEC | WPA_ASE_8021X_PSK;
178 rsn->rsn_keymgmt = WPA_ASE_8021X_PSK;
179
180 ic->ic_auth = ieee80211_authenticator_get(ic->ic_bss->ni_authmode);
181 }
182
183 void
184 ieee80211_node_detach(struct ieee80211com *ic)
185 {
186
187 if (ic->ic_bss != NULL) {
188 ieee80211_free_node(ic->ic_bss);
189 ic->ic_bss = NULL;
190 }
191 ieee80211_node_table_cleanup(&ic->ic_scan);
192 ieee80211_node_table_cleanup(&ic->ic_sta);
193 if (ic->ic_aid_bitmap != NULL) {
194 FREE(ic->ic_aid_bitmap, M_DEVBUF);
195 ic->ic_aid_bitmap = NULL;
196 }
197 if (ic->ic_tim_bitmap != NULL) {
198 FREE(ic->ic_tim_bitmap, M_DEVBUF);
199 ic->ic_tim_bitmap = NULL;
200 }
201 }
202
203 /*
204 * Port authorize/unauthorize interfaces for use by an authenticator.
205 */
206
207 void
208 ieee80211_node_authorize(struct ieee80211_node *ni)
209 {
210 struct ieee80211com *ic = ni->ni_ic;
211
212 ni->ni_flags |= IEEE80211_NODE_AUTH;
213 ni->ni_inact_reload = ic->ic_inact_run;
214 }
215
216 void
217 ieee80211_node_unauthorize(struct ieee80211_node *ni)
218 {
219 ni->ni_flags &= ~IEEE80211_NODE_AUTH;
220 }
221
222 /*
223 * Set/change the channel. The rate set is also updated as
224 * to insure a consistent view by drivers.
225 */
226 static void
227 ieee80211_set_chan(struct ieee80211com *ic,
228 struct ieee80211_node *ni, struct ieee80211_channel *chan)
229 {
230 if (chan == IEEE80211_CHAN_ANYC) /* XXX while scanning */
231 chan = ic->ic_curchan;
232 ni->ni_chan = chan;
233 ni->ni_rates = ic->ic_sup_rates[ieee80211_chan2mode(ic, chan)];
234 }
235
236 /*
237 * AP scanning support.
238 */
239
240 #ifdef IEEE80211_DEBUG
241 static void
242 dump_chanlist(const u_char chans[])
243 {
244 const char *sep;
245 int i;
246
247 sep = " ";
248 for (i = 0; i < IEEE80211_CHAN_MAX; i++)
249 if (isset(chans, i)) {
250 printf("%s%u", sep, i);
251 sep = ", ";
252 }
253 }
254 #endif /* IEEE80211_DEBUG */
255
256 /*
257 * Initialize the channel set to scan based on the
258 * of available channels and the current PHY mode.
259 */
260 static void
261 ieee80211_reset_scan(struct ieee80211com *ic)
262 {
263
264 /* XXX ic_des_chan should be handled with ic_chan_active */
265 if (ic->ic_des_chan != IEEE80211_CHAN_ANYC) {
266 memset(ic->ic_chan_scan, 0, sizeof(ic->ic_chan_scan));
267 setbit(ic->ic_chan_scan,
268 ieee80211_chan2ieee(ic, ic->ic_des_chan));
269 } else
270 memcpy(ic->ic_chan_scan, ic->ic_chan_active,
271 sizeof(ic->ic_chan_active));
272 #ifdef IEEE80211_DEBUG
273 if (ieee80211_msg_scan(ic)) {
274 printf("%s: scan set:", __func__);
275 dump_chanlist(ic->ic_chan_scan);
276 printf(" start chan %u\n",
277 ieee80211_chan2ieee(ic, ic->ic_curchan));
278 }
279 #endif /* IEEE80211_DEBUG */
280 }
281
282 /*
283 * Begin an active scan.
284 */
285 void
286 ieee80211_begin_scan(struct ieee80211com *ic, int reset)
287 {
288
289 ic->ic_scan.nt_scangen++;
290 /*
291 * In all but hostap mode scanning starts off in
292 * an active mode before switching to passive.
293 */
294 if (ic->ic_opmode != IEEE80211_M_HOSTAP) {
295 ic->ic_flags |= IEEE80211_F_ASCAN;
296 ic->ic_stats.is_scan_active++;
297 } else
298 ic->ic_stats.is_scan_passive++;
299 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN,
300 "begin %s scan in %s mode, scangen %u\n",
301 (ic->ic_flags & IEEE80211_F_ASCAN) ? "active" : "passive",
302 ieee80211_phymode_name[ic->ic_curmode], ic->ic_scan.nt_scangen);
303 /*
304 * Clear scan state and flush any previously seen AP's.
305 */
306 ieee80211_reset_scan(ic);
307 if (reset)
308 ieee80211_free_allnodes(&ic->ic_scan);
309
310 ic->ic_flags |= IEEE80211_F_SCAN;
311
312 /* Scan the next channel. */
313 ieee80211_next_scan(ic);
314 }
315
316 /*
317 * Switch to the next channel marked for scanning.
318 */
319 int
320 ieee80211_next_scan(struct ieee80211com *ic)
321 {
322 struct ieee80211_channel *chan;
323
324 /*
325 * Insure any previous mgt frame timeouts don't fire.
326 * This assumes the driver does the right thing in
327 * flushing anything queued in the driver and below.
328 */
329 ic->ic_mgt_timer = 0;
330 ic->ic_flags_ext &= ~IEEE80211_FEXT_PROBECHAN;
331
332 chan = ic->ic_curchan;
333 do {
334 if (++chan > &ic->ic_channels[IEEE80211_CHAN_MAX])
335 chan = &ic->ic_channels[0];
336 if (isset(ic->ic_chan_scan, ieee80211_chan2ieee(ic, chan))) {
337 clrbit(ic->ic_chan_scan, ieee80211_chan2ieee(ic, chan));
338 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN,
339 "%s: chan %d->%d\n", __func__,
340 ieee80211_chan2ieee(ic, ic->ic_curchan),
341 ieee80211_chan2ieee(ic, chan));
342 ic->ic_curchan = chan;
343 /*
344 * XXX drivers should do this as needed,
345 * XXX for now maintain compatibility
346 */
347 ic->ic_bss->ni_rates =
348 ic->ic_sup_rates[ieee80211_chan2mode(ic, chan)];
349 ieee80211_new_state(ic, IEEE80211_S_SCAN, -1);
350 return 1;
351 }
352 } while (chan != ic->ic_curchan);
353 ieee80211_end_scan(ic);
354 return 0;
355 }
356
357 /*
358 * Probe the curent channel, if allowed, while scanning.
359 * If the channel is not marked passive-only then send
360 * a probe request immediately. Otherwise mark state and
361 * listen for beacons on the channel; if we receive something
362 * then we'll transmit a probe request.
363 */
364 void
365 ieee80211_probe_curchan(struct ieee80211com *ic, int force)
366 {
367 struct ifnet *ifp = ic->ic_ifp;
368
369 if ((ic->ic_curchan->ic_flags & IEEE80211_CHAN_PASSIVE) == 0 || force) {
370 /*
371 * XXX send both broadcast+directed probe request
372 */
373 ieee80211_send_probereq(ic->ic_bss,
374 ic->ic_myaddr, ifp->if_broadcastaddr,
375 ifp->if_broadcastaddr,
376 ic->ic_des_essid, ic->ic_des_esslen,
377 ic->ic_opt_ie, ic->ic_opt_ie_len);
378 } else
379 ic->ic_flags_ext |= IEEE80211_FEXT_PROBECHAN;
380 }
381
382 static __inline void
383 copy_bss(struct ieee80211_node *nbss, const struct ieee80211_node *obss)
384 {
385 /* propagate useful state */
386 nbss->ni_authmode = obss->ni_authmode;
387 nbss->ni_txpower = obss->ni_txpower;
388 nbss->ni_vlan = obss->ni_vlan;
389 nbss->ni_rsn = obss->ni_rsn;
390 /* XXX statistics? */
391 }
392
393 void
394 ieee80211_create_ibss(struct ieee80211com* ic, struct ieee80211_channel *chan)
395 {
396 struct ieee80211_node_table *nt;
397 struct ieee80211_node *ni;
398
399 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN,
400 "%s: creating ibss\n", __func__);
401
402 /*
403 * Create the station/neighbor table. Note that for adhoc
404 * mode we make the initial inactivity timer longer since
405 * we create nodes only through discovery and they typically
406 * are long-lived associations.
407 */
408 nt = &ic->ic_sta;
409 IEEE80211_NODE_LOCK(nt);
410 if (ic->ic_opmode == IEEE80211_M_HOSTAP) {
411 nt->nt_name = "station";
412 nt->nt_inact_init = ic->ic_inact_init;
413 } else {
414 nt->nt_name = "neighbor";
415 nt->nt_inact_init = ic->ic_inact_run;
416 }
417 IEEE80211_NODE_UNLOCK(nt);
418
419 ni = ieee80211_alloc_node(&ic->ic_sta, ic->ic_myaddr);
420 if (ni == NULL) {
421 /* XXX recovery? */
422 return;
423 }
424 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_myaddr);
425 ni->ni_esslen = ic->ic_des_esslen;
426 memcpy(ni->ni_essid, ic->ic_des_essid, ni->ni_esslen);
427 copy_bss(ni, ic->ic_bss);
428 ni->ni_intval = ic->ic_bintval;
429 if (ic->ic_flags & IEEE80211_F_PRIVACY)
430 ni->ni_capinfo |= IEEE80211_CAPINFO_PRIVACY;
431 if (ic->ic_phytype == IEEE80211_T_FH) {
432 ni->ni_fhdwell = 200; /* XXX */
433 ni->ni_fhindex = 1;
434 }
435 if (ic->ic_opmode == IEEE80211_M_IBSS) {
436 ic->ic_flags |= IEEE80211_F_SIBSS;
437 ni->ni_capinfo |= IEEE80211_CAPINFO_IBSS; /* XXX */
438 if (ic->ic_flags & IEEE80211_F_DESBSSID)
439 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_des_bssid);
440 else
441 ni->ni_bssid[0] |= 0x02; /* local bit for IBSS */
442 } else if (ic->ic_opmode == IEEE80211_M_AHDEMO) {
443 if (ic->ic_flags & IEEE80211_F_DESBSSID)
444 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_des_bssid);
445 else
446 memset(ni->ni_bssid, 0, IEEE80211_ADDR_LEN);
447 }
448 /*
449 * Fix the channel and related attributes.
450 */
451 ieee80211_set_chan(ic, ni, chan);
452 ic->ic_curchan = chan;
453 ic->ic_curmode = ieee80211_chan2mode(ic, chan);
454 /*
455 * Do mode-specific rate setup.
456 */
457 if (ic->ic_curmode == IEEE80211_MODE_11G) {
458 /*
459 * Use a mixed 11b/11g rate set.
460 */
461 ieee80211_set11gbasicrates(&ni->ni_rates, IEEE80211_MODE_11G);
462 } else if (ic->ic_curmode == IEEE80211_MODE_11B) {
463 /*
464 * Force pure 11b rate set.
465 */
466 ieee80211_set11gbasicrates(&ni->ni_rates, IEEE80211_MODE_11B);
467 }
468
469 (void) ieee80211_sta_join(ic, ieee80211_ref_node(ni));
470 }
471
472 void
473 ieee80211_reset_bss(struct ieee80211com *ic)
474 {
475 struct ieee80211_node *ni, *obss;
476
477 ieee80211_node_table_reset(&ic->ic_scan);
478 ieee80211_node_table_reset(&ic->ic_sta);
479
480 ni = ieee80211_alloc_node(&ic->ic_scan, ic->ic_myaddr);
481 KASSERT(ni != NULL, ("unable to setup inital BSS node"));
482 obss = ic->ic_bss;
483 ic->ic_bss = ieee80211_ref_node(ni);
484 if (obss != NULL) {
485 copy_bss(ni, obss);
486 ni->ni_intval = ic->ic_bintval;
487 ieee80211_free_node(obss);
488 }
489 }
490
491 /* XXX tunable */
492 #define STA_FAILS_MAX 2 /* assoc failures before ignored */
493
494 static int
495 ieee80211_match_bss(struct ieee80211com *ic, struct ieee80211_node *ni)
496 {
497 u_int8_t rate;
498 int fail;
499
500 fail = 0;
501 if (isclr(ic->ic_chan_active, ieee80211_chan2ieee(ic, ni->ni_chan)))
502 fail |= 0x01;
503 if (ic->ic_des_chan != IEEE80211_CHAN_ANYC &&
504 ni->ni_chan != ic->ic_des_chan)
505 fail |= 0x01;
506 if (ic->ic_opmode == IEEE80211_M_IBSS) {
507 if ((ni->ni_capinfo & IEEE80211_CAPINFO_IBSS) == 0)
508 fail |= 0x02;
509 } else {
510 if ((ni->ni_capinfo & IEEE80211_CAPINFO_ESS) == 0)
511 fail |= 0x02;
512 }
513 if (ic->ic_flags & IEEE80211_F_PRIVACY) {
514 if ((ni->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) == 0)
515 fail |= 0x04;
516 } else {
517 /* XXX does this mean privacy is supported or required? */
518 if (ni->ni_capinfo & IEEE80211_CAPINFO_PRIVACY)
519 fail |= 0x04;
520 }
521 rate = ieee80211_fix_rate(ni, IEEE80211_F_DONEGO | IEEE80211_F_DOFRATE);
522 if (rate & IEEE80211_RATE_BASIC)
523 fail |= 0x08;
524 if (ic->ic_des_esslen != 0 &&
525 (ni->ni_esslen != ic->ic_des_esslen ||
526 memcmp(ni->ni_essid, ic->ic_des_essid, ic->ic_des_esslen) != 0))
527 fail |= 0x10;
528 if ((ic->ic_flags & IEEE80211_F_DESBSSID) &&
529 !IEEE80211_ADDR_EQ(ic->ic_des_bssid, ni->ni_bssid))
530 fail |= 0x20;
531 if (ni->ni_fails >= STA_FAILS_MAX)
532 fail |= 0x40;
533 #ifdef IEEE80211_DEBUG
534 if (ieee80211_msg_scan(ic)) {
535 printf(" %c %s",
536 fail & 0x40 ? '=' : fail & 0x80 ? '^' : fail ? '-' : '+',
537 ether_sprintf(ni->ni_macaddr));
538 printf(" %s%c", ether_sprintf(ni->ni_bssid),
539 fail & 0x20 ? '!' : ' ');
540 printf(" %3d%c", ieee80211_chan2ieee(ic, ni->ni_chan),
541 fail & 0x01 ? '!' : ' ');
542 printf(" %+4d", ni->ni_rssi);
543 printf(" %2dM%c", (rate & IEEE80211_RATE_VAL) / 2,
544 fail & 0x08 ? '!' : ' ');
545 printf(" %4s%c",
546 (ni->ni_capinfo & IEEE80211_CAPINFO_ESS) ? "ess" :
547 (ni->ni_capinfo & IEEE80211_CAPINFO_IBSS) ? "ibss" :
548 "????",
549 fail & 0x02 ? '!' : ' ');
550 printf(" %3s%c ",
551 (ni->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) ?
552 "wep" : "no",
553 fail & 0x04 ? '!' : ' ');
554 ieee80211_print_essid(ni->ni_essid, ni->ni_esslen);
555 printf("%s\n", fail & 0x10 ? "!" : "");
556 }
557 #endif
558 return fail;
559 }
560
561 static __inline u_int8_t
562 maxrate(const struct ieee80211_node *ni)
563 {
564 const struct ieee80211_rateset *rs = &ni->ni_rates;
565 /* NB: assumes rate set is sorted (happens on frame receive) */
566 return rs->rs_rates[rs->rs_nrates-1] & IEEE80211_RATE_VAL;
567 }
568
569 /*
570 * Compare the capabilities of two nodes and decide which is
571 * more desirable (return >0 if a is considered better). Note
572 * that we assume compatibility/usability has already been checked
573 * so we don't need to (e.g. validate whether privacy is supported).
574 * Used to select the best scan candidate for association in a BSS.
575 */
576 static int
577 ieee80211_node_compare(struct ieee80211com *ic,
578 const struct ieee80211_node *a,
579 const struct ieee80211_node *b)
580 {
581 u_int8_t maxa, maxb;
582 u_int8_t rssia, rssib;
583 int weight;
584
585 /* privacy support preferred */
586 if ((a->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) &&
587 (b->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) == 0)
588 return 1;
589 if ((a->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) == 0 &&
590 (b->ni_capinfo & IEEE80211_CAPINFO_PRIVACY))
591 return -1;
592
593 /* compare count of previous failures */
594 weight = b->ni_fails - a->ni_fails;
595 if (abs(weight) > 1)
596 return weight;
597
598 rssia = ic->ic_node_getrssi(a);
599 rssib = ic->ic_node_getrssi(b);
600 if (abs(rssib - rssia) < 5) {
601 /* best/max rate preferred if signal level close enough XXX */
602 maxa = maxrate(a);
603 maxb = maxrate(b);
604 if (maxa != maxb)
605 return maxa - maxb;
606 /* XXX use freq for channel preference */
607 /* for now just prefer 5Ghz band to all other bands */
608 if (IEEE80211_IS_CHAN_5GHZ(a->ni_chan) &&
609 !IEEE80211_IS_CHAN_5GHZ(b->ni_chan))
610 return 1;
611 if (!IEEE80211_IS_CHAN_5GHZ(a->ni_chan) &&
612 IEEE80211_IS_CHAN_5GHZ(b->ni_chan))
613 return -1;
614 }
615 /* all things being equal, use signal level */
616 return rssia - rssib;
617 }
618
619 /*
620 * Mark an ongoing scan stopped.
621 */
622 void
623 ieee80211_cancel_scan(struct ieee80211com *ic)
624 {
625
626 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN, "%s: end %s scan\n",
627 __func__,
628 (ic->ic_flags & IEEE80211_F_ASCAN) ? "active" : "passive");
629
630 ic->ic_flags &= ~(IEEE80211_F_SCAN | IEEE80211_F_ASCAN);
631 ic->ic_flags_ext &= ~IEEE80211_FEXT_PROBECHAN;
632 }
633
634 /*
635 * Complete a scan of potential channels.
636 */
637 void
638 ieee80211_end_scan(struct ieee80211com *ic)
639 {
640 struct ieee80211_node_table *nt = &ic->ic_scan;
641 struct ieee80211_node *ni, *selbs;
642
643 ieee80211_cancel_scan(ic);
644 ieee80211_notify_scan_done(ic);
645
646 if (ic->ic_opmode == IEEE80211_M_HOSTAP) {
647 u_int8_t maxrssi[IEEE80211_CHAN_MAX]; /* XXX off stack? */
648 int i, bestchan;
649 u_int8_t rssi;
650
651 /*
652 * The passive scan to look for existing AP's completed,
653 * select a channel to camp on. Identify the channels
654 * that already have one or more AP's and try to locate
655 * an unoccupied one. If that fails, pick a channel that
656 * looks to be quietest.
657 */
658 memset(maxrssi, 0, sizeof(maxrssi));
659 IEEE80211_NODE_LOCK(nt);
660 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
661 rssi = ic->ic_node_getrssi(ni);
662 i = ieee80211_chan2ieee(ic, ni->ni_chan);
663 if (rssi > maxrssi[i])
664 maxrssi[i] = rssi;
665 }
666 IEEE80211_NODE_UNLOCK(nt);
667 /* XXX select channel more intelligently */
668 bestchan = -1;
669 for (i = 0; i < IEEE80211_CHAN_MAX; i++)
670 if (isset(ic->ic_chan_active, i)) {
671 /*
672 * If the channel is unoccupied the max rssi
673 * should be zero; just take it. Otherwise
674 * track the channel with the lowest rssi and
675 * use that when all channels appear occupied.
676 */
677 if (maxrssi[i] == 0) {
678 bestchan = i;
679 break;
680 }
681 if (bestchan == -1 ||
682 maxrssi[i] < maxrssi[bestchan])
683 bestchan = i;
684 }
685 if (bestchan != -1) {
686 ieee80211_create_ibss(ic, &ic->ic_channels[bestchan]);
687 return;
688 }
689 /* no suitable channel, should not happen */
690 }
691
692 /*
693 * When manually sequencing the state machine; scan just once
694 * regardless of whether we have a candidate or not. The
695 * controlling application is expected to setup state and
696 * initiate an association.
697 */
698 if (ic->ic_roaming == IEEE80211_ROAMING_MANUAL)
699 return;
700 /*
701 * Automatic sequencing; look for a candidate and
702 * if found join the network.
703 */
704 /* NB: unlocked read should be ok */
705 if (TAILQ_FIRST(&nt->nt_node) == NULL) {
706 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN,
707 "%s: no scan candidate\n", __func__);
708 notfound:
709 if (ic->ic_opmode == IEEE80211_M_IBSS &&
710 (ic->ic_flags & IEEE80211_F_IBSSON) &&
711 ic->ic_des_esslen != 0) {
712 ieee80211_create_ibss(ic, ic->ic_ibss_chan);
713 return;
714 }
715 /*
716 * Decrement the failure counts so entries will be
717 * reconsidered the next time around. We really want
718 * to do this only for sta's where we've previously
719 * had some success.
720 */
721 IEEE80211_NODE_LOCK(nt);
722 TAILQ_FOREACH(ni, &nt->nt_node, ni_list)
723 if (ni->ni_fails)
724 ni->ni_fails--;
725 IEEE80211_NODE_UNLOCK(nt);
726 /*
727 * Reset the list of channels to scan and start again.
728 */
729 ieee80211_reset_scan(ic);
730 ic->ic_flags |= IEEE80211_F_SCAN;
731 ieee80211_next_scan(ic);
732 return;
733 }
734 selbs = NULL;
735 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN, "\t%s\n",
736 "macaddr bssid chan rssi rate flag wep essid");
737 IEEE80211_NODE_LOCK(nt);
738 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
739 if (ieee80211_match_bss(ic, ni) == 0) {
740 if (selbs == NULL)
741 selbs = ni;
742 else if (ieee80211_node_compare(ic, ni, selbs) > 0)
743 selbs = ni;
744 }
745 }
746 if (selbs != NULL) /* NB: grab ref while dropping lock */
747 (void) ieee80211_ref_node(selbs);
748 IEEE80211_NODE_UNLOCK(nt);
749 if (selbs == NULL)
750 goto notfound;
751 if (!ieee80211_sta_join(ic, selbs)) {
752 ieee80211_free_node(selbs);
753 goto notfound;
754 }
755 }
756
757 /*
758 * Handle 802.11 ad hoc network merge. The
759 * convention, set by the Wireless Ethernet Compatibility Alliance
760 * (WECA), is that an 802.11 station will change its BSSID to match
761 * the "oldest" 802.11 ad hoc network, on the same channel, that
762 * has the station's desired SSID. The "oldest" 802.11 network
763 * sends beacons with the greatest TSF timestamp.
764 *
765 * The caller is assumed to validate TSF's before attempting a merge.
766 *
767 * Return !0 if the BSSID changed, 0 otherwise.
768 */
769 int
770 ieee80211_ibss_merge(struct ieee80211_node *ni)
771 {
772 struct ieee80211com *ic = ni->ni_ic;
773
774 if (ni == ic->ic_bss ||
775 IEEE80211_ADDR_EQ(ni->ni_bssid, ic->ic_bss->ni_bssid)) {
776 /* unchanged, nothing to do */
777 return 0;
778 }
779 if (ieee80211_match_bss(ic, ni) != 0) { /* capabilities mismatch */
780 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
781 "%s: merge failed, capabilities mismatch\n", __func__);
782 ic->ic_stats.is_ibss_capmismatch++;
783 return 0;
784 }
785 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
786 "%s: new bssid %s: %s preamble, %s slot time%s\n", __func__,
787 ether_sprintf(ni->ni_bssid),
788 ic->ic_flags&IEEE80211_F_SHPREAMBLE ? "short" : "long",
789 ic->ic_flags&IEEE80211_F_SHSLOT ? "short" : "long",
790 ic->ic_flags&IEEE80211_F_USEPROT ? ", protection" : ""
791 );
792 return ieee80211_sta_join(ic, ieee80211_ref_node(ni));
793 }
794
795 /*
796 * Join the specified IBSS/BSS network. The node is assumed to
797 * be passed in with a held reference.
798 */
799 int
800 ieee80211_sta_join(struct ieee80211com *ic, struct ieee80211_node *selbs)
801 {
802 struct ieee80211_node *obss;
803
804 if (ic->ic_opmode == IEEE80211_M_IBSS) {
805 struct ieee80211_node_table *nt;
806 /*
807 * Delete unusable rates; we've already checked
808 * that the negotiated rate set is acceptable.
809 */
810 ieee80211_fix_rate(selbs, IEEE80211_F_DODEL);
811 /*
812 * Fillin the neighbor table; it will already
813 * exist if we are simply switching mastership.
814 * XXX ic_sta always setup so this is unnecessary?
815 */
816 nt = &ic->ic_sta;
817 IEEE80211_NODE_LOCK(nt);
818 nt->nt_name = "neighbor";
819 nt->nt_inact_init = ic->ic_inact_run;
820 IEEE80211_NODE_UNLOCK(nt);
821 }
822
823 /*
824 * Committed to selbs, setup state.
825 */
826 obss = ic->ic_bss;
827 ic->ic_bss = selbs; /* NB: caller assumed to bump refcnt */
828 if (obss != NULL) {
829 copy_bss(selbs, obss);
830 ieee80211_free_node(obss);
831 }
832 /*
833 * Set the erp state (mostly the slot time) to deal with
834 * the auto-select case; this should be redundant if the
835 * mode is locked.
836 */
837 ic->ic_curmode = ieee80211_chan2mode(ic, selbs->ni_chan);
838 ic->ic_curchan = selbs->ni_chan;
839 ieee80211_reset_erp(ic);
840 ieee80211_wme_initparams(ic);
841
842 if (ic->ic_opmode == IEEE80211_M_STA)
843 ieee80211_new_state(ic, IEEE80211_S_AUTH, -1);
844 else
845 ieee80211_new_state(ic, IEEE80211_S_RUN, -1);
846 return 1;
847 }
848
849 /*
850 * Leave the specified IBSS/BSS network. The node is assumed to
851 * be passed in with a held reference.
852 */
853 void
854 ieee80211_sta_leave(struct ieee80211com *ic, struct ieee80211_node *ni)
855 {
856 ic->ic_node_cleanup(ni);
857 ieee80211_notify_node_leave(ic, ni);
858 }
859
860 static struct ieee80211_node *
861 node_alloc(struct ieee80211_node_table *nt)
862 {
863 struct ieee80211_node *ni;
864
865 MALLOC(ni, struct ieee80211_node *, sizeof(struct ieee80211_node),
866 M_80211_NODE, M_NOWAIT | M_ZERO);
867 return ni;
868 }
869
870 /*
871 * Reclaim any resources in a node and reset any critical
872 * state. Typically nodes are free'd immediately after,
873 * but in some cases the storage may be reused so we need
874 * to insure consistent state (should probably fix that).
875 */
876 static void
877 node_cleanup(struct ieee80211_node *ni)
878 {
879 #define N(a) (sizeof(a)/sizeof(a[0]))
880 struct ieee80211com *ic = ni->ni_ic;
881 int i, qlen;
882
883 /* NB: preserve ni_table */
884 if (ni->ni_flags & IEEE80211_NODE_PWR_MGT) {
885 ic->ic_ps_sta--;
886 ni->ni_flags &= ~IEEE80211_NODE_PWR_MGT;
887 IEEE80211_DPRINTF(ic, IEEE80211_MSG_POWER,
888 "[%s] power save mode off, %u sta's in ps mode\n",
889 ether_sprintf(ni->ni_macaddr), ic->ic_ps_sta);
890 }
891 /*
892 * Clear AREF flag that marks the authorization refcnt bump
893 * has happened. This is probably not needed as the node
894 * should always be removed from the table so not found but
895 * do it just in case.
896 */
897 ni->ni_flags &= ~IEEE80211_NODE_AREF;
898
899 /*
900 * Drain power save queue and, if needed, clear TIM.
901 */
902 IEEE80211_NODE_SAVEQ_DRAIN(ni, qlen);
903 if (qlen != 0 && ic->ic_set_tim != NULL)
904 ic->ic_set_tim(ni, 0);
905
906 ni->ni_associd = 0;
907 if (ni->ni_challenge != NULL) {
908 FREE(ni->ni_challenge, M_DEVBUF);
909 ni->ni_challenge = NULL;
910 }
911 /*
912 * Preserve SSID, WPA, and WME ie's so the bss node is
913 * reusable during a re-auth/re-assoc state transition.
914 * If we remove these data they will not be recreated
915 * because they come from a probe-response or beacon frame
916 * which cannot be expected prior to the association-response.
917 * This should not be an issue when operating in other modes
918 * as stations leaving always go through a full state transition
919 * which will rebuild this state.
920 *
921 * XXX does this leave us open to inheriting old state?
922 */
923 for (i = 0; i < N(ni->ni_rxfrag); i++)
924 if (ni->ni_rxfrag[i] != NULL) {
925 m_freem(ni->ni_rxfrag[i]);
926 ni->ni_rxfrag[i] = NULL;
927 }
928 /*
929 * Must be careful here to remove any key map entry w/o a LOR.
930 */
931 ieee80211_node_delucastkey(ni);
932 #undef N
933 }
934
935 static void
936 node_free(struct ieee80211_node *ni)
937 {
938 struct ieee80211com *ic = ni->ni_ic;
939
940 ic->ic_node_cleanup(ni);
941 if (ni->ni_wpa_ie != NULL)
942 FREE(ni->ni_wpa_ie, M_DEVBUF);
943 if (ni->ni_wme_ie != NULL)
944 FREE(ni->ni_wme_ie, M_DEVBUF);
945 IEEE80211_NODE_SAVEQ_DESTROY(ni);
946 FREE(ni, M_80211_NODE);
947 }
948
949 static u_int8_t
950 node_getrssi(const struct ieee80211_node *ni)
951 {
952 return ni->ni_rssi;
953 }
954
955 static void
956 ieee80211_setup_node(struct ieee80211_node_table *nt,
957 struct ieee80211_node *ni, const u_int8_t *macaddr)
958 {
959 struct ieee80211com *ic = nt->nt_ic;
960 int hash;
961
962 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
963 "%s %p<%s> in %s table\n", __func__, ni,
964 ether_sprintf(macaddr), nt->nt_name);
965
966 IEEE80211_ADDR_COPY(ni->ni_macaddr, macaddr);
967 hash = IEEE80211_NODE_HASH(macaddr);
968 ieee80211_node_initref(ni); /* mark referenced */
969 ni->ni_chan = IEEE80211_CHAN_ANYC;
970 ni->ni_authmode = IEEE80211_AUTH_OPEN;
971 ni->ni_txpower = ic->ic_txpowlimit; /* max power */
972 ieee80211_crypto_resetkey(ic, &ni->ni_ucastkey, IEEE80211_KEYIX_NONE);
973 ni->ni_inact_reload = nt->nt_inact_init;
974 ni->ni_inact = ni->ni_inact_reload;
975 IEEE80211_NODE_SAVEQ_INIT(ni, "unknown");
976
977 IEEE80211_NODE_LOCK(nt);
978 TAILQ_INSERT_TAIL(&nt->nt_node, ni, ni_list);
979 LIST_INSERT_HEAD(&nt->nt_hash[hash], ni, ni_hash);
980 ni->ni_table = nt;
981 ni->ni_ic = ic;
982 IEEE80211_NODE_UNLOCK(nt);
983 }
984
985 struct ieee80211_node *
986 ieee80211_alloc_node(struct ieee80211_node_table *nt, const u_int8_t *macaddr)
987 {
988 struct ieee80211com *ic = nt->nt_ic;
989 struct ieee80211_node *ni;
990
991 ni = ic->ic_node_alloc(nt);
992 if (ni != NULL)
993 ieee80211_setup_node(nt, ni, macaddr);
994 else
995 ic->ic_stats.is_rx_nodealloc++;
996 return ni;
997 }
998
999 /*
1000 * Craft a temporary node suitable for sending a management frame
1001 * to the specified station. We craft only as much state as we
1002 * need to do the work since the node will be immediately reclaimed
1003 * once the send completes.
1004 */
1005 struct ieee80211_node *
1006 ieee80211_tmp_node(struct ieee80211com *ic, const u_int8_t *macaddr)
1007 {
1008 struct ieee80211_node *ni;
1009
1010 ni = ic->ic_node_alloc(&ic->ic_sta);
1011 if (ni != NULL) {
1012 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1013 "%s %p<%s>\n", __func__, ni, ether_sprintf(macaddr));
1014
1015 IEEE80211_ADDR_COPY(ni->ni_macaddr, macaddr);
1016 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_bss->ni_bssid);
1017 ieee80211_node_initref(ni); /* mark referenced */
1018 ni->ni_txpower = ic->ic_bss->ni_txpower;
1019 /* NB: required by ieee80211_fix_rate */
1020 ieee80211_set_chan(ic, ni, ic->ic_bss->ni_chan);
1021 ieee80211_crypto_resetkey(ic, &ni->ni_ucastkey,
1022 IEEE80211_KEYIX_NONE);
1023 /* XXX optimize away */
1024 IEEE80211_NODE_SAVEQ_INIT(ni, "unknown");
1025
1026 ni->ni_table = NULL; /* NB: pedantic */
1027 ni->ni_ic = ic;
1028 } else {
1029 /* XXX msg */
1030 ic->ic_stats.is_rx_nodealloc++;
1031 }
1032 return ni;
1033 }
1034
1035 struct ieee80211_node *
1036 ieee80211_dup_bss(struct ieee80211_node_table *nt, const u_int8_t *macaddr)
1037 {
1038 struct ieee80211com *ic = nt->nt_ic;
1039 struct ieee80211_node *ni;
1040
1041 ni = ic->ic_node_alloc(nt);
1042 if (ni != NULL) {
1043 ieee80211_setup_node(nt, ni, macaddr);
1044 /*
1045 * Inherit from ic_bss.
1046 */
1047 ni->ni_authmode = ic->ic_bss->ni_authmode;
1048 ni->ni_txpower = ic->ic_bss->ni_txpower;
1049 ni->ni_vlan = ic->ic_bss->ni_vlan; /* XXX?? */
1050 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_bss->ni_bssid);
1051 ieee80211_set_chan(ic, ni, ic->ic_bss->ni_chan);
1052 ni->ni_rsn = ic->ic_bss->ni_rsn;
1053 } else
1054 ic->ic_stats.is_rx_nodealloc++;
1055 return ni;
1056 }
1057
1058 static struct ieee80211_node *
1059 #ifdef IEEE80211_DEBUG_REFCNT
1060 _ieee80211_find_node_debug(struct ieee80211_node_table *nt,
1061 const u_int8_t *macaddr, const char *func, int line)
1062 #else
1063 _ieee80211_find_node(struct ieee80211_node_table *nt,
1064 const u_int8_t *macaddr)
1065 #endif
1066 {
1067 struct ieee80211_node *ni;
1068 int hash;
1069
1070 IEEE80211_NODE_LOCK_ASSERT(nt);
1071
1072 hash = IEEE80211_NODE_HASH(macaddr);
1073 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1074 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr)) {
1075 ieee80211_ref_node(ni); /* mark referenced */
1076 #ifdef IEEE80211_DEBUG_REFCNT
1077 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE,
1078 "%s (%s:%u) %p<%s> refcnt %d\n", __func__,
1079 func, line,
1080 ni, ether_sprintf(ni->ni_macaddr),
1081 ieee80211_node_refcnt(ni));
1082 #endif
1083 return ni;
1084 }
1085 }
1086 return NULL;
1087 }
1088 #ifdef IEEE80211_DEBUG_REFCNT
1089 #define _ieee80211_find_node(nt, mac) \
1090 _ieee80211_find_node_debug(nt, mac, func, line)
1091 #endif
1092
1093 struct ieee80211_node *
1094 #ifdef IEEE80211_DEBUG_REFCNT
1095 ieee80211_find_node_debug(struct ieee80211_node_table *nt,
1096 const u_int8_t *macaddr, const char *func, int line)
1097 #else
1098 ieee80211_find_node(struct ieee80211_node_table *nt, const u_int8_t *macaddr)
1099 #endif
1100 {
1101 struct ieee80211_node *ni;
1102
1103 IEEE80211_NODE_LOCK(nt);
1104 ni = _ieee80211_find_node(nt, macaddr);
1105 IEEE80211_NODE_UNLOCK(nt);
1106 return ni;
1107 }
1108
1109 /*
1110 * Fake up a node; this handles node discovery in adhoc mode.
1111 * Note that for the driver's benefit we we treat this like
1112 * an association so the driver has an opportunity to setup
1113 * it's private state.
1114 */
1115 struct ieee80211_node *
1116 ieee80211_fakeup_adhoc_node(struct ieee80211_node_table *nt,
1117 const u_int8_t macaddr[IEEE80211_ADDR_LEN])
1118 {
1119 struct ieee80211com *ic = nt->nt_ic;
1120 struct ieee80211_node *ni;
1121
1122 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE,
1123 "%s: mac<%s>\n", __func__, ether_sprintf(macaddr));
1124 ni = ieee80211_dup_bss(nt, macaddr);
1125 if (ni != NULL) {
1126 /* XXX no rate negotiation; just dup */
1127 ni->ni_rates = ic->ic_bss->ni_rates;
1128 if (ic->ic_newassoc != NULL)
1129 ic->ic_newassoc(ni, 1);
1130 /* XXX not right for 802.1x/WPA */
1131 ieee80211_node_authorize(ni);
1132 if (ic->ic_opmode == IEEE80211_M_AHDEMO) {
1133 /*
1134 * Blindly propagate capabilities based on the
1135 * local configuration. In particular this permits
1136 * us to use QoS to disable ACK's.
1137 */
1138 if (ic->ic_flags & IEEE80211_F_WME)
1139 ni->ni_flags |= IEEE80211_NODE_QOS;
1140 }
1141 }
1142 return ni;
1143 }
1144
1145 #ifdef IEEE80211_DEBUG
1146 static void
1147 dump_probe_beacon(u_int8_t subtype, int isnew,
1148 const u_int8_t mac[IEEE80211_ADDR_LEN],
1149 const struct ieee80211_scanparams *sp)
1150 {
1151
1152 printf("[%s] %s%s on chan %u (bss chan %u) ",
1153 ether_sprintf(mac), isnew ? "new " : "",
1154 ieee80211_mgt_subtype_name[subtype >> IEEE80211_FC0_SUBTYPE_SHIFT],
1155 sp->chan, sp->bchan);
1156 ieee80211_print_essid(sp->ssid + 2, sp->ssid[1]);
1157 printf("\n");
1158
1159 if (isnew) {
1160 printf("[%s] caps 0x%x bintval %u erp 0x%x",
1161 ether_sprintf(mac), sp->capinfo, sp->bintval, sp->erp);
1162 if (sp->country != NULL) {
1163 #ifdef __FreeBSD__
1164 printf(" country info %*D",
1165 sp->country[1], sp->country+2, " ");
1166 #else
1167 int i;
1168 printf(" country info");
1169 for (i = 0; i < sp->country[1]; i++)
1170 printf(" %02x", sp->country[i+2]);
1171 #endif
1172 }
1173 printf("\n");
1174 }
1175 }
1176 #endif /* IEEE80211_DEBUG */
1177
1178 static void
1179 saveie(u_int8_t **iep, const u_int8_t *ie)
1180 {
1181
1182 if (ie == NULL)
1183 *iep = NULL;
1184 else
1185 ieee80211_saveie(iep, ie);
1186 }
1187
1188 /*
1189 * Process a beacon or probe response frame.
1190 */
1191 void
1192 ieee80211_add_scan(struct ieee80211com *ic,
1193 const struct ieee80211_scanparams *sp,
1194 const struct ieee80211_frame *wh,
1195 int subtype, int rssi, int rstamp)
1196 {
1197 #define ISPROBE(_st) ((_st) == IEEE80211_FC0_SUBTYPE_PROBE_RESP)
1198 struct ieee80211_node_table *nt = &ic->ic_scan;
1199 struct ieee80211_node *ni;
1200 int newnode = 0;
1201
1202 ni = ieee80211_find_node(nt, wh->i_addr2);
1203 if (ni == NULL) {
1204 /*
1205 * Create a new entry.
1206 */
1207 ni = ic->ic_node_alloc(nt);
1208 if (ni == NULL) {
1209 ic->ic_stats.is_rx_nodealloc++;
1210 return;
1211 }
1212 ieee80211_setup_node(nt, ni, wh->i_addr2);
1213 /*
1214 * XXX inherit from ic_bss.
1215 */
1216 ni->ni_authmode = ic->ic_bss->ni_authmode;
1217 ni->ni_txpower = ic->ic_bss->ni_txpower;
1218 ni->ni_vlan = ic->ic_bss->ni_vlan; /* XXX?? */
1219 ieee80211_set_chan(ic, ni, ic->ic_curchan);
1220 ni->ni_rsn = ic->ic_bss->ni_rsn;
1221 newnode = 1;
1222 }
1223 #ifdef IEEE80211_DEBUG
1224 if (ieee80211_msg_scan(ic) && (ic->ic_flags & IEEE80211_F_SCAN))
1225 dump_probe_beacon(subtype, newnode, wh->i_addr2, sp);
1226 #endif
1227 /* XXX ap beaconing multiple ssid w/ same bssid */
1228 if (sp->ssid[1] != 0 &&
1229 (ISPROBE(subtype) || ni->ni_esslen == 0)) {
1230 ni->ni_esslen = sp->ssid[1];
1231 memset(ni->ni_essid, 0, sizeof(ni->ni_essid));
1232 memcpy(ni->ni_essid, sp->ssid + 2, sp->ssid[1]);
1233 }
1234 ni->ni_scangen = ic->ic_scan.nt_scangen;
1235 IEEE80211_ADDR_COPY(ni->ni_bssid, wh->i_addr3);
1236 ni->ni_rssi = rssi;
1237 ni->ni_rstamp = rstamp;
1238 memcpy(ni->ni_tstamp.data, sp->tstamp, sizeof(ni->ni_tstamp));
1239 ni->ni_intval = sp->bintval;
1240 ni->ni_capinfo = sp->capinfo;
1241 ni->ni_chan = &ic->ic_channels[sp->chan];
1242 ni->ni_fhdwell = sp->fhdwell;
1243 ni->ni_fhindex = sp->fhindex;
1244 ni->ni_erp = sp->erp;
1245 if (sp->tim != NULL) {
1246 struct ieee80211_tim_ie *ie =
1247 (struct ieee80211_tim_ie *) sp->tim;
1248
1249 ni->ni_dtim_count = ie->tim_count;
1250 ni->ni_dtim_period = ie->tim_period;
1251 }
1252 /*
1253 * Record the byte offset from the mac header to
1254 * the start of the TIM information element for
1255 * use by hardware and/or to speedup software
1256 * processing of beacon frames.
1257 */
1258 ni->ni_timoff = sp->timoff;
1259 /*
1260 * Record optional information elements that might be
1261 * used by applications or drivers.
1262 */
1263 saveie(&ni->ni_wme_ie, sp->wme);
1264 saveie(&ni->ni_wpa_ie, sp->wpa);
1265
1266 /* NB: must be after ni_chan is setup */
1267 ieee80211_setup_rates(ni, sp->rates, sp->xrates, IEEE80211_F_DOSORT);
1268
1269 if (!newnode)
1270 ieee80211_free_node(ni);
1271 #undef ISPROBE
1272 }
1273
1274 void
1275 ieee80211_init_neighbor(struct ieee80211_node *ni,
1276 const struct ieee80211_frame *wh,
1277 const struct ieee80211_scanparams *sp)
1278 {
1279
1280 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1281 "%s: %p<%s>\n", __func__, ni, ether_sprintf(ni->ni_macaddr));
1282 ni->ni_esslen = sp->ssid[1];
1283 memcpy(ni->ni_essid, sp->ssid + 2, sp->ssid[1]);
1284 IEEE80211_ADDR_COPY(ni->ni_bssid, wh->i_addr3);
1285 memcpy(ni->ni_tstamp.data, sp->tstamp, sizeof(ni->ni_tstamp));
1286 ni->ni_intval = sp->bintval;
1287 ni->ni_capinfo = sp->capinfo;
1288 ni->ni_chan = ni->ni_ic->ic_curchan;
1289 ni->ni_fhdwell = sp->fhdwell;
1290 ni->ni_fhindex = sp->fhindex;
1291 ni->ni_erp = sp->erp;
1292 ni->ni_timoff = sp->timoff;
1293 if (sp->wme != NULL)
1294 ieee80211_saveie(&ni->ni_wme_ie, sp->wme);
1295 if (sp->wpa != NULL)
1296 ieee80211_saveie(&ni->ni_wpa_ie, sp->wpa);
1297
1298 /* NB: must be after ni_chan is setup */
1299 ieee80211_setup_rates(ni, sp->rates, sp->xrates, IEEE80211_F_DOSORT);
1300 }
1301
1302 /*
1303 * Do node discovery in adhoc mode on receipt of a beacon
1304 * or probe response frame. Note that for the driver's
1305 * benefit we we treat this like an association so the
1306 * driver has an opportunity to setup it's private state.
1307 */
1308 struct ieee80211_node *
1309 ieee80211_add_neighbor(struct ieee80211com *ic,
1310 const struct ieee80211_frame *wh,
1311 const struct ieee80211_scanparams *sp)
1312 {
1313 struct ieee80211_node *ni;
1314
1315 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1316 "%s: mac<%s>\n", __func__, ether_sprintf(wh->i_addr2));
1317 ni = ieee80211_dup_bss(&ic->ic_sta, wh->i_addr2);/* XXX alloc_node? */
1318 if (ni != NULL) {
1319 ieee80211_init_neighbor(ni, wh, sp);
1320 if (ic->ic_newassoc != NULL)
1321 ic->ic_newassoc(ni, 1);
1322 /* XXX not right for 802.1x/WPA */
1323 ieee80211_node_authorize(ni);
1324 }
1325 return ni;
1326 }
1327
1328 #define IS_CTL(wh) \
1329 ((wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) == IEEE80211_FC0_TYPE_CTL)
1330 #define IS_PSPOLL(wh) \
1331 ((wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) == IEEE80211_FC0_SUBTYPE_PS_POLL)
1332 /*
1333 * Locate the node for sender, track state, and then pass the
1334 * (referenced) node up to the 802.11 layer for its use. We
1335 * are required to pass some node so we fall back to ic_bss
1336 * when this frame is from an unknown sender. The 802.11 layer
1337 * knows this means the sender wasn't in the node table and
1338 * acts accordingly.
1339 */
1340 struct ieee80211_node *
1341 #ifdef IEEE80211_DEBUG_REFCNT
1342 ieee80211_find_rxnode_debug(struct ieee80211com *ic,
1343 const struct ieee80211_frame_min *wh, const char *func, int line)
1344 #else
1345 ieee80211_find_rxnode(struct ieee80211com *ic,
1346 const struct ieee80211_frame_min *wh)
1347 #endif
1348 {
1349 struct ieee80211_node_table *nt;
1350 struct ieee80211_node *ni;
1351
1352 /* XXX may want scanned nodes in the neighbor table for adhoc */
1353 if (ic->ic_opmode == IEEE80211_M_STA ||
1354 ic->ic_opmode == IEEE80211_M_MONITOR ||
1355 (ic->ic_flags & IEEE80211_F_SCAN))
1356 nt = &ic->ic_scan;
1357 else
1358 nt = &ic->ic_sta;
1359 /* XXX check ic_bss first in station mode */
1360 /* XXX 4-address frames? */
1361 IEEE80211_NODE_LOCK(nt);
1362 if (IS_CTL(wh) && !IS_PSPOLL(wh) /*&& !IS_RTS(ah)*/)
1363 ni = _ieee80211_find_node(nt, wh->i_addr1);
1364 else
1365 ni = _ieee80211_find_node(nt, wh->i_addr2);
1366 if (ni == NULL)
1367 ni = ieee80211_ref_node(ic->ic_bss);
1368 IEEE80211_NODE_UNLOCK(nt);
1369
1370 return ni;
1371 }
1372
1373 /*
1374 * Like ieee80211_find_rxnode but use the supplied h/w
1375 * key index as a hint to locate the node in the key
1376 * mapping table. If an entry is present at the key
1377 * index we return it; otherwise do a normal lookup and
1378 * update the mapping table if the station has a unicast
1379 * key assigned to it.
1380 */
1381 struct ieee80211_node *
1382 #ifdef IEEE80211_DEBUG_REFCNT
1383 ieee80211_find_rxnode_withkey_debug(struct ieee80211com *ic,
1384 const struct ieee80211_frame_min *wh, ieee80211_keyix keyix,
1385 const char *func, int line)
1386 #else
1387 ieee80211_find_rxnode_withkey(struct ieee80211com *ic,
1388 const struct ieee80211_frame_min *wh, ieee80211_keyix keyix)
1389 #endif
1390 {
1391 struct ieee80211_node_table *nt;
1392 struct ieee80211_node *ni;
1393
1394 if (ic->ic_opmode == IEEE80211_M_STA ||
1395 ic->ic_opmode == IEEE80211_M_MONITOR ||
1396 (ic->ic_flags & IEEE80211_F_SCAN))
1397 nt = &ic->ic_scan;
1398 else
1399 nt = &ic->ic_sta;
1400 IEEE80211_NODE_LOCK(nt);
1401 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax)
1402 ni = nt->nt_keyixmap[keyix];
1403 else
1404 ni = NULL;
1405 if (ni == NULL) {
1406 if (IS_CTL(wh) && !IS_PSPOLL(wh) /*&& !IS_RTS(ah)*/)
1407 ni = _ieee80211_find_node(nt, wh->i_addr1);
1408 else
1409 ni = _ieee80211_find_node(nt, wh->i_addr2);
1410 if (ni == NULL)
1411 ni = ieee80211_ref_node(ic->ic_bss);
1412 if (nt->nt_keyixmap != NULL) {
1413 /*
1414 * If the station has a unicast key cache slot
1415 * assigned update the key->node mapping table.
1416 */
1417 keyix = ni->ni_ucastkey.wk_rxkeyix;
1418 /* XXX can keyixmap[keyix] != NULL? */
1419 if (keyix < nt->nt_keyixmax &&
1420 nt->nt_keyixmap[keyix] == NULL) {
1421 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1422 "%s: add key map entry %p<%s> refcnt %d\n",
1423 __func__, ni, ether_sprintf(ni->ni_macaddr),
1424 ieee80211_node_refcnt(ni)+1);
1425 nt->nt_keyixmap[keyix] = ieee80211_ref_node(ni);
1426 }
1427 }
1428 } else {
1429 ieee80211_ref_node(ni);
1430 }
1431 IEEE80211_NODE_UNLOCK(nt);
1432
1433 return ni;
1434 }
1435 #undef IS_PSPOLL
1436 #undef IS_CTL
1437
1438 /*
1439 * Return a reference to the appropriate node for sending
1440 * a data frame. This handles node discovery in adhoc networks.
1441 */
1442 struct ieee80211_node *
1443 #ifdef IEEE80211_DEBUG_REFCNT
1444 ieee80211_find_txnode_debug(struct ieee80211com *ic, const u_int8_t *macaddr,
1445 const char *func, int line)
1446 #else
1447 ieee80211_find_txnode(struct ieee80211com *ic, const u_int8_t *macaddr)
1448 #endif
1449 {
1450 struct ieee80211_node_table *nt = &ic->ic_sta;
1451 struct ieee80211_node *ni;
1452
1453 /*
1454 * The destination address should be in the node table
1455 * unless this is a multicast/broadcast frame. We can
1456 * also optimize station mode operation, all frames go
1457 * to the bss node.
1458 */
1459 /* XXX can't hold lock across dup_bss 'cuz of recursive locking */
1460 IEEE80211_NODE_LOCK(nt);
1461 if (ic->ic_opmode == IEEE80211_M_STA || IEEE80211_IS_MULTICAST(macaddr))
1462 ni = ieee80211_ref_node(ic->ic_bss);
1463 else {
1464 ni = _ieee80211_find_node(nt, macaddr);
1465 if (ic->ic_opmode == IEEE80211_M_HOSTAP &&
1466 (ni != NULL && ni->ni_associd == 0)) {
1467 /*
1468 * Station is not associated; don't permit the
1469 * data frame to be sent by returning NULL. This
1470 * is kinda a kludge but the least intrusive way
1471 * to add this check into all drivers.
1472 */
1473 ieee80211_unref_node(&ni); /* NB: null's ni */
1474 }
1475 }
1476 IEEE80211_NODE_UNLOCK(nt);
1477
1478 if (ni == NULL) {
1479 if (ic->ic_opmode == IEEE80211_M_IBSS ||
1480 ic->ic_opmode == IEEE80211_M_AHDEMO) {
1481 /*
1482 * In adhoc mode cons up a node for the destination.
1483 * Note that we need an additional reference for the
1484 * caller to be consistent with _ieee80211_find_node.
1485 */
1486 ni = ieee80211_fakeup_adhoc_node(nt, macaddr);
1487 if (ni != NULL)
1488 (void) ieee80211_ref_node(ni);
1489 } else {
1490 IEEE80211_DPRINTF(ic, IEEE80211_MSG_OUTPUT,
1491 "[%s] no node, discard frame (%s)\n",
1492 ether_sprintf(macaddr), __func__);
1493 ic->ic_stats.is_tx_nonode++;
1494 }
1495 }
1496 return ni;
1497 }
1498
1499 /*
1500 * Like find but search based on the channel too.
1501 */
1502 struct ieee80211_node *
1503 #ifdef IEEE80211_DEBUG_REFCNT
1504 ieee80211_find_node_with_channel_debug(struct ieee80211_node_table *nt,
1505 const u_int8_t *macaddr, struct ieee80211_channel *chan,
1506 const char *func, int line)
1507 #else
1508 ieee80211_find_node_with_channel(struct ieee80211_node_table *nt,
1509 const u_int8_t *macaddr, struct ieee80211_channel *chan)
1510 #endif
1511 {
1512 struct ieee80211_node *ni;
1513 int hash;
1514
1515 hash = IEEE80211_NODE_HASH(macaddr);
1516 IEEE80211_NODE_LOCK(nt);
1517 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1518 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr) &&
1519 ni->ni_chan == chan) {
1520 ieee80211_ref_node(ni); /* mark referenced */
1521 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE,
1522 REFCNT_LOC, ni, ether_sprintf(ni->ni_macaddr),
1523 ieee80211_node_refcnt(ni));
1524 break;
1525 }
1526 }
1527 IEEE80211_NODE_UNLOCK(nt);
1528 return ni;
1529 }
1530
1531 /*
1532 * Like find but search based on the ssid too.
1533 */
1534 struct ieee80211_node *
1535 #ifdef IEEE80211_DEBUG_REFCNT
1536 ieee80211_find_node_with_ssid_debug(struct ieee80211_node_table *nt,
1537 const u_int8_t *macaddr, u_int ssidlen, const u_int8_t *ssid,
1538 const char *func, int line)
1539 #else
1540 ieee80211_find_node_with_ssid(struct ieee80211_node_table *nt,
1541 const u_int8_t *macaddr, u_int ssidlen, const u_int8_t *ssid)
1542 #endif
1543 {
1544 #define MATCH_SSID(ni, ssid, ssidlen) \
1545 (ni->ni_esslen == ssidlen && memcmp(ni->ni_essid, ssid, ssidlen) == 0)
1546 static const u_int8_t zeromac[IEEE80211_ADDR_LEN];
1547 struct ieee80211com *ic = nt->nt_ic;
1548 struct ieee80211_node *ni;
1549 int hash;
1550
1551 IEEE80211_NODE_LOCK(nt);
1552 /*
1553 * A mac address that is all zero means match only the ssid;
1554 * otherwise we must match both.
1555 */
1556 if (IEEE80211_ADDR_EQ(macaddr, zeromac)) {
1557 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
1558 if (MATCH_SSID(ni, ssid, ssidlen))
1559 break;
1560 }
1561 } else {
1562 hash = IEEE80211_NODE_HASH(macaddr);
1563 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) {
1564 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr) &&
1565 MATCH_SSID(ni, ssid, ssidlen))
1566 break;
1567 }
1568 }
1569 if (ni != NULL) {
1570 ieee80211_ref_node(ni); /* mark referenced */
1571 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1572 REFCNT_LOC, ni, ether_sprintf(ni->ni_macaddr),
1573 ieee80211_node_refcnt(ni));
1574 }
1575 IEEE80211_NODE_UNLOCK(nt);
1576 return ni;
1577 #undef MATCH_SSID
1578 }
1579
1580 static void
1581 _ieee80211_free_node(struct ieee80211_node *ni)
1582 {
1583 struct ieee80211com *ic = ni->ni_ic;
1584 struct ieee80211_node_table *nt = ni->ni_table;
1585
1586 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1587 "%s %p<%s> in %s table\n", __func__, ni,
1588 ether_sprintf(ni->ni_macaddr),
1589 nt != NULL ? nt->nt_name : "<gone>");
1590
1591 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap);
1592 if (nt != NULL) {
1593 TAILQ_REMOVE(&nt->nt_node, ni, ni_list);
1594 LIST_REMOVE(ni, ni_hash);
1595 }
1596 ic->ic_node_free(ni);
1597 }
1598
1599 void
1600 #ifdef IEEE80211_DEBUG_REFCNT
1601 ieee80211_free_node_debug(struct ieee80211_node *ni, const char *func, int line)
1602 #else
1603 ieee80211_free_node(struct ieee80211_node *ni)
1604 #endif
1605 {
1606 struct ieee80211_node_table *nt = ni->ni_table;
1607
1608 #ifdef IEEE80211_DEBUG_REFCNT
1609 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1610 "%s (%s:%u) %p<%s> refcnt %d\n", __func__, func, line, ni,
1611 ether_sprintf(ni->ni_macaddr), ieee80211_node_refcnt(ni)-1);
1612 #endif
1613 if (nt != NULL) {
1614 IEEE80211_NODE_LOCK(nt);
1615 if (ieee80211_node_dectestref(ni)) {
1616 /*
1617 * Last reference, reclaim state.
1618 */
1619 _ieee80211_free_node(ni);
1620 } else if (ieee80211_node_refcnt(ni) == 1 &&
1621 nt->nt_keyixmap != NULL) {
1622 ieee80211_keyix keyix;
1623 /*
1624 * Check for a last reference in the key mapping table.
1625 */
1626 keyix = ni->ni_ucastkey.wk_rxkeyix;
1627 if (keyix < nt->nt_keyixmax &&
1628 nt->nt_keyixmap[keyix] == ni) {
1629 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1630 "%s: %p<%s> clear key map entry", __func__,
1631 ni, ether_sprintf(ni->ni_macaddr));
1632 nt->nt_keyixmap[keyix] = NULL;
1633 ieee80211_node_decref(ni); /* XXX needed? */
1634 _ieee80211_free_node(ni);
1635 }
1636 }
1637 IEEE80211_NODE_UNLOCK(nt);
1638 } else {
1639 if (ieee80211_node_dectestref(ni))
1640 _ieee80211_free_node(ni);
1641 }
1642 }
1643
1644 /*
1645 * Reclaim a unicast key and clear any key cache state.
1646 */
1647 int
1648 ieee80211_node_delucastkey(struct ieee80211_node *ni)
1649 {
1650 struct ieee80211com *ic = ni->ni_ic;
1651 struct ieee80211_node_table *nt = &ic->ic_sta;
1652 struct ieee80211_node *nikey;
1653 ieee80211_keyix keyix;
1654 int isowned, status;
1655
1656 /*
1657 * NB: We must beware of LOR here; deleting the key
1658 * can cause the crypto layer to block traffic updates
1659 * which can generate a LOR against the node table lock;
1660 * grab it here and stash the key index for our use below.
1661 *
1662 * Must also beware of recursion on the node table lock.
1663 * When called from node_cleanup we may already have
1664 * the node table lock held. Unfortunately there's no
1665 * way to separate out this path so we must do this
1666 * conditionally.
1667 */
1668 isowned = IEEE80211_NODE_IS_LOCKED(nt);
1669 if (!isowned)
1670 IEEE80211_NODE_LOCK(nt);
1671 keyix = ni->ni_ucastkey.wk_rxkeyix;
1672 status = ieee80211_crypto_delkey(ic, &ni->ni_ucastkey);
1673 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax) {
1674 nikey = nt->nt_keyixmap[keyix];
1675 nt->nt_keyixmap[keyix] = NULL;;
1676 } else
1677 nikey = NULL;
1678 if (!isowned)
1679 IEEE80211_NODE_UNLOCK(&ic->ic_sta);
1680
1681 if (nikey != NULL) {
1682 KASSERT(nikey == ni,
1683 ("key map out of sync, ni %p nikey %p", ni, nikey));
1684 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1685 "%s: delete key map entry %p<%s> refcnt %d\n",
1686 __func__, ni, ether_sprintf(ni->ni_macaddr),
1687 ieee80211_node_refcnt(ni)-1);
1688 ieee80211_free_node(ni);
1689 }
1690 return status;
1691 }
1692
1693 /*
1694 * Reclaim a node. If this is the last reference count then
1695 * do the normal free work. Otherwise remove it from the node
1696 * table and mark it gone by clearing the back-reference.
1697 */
1698 static void
1699 node_reclaim(struct ieee80211_node_table *nt, struct ieee80211_node *ni)
1700 {
1701 ieee80211_keyix keyix;
1702
1703 IEEE80211_NODE_LOCK_ASSERT(nt);
1704
1705 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1706 "%s: remove %p<%s> from %s table, refcnt %d\n",
1707 __func__, ni, ether_sprintf(ni->ni_macaddr),
1708 nt->nt_name, ieee80211_node_refcnt(ni)-1);
1709 /*
1710 * Clear any entry in the unicast key mapping table.
1711 * We need to do it here so rx lookups don't find it
1712 * in the mapping table even if it's not in the hash
1713 * table. We cannot depend on the mapping table entry
1714 * being cleared because the node may not be free'd.
1715 */
1716 keyix = ni->ni_ucastkey.wk_rxkeyix;
1717 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax &&
1718 nt->nt_keyixmap[keyix] == ni) {
1719 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE,
1720 "%s: %p<%s> clear key map entry\n",
1721 __func__, ni, ether_sprintf(ni->ni_macaddr));
1722 nt->nt_keyixmap[keyix] = NULL;
1723 ieee80211_node_decref(ni); /* NB: don't need free */
1724 }
1725 if (!ieee80211_node_dectestref(ni)) {
1726 /*
1727 * Other references are present, just remove the
1728 * node from the table so it cannot be found. When
1729 * the references are dropped storage will be
1730 * reclaimed.
1731 */
1732 TAILQ_REMOVE(&nt->nt_node, ni, ni_list);
1733 LIST_REMOVE(ni, ni_hash);
1734 ni->ni_table = NULL; /* clear reference */
1735 } else
1736 _ieee80211_free_node(ni);
1737 }
1738
1739 static void
1740 ieee80211_free_allnodes_locked(struct ieee80211_node_table *nt)
1741 {
1742 struct ieee80211com *ic = nt->nt_ic;
1743 struct ieee80211_node *ni;
1744
1745 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1746 "%s: free all nodes in %s table\n", __func__, nt->nt_name);
1747
1748 while ((ni = TAILQ_FIRST(&nt->nt_node)) != NULL) {
1749 if (ni->ni_associd != 0) {
1750 if (ic->ic_auth->ia_node_leave != NULL)
1751 ic->ic_auth->ia_node_leave(ic, ni);
1752 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap);
1753 }
1754 node_reclaim(nt, ni);
1755 }
1756 ieee80211_reset_erp(ic);
1757 }
1758
1759 static void
1760 ieee80211_free_allnodes(struct ieee80211_node_table *nt)
1761 {
1762
1763 IEEE80211_NODE_LOCK(nt);
1764 ieee80211_free_allnodes_locked(nt);
1765 IEEE80211_NODE_UNLOCK(nt);
1766 }
1767
1768 /*
1769 * Timeout entries in the scan cache.
1770 */
1771 static void
1772 ieee80211_timeout_scan_candidates(struct ieee80211_node_table *nt)
1773 {
1774 struct ieee80211com *ic = nt->nt_ic;
1775 struct ieee80211_node *ni, *tni;
1776
1777 IEEE80211_NODE_LOCK(nt);
1778 ni = ic->ic_bss;
1779 /* XXX belongs elsewhere */
1780 if (ni->ni_rxfrag[0] != NULL && ticks > ni->ni_rxfragstamp + hz) {
1781 m_freem(ni->ni_rxfrag[0]);
1782 ni->ni_rxfrag[0] = NULL;
1783 }
1784 TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, tni) {
1785 if (ni->ni_inact && --ni->ni_inact == 0) {
1786 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1787 "[%s] scan candidate purged from cache "
1788 "(refcnt %u)\n", ether_sprintf(ni->ni_macaddr),
1789 ieee80211_node_refcnt(ni));
1790 node_reclaim(nt, ni);
1791 }
1792 }
1793 IEEE80211_NODE_UNLOCK(nt);
1794
1795 nt->nt_inact_timer = IEEE80211_INACT_WAIT;
1796 }
1797
1798 /*
1799 * Timeout inactive stations and do related housekeeping.
1800 * Note that we cannot hold the node lock while sending a
1801 * frame as this would lead to a LOR. Instead we use a
1802 * generation number to mark nodes that we've scanned and
1803 * drop the lock and restart a scan if we have to time out
1804 * a node. Since we are single-threaded by virtue of
1805 * controlling the inactivity timer we can be sure this will
1806 * process each node only once.
1807 */
1808 static void
1809 ieee80211_timeout_stations(struct ieee80211_node_table *nt)
1810 {
1811 struct ieee80211com *ic = nt->nt_ic;
1812 struct ieee80211_node *ni;
1813 u_int gen;
1814 int isadhoc;
1815
1816 isadhoc = (ic->ic_opmode == IEEE80211_M_IBSS ||
1817 ic->ic_opmode == IEEE80211_M_AHDEMO);
1818 IEEE80211_SCAN_LOCK(nt);
1819 gen = ++nt->nt_scangen;
1820 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
1821 "%s: %s scangen %u\n", __func__, nt->nt_name, gen);
1822 restart:
1823 IEEE80211_NODE_LOCK(nt);
1824 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
1825 if (ni->ni_scangen == gen) /* previously handled */
1826 continue;
1827 ni->ni_scangen = gen;
1828 /*
1829 * Ignore entries for which have yet to receive an
1830 * authentication frame. These are transient and
1831 * will be reclaimed when the last reference to them
1832 * goes away (when frame xmits complete).
1833 */
1834 if (ic->ic_opmode == IEEE80211_M_HOSTAP &&
1835 (ni->ni_flags & IEEE80211_NODE_AREF) == 0)
1836 continue;
1837 /*
1838 * Free fragment if not needed anymore
1839 * (last fragment older than 1s).
1840 * XXX doesn't belong here
1841 */
1842 if (ni->ni_rxfrag[0] != NULL &&
1843 ticks > ni->ni_rxfragstamp + hz) {
1844 m_freem(ni->ni_rxfrag[0]);
1845 ni->ni_rxfrag[0] = NULL;
1846 }
1847 /*
1848 * Special case ourself; we may be idle for extended periods
1849 * of time and regardless reclaiming our state is wrong.
1850 */
1851 if (ni == ic->ic_bss)
1852 continue;
1853 ni->ni_inact--;
1854 if (ni->ni_associd != 0 || isadhoc) {
1855 /*
1856 * Age frames on the power save queue. The
1857 * aging interval is 4 times the listen
1858 * interval specified by the station. This
1859 * number is factored into the age calculations
1860 * when the frame is placed on the queue. We
1861 * store ages as time differences we can check
1862 * and/or adjust only the head of the list.
1863 */
1864 if (IEEE80211_NODE_SAVEQ_QLEN(ni) != 0) {
1865 struct mbuf *m;
1866 int discard = 0;
1867
1868 IEEE80211_NODE_SAVEQ_LOCK(ni);
1869 while (IF_POLL(&ni->ni_savedq, m) != NULL &&
1870 M_AGE_GET(m) < IEEE80211_INACT_WAIT) {
1871 IEEE80211_DPRINTF(ic, IEEE80211_MSG_POWER, "[%s] discard frame, age %u\n", ether_sprintf(ni->ni_macaddr), M_AGE_GET(m));/*XXX*/
1872 _IEEE80211_NODE_SAVEQ_DEQUEUE_HEAD(ni, m);
1873 m_freem(m);
1874 discard++;
1875 }
1876 if (m != NULL)
1877 M_AGE_SUB(m, IEEE80211_INACT_WAIT);
1878 IEEE80211_NODE_SAVEQ_UNLOCK(ni);
1879
1880 if (discard != 0) {
1881 IEEE80211_DPRINTF(ic,
1882 IEEE80211_MSG_POWER,
1883 "[%s] discard %u frames for age\n",
1884 ether_sprintf(ni->ni_macaddr),
1885 discard);
1886 IEEE80211_NODE_STAT_ADD(ni,
1887 ps_discard, discard);
1888 if (IEEE80211_NODE_SAVEQ_QLEN(ni) == 0)
1889 ic->ic_set_tim(ni, 0);
1890 }
1891 }
1892 /*
1893 * Probe the station before time it out. We
1894 * send a null data frame which may not be
1895 * universally supported by drivers (need it
1896 * for ps-poll support so it should be...).
1897 */
1898 if (0 < ni->ni_inact &&
1899 ni->ni_inact <= ic->ic_inact_probe) {
1900 IEEE80211_NOTE(ic,
1901 IEEE80211_MSG_INACT | IEEE80211_MSG_NODE,
1902 ni, "%s",
1903 "probe station due to inactivity");
1904 /*
1905 * Grab a reference before unlocking the table
1906 * so the node cannot be reclaimed before we
1907 * send the frame. ieee80211_send_nulldata
1908 * understands we've done this and reclaims the
1909 * ref for us as needed.
1910 */
1911 ieee80211_ref_node(ni);
1912 IEEE80211_NODE_UNLOCK(nt);
1913 ieee80211_send_nulldata(ni);
1914 /* XXX stat? */
1915 goto restart;
1916 }
1917 }
1918 if (ni->ni_inact <= 0) {
1919 IEEE80211_NOTE(ic,
1920 IEEE80211_MSG_INACT | IEEE80211_MSG_NODE, ni,
1921 "station timed out due to inactivity "
1922 "(refcnt %u)", ieee80211_node_refcnt(ni));
1923 /*
1924 * Send a deauthenticate frame and drop the station.
1925 * This is somewhat complicated due to reference counts
1926 * and locking. At this point a station will typically
1927 * have a reference count of 1. ieee80211_node_leave
1928 * will do a "free" of the node which will drop the
1929 * reference count. But in the meantime a reference
1930 * wil be held by the deauth frame. The actual reclaim
1931 * of the node will happen either after the tx is
1932 * completed or by ieee80211_node_leave.
1933 *
1934 * Separately we must drop the node lock before sending
1935 * in case the driver takes a lock, as this will result
1936 * in LOR between the node lock and the driver lock.
1937 */
1938 IEEE80211_NODE_UNLOCK(nt);
1939 if (ni->ni_associd != 0) {
1940 IEEE80211_SEND_MGMT(ic, ni,
1941 IEEE80211_FC0_SUBTYPE_DEAUTH,
1942 IEEE80211_REASON_AUTH_EXPIRE);
1943 }
1944 ieee80211_node_leave(ic, ni);
1945 ic->ic_stats.is_node_timeout++;
1946 goto restart;
1947 }
1948 }
1949 IEEE80211_NODE_UNLOCK(nt);
1950
1951 IEEE80211_SCAN_UNLOCK(nt);
1952
1953 nt->nt_inact_timer = IEEE80211_INACT_WAIT;
1954 }
1955
1956 void
1957 ieee80211_iterate_nodes(struct ieee80211_node_table *nt, ieee80211_iter_func *f, void *arg)
1958 {
1959 struct ieee80211_node *ni;
1960 u_int gen;
1961
1962 IEEE80211_SCAN_LOCK(nt);
1963 gen = ++nt->nt_scangen;
1964 restart:
1965 IEEE80211_NODE_LOCK(nt);
1966 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
1967 if (ni->ni_scangen != gen) {
1968 ni->ni_scangen = gen;
1969 (void) ieee80211_ref_node(ni);
1970 IEEE80211_NODE_UNLOCK(nt);
1971 (*f)(arg, ni);
1972 ieee80211_free_node(ni);
1973 goto restart;
1974 }
1975 }
1976 IEEE80211_NODE_UNLOCK(nt);
1977
1978 IEEE80211_SCAN_UNLOCK(nt);
1979 }
1980
1981 void
1982 ieee80211_dump_node(struct ieee80211_node_table *nt, struct ieee80211_node *ni)
1983 {
1984 printf("0x%p: mac %s refcnt %d\n", ni,
1985 ether_sprintf(ni->ni_macaddr), ieee80211_node_refcnt(ni));
1986 printf("\tscangen %u authmode %u flags 0x%x\n",
1987 ni->ni_scangen, ni->ni_authmode, ni->ni_flags);
1988 printf("\tassocid 0x%x txpower %u vlan %u\n",
1989 ni->ni_associd, ni->ni_txpower, ni->ni_vlan);
1990 printf("\ttxseq %u rxseq %u fragno %u rxfragstamp %u\n",
1991 ni->ni_txseqs[0],
1992 ni->ni_rxseqs[0] >> IEEE80211_SEQ_SEQ_SHIFT,
1993 ni->ni_rxseqs[0] & IEEE80211_SEQ_FRAG_MASK,
1994 ni->ni_rxfragstamp);
1995 printf("\trstamp %u rssi %u intval %u capinfo 0x%x\n",
1996 ni->ni_rstamp, ni->ni_rssi, ni->ni_intval, ni->ni_capinfo);
1997 printf("\tbssid %s essid \"%.*s\" channel %u:0x%x\n",
1998 ether_sprintf(ni->ni_bssid),
1999 ni->ni_esslen, ni->ni_essid,
2000 ni->ni_chan->ic_freq, ni->ni_chan->ic_flags);
2001 printf("\tfails %u inact %u txrate %u\n",
2002 ni->ni_fails, ni->ni_inact, ni->ni_txrate);
2003 }
2004
2005 void
2006 ieee80211_dump_nodes(struct ieee80211_node_table *nt)
2007 {
2008 ieee80211_iterate_nodes(nt,
2009 (ieee80211_iter_func *) ieee80211_dump_node, nt);
2010 }
2011
2012 /*
2013 * Handle a station joining an 11g network.
2014 */
2015 static void
2016 ieee80211_node_join_11g(struct ieee80211com *ic, struct ieee80211_node *ni)
2017 {
2018
2019 /*
2020 * Station isn't capable of short slot time. Bump
2021 * the count of long slot time stations and disable
2022 * use of short slot time. Note that the actual switch
2023 * over to long slot time use may not occur until the
2024 * next beacon transmission (per sec. 7.3.1.4 of 11g).
2025 */
2026 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_SLOTTIME) == 0) {
2027 ic->ic_longslotsta++;
2028 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2029 "[%s] station needs long slot time, count %d\n",
2030 ether_sprintf(ni->ni_macaddr), ic->ic_longslotsta);
2031 /* XXX vap's w/ conflicting needs won't work */
2032 ieee80211_set_shortslottime(ic, 0);
2033 }
2034 /*
2035 * If the new station is not an ERP station
2036 * then bump the counter and enable protection
2037 * if configured.
2038 */
2039 if (!ieee80211_iserp_rateset(ic, &ni->ni_rates)) {
2040 ic->ic_nonerpsta++;
2041 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2042 "[%s] station is !ERP, %d non-ERP stations associated\n",
2043 ether_sprintf(ni->ni_macaddr), ic->ic_nonerpsta);
2044 /*
2045 * If protection is configured, enable it.
2046 */
2047 if (ic->ic_protmode != IEEE80211_PROT_NONE) {
2048 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2049 "%s: enable use of protection\n", __func__);
2050 ic->ic_flags |= IEEE80211_F_USEPROT;
2051 }
2052 /*
2053 * If station does not support short preamble
2054 * then we must enable use of Barker preamble.
2055 */
2056 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_PREAMBLE) == 0) {
2057 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2058 "[%s] station needs long preamble\n",
2059 ether_sprintf(ni->ni_macaddr));
2060 ic->ic_flags |= IEEE80211_F_USEBARKER;
2061 ic->ic_flags &= ~IEEE80211_F_SHPREAMBLE;
2062 }
2063 if (ic->ic_nonerpsta == 1)
2064 ic->ic_flags_ext |= IEEE80211_FEXT_ERPUPDATE;
2065 } else
2066 ni->ni_flags |= IEEE80211_NODE_ERP;
2067 }
2068
2069 void
2070 ieee80211_node_join(struct ieee80211com *ic, struct ieee80211_node *ni, int resp)
2071 {
2072 int newassoc;
2073
2074 if (ni->ni_associd == 0) {
2075 u_int16_t aid;
2076
2077 /*
2078 * It would be good to search the bitmap
2079 * more efficiently, but this will do for now.
2080 */
2081 for (aid = 1; aid < ic->ic_max_aid; aid++) {
2082 if (!IEEE80211_AID_ISSET(aid,
2083 ic->ic_aid_bitmap))
2084 break;
2085 }
2086 if (aid >= ic->ic_max_aid) {
2087 IEEE80211_SEND_MGMT(ic, ni, resp,
2088 IEEE80211_REASON_ASSOC_TOOMANY);
2089 ieee80211_node_leave(ic, ni);
2090 return;
2091 }
2092 ni->ni_associd = aid | 0xc000;
2093 IEEE80211_AID_SET(ni->ni_associd, ic->ic_aid_bitmap);
2094 ic->ic_sta_assoc++;
2095 newassoc = 1;
2096 if (ic->ic_curmode == IEEE80211_MODE_11G)
2097 ieee80211_node_join_11g(ic, ni);
2098 } else
2099 newassoc = 0;
2100
2101 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC | IEEE80211_MSG_DEBUG,
2102 "[%s] station %sassociated at aid %d: %s preamble, %s slot time%s%s\n",
2103 ether_sprintf(ni->ni_macaddr), newassoc ? "" : "re",
2104 IEEE80211_NODE_AID(ni),
2105 ic->ic_flags & IEEE80211_F_SHPREAMBLE ? "short" : "long",
2106 ic->ic_flags & IEEE80211_F_SHSLOT ? "short" : "long",
2107 ic->ic_flags & IEEE80211_F_USEPROT ? ", protection" : "",
2108 ni->ni_flags & IEEE80211_NODE_QOS ? ", QoS" : ""
2109 );
2110
2111 /* give driver a chance to setup state like ni_txrate */
2112 if (ic->ic_newassoc != NULL)
2113 ic->ic_newassoc(ni, newassoc);
2114 ni->ni_inact_reload = ic->ic_inact_auth;
2115 ni->ni_inact = ni->ni_inact_reload;
2116 IEEE80211_SEND_MGMT(ic, ni, resp, IEEE80211_STATUS_SUCCESS);
2117 /* tell the authenticator about new station */
2118 if (ic->ic_auth->ia_node_join != NULL)
2119 ic->ic_auth->ia_node_join(ic, ni);
2120 ieee80211_notify_node_join(ic, ni, newassoc);
2121 }
2122
2123 /*
2124 * Handle a station leaving an 11g network.
2125 */
2126 static void
2127 ieee80211_node_leave_11g(struct ieee80211com *ic, struct ieee80211_node *ni)
2128 {
2129
2130 KASSERT(ic->ic_curmode == IEEE80211_MODE_11G,
2131 ("not in 11g, bss %u:0x%x, curmode %u", ni->ni_chan->ic_freq,
2132 ni->ni_chan->ic_flags, ic->ic_curmode));
2133
2134 /*
2135 * If a long slot station do the slot time bookkeeping.
2136 */
2137 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_SLOTTIME) == 0) {
2138 KASSERT(ic->ic_longslotsta > 0,
2139 ("bogus long slot station count %d", ic->ic_longslotsta));
2140 ic->ic_longslotsta--;
2141 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2142 "[%s] long slot time station leaves, count now %d\n",
2143 ether_sprintf(ni->ni_macaddr), ic->ic_longslotsta);
2144 if (ic->ic_longslotsta == 0) {
2145 /*
2146 * Re-enable use of short slot time if supported
2147 * and not operating in IBSS mode (per spec).
2148 */
2149 if ((ic->ic_caps & IEEE80211_C_SHSLOT) &&
2150 ic->ic_opmode != IEEE80211_M_IBSS) {
2151 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2152 "%s: re-enable use of short slot time\n",
2153 __func__);
2154 ieee80211_set_shortslottime(ic, 1);
2155 }
2156 }
2157 }
2158 /*
2159 * If a non-ERP station do the protection-related bookkeeping.
2160 */
2161 if ((ni->ni_flags & IEEE80211_NODE_ERP) == 0) {
2162 KASSERT(ic->ic_nonerpsta > 0,
2163 ("bogus non-ERP station count %d", ic->ic_nonerpsta));
2164 ic->ic_nonerpsta--;
2165 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2166 "[%s] non-ERP station leaves, count now %d\n",
2167 ether_sprintf(ni->ni_macaddr), ic->ic_nonerpsta);
2168 if (ic->ic_nonerpsta == 0) {
2169 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2170 "%s: disable use of protection\n", __func__);
2171 ic->ic_flags &= ~IEEE80211_F_USEPROT;
2172 /* XXX verify mode? */
2173 if (ic->ic_caps & IEEE80211_C_SHPREAMBLE) {
2174 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC,
2175 "%s: re-enable use of short preamble\n",
2176 __func__);
2177 ic->ic_flags |= IEEE80211_F_SHPREAMBLE;
2178 ic->ic_flags &= ~IEEE80211_F_USEBARKER;
2179 }
2180 ic->ic_flags_ext |= IEEE80211_FEXT_ERPUPDATE;
2181 }
2182 }
2183 }
2184
2185 /*
2186 * Handle bookkeeping for station deauthentication/disassociation
2187 * when operating as an ap.
2188 */
2189 void
2190 ieee80211_node_leave(struct ieee80211com *ic, struct ieee80211_node *ni)
2191 {
2192 struct ieee80211_node_table *nt = ni->ni_table;
2193
2194 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC | IEEE80211_MSG_DEBUG,
2195 "[%s] station with aid %d leaves\n",
2196 ether_sprintf(ni->ni_macaddr), IEEE80211_NODE_AID(ni));
2197
2198 KASSERT(ic->ic_opmode == IEEE80211_M_HOSTAP ||
2199 ic->ic_opmode == IEEE80211_M_IBSS ||
2200 ic->ic_opmode == IEEE80211_M_AHDEMO,
2201 ("unexpected operating mode %u", ic->ic_opmode));
2202 /*
2203 * If node wasn't previously associated all
2204 * we need to do is reclaim the reference.
2205 */
2206 /* XXX ibss mode bypasses 11g and notification */
2207 if (ni->ni_associd == 0)
2208 goto done;
2209 /*
2210 * Tell the authenticator the station is leaving.
2211 * Note that we must do this before yanking the
2212 * association id as the authenticator uses the
2213 * associd to locate it's state block.
2214 */
2215 if (ic->ic_auth->ia_node_leave != NULL)
2216 ic->ic_auth->ia_node_leave(ic, ni);
2217 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap);
2218 ni->ni_associd = 0;
2219 ic->ic_sta_assoc--;
2220
2221 if (ic->ic_curmode == IEEE80211_MODE_11G)
2222 ieee80211_node_leave_11g(ic, ni);
2223 /*
2224 * Cleanup station state. In particular clear various
2225 * state that might otherwise be reused if the node
2226 * is reused before the reference count goes to zero
2227 * (and memory is reclaimed).
2228 */
2229 ieee80211_sta_leave(ic, ni);
2230 done:
2231 /*
2232 * Remove the node from any table it's recorded in and
2233 * drop the caller's reference. Removal from the table
2234 * is important to insure the node is not reprocessed
2235 * for inactivity.
2236 */
2237 if (nt != NULL) {
2238 IEEE80211_NODE_LOCK(nt);
2239 node_reclaim(nt, ni);
2240 IEEE80211_NODE_UNLOCK(nt);
2241 } else
2242 ieee80211_free_node(ni);
2243 }
2244
2245 u_int8_t
2246 ieee80211_getrssi(struct ieee80211com *ic)
2247 {
2248 #define NZ(x) ((x) == 0 ? 1 : (x))
2249 struct ieee80211_node_table *nt = &ic->ic_sta;
2250 u_int32_t rssi_samples, rssi_total;
2251 struct ieee80211_node *ni;
2252
2253 rssi_total = 0;
2254 rssi_samples = 0;
2255 switch (ic->ic_opmode) {
2256 case IEEE80211_M_IBSS: /* average of all ibss neighbors */
2257 /* XXX locking */
2258 TAILQ_FOREACH(ni, &nt->nt_node, ni_list)
2259 if (ni->ni_capinfo & IEEE80211_CAPINFO_IBSS) {
2260 rssi_samples++;
2261 rssi_total += ic->ic_node_getrssi(ni);
2262 }
2263 break;
2264 case IEEE80211_M_AHDEMO: /* average of all neighbors */
2265 /* XXX locking */
2266 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) {
2267 rssi_samples++;
2268 rssi_total += ic->ic_node_getrssi(ni);
2269 }
2270 break;
2271 case IEEE80211_M_HOSTAP: /* average of all associated stations */
2272 /* XXX locking */
2273 TAILQ_FOREACH(ni, &nt->nt_node, ni_list)
2274 if (IEEE80211_AID(ni->ni_associd) != 0) {
2275 rssi_samples++;
2276 rssi_total += ic->ic_node_getrssi(ni);
2277 }
2278 break;
2279 case IEEE80211_M_MONITOR: /* XXX */
2280 case IEEE80211_M_STA: /* use stats from associated ap */
2281 default:
2282 if (ic->ic_bss != NULL)
2283 rssi_total = ic->ic_node_getrssi(ic->ic_bss);
2284 rssi_samples = 1;
2285 break;
2286 }
2287 return rssi_total / NZ(rssi_samples);
2288 #undef NZ
2289 }
2290
2291 /*
2292 * Indicate whether there are frames queued for a station in power-save mode.
2293 */
2294 static void
2295 ieee80211_set_tim(struct ieee80211_node *ni, int set)
2296 {
2297 struct ieee80211com *ic = ni->ni_ic;
2298 u_int16_t aid;
2299
2300 KASSERT(ic->ic_opmode == IEEE80211_M_HOSTAP ||
2301 ic->ic_opmode == IEEE80211_M_IBSS,
2302 ("operating mode %u", ic->ic_opmode));
2303
2304 aid = IEEE80211_AID(ni->ni_associd);
2305 KASSERT(aid < ic->ic_max_aid,
2306 ("bogus aid %u, max %u", aid, ic->ic_max_aid));
2307
2308 IEEE80211_BEACON_LOCK(ic);
2309 if (set != (isset(ic->ic_tim_bitmap, aid) != 0)) {
2310 if (set) {
2311 setbit(ic->ic_tim_bitmap, aid);
2312 ic->ic_ps_pending++;
2313 } else {
2314 clrbit(ic->ic_tim_bitmap, aid);
2315 ic->ic_ps_pending--;
2316 }
2317 ic->ic_flags |= IEEE80211_F_TIMUPDATE;
2318 }
2319 IEEE80211_BEACON_UNLOCK(ic);
2320 }
2321
2322 /*
2323 * Node table support.
2324 */
2325
2326 static void
2327 ieee80211_node_table_init(struct ieee80211com *ic,
2328 struct ieee80211_node_table *nt,
2329 const char *name, int inact, int keyixmax,
2330 void (*timeout)(struct ieee80211_node_table *))
2331 {
2332
2333 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE,
2334 "%s %s table, inact %u\n", __func__, name, inact);
2335
2336 nt->nt_ic = ic;
2337 /* XXX need unit */
2338 IEEE80211_NODE_LOCK_INIT(nt, ic->ic_ifp->if_xname);
2339 IEEE80211_SCAN_LOCK_INIT(nt, ic->ic_ifp->if_xname);
2340 TAILQ_INIT(&nt->nt_node);
2341 nt->nt_name = name;
2342 nt->nt_scangen = 1;
2343 nt->nt_inact_init = inact;
2344 nt->nt_timeout = timeout;
2345 nt->nt_keyixmax = keyixmax;
2346 if (nt->nt_keyixmax > 0) {
2347 MALLOC(nt->nt_keyixmap, struct ieee80211_node **,
2348 keyixmax * sizeof(struct ieee80211_node *),
2349 M_80211_NODE, M_NOWAIT | M_ZERO);
2350 if (nt->nt_keyixmap == NULL)
2351 if_printf(ic->ic_ifp,
2352 "Cannot allocate key index map with %u entries\n",
2353 keyixmax);
2354 } else
2355 nt->nt_keyixmap = NULL;
2356 }
2357
2358 void
2359 ieee80211_node_table_reset(struct ieee80211_node_table *nt)
2360 {
2361
2362 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE,
2363 "%s %s table\n", __func__, nt->nt_name);
2364
2365 IEEE80211_NODE_LOCK(nt);
2366 nt->nt_inact_timer = 0;
2367 ieee80211_free_allnodes_locked(nt);
2368 IEEE80211_NODE_UNLOCK(nt);
2369 }
2370
2371 static void
2372 ieee80211_node_table_cleanup(struct ieee80211_node_table *nt)
2373 {
2374
2375 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE,
2376 "%s %s table\n", __func__, nt->nt_name);
2377
2378 IEEE80211_NODE_LOCK(nt);
2379 ieee80211_free_allnodes_locked(nt);
2380 if (nt->nt_keyixmap != NULL) {
2381 /* XXX verify all entries are NULL */
2382 int i;
2383 for (i = 0; i < nt->nt_keyixmax; i++)
2384 if (nt->nt_keyixmap[i] != NULL)
2385 printf("%s: %s[%u] still active\n", __func__,
2386 nt->nt_name, i);
2387 FREE(nt->nt_keyixmap, M_80211_NODE);
2388 nt->nt_keyixmap = NULL;
2389 }
2390 IEEE80211_SCAN_LOCK_DESTROY(nt);
2391 IEEE80211_NODE_LOCK_DESTROY(nt);
2392 }
Cache object: ea65e6d04fde44c82589884c6362d325
|