ieee80211_node.c revision 165887
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: head/sys/net80211/ieee80211_node.c 165887 2007-01-08 17:24:51Z 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 68static struct ieee80211_node *node_alloc(struct ieee80211_node_table *); 69static void node_cleanup(struct ieee80211_node *); 70static void node_free(struct ieee80211_node *); 71static u_int8_t node_getrssi(const struct ieee80211_node *); 72 73static void ieee80211_setup_node(struct ieee80211_node_table *, 74 struct ieee80211_node *, const u_int8_t *); 75static void _ieee80211_free_node(struct ieee80211_node *); 76static void ieee80211_free_allnodes(struct ieee80211_node_table *); 77 78static void ieee80211_timeout_scan_candidates(struct ieee80211_node_table *); 79static void ieee80211_timeout_stations(struct ieee80211_node_table *); 80 81static void ieee80211_set_tim(struct ieee80211_node *, int set); 82 83static 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 *)); 87static void ieee80211_node_table_cleanup(struct ieee80211_node_table *nt); 88 89MALLOC_DEFINE(M_80211_NODE, "80211node", "802.11 node state"); 90 91void 92ieee80211_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 111void 112ieee80211_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 183void 184ieee80211_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 207void 208ieee80211_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 216void 217ieee80211_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 */ 226static void 227ieee80211_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 = *ieee80211_get_suprates(ic, chan); 234} 235 236/* 237 * AP scanning support. 238 */ 239 240#ifdef IEEE80211_DEBUG 241static void 242dump_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 */ 260static void 261ieee80211_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 */ 285void 286ieee80211_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 */ 319int 320ieee80211_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 = *ieee80211_get_suprates(ic, chan); 348 ieee80211_new_state(ic, IEEE80211_S_SCAN, -1); 349 return 1; 350 } 351 } while (chan != ic->ic_curchan); 352 ieee80211_end_scan(ic); 353 return 0; 354} 355 356/* 357 * Probe the curent channel, if allowed, while scanning. 358 * If the channel is not marked passive-only then send 359 * a probe request immediately. Otherwise mark state and 360 * listen for beacons on the channel; if we receive something 361 * then we'll transmit a probe request. 362 */ 363void 364ieee80211_probe_curchan(struct ieee80211com *ic, int force) 365{ 366 struct ifnet *ifp = ic->ic_ifp; 367 368 if ((ic->ic_curchan->ic_flags & IEEE80211_CHAN_PASSIVE) == 0 || force) { 369 /* 370 * XXX send both broadcast+directed probe request 371 */ 372 ieee80211_send_probereq(ic->ic_bss, 373 ic->ic_myaddr, ifp->if_broadcastaddr, 374 ifp->if_broadcastaddr, 375 ic->ic_des_essid, ic->ic_des_esslen, 376 ic->ic_opt_ie, ic->ic_opt_ie_len); 377 } else 378 ic->ic_flags_ext |= IEEE80211_FEXT_PROBECHAN; 379} 380 381static __inline void 382copy_bss(struct ieee80211_node *nbss, const struct ieee80211_node *obss) 383{ 384 /* propagate useful state */ 385 nbss->ni_authmode = obss->ni_authmode; 386 nbss->ni_txpower = obss->ni_txpower; 387 nbss->ni_vlan = obss->ni_vlan; 388 nbss->ni_rsn = obss->ni_rsn; 389 /* XXX statistics? */ 390} 391 392void 393ieee80211_create_ibss(struct ieee80211com* ic, struct ieee80211_channel *chan) 394{ 395 struct ieee80211_node_table *nt; 396 struct ieee80211_node *ni; 397 398 IEEE80211_DPRINTF(ic, IEEE80211_MSG_SCAN, 399 "%s: creating ibss\n", __func__); 400 401 /* 402 * Create the station/neighbor table. Note that for adhoc 403 * mode we make the initial inactivity timer longer since 404 * we create nodes only through discovery and they typically 405 * are long-lived associations. 406 */ 407 nt = &ic->ic_sta; 408 IEEE80211_NODE_LOCK(nt); 409 if (ic->ic_opmode == IEEE80211_M_HOSTAP) { 410 nt->nt_name = "station"; 411 nt->nt_inact_init = ic->ic_inact_init; 412 } else { 413 nt->nt_name = "neighbor"; 414 nt->nt_inact_init = ic->ic_inact_run; 415 } 416 IEEE80211_NODE_UNLOCK(nt); 417 418 ni = ieee80211_alloc_node(&ic->ic_sta, ic->ic_myaddr); 419 if (ni == NULL) { 420 /* XXX recovery? */ 421 return; 422 } 423 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_myaddr); 424 ni->ni_esslen = ic->ic_des_esslen; 425 memcpy(ni->ni_essid, ic->ic_des_essid, ni->ni_esslen); 426 copy_bss(ni, ic->ic_bss); 427 ni->ni_intval = ic->ic_bintval; 428 if (ic->ic_flags & IEEE80211_F_PRIVACY) 429 ni->ni_capinfo |= IEEE80211_CAPINFO_PRIVACY; 430 if (ic->ic_phytype == IEEE80211_T_FH) { 431 ni->ni_fhdwell = 200; /* XXX */ 432 ni->ni_fhindex = 1; 433 } 434 if (ic->ic_opmode == IEEE80211_M_IBSS) { 435 ic->ic_flags |= IEEE80211_F_SIBSS; 436 ni->ni_capinfo |= IEEE80211_CAPINFO_IBSS; /* XXX */ 437 if (ic->ic_flags & IEEE80211_F_DESBSSID) 438 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_des_bssid); 439 else 440 ni->ni_bssid[0] |= 0x02; /* local bit for IBSS */ 441 } else if (ic->ic_opmode == IEEE80211_M_AHDEMO) { 442 if (ic->ic_flags & IEEE80211_F_DESBSSID) 443 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_des_bssid); 444 else 445 memset(ni->ni_bssid, 0, IEEE80211_ADDR_LEN); 446 } 447 /* 448 * Fix the channel and related attributes. 449 */ 450 ieee80211_set_chan(ic, ni, chan); 451 ic->ic_curchan = chan; 452 ic->ic_curmode = ieee80211_chan2mode(ic, chan); 453 /* 454 * Do mode-specific rate setup. 455 */ 456 if (ic->ic_curmode == IEEE80211_MODE_11G) { 457 /* 458 * Use a mixed 11b/11g rate set. 459 */ 460 ieee80211_set11gbasicrates(&ni->ni_rates, IEEE80211_MODE_11G); 461 } else if (ic->ic_curmode == IEEE80211_MODE_11B) { 462 /* 463 * Force pure 11b rate set. 464 */ 465 ieee80211_set11gbasicrates(&ni->ni_rates, IEEE80211_MODE_11B); 466 } 467 468 (void) ieee80211_sta_join(ic, ieee80211_ref_node(ni)); 469} 470 471void 472ieee80211_reset_bss(struct ieee80211com *ic) 473{ 474 struct ieee80211_node *ni, *obss; 475 476 ieee80211_node_table_reset(&ic->ic_scan); 477 ieee80211_node_table_reset(&ic->ic_sta); 478 479 ni = ieee80211_alloc_node(&ic->ic_scan, ic->ic_myaddr); 480 KASSERT(ni != NULL, ("unable to setup inital BSS node")); 481 obss = ic->ic_bss; 482 ic->ic_bss = ieee80211_ref_node(ni); 483 if (obss != NULL) { 484 copy_bss(ni, obss); 485 ni->ni_intval = ic->ic_bintval; 486 ieee80211_free_node(obss); 487 } 488} 489 490/* XXX tunable */ 491#define STA_FAILS_MAX 2 /* assoc failures before ignored */ 492 493static int 494ieee80211_match_bss(struct ieee80211com *ic, struct ieee80211_node *ni) 495{ 496 u_int8_t rate; 497 int fail; 498 499 fail = 0; 500 if (isclr(ic->ic_chan_active, ieee80211_chan2ieee(ic, ni->ni_chan))) 501 fail |= 0x01; 502 if (ic->ic_des_chan != IEEE80211_CHAN_ANYC && 503 ni->ni_chan != ic->ic_des_chan) 504 fail |= 0x01; 505 if (ic->ic_opmode == IEEE80211_M_IBSS) { 506 if ((ni->ni_capinfo & IEEE80211_CAPINFO_IBSS) == 0) 507 fail |= 0x02; 508 } else { 509 if ((ni->ni_capinfo & IEEE80211_CAPINFO_ESS) == 0) 510 fail |= 0x02; 511 } 512 if (ic->ic_flags & IEEE80211_F_PRIVACY) { 513 if ((ni->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) == 0) 514 fail |= 0x04; 515 } else { 516 /* XXX does this mean privacy is supported or required? */ 517 if (ni->ni_capinfo & IEEE80211_CAPINFO_PRIVACY) 518 fail |= 0x04; 519 } 520 rate = ieee80211_fix_rate(ni, 521 IEEE80211_F_JOIN | 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 561static __inline u_int8_t 562maxrate(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 */ 576static int 577ieee80211_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 */ 622void 623ieee80211_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 */ 637void 638ieee80211_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 */ 769int 770ieee80211_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 */ 799int 800ieee80211_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 * Fillin the neighbor table; it will already 808 * exist if we are simply switching mastership. 809 * XXX ic_sta always setup so this is unnecessary? 810 */ 811 nt = &ic->ic_sta; 812 IEEE80211_NODE_LOCK(nt); 813 nt->nt_name = "neighbor"; 814 nt->nt_inact_init = ic->ic_inact_run; 815 IEEE80211_NODE_UNLOCK(nt); 816 } 817 818 /* 819 * Committed to selbs, setup state. 820 */ 821 obss = ic->ic_bss; 822 ic->ic_bss = selbs; /* NB: caller assumed to bump refcnt */ 823 if (obss != NULL) { 824 copy_bss(selbs, obss); 825 ieee80211_free_node(obss); 826 } 827 828 /* 829 * Delete unusable rates; we've already checked 830 * that the negotiated rate set is acceptable. 831 */ 832 ieee80211_fix_rate(ic->ic_bss, IEEE80211_F_DODEL | IEEE80211_F_JOIN); 833 834 /* 835 * Set the erp state (mostly the slot time) to deal with 836 * the auto-select case; this should be redundant if the 837 * mode is locked. 838 */ 839 ic->ic_curmode = ieee80211_chan2mode(ic, selbs->ni_chan); 840 ic->ic_curchan = selbs->ni_chan; 841 ieee80211_reset_erp(ic); 842 ieee80211_wme_initparams(ic); 843 844 if (ic->ic_opmode == IEEE80211_M_STA) 845 ieee80211_new_state(ic, IEEE80211_S_AUTH, -1); 846 else 847 ieee80211_new_state(ic, IEEE80211_S_RUN, -1); 848 return 1; 849} 850 851/* 852 * Leave the specified IBSS/BSS network. The node is assumed to 853 * be passed in with a held reference. 854 */ 855void 856ieee80211_sta_leave(struct ieee80211com *ic, struct ieee80211_node *ni) 857{ 858 ic->ic_node_cleanup(ni); 859 ieee80211_notify_node_leave(ic, ni); 860} 861 862static struct ieee80211_node * 863node_alloc(struct ieee80211_node_table *nt) 864{ 865 struct ieee80211_node *ni; 866 867 MALLOC(ni, struct ieee80211_node *, sizeof(struct ieee80211_node), 868 M_80211_NODE, M_NOWAIT | M_ZERO); 869 return ni; 870} 871 872/* 873 * Reclaim any resources in a node and reset any critical 874 * state. Typically nodes are free'd immediately after, 875 * but in some cases the storage may be reused so we need 876 * to insure consistent state (should probably fix that). 877 */ 878static void 879node_cleanup(struct ieee80211_node *ni) 880{ 881#define N(a) (sizeof(a)/sizeof(a[0])) 882 struct ieee80211com *ic = ni->ni_ic; 883 int i, qlen; 884 885 /* NB: preserve ni_table */ 886 if (ni->ni_flags & IEEE80211_NODE_PWR_MGT) { 887 ic->ic_ps_sta--; 888 ni->ni_flags &= ~IEEE80211_NODE_PWR_MGT; 889 IEEE80211_DPRINTF(ic, IEEE80211_MSG_POWER, 890 "[%s] power save mode off, %u sta's in ps mode\n", 891 ether_sprintf(ni->ni_macaddr), ic->ic_ps_sta); 892 } 893 /* 894 * Clear AREF flag that marks the authorization refcnt bump 895 * has happened. This is probably not needed as the node 896 * should always be removed from the table so not found but 897 * do it just in case. 898 */ 899 ni->ni_flags &= ~IEEE80211_NODE_AREF; 900 901 /* 902 * Drain power save queue and, if needed, clear TIM. 903 */ 904 IEEE80211_NODE_SAVEQ_DRAIN(ni, qlen); 905 if (qlen != 0 && ic->ic_set_tim != NULL) 906 ic->ic_set_tim(ni, 0); 907 908 ni->ni_associd = 0; 909 if (ni->ni_challenge != NULL) { 910 FREE(ni->ni_challenge, M_DEVBUF); 911 ni->ni_challenge = NULL; 912 } 913 /* 914 * Preserve SSID, WPA, and WME ie's so the bss node is 915 * reusable during a re-auth/re-assoc state transition. 916 * If we remove these data they will not be recreated 917 * because they come from a probe-response or beacon frame 918 * which cannot be expected prior to the association-response. 919 * This should not be an issue when operating in other modes 920 * as stations leaving always go through a full state transition 921 * which will rebuild this state. 922 * 923 * XXX does this leave us open to inheriting old state? 924 */ 925 for (i = 0; i < N(ni->ni_rxfrag); i++) 926 if (ni->ni_rxfrag[i] != NULL) { 927 m_freem(ni->ni_rxfrag[i]); 928 ni->ni_rxfrag[i] = NULL; 929 } 930 /* 931 * Must be careful here to remove any key map entry w/o a LOR. 932 */ 933 ieee80211_node_delucastkey(ni); 934#undef N 935} 936 937static void 938node_free(struct ieee80211_node *ni) 939{ 940 struct ieee80211com *ic = ni->ni_ic; 941 942 ic->ic_node_cleanup(ni); 943 if (ni->ni_wpa_ie != NULL) 944 FREE(ni->ni_wpa_ie, M_DEVBUF); 945 if (ni->ni_wme_ie != NULL) 946 FREE(ni->ni_wme_ie, M_DEVBUF); 947 IEEE80211_NODE_SAVEQ_DESTROY(ni); 948 FREE(ni, M_80211_NODE); 949} 950 951static u_int8_t 952node_getrssi(const struct ieee80211_node *ni) 953{ 954 return ni->ni_rssi; 955} 956 957static void 958ieee80211_setup_node(struct ieee80211_node_table *nt, 959 struct ieee80211_node *ni, const u_int8_t *macaddr) 960{ 961 struct ieee80211com *ic = nt->nt_ic; 962 int hash; 963 964 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 965 "%s %p<%s> in %s table\n", __func__, ni, 966 ether_sprintf(macaddr), nt->nt_name); 967 968 IEEE80211_ADDR_COPY(ni->ni_macaddr, macaddr); 969 hash = IEEE80211_NODE_HASH(macaddr); 970 ieee80211_node_initref(ni); /* mark referenced */ 971 ni->ni_chan = IEEE80211_CHAN_ANYC; 972 ni->ni_authmode = IEEE80211_AUTH_OPEN; 973 ni->ni_txpower = ic->ic_txpowlimit; /* max power */ 974 ieee80211_crypto_resetkey(ic, &ni->ni_ucastkey, IEEE80211_KEYIX_NONE); 975 ni->ni_inact_reload = nt->nt_inact_init; 976 ni->ni_inact = ni->ni_inact_reload; 977 IEEE80211_NODE_SAVEQ_INIT(ni, "unknown"); 978 979 IEEE80211_NODE_LOCK(nt); 980 TAILQ_INSERT_TAIL(&nt->nt_node, ni, ni_list); 981 LIST_INSERT_HEAD(&nt->nt_hash[hash], ni, ni_hash); 982 ni->ni_table = nt; 983 ni->ni_ic = ic; 984 IEEE80211_NODE_UNLOCK(nt); 985} 986 987struct ieee80211_node * 988ieee80211_alloc_node(struct ieee80211_node_table *nt, const u_int8_t *macaddr) 989{ 990 struct ieee80211com *ic = nt->nt_ic; 991 struct ieee80211_node *ni; 992 993 ni = ic->ic_node_alloc(nt); 994 if (ni != NULL) 995 ieee80211_setup_node(nt, ni, macaddr); 996 else 997 ic->ic_stats.is_rx_nodealloc++; 998 return ni; 999} 1000 1001/* 1002 * Craft a temporary node suitable for sending a management frame 1003 * to the specified station. We craft only as much state as we 1004 * need to do the work since the node will be immediately reclaimed 1005 * once the send completes. 1006 */ 1007struct ieee80211_node * 1008ieee80211_tmp_node(struct ieee80211com *ic, const u_int8_t *macaddr) 1009{ 1010 struct ieee80211_node *ni; 1011 1012 ni = ic->ic_node_alloc(&ic->ic_sta); 1013 if (ni != NULL) { 1014 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1015 "%s %p<%s>\n", __func__, ni, ether_sprintf(macaddr)); 1016 1017 IEEE80211_ADDR_COPY(ni->ni_macaddr, macaddr); 1018 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_bss->ni_bssid); 1019 ieee80211_node_initref(ni); /* mark referenced */ 1020 ni->ni_txpower = ic->ic_bss->ni_txpower; 1021 /* NB: required by ieee80211_fix_rate */ 1022 ieee80211_set_chan(ic, ni, ic->ic_bss->ni_chan); 1023 ieee80211_crypto_resetkey(ic, &ni->ni_ucastkey, 1024 IEEE80211_KEYIX_NONE); 1025 /* XXX optimize away */ 1026 IEEE80211_NODE_SAVEQ_INIT(ni, "unknown"); 1027 1028 ni->ni_table = NULL; /* NB: pedantic */ 1029 ni->ni_ic = ic; 1030 } else { 1031 /* XXX msg */ 1032 ic->ic_stats.is_rx_nodealloc++; 1033 } 1034 return ni; 1035} 1036 1037struct ieee80211_node * 1038ieee80211_dup_bss(struct ieee80211_node_table *nt, const u_int8_t *macaddr) 1039{ 1040 struct ieee80211com *ic = nt->nt_ic; 1041 struct ieee80211_node *ni; 1042 1043 ni = ic->ic_node_alloc(nt); 1044 if (ni != NULL) { 1045 ieee80211_setup_node(nt, ni, macaddr); 1046 /* 1047 * Inherit from ic_bss. 1048 */ 1049 ni->ni_authmode = ic->ic_bss->ni_authmode; 1050 ni->ni_txpower = ic->ic_bss->ni_txpower; 1051 ni->ni_vlan = ic->ic_bss->ni_vlan; /* XXX?? */ 1052 IEEE80211_ADDR_COPY(ni->ni_bssid, ic->ic_bss->ni_bssid); 1053 ieee80211_set_chan(ic, ni, ic->ic_bss->ni_chan); 1054 ni->ni_rsn = ic->ic_bss->ni_rsn; 1055 } else 1056 ic->ic_stats.is_rx_nodealloc++; 1057 return ni; 1058} 1059 1060static struct ieee80211_node * 1061#ifdef IEEE80211_DEBUG_REFCNT 1062_ieee80211_find_node_debug(struct ieee80211_node_table *nt, 1063 const u_int8_t *macaddr, const char *func, int line) 1064#else 1065_ieee80211_find_node(struct ieee80211_node_table *nt, 1066 const u_int8_t *macaddr) 1067#endif 1068{ 1069 struct ieee80211_node *ni; 1070 int hash; 1071 1072 IEEE80211_NODE_LOCK_ASSERT(nt); 1073 1074 hash = IEEE80211_NODE_HASH(macaddr); 1075 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) { 1076 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr)) { 1077 ieee80211_ref_node(ni); /* mark referenced */ 1078#ifdef IEEE80211_DEBUG_REFCNT 1079 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE, 1080 "%s (%s:%u) %p<%s> refcnt %d\n", __func__, 1081 func, line, 1082 ni, ether_sprintf(ni->ni_macaddr), 1083 ieee80211_node_refcnt(ni)); 1084#endif 1085 return ni; 1086 } 1087 } 1088 return NULL; 1089} 1090#ifdef IEEE80211_DEBUG_REFCNT 1091#define _ieee80211_find_node(nt, mac) \ 1092 _ieee80211_find_node_debug(nt, mac, func, line) 1093#endif 1094 1095struct ieee80211_node * 1096#ifdef IEEE80211_DEBUG_REFCNT 1097ieee80211_find_node_debug(struct ieee80211_node_table *nt, 1098 const u_int8_t *macaddr, const char *func, int line) 1099#else 1100ieee80211_find_node(struct ieee80211_node_table *nt, const u_int8_t *macaddr) 1101#endif 1102{ 1103 struct ieee80211_node *ni; 1104 1105 IEEE80211_NODE_LOCK(nt); 1106 ni = _ieee80211_find_node(nt, macaddr); 1107 IEEE80211_NODE_UNLOCK(nt); 1108 return ni; 1109} 1110 1111/* 1112 * Fake up a node; this handles node discovery in adhoc mode. 1113 * Note that for the driver's benefit we we treat this like 1114 * an association so the driver has an opportunity to setup 1115 * it's private state. 1116 */ 1117struct ieee80211_node * 1118ieee80211_fakeup_adhoc_node(struct ieee80211_node_table *nt, 1119 const u_int8_t macaddr[IEEE80211_ADDR_LEN]) 1120{ 1121 struct ieee80211com *ic = nt->nt_ic; 1122 struct ieee80211_node *ni; 1123 1124 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE, 1125 "%s: mac<%s>\n", __func__, ether_sprintf(macaddr)); 1126 ni = ieee80211_dup_bss(nt, macaddr); 1127 if (ni != NULL) { 1128 /* XXX no rate negotiation; just dup */ 1129 ni->ni_rates = ic->ic_bss->ni_rates; 1130 if (ic->ic_newassoc != NULL) 1131 ic->ic_newassoc(ni, 1); 1132 /* XXX not right for 802.1x/WPA */ 1133 ieee80211_node_authorize(ni); 1134 if (ic->ic_opmode == IEEE80211_M_AHDEMO) { 1135 /* 1136 * Blindly propagate capabilities based on the 1137 * local configuration. In particular this permits 1138 * us to use QoS to disable ACK's. 1139 */ 1140 if (ic->ic_flags & IEEE80211_F_WME) 1141 ni->ni_flags |= IEEE80211_NODE_QOS; 1142 } 1143 } 1144 return ni; 1145} 1146 1147#ifdef IEEE80211_DEBUG 1148static void 1149dump_probe_beacon(u_int8_t subtype, int isnew, 1150 const u_int8_t mac[IEEE80211_ADDR_LEN], 1151 const struct ieee80211_scanparams *sp) 1152{ 1153 1154 printf("[%s] %s%s on chan %u (bss chan %u) ", 1155 ether_sprintf(mac), isnew ? "new " : "", 1156 ieee80211_mgt_subtype_name[subtype >> IEEE80211_FC0_SUBTYPE_SHIFT], 1157 sp->chan, sp->bchan); 1158 ieee80211_print_essid(sp->ssid + 2, sp->ssid[1]); 1159 printf("\n"); 1160 1161 if (isnew) { 1162 printf("[%s] caps 0x%x bintval %u erp 0x%x", 1163 ether_sprintf(mac), sp->capinfo, sp->bintval, sp->erp); 1164 if (sp->country != NULL) { 1165#ifdef __FreeBSD__ 1166 printf(" country info %*D", 1167 sp->country[1], sp->country+2, " "); 1168#else 1169 int i; 1170 printf(" country info"); 1171 for (i = 0; i < sp->country[1]; i++) 1172 printf(" %02x", sp->country[i+2]); 1173#endif 1174 } 1175 printf("\n"); 1176 } 1177} 1178#endif /* IEEE80211_DEBUG */ 1179 1180static void 1181saveie(u_int8_t **iep, const u_int8_t *ie) 1182{ 1183 1184 if (ie == NULL) 1185 *iep = NULL; 1186 else 1187 ieee80211_saveie(iep, ie); 1188} 1189 1190/* 1191 * Process a beacon or probe response frame. 1192 */ 1193void 1194ieee80211_add_scan(struct ieee80211com *ic, 1195 const struct ieee80211_scanparams *sp, 1196 const struct ieee80211_frame *wh, 1197 int subtype, int rssi, int rstamp) 1198{ 1199#define ISPROBE(_st) ((_st) == IEEE80211_FC0_SUBTYPE_PROBE_RESP) 1200 struct ieee80211_node_table *nt = &ic->ic_scan; 1201 struct ieee80211_node *ni; 1202 int newnode = 0; 1203 1204 ni = ieee80211_find_node(nt, wh->i_addr2); 1205 if (ni == NULL) { 1206 /* 1207 * Create a new entry. 1208 */ 1209 ni = ic->ic_node_alloc(nt); 1210 if (ni == NULL) { 1211 ic->ic_stats.is_rx_nodealloc++; 1212 return; 1213 } 1214 ieee80211_setup_node(nt, ni, wh->i_addr2); 1215 /* 1216 * XXX inherit from ic_bss. 1217 */ 1218 ni->ni_authmode = ic->ic_bss->ni_authmode; 1219 ni->ni_txpower = ic->ic_bss->ni_txpower; 1220 ni->ni_vlan = ic->ic_bss->ni_vlan; /* XXX?? */ 1221 ieee80211_set_chan(ic, ni, ic->ic_curchan); 1222 ni->ni_rsn = ic->ic_bss->ni_rsn; 1223 newnode = 1; 1224 } 1225#ifdef IEEE80211_DEBUG 1226 if (ieee80211_msg_scan(ic) && (ic->ic_flags & IEEE80211_F_SCAN)) 1227 dump_probe_beacon(subtype, newnode, wh->i_addr2, sp); 1228#endif 1229 /* XXX ap beaconing multiple ssid w/ same bssid */ 1230 if (sp->ssid[1] != 0 && 1231 (ISPROBE(subtype) || ni->ni_esslen == 0)) { 1232 ni->ni_esslen = sp->ssid[1]; 1233 memset(ni->ni_essid, 0, sizeof(ni->ni_essid)); 1234 memcpy(ni->ni_essid, sp->ssid + 2, sp->ssid[1]); 1235 } 1236 ni->ni_scangen = ic->ic_scan.nt_scangen; 1237 IEEE80211_ADDR_COPY(ni->ni_bssid, wh->i_addr3); 1238 ni->ni_rssi = rssi; 1239 ni->ni_rstamp = rstamp; 1240 memcpy(ni->ni_tstamp.data, sp->tstamp, sizeof(ni->ni_tstamp)); 1241 ni->ni_intval = sp->bintval; 1242 ni->ni_capinfo = sp->capinfo; 1243 ni->ni_chan = &ic->ic_channels[sp->chan]; 1244 ni->ni_fhdwell = sp->fhdwell; 1245 ni->ni_fhindex = sp->fhindex; 1246 ni->ni_erp = sp->erp; 1247 if (sp->tim != NULL) { 1248 struct ieee80211_tim_ie *ie = 1249 (struct ieee80211_tim_ie *) sp->tim; 1250 1251 ni->ni_dtim_count = ie->tim_count; 1252 ni->ni_dtim_period = ie->tim_period; 1253 } 1254 /* 1255 * Record the byte offset from the mac header to 1256 * the start of the TIM information element for 1257 * use by hardware and/or to speedup software 1258 * processing of beacon frames. 1259 */ 1260 ni->ni_timoff = sp->timoff; 1261 /* 1262 * Record optional information elements that might be 1263 * used by applications or drivers. 1264 */ 1265 saveie(&ni->ni_wme_ie, sp->wme); 1266 saveie(&ni->ni_wpa_ie, sp->wpa); 1267 1268 /* NB: must be after ni_chan is setup */ 1269 ieee80211_setup_rates(ni, sp->rates, sp->xrates, IEEE80211_F_DOSORT); 1270 1271 if (!newnode) 1272 ieee80211_free_node(ni); 1273#undef ISPROBE 1274} 1275 1276void 1277ieee80211_init_neighbor(struct ieee80211_node *ni, 1278 const struct ieee80211_frame *wh, 1279 const struct ieee80211_scanparams *sp) 1280{ 1281 1282 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1283 "%s: %p<%s>\n", __func__, ni, ether_sprintf(ni->ni_macaddr)); 1284 ni->ni_esslen = sp->ssid[1]; 1285 memcpy(ni->ni_essid, sp->ssid + 2, sp->ssid[1]); 1286 IEEE80211_ADDR_COPY(ni->ni_bssid, wh->i_addr3); 1287 memcpy(ni->ni_tstamp.data, sp->tstamp, sizeof(ni->ni_tstamp)); 1288 ni->ni_intval = sp->bintval; 1289 ni->ni_capinfo = sp->capinfo; 1290 ni->ni_chan = ni->ni_ic->ic_curchan; 1291 ni->ni_fhdwell = sp->fhdwell; 1292 ni->ni_fhindex = sp->fhindex; 1293 ni->ni_erp = sp->erp; 1294 ni->ni_timoff = sp->timoff; 1295 if (sp->wme != NULL) 1296 ieee80211_saveie(&ni->ni_wme_ie, sp->wme); 1297 if (sp->wpa != NULL) 1298 ieee80211_saveie(&ni->ni_wpa_ie, sp->wpa); 1299 1300 /* NB: must be after ni_chan is setup */ 1301 ieee80211_setup_rates(ni, sp->rates, sp->xrates, 1302 IEEE80211_F_DOSORT | IEEE80211_F_DOFRATE | 1303 IEEE80211_F_DONEGO | IEEE80211_F_DODEL); 1304} 1305 1306/* 1307 * Do node discovery in adhoc mode on receipt of a beacon 1308 * or probe response frame. Note that for the driver's 1309 * benefit we we treat this like an association so the 1310 * driver has an opportunity to setup it's private state. 1311 */ 1312struct ieee80211_node * 1313ieee80211_add_neighbor(struct ieee80211com *ic, 1314 const struct ieee80211_frame *wh, 1315 const struct ieee80211_scanparams *sp) 1316{ 1317 struct ieee80211_node *ni; 1318 1319 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1320 "%s: mac<%s>\n", __func__, ether_sprintf(wh->i_addr2)); 1321 ni = ieee80211_dup_bss(&ic->ic_sta, wh->i_addr2);/* XXX alloc_node? */ 1322 if (ni != NULL) { 1323 ieee80211_init_neighbor(ni, wh, sp); 1324 if (ic->ic_newassoc != NULL) 1325 ic->ic_newassoc(ni, 1); 1326 /* XXX not right for 802.1x/WPA */ 1327 ieee80211_node_authorize(ni); 1328 } 1329 return ni; 1330} 1331 1332#define IS_CTL(wh) \ 1333 ((wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) == IEEE80211_FC0_TYPE_CTL) 1334#define IS_PSPOLL(wh) \ 1335 ((wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) == IEEE80211_FC0_SUBTYPE_PS_POLL) 1336/* 1337 * Locate the node for sender, track state, and then pass the 1338 * (referenced) node up to the 802.11 layer for its use. We 1339 * are required to pass some node so we fall back to ic_bss 1340 * when this frame is from an unknown sender. The 802.11 layer 1341 * knows this means the sender wasn't in the node table and 1342 * acts accordingly. 1343 */ 1344struct ieee80211_node * 1345#ifdef IEEE80211_DEBUG_REFCNT 1346ieee80211_find_rxnode_debug(struct ieee80211com *ic, 1347 const struct ieee80211_frame_min *wh, const char *func, int line) 1348#else 1349ieee80211_find_rxnode(struct ieee80211com *ic, 1350 const struct ieee80211_frame_min *wh) 1351#endif 1352{ 1353 struct ieee80211_node_table *nt; 1354 struct ieee80211_node *ni; 1355 1356 /* XXX may want scanned nodes in the neighbor table for adhoc */ 1357 if (ic->ic_opmode == IEEE80211_M_STA || 1358 ic->ic_opmode == IEEE80211_M_MONITOR || 1359 (ic->ic_flags & IEEE80211_F_SCAN)) 1360 nt = &ic->ic_scan; 1361 else 1362 nt = &ic->ic_sta; 1363 /* XXX check ic_bss first in station mode */ 1364 /* XXX 4-address frames? */ 1365 IEEE80211_NODE_LOCK(nt); 1366 if (IS_CTL(wh) && !IS_PSPOLL(wh) /*&& !IS_RTS(ah)*/) 1367 ni = _ieee80211_find_node(nt, wh->i_addr1); 1368 else 1369 ni = _ieee80211_find_node(nt, wh->i_addr2); 1370 if (ni == NULL) 1371 ni = ieee80211_ref_node(ic->ic_bss); 1372 IEEE80211_NODE_UNLOCK(nt); 1373 1374 return ni; 1375} 1376 1377/* 1378 * Like ieee80211_find_rxnode but use the supplied h/w 1379 * key index as a hint to locate the node in the key 1380 * mapping table. If an entry is present at the key 1381 * index we return it; otherwise do a normal lookup and 1382 * update the mapping table if the station has a unicast 1383 * key assigned to it. 1384 */ 1385struct ieee80211_node * 1386#ifdef IEEE80211_DEBUG_REFCNT 1387ieee80211_find_rxnode_withkey_debug(struct ieee80211com *ic, 1388 const struct ieee80211_frame_min *wh, ieee80211_keyix keyix, 1389 const char *func, int line) 1390#else 1391ieee80211_find_rxnode_withkey(struct ieee80211com *ic, 1392 const struct ieee80211_frame_min *wh, ieee80211_keyix keyix) 1393#endif 1394{ 1395 struct ieee80211_node_table *nt; 1396 struct ieee80211_node *ni; 1397 1398 if (ic->ic_opmode == IEEE80211_M_STA || 1399 ic->ic_opmode == IEEE80211_M_MONITOR || 1400 (ic->ic_flags & IEEE80211_F_SCAN)) 1401 nt = &ic->ic_scan; 1402 else 1403 nt = &ic->ic_sta; 1404 IEEE80211_NODE_LOCK(nt); 1405 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax) 1406 ni = nt->nt_keyixmap[keyix]; 1407 else 1408 ni = NULL; 1409 if (ni == NULL) { 1410 if (IS_CTL(wh) && !IS_PSPOLL(wh) /*&& !IS_RTS(ah)*/) 1411 ni = _ieee80211_find_node(nt, wh->i_addr1); 1412 else 1413 ni = _ieee80211_find_node(nt, wh->i_addr2); 1414 if (ni == NULL) 1415 ni = ieee80211_ref_node(ic->ic_bss); 1416 if (nt->nt_keyixmap != NULL) { 1417 /* 1418 * If the station has a unicast key cache slot 1419 * assigned update the key->node mapping table. 1420 */ 1421 keyix = ni->ni_ucastkey.wk_rxkeyix; 1422 /* XXX can keyixmap[keyix] != NULL? */ 1423 if (keyix < nt->nt_keyixmax && 1424 nt->nt_keyixmap[keyix] == NULL) { 1425 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1426 "%s: add key map entry %p<%s> refcnt %d\n", 1427 __func__, ni, ether_sprintf(ni->ni_macaddr), 1428 ieee80211_node_refcnt(ni)+1); 1429 nt->nt_keyixmap[keyix] = ieee80211_ref_node(ni); 1430 } 1431 } 1432 } else { 1433 ieee80211_ref_node(ni); 1434 } 1435 IEEE80211_NODE_UNLOCK(nt); 1436 1437 return ni; 1438} 1439#undef IS_PSPOLL 1440#undef IS_CTL 1441 1442/* 1443 * Return a reference to the appropriate node for sending 1444 * a data frame. This handles node discovery in adhoc networks. 1445 */ 1446struct ieee80211_node * 1447#ifdef IEEE80211_DEBUG_REFCNT 1448ieee80211_find_txnode_debug(struct ieee80211com *ic, const u_int8_t *macaddr, 1449 const char *func, int line) 1450#else 1451ieee80211_find_txnode(struct ieee80211com *ic, const u_int8_t *macaddr) 1452#endif 1453{ 1454 struct ieee80211_node_table *nt = &ic->ic_sta; 1455 struct ieee80211_node *ni; 1456 1457 /* 1458 * The destination address should be in the node table 1459 * unless this is a multicast/broadcast frame. We can 1460 * also optimize station mode operation, all frames go 1461 * to the bss node. 1462 */ 1463 /* XXX can't hold lock across dup_bss 'cuz of recursive locking */ 1464 IEEE80211_NODE_LOCK(nt); 1465 if (ic->ic_opmode == IEEE80211_M_STA || IEEE80211_IS_MULTICAST(macaddr)) 1466 ni = ieee80211_ref_node(ic->ic_bss); 1467 else { 1468 ni = _ieee80211_find_node(nt, macaddr); 1469 if (ic->ic_opmode == IEEE80211_M_HOSTAP && 1470 (ni != NULL && ni->ni_associd == 0)) { 1471 /* 1472 * Station is not associated; don't permit the 1473 * data frame to be sent by returning NULL. This 1474 * is kinda a kludge but the least intrusive way 1475 * to add this check into all drivers. 1476 */ 1477 ieee80211_unref_node(&ni); /* NB: null's ni */ 1478 } 1479 } 1480 IEEE80211_NODE_UNLOCK(nt); 1481 1482 if (ni == NULL) { 1483 if (ic->ic_opmode == IEEE80211_M_IBSS || 1484 ic->ic_opmode == IEEE80211_M_AHDEMO) { 1485 /* 1486 * In adhoc mode cons up a node for the destination. 1487 * Note that we need an additional reference for the 1488 * caller to be consistent with _ieee80211_find_node. 1489 */ 1490 ni = ieee80211_fakeup_adhoc_node(nt, macaddr); 1491 if (ni != NULL) 1492 (void) ieee80211_ref_node(ni); 1493 } else { 1494 IEEE80211_DPRINTF(ic, IEEE80211_MSG_OUTPUT, 1495 "[%s] no node, discard frame (%s)\n", 1496 ether_sprintf(macaddr), __func__); 1497 ic->ic_stats.is_tx_nonode++; 1498 } 1499 } 1500 return ni; 1501} 1502 1503/* 1504 * Like find but search based on the channel too. 1505 */ 1506struct ieee80211_node * 1507#ifdef IEEE80211_DEBUG_REFCNT 1508ieee80211_find_node_with_channel_debug(struct ieee80211_node_table *nt, 1509 const u_int8_t *macaddr, struct ieee80211_channel *chan, 1510 const char *func, int line) 1511#else 1512ieee80211_find_node_with_channel(struct ieee80211_node_table *nt, 1513 const u_int8_t *macaddr, struct ieee80211_channel *chan) 1514#endif 1515{ 1516 struct ieee80211_node *ni; 1517 int hash; 1518 1519 hash = IEEE80211_NODE_HASH(macaddr); 1520 IEEE80211_NODE_LOCK(nt); 1521 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) { 1522 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr) && 1523 ni->ni_chan == chan) { 1524 ieee80211_ref_node(ni); /* mark referenced */ 1525 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE, 1526 REFCNT_LOC, ni, ether_sprintf(ni->ni_macaddr), 1527 ieee80211_node_refcnt(ni)); 1528 break; 1529 } 1530 } 1531 IEEE80211_NODE_UNLOCK(nt); 1532 return ni; 1533} 1534 1535/* 1536 * Like find but search based on the ssid too. 1537 */ 1538struct ieee80211_node * 1539#ifdef IEEE80211_DEBUG_REFCNT 1540ieee80211_find_node_with_ssid_debug(struct ieee80211_node_table *nt, 1541 const u_int8_t *macaddr, u_int ssidlen, const u_int8_t *ssid, 1542 const char *func, int line) 1543#else 1544ieee80211_find_node_with_ssid(struct ieee80211_node_table *nt, 1545 const u_int8_t *macaddr, u_int ssidlen, const u_int8_t *ssid) 1546#endif 1547{ 1548#define MATCH_SSID(ni, ssid, ssidlen) \ 1549 (ni->ni_esslen == ssidlen && memcmp(ni->ni_essid, ssid, ssidlen) == 0) 1550 static const u_int8_t zeromac[IEEE80211_ADDR_LEN]; 1551 struct ieee80211com *ic = nt->nt_ic; 1552 struct ieee80211_node *ni; 1553 int hash; 1554 1555 IEEE80211_NODE_LOCK(nt); 1556 /* 1557 * A mac address that is all zero means match only the ssid; 1558 * otherwise we must match both. 1559 */ 1560 if (IEEE80211_ADDR_EQ(macaddr, zeromac)) { 1561 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) { 1562 if (MATCH_SSID(ni, ssid, ssidlen)) 1563 break; 1564 } 1565 } else { 1566 hash = IEEE80211_NODE_HASH(macaddr); 1567 LIST_FOREACH(ni, &nt->nt_hash[hash], ni_hash) { 1568 if (IEEE80211_ADDR_EQ(ni->ni_macaddr, macaddr) && 1569 MATCH_SSID(ni, ssid, ssidlen)) 1570 break; 1571 } 1572 } 1573 if (ni != NULL) { 1574 ieee80211_ref_node(ni); /* mark referenced */ 1575 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1576 REFCNT_LOC, ni, ether_sprintf(ni->ni_macaddr), 1577 ieee80211_node_refcnt(ni)); 1578 } 1579 IEEE80211_NODE_UNLOCK(nt); 1580 return ni; 1581#undef MATCH_SSID 1582} 1583 1584static void 1585_ieee80211_free_node(struct ieee80211_node *ni) 1586{ 1587 struct ieee80211com *ic = ni->ni_ic; 1588 struct ieee80211_node_table *nt = ni->ni_table; 1589 1590 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1591 "%s %p<%s> in %s table\n", __func__, ni, 1592 ether_sprintf(ni->ni_macaddr), 1593 nt != NULL ? nt->nt_name : "<gone>"); 1594 1595 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap); 1596 if (nt != NULL) { 1597 TAILQ_REMOVE(&nt->nt_node, ni, ni_list); 1598 LIST_REMOVE(ni, ni_hash); 1599 } 1600 ic->ic_node_free(ni); 1601} 1602 1603void 1604#ifdef IEEE80211_DEBUG_REFCNT 1605ieee80211_free_node_debug(struct ieee80211_node *ni, const char *func, int line) 1606#else 1607ieee80211_free_node(struct ieee80211_node *ni) 1608#endif 1609{ 1610 struct ieee80211_node_table *nt = ni->ni_table; 1611 1612#ifdef IEEE80211_DEBUG_REFCNT 1613 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1614 "%s (%s:%u) %p<%s> refcnt %d\n", __func__, func, line, ni, 1615 ether_sprintf(ni->ni_macaddr), ieee80211_node_refcnt(ni)-1); 1616#endif 1617 if (nt != NULL) { 1618 IEEE80211_NODE_LOCK(nt); 1619 if (ieee80211_node_dectestref(ni)) { 1620 /* 1621 * Last reference, reclaim state. 1622 */ 1623 _ieee80211_free_node(ni); 1624 } else if (ieee80211_node_refcnt(ni) == 1 && 1625 nt->nt_keyixmap != NULL) { 1626 ieee80211_keyix keyix; 1627 /* 1628 * Check for a last reference in the key mapping table. 1629 */ 1630 keyix = ni->ni_ucastkey.wk_rxkeyix; 1631 if (keyix < nt->nt_keyixmax && 1632 nt->nt_keyixmap[keyix] == ni) { 1633 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1634 "%s: %p<%s> clear key map entry", __func__, 1635 ni, ether_sprintf(ni->ni_macaddr)); 1636 nt->nt_keyixmap[keyix] = NULL; 1637 ieee80211_node_decref(ni); /* XXX needed? */ 1638 _ieee80211_free_node(ni); 1639 } 1640 } 1641 IEEE80211_NODE_UNLOCK(nt); 1642 } else { 1643 if (ieee80211_node_dectestref(ni)) 1644 _ieee80211_free_node(ni); 1645 } 1646} 1647 1648/* 1649 * Reclaim a unicast key and clear any key cache state. 1650 */ 1651int 1652ieee80211_node_delucastkey(struct ieee80211_node *ni) 1653{ 1654 struct ieee80211com *ic = ni->ni_ic; 1655 struct ieee80211_node_table *nt = &ic->ic_sta; 1656 struct ieee80211_node *nikey; 1657 ieee80211_keyix keyix; 1658 int isowned, status; 1659 1660 /* 1661 * NB: We must beware of LOR here; deleting the key 1662 * can cause the crypto layer to block traffic updates 1663 * which can generate a LOR against the node table lock; 1664 * grab it here and stash the key index for our use below. 1665 * 1666 * Must also beware of recursion on the node table lock. 1667 * When called from node_cleanup we may already have 1668 * the node table lock held. Unfortunately there's no 1669 * way to separate out this path so we must do this 1670 * conditionally. 1671 */ 1672 isowned = IEEE80211_NODE_IS_LOCKED(nt); 1673 if (!isowned) 1674 IEEE80211_NODE_LOCK(nt); 1675 keyix = ni->ni_ucastkey.wk_rxkeyix; 1676 status = ieee80211_crypto_delkey(ic, &ni->ni_ucastkey); 1677 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax) { 1678 nikey = nt->nt_keyixmap[keyix]; 1679 nt->nt_keyixmap[keyix] = NULL;; 1680 } else 1681 nikey = NULL; 1682 if (!isowned) 1683 IEEE80211_NODE_UNLOCK(&ic->ic_sta); 1684 1685 if (nikey != NULL) { 1686 KASSERT(nikey == ni, 1687 ("key map out of sync, ni %p nikey %p", ni, nikey)); 1688 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1689 "%s: delete key map entry %p<%s> refcnt %d\n", 1690 __func__, ni, ether_sprintf(ni->ni_macaddr), 1691 ieee80211_node_refcnt(ni)-1); 1692 ieee80211_free_node(ni); 1693 } 1694 return status; 1695} 1696 1697/* 1698 * Reclaim a node. If this is the last reference count then 1699 * do the normal free work. Otherwise remove it from the node 1700 * table and mark it gone by clearing the back-reference. 1701 */ 1702static void 1703node_reclaim(struct ieee80211_node_table *nt, struct ieee80211_node *ni) 1704{ 1705 ieee80211_keyix keyix; 1706 1707 IEEE80211_NODE_LOCK_ASSERT(nt); 1708 1709 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1710 "%s: remove %p<%s> from %s table, refcnt %d\n", 1711 __func__, ni, ether_sprintf(ni->ni_macaddr), 1712 nt->nt_name, ieee80211_node_refcnt(ni)-1); 1713 /* 1714 * Clear any entry in the unicast key mapping table. 1715 * We need to do it here so rx lookups don't find it 1716 * in the mapping table even if it's not in the hash 1717 * table. We cannot depend on the mapping table entry 1718 * being cleared because the node may not be free'd. 1719 */ 1720 keyix = ni->ni_ucastkey.wk_rxkeyix; 1721 if (nt->nt_keyixmap != NULL && keyix < nt->nt_keyixmax && 1722 nt->nt_keyixmap[keyix] == ni) { 1723 IEEE80211_DPRINTF(ni->ni_ic, IEEE80211_MSG_NODE, 1724 "%s: %p<%s> clear key map entry\n", 1725 __func__, ni, ether_sprintf(ni->ni_macaddr)); 1726 nt->nt_keyixmap[keyix] = NULL; 1727 ieee80211_node_decref(ni); /* NB: don't need free */ 1728 } 1729 if (!ieee80211_node_dectestref(ni)) { 1730 /* 1731 * Other references are present, just remove the 1732 * node from the table so it cannot be found. When 1733 * the references are dropped storage will be 1734 * reclaimed. 1735 */ 1736 TAILQ_REMOVE(&nt->nt_node, ni, ni_list); 1737 LIST_REMOVE(ni, ni_hash); 1738 ni->ni_table = NULL; /* clear reference */ 1739 } else 1740 _ieee80211_free_node(ni); 1741} 1742 1743static void 1744ieee80211_free_allnodes_locked(struct ieee80211_node_table *nt) 1745{ 1746 struct ieee80211com *ic = nt->nt_ic; 1747 struct ieee80211_node *ni; 1748 1749 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1750 "%s: free all nodes in %s table\n", __func__, nt->nt_name); 1751 1752 while ((ni = TAILQ_FIRST(&nt->nt_node)) != NULL) { 1753 if (ni->ni_associd != 0) { 1754 if (ic->ic_auth->ia_node_leave != NULL) 1755 ic->ic_auth->ia_node_leave(ic, ni); 1756 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap); 1757 } 1758 node_reclaim(nt, ni); 1759 } 1760 ieee80211_reset_erp(ic); 1761} 1762 1763static void 1764ieee80211_free_allnodes(struct ieee80211_node_table *nt) 1765{ 1766 1767 IEEE80211_NODE_LOCK(nt); 1768 ieee80211_free_allnodes_locked(nt); 1769 IEEE80211_NODE_UNLOCK(nt); 1770} 1771 1772/* 1773 * Timeout entries in the scan cache. 1774 */ 1775static void 1776ieee80211_timeout_scan_candidates(struct ieee80211_node_table *nt) 1777{ 1778 struct ieee80211com *ic = nt->nt_ic; 1779 struct ieee80211_node *ni, *tni; 1780 1781 IEEE80211_NODE_LOCK(nt); 1782 ni = ic->ic_bss; 1783 /* XXX belongs elsewhere */ 1784 if (ni->ni_rxfrag[0] != NULL && ticks > ni->ni_rxfragstamp + hz) { 1785 m_freem(ni->ni_rxfrag[0]); 1786 ni->ni_rxfrag[0] = NULL; 1787 } 1788 TAILQ_FOREACH_SAFE(ni, &nt->nt_node, ni_list, tni) { 1789 if (ni->ni_inact && --ni->ni_inact == 0) { 1790 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1791 "[%s] scan candidate purged from cache " 1792 "(refcnt %u)\n", ether_sprintf(ni->ni_macaddr), 1793 ieee80211_node_refcnt(ni)); 1794 node_reclaim(nt, ni); 1795 } 1796 } 1797 IEEE80211_NODE_UNLOCK(nt); 1798 1799 nt->nt_inact_timer = IEEE80211_INACT_WAIT; 1800} 1801 1802/* 1803 * Timeout inactive stations and do related housekeeping. 1804 * Note that we cannot hold the node lock while sending a 1805 * frame as this would lead to a LOR. Instead we use a 1806 * generation number to mark nodes that we've scanned and 1807 * drop the lock and restart a scan if we have to time out 1808 * a node. Since we are single-threaded by virtue of 1809 * controlling the inactivity timer we can be sure this will 1810 * process each node only once. 1811 */ 1812static void 1813ieee80211_timeout_stations(struct ieee80211_node_table *nt) 1814{ 1815 struct ieee80211com *ic = nt->nt_ic; 1816 struct ieee80211_node *ni; 1817 u_int gen; 1818 int isadhoc; 1819 1820 isadhoc = (ic->ic_opmode == IEEE80211_M_IBSS || 1821 ic->ic_opmode == IEEE80211_M_AHDEMO); 1822 IEEE80211_SCAN_LOCK(nt); 1823 gen = ++nt->nt_scangen; 1824 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 1825 "%s: %s scangen %u\n", __func__, nt->nt_name, gen); 1826restart: 1827 IEEE80211_NODE_LOCK(nt); 1828 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) { 1829 if (ni->ni_scangen == gen) /* previously handled */ 1830 continue; 1831 ni->ni_scangen = gen; 1832 /* 1833 * Ignore entries for which have yet to receive an 1834 * authentication frame. These are transient and 1835 * will be reclaimed when the last reference to them 1836 * goes away (when frame xmits complete). 1837 */ 1838 if (ic->ic_opmode == IEEE80211_M_HOSTAP && 1839 (ni->ni_flags & IEEE80211_NODE_AREF) == 0) 1840 continue; 1841 /* 1842 * Free fragment if not needed anymore 1843 * (last fragment older than 1s). 1844 * XXX doesn't belong here 1845 */ 1846 if (ni->ni_rxfrag[0] != NULL && 1847 ticks > ni->ni_rxfragstamp + hz) { 1848 m_freem(ni->ni_rxfrag[0]); 1849 ni->ni_rxfrag[0] = NULL; 1850 } 1851 /* 1852 * Special case ourself; we may be idle for extended periods 1853 * of time and regardless reclaiming our state is wrong. 1854 */ 1855 if (ni == ic->ic_bss) 1856 continue; 1857 ni->ni_inact--; 1858 if (ni->ni_associd != 0 || isadhoc) { 1859 /* 1860 * Age frames on the power save queue. The 1861 * aging interval is 4 times the listen 1862 * interval specified by the station. This 1863 * number is factored into the age calculations 1864 * when the frame is placed on the queue. We 1865 * store ages as time differences we can check 1866 * and/or adjust only the head of the list. 1867 */ 1868 if (IEEE80211_NODE_SAVEQ_QLEN(ni) != 0) { 1869 struct mbuf *m; 1870 int discard = 0; 1871 1872 IEEE80211_NODE_SAVEQ_LOCK(ni); 1873 while (IF_POLL(&ni->ni_savedq, m) != NULL && 1874 M_AGE_GET(m) < IEEE80211_INACT_WAIT) { 1875IEEE80211_DPRINTF(ic, IEEE80211_MSG_POWER, "[%s] discard frame, age %u\n", ether_sprintf(ni->ni_macaddr), M_AGE_GET(m));/*XXX*/ 1876 _IEEE80211_NODE_SAVEQ_DEQUEUE_HEAD(ni, m); 1877 m_freem(m); 1878 discard++; 1879 } 1880 if (m != NULL) 1881 M_AGE_SUB(m, IEEE80211_INACT_WAIT); 1882 IEEE80211_NODE_SAVEQ_UNLOCK(ni); 1883 1884 if (discard != 0) { 1885 IEEE80211_DPRINTF(ic, 1886 IEEE80211_MSG_POWER, 1887 "[%s] discard %u frames for age\n", 1888 ether_sprintf(ni->ni_macaddr), 1889 discard); 1890 IEEE80211_NODE_STAT_ADD(ni, 1891 ps_discard, discard); 1892 if (IEEE80211_NODE_SAVEQ_QLEN(ni) == 0) 1893 ic->ic_set_tim(ni, 0); 1894 } 1895 } 1896 /* 1897 * Probe the station before time it out. We 1898 * send a null data frame which may not be 1899 * universally supported by drivers (need it 1900 * for ps-poll support so it should be...). 1901 */ 1902 if (0 < ni->ni_inact && 1903 ni->ni_inact <= ic->ic_inact_probe) { 1904 IEEE80211_NOTE(ic, 1905 IEEE80211_MSG_INACT | IEEE80211_MSG_NODE, 1906 ni, "%s", 1907 "probe station due to inactivity"); 1908 /* 1909 * Grab a reference before unlocking the table 1910 * so the node cannot be reclaimed before we 1911 * send the frame. ieee80211_send_nulldata 1912 * understands we've done this and reclaims the 1913 * ref for us as needed. 1914 */ 1915 ieee80211_ref_node(ni); 1916 IEEE80211_NODE_UNLOCK(nt); 1917 ieee80211_send_nulldata(ni); 1918 /* XXX stat? */ 1919 goto restart; 1920 } 1921 } 1922 if (ni->ni_inact <= 0) { 1923 IEEE80211_NOTE(ic, 1924 IEEE80211_MSG_INACT | IEEE80211_MSG_NODE, ni, 1925 "station timed out due to inactivity " 1926 "(refcnt %u)", ieee80211_node_refcnt(ni)); 1927 /* 1928 * Send a deauthenticate frame and drop the station. 1929 * This is somewhat complicated due to reference counts 1930 * and locking. At this point a station will typically 1931 * have a reference count of 1. ieee80211_node_leave 1932 * will do a "free" of the node which will drop the 1933 * reference count. But in the meantime a reference 1934 * wil be held by the deauth frame. The actual reclaim 1935 * of the node will happen either after the tx is 1936 * completed or by ieee80211_node_leave. 1937 * 1938 * Separately we must drop the node lock before sending 1939 * in case the driver takes a lock, as this will result 1940 * in LOR between the node lock and the driver lock. 1941 */ 1942 IEEE80211_NODE_UNLOCK(nt); 1943 if (ni->ni_associd != 0) { 1944 IEEE80211_SEND_MGMT(ic, ni, 1945 IEEE80211_FC0_SUBTYPE_DEAUTH, 1946 IEEE80211_REASON_AUTH_EXPIRE); 1947 } 1948 ieee80211_node_leave(ic, ni); 1949 ic->ic_stats.is_node_timeout++; 1950 goto restart; 1951 } 1952 } 1953 IEEE80211_NODE_UNLOCK(nt); 1954 1955 IEEE80211_SCAN_UNLOCK(nt); 1956 1957 nt->nt_inact_timer = IEEE80211_INACT_WAIT; 1958} 1959 1960void 1961ieee80211_iterate_nodes(struct ieee80211_node_table *nt, ieee80211_iter_func *f, void *arg) 1962{ 1963 struct ieee80211_node *ni; 1964 u_int gen; 1965 1966 IEEE80211_SCAN_LOCK(nt); 1967 gen = ++nt->nt_scangen; 1968restart: 1969 IEEE80211_NODE_LOCK(nt); 1970 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) { 1971 if (ni->ni_scangen != gen) { 1972 ni->ni_scangen = gen; 1973 (void) ieee80211_ref_node(ni); 1974 IEEE80211_NODE_UNLOCK(nt); 1975 (*f)(arg, ni); 1976 ieee80211_free_node(ni); 1977 goto restart; 1978 } 1979 } 1980 IEEE80211_NODE_UNLOCK(nt); 1981 1982 IEEE80211_SCAN_UNLOCK(nt); 1983} 1984 1985void 1986ieee80211_dump_node(struct ieee80211_node_table *nt, struct ieee80211_node *ni) 1987{ 1988 printf("0x%p: mac %s refcnt %d\n", ni, 1989 ether_sprintf(ni->ni_macaddr), ieee80211_node_refcnt(ni)); 1990 printf("\tscangen %u authmode %u flags 0x%x\n", 1991 ni->ni_scangen, ni->ni_authmode, ni->ni_flags); 1992 printf("\tassocid 0x%x txpower %u vlan %u\n", 1993 ni->ni_associd, ni->ni_txpower, ni->ni_vlan); 1994 printf("\ttxseq %u rxseq %u fragno %u rxfragstamp %u\n", 1995 ni->ni_txseqs[0], 1996 ni->ni_rxseqs[0] >> IEEE80211_SEQ_SEQ_SHIFT, 1997 ni->ni_rxseqs[0] & IEEE80211_SEQ_FRAG_MASK, 1998 ni->ni_rxfragstamp); 1999 printf("\trstamp %u rssi %u intval %u capinfo 0x%x\n", 2000 ni->ni_rstamp, ni->ni_rssi, ni->ni_intval, ni->ni_capinfo); 2001 printf("\tbssid %s essid \"%.*s\" channel %u:0x%x\n", 2002 ether_sprintf(ni->ni_bssid), 2003 ni->ni_esslen, ni->ni_essid, 2004 ni->ni_chan->ic_freq, ni->ni_chan->ic_flags); 2005 printf("\tfails %u inact %u txrate %u\n", 2006 ni->ni_fails, ni->ni_inact, ni->ni_txrate); 2007} 2008 2009void 2010ieee80211_dump_nodes(struct ieee80211_node_table *nt) 2011{ 2012 ieee80211_iterate_nodes(nt, 2013 (ieee80211_iter_func *) ieee80211_dump_node, nt); 2014} 2015 2016/* 2017 * Handle a station joining an 11g network. 2018 */ 2019static void 2020ieee80211_node_join_11g(struct ieee80211com *ic, struct ieee80211_node *ni) 2021{ 2022 2023 /* 2024 * Station isn't capable of short slot time. Bump 2025 * the count of long slot time stations and disable 2026 * use of short slot time. Note that the actual switch 2027 * over to long slot time use may not occur until the 2028 * next beacon transmission (per sec. 7.3.1.4 of 11g). 2029 */ 2030 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_SLOTTIME) == 0) { 2031 ic->ic_longslotsta++; 2032 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2033 "[%s] station needs long slot time, count %d\n", 2034 ether_sprintf(ni->ni_macaddr), ic->ic_longslotsta); 2035 /* XXX vap's w/ conflicting needs won't work */ 2036 ieee80211_set_shortslottime(ic, 0); 2037 } 2038 /* 2039 * If the new station is not an ERP station 2040 * then bump the counter and enable protection 2041 * if configured. 2042 */ 2043 if (!ieee80211_iserp_rateset(ic, &ni->ni_rates)) { 2044 ic->ic_nonerpsta++; 2045 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2046 "[%s] station is !ERP, %d non-ERP stations associated\n", 2047 ether_sprintf(ni->ni_macaddr), ic->ic_nonerpsta); 2048 /* 2049 * If protection is configured, enable it. 2050 */ 2051 if (ic->ic_protmode != IEEE80211_PROT_NONE) { 2052 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2053 "%s: enable use of protection\n", __func__); 2054 ic->ic_flags |= IEEE80211_F_USEPROT; 2055 } 2056 /* 2057 * If station does not support short preamble 2058 * then we must enable use of Barker preamble. 2059 */ 2060 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_PREAMBLE) == 0) { 2061 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2062 "[%s] station needs long preamble\n", 2063 ether_sprintf(ni->ni_macaddr)); 2064 ic->ic_flags |= IEEE80211_F_USEBARKER; 2065 ic->ic_flags &= ~IEEE80211_F_SHPREAMBLE; 2066 } 2067 if (ic->ic_nonerpsta == 1) 2068 ic->ic_flags_ext |= IEEE80211_FEXT_ERPUPDATE; 2069 } else 2070 ni->ni_flags |= IEEE80211_NODE_ERP; 2071} 2072 2073void 2074ieee80211_node_join(struct ieee80211com *ic, struct ieee80211_node *ni, int resp) 2075{ 2076 int newassoc; 2077 2078 if (ni->ni_associd == 0) { 2079 u_int16_t aid; 2080 2081 /* 2082 * It would be good to search the bitmap 2083 * more efficiently, but this will do for now. 2084 */ 2085 for (aid = 1; aid < ic->ic_max_aid; aid++) { 2086 if (!IEEE80211_AID_ISSET(aid, 2087 ic->ic_aid_bitmap)) 2088 break; 2089 } 2090 if (aid >= ic->ic_max_aid) { 2091 IEEE80211_SEND_MGMT(ic, ni, resp, 2092 IEEE80211_REASON_ASSOC_TOOMANY); 2093 ieee80211_node_leave(ic, ni); 2094 return; 2095 } 2096 ni->ni_associd = aid | 0xc000; 2097 IEEE80211_AID_SET(ni->ni_associd, ic->ic_aid_bitmap); 2098 ic->ic_sta_assoc++; 2099 newassoc = 1; 2100 if (ic->ic_curmode == IEEE80211_MODE_11G) 2101 ieee80211_node_join_11g(ic, ni); 2102 } else 2103 newassoc = 0; 2104 2105 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC | IEEE80211_MSG_DEBUG, 2106 "[%s] station %sassociated at aid %d: %s preamble, %s slot time%s%s\n", 2107 ether_sprintf(ni->ni_macaddr), newassoc ? "" : "re", 2108 IEEE80211_NODE_AID(ni), 2109 ic->ic_flags & IEEE80211_F_SHPREAMBLE ? "short" : "long", 2110 ic->ic_flags & IEEE80211_F_SHSLOT ? "short" : "long", 2111 ic->ic_flags & IEEE80211_F_USEPROT ? ", protection" : "", 2112 ni->ni_flags & IEEE80211_NODE_QOS ? ", QoS" : "" 2113 ); 2114 2115 /* give driver a chance to setup state like ni_txrate */ 2116 if (ic->ic_newassoc != NULL) 2117 ic->ic_newassoc(ni, newassoc); 2118 ni->ni_inact_reload = ic->ic_inact_auth; 2119 ni->ni_inact = ni->ni_inact_reload; 2120 IEEE80211_SEND_MGMT(ic, ni, resp, IEEE80211_STATUS_SUCCESS); 2121 /* tell the authenticator about new station */ 2122 if (ic->ic_auth->ia_node_join != NULL) 2123 ic->ic_auth->ia_node_join(ic, ni); 2124 ieee80211_notify_node_join(ic, ni, newassoc); 2125} 2126 2127/* 2128 * Handle a station leaving an 11g network. 2129 */ 2130static void 2131ieee80211_node_leave_11g(struct ieee80211com *ic, struct ieee80211_node *ni) 2132{ 2133 2134 KASSERT(ic->ic_curmode == IEEE80211_MODE_11G, 2135 ("not in 11g, bss %u:0x%x, curmode %u", ni->ni_chan->ic_freq, 2136 ni->ni_chan->ic_flags, ic->ic_curmode)); 2137 2138 /* 2139 * If a long slot station do the slot time bookkeeping. 2140 */ 2141 if ((ni->ni_capinfo & IEEE80211_CAPINFO_SHORT_SLOTTIME) == 0) { 2142 KASSERT(ic->ic_longslotsta > 0, 2143 ("bogus long slot station count %d", ic->ic_longslotsta)); 2144 ic->ic_longslotsta--; 2145 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2146 "[%s] long slot time station leaves, count now %d\n", 2147 ether_sprintf(ni->ni_macaddr), ic->ic_longslotsta); 2148 if (ic->ic_longslotsta == 0) { 2149 /* 2150 * Re-enable use of short slot time if supported 2151 * and not operating in IBSS mode (per spec). 2152 */ 2153 if ((ic->ic_caps & IEEE80211_C_SHSLOT) && 2154 ic->ic_opmode != IEEE80211_M_IBSS) { 2155 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2156 "%s: re-enable use of short slot time\n", 2157 __func__); 2158 ieee80211_set_shortslottime(ic, 1); 2159 } 2160 } 2161 } 2162 /* 2163 * If a non-ERP station do the protection-related bookkeeping. 2164 */ 2165 if ((ni->ni_flags & IEEE80211_NODE_ERP) == 0) { 2166 KASSERT(ic->ic_nonerpsta > 0, 2167 ("bogus non-ERP station count %d", ic->ic_nonerpsta)); 2168 ic->ic_nonerpsta--; 2169 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2170 "[%s] non-ERP station leaves, count now %d\n", 2171 ether_sprintf(ni->ni_macaddr), ic->ic_nonerpsta); 2172 if (ic->ic_nonerpsta == 0) { 2173 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2174 "%s: disable use of protection\n", __func__); 2175 ic->ic_flags &= ~IEEE80211_F_USEPROT; 2176 /* XXX verify mode? */ 2177 if (ic->ic_caps & IEEE80211_C_SHPREAMBLE) { 2178 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC, 2179 "%s: re-enable use of short preamble\n", 2180 __func__); 2181 ic->ic_flags |= IEEE80211_F_SHPREAMBLE; 2182 ic->ic_flags &= ~IEEE80211_F_USEBARKER; 2183 } 2184 ic->ic_flags_ext |= IEEE80211_FEXT_ERPUPDATE; 2185 } 2186 } 2187} 2188 2189/* 2190 * Handle bookkeeping for station deauthentication/disassociation 2191 * when operating as an ap. 2192 */ 2193void 2194ieee80211_node_leave(struct ieee80211com *ic, struct ieee80211_node *ni) 2195{ 2196 struct ieee80211_node_table *nt = ni->ni_table; 2197 2198 IEEE80211_DPRINTF(ic, IEEE80211_MSG_ASSOC | IEEE80211_MSG_DEBUG, 2199 "[%s] station with aid %d leaves\n", 2200 ether_sprintf(ni->ni_macaddr), IEEE80211_NODE_AID(ni)); 2201 2202 KASSERT(ic->ic_opmode == IEEE80211_M_HOSTAP || 2203 ic->ic_opmode == IEEE80211_M_IBSS || 2204 ic->ic_opmode == IEEE80211_M_AHDEMO, 2205 ("unexpected operating mode %u", ic->ic_opmode)); 2206 /* 2207 * If node wasn't previously associated all 2208 * we need to do is reclaim the reference. 2209 */ 2210 /* XXX ibss mode bypasses 11g and notification */ 2211 if (ni->ni_associd == 0) 2212 goto done; 2213 /* 2214 * Tell the authenticator the station is leaving. 2215 * Note that we must do this before yanking the 2216 * association id as the authenticator uses the 2217 * associd to locate it's state block. 2218 */ 2219 if (ic->ic_auth->ia_node_leave != NULL) 2220 ic->ic_auth->ia_node_leave(ic, ni); 2221 IEEE80211_AID_CLR(ni->ni_associd, ic->ic_aid_bitmap); 2222 ni->ni_associd = 0; 2223 ic->ic_sta_assoc--; 2224 2225 if (ic->ic_curmode == IEEE80211_MODE_11G) 2226 ieee80211_node_leave_11g(ic, ni); 2227 /* 2228 * Cleanup station state. In particular clear various 2229 * state that might otherwise be reused if the node 2230 * is reused before the reference count goes to zero 2231 * (and memory is reclaimed). 2232 */ 2233 ieee80211_sta_leave(ic, ni); 2234done: 2235 /* 2236 * Remove the node from any table it's recorded in and 2237 * drop the caller's reference. Removal from the table 2238 * is important to insure the node is not reprocessed 2239 * for inactivity. 2240 */ 2241 if (nt != NULL) { 2242 IEEE80211_NODE_LOCK(nt); 2243 node_reclaim(nt, ni); 2244 IEEE80211_NODE_UNLOCK(nt); 2245 } else 2246 ieee80211_free_node(ni); 2247} 2248 2249u_int8_t 2250ieee80211_getrssi(struct ieee80211com *ic) 2251{ 2252#define NZ(x) ((x) == 0 ? 1 : (x)) 2253 struct ieee80211_node_table *nt = &ic->ic_sta; 2254 u_int32_t rssi_samples, rssi_total; 2255 struct ieee80211_node *ni; 2256 2257 rssi_total = 0; 2258 rssi_samples = 0; 2259 switch (ic->ic_opmode) { 2260 case IEEE80211_M_IBSS: /* average of all ibss neighbors */ 2261 /* XXX locking */ 2262 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) 2263 if (ni->ni_capinfo & IEEE80211_CAPINFO_IBSS) { 2264 rssi_samples++; 2265 rssi_total += ic->ic_node_getrssi(ni); 2266 } 2267 break; 2268 case IEEE80211_M_AHDEMO: /* average of all neighbors */ 2269 /* XXX locking */ 2270 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) { 2271 rssi_samples++; 2272 rssi_total += ic->ic_node_getrssi(ni); 2273 } 2274 break; 2275 case IEEE80211_M_HOSTAP: /* average of all associated stations */ 2276 /* XXX locking */ 2277 TAILQ_FOREACH(ni, &nt->nt_node, ni_list) 2278 if (IEEE80211_AID(ni->ni_associd) != 0) { 2279 rssi_samples++; 2280 rssi_total += ic->ic_node_getrssi(ni); 2281 } 2282 break; 2283 case IEEE80211_M_MONITOR: /* XXX */ 2284 case IEEE80211_M_STA: /* use stats from associated ap */ 2285 default: 2286 if (ic->ic_bss != NULL) 2287 rssi_total = ic->ic_node_getrssi(ic->ic_bss); 2288 rssi_samples = 1; 2289 break; 2290 } 2291 return rssi_total / NZ(rssi_samples); 2292#undef NZ 2293} 2294 2295/* 2296 * Indicate whether there are frames queued for a station in power-save mode. 2297 */ 2298static void 2299ieee80211_set_tim(struct ieee80211_node *ni, int set) 2300{ 2301 struct ieee80211com *ic = ni->ni_ic; 2302 u_int16_t aid; 2303 2304 KASSERT(ic->ic_opmode == IEEE80211_M_HOSTAP || 2305 ic->ic_opmode == IEEE80211_M_IBSS, 2306 ("operating mode %u", ic->ic_opmode)); 2307 2308 aid = IEEE80211_AID(ni->ni_associd); 2309 KASSERT(aid < ic->ic_max_aid, 2310 ("bogus aid %u, max %u", aid, ic->ic_max_aid)); 2311 2312 IEEE80211_BEACON_LOCK(ic); 2313 if (set != (isset(ic->ic_tim_bitmap, aid) != 0)) { 2314 if (set) { 2315 setbit(ic->ic_tim_bitmap, aid); 2316 ic->ic_ps_pending++; 2317 } else { 2318 clrbit(ic->ic_tim_bitmap, aid); 2319 ic->ic_ps_pending--; 2320 } 2321 ic->ic_flags |= IEEE80211_F_TIMUPDATE; 2322 } 2323 IEEE80211_BEACON_UNLOCK(ic); 2324} 2325 2326/* 2327 * Node table support. 2328 */ 2329 2330static void 2331ieee80211_node_table_init(struct ieee80211com *ic, 2332 struct ieee80211_node_table *nt, 2333 const char *name, int inact, int keyixmax, 2334 void (*timeout)(struct ieee80211_node_table *)) 2335{ 2336 2337 IEEE80211_DPRINTF(ic, IEEE80211_MSG_NODE, 2338 "%s %s table, inact %u\n", __func__, name, inact); 2339 2340 nt->nt_ic = ic; 2341 /* XXX need unit */ 2342 IEEE80211_NODE_LOCK_INIT(nt, ic->ic_ifp->if_xname); 2343 IEEE80211_SCAN_LOCK_INIT(nt, ic->ic_ifp->if_xname); 2344 TAILQ_INIT(&nt->nt_node); 2345 nt->nt_name = name; 2346 nt->nt_scangen = 1; 2347 nt->nt_inact_init = inact; 2348 nt->nt_timeout = timeout; 2349 nt->nt_keyixmax = keyixmax; 2350 if (nt->nt_keyixmax > 0) { 2351 MALLOC(nt->nt_keyixmap, struct ieee80211_node **, 2352 keyixmax * sizeof(struct ieee80211_node *), 2353 M_80211_NODE, M_NOWAIT | M_ZERO); 2354 if (nt->nt_keyixmap == NULL) 2355 if_printf(ic->ic_ifp, 2356 "Cannot allocate key index map with %u entries\n", 2357 keyixmax); 2358 } else 2359 nt->nt_keyixmap = NULL; 2360} 2361 2362void 2363ieee80211_node_table_reset(struct ieee80211_node_table *nt) 2364{ 2365 2366 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE, 2367 "%s %s table\n", __func__, nt->nt_name); 2368 2369 IEEE80211_NODE_LOCK(nt); 2370 nt->nt_inact_timer = 0; 2371 ieee80211_free_allnodes_locked(nt); 2372 IEEE80211_NODE_UNLOCK(nt); 2373} 2374 2375static void 2376ieee80211_node_table_cleanup(struct ieee80211_node_table *nt) 2377{ 2378 2379 IEEE80211_DPRINTF(nt->nt_ic, IEEE80211_MSG_NODE, 2380 "%s %s table\n", __func__, nt->nt_name); 2381 2382 IEEE80211_NODE_LOCK(nt); 2383 ieee80211_free_allnodes_locked(nt); 2384 if (nt->nt_keyixmap != NULL) { 2385 /* XXX verify all entries are NULL */ 2386 int i; 2387 for (i = 0; i < nt->nt_keyixmax; i++) 2388 if (nt->nt_keyixmap[i] != NULL) 2389 printf("%s: %s[%u] still active\n", __func__, 2390 nt->nt_name, i); 2391 FREE(nt->nt_keyixmap, M_80211_NODE); 2392 nt->nt_keyixmap = NULL; 2393 } 2394 IEEE80211_SCAN_LOCK_DESTROY(nt); 2395 IEEE80211_NODE_LOCK_DESTROY(nt); 2396} 2397