peer.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459
  1. // SPDX-License-Identifier: BSD-3-Clause-Clear
  2. /*
  3. * Copyright (c) 2018-2021 The Linux Foundation. All rights reserved.
  4. * Copyright (c) Qualcomm Technologies, Inc. and/or its subsidiaries.
  5. */
  6. #include "core.h"
  7. #include "peer.h"
  8. #include "debug.h"
  9. #include "debugfs.h"
  10. static int ath12k_wait_for_dp_link_peer_common(struct ath12k_base *ab, int vdev_id,
  11. const u8 *addr, bool expect_mapped)
  12. {
  13. int ret;
  14. struct ath12k_dp *dp = ath12k_ab_to_dp(ab);
  15. ret = wait_event_timeout(ab->peer_mapping_wq, ({
  16. bool mapped;
  17. spin_lock_bh(&dp->dp_lock);
  18. mapped = !!ath12k_dp_link_peer_find_by_vdev_and_addr(dp,
  19. vdev_id,
  20. addr);
  21. spin_unlock_bh(&dp->dp_lock);
  22. (mapped == expect_mapped ||
  23. test_bit(ATH12K_FLAG_CRASH_FLUSH, &ab->dev_flags));
  24. }), 3 * HZ);
  25. if (ret <= 0)
  26. return -ETIMEDOUT;
  27. return 0;
  28. }
  29. void ath12k_peer_cleanup(struct ath12k *ar, u32 vdev_id)
  30. {
  31. struct ath12k_dp_link_peer *peer, *tmp;
  32. struct ath12k_base *ab = ar->ab;
  33. struct ath12k_dp *dp = ath12k_ab_to_dp(ab);
  34. lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
  35. spin_lock_bh(&dp->dp_lock);
  36. list_for_each_entry_safe(peer, tmp, &dp->peers, list) {
  37. if (peer->vdev_id != vdev_id)
  38. continue;
  39. ath12k_warn(ab, "removing stale peer %pM from vdev_id %d\n",
  40. peer->addr, vdev_id);
  41. ath12k_dp_link_peer_free(peer);
  42. ar->num_peers--;
  43. }
  44. spin_unlock_bh(&dp->dp_lock);
  45. }
  46. static int ath12k_wait_for_peer_deleted(struct ath12k *ar, int vdev_id, const u8 *addr)
  47. {
  48. return ath12k_wait_for_dp_link_peer_common(ar->ab, vdev_id, addr, false);
  49. }
  50. int ath12k_wait_for_peer_delete_done(struct ath12k *ar, u32 vdev_id,
  51. const u8 *addr)
  52. {
  53. int ret;
  54. unsigned long time_left;
  55. ret = ath12k_wait_for_peer_deleted(ar, vdev_id, addr);
  56. if (ret) {
  57. ath12k_warn(ar->ab, "failed wait for peer deleted");
  58. return ret;
  59. }
  60. time_left = wait_for_completion_timeout(&ar->peer_delete_done,
  61. 3 * HZ);
  62. if (time_left == 0) {
  63. ath12k_warn(ar->ab, "Timeout in receiving peer delete response\n");
  64. return -ETIMEDOUT;
  65. }
  66. return 0;
  67. }
  68. static int ath12k_peer_delete_send(struct ath12k *ar, u32 vdev_id, const u8 *addr)
  69. {
  70. struct ath12k_base *ab = ar->ab;
  71. int ret;
  72. lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
  73. reinit_completion(&ar->peer_delete_done);
  74. ret = ath12k_wmi_send_peer_delete_cmd(ar, addr, vdev_id);
  75. if (ret) {
  76. ath12k_warn(ab,
  77. "failed to delete peer vdev_id %d addr %pM ret %d\n",
  78. vdev_id, addr, ret);
  79. return ret;
  80. }
  81. return 0;
  82. }
  83. int ath12k_peer_delete(struct ath12k *ar, u32 vdev_id, u8 *addr)
  84. {
  85. int ret;
  86. lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
  87. ath12k_dp_link_peer_unassign(ath12k_ab_to_dp(ar->ab),
  88. &(ath12k_ar_to_ah(ar)->dp_hw), vdev_id,
  89. addr, ar->hw_link_id);
  90. ret = ath12k_peer_delete_send(ar, vdev_id, addr);
  91. if (ret)
  92. return ret;
  93. ret = ath12k_wait_for_peer_delete_done(ar, vdev_id, addr);
  94. if (ret)
  95. return ret;
  96. ar->num_peers--;
  97. return 0;
  98. }
  99. static int ath12k_wait_for_peer_created(struct ath12k *ar, int vdev_id, const u8 *addr)
  100. {
  101. return ath12k_wait_for_dp_link_peer_common(ar->ab, vdev_id, addr, true);
  102. }
  103. int ath12k_peer_create(struct ath12k *ar, struct ath12k_link_vif *arvif,
  104. struct ieee80211_sta *sta,
  105. struct ath12k_wmi_peer_create_arg *arg)
  106. {
  107. struct ieee80211_vif *vif = ath12k_ahvif_to_vif(arvif->ahvif);
  108. struct ath12k_vif *ahvif = arvif->ahvif;
  109. struct ath12k_dp_link_vif *dp_link_vif;
  110. struct ath12k_link_sta *arsta;
  111. u8 link_id = arvif->link_id;
  112. struct ath12k_dp_link_peer *peer;
  113. struct ath12k_sta *ahsta;
  114. u16 ml_peer_id;
  115. int ret;
  116. struct ath12k_dp *dp = ath12k_ab_to_dp(ar->ab);
  117. lockdep_assert_wiphy(ath12k_ar_to_hw(ar)->wiphy);
  118. dp_link_vif = ath12k_dp_vif_to_dp_link_vif(&ahvif->dp_vif, link_id);
  119. if (ar->num_peers > (ar->max_num_peers - 1)) {
  120. ath12k_warn(ar->ab,
  121. "failed to create peer due to insufficient peer entry resource in firmware\n");
  122. return -ENOBUFS;
  123. }
  124. spin_lock_bh(&dp->dp_lock);
  125. peer = ath12k_dp_link_peer_find_by_pdev_and_addr(dp, ar->pdev_idx,
  126. arg->peer_addr);
  127. if (peer) {
  128. spin_unlock_bh(&dp->dp_lock);
  129. return -EINVAL;
  130. }
  131. spin_unlock_bh(&dp->dp_lock);
  132. ret = ath12k_wmi_send_peer_create_cmd(ar, arg);
  133. if (ret) {
  134. ath12k_warn(ar->ab,
  135. "failed to send peer create vdev_id %d ret %d\n",
  136. arg->vdev_id, ret);
  137. return ret;
  138. }
  139. ret = ath12k_wait_for_peer_created(ar, arg->vdev_id,
  140. arg->peer_addr);
  141. if (ret)
  142. return ret;
  143. spin_lock_bh(&dp->dp_lock);
  144. peer = ath12k_dp_link_peer_find_by_vdev_and_addr(dp, arg->vdev_id,
  145. arg->peer_addr);
  146. if (!peer) {
  147. spin_unlock_bh(&dp->dp_lock);
  148. ath12k_warn(ar->ab, "failed to find peer %pM on vdev %i after creation\n",
  149. arg->peer_addr, arg->vdev_id);
  150. reinit_completion(&ar->peer_delete_done);
  151. ret = ath12k_wmi_send_peer_delete_cmd(ar, arg->peer_addr,
  152. arg->vdev_id);
  153. if (ret) {
  154. ath12k_warn(ar->ab, "failed to delete peer vdev_id %d addr %pM\n",
  155. arg->vdev_id, arg->peer_addr);
  156. return ret;
  157. }
  158. ret = ath12k_wait_for_peer_delete_done(ar, arg->vdev_id,
  159. arg->peer_addr);
  160. if (ret)
  161. return ret;
  162. return -ENOENT;
  163. }
  164. peer->pdev_idx = ar->pdev_idx;
  165. peer->sta = sta;
  166. if (vif->type == NL80211_IFTYPE_STATION) {
  167. dp_link_vif->ast_hash = peer->ast_hash;
  168. dp_link_vif->ast_idx = peer->hw_peer_id;
  169. }
  170. if (sta) {
  171. ahsta = ath12k_sta_to_ahsta(sta);
  172. arsta = wiphy_dereference(ath12k_ar_to_hw(ar)->wiphy,
  173. ahsta->link[link_id]);
  174. peer->link_id = arsta->link_id;
  175. /* Fill ML info into created peer */
  176. if (sta->mlo) {
  177. ml_peer_id = ahsta->ml_peer_id;
  178. peer->ml_id = ml_peer_id | ATH12K_PEER_ML_ID_VALID;
  179. ether_addr_copy(peer->ml_addr, sta->addr);
  180. /* the assoc link is considered primary for now */
  181. peer->primary_link = arsta->is_assoc_link;
  182. peer->mlo = true;
  183. } else {
  184. peer->ml_id = ATH12K_MLO_PEER_ID_INVALID;
  185. peer->primary_link = true;
  186. peer->mlo = false;
  187. }
  188. }
  189. ar->num_peers++;
  190. spin_unlock_bh(&dp->dp_lock);
  191. if (arvif->link_id < IEEE80211_MLD_MAX_NUM_LINKS) {
  192. ret = ath12k_dp_link_peer_assign(ath12k_ab_to_dp(ar->ab),
  193. &(ath12k_ar_to_ah(ar)->dp_hw),
  194. arvif->vdev_id, sta,
  195. (u8 *)arg->peer_addr, link_id,
  196. ar->hw_link_id);
  197. }
  198. return ret;
  199. }
  200. u16 ath12k_peer_ml_alloc(struct ath12k_hw *ah)
  201. {
  202. u16 ml_peer_id;
  203. lockdep_assert_wiphy(ah->hw->wiphy);
  204. for (ml_peer_id = 0; ml_peer_id < ATH12K_MAX_MLO_PEERS; ml_peer_id++) {
  205. if (test_bit(ml_peer_id, ah->free_ml_peer_id_map))
  206. continue;
  207. set_bit(ml_peer_id, ah->free_ml_peer_id_map);
  208. break;
  209. }
  210. if (ml_peer_id == ATH12K_MAX_MLO_PEERS)
  211. ml_peer_id = ATH12K_MLO_PEER_ID_INVALID;
  212. return ml_peer_id;
  213. }
  214. int ath12k_peer_mlo_link_peers_delete(struct ath12k_vif *ahvif, struct ath12k_sta *ahsta)
  215. {
  216. struct ieee80211_sta *sta = ath12k_ahsta_to_sta(ahsta);
  217. struct ath12k_hw *ah = ahvif->ah;
  218. struct ath12k_link_vif *arvif;
  219. struct ath12k_link_sta *arsta;
  220. unsigned long links;
  221. struct ath12k *ar;
  222. int ret, err_ret = 0;
  223. u8 link_id;
  224. lockdep_assert_wiphy(ah->hw->wiphy);
  225. if (!sta->mlo)
  226. return -EINVAL;
  227. /* FW expects delete of all link peers at once before waiting for reception
  228. * of peer unmap or delete responses
  229. */
  230. links = ahsta->links_map;
  231. for_each_set_bit(link_id, &links, IEEE80211_MLD_MAX_NUM_LINKS) {
  232. arvif = wiphy_dereference(ah->hw->wiphy, ahvif->link[link_id]);
  233. arsta = wiphy_dereference(ah->hw->wiphy, ahsta->link[link_id]);
  234. if (!arvif || !arsta)
  235. continue;
  236. ar = arvif->ar;
  237. if (!ar)
  238. continue;
  239. ath12k_dp_peer_cleanup(ar, arvif->vdev_id, arsta->addr);
  240. ath12k_dp_link_peer_unassign(ath12k_ab_to_dp(ar->ab),
  241. &(ath12k_ar_to_ah(ar)->dp_hw),
  242. arvif->vdev_id, arsta->addr,
  243. ar->hw_link_id);
  244. ret = ath12k_peer_delete_send(ar, arvif->vdev_id, arsta->addr);
  245. if (ret) {
  246. ath12k_warn(ar->ab,
  247. "failed to delete peer vdev_id %d addr %pM ret %d\n",
  248. arvif->vdev_id, arsta->addr, ret);
  249. err_ret = ret;
  250. continue;
  251. }
  252. }
  253. /* Ensure all link peers are deleted and unmapped */
  254. links = ahsta->links_map;
  255. for_each_set_bit(link_id, &links, IEEE80211_MLD_MAX_NUM_LINKS) {
  256. arvif = wiphy_dereference(ah->hw->wiphy, ahvif->link[link_id]);
  257. arsta = wiphy_dereference(ah->hw->wiphy, ahsta->link[link_id]);
  258. if (!arvif || !arsta)
  259. continue;
  260. ar = arvif->ar;
  261. if (!ar)
  262. continue;
  263. ret = ath12k_wait_for_peer_delete_done(ar, arvif->vdev_id, arsta->addr);
  264. if (ret) {
  265. err_ret = ret;
  266. continue;
  267. }
  268. ar->num_peers--;
  269. }
  270. return err_ret;
  271. }
  272. static int ath12k_link_sta_rhash_insert(struct ath12k_base *ab,
  273. struct ath12k_link_sta *arsta)
  274. {
  275. struct ath12k_link_sta *tmp;
  276. lockdep_assert_held(&ab->base_lock);
  277. tmp = rhashtable_lookup_get_insert_fast(ab->rhead_sta_addr, &arsta->rhash_addr,
  278. ab->rhash_sta_addr_param);
  279. if (!tmp)
  280. return 0;
  281. else if (IS_ERR(tmp))
  282. return PTR_ERR(tmp);
  283. else
  284. return -EEXIST;
  285. }
  286. static int ath12k_link_sta_rhash_remove(struct ath12k_base *ab,
  287. struct ath12k_link_sta *arsta)
  288. {
  289. int ret;
  290. lockdep_assert_held(&ab->base_lock);
  291. ret = rhashtable_remove_fast(ab->rhead_sta_addr, &arsta->rhash_addr,
  292. ab->rhash_sta_addr_param);
  293. if (ret && ret != -ENOENT)
  294. return ret;
  295. return 0;
  296. }
  297. int ath12k_link_sta_rhash_add(struct ath12k_base *ab,
  298. struct ath12k_link_sta *arsta)
  299. {
  300. int ret;
  301. lockdep_assert_held(&ab->base_lock);
  302. ret = ath12k_link_sta_rhash_insert(ab, arsta);
  303. if (ret)
  304. ath12k_warn(ab, "failed to add arsta %pM in rhash_addr ret %d\n",
  305. arsta->addr, ret);
  306. return ret;
  307. }
  308. void ath12k_link_sta_rhash_delete(struct ath12k_base *ab,
  309. struct ath12k_link_sta *arsta)
  310. {
  311. /*
  312. * Return type of this function is void since there is nothing to be
  313. * done in failure case
  314. */
  315. int ret;
  316. lockdep_assert_held(&ab->base_lock);
  317. ret = ath12k_link_sta_rhash_remove(ab, arsta);
  318. if (ret)
  319. ath12k_warn(ab,
  320. "failed to remove arsta %pM in rhash_addr ret %d\n",
  321. arsta->addr, ret);
  322. }
  323. int ath12k_link_sta_rhash_tbl_init(struct ath12k_base *ab)
  324. {
  325. struct rhashtable_params *param;
  326. struct rhashtable *rhash_addr_tbl;
  327. int ret;
  328. rhash_addr_tbl = kzalloc_obj(*ab->rhead_sta_addr);
  329. if (!rhash_addr_tbl)
  330. return -ENOMEM;
  331. param = &ab->rhash_sta_addr_param;
  332. param->key_offset = offsetof(struct ath12k_link_sta, addr);
  333. param->head_offset = offsetof(struct ath12k_link_sta, rhash_addr);
  334. param->key_len = sizeof_field(struct ath12k_link_sta, addr);
  335. param->automatic_shrinking = true;
  336. param->nelem_hint = ab->num_radios * ath12k_core_get_max_peers_per_radio(ab);
  337. ret = rhashtable_init(rhash_addr_tbl, param);
  338. if (ret) {
  339. ath12k_warn(ab, "failed to init peer addr rhash table %d\n",
  340. ret);
  341. goto err_free;
  342. }
  343. ab->rhead_sta_addr = rhash_addr_tbl;
  344. return 0;
  345. err_free:
  346. kfree(rhash_addr_tbl);
  347. return ret;
  348. }
  349. void ath12k_link_sta_rhash_tbl_destroy(struct ath12k_base *ab)
  350. {
  351. rhashtable_destroy(ab->rhead_sta_addr);
  352. kfree(ab->rhead_sta_addr);
  353. ab->rhead_sta_addr = NULL;
  354. }
  355. struct ath12k_link_sta *ath12k_link_sta_find_by_addr(struct ath12k_base *ab,
  356. const u8 *addr)
  357. {
  358. lockdep_assert_held(&ab->base_lock);
  359. return rhashtable_lookup_fast(ab->rhead_sta_addr, addr,
  360. ab->rhash_sta_addr_param);
  361. }