bss.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594
  1. /*
  2. * BSS table
  3. * Copyright (c) 2009-2010, Jouni Malinen <j@w1.fi>
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2 as
  7. * published by the Free Software Foundation.
  8. *
  9. * Alternatively, this software may be distributed under the terms of BSD
  10. * license.
  11. *
  12. * See README and COPYING for more details.
  13. */
  14. #include "utils/includes.h"
  15. #include "utils/common.h"
  16. #include "utils/eloop.h"
  17. #include "common/ieee802_11_defs.h"
  18. #include "drivers/driver.h"
  19. #include "wpa_supplicant_i.h"
  20. #include "notify.h"
  21. #include "scan.h"
  22. #include "bss.h"
  23. #ifndef WPA_BSS_MAX_COUNT
  24. #define WPA_BSS_MAX_COUNT 200
  25. #endif /* WPA_BSS_MAX_COUNT */
  26. /**
  27. * WPA_BSS_EXPIRATION_PERIOD - Period of expiration run in seconds
  28. */
  29. #define WPA_BSS_EXPIRATION_PERIOD 10
  30. /**
  31. * WPA_BSS_EXPIRATION_AGE - BSS entry age after which it can be expired
  32. *
  33. * This value control the time in seconds after which a BSS entry gets removed
  34. * if it has not been updated or is not in use.
  35. */
  36. #define WPA_BSS_EXPIRATION_AGE 180
  37. /**
  38. * WPA_BSS_EXPIRATION_SCAN_COUNT - Expire BSS after number of scans
  39. *
  40. * If the BSS entry has not been seen in this many scans, it will be removed.
  41. * Value 1 means that the entry is removed after the first scan without the
  42. * BSSID being seen. Larger values can be used to avoid BSS entries
  43. * disappearing if they are not visible in every scan (e.g., low signal quality
  44. * or interference).
  45. */
  46. #define WPA_BSS_EXPIRATION_SCAN_COUNT 2
  47. #define WPA_BSS_FREQ_CHANGED_FLAG BIT(0)
  48. #define WPA_BSS_SIGNAL_CHANGED_FLAG BIT(1)
  49. #define WPA_BSS_PRIVACY_CHANGED_FLAG BIT(2)
  50. #define WPA_BSS_MODE_CHANGED_FLAG BIT(3)
  51. #define WPA_BSS_WPAIE_CHANGED_FLAG BIT(4)
  52. #define WPA_BSS_RSNIE_CHANGED_FLAG BIT(5)
  53. #define WPA_BSS_WPS_CHANGED_FLAG BIT(6)
  54. #define WPA_BSS_RATES_CHANGED_FLAG BIT(7)
  55. static void wpa_bss_remove(struct wpa_supplicant *wpa_s, struct wpa_bss *bss)
  56. {
  57. dl_list_del(&bss->list);
  58. dl_list_del(&bss->list_id);
  59. wpa_s->num_bss--;
  60. wpa_printf(MSG_DEBUG, "BSS: Remove id %u BSSID " MACSTR " SSID '%s'",
  61. bss->id, MAC2STR(bss->bssid),
  62. wpa_ssid_txt(bss->ssid, bss->ssid_len));
  63. wpas_notify_bss_removed(wpa_s, bss->bssid, bss->id);
  64. os_free(bss);
  65. }
  66. struct wpa_bss * wpa_bss_get(struct wpa_supplicant *wpa_s, const u8 *bssid,
  67. const u8 *ssid, size_t ssid_len)
  68. {
  69. struct wpa_bss *bss;
  70. dl_list_for_each(bss, &wpa_s->bss, struct wpa_bss, list) {
  71. if (os_memcmp(bss->bssid, bssid, ETH_ALEN) == 0 &&
  72. bss->ssid_len == ssid_len &&
  73. os_memcmp(bss->ssid, ssid, ssid_len) == 0)
  74. return bss;
  75. }
  76. return NULL;
  77. }
  78. static void wpa_bss_copy_res(struct wpa_bss *dst, struct wpa_scan_res *src)
  79. {
  80. os_time_t usec;
  81. dst->flags = src->flags;
  82. os_memcpy(dst->bssid, src->bssid, ETH_ALEN);
  83. dst->freq = src->freq;
  84. dst->beacon_int = src->beacon_int;
  85. dst->caps = src->caps;
  86. dst->qual = src->qual;
  87. dst->noise = src->noise;
  88. dst->level = src->level;
  89. dst->tsf = src->tsf;
  90. os_get_time(&dst->last_update);
  91. dst->last_update.sec -= src->age / 1000;
  92. usec = (src->age % 1000) * 1000;
  93. if (dst->last_update.usec < usec) {
  94. dst->last_update.sec--;
  95. dst->last_update.usec += 1000000;
  96. }
  97. dst->last_update.usec -= usec;
  98. }
  99. static void wpa_bss_add(struct wpa_supplicant *wpa_s,
  100. const u8 *ssid, size_t ssid_len,
  101. struct wpa_scan_res *res)
  102. {
  103. struct wpa_bss *bss;
  104. bss = os_zalloc(sizeof(*bss) + res->ie_len);
  105. if (bss == NULL)
  106. return;
  107. bss->id = wpa_s->bss_next_id++;
  108. bss->last_update_idx = wpa_s->bss_update_idx;
  109. wpa_bss_copy_res(bss, res);
  110. os_memcpy(bss->ssid, ssid, ssid_len);
  111. bss->ssid_len = ssid_len;
  112. bss->ie_len = res->ie_len;
  113. os_memcpy(bss + 1, res + 1, res->ie_len);
  114. dl_list_add_tail(&wpa_s->bss, &bss->list);
  115. dl_list_add_tail(&wpa_s->bss_id, &bss->list_id);
  116. wpa_s->num_bss++;
  117. wpa_printf(MSG_DEBUG, "BSS: Add new id %u BSSID " MACSTR " SSID '%s'",
  118. bss->id, MAC2STR(bss->bssid), wpa_ssid_txt(ssid, ssid_len));
  119. wpas_notify_bss_added(wpa_s, bss->bssid, bss->id);
  120. if (wpa_s->num_bss > WPA_BSS_MAX_COUNT) {
  121. /* Remove the oldest entry */
  122. wpa_bss_remove(wpa_s, dl_list_first(&wpa_s->bss,
  123. struct wpa_bss, list));
  124. }
  125. }
  126. static int are_ies_equal(const struct wpa_bss *old,
  127. const struct wpa_scan_res *new, u32 ie)
  128. {
  129. const u8 *old_ie, *new_ie;
  130. struct wpabuf *old_ie_buff = NULL;
  131. struct wpabuf *new_ie_buff = NULL;
  132. int new_ie_len, old_ie_len, ret, is_multi;
  133. switch (ie) {
  134. case WPA_IE_VENDOR_TYPE:
  135. old_ie = wpa_bss_get_vendor_ie(old, ie);
  136. new_ie = wpa_scan_get_vendor_ie(new, ie);
  137. is_multi = 0;
  138. break;
  139. case WPS_IE_VENDOR_TYPE:
  140. old_ie_buff = wpa_bss_get_vendor_ie_multi(old, ie);
  141. new_ie_buff = wpa_scan_get_vendor_ie_multi(new, ie);
  142. is_multi = 1;
  143. break;
  144. case WLAN_EID_RSN:
  145. case WLAN_EID_SUPP_RATES:
  146. case WLAN_EID_EXT_SUPP_RATES:
  147. old_ie = wpa_bss_get_ie(old, ie);
  148. new_ie = wpa_scan_get_ie(new, ie);
  149. is_multi = 0;
  150. break;
  151. default:
  152. wpa_printf(MSG_DEBUG, "bss: %s: cannot compare IEs", __func__);
  153. return 0;
  154. }
  155. if (is_multi) {
  156. /* in case of multiple IEs stored in buffer */
  157. old_ie = old_ie_buff ? wpabuf_head_u8(old_ie_buff) : NULL;
  158. new_ie = new_ie_buff ? wpabuf_head_u8(new_ie_buff) : NULL;
  159. old_ie_len = old_ie_buff ? wpabuf_len(old_ie_buff) : 0;
  160. new_ie_len = new_ie_buff ? wpabuf_len(new_ie_buff) : 0;
  161. } else {
  162. /* in case of single IE */
  163. old_ie_len = old_ie ? old_ie[1] + 2 : 0;
  164. new_ie_len = new_ie ? new_ie[1] + 2 : 0;
  165. }
  166. ret = (old_ie_len == new_ie_len &&
  167. os_memcmp(old_ie, new_ie, old_ie_len) == 0);
  168. wpabuf_free(old_ie_buff);
  169. wpabuf_free(new_ie_buff);
  170. return ret;
  171. }
  172. static u32 wpa_bss_compare_res(const struct wpa_bss *old,
  173. const struct wpa_scan_res *new)
  174. {
  175. u32 changes = 0;
  176. int caps_diff = old->caps ^ new->caps;
  177. if (old->freq != new->freq)
  178. changes |= WPA_BSS_FREQ_CHANGED_FLAG;
  179. if (old->level != new->level)
  180. changes |= WPA_BSS_SIGNAL_CHANGED_FLAG;
  181. if (caps_diff & IEEE80211_CAP_PRIVACY)
  182. changes |= WPA_BSS_PRIVACY_CHANGED_FLAG;
  183. if (caps_diff & IEEE80211_CAP_IBSS)
  184. changes |= WPA_BSS_MODE_CHANGED_FLAG;
  185. if (!are_ies_equal(old, new, WPA_IE_VENDOR_TYPE))
  186. changes |= WPA_BSS_WPAIE_CHANGED_FLAG;
  187. if (!are_ies_equal(old, new, WLAN_EID_RSN))
  188. changes |= WPA_BSS_RSNIE_CHANGED_FLAG;
  189. if (!are_ies_equal(old, new, WPS_IE_VENDOR_TYPE))
  190. changes |= WPA_BSS_WPS_CHANGED_FLAG;
  191. if (!are_ies_equal(old, new, WLAN_EID_SUPP_RATES) ||
  192. !are_ies_equal(old, new, WLAN_EID_EXT_SUPP_RATES))
  193. changes |= WPA_BSS_RATES_CHANGED_FLAG;
  194. return changes;
  195. }
  196. static void notify_bss_changes(struct wpa_supplicant *wpa_s, u32 changes,
  197. const struct wpa_bss *bss)
  198. {
  199. if (changes & WPA_BSS_FREQ_CHANGED_FLAG)
  200. wpas_notify_bss_freq_changed(wpa_s, bss->id);
  201. if (changes & WPA_BSS_SIGNAL_CHANGED_FLAG)
  202. wpas_notify_bss_signal_changed(wpa_s, bss->id);
  203. if (changes & WPA_BSS_PRIVACY_CHANGED_FLAG)
  204. wpas_notify_bss_privacy_changed(wpa_s, bss->id);
  205. if (changes & WPA_BSS_MODE_CHANGED_FLAG)
  206. wpas_notify_bss_mode_changed(wpa_s, bss->id);
  207. if (changes & WPA_BSS_WPAIE_CHANGED_FLAG)
  208. wpas_notify_bss_wpaie_changed(wpa_s, bss->id);
  209. if (changes & WPA_BSS_RSNIE_CHANGED_FLAG)
  210. wpas_notify_bss_rsnie_changed(wpa_s, bss->id);
  211. if (changes & WPA_BSS_WPS_CHANGED_FLAG)
  212. wpas_notify_bss_wps_changed(wpa_s, bss->id);
  213. if (changes & WPA_BSS_RATES_CHANGED_FLAG)
  214. wpas_notify_bss_rates_changed(wpa_s, bss->id);
  215. }
  216. static void wpa_bss_update(struct wpa_supplicant *wpa_s, struct wpa_bss *bss,
  217. struct wpa_scan_res *res)
  218. {
  219. u32 changes;
  220. changes = wpa_bss_compare_res(bss, res);
  221. bss->scan_miss_count = 0;
  222. bss->last_update_idx = wpa_s->bss_update_idx;
  223. wpa_bss_copy_res(bss, res);
  224. /* Move the entry to the end of the list */
  225. dl_list_del(&bss->list);
  226. if (bss->ie_len >= res->ie_len) {
  227. os_memcpy(bss + 1, res + 1, res->ie_len);
  228. bss->ie_len = res->ie_len;
  229. } else {
  230. struct wpa_bss *nbss;
  231. struct dl_list *prev = bss->list_id.prev;
  232. dl_list_del(&bss->list_id);
  233. nbss = os_realloc(bss, sizeof(*bss) + res->ie_len);
  234. if (nbss) {
  235. bss = nbss;
  236. os_memcpy(bss + 1, res + 1, res->ie_len);
  237. bss->ie_len = res->ie_len;
  238. }
  239. dl_list_add(prev, &bss->list_id);
  240. }
  241. dl_list_add_tail(&wpa_s->bss, &bss->list);
  242. notify_bss_changes(wpa_s, changes, bss);
  243. }
  244. static int wpa_bss_in_use(struct wpa_supplicant *wpa_s, struct wpa_bss *bss)
  245. {
  246. return bss == wpa_s->current_bss ||
  247. os_memcmp(bss->bssid, wpa_s->bssid, ETH_ALEN) == 0 ||
  248. os_memcmp(bss->bssid, wpa_s->pending_bssid, ETH_ALEN) == 0;
  249. }
  250. void wpa_bss_update_start(struct wpa_supplicant *wpa_s)
  251. {
  252. wpa_s->bss_update_idx++;
  253. wpa_printf(MSG_DEBUG, "BSS: Start scan result update %u",
  254. wpa_s->bss_update_idx);
  255. }
  256. void wpa_bss_update_scan_res(struct wpa_supplicant *wpa_s,
  257. struct wpa_scan_res *res)
  258. {
  259. const u8 *ssid;
  260. struct wpa_bss *bss;
  261. ssid = wpa_scan_get_ie(res, WLAN_EID_SSID);
  262. if (ssid == NULL) {
  263. wpa_printf(MSG_DEBUG, "BSS: No SSID IE included for " MACSTR,
  264. MAC2STR(res->bssid));
  265. return;
  266. }
  267. if (ssid[1] > 32) {
  268. wpa_printf(MSG_DEBUG, "BSS: Too long SSID IE included for "
  269. MACSTR, MAC2STR(res->bssid));
  270. return;
  271. }
  272. /* TODO: add option for ignoring BSSes we are not interested in
  273. * (to save memory) */
  274. bss = wpa_bss_get(wpa_s, res->bssid, ssid + 2, ssid[1]);
  275. if (bss == NULL)
  276. wpa_bss_add(wpa_s, ssid + 2, ssid[1], res);
  277. else
  278. wpa_bss_update(wpa_s, bss, res);
  279. }
  280. static int wpa_bss_included_in_scan(const struct wpa_bss *bss,
  281. const struct scan_info *info)
  282. {
  283. int found;
  284. size_t i;
  285. if (info == NULL)
  286. return 1;
  287. if (info->num_freqs) {
  288. found = 0;
  289. for (i = 0; i < info->num_freqs; i++) {
  290. if (bss->freq == info->freqs[i]) {
  291. found = 1;
  292. break;
  293. }
  294. }
  295. if (!found)
  296. return 0;
  297. }
  298. if (info->num_ssids) {
  299. found = 0;
  300. for (i = 0; i < info->num_ssids; i++) {
  301. const struct wpa_driver_scan_ssid *s = &info->ssids[i];
  302. if ((s->ssid == NULL || s->ssid_len == 0) ||
  303. (s->ssid_len == bss->ssid_len &&
  304. os_memcmp(s->ssid, bss->ssid, bss->ssid_len) ==
  305. 0)) {
  306. found = 1;
  307. break;
  308. }
  309. }
  310. if (!found)
  311. return 0;
  312. }
  313. return 1;
  314. }
  315. void wpa_bss_update_end(struct wpa_supplicant *wpa_s, struct scan_info *info,
  316. int new_scan)
  317. {
  318. struct wpa_bss *bss, *n;
  319. if (!new_scan)
  320. return; /* do not expire entries without new scan */
  321. dl_list_for_each_safe(bss, n, &wpa_s->bss, struct wpa_bss, list) {
  322. if (wpa_bss_in_use(wpa_s, bss))
  323. continue;
  324. if (!wpa_bss_included_in_scan(bss, info))
  325. continue; /* expire only BSSes that were scanned */
  326. if (bss->last_update_idx < wpa_s->bss_update_idx)
  327. bss->scan_miss_count++;
  328. if (bss->scan_miss_count >= WPA_BSS_EXPIRATION_SCAN_COUNT) {
  329. wpa_printf(MSG_DEBUG, "BSS: Expire BSS %u due to no "
  330. "match in scan", bss->id);
  331. wpa_bss_remove(wpa_s, bss);
  332. }
  333. }
  334. }
  335. static void wpa_bss_timeout(void *eloop_ctx, void *timeout_ctx)
  336. {
  337. struct wpa_supplicant *wpa_s = eloop_ctx;
  338. struct wpa_bss *bss, *n;
  339. struct os_time t;
  340. if (dl_list_empty(&wpa_s->bss))
  341. return;
  342. os_get_time(&t);
  343. t.sec -= WPA_BSS_EXPIRATION_AGE;
  344. dl_list_for_each_safe(bss, n, &wpa_s->bss, struct wpa_bss, list) {
  345. if (wpa_bss_in_use(wpa_s, bss))
  346. continue;
  347. if (os_time_before(&bss->last_update, &t)) {
  348. wpa_printf(MSG_DEBUG, "BSS: Expire BSS %u due to age",
  349. bss->id);
  350. wpa_bss_remove(wpa_s, bss);
  351. } else
  352. break;
  353. }
  354. eloop_register_timeout(WPA_BSS_EXPIRATION_PERIOD, 0,
  355. wpa_bss_timeout, wpa_s, NULL);
  356. }
  357. int wpa_bss_init(struct wpa_supplicant *wpa_s)
  358. {
  359. dl_list_init(&wpa_s->bss);
  360. dl_list_init(&wpa_s->bss_id);
  361. eloop_register_timeout(WPA_BSS_EXPIRATION_PERIOD, 0,
  362. wpa_bss_timeout, wpa_s, NULL);
  363. return 0;
  364. }
  365. void wpa_bss_deinit(struct wpa_supplicant *wpa_s)
  366. {
  367. struct wpa_bss *bss, *n;
  368. eloop_cancel_timeout(wpa_bss_timeout, wpa_s, NULL);
  369. if (wpa_s->bss.next == NULL)
  370. return; /* BSS table not yet initialized */
  371. dl_list_for_each_safe(bss, n, &wpa_s->bss, struct wpa_bss, list)
  372. wpa_bss_remove(wpa_s, bss);
  373. }
  374. struct wpa_bss * wpa_bss_get_bssid(struct wpa_supplicant *wpa_s,
  375. const u8 *bssid)
  376. {
  377. struct wpa_bss *bss;
  378. dl_list_for_each(bss, &wpa_s->bss, struct wpa_bss, list) {
  379. if (os_memcmp(bss->bssid, bssid, ETH_ALEN) == 0)
  380. return bss;
  381. }
  382. return NULL;
  383. }
  384. struct wpa_bss * wpa_bss_get_id(struct wpa_supplicant *wpa_s, unsigned int id)
  385. {
  386. struct wpa_bss *bss;
  387. dl_list_for_each(bss, &wpa_s->bss, struct wpa_bss, list) {
  388. if (bss->id == id)
  389. return bss;
  390. }
  391. return NULL;
  392. }
  393. const u8 * wpa_bss_get_ie(const struct wpa_bss *bss, u8 ie)
  394. {
  395. const u8 *end, *pos;
  396. pos = (const u8 *) (bss + 1);
  397. end = pos + bss->ie_len;
  398. while (pos + 1 < end) {
  399. if (pos + 2 + pos[1] > end)
  400. break;
  401. if (pos[0] == ie)
  402. return pos;
  403. pos += 2 + pos[1];
  404. }
  405. return NULL;
  406. }
  407. const u8 * wpa_bss_get_vendor_ie(const struct wpa_bss *bss, u32 vendor_type)
  408. {
  409. const u8 *end, *pos;
  410. pos = (const u8 *) (bss + 1);
  411. end = pos + bss->ie_len;
  412. while (pos + 1 < end) {
  413. if (pos + 2 + pos[1] > end)
  414. break;
  415. if (pos[0] == WLAN_EID_VENDOR_SPECIFIC && pos[1] >= 4 &&
  416. vendor_type == WPA_GET_BE32(&pos[2]))
  417. return pos;
  418. pos += 2 + pos[1];
  419. }
  420. return NULL;
  421. }
  422. struct wpabuf * wpa_bss_get_vendor_ie_multi(const struct wpa_bss *bss,
  423. u32 vendor_type)
  424. {
  425. struct wpabuf *buf;
  426. const u8 *end, *pos;
  427. buf = wpabuf_alloc(bss->ie_len);
  428. if (buf == NULL)
  429. return NULL;
  430. pos = (const u8 *) (bss + 1);
  431. end = pos + bss->ie_len;
  432. while (pos + 1 < end) {
  433. if (pos + 2 + pos[1] > end)
  434. break;
  435. if (pos[0] == WLAN_EID_VENDOR_SPECIFIC && pos[1] >= 4 &&
  436. vendor_type == WPA_GET_BE32(&pos[2]))
  437. wpabuf_put_data(buf, pos + 2 + 4, pos[1] - 4);
  438. pos += 2 + pos[1];
  439. }
  440. if (wpabuf_len(buf) == 0) {
  441. wpabuf_free(buf);
  442. buf = NULL;
  443. }
  444. return buf;
  445. }
  446. int wpa_bss_get_max_rate(const struct wpa_bss *bss)
  447. {
  448. int rate = 0;
  449. const u8 *ie;
  450. int i;
  451. ie = wpa_bss_get_ie(bss, WLAN_EID_SUPP_RATES);
  452. for (i = 0; ie && i < ie[1]; i++) {
  453. if ((ie[i + 2] & 0x7f) > rate)
  454. rate = ie[i + 2] & 0x7f;
  455. }
  456. ie = wpa_bss_get_ie(bss, WLAN_EID_EXT_SUPP_RATES);
  457. for (i = 0; ie && i < ie[1]; i++) {
  458. if ((ie[i + 2] & 0x7f) > rate)
  459. rate = ie[i + 2] & 0x7f;
  460. }
  461. return rate;
  462. }
  463. int wpa_bss_get_bit_rates(const struct wpa_bss *bss, u8 **rates)
  464. {
  465. const u8 *ie, *ie2;
  466. int i, j;
  467. unsigned int len;
  468. u8 *r;
  469. ie = wpa_bss_get_ie(bss, WLAN_EID_SUPP_RATES);
  470. ie2 = wpa_bss_get_ie(bss, WLAN_EID_EXT_SUPP_RATES);
  471. len = (ie ? ie[1] : 0) + (ie2 ? ie2[1] : 0);
  472. r = os_malloc(len);
  473. if (!r)
  474. return -1;
  475. for (i = 0; ie && i < ie[1]; i++)
  476. r[i] = ie[i + 2] & 0x7f;
  477. for (j = 0; ie2 && j < ie2[1]; j++)
  478. r[i + j] = ie2[j + 2] & 0x7f;
  479. *rates = r;
  480. return len;
  481. }