dp_peer.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317
  1. /*
  2. * Copyright (c) 2016-2017 The Linux Foundation. All rights reserved.
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for
  5. * any purpose with or without fee is hereby granted, provided that the
  6. * above copyright notice and this permission notice appear in all
  7. * copies.
  8. *
  9. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  10. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  11. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  12. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  13. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  14. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  15. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  16. * PERFORMANCE OF THIS SOFTWARE.
  17. */
  18. #include <qdf_types.h>
  19. #include <qdf_lock.h>
  20. #include "dp_htt.h"
  21. #include "dp_types.h"
  22. #include "dp_internal.h"
  23. #include "dp_peer.h"
  24. #include <hal_api.h>
  25. #include <hal_reo.h>
  26. #ifdef CONFIG_MCL
  27. #include <cds_ieee80211_common.h>
  28. #endif
  29. #include <cdp_txrx_handle.h>
  30. /* Temporary definitions to be moved to wlan_cfg */
  31. static inline uint32_t wlan_cfg_max_peer_id(void *wlan_cfg_ctx)
  32. {
  33. /* TODO: This should be calculated based on target capabilities */
  34. return 2048;
  35. }
  36. static inline int dp_peer_find_mac_addr_cmp(
  37. union dp_align_mac_addr *mac_addr1,
  38. union dp_align_mac_addr *mac_addr2)
  39. {
  40. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  41. /*
  42. * Intentionally use & rather than &&.
  43. * because the operands are binary rather than generic boolean,
  44. * the functionality is equivalent.
  45. * Using && has the advantage of short-circuited evaluation,
  46. * but using & has the advantage of no conditional branching,
  47. * which is a more significant benefit.
  48. */
  49. &
  50. (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  51. }
  52. static int dp_peer_find_map_attach(struct dp_soc *soc)
  53. {
  54. uint32_t max_peers, peer_map_size;
  55. /* allocate the peer ID -> peer object map */
  56. max_peers = wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1;
  57. soc->max_peers = max_peers;
  58. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO,
  59. "\n<=== cfg max peer id %d ====>\n", max_peers);
  60. peer_map_size = max_peers * sizeof(soc->peer_id_to_obj_map[0]);
  61. soc->peer_id_to_obj_map = qdf_mem_malloc(peer_map_size);
  62. if (!soc->peer_id_to_obj_map) {
  63. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  64. "%s: peer map memory allocation failed\n", __func__);
  65. return QDF_STATUS_E_NOMEM;
  66. }
  67. /*
  68. * The peer_id_to_obj_map doesn't really need to be initialized,
  69. * since elements are only used after they have been individually
  70. * initialized.
  71. * However, it is convenient for debugging to have all elements
  72. * that are not in use set to 0.
  73. */
  74. qdf_mem_zero(soc->peer_id_to_obj_map, peer_map_size);
  75. #ifdef notyet /* ATH_BAND_STEERING */
  76. OS_INIT_TIMER(soc->osdev, &(soc->bs_inact_timer),
  77. dp_peer_find_inact_timeout_handler, (void *)soc,
  78. QDF_TIMER_TYPE_WAKE_APPS);
  79. #endif
  80. return 0; /* success */
  81. }
  82. static int dp_log2_ceil(unsigned value)
  83. {
  84. unsigned tmp = value;
  85. int log2 = -1;
  86. while (tmp) {
  87. log2++;
  88. tmp >>= 1;
  89. }
  90. if (1 << log2 != value)
  91. log2++;
  92. return log2;
  93. }
  94. static int dp_peer_find_add_id_to_obj(
  95. struct dp_peer *peer,
  96. uint16_t peer_id)
  97. {
  98. int i;
  99. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  100. if (peer->peer_ids[i] == HTT_INVALID_PEER) {
  101. peer->peer_ids[i] = peer_id;
  102. return 0; /* success */
  103. }
  104. }
  105. return QDF_STATUS_E_FAILURE; /* failure */
  106. }
  107. #define DP_PEER_HASH_LOAD_MULT 2
  108. #define DP_PEER_HASH_LOAD_SHIFT 0
  109. static int dp_peer_find_hash_attach(struct dp_soc *soc)
  110. {
  111. int i, hash_elems, log2;
  112. /* allocate the peer MAC address -> peer object hash table */
  113. hash_elems = wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1;
  114. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  115. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  116. log2 = dp_log2_ceil(hash_elems);
  117. hash_elems = 1 << log2;
  118. soc->peer_hash.mask = hash_elems - 1;
  119. soc->peer_hash.idx_bits = log2;
  120. /* allocate an array of TAILQ peer object lists */
  121. soc->peer_hash.bins = qdf_mem_malloc(
  122. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  123. if (!soc->peer_hash.bins)
  124. return QDF_STATUS_E_NOMEM;
  125. for (i = 0; i < hash_elems; i++)
  126. TAILQ_INIT(&soc->peer_hash.bins[i]);
  127. return 0;
  128. }
  129. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  130. {
  131. qdf_mem_free(soc->peer_hash.bins);
  132. }
  133. static inline unsigned dp_peer_find_hash_index(struct dp_soc *soc,
  134. union dp_align_mac_addr *mac_addr)
  135. {
  136. unsigned index;
  137. index =
  138. mac_addr->align2.bytes_ab ^
  139. mac_addr->align2.bytes_cd ^
  140. mac_addr->align2.bytes_ef;
  141. index ^= index >> soc->peer_hash.idx_bits;
  142. index &= soc->peer_hash.mask;
  143. return index;
  144. }
  145. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  146. {
  147. unsigned index;
  148. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  149. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  150. /*
  151. * It is important to add the new peer at the tail of the peer list
  152. * with the bin index. Together with having the hash_find function
  153. * search from head to tail, this ensures that if two entries with
  154. * the same MAC address are stored, the one added first will be
  155. * found first.
  156. */
  157. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer, hash_list_elem);
  158. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  159. }
  160. #if ATH_SUPPORT_WRAP
  161. static struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  162. uint8_t *peer_mac_addr, int mac_addr_is_aligned, uint8_t vdev_id)
  163. #else
  164. static struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  165. uint8_t *peer_mac_addr, int mac_addr_is_aligned)
  166. #endif
  167. {
  168. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  169. unsigned index;
  170. struct dp_peer *peer;
  171. if (mac_addr_is_aligned) {
  172. mac_addr = (union dp_align_mac_addr *) peer_mac_addr;
  173. } else {
  174. qdf_mem_copy(
  175. &local_mac_addr_aligned.raw[0],
  176. peer_mac_addr, DP_MAC_ADDR_LEN);
  177. mac_addr = &local_mac_addr_aligned;
  178. }
  179. index = dp_peer_find_hash_index(soc, mac_addr);
  180. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  181. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  182. #if ATH_SUPPORT_WRAP
  183. /* ProxySTA may have multiple BSS peer with same MAC address,
  184. * modified find will take care of finding the correct BSS peer.
  185. */
  186. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  187. (peer->vdev->vdev_id == vdev_id)) {
  188. #else
  189. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0) {
  190. #endif
  191. /* found it - increment the ref count before releasing
  192. * the lock
  193. */
  194. qdf_atomic_inc(&peer->ref_cnt);
  195. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  196. return peer;
  197. }
  198. }
  199. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  200. return NULL; /* failure */
  201. }
  202. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  203. {
  204. unsigned index;
  205. struct dp_peer *tmppeer = NULL;
  206. int found = 0;
  207. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  208. /* Check if tail is not empty before delete*/
  209. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  210. /*
  211. * DO NOT take the peer_ref_mutex lock here - it needs to be taken
  212. * by the caller.
  213. * The caller needs to hold the lock from the time the peer object's
  214. * reference count is decremented and tested up through the time the
  215. * reference to the peer object is removed from the hash table, by
  216. * this function.
  217. * Holding the lock only while removing the peer object reference
  218. * from the hash table keeps the hash table consistent, but does not
  219. * protect against a new HL tx context starting to use the peer object
  220. * if it looks up the peer object from its MAC address just after the
  221. * peer ref count is decremented to zero, but just before the peer
  222. * object reference is removed from the hash table.
  223. */
  224. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index], hash_list_elem) {
  225. if (tmppeer == peer) {
  226. found = 1;
  227. break;
  228. }
  229. }
  230. QDF_ASSERT(found);
  231. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer, hash_list_elem);
  232. }
  233. void dp_peer_find_hash_erase(struct dp_soc *soc)
  234. {
  235. int i;
  236. /*
  237. * Not really necessary to take peer_ref_mutex lock - by this point,
  238. * it's known that the soc is no longer in use.
  239. */
  240. for (i = 0; i <= soc->peer_hash.mask; i++) {
  241. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  242. struct dp_peer *peer, *peer_next;
  243. /*
  244. * TAILQ_FOREACH_SAFE must be used here to avoid any
  245. * memory access violation after peer is freed
  246. */
  247. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  248. hash_list_elem, peer_next) {
  249. /*
  250. * Don't remove the peer from the hash table -
  251. * that would modify the list we are currently
  252. * traversing, and it's not necessary anyway.
  253. */
  254. /*
  255. * Artificially adjust the peer's ref count to
  256. * 1, so it will get deleted by
  257. * dp_peer_unref_delete.
  258. */
  259. /* set to zero */
  260. qdf_atomic_init(&peer->ref_cnt);
  261. /* incr to one */
  262. qdf_atomic_inc(&peer->ref_cnt);
  263. dp_peer_unref_delete(peer);
  264. }
  265. }
  266. }
  267. }
  268. static void dp_peer_find_map_detach(struct dp_soc *soc)
  269. {
  270. #ifdef notyet /* ATH_BAND_STEERING */
  271. OS_FREE_TIMER(&(soc->bs_inact_timer));
  272. #endif
  273. qdf_mem_free(soc->peer_id_to_obj_map);
  274. }
  275. int dp_peer_find_attach(struct dp_soc *soc)
  276. {
  277. if (dp_peer_find_map_attach(soc))
  278. return 1;
  279. if (dp_peer_find_hash_attach(soc)) {
  280. dp_peer_find_map_detach(soc);
  281. return 1;
  282. }
  283. return 0; /* success */
  284. }
  285. static inline void dp_peer_find_add_id(struct dp_soc *soc,
  286. uint8_t *peer_mac_addr, uint16_t peer_id, uint8_t vdev_id)
  287. {
  288. struct dp_peer *peer;
  289. QDF_ASSERT(peer_id <= wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1);
  290. /* check if there's already a peer object with this MAC address */
  291. #if ATH_SUPPORT_WRAP
  292. peer = dp_peer_find_hash_find(soc, peer_mac_addr,
  293. 0 /* is aligned */, vdev_id);
  294. #else
  295. peer = dp_peer_find_hash_find(soc, peer_mac_addr, 0 /* is aligned */);
  296. #endif
  297. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  298. "%s: peer %p ID %d vid %d mac %02x:%02x:%02x:%02x:%02x:%02x\n",
  299. __func__, peer, peer_id, vdev_id, peer_mac_addr[0],
  300. peer_mac_addr[1], peer_mac_addr[2], peer_mac_addr[3],
  301. peer_mac_addr[4], peer_mac_addr[5]);
  302. if (peer) {
  303. /* peer's ref count was already incremented by
  304. * peer_find_hash_find
  305. */
  306. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  307. "%s: ref_cnt: %d", __func__,
  308. qdf_atomic_read(&peer->ref_cnt));
  309. soc->peer_id_to_obj_map[peer_id] = peer;
  310. if (dp_peer_find_add_id_to_obj(peer, peer_id)) {
  311. /* TBDXXX: assert for now */
  312. QDF_ASSERT(0);
  313. }
  314. return;
  315. }
  316. }
  317. void
  318. dp_rx_peer_map_handler(void *soc_handle, uint16_t peer_id, uint8_t vdev_id,
  319. uint8_t *peer_mac_addr)
  320. {
  321. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  322. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  323. "peer_map_event (soc:%p): peer_id %d, peer_mac "
  324. "%02x:%02x:%02x:%02x:%02x:%02x, vdev_id %d\n", soc, peer_id,
  325. peer_mac_addr[0], peer_mac_addr[1], peer_mac_addr[2],
  326. peer_mac_addr[3], peer_mac_addr[4], peer_mac_addr[5], vdev_id);
  327. dp_peer_find_add_id(soc, peer_mac_addr, peer_id, vdev_id);
  328. }
  329. void
  330. dp_rx_peer_unmap_handler(void *soc_handle, uint16_t peer_id)
  331. {
  332. struct dp_peer *peer;
  333. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  334. uint8_t i;
  335. peer = dp_peer_find_by_id(soc, peer_id);
  336. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  337. "peer_unmap_event (soc:%p) peer_id %d peer %p\n",
  338. soc, peer_id, peer);
  339. /*
  340. * Currently peer IDs are assigned for vdevs as well as peers.
  341. * If the peer ID is for a vdev, then the peer pointer stored
  342. * in peer_id_to_obj_map will be NULL.
  343. */
  344. if (!peer)
  345. return;
  346. soc->peer_id_to_obj_map[peer_id] = NULL;
  347. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  348. if (peer->peer_ids[i] == peer_id) {
  349. peer->peer_ids[i] = HTT_INVALID_PEER;
  350. break;
  351. }
  352. }
  353. /*
  354. * Remove a reference to the peer.
  355. * If there are no more references, delete the peer object.
  356. */
  357. dp_peer_unref_delete(peer);
  358. }
  359. void
  360. dp_peer_find_detach(struct dp_soc *soc)
  361. {
  362. dp_peer_find_map_detach(soc);
  363. dp_peer_find_hash_detach(soc);
  364. }
  365. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  366. union hal_reo_status *reo_status)
  367. {
  368. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  369. if (reo_status->queue_status.header.status) {
  370. /* Should not happen normally. Just print error for now */
  371. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  372. "%s: Rx tid HW desc update failed(%d): tid %d\n",
  373. __func__,
  374. reo_status->rx_queue_status.header.status,
  375. rx_tid->tid);
  376. }
  377. }
  378. /*
  379. * dp_find_peer_by_addr - find peer instance by mac address
  380. * @dev: physical device instance
  381. * @peer_mac_addr: peer mac address
  382. * @local_id: local id for the peer
  383. *
  384. * Return: peer instance pointer
  385. */
  386. void *dp_find_peer_by_addr(struct cdp_pdev *dev, uint8_t *peer_mac_addr,
  387. uint8_t *local_id)
  388. {
  389. struct dp_pdev *pdev = (struct dp_pdev *)dev;
  390. struct dp_peer *peer;
  391. #if ATH_SUPPORT_WRAP
  392. peer = dp_peer_find_hash_find(pdev->soc, peer_mac_addr, 0, 0);
  393. /* WAR, VDEV ID? TEMP 0 */
  394. #else
  395. peer = dp_peer_find_hash_find(pdev->soc, peer_mac_addr, 0);
  396. #endif
  397. if (!peer)
  398. return NULL;
  399. /* Multiple peer ids? How can know peer id? */
  400. *local_id = peer->local_id;
  401. DP_TRACE(INFO, "%s: peer %p id %d", __func__, peer, *local_id);
  402. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  403. * Decrement it here.
  404. */
  405. qdf_atomic_dec(&peer->ref_cnt);
  406. return peer;
  407. }
  408. /*
  409. * dp_rx_tid_update_wifi3() – Update receive TID state
  410. * @peer: Datapath peer handle
  411. * @tid: TID
  412. * @ba_window_size: BlockAck window size
  413. * @start_seq: Starting sequence number
  414. *
  415. * Return: 0 on success, error code on failure
  416. */
  417. static int dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  418. ba_window_size, uint32_t start_seq)
  419. {
  420. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  421. struct dp_soc *soc = peer->vdev->pdev->soc;
  422. struct hal_reo_cmd_params params;
  423. qdf_mem_zero(&params, sizeof(params));
  424. params.std.need_status = 1;
  425. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  426. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  427. params.u.upd_queue_params.update_ba_window_size = 1;
  428. params.u.upd_queue_params.ba_window_size = ba_window_size;
  429. if (start_seq < IEEE80211_SEQ_MAX) {
  430. params.u.upd_queue_params.update_ssn = 1;
  431. params.u.upd_queue_params.ssn = start_seq;
  432. }
  433. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params, dp_rx_tid_update_cb, rx_tid);
  434. return 0;
  435. }
  436. /*
  437. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  438. * @peer: Datapath peer handle
  439. * @tid: TID
  440. * @ba_window_size: BlockAck window size
  441. * @start_seq: Starting sequence number
  442. *
  443. * Return: 0 on success, error code on failure
  444. */
  445. int dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  446. uint32_t ba_window_size, uint32_t start_seq)
  447. {
  448. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  449. struct dp_vdev *vdev = peer->vdev;
  450. struct dp_soc *soc = vdev->pdev->soc;
  451. uint32_t hw_qdesc_size;
  452. uint32_t hw_qdesc_align;
  453. int hal_pn_type;
  454. void *hw_qdesc_vaddr;
  455. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL)
  456. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  457. start_seq);
  458. #ifdef notyet
  459. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc, ba_window_size);
  460. #else
  461. /* TODO: Allocating HW queue descriptors based on max BA window size
  462. * for all QOS TIDs so that same descriptor can be used later when
  463. * ADDBA request is recevied. This should be changed to allocate HW
  464. * queue descriptors based on BA window size being negotiated (0 for
  465. * non BA cases), and reallocate when BA window size changes and also
  466. * send WMI message to FW to change the REO queue descriptor in Rx
  467. * peer entry as part of dp_rx_tid_update.
  468. */
  469. if (tid != DP_NON_QOS_TID)
  470. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  471. HAL_RX_MAX_BA_WINDOW);
  472. else
  473. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  474. ba_window_size);
  475. #endif
  476. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  477. /* To avoid unnecessary extra allocation for alignment, try allocating
  478. * exact size and see if we already have aligned address.
  479. */
  480. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  481. rx_tid->hw_qdesc_vaddr_unaligned = qdf_mem_alloc_consistent(
  482. soc->osdev, soc->osdev->dev, rx_tid->hw_qdesc_alloc_size,
  483. &(rx_tid->hw_qdesc_paddr_unaligned));
  484. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  485. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  486. "%s: Rx tid HW desc alloc failed: tid %d\n",
  487. __func__, tid);
  488. return QDF_STATUS_E_NOMEM;
  489. }
  490. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  491. hw_qdesc_align) {
  492. /* Address allocated above is not alinged. Allocate extra
  493. * memory for alignment
  494. */
  495. qdf_mem_free_consistent(soc->osdev, soc->osdev->dev,
  496. rx_tid->hw_qdesc_alloc_size,
  497. rx_tid->hw_qdesc_vaddr_unaligned,
  498. rx_tid->hw_qdesc_paddr_unaligned, 0);
  499. rx_tid->hw_qdesc_alloc_size =
  500. hw_qdesc_size + hw_qdesc_align - 1;
  501. rx_tid->hw_qdesc_vaddr_unaligned = qdf_mem_alloc_consistent(
  502. soc->osdev, soc->osdev->dev, rx_tid->hw_qdesc_alloc_size,
  503. &(rx_tid->hw_qdesc_paddr_unaligned));
  504. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  505. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  506. "%s: Rx tid HW desc alloc failed: tid %d\n",
  507. __func__, tid);
  508. return QDF_STATUS_E_NOMEM;
  509. }
  510. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned +
  511. ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  512. hw_qdesc_align);
  513. rx_tid->hw_qdesc_paddr = rx_tid->hw_qdesc_paddr_unaligned +
  514. ((unsigned long)hw_qdesc_vaddr -
  515. (unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned));
  516. } else {
  517. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  518. rx_tid->hw_qdesc_paddr = rx_tid->hw_qdesc_paddr_unaligned;
  519. }
  520. /* TODO: Ensure that sec_type is set before ADDBA is received.
  521. * Currently this is set based on htt indication
  522. * HTT_T2H_MSG_TYPE_SEC_IND from target
  523. */
  524. switch (peer->security[dp_sec_ucast].sec_type) {
  525. case htt_sec_type_tkip_nomic:
  526. case htt_sec_type_aes_ccmp:
  527. case htt_sec_type_aes_ccmp_256:
  528. case htt_sec_type_aes_gcmp:
  529. case htt_sec_type_aes_gcmp_256:
  530. hal_pn_type = HAL_PN_WPA;
  531. break;
  532. case htt_sec_type_wapi:
  533. if (vdev->opmode == wlan_op_mode_ap)
  534. hal_pn_type = HAL_PN_WAPI_EVEN;
  535. else
  536. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  537. break;
  538. default:
  539. hal_pn_type = HAL_PN_NONE;
  540. break;
  541. }
  542. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  543. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type);
  544. if (soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup) {
  545. soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup(
  546. vdev->pdev->osif_pdev,
  547. peer->vdev->vdev_id, peer->mac_addr.raw,
  548. rx_tid->hw_qdesc_paddr, tid, tid);
  549. }
  550. return 0;
  551. }
  552. /*
  553. * Rx TID deletion callback to free memory allocated for HW queue descriptor
  554. */
  555. static void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  556. union hal_reo_status *reo_status)
  557. {
  558. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  559. if (reo_status->rx_queue_status.header.status) {
  560. /* Should not happen normally. Just print error for now */
  561. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  562. "%s: Rx tid HW desc deletion failed(%d): tid %d\n",
  563. __func__,
  564. reo_status->rx_queue_status.header.status,
  565. rx_tid->tid);
  566. }
  567. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_INFO,
  568. "%s: rx_tid: %d status: %d\n", __func__,
  569. rx_tid->tid, reo_status->rx_queue_status.header.status);
  570. /* Calling qdf_mem_free_consistent() in MCL is resulting in kernel BUG.
  571. * Diasble this temporarily.
  572. */
  573. #ifndef QCA_WIFI_NAPIER_EMULATION
  574. qdf_mem_free_consistent(soc->osdev, soc->osdev->dev,
  575. rx_tid->hw_qdesc_alloc_size,
  576. rx_tid->hw_qdesc_vaddr_unaligned,
  577. rx_tid->hw_qdesc_paddr_unaligned, 0);
  578. #endif
  579. qdf_mem_free(rx_tid);
  580. }
  581. /*
  582. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  583. * @peer: Datapath peer handle
  584. * @tid: TID
  585. *
  586. * Return: 0 on success, error code on failure
  587. */
  588. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  589. {
  590. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  591. struct dp_soc *soc = peer->vdev->pdev->soc;
  592. struct hal_reo_cmd_params params;
  593. struct dp_rx_tid *rx_tid_copy = qdf_mem_malloc(sizeof(*rx_tid_copy));
  594. if (!rx_tid_copy) {
  595. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  596. "%s: malloc failed for rx_tid_copy: tid %d\n",
  597. __func__, rx_tid->tid);
  598. return -ENOMEM;
  599. }
  600. *rx_tid_copy = *rx_tid;
  601. qdf_mem_zero(&params, sizeof(params));
  602. params.std.need_status = 1;
  603. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  604. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  605. params.u.upd_queue_params.update_vld = 1;
  606. params.u.upd_queue_params.vld = 0;
  607. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  608. rx_tid->hw_qdesc_alloc_size = 0;
  609. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  610. dp_rx_tid_delete_cb, (void *)rx_tid_copy);
  611. return 0;
  612. }
  613. /*
  614. * dp_peer_rx_init() – Initialize receive TID state
  615. * @pdev: Datapath pdev
  616. * @peer: Datapath peer
  617. *
  618. */
  619. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  620. {
  621. int tid;
  622. struct dp_rx_tid *rx_tid;
  623. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  624. rx_tid = &peer->rx_tid[tid];
  625. rx_tid->array = &rx_tid->base;
  626. rx_tid->base.head = rx_tid->base.tail = NULL;
  627. rx_tid->tid = tid;
  628. rx_tid->defrag_timeout_ms = 0;
  629. rx_tid->ba_win_size = 0;
  630. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  631. rx_tid->defrag_waitlist_elem.tqe_next = NULL;
  632. rx_tid->defrag_waitlist_elem.tqe_prev = NULL;
  633. #ifdef notyet /* TODO: See if this is required for exception handling */
  634. /* invalid sequence number */
  635. peer->tids_last_seq[tid] = 0xffff;
  636. #endif
  637. }
  638. /* Setup default (non-qos) rx tid queue */
  639. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  640. /* Setup rx tid queue for TID 0.
  641. * Other queues will be setup on receiving first packet, which will cause
  642. * NULL REO queue error
  643. */
  644. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  645. /*
  646. * Set security defaults: no PN check, no security. The target may
  647. * send a HTT SEC_IND message to overwrite these defaults.
  648. */
  649. peer->security[dp_sec_ucast].sec_type =
  650. peer->security[dp_sec_mcast].sec_type = htt_sec_type_none;
  651. }
  652. /*
  653. * dp_peer_rx_cleanup() – Cleanup receive TID state
  654. * @vdev: Datapath vdev
  655. * @peer: Datapath peer
  656. *
  657. */
  658. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  659. {
  660. int tid;
  661. uint32_t tid_delete_mask = 0;
  662. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  663. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned != NULL) {
  664. dp_rx_tid_delete_wifi3(peer, tid);
  665. tid_delete_mask |= (1 << tid);
  666. }
  667. }
  668. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  669. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  670. soc->ol_ops->peer_rx_reorder_queue_remove(vdev->pdev->osif_pdev,
  671. peer->vdev->vdev_id, peer->mac_addr.raw,
  672. tid_delete_mask);
  673. }
  674. #endif
  675. }
  676. /*
  677. * dp_peer_cleanup() – Cleanup peer information
  678. * @vdev: Datapath vdev
  679. * @peer: Datapath peer
  680. *
  681. */
  682. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  683. {
  684. peer->last_assoc_rcvd = 0;
  685. peer->last_disassoc_rcvd = 0;
  686. peer->last_deauth_rcvd = 0;
  687. /* cleanup the Rx reorder queues for this peer */
  688. dp_peer_rx_cleanup(vdev, peer);
  689. }
  690. /*
  691. * dp_rx_addba_requestprocess_wifi3() – Process ADDBA request from peer
  692. *
  693. * @peer: Datapath peer handle
  694. * @dialogtoken: dialogtoken from ADDBA frame
  695. * @tid: TID number
  696. * @startseqnum: Start seq. number received in BA sequence control
  697. * in ADDBA frame
  698. *
  699. * Return: 0 on success, error code on failure
  700. */
  701. int dp_addba_requestprocess_wifi3(void *peer_handle,
  702. uint8_t dialogtoken, uint16_t tid, uint16_t batimeout,
  703. uint16_t buffersize, uint16_t startseqnum)
  704. {
  705. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  706. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  707. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE) &&
  708. (rx_tid->hw_qdesc_vaddr_unaligned != NULL))
  709. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  710. if (dp_rx_tid_setup_wifi3(peer, tid, buffersize,
  711. startseqnum)) {
  712. /* TODO: Should we send addba reject in this case */
  713. return QDF_STATUS_E_FAILURE;
  714. }
  715. rx_tid->ba_win_size = buffersize;
  716. rx_tid->dialogtoken = dialogtoken;
  717. rx_tid->statuscode = QDF_STATUS_SUCCESS;
  718. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  719. return 0;
  720. }
  721. /*
  722. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  723. *
  724. * @peer: Datapath peer handle
  725. * @tid: TID number
  726. * @dialogtoken: output dialogtoken
  727. * @statuscode: output dialogtoken
  728. * @buffersize: Ouput BA window sizze
  729. * @batimeout: Ouput BA timeout
  730. */
  731. void dp_addba_responsesetup_wifi3(void *peer_handle, uint8_t tid,
  732. uint8_t *dialogtoken, uint16_t *statuscode,
  733. uint16_t *buffersize, uint16_t *batimeout)
  734. {
  735. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  736. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  737. /* setup ADDBA response paramters */
  738. *dialogtoken = rx_tid->dialogtoken;
  739. *statuscode = rx_tid->statuscode;
  740. *buffersize = rx_tid->ba_win_size;
  741. *batimeout = 0;
  742. }
  743. /*
  744. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  745. * @peer: Datapath peer handle
  746. * @tid: TID number
  747. * @reasoncode: Reason code received in DELBA frame
  748. *
  749. * Return: 0 on success, error code on failure
  750. */
  751. int dp_delba_process_wifi3(void *peer_handle,
  752. int tid, uint16_t reasoncode)
  753. {
  754. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  755. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  756. if (rx_tid->ba_status != DP_RX_BA_ACTIVE)
  757. return QDF_STATUS_E_FAILURE;
  758. /* TODO: See if we can delete the existing REO queue descriptor and
  759. * replace with a new one without queue extenstion descript to save
  760. * memory
  761. */
  762. dp_rx_tid_update_wifi3(peer, tid, 0, 0);
  763. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  764. return 0;
  765. }
  766. void dp_rx_discard(struct dp_vdev *vdev, struct dp_peer *peer, unsigned tid,
  767. qdf_nbuf_t msdu_list)
  768. {
  769. while (msdu_list) {
  770. qdf_nbuf_t msdu = msdu_list;
  771. msdu_list = qdf_nbuf_next(msdu_list);
  772. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  773. "discard rx %p from partly-deleted peer %p "
  774. "(%02x:%02x:%02x:%02x:%02x:%02x)\n",
  775. msdu, peer,
  776. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  777. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  778. peer->mac_addr.raw[4], peer->mac_addr.raw[5]);
  779. qdf_nbuf_free(msdu);
  780. }
  781. }
  782. void
  783. dp_rx_sec_ind_handler(void *soc_handle, uint16_t peer_id,
  784. enum htt_sec_type sec_type, int is_unicast, u_int32_t *michael_key,
  785. u_int32_t *rx_pn)
  786. {
  787. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  788. struct dp_peer *peer;
  789. int sec_index;
  790. peer = dp_peer_find_by_id(soc, peer_id);
  791. if (!peer) {
  792. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  793. "Couldn't find peer from ID %d - skipping security inits\n",
  794. peer_id);
  795. return;
  796. }
  797. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  798. "sec spec for peer %p (%02x:%02x:%02x:%02x:%02x:%02x): "
  799. "%s key of type %d\n",
  800. peer,
  801. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  802. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  803. peer->mac_addr.raw[4], peer->mac_addr.raw[5],
  804. is_unicast ? "ucast" : "mcast",
  805. sec_type);
  806. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  807. peer->security[sec_index].sec_type = sec_type;
  808. #ifdef notyet /* TODO: See if this is required for defrag support */
  809. /* michael key only valid for TKIP, but for simplicity,
  810. * copy it anyway
  811. */
  812. qdf_mem_copy(
  813. &peer->security[sec_index].michael_key[0],
  814. michael_key,
  815. sizeof(peer->security[sec_index].michael_key));
  816. #ifdef BIG_ENDIAN_HOST
  817. OL_IF_SWAPBO(peer->security[sec_index].michael_key[0],
  818. sizeof(peer->security[sec_index].michael_key));
  819. #endif /* BIG_ENDIAN_HOST */
  820. #endif
  821. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  822. if (sec_type != htt_sec_type_wapi) {
  823. qdf_mem_set(peer->tids_last_pn_valid, _EXT_TIDS, 0x00);
  824. } else {
  825. for (i = 0; i < DP_MAX_TIDS; i++) {
  826. /*
  827. * Setting PN valid bit for WAPI sec_type,
  828. * since WAPI PN has to be started with predefined value
  829. */
  830. peer->tids_last_pn_valid[i] = 1;
  831. qdf_mem_copy(
  832. (u_int8_t *) &peer->tids_last_pn[i],
  833. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  834. peer->tids_last_pn[i].pn128[1] =
  835. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  836. peer->tids_last_pn[i].pn128[0] =
  837. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  838. }
  839. }
  840. #endif
  841. /* TODO: Update HW TID queue with PN check parameters (pn type for
  842. * all security types and last pn for WAPI) once REO command API
  843. * is available
  844. */
  845. }
  846. #ifndef CONFIG_WIN
  847. /**
  848. * dp_register_peer() - Register peer into physical device
  849. * @pdev - data path device instance
  850. * @sta_desc - peer description
  851. *
  852. * Register peer into physical device
  853. *
  854. * Return: QDF_STATUS_SUCCESS registration success
  855. * QDF_STATUS_E_FAULT peer not found
  856. */
  857. QDF_STATUS dp_register_peer(struct cdp_pdev *pdev_handle,
  858. struct ol_txrx_desc_type *sta_desc)
  859. {
  860. struct dp_peer *peer;
  861. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  862. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev,
  863. sta_desc->sta_id);
  864. if (!peer)
  865. return QDF_STATUS_E_FAULT;
  866. qdf_spin_lock_bh(&peer->peer_info_lock);
  867. peer->state = OL_TXRX_PEER_STATE_CONN;
  868. qdf_spin_unlock_bh(&peer->peer_info_lock);
  869. return QDF_STATUS_SUCCESS;
  870. }
  871. /**
  872. * dp_clear_peer() - remove peer from physical device
  873. * @pdev - data path device instance
  874. * @sta_id - local peer id
  875. *
  876. * remove peer from physical device
  877. *
  878. * Return: QDF_STATUS_SUCCESS registration success
  879. * QDF_STATUS_E_FAULT peer not found
  880. */
  881. QDF_STATUS dp_clear_peer(struct cdp_pdev *pdev_handle, uint8_t local_id)
  882. {
  883. struct dp_peer *peer;
  884. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  885. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev, local_id);
  886. if (!peer)
  887. return QDF_STATUS_E_FAULT;
  888. qdf_spin_lock_bh(&peer->peer_info_lock);
  889. peer->state = OL_TXRX_PEER_STATE_DISC;
  890. qdf_spin_unlock_bh(&peer->peer_info_lock);
  891. return QDF_STATUS_SUCCESS;
  892. }
  893. /**
  894. * dp_find_peer_by_addr_and_vdev() - Find peer by peer mac address within vdev
  895. * @pdev - data path device instance
  896. * @vdev - virtual interface instance
  897. * @peer_addr - peer mac address
  898. * @peer_id - local peer id with target mac address
  899. *
  900. * Find peer by peer mac address within vdev
  901. *
  902. * Return: peer instance void pointer
  903. * NULL cannot find target peer
  904. */
  905. void *dp_find_peer_by_addr_and_vdev(struct cdp_pdev *pdev_handle,
  906. struct cdp_vdev *vdev_handle,
  907. uint8_t *peer_addr, uint8_t *local_id)
  908. {
  909. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  910. struct dp_vdev *vdev = (struct dp_vdev *)vdev_handle;
  911. struct dp_peer *peer;
  912. DP_TRACE(INFO, "vdev %p peer_addr %p", vdev, peer_addr);
  913. peer = dp_peer_find_hash_find(pdev->soc, peer_addr, 0);
  914. DP_TRACE(INFO, "peer %p vdev %p", peer, vdev);
  915. if (!peer)
  916. return NULL;
  917. if (peer->vdev != vdev)
  918. return NULL;
  919. *local_id = peer->local_id;
  920. DP_TRACE(INFO, "peer %p vdev %p lcoal id %d", peer, vdev, *local_id);
  921. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  922. * Decrement it here.
  923. */
  924. qdf_atomic_dec(&peer->ref_cnt);
  925. return peer;
  926. }
  927. /**
  928. * dp_local_peer_id() - Find local peer id within peer instance
  929. * @peer - peer instance
  930. *
  931. * Find local peer id within peer instance
  932. *
  933. * Return: local peer id
  934. */
  935. uint16_t dp_local_peer_id(void *peer)
  936. {
  937. return ((struct dp_peer *)peer)->local_id;
  938. }
  939. /**
  940. * dp_peer_find_by_local_id() - Find peer by local peer id
  941. * @pdev - data path device instance
  942. * @local_peer_id - local peer id want to find
  943. *
  944. * Find peer by local peer id within physical device
  945. *
  946. * Return: peer instance void pointer
  947. * NULL cannot find target peer
  948. */
  949. void *dp_peer_find_by_local_id(struct cdp_pdev *pdev_handle, uint8_t local_id)
  950. {
  951. struct dp_peer *peer;
  952. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  953. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  954. peer = pdev->local_peer_ids.map[local_id];
  955. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  956. DP_TRACE(INFO, "peer %p lcoal id %d",
  957. peer, local_id);
  958. return peer;
  959. }
  960. /**
  961. * dp_peer_state_update() - update peer local state
  962. * @pdev - data path device instance
  963. * @peer_addr - peer mac address
  964. * @state - new peer local state
  965. *
  966. * update peer local state
  967. *
  968. * Return: QDF_STATUS_SUCCESS registration success
  969. */
  970. QDF_STATUS dp_peer_state_update(struct cdp_pdev *pdev_handle, uint8_t *peer_mac,
  971. enum ol_txrx_peer_state state)
  972. {
  973. struct dp_peer *peer;
  974. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  975. peer = dp_peer_find_hash_find(pdev->soc, peer_mac, 0);
  976. if (NULL == peer) {
  977. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  978. "Failed to find peer for: [%pM]", peer_mac);
  979. return QDF_STATUS_E_FAILURE;
  980. }
  981. peer->state = state;
  982. DP_TRACE(INFO, "peer %p state %d", peer, peer->state);
  983. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  984. * Decrement it here.
  985. */
  986. qdf_atomic_dec(&peer->ref_cnt);
  987. return QDF_STATUS_SUCCESS;
  988. }
  989. /**
  990. * dp_get_vdevid() - Get virtaul interface id which peer registered
  991. * @peer - peer instance
  992. * @vdev_id - virtaul interface id which peer registered
  993. *
  994. * Get virtaul interface id which peer registered
  995. *
  996. * Return: QDF_STATUS_SUCCESS registration success
  997. */
  998. QDF_STATUS dp_get_vdevid(void *peer_handle, uint8_t *vdev_id)
  999. {
  1000. struct dp_peer *peer = peer_handle;
  1001. DP_TRACE(INFO, "peer %p vdev %p vdev id %d",
  1002. peer, peer->vdev, peer->vdev->vdev_id);
  1003. *vdev_id = peer->vdev->vdev_id;
  1004. return QDF_STATUS_SUCCESS;
  1005. }
  1006. /**
  1007. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  1008. * @peer - peer instance
  1009. *
  1010. * Get virtual interface instance which peer belongs
  1011. *
  1012. * Return: virtual interface instance pointer
  1013. * NULL in case cannot find
  1014. */
  1015. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  1016. {
  1017. struct dp_peer *peer = peer_handle;
  1018. DP_TRACE(INFO, "peer %p vdev %p", peer, peer->vdev);
  1019. return (struct cdp_vdev *)peer->vdev;
  1020. }
  1021. /**
  1022. * dp_peer_get_peer_mac_addr() - Get peer mac address
  1023. * @peer - peer instance
  1024. *
  1025. * Get peer mac address
  1026. *
  1027. * Return: peer mac address pointer
  1028. * NULL in case cannot find
  1029. */
  1030. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  1031. {
  1032. struct dp_peer *peer = peer_handle;
  1033. uint8_t *mac;
  1034. mac = peer->mac_addr.raw;
  1035. DP_TRACE(INFO, "peer %p mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  1036. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  1037. return peer->mac_addr.raw;
  1038. }
  1039. /**
  1040. * dp_get_peer_state() - Get local peer state
  1041. * @peer - peer instance
  1042. *
  1043. * Get local peer state
  1044. *
  1045. * Return: peer status
  1046. */
  1047. int dp_get_peer_state(void *peer_handle)
  1048. {
  1049. struct dp_peer *peer = peer_handle;
  1050. DP_TRACE(INFO, "peer %p stats %d", peer, peer->state);
  1051. return peer->state;
  1052. }
  1053. /**
  1054. * dp_get_last_assoc_received() - get time of last assoc received
  1055. * @peer_handle: peer handle
  1056. *
  1057. * Return: pointer for the time of last assoc received
  1058. */
  1059. qdf_time_t *dp_get_last_assoc_received(void *peer_handle)
  1060. {
  1061. struct dp_peer *peer = peer_handle;
  1062. DP_TRACE(INFO, "peer %p last_assoc_rcvd: %lu", peer,
  1063. peer->last_assoc_rcvd);
  1064. return &peer->last_assoc_rcvd;
  1065. }
  1066. /**
  1067. * dp_get_last_disassoc_received() - get time of last disassoc received
  1068. * @peer_handle: peer handle
  1069. *
  1070. * Return: pointer for the time of last disassoc received
  1071. */
  1072. qdf_time_t *dp_get_last_disassoc_received(void *peer_handle)
  1073. {
  1074. struct dp_peer *peer = peer_handle;
  1075. DP_TRACE(INFO, "peer %p last_disassoc_rcvd: %lu", peer,
  1076. peer->last_disassoc_rcvd);
  1077. return &peer->last_disassoc_rcvd;
  1078. }
  1079. /**
  1080. * dp_get_last_deauth_received() - get time of last deauth received
  1081. * @peer_handle: peer handle
  1082. *
  1083. * Return: pointer for the time of last deauth received
  1084. */
  1085. qdf_time_t *dp_get_last_deauth_received(void *peer_handle)
  1086. {
  1087. struct dp_peer *peer = peer_handle;
  1088. DP_TRACE(INFO, "peer %p last_deauth_rcvd: %lu", peer,
  1089. peer->last_deauth_rcvd);
  1090. return &peer->last_deauth_rcvd;
  1091. }
  1092. /**
  1093. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  1094. * @pdev - data path device instance
  1095. *
  1096. * local peer id pool alloc for physical device
  1097. *
  1098. * Return: none
  1099. */
  1100. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  1101. {
  1102. int i;
  1103. /* point the freelist to the first ID */
  1104. pdev->local_peer_ids.freelist = 0;
  1105. /* link each ID to the next one */
  1106. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  1107. pdev->local_peer_ids.pool[i] = i + 1;
  1108. pdev->local_peer_ids.map[i] = NULL;
  1109. }
  1110. /* link the last ID to itself, to mark the end of the list */
  1111. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  1112. pdev->local_peer_ids.pool[i] = i;
  1113. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  1114. DP_TRACE(INFO, "Peer pool init");
  1115. }
  1116. /**
  1117. * dp_local_peer_id_alloc() - allocate local peer id
  1118. * @pdev - data path device instance
  1119. * @peer - new peer instance
  1120. *
  1121. * allocate local peer id
  1122. *
  1123. * Return: none
  1124. */
  1125. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  1126. {
  1127. int i;
  1128. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  1129. i = pdev->local_peer_ids.freelist;
  1130. if (pdev->local_peer_ids.pool[i] == i) {
  1131. /* the list is empty, except for the list-end marker */
  1132. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  1133. } else {
  1134. /* take the head ID and advance the freelist */
  1135. peer->local_id = i;
  1136. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  1137. pdev->local_peer_ids.map[i] = peer;
  1138. }
  1139. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  1140. DP_TRACE(INFO, "peer %p, local id %d", peer, peer->local_id);
  1141. }
  1142. /**
  1143. * dp_local_peer_id_free() - remove local peer id
  1144. * @pdev - data path device instance
  1145. * @peer - peer instance should be removed
  1146. *
  1147. * remove local peer id
  1148. *
  1149. * Return: none
  1150. */
  1151. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  1152. {
  1153. int i = peer->local_id;
  1154. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  1155. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  1156. return;
  1157. }
  1158. /* put this ID on the head of the freelist */
  1159. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  1160. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  1161. pdev->local_peer_ids.freelist = i;
  1162. pdev->local_peer_ids.map[i] = NULL;
  1163. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  1164. }
  1165. #endif