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