11n_rxreorder.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639
  1. /*
  2. * Marvell Wireless LAN device driver: 802.11n RX Re-ordering
  3. *
  4. * Copyright (C) 2011, Marvell International Ltd.
  5. *
  6. * This software file (the "File") is distributed by Marvell International
  7. * Ltd. under the terms of the GNU General Public License Version 2, June 1991
  8. * (the "License"). You may use, redistribute and/or modify this File in
  9. * accordance with the terms and conditions of the License, a copy of which
  10. * is available by writing to the Free Software Foundation, Inc.,
  11. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA or on the
  12. * worldwide web at http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt.
  13. *
  14. * THE FILE IS DISTRIBUTED AS-IS, WITHOUT WARRANTY OF ANY KIND, AND THE
  15. * IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE
  16. * ARE EXPRESSLY DISCLAIMED. The License provides additional details about
  17. * this warranty disclaimer.
  18. */
  19. #include "decl.h"
  20. #include "ioctl.h"
  21. #include "util.h"
  22. #include "fw.h"
  23. #include "main.h"
  24. #include "wmm.h"
  25. #include "11n.h"
  26. #include "11n_rxreorder.h"
  27. /*
  28. * This function dispatches all packets in the Rx reorder table until the
  29. * start window.
  30. *
  31. * There could be holes in the buffer, which are skipped by the function.
  32. * Since the buffer is linear, the function uses rotation to simulate
  33. * circular buffer.
  34. */
  35. static void
  36. mwifiex_11n_dispatch_pkt(struct mwifiex_private *priv,
  37. struct mwifiex_rx_reorder_tbl *tbl, int start_win)
  38. {
  39. int pkt_to_send, i;
  40. void *rx_tmp_ptr;
  41. unsigned long flags;
  42. pkt_to_send = (start_win > tbl->start_win) ?
  43. min((start_win - tbl->start_win), tbl->win_size) :
  44. tbl->win_size;
  45. for (i = 0; i < pkt_to_send; ++i) {
  46. spin_lock_irqsave(&priv->rx_pkt_lock, flags);
  47. rx_tmp_ptr = NULL;
  48. if (tbl->rx_reorder_ptr[i]) {
  49. rx_tmp_ptr = tbl->rx_reorder_ptr[i];
  50. tbl->rx_reorder_ptr[i] = NULL;
  51. }
  52. spin_unlock_irqrestore(&priv->rx_pkt_lock, flags);
  53. if (rx_tmp_ptr) {
  54. if (priv->bss_role == MWIFIEX_BSS_ROLE_UAP)
  55. mwifiex_handle_uap_rx_forward(priv, rx_tmp_ptr);
  56. else
  57. mwifiex_process_rx_packet(priv->adapter,
  58. rx_tmp_ptr);
  59. }
  60. }
  61. spin_lock_irqsave(&priv->rx_pkt_lock, flags);
  62. /*
  63. * We don't have a circular buffer, hence use rotation to simulate
  64. * circular buffer
  65. */
  66. for (i = 0; i < tbl->win_size - pkt_to_send; ++i) {
  67. tbl->rx_reorder_ptr[i] = tbl->rx_reorder_ptr[pkt_to_send + i];
  68. tbl->rx_reorder_ptr[pkt_to_send + i] = NULL;
  69. }
  70. tbl->start_win = start_win;
  71. spin_unlock_irqrestore(&priv->rx_pkt_lock, flags);
  72. }
  73. /*
  74. * This function dispatches all packets in the Rx reorder table until
  75. * a hole is found.
  76. *
  77. * The start window is adjusted automatically when a hole is located.
  78. * Since the buffer is linear, the function uses rotation to simulate
  79. * circular buffer.
  80. */
  81. static void
  82. mwifiex_11n_scan_and_dispatch(struct mwifiex_private *priv,
  83. struct mwifiex_rx_reorder_tbl *tbl)
  84. {
  85. int i, j, xchg;
  86. void *rx_tmp_ptr;
  87. unsigned long flags;
  88. for (i = 0; i < tbl->win_size; ++i) {
  89. spin_lock_irqsave(&priv->rx_pkt_lock, flags);
  90. if (!tbl->rx_reorder_ptr[i]) {
  91. spin_unlock_irqrestore(&priv->rx_pkt_lock, flags);
  92. break;
  93. }
  94. rx_tmp_ptr = tbl->rx_reorder_ptr[i];
  95. tbl->rx_reorder_ptr[i] = NULL;
  96. spin_unlock_irqrestore(&priv->rx_pkt_lock, flags);
  97. if (priv->bss_role == MWIFIEX_BSS_ROLE_UAP)
  98. mwifiex_handle_uap_rx_forward(priv, rx_tmp_ptr);
  99. else
  100. mwifiex_process_rx_packet(priv->adapter, rx_tmp_ptr);
  101. }
  102. spin_lock_irqsave(&priv->rx_pkt_lock, flags);
  103. /*
  104. * We don't have a circular buffer, hence use rotation to simulate
  105. * circular buffer
  106. */
  107. if (i > 0) {
  108. xchg = tbl->win_size - i;
  109. for (j = 0; j < xchg; ++j) {
  110. tbl->rx_reorder_ptr[j] = tbl->rx_reorder_ptr[i + j];
  111. tbl->rx_reorder_ptr[i + j] = NULL;
  112. }
  113. }
  114. tbl->start_win = (tbl->start_win + i) & (MAX_TID_VALUE - 1);
  115. spin_unlock_irqrestore(&priv->rx_pkt_lock, flags);
  116. }
  117. /*
  118. * This function deletes the Rx reorder table and frees the memory.
  119. *
  120. * The function stops the associated timer and dispatches all the
  121. * pending packets in the Rx reorder table before deletion.
  122. */
  123. static void
  124. mwifiex_del_rx_reorder_entry(struct mwifiex_private *priv,
  125. struct mwifiex_rx_reorder_tbl *tbl)
  126. {
  127. unsigned long flags;
  128. if (!tbl)
  129. return;
  130. mwifiex_11n_dispatch_pkt(priv, tbl, (tbl->start_win + tbl->win_size) &
  131. (MAX_TID_VALUE - 1));
  132. del_timer(&tbl->timer_context.timer);
  133. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  134. list_del(&tbl->list);
  135. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  136. kfree(tbl->rx_reorder_ptr);
  137. kfree(tbl);
  138. }
  139. /*
  140. * This function returns the pointer to an entry in Rx reordering
  141. * table which matches the given TA/TID pair.
  142. */
  143. struct mwifiex_rx_reorder_tbl *
  144. mwifiex_11n_get_rx_reorder_tbl(struct mwifiex_private *priv, int tid, u8 *ta)
  145. {
  146. struct mwifiex_rx_reorder_tbl *tbl;
  147. unsigned long flags;
  148. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  149. list_for_each_entry(tbl, &priv->rx_reorder_tbl_ptr, list) {
  150. if (!memcmp(tbl->ta, ta, ETH_ALEN) && tbl->tid == tid) {
  151. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock,
  152. flags);
  153. return tbl;
  154. }
  155. }
  156. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  157. return NULL;
  158. }
  159. /* This function retrieves the pointer to an entry in Rx reordering
  160. * table which matches the given TA and deletes it.
  161. */
  162. void mwifiex_11n_del_rx_reorder_tbl_by_ta(struct mwifiex_private *priv, u8 *ta)
  163. {
  164. struct mwifiex_rx_reorder_tbl *tbl, *tmp;
  165. unsigned long flags;
  166. if (!ta)
  167. return;
  168. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  169. list_for_each_entry_safe(tbl, tmp, &priv->rx_reorder_tbl_ptr, list) {
  170. if (!memcmp(tbl->ta, ta, ETH_ALEN)) {
  171. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock,
  172. flags);
  173. mwifiex_del_rx_reorder_entry(priv, tbl);
  174. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  175. }
  176. }
  177. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  178. return;
  179. }
  180. /*
  181. * This function finds the last sequence number used in the packets
  182. * buffered in Rx reordering table.
  183. */
  184. static int
  185. mwifiex_11n_find_last_seq_num(struct mwifiex_rx_reorder_tbl *rx_reorder_tbl_ptr)
  186. {
  187. int i;
  188. for (i = (rx_reorder_tbl_ptr->win_size - 1); i >= 0; --i)
  189. if (rx_reorder_tbl_ptr->rx_reorder_ptr[i])
  190. return i;
  191. return -1;
  192. }
  193. /*
  194. * This function flushes all the packets in Rx reordering table.
  195. *
  196. * The function checks if any packets are currently buffered in the
  197. * table or not. In case there are packets available, it dispatches
  198. * them and then dumps the Rx reordering table.
  199. */
  200. static void
  201. mwifiex_flush_data(unsigned long context)
  202. {
  203. struct reorder_tmr_cnxt *ctx =
  204. (struct reorder_tmr_cnxt *) context;
  205. int start_win;
  206. start_win = mwifiex_11n_find_last_seq_num(ctx->ptr);
  207. if (start_win < 0)
  208. return;
  209. dev_dbg(ctx->priv->adapter->dev, "info: flush data %d\n", start_win);
  210. mwifiex_11n_dispatch_pkt(ctx->priv, ctx->ptr,
  211. (ctx->ptr->start_win + start_win + 1) &
  212. (MAX_TID_VALUE - 1));
  213. }
  214. /*
  215. * This function creates an entry in Rx reordering table for the
  216. * given TA/TID.
  217. *
  218. * The function also initializes the entry with sequence number, window
  219. * size as well as initializes the timer.
  220. *
  221. * If the received TA/TID pair is already present, all the packets are
  222. * dispatched and the window size is moved until the SSN.
  223. */
  224. static void
  225. mwifiex_11n_create_rx_reorder_tbl(struct mwifiex_private *priv, u8 *ta,
  226. int tid, int win_size, int seq_num)
  227. {
  228. int i;
  229. struct mwifiex_rx_reorder_tbl *tbl, *new_node;
  230. u16 last_seq = 0;
  231. unsigned long flags;
  232. struct mwifiex_sta_node *node;
  233. /*
  234. * If we get a TID, ta pair which is already present dispatch all the
  235. * the packets and move the window size until the ssn
  236. */
  237. tbl = mwifiex_11n_get_rx_reorder_tbl(priv, tid, ta);
  238. if (tbl) {
  239. mwifiex_11n_dispatch_pkt(priv, tbl, seq_num);
  240. return;
  241. }
  242. /* if !tbl then create one */
  243. new_node = kzalloc(sizeof(struct mwifiex_rx_reorder_tbl), GFP_KERNEL);
  244. if (!new_node) {
  245. dev_err(priv->adapter->dev, "%s: failed to alloc new_node\n",
  246. __func__);
  247. return;
  248. }
  249. INIT_LIST_HEAD(&new_node->list);
  250. new_node->tid = tid;
  251. memcpy(new_node->ta, ta, ETH_ALEN);
  252. new_node->start_win = seq_num;
  253. if (mwifiex_queuing_ra_based(priv)) {
  254. dev_dbg(priv->adapter->dev,
  255. "info: AP/ADHOC:last_seq=%d start_win=%d\n",
  256. last_seq, new_node->start_win);
  257. if (priv->bss_role == MWIFIEX_BSS_ROLE_UAP) {
  258. node = mwifiex_get_sta_entry(priv, ta);
  259. if (node)
  260. last_seq = node->rx_seq[tid];
  261. }
  262. } else {
  263. last_seq = priv->rx_seq[tid];
  264. }
  265. if (last_seq != MWIFIEX_DEF_11N_RX_SEQ_NUM &&
  266. last_seq >= new_node->start_win)
  267. new_node->start_win = last_seq + 1;
  268. new_node->win_size = win_size;
  269. new_node->rx_reorder_ptr = kzalloc(sizeof(void *) * win_size,
  270. GFP_KERNEL);
  271. if (!new_node->rx_reorder_ptr) {
  272. kfree((u8 *) new_node);
  273. dev_err(priv->adapter->dev,
  274. "%s: failed to alloc reorder_ptr\n", __func__);
  275. return;
  276. }
  277. new_node->timer_context.ptr = new_node;
  278. new_node->timer_context.priv = priv;
  279. init_timer(&new_node->timer_context.timer);
  280. new_node->timer_context.timer.function = mwifiex_flush_data;
  281. new_node->timer_context.timer.data =
  282. (unsigned long) &new_node->timer_context;
  283. for (i = 0; i < win_size; ++i)
  284. new_node->rx_reorder_ptr[i] = NULL;
  285. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  286. list_add_tail(&new_node->list, &priv->rx_reorder_tbl_ptr);
  287. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  288. }
  289. /*
  290. * This function prepares command for adding a BA request.
  291. *
  292. * Preparation includes -
  293. * - Setting command ID and proper size
  294. * - Setting add BA request buffer
  295. * - Ensuring correct endian-ness
  296. */
  297. int mwifiex_cmd_11n_addba_req(struct host_cmd_ds_command *cmd, void *data_buf)
  298. {
  299. struct host_cmd_ds_11n_addba_req *add_ba_req = &cmd->params.add_ba_req;
  300. cmd->command = cpu_to_le16(HostCmd_CMD_11N_ADDBA_REQ);
  301. cmd->size = cpu_to_le16(sizeof(*add_ba_req) + S_DS_GEN);
  302. memcpy(add_ba_req, data_buf, sizeof(*add_ba_req));
  303. return 0;
  304. }
  305. /*
  306. * This function prepares command for adding a BA response.
  307. *
  308. * Preparation includes -
  309. * - Setting command ID and proper size
  310. * - Setting add BA response buffer
  311. * - Ensuring correct endian-ness
  312. */
  313. int mwifiex_cmd_11n_addba_rsp_gen(struct mwifiex_private *priv,
  314. struct host_cmd_ds_command *cmd,
  315. struct host_cmd_ds_11n_addba_req
  316. *cmd_addba_req)
  317. {
  318. struct host_cmd_ds_11n_addba_rsp *add_ba_rsp = &cmd->params.add_ba_rsp;
  319. u8 tid;
  320. int win_size;
  321. uint16_t block_ack_param_set;
  322. cmd->command = cpu_to_le16(HostCmd_CMD_11N_ADDBA_RSP);
  323. cmd->size = cpu_to_le16(sizeof(*add_ba_rsp) + S_DS_GEN);
  324. memcpy(add_ba_rsp->peer_mac_addr, cmd_addba_req->peer_mac_addr,
  325. ETH_ALEN);
  326. add_ba_rsp->dialog_token = cmd_addba_req->dialog_token;
  327. add_ba_rsp->block_ack_tmo = cmd_addba_req->block_ack_tmo;
  328. add_ba_rsp->ssn = cmd_addba_req->ssn;
  329. block_ack_param_set = le16_to_cpu(cmd_addba_req->block_ack_param_set);
  330. tid = (block_ack_param_set & IEEE80211_ADDBA_PARAM_TID_MASK)
  331. >> BLOCKACKPARAM_TID_POS;
  332. add_ba_rsp->status_code = cpu_to_le16(ADDBA_RSP_STATUS_ACCEPT);
  333. block_ack_param_set &= ~IEEE80211_ADDBA_PARAM_BUF_SIZE_MASK;
  334. /* We donot support AMSDU inside AMPDU, hence reset the bit */
  335. block_ack_param_set &= ~BLOCKACKPARAM_AMSDU_SUPP_MASK;
  336. block_ack_param_set |= (priv->add_ba_param.rx_win_size <<
  337. BLOCKACKPARAM_WINSIZE_POS);
  338. add_ba_rsp->block_ack_param_set = cpu_to_le16(block_ack_param_set);
  339. win_size = (le16_to_cpu(add_ba_rsp->block_ack_param_set)
  340. & IEEE80211_ADDBA_PARAM_BUF_SIZE_MASK)
  341. >> BLOCKACKPARAM_WINSIZE_POS;
  342. cmd_addba_req->block_ack_param_set = cpu_to_le16(block_ack_param_set);
  343. mwifiex_11n_create_rx_reorder_tbl(priv, cmd_addba_req->peer_mac_addr,
  344. tid, win_size,
  345. le16_to_cpu(cmd_addba_req->ssn));
  346. return 0;
  347. }
  348. /*
  349. * This function prepares command for deleting a BA request.
  350. *
  351. * Preparation includes -
  352. * - Setting command ID and proper size
  353. * - Setting del BA request buffer
  354. * - Ensuring correct endian-ness
  355. */
  356. int mwifiex_cmd_11n_delba(struct host_cmd_ds_command *cmd, void *data_buf)
  357. {
  358. struct host_cmd_ds_11n_delba *del_ba = &cmd->params.del_ba;
  359. cmd->command = cpu_to_le16(HostCmd_CMD_11N_DELBA);
  360. cmd->size = cpu_to_le16(sizeof(*del_ba) + S_DS_GEN);
  361. memcpy(del_ba, data_buf, sizeof(*del_ba));
  362. return 0;
  363. }
  364. /*
  365. * This function identifies if Rx reordering is needed for a received packet.
  366. *
  367. * In case reordering is required, the function will do the reordering
  368. * before sending it to kernel.
  369. *
  370. * The Rx reorder table is checked first with the received TID/TA pair. If
  371. * not found, the received packet is dispatched immediately. But if found,
  372. * the packet is reordered and all the packets in the updated Rx reordering
  373. * table is dispatched until a hole is found.
  374. *
  375. * For sequence number less than the starting window, the packet is dropped.
  376. */
  377. int mwifiex_11n_rx_reorder_pkt(struct mwifiex_private *priv,
  378. u16 seq_num, u16 tid,
  379. u8 *ta, u8 pkt_type, void *payload)
  380. {
  381. struct mwifiex_rx_reorder_tbl *tbl;
  382. int start_win, end_win, win_size;
  383. u16 pkt_index;
  384. tbl = mwifiex_11n_get_rx_reorder_tbl(priv, tid, ta);
  385. if (!tbl) {
  386. if (pkt_type != PKT_TYPE_BAR) {
  387. if (priv->bss_role == MWIFIEX_BSS_ROLE_UAP)
  388. mwifiex_handle_uap_rx_forward(priv, payload);
  389. else
  390. mwifiex_process_rx_packet(priv->adapter,
  391. payload);
  392. }
  393. return 0;
  394. }
  395. start_win = tbl->start_win;
  396. win_size = tbl->win_size;
  397. end_win = ((start_win + win_size) - 1) & (MAX_TID_VALUE - 1);
  398. del_timer(&tbl->timer_context.timer);
  399. mod_timer(&tbl->timer_context.timer,
  400. jiffies + (MIN_FLUSH_TIMER_MS * win_size * HZ) / 1000);
  401. /*
  402. * If seq_num is less then starting win then ignore and drop the
  403. * packet
  404. */
  405. if ((start_win + TWOPOW11) > (MAX_TID_VALUE - 1)) {/* Wrap */
  406. if (seq_num >= ((start_win + TWOPOW11) &
  407. (MAX_TID_VALUE - 1)) && (seq_num < start_win))
  408. return -1;
  409. } else if ((seq_num < start_win) ||
  410. (seq_num > (start_win + TWOPOW11))) {
  411. return -1;
  412. }
  413. /*
  414. * If this packet is a BAR we adjust seq_num as
  415. * WinStart = seq_num
  416. */
  417. if (pkt_type == PKT_TYPE_BAR)
  418. seq_num = ((seq_num + win_size) - 1) & (MAX_TID_VALUE - 1);
  419. if (((end_win < start_win) &&
  420. (seq_num < (TWOPOW11 - (MAX_TID_VALUE - start_win))) &&
  421. (seq_num > end_win)) ||
  422. ((end_win > start_win) && ((seq_num > end_win) ||
  423. (seq_num < start_win)))) {
  424. end_win = seq_num;
  425. if (((seq_num - win_size) + 1) >= 0)
  426. start_win = (end_win - win_size) + 1;
  427. else
  428. start_win = (MAX_TID_VALUE - (win_size - seq_num)) + 1;
  429. mwifiex_11n_dispatch_pkt(priv, tbl, start_win);
  430. }
  431. if (pkt_type != PKT_TYPE_BAR) {
  432. if (seq_num >= start_win)
  433. pkt_index = seq_num - start_win;
  434. else
  435. pkt_index = (seq_num+MAX_TID_VALUE) - start_win;
  436. if (tbl->rx_reorder_ptr[pkt_index])
  437. return -1;
  438. tbl->rx_reorder_ptr[pkt_index] = payload;
  439. }
  440. /*
  441. * Dispatch all packets sequentially from start_win until a
  442. * hole is found and adjust the start_win appropriately
  443. */
  444. mwifiex_11n_scan_and_dispatch(priv, tbl);
  445. return 0;
  446. }
  447. /*
  448. * This function deletes an entry for a given TID/TA pair.
  449. *
  450. * The TID/TA are taken from del BA event body.
  451. */
  452. void
  453. mwifiex_del_ba_tbl(struct mwifiex_private *priv, int tid, u8 *peer_mac,
  454. u8 type, int initiator)
  455. {
  456. struct mwifiex_rx_reorder_tbl *tbl;
  457. struct mwifiex_tx_ba_stream_tbl *ptx_tbl;
  458. u8 cleanup_rx_reorder_tbl;
  459. unsigned long flags;
  460. if (type == TYPE_DELBA_RECEIVE)
  461. cleanup_rx_reorder_tbl = (initiator) ? true : false;
  462. else
  463. cleanup_rx_reorder_tbl = (initiator) ? false : true;
  464. dev_dbg(priv->adapter->dev, "event: DELBA: %pM tid=%d initiator=%d\n",
  465. peer_mac, tid, initiator);
  466. if (cleanup_rx_reorder_tbl) {
  467. tbl = mwifiex_11n_get_rx_reorder_tbl(priv, tid,
  468. peer_mac);
  469. if (!tbl) {
  470. dev_dbg(priv->adapter->dev,
  471. "event: TID, TA not found in table\n");
  472. return;
  473. }
  474. mwifiex_del_rx_reorder_entry(priv, tbl);
  475. } else {
  476. ptx_tbl = mwifiex_get_ba_tbl(priv, tid, peer_mac);
  477. if (!ptx_tbl) {
  478. dev_dbg(priv->adapter->dev,
  479. "event: TID, RA not found in table\n");
  480. return;
  481. }
  482. spin_lock_irqsave(&priv->tx_ba_stream_tbl_lock, flags);
  483. mwifiex_11n_delete_tx_ba_stream_tbl_entry(priv, ptx_tbl);
  484. spin_unlock_irqrestore(&priv->tx_ba_stream_tbl_lock, flags);
  485. }
  486. }
  487. /*
  488. * This function handles the command response of an add BA response.
  489. *
  490. * Handling includes changing the header fields into CPU format and
  491. * creating the stream, provided the add BA is accepted.
  492. */
  493. int mwifiex_ret_11n_addba_resp(struct mwifiex_private *priv,
  494. struct host_cmd_ds_command *resp)
  495. {
  496. struct host_cmd_ds_11n_addba_rsp *add_ba_rsp = &resp->params.add_ba_rsp;
  497. int tid, win_size;
  498. struct mwifiex_rx_reorder_tbl *tbl;
  499. uint16_t block_ack_param_set;
  500. block_ack_param_set = le16_to_cpu(add_ba_rsp->block_ack_param_set);
  501. tid = (block_ack_param_set & IEEE80211_ADDBA_PARAM_TID_MASK)
  502. >> BLOCKACKPARAM_TID_POS;
  503. /*
  504. * Check if we had rejected the ADDBA, if yes then do not create
  505. * the stream
  506. */
  507. if (le16_to_cpu(add_ba_rsp->status_code) == BA_RESULT_SUCCESS) {
  508. win_size = (block_ack_param_set &
  509. IEEE80211_ADDBA_PARAM_BUF_SIZE_MASK)
  510. >> BLOCKACKPARAM_WINSIZE_POS;
  511. dev_dbg(priv->adapter->dev,
  512. "cmd: ADDBA RSP: %pM tid=%d ssn=%d win_size=%d\n",
  513. add_ba_rsp->peer_mac_addr, tid,
  514. add_ba_rsp->ssn, win_size);
  515. } else {
  516. dev_err(priv->adapter->dev, "ADDBA RSP: failed %pM tid=%d)\n",
  517. add_ba_rsp->peer_mac_addr, tid);
  518. tbl = mwifiex_11n_get_rx_reorder_tbl(priv, tid,
  519. add_ba_rsp->peer_mac_addr);
  520. if (tbl)
  521. mwifiex_del_rx_reorder_entry(priv, tbl);
  522. }
  523. return 0;
  524. }
  525. /*
  526. * This function handles BA stream timeout event by preparing and sending
  527. * a command to the firmware.
  528. */
  529. void mwifiex_11n_ba_stream_timeout(struct mwifiex_private *priv,
  530. struct host_cmd_ds_11n_batimeout *event)
  531. {
  532. struct host_cmd_ds_11n_delba delba;
  533. memset(&delba, 0, sizeof(struct host_cmd_ds_11n_delba));
  534. memcpy(delba.peer_mac_addr, event->peer_mac_addr, ETH_ALEN);
  535. delba.del_ba_param_set |=
  536. cpu_to_le16((u16) event->tid << DELBA_TID_POS);
  537. delba.del_ba_param_set |= cpu_to_le16(
  538. (u16) event->origninator << DELBA_INITIATOR_POS);
  539. delba.reason_code = cpu_to_le16(WLAN_REASON_QSTA_TIMEOUT);
  540. mwifiex_send_cmd_async(priv, HostCmd_CMD_11N_DELBA, 0, 0, &delba);
  541. }
  542. /*
  543. * This function cleans up the Rx reorder table by deleting all the entries
  544. * and re-initializing.
  545. */
  546. void mwifiex_11n_cleanup_reorder_tbl(struct mwifiex_private *priv)
  547. {
  548. struct mwifiex_rx_reorder_tbl *del_tbl_ptr, *tmp_node;
  549. unsigned long flags;
  550. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  551. list_for_each_entry_safe(del_tbl_ptr, tmp_node,
  552. &priv->rx_reorder_tbl_ptr, list) {
  553. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  554. mwifiex_del_rx_reorder_entry(priv, del_tbl_ptr);
  555. spin_lock_irqsave(&priv->rx_reorder_tbl_lock, flags);
  556. }
  557. spin_unlock_irqrestore(&priv->rx_reorder_tbl_lock, flags);
  558. INIT_LIST_HEAD(&priv->rx_reorder_tbl_ptr);
  559. mwifiex_reset_11n_rx_seq_num(priv);
  560. }