dp_li_rx.c 31 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2023 Qualcomm Innovation Center, Inc. All rights reserved.
  4. *
  5. * Permission to use, copy, modify, and/or distribute this software for
  6. * any purpose with or without fee is hereby granted, provided that the
  7. * above copyright notice and this permission notice appear in all
  8. * copies.
  9. *
  10. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  11. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  12. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  13. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  14. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  15. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  16. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  17. * PERFORMANCE OF THIS SOFTWARE.
  18. */
  19. #include "cdp_txrx_cmn_struct.h"
  20. #include "hal_hw_headers.h"
  21. #include "dp_types.h"
  22. #include "dp_rx.h"
  23. #include "dp_tx.h"
  24. #include "dp_li_rx.h"
  25. #include "dp_peer.h"
  26. #include "hal_rx.h"
  27. #include "hal_li_rx.h"
  28. #include "hal_api.h"
  29. #include "hal_li_api.h"
  30. #include "qdf_nbuf.h"
  31. #ifdef MESH_MODE_SUPPORT
  32. #include "if_meta_hdr.h"
  33. #endif
  34. #include "dp_internal.h"
  35. #include "dp_ipa.h"
  36. #ifdef WIFI_MONITOR_SUPPORT
  37. #include <dp_mon.h>
  38. #endif
  39. #ifdef FEATURE_WDS
  40. #include "dp_txrx_wds.h"
  41. #endif
  42. #include "dp_hist.h"
  43. #include "dp_rx_buffer_pool.h"
  44. #include "dp_li.h"
  45. static inline
  46. bool is_sa_da_idx_valid(uint32_t max_ast,
  47. qdf_nbuf_t nbuf, struct hal_rx_msdu_metadata msdu_info)
  48. {
  49. if ((qdf_nbuf_is_sa_valid(nbuf) && (msdu_info.sa_idx > max_ast)) ||
  50. (!qdf_nbuf_is_da_mcbc(nbuf) && qdf_nbuf_is_da_valid(nbuf) &&
  51. (msdu_info.da_idx > max_ast)))
  52. return false;
  53. return true;
  54. }
  55. #ifndef QCA_HOST_MODE_WIFI_DISABLED
  56. #if defined(FEATURE_MCL_REPEATER) && defined(FEATURE_MEC)
  57. /**
  58. * dp_rx_mec_check_wrapper() - wrapper to dp_rx_mcast_echo_check
  59. * @soc: core DP main context
  60. * @txrx_peer: dp peer handler
  61. * @rx_tlv_hdr: start of the rx TLV header
  62. * @nbuf: pkt buffer
  63. *
  64. * Return: bool (true if it is a looped back pkt else false)
  65. */
  66. static inline bool dp_rx_mec_check_wrapper(struct dp_soc *soc,
  67. struct dp_txrx_peer *txrx_peer,
  68. uint8_t *rx_tlv_hdr,
  69. qdf_nbuf_t nbuf)
  70. {
  71. return dp_rx_mcast_echo_check(soc, txrx_peer, rx_tlv_hdr, nbuf);
  72. }
  73. #else
  74. static inline bool dp_rx_mec_check_wrapper(struct dp_soc *soc,
  75. struct dp_txrx_peer *txrx_peer,
  76. uint8_t *rx_tlv_hdr,
  77. qdf_nbuf_t nbuf)
  78. {
  79. return false;
  80. }
  81. #endif
  82. #endif
  83. #ifndef QCA_HOST_MODE_WIFI_DISABLE
  84. static bool
  85. dp_rx_intrabss_ucast_check_li(struct dp_soc *soc, qdf_nbuf_t nbuf,
  86. struct dp_txrx_peer *ta_txrx_peer,
  87. struct hal_rx_msdu_metadata *msdu_metadata,
  88. uint8_t *p_tx_vdev_id)
  89. {
  90. uint16_t da_peer_id;
  91. struct dp_txrx_peer *da_peer;
  92. struct dp_ast_entry *ast_entry;
  93. dp_txrx_ref_handle txrx_ref_handle = NULL;
  94. if (!qdf_nbuf_is_da_valid(nbuf) || qdf_nbuf_is_da_mcbc(nbuf))
  95. return false;
  96. ast_entry = soc->ast_table[msdu_metadata->da_idx];
  97. if (!ast_entry)
  98. return false;
  99. if (ast_entry->type == CDP_TXRX_AST_TYPE_DA) {
  100. ast_entry->is_active = TRUE;
  101. return false;
  102. }
  103. da_peer_id = ast_entry->peer_id;
  104. /* TA peer cannot be same as peer(DA) on which AST is present
  105. * this indicates a change in topology and that AST entries
  106. * are yet to be updated.
  107. */
  108. if (da_peer_id == ta_txrx_peer->peer_id ||
  109. da_peer_id == HTT_INVALID_PEER)
  110. return false;
  111. da_peer = dp_txrx_peer_get_ref_by_id(soc, da_peer_id,
  112. &txrx_ref_handle, DP_MOD_ID_RX);
  113. if (!da_peer)
  114. return false;
  115. *p_tx_vdev_id = da_peer->vdev->vdev_id;
  116. /* If the source or destination peer in the isolation
  117. * list then dont forward instead push to bridge stack.
  118. */
  119. if (dp_get_peer_isolation(ta_txrx_peer) ||
  120. dp_get_peer_isolation(da_peer) ||
  121. da_peer->vdev->vdev_id != ta_txrx_peer->vdev->vdev_id) {
  122. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  123. return false;
  124. }
  125. if (da_peer->bss_peer) {
  126. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  127. return false;
  128. }
  129. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  130. return true;
  131. }
  132. /*
  133. * dp_rx_intrabss_fwd_li() - Implements the Intra-BSS forwarding logic
  134. *
  135. * @soc: core txrx main context
  136. * @ta_txrx_peer : source peer entry
  137. * @rx_tlv_hdr : start address of rx tlvs
  138. * @nbuf : nbuf that has to be intrabss forwarded
  139. *
  140. * Return: bool: true if it is forwarded else false
  141. */
  142. static bool
  143. dp_rx_intrabss_fwd_li(struct dp_soc *soc,
  144. struct dp_txrx_peer *ta_txrx_peer,
  145. uint8_t *rx_tlv_hdr,
  146. qdf_nbuf_t nbuf,
  147. struct hal_rx_msdu_metadata msdu_metadata,
  148. struct cdp_tid_rx_stats *tid_stats)
  149. {
  150. uint8_t tx_vdev_id;
  151. /* if it is a broadcast pkt (eg: ARP) and it is not its own
  152. * source, then clone the pkt and send the cloned pkt for
  153. * intra BSS forwarding and original pkt up the network stack
  154. * Note: how do we handle multicast pkts. do we forward
  155. * all multicast pkts as is or let a higher layer module
  156. * like igmpsnoop decide whether to forward or not with
  157. * Mcast enhancement.
  158. */
  159. if (qdf_nbuf_is_da_mcbc(nbuf) && !ta_txrx_peer->bss_peer)
  160. return dp_rx_intrabss_mcbc_fwd(soc, ta_txrx_peer, rx_tlv_hdr,
  161. nbuf, tid_stats);
  162. if (dp_rx_intrabss_eapol_drop_check(soc, ta_txrx_peer, rx_tlv_hdr,
  163. nbuf))
  164. return true;
  165. if (dp_rx_intrabss_ucast_check_li(soc, nbuf, ta_txrx_peer,
  166. &msdu_metadata, &tx_vdev_id))
  167. return dp_rx_intrabss_ucast_fwd(soc, ta_txrx_peer, tx_vdev_id,
  168. rx_tlv_hdr, nbuf, tid_stats);
  169. return false;
  170. }
  171. #endif
  172. uint32_t dp_rx_process_li(struct dp_intr *int_ctx,
  173. hal_ring_handle_t hal_ring_hdl, uint8_t reo_ring_num,
  174. uint32_t quota)
  175. {
  176. hal_ring_desc_t ring_desc;
  177. hal_ring_desc_t last_prefetched_hw_desc;
  178. hal_soc_handle_t hal_soc;
  179. struct dp_rx_desc *rx_desc = NULL;
  180. struct dp_rx_desc *last_prefetched_sw_desc = NULL;
  181. qdf_nbuf_t nbuf, next;
  182. bool near_full;
  183. union dp_rx_desc_list_elem_t *head[MAX_PDEV_CNT];
  184. union dp_rx_desc_list_elem_t *tail[MAX_PDEV_CNT];
  185. uint32_t num_pending = 0;
  186. uint32_t rx_bufs_used = 0, rx_buf_cookie;
  187. uint16_t msdu_len = 0;
  188. uint16_t peer_id;
  189. uint8_t vdev_id;
  190. struct dp_txrx_peer *txrx_peer;
  191. dp_txrx_ref_handle txrx_ref_handle = NULL;
  192. struct dp_vdev *vdev;
  193. uint32_t pkt_len = 0;
  194. struct hal_rx_mpdu_desc_info mpdu_desc_info;
  195. struct hal_rx_msdu_desc_info msdu_desc_info;
  196. enum hal_reo_error_status error;
  197. uint32_t peer_mdata;
  198. uint8_t *rx_tlv_hdr;
  199. uint32_t rx_bufs_reaped[MAX_PDEV_CNT];
  200. uint8_t mac_id = 0;
  201. struct dp_pdev *rx_pdev;
  202. struct dp_srng *dp_rxdma_srng;
  203. struct rx_desc_pool *rx_desc_pool;
  204. struct dp_soc *soc = int_ctx->soc;
  205. struct cdp_tid_rx_stats *tid_stats;
  206. qdf_nbuf_t nbuf_head;
  207. qdf_nbuf_t nbuf_tail;
  208. qdf_nbuf_t deliver_list_head;
  209. qdf_nbuf_t deliver_list_tail;
  210. uint32_t num_rx_bufs_reaped = 0;
  211. uint32_t intr_id;
  212. struct hif_opaque_softc *scn;
  213. int32_t tid = 0;
  214. bool is_prev_msdu_last = true;
  215. uint32_t rx_ol_pkt_cnt = 0;
  216. uint32_t num_entries = 0;
  217. struct hal_rx_msdu_metadata msdu_metadata;
  218. QDF_STATUS status;
  219. qdf_nbuf_t ebuf_head;
  220. qdf_nbuf_t ebuf_tail;
  221. uint8_t pkt_capture_offload = 0;
  222. int max_reap_limit;
  223. uint32_t old_tid;
  224. uint32_t peer_ext_stats;
  225. uint32_t dsf;
  226. uint32_t max_ast;
  227. uint64_t current_time = 0;
  228. DP_HIST_INIT();
  229. qdf_assert_always(soc && hal_ring_hdl);
  230. hal_soc = soc->hal_soc;
  231. qdf_assert_always(hal_soc);
  232. scn = soc->hif_handle;
  233. intr_id = int_ctx->dp_intr_id;
  234. num_entries = hal_srng_get_num_entries(hal_soc, hal_ring_hdl);
  235. dp_runtime_pm_mark_last_busy(soc);
  236. more_data:
  237. /* reset local variables here to be re-used in the function */
  238. nbuf_head = NULL;
  239. nbuf_tail = NULL;
  240. deliver_list_head = NULL;
  241. deliver_list_tail = NULL;
  242. txrx_peer = NULL;
  243. vdev = NULL;
  244. num_rx_bufs_reaped = 0;
  245. ebuf_head = NULL;
  246. ebuf_tail = NULL;
  247. max_reap_limit = dp_rx_get_loop_pkt_limit(soc);
  248. qdf_mem_zero(rx_bufs_reaped, sizeof(rx_bufs_reaped));
  249. qdf_mem_zero(&mpdu_desc_info, sizeof(mpdu_desc_info));
  250. qdf_mem_zero(&msdu_desc_info, sizeof(msdu_desc_info));
  251. qdf_mem_zero(head, sizeof(head));
  252. qdf_mem_zero(tail, sizeof(tail));
  253. old_tid = 0xff;
  254. dsf = 0;
  255. peer_ext_stats = 0;
  256. max_ast = 0;
  257. rx_pdev = NULL;
  258. tid_stats = NULL;
  259. dp_pkt_get_timestamp(&current_time);
  260. if (qdf_unlikely(dp_rx_srng_access_start(int_ctx, soc, hal_ring_hdl))) {
  261. /*
  262. * Need API to convert from hal_ring pointer to
  263. * Ring Type / Ring Id combo
  264. */
  265. DP_STATS_INC(soc, rx.err.hal_ring_access_fail, 1);
  266. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  267. FL("HAL RING Access Failed -- %pK"), hal_ring_hdl);
  268. goto done;
  269. }
  270. if (!num_pending)
  271. num_pending = hal_srng_dst_num_valid(hal_soc, hal_ring_hdl, 0);
  272. dp_srng_dst_inv_cached_descs(soc, hal_ring_hdl, num_pending);
  273. if (num_pending > quota)
  274. num_pending = quota;
  275. last_prefetched_hw_desc = dp_srng_dst_prefetch(hal_soc, hal_ring_hdl,
  276. num_pending);
  277. peer_ext_stats = wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx);
  278. max_ast = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  279. /*
  280. * start reaping the buffers from reo ring and queue
  281. * them in per vdev queue.
  282. * Process the received pkts in a different per vdev loop.
  283. */
  284. while (qdf_likely(num_pending)) {
  285. ring_desc = dp_srng_dst_get_next(soc, hal_ring_hdl);
  286. if (qdf_unlikely(!ring_desc))
  287. break;
  288. error = HAL_RX_ERROR_STATUS_GET(ring_desc);
  289. if (qdf_unlikely(error == HAL_REO_ERROR_DETECTED)) {
  290. dp_rx_err("%pK: HAL RING 0x%pK:error %d",
  291. soc, hal_ring_hdl, error);
  292. DP_STATS_INC(soc, rx.err.hal_reo_error[reo_ring_num],
  293. 1);
  294. /* Don't know how to deal with this -- assert */
  295. qdf_assert(0);
  296. }
  297. dp_rx_ring_record_entry(soc, reo_ring_num, ring_desc);
  298. rx_buf_cookie = HAL_RX_REO_BUF_COOKIE_GET(ring_desc);
  299. status = dp_rx_cookie_check_and_invalidate(ring_desc);
  300. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  301. DP_STATS_INC(soc, rx.err.stale_cookie, 1);
  302. break;
  303. }
  304. rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, rx_buf_cookie);
  305. status = dp_rx_desc_sanity(soc, hal_soc, hal_ring_hdl,
  306. ring_desc, rx_desc);
  307. if (QDF_IS_STATUS_ERROR(status)) {
  308. if (qdf_unlikely(rx_desc && rx_desc->nbuf)) {
  309. qdf_assert_always(!rx_desc->unmapped);
  310. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  311. rx_desc->unmapped = 1;
  312. dp_rx_buffer_pool_nbuf_free(soc, rx_desc->nbuf,
  313. rx_desc->pool_id);
  314. dp_rx_add_to_free_desc_list(
  315. &head[rx_desc->pool_id],
  316. &tail[rx_desc->pool_id],
  317. rx_desc);
  318. }
  319. continue;
  320. }
  321. /*
  322. * this is a unlikely scenario where the host is reaping
  323. * a descriptor which it already reaped just a while ago
  324. * but is yet to replenish it back to HW.
  325. * In this case host will dump the last 128 descriptors
  326. * including the software descriptor rx_desc and assert.
  327. */
  328. if (qdf_unlikely(!rx_desc->in_use)) {
  329. DP_STATS_INC(soc, rx.err.hal_reo_dest_dup, 1);
  330. dp_info_rl("Reaping rx_desc not in use!");
  331. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  332. ring_desc, rx_desc);
  333. /* ignore duplicate RX desc and continue to process */
  334. /* Pop out the descriptor */
  335. continue;
  336. }
  337. status = dp_rx_desc_nbuf_sanity_check(soc, ring_desc, rx_desc);
  338. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  339. DP_STATS_INC(soc, rx.err.nbuf_sanity_fail, 1);
  340. dp_info_rl("Nbuf sanity check failure!");
  341. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  342. ring_desc, rx_desc);
  343. rx_desc->in_err_state = 1;
  344. continue;
  345. }
  346. if (qdf_unlikely(!dp_rx_desc_check_magic(rx_desc))) {
  347. dp_err("Invalid rx_desc cookie=%d", rx_buf_cookie);
  348. DP_STATS_INC(soc, rx.err.rx_desc_invalid_magic, 1);
  349. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  350. ring_desc, rx_desc);
  351. }
  352. /* Get MPDU DESC info */
  353. hal_rx_mpdu_desc_info_get_li(ring_desc, &mpdu_desc_info);
  354. /* Get MSDU DESC info */
  355. hal_rx_msdu_desc_info_get_li(ring_desc, &msdu_desc_info);
  356. if (qdf_unlikely(msdu_desc_info.msdu_flags &
  357. HAL_MSDU_F_MSDU_CONTINUATION)) {
  358. /* previous msdu has end bit set, so current one is
  359. * the new MPDU
  360. */
  361. if (is_prev_msdu_last) {
  362. /* For new MPDU check if we can read complete
  363. * MPDU by comparing the number of buffers
  364. * available and number of buffers needed to
  365. * reap this MPDU
  366. */
  367. if ((msdu_desc_info.msdu_len /
  368. (RX_DATA_BUFFER_SIZE -
  369. soc->rx_pkt_tlv_size) + 1) >
  370. num_pending) {
  371. DP_STATS_INC(soc,
  372. rx.msdu_scatter_wait_break,
  373. 1);
  374. dp_rx_cookie_reset_invalid_bit(
  375. ring_desc);
  376. /* As we are going to break out of the
  377. * loop because of unavailability of
  378. * descs to form complete SG, we need to
  379. * reset the TP in the REO destination
  380. * ring.
  381. */
  382. hal_srng_dst_dec_tp(hal_soc,
  383. hal_ring_hdl);
  384. break;
  385. }
  386. is_prev_msdu_last = false;
  387. }
  388. }
  389. if (mpdu_desc_info.mpdu_flags & HAL_MPDU_F_RETRY_BIT)
  390. qdf_nbuf_set_rx_retry_flag(rx_desc->nbuf, 1);
  391. if (qdf_unlikely(mpdu_desc_info.mpdu_flags &
  392. HAL_MPDU_F_RAW_AMPDU))
  393. qdf_nbuf_set_raw_frame(rx_desc->nbuf, 1);
  394. if (!is_prev_msdu_last &&
  395. msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  396. is_prev_msdu_last = true;
  397. rx_bufs_reaped[rx_desc->pool_id]++;
  398. peer_mdata = mpdu_desc_info.peer_meta_data;
  399. QDF_NBUF_CB_RX_PEER_ID(rx_desc->nbuf) =
  400. dp_rx_peer_metadata_peer_id_get_li(soc, peer_mdata);
  401. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  402. DP_PEER_METADATA_VDEV_ID_GET_LI(peer_mdata);
  403. /* to indicate whether this msdu is rx offload */
  404. pkt_capture_offload =
  405. DP_PEER_METADATA_OFFLOAD_GET_LI(peer_mdata);
  406. /*
  407. * save msdu flags first, last and continuation msdu in
  408. * nbuf->cb, also save mcbc, is_da_valid, is_sa_valid and
  409. * length to nbuf->cb. This ensures the info required for
  410. * per pkt processing is always in the same cache line.
  411. * This helps in improving throughput for smaller pkt
  412. * sizes.
  413. */
  414. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_FIRST_MSDU_IN_MPDU)
  415. qdf_nbuf_set_rx_chfrag_start(rx_desc->nbuf, 1);
  416. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_MSDU_CONTINUATION)
  417. qdf_nbuf_set_rx_chfrag_cont(rx_desc->nbuf, 1);
  418. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  419. qdf_nbuf_set_rx_chfrag_end(rx_desc->nbuf, 1);
  420. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_MCBC)
  421. qdf_nbuf_set_da_mcbc(rx_desc->nbuf, 1);
  422. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_VALID)
  423. qdf_nbuf_set_da_valid(rx_desc->nbuf, 1);
  424. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_SA_IS_VALID)
  425. qdf_nbuf_set_sa_valid(rx_desc->nbuf, 1);
  426. qdf_nbuf_set_tid_val(rx_desc->nbuf,
  427. HAL_RX_REO_QUEUE_NUMBER_GET(ring_desc));
  428. /* set reo dest indication */
  429. qdf_nbuf_set_rx_reo_dest_ind_or_sw_excpt(
  430. rx_desc->nbuf,
  431. HAL_RX_REO_MSDU_REO_DST_IND_GET(ring_desc));
  432. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  433. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  434. /*
  435. * move unmap after scattered msdu waiting break logic
  436. * in case double skb unmap happened.
  437. */
  438. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  439. rx_desc->unmapped = 1;
  440. DP_RX_PROCESS_NBUF(soc, nbuf_head, nbuf_tail, ebuf_head,
  441. ebuf_tail, rx_desc);
  442. quota -= 1;
  443. num_pending -= 1;
  444. dp_rx_add_to_free_desc_list(&head[rx_desc->pool_id],
  445. &tail[rx_desc->pool_id], rx_desc);
  446. num_rx_bufs_reaped++;
  447. dp_rx_prefetch_hw_sw_nbuf_desc(soc, hal_soc, num_pending,
  448. hal_ring_hdl,
  449. &last_prefetched_hw_desc,
  450. &last_prefetched_sw_desc);
  451. /*
  452. * only if complete msdu is received for scatter case,
  453. * then allow break.
  454. */
  455. if (is_prev_msdu_last &&
  456. dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped,
  457. max_reap_limit))
  458. break;
  459. }
  460. done:
  461. dp_rx_srng_access_end(int_ctx, soc, hal_ring_hdl);
  462. dp_rx_per_core_stats_update(soc, reo_ring_num, num_rx_bufs_reaped);
  463. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  464. /*
  465. * continue with next mac_id if no pkts were reaped
  466. * from that pool
  467. */
  468. if (!rx_bufs_reaped[mac_id])
  469. continue;
  470. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  471. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  472. dp_rx_buffers_replenish_simple(soc, mac_id, dp_rxdma_srng,
  473. rx_desc_pool,
  474. rx_bufs_reaped[mac_id],
  475. &head[mac_id], &tail[mac_id]);
  476. }
  477. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  478. /* Peer can be NULL is case of LFR */
  479. if (qdf_likely(txrx_peer))
  480. vdev = NULL;
  481. /*
  482. * BIG loop where each nbuf is dequeued from global queue,
  483. * processed and queued back on a per vdev basis. These nbufs
  484. * are sent to stack as and when we run out of nbufs
  485. * or a new nbuf dequeued from global queue has a different
  486. * vdev when compared to previous nbuf.
  487. */
  488. nbuf = nbuf_head;
  489. while (nbuf) {
  490. next = nbuf->next;
  491. dp_rx_prefetch_nbuf_data(nbuf, next);
  492. if (qdf_unlikely(dp_rx_is_raw_frame_dropped(nbuf))) {
  493. nbuf = next;
  494. DP_STATS_INC(soc, rx.err.raw_frm_drop, 1);
  495. continue;
  496. }
  497. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  498. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  499. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  500. if (dp_rx_is_list_ready(deliver_list_head, vdev, txrx_peer,
  501. peer_id, vdev_id)) {
  502. dp_rx_deliver_to_stack(soc, vdev, txrx_peer,
  503. deliver_list_head,
  504. deliver_list_tail);
  505. deliver_list_head = NULL;
  506. deliver_list_tail = NULL;
  507. }
  508. /* Get TID from struct cb->tid_val, save to tid */
  509. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  510. tid = qdf_nbuf_get_tid_val(nbuf);
  511. if (qdf_unlikely(tid >= CDP_MAX_DATA_TIDS)) {
  512. DP_STATS_INC(soc, rx.err.rx_invalid_tid_err, 1);
  513. dp_rx_nbuf_free(nbuf);
  514. nbuf = next;
  515. continue;
  516. }
  517. if (qdf_unlikely(!txrx_peer)) {
  518. txrx_peer =
  519. dp_rx_get_txrx_peer_and_vdev(soc, nbuf, peer_id,
  520. &txrx_ref_handle,
  521. pkt_capture_offload,
  522. &vdev,
  523. &rx_pdev, &dsf,
  524. &old_tid);
  525. if (qdf_unlikely(!txrx_peer) || qdf_unlikely(!vdev)) {
  526. nbuf = next;
  527. continue;
  528. }
  529. } else if (txrx_peer && txrx_peer->peer_id != peer_id) {
  530. dp_txrx_peer_unref_delete(txrx_ref_handle,
  531. DP_MOD_ID_RX);
  532. txrx_peer =
  533. dp_rx_get_txrx_peer_and_vdev(soc, nbuf, peer_id,
  534. &txrx_ref_handle,
  535. pkt_capture_offload,
  536. &vdev,
  537. &rx_pdev, &dsf,
  538. &old_tid);
  539. if (qdf_unlikely(!txrx_peer) || qdf_unlikely(!vdev)) {
  540. nbuf = next;
  541. continue;
  542. }
  543. }
  544. if (txrx_peer) {
  545. QDF_NBUF_CB_DP_TRACE_PRINT(nbuf) = false;
  546. qdf_dp_trace_set_track(nbuf, QDF_RX);
  547. QDF_NBUF_CB_RX_DP_TRACE(nbuf) = 1;
  548. QDF_NBUF_CB_RX_PACKET_TRACK(nbuf) =
  549. QDF_NBUF_RX_PKT_DATA_TRACK;
  550. }
  551. rx_bufs_used++;
  552. /* when hlos tid override is enabled, save tid in
  553. * skb->priority
  554. */
  555. if (qdf_unlikely(vdev->skip_sw_tid_classification &
  556. DP_TXRX_HLOS_TID_OVERRIDE_ENABLED))
  557. qdf_nbuf_set_priority(nbuf, tid);
  558. DP_RX_TID_SAVE(nbuf, tid);
  559. if (qdf_unlikely(dsf) || qdf_unlikely(peer_ext_stats) ||
  560. dp_rx_pkt_tracepoints_enabled())
  561. qdf_nbuf_set_timestamp(nbuf);
  562. if (qdf_likely(old_tid != tid)) {
  563. tid_stats =
  564. &rx_pdev->stats.tid_stats.tid_rx_stats[reo_ring_num][tid];
  565. old_tid = tid;
  566. }
  567. /*
  568. * Check if DMA completed -- msdu_done is the last bit
  569. * to be written
  570. */
  571. if (qdf_likely(!qdf_nbuf_is_rx_chfrag_cont(nbuf))) {
  572. if (qdf_unlikely(!hal_rx_attn_msdu_done_get_li(
  573. rx_tlv_hdr))) {
  574. dp_err_rl("MSDU DONE failure");
  575. DP_STATS_INC(soc, rx.err.msdu_done_fail, 1);
  576. hal_rx_dump_pkt_tlvs(hal_soc, rx_tlv_hdr,
  577. QDF_TRACE_LEVEL_INFO);
  578. tid_stats->fail_cnt[MSDU_DONE_FAILURE]++;
  579. qdf_assert(0);
  580. dp_rx_nbuf_free(nbuf);
  581. nbuf = next;
  582. continue;
  583. } else if (qdf_unlikely(hal_rx_attn_msdu_len_err_get_li(
  584. rx_tlv_hdr))) {
  585. DP_STATS_INC(soc, rx.err.msdu_len_err, 1);
  586. dp_rx_nbuf_free(nbuf);
  587. nbuf = next;
  588. continue;
  589. }
  590. }
  591. DP_HIST_PACKET_COUNT_INC(vdev->pdev->pdev_id);
  592. /*
  593. * First IF condition:
  594. * 802.11 Fragmented pkts are reinjected to REO
  595. * HW block as SG pkts and for these pkts we only
  596. * need to pull the RX TLVS header length.
  597. * Second IF condition:
  598. * The below condition happens when an MSDU is spread
  599. * across multiple buffers. This can happen in two cases
  600. * 1. The nbuf size is smaller then the received msdu.
  601. * ex: we have set the nbuf size to 2048 during
  602. * nbuf_alloc. but we received an msdu which is
  603. * 2304 bytes in size then this msdu is spread
  604. * across 2 nbufs.
  605. *
  606. * 2. AMSDUs when RAW mode is enabled.
  607. * ex: 1st MSDU is in 1st nbuf and 2nd MSDU is spread
  608. * across 1st nbuf and 2nd nbuf and last MSDU is
  609. * spread across 2nd nbuf and 3rd nbuf.
  610. *
  611. * for these scenarios let us create a skb frag_list and
  612. * append these buffers till the last MSDU of the AMSDU
  613. * Third condition:
  614. * This is the most likely case, we receive 802.3 pkts
  615. * decapsulated by HW, here we need to set the pkt length.
  616. */
  617. hal_rx_msdu_metadata_get(hal_soc, rx_tlv_hdr, &msdu_metadata);
  618. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  619. bool is_mcbc, is_sa_vld, is_da_vld;
  620. is_mcbc = hal_rx_msdu_end_da_is_mcbc_get(soc->hal_soc,
  621. rx_tlv_hdr);
  622. is_sa_vld =
  623. hal_rx_msdu_end_sa_is_valid_get(soc->hal_soc,
  624. rx_tlv_hdr);
  625. is_da_vld =
  626. hal_rx_msdu_end_da_is_valid_get(soc->hal_soc,
  627. rx_tlv_hdr);
  628. qdf_nbuf_set_da_mcbc(nbuf, is_mcbc);
  629. qdf_nbuf_set_da_valid(nbuf, is_da_vld);
  630. qdf_nbuf_set_sa_valid(nbuf, is_sa_vld);
  631. qdf_nbuf_pull_head(nbuf, soc->rx_pkt_tlv_size);
  632. } else if (qdf_nbuf_is_rx_chfrag_cont(nbuf)) {
  633. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  634. nbuf = dp_rx_sg_create(soc, nbuf);
  635. next = nbuf->next;
  636. if (qdf_nbuf_is_raw_frame(nbuf)) {
  637. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  638. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  639. rx.raw, 1,
  640. msdu_len);
  641. } else {
  642. DP_STATS_INC(soc, rx.err.scatter_msdu, 1);
  643. if (!dp_rx_is_sg_supported()) {
  644. dp_rx_nbuf_free(nbuf);
  645. dp_info_rl("sg msdu len %d, dropped",
  646. msdu_len);
  647. nbuf = next;
  648. continue;
  649. }
  650. }
  651. } else {
  652. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  653. pkt_len = msdu_len +
  654. msdu_metadata.l3_hdr_pad +
  655. soc->rx_pkt_tlv_size;
  656. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  657. dp_rx_skip_tlvs(soc, nbuf, msdu_metadata.l3_hdr_pad);
  658. }
  659. dp_rx_send_pktlog(soc, rx_pdev, nbuf, QDF_TX_RX_STATUS_OK);
  660. /*
  661. * process frame for mulitpass phrase processing
  662. */
  663. if (qdf_unlikely(vdev->multipass_en)) {
  664. if (dp_rx_multipass_process(txrx_peer, nbuf,
  665. tid) == false) {
  666. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  667. rx.multipass_rx_pkt_drop,
  668. 1);
  669. dp_rx_nbuf_free(nbuf);
  670. nbuf = next;
  671. continue;
  672. }
  673. }
  674. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, txrx_peer)) {
  675. dp_rx_err("%pK: Policy Check Drop pkt", soc);
  676. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  677. rx.policy_check_drop, 1);
  678. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  679. /* Drop & free packet */
  680. dp_rx_nbuf_free(nbuf);
  681. /* Statistics */
  682. nbuf = next;
  683. continue;
  684. }
  685. if (qdf_unlikely(txrx_peer && (txrx_peer->nawds_enabled) &&
  686. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  687. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  688. rx_tlv_hdr) ==
  689. false))) {
  690. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  691. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  692. rx.nawds_mcast_drop, 1);
  693. dp_rx_nbuf_free(nbuf);
  694. nbuf = next;
  695. continue;
  696. }
  697. /*
  698. * Drop non-EAPOL frames from unauthorized peer.
  699. */
  700. if (qdf_likely(txrx_peer) &&
  701. qdf_unlikely(!txrx_peer->authorize) &&
  702. !qdf_nbuf_is_raw_frame(nbuf)) {
  703. bool is_eapol = qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  704. qdf_nbuf_is_ipv4_wapi_pkt(nbuf);
  705. if (!is_eapol) {
  706. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  707. rx.peer_unauth_rx_pkt_drop,
  708. 1);
  709. dp_rx_nbuf_free(nbuf);
  710. nbuf = next;
  711. continue;
  712. }
  713. }
  714. if (soc->process_rx_status)
  715. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  716. /* Update the protocol tag in SKB based on CCE metadata */
  717. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  718. reo_ring_num, false, true);
  719. /* Update the flow tag in SKB based on FSE metadata */
  720. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  721. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, txrx_peer,
  722. reo_ring_num, tid_stats);
  723. if (qdf_unlikely(vdev->mesh_vdev)) {
  724. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  725. == QDF_STATUS_SUCCESS) {
  726. dp_rx_info("%pK: mesh pkt filtered", soc);
  727. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  728. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  729. 1);
  730. dp_rx_nbuf_free(nbuf);
  731. nbuf = next;
  732. continue;
  733. }
  734. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr,
  735. txrx_peer);
  736. }
  737. if (qdf_likely(vdev->rx_decap_type ==
  738. htt_cmn_pkt_type_ethernet) &&
  739. qdf_likely(!vdev->mesh_vdev)) {
  740. /* Due to HW issue, sometimes we see that the sa_idx
  741. * and da_idx are invalid with sa_valid and da_valid
  742. * bits set
  743. *
  744. * in this case we also see that value of
  745. * sa_sw_peer_id is set as 0
  746. *
  747. * Drop the packet if sa_idx and da_idx OOB or
  748. * sa_sw_peerid is 0
  749. */
  750. if (!is_sa_da_idx_valid(max_ast, nbuf,
  751. msdu_metadata)) {
  752. dp_rx_nbuf_free(nbuf);
  753. nbuf = next;
  754. DP_STATS_INC(soc, rx.err.invalid_sa_da_idx, 1);
  755. continue;
  756. }
  757. if (qdf_unlikely(dp_rx_mec_check_wrapper(soc,
  758. txrx_peer,
  759. rx_tlv_hdr,
  760. nbuf))) {
  761. /* this is a looped back MCBC pkt,drop it */
  762. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  763. rx.mec_drop, 1,
  764. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  765. dp_rx_nbuf_free(nbuf);
  766. nbuf = next;
  767. continue;
  768. }
  769. /* WDS Source Port Learning */
  770. if (qdf_likely(vdev->wds_enabled))
  771. dp_rx_wds_srcport_learn(soc,
  772. rx_tlv_hdr,
  773. txrx_peer,
  774. nbuf,
  775. msdu_metadata);
  776. /* Intrabss-fwd */
  777. if (dp_rx_check_ap_bridge(vdev))
  778. if (dp_rx_intrabss_fwd_li(soc, txrx_peer,
  779. rx_tlv_hdr,
  780. nbuf,
  781. msdu_metadata,
  782. tid_stats)) {
  783. nbuf = next;
  784. tid_stats->intrabss_cnt++;
  785. continue; /* Get next desc */
  786. }
  787. }
  788. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  789. dp_rx_mark_first_packet_after_wow_wakeup(vdev->pdev, rx_tlv_hdr,
  790. nbuf);
  791. dp_rx_update_stats(soc, nbuf);
  792. dp_pkt_add_timestamp(txrx_peer->vdev, QDF_PKT_RX_DRIVER_ENTRY,
  793. current_time, nbuf);
  794. DP_RX_LIST_APPEND(deliver_list_head,
  795. deliver_list_tail,
  796. nbuf);
  797. DP_PEER_STATS_FLAT_INC_PKT(txrx_peer, to_stack, 1,
  798. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  799. if (qdf_unlikely(txrx_peer->in_twt))
  800. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  801. rx.to_stack_twt, 1,
  802. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  803. tid_stats->delivered_to_stack++;
  804. nbuf = next;
  805. }
  806. DP_RX_DELIVER_TO_STACK(soc, vdev, txrx_peer, peer_id,
  807. pkt_capture_offload,
  808. deliver_list_head,
  809. deliver_list_tail);
  810. if (qdf_likely(txrx_peer))
  811. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  812. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  813. if (quota) {
  814. num_pending =
  815. dp_rx_srng_get_num_pending(hal_soc,
  816. hal_ring_hdl,
  817. num_entries,
  818. &near_full);
  819. if (num_pending) {
  820. DP_STATS_INC(soc, rx.hp_oos2, 1);
  821. if (!hif_exec_should_yield(scn, intr_id))
  822. goto more_data;
  823. if (qdf_unlikely(near_full)) {
  824. DP_STATS_INC(soc, rx.near_full, 1);
  825. goto more_data;
  826. }
  827. }
  828. }
  829. if (vdev && vdev->osif_fisa_flush)
  830. vdev->osif_fisa_flush(soc, reo_ring_num);
  831. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  832. vdev->osif_gro_flush(vdev->osif_vdev,
  833. reo_ring_num);
  834. }
  835. }
  836. /* Update histogram statistics by looping through pdev's */
  837. DP_RX_HIST_STATS_PER_PDEV();
  838. return rx_bufs_used; /* Assume no scale factor for now */
  839. }
  840. QDF_STATUS dp_rx_desc_pool_init_li(struct dp_soc *soc,
  841. struct rx_desc_pool *rx_desc_pool,
  842. uint32_t pool_id)
  843. {
  844. return dp_rx_desc_pool_init_generic(soc, rx_desc_pool, pool_id);
  845. }
  846. void dp_rx_desc_pool_deinit_li(struct dp_soc *soc,
  847. struct rx_desc_pool *rx_desc_pool,
  848. uint32_t pool_id)
  849. {
  850. }
  851. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_li(
  852. struct dp_soc *soc,
  853. void *ring_desc,
  854. struct dp_rx_desc **r_rx_desc)
  855. {
  856. struct hal_buf_info buf_info = {0};
  857. hal_soc_handle_t hal_soc = soc->hal_soc;
  858. /* only cookie and rbm will be valid in buf_info */
  859. hal_rx_buf_cookie_rbm_get(hal_soc, (uint32_t *)ring_desc,
  860. &buf_info);
  861. if (qdf_unlikely(buf_info.rbm !=
  862. HAL_RX_BUF_RBM_SW3_BM(soc->wbm_sw0_bm_id))) {
  863. /* TODO */
  864. /* Call appropriate handler */
  865. DP_STATS_INC(soc, rx.err.invalid_rbm, 1);
  866. dp_rx_err("%pK: Invalid RBM %d", soc, buf_info.rbm);
  867. return QDF_STATUS_E_INVAL;
  868. }
  869. if (!dp_rx_is_sw_cookie_valid(soc, buf_info.sw_cookie)) {
  870. dp_rx_err("invalid sw_cookie 0x%x", buf_info.sw_cookie);
  871. return QDF_STATUS_E_INVAL;
  872. }
  873. *r_rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, buf_info.sw_cookie);
  874. return QDF_STATUS_SUCCESS;
  875. }
  876. bool dp_rx_chain_msdus_li(struct dp_soc *soc, qdf_nbuf_t nbuf,
  877. uint8_t *rx_tlv_hdr, uint8_t mac_id)
  878. {
  879. bool mpdu_done = false;
  880. qdf_nbuf_t curr_nbuf = NULL;
  881. qdf_nbuf_t tmp_nbuf = NULL;
  882. /* TODO: Currently only single radio is supported, hence
  883. * pdev hard coded to '0' index
  884. */
  885. struct dp_pdev *dp_pdev = dp_get_pdev_for_lmac_id(soc, mac_id);
  886. if (!dp_pdev) {
  887. dp_rx_debug("%pK: pdev is null for mac_id = %d", soc, mac_id);
  888. return mpdu_done;
  889. }
  890. /* if invalid peer SG list has max values free the buffers in list
  891. * and treat current buffer as start of list
  892. *
  893. * current logic to detect the last buffer from attn_tlv is not reliable
  894. * in OFDMA UL scenario hence add max buffers check to avoid list pile
  895. * up
  896. */
  897. if (!dp_pdev->first_nbuf ||
  898. (dp_pdev->invalid_peer_head_msdu &&
  899. QDF_NBUF_CB_RX_NUM_ELEMENTS_IN_LIST
  900. (dp_pdev->invalid_peer_head_msdu) >= DP_MAX_INVALID_BUFFERS)) {
  901. qdf_nbuf_set_rx_chfrag_start(nbuf, 1);
  902. dp_pdev->ppdu_id = hal_rx_get_ppdu_id(soc->hal_soc,
  903. rx_tlv_hdr);
  904. dp_pdev->first_nbuf = true;
  905. /* If the new nbuf received is the first msdu of the
  906. * amsdu and there are msdus in the invalid peer msdu
  907. * list, then let us free all the msdus of the invalid
  908. * peer msdu list.
  909. * This scenario can happen when we start receiving
  910. * new a-msdu even before the previous a-msdu is completely
  911. * received.
  912. */
  913. curr_nbuf = dp_pdev->invalid_peer_head_msdu;
  914. while (curr_nbuf) {
  915. tmp_nbuf = curr_nbuf->next;
  916. dp_rx_nbuf_free(curr_nbuf);
  917. curr_nbuf = tmp_nbuf;
  918. }
  919. dp_pdev->invalid_peer_head_msdu = NULL;
  920. dp_pdev->invalid_peer_tail_msdu = NULL;
  921. dp_monitor_get_mpdu_status(dp_pdev, soc, rx_tlv_hdr);
  922. }
  923. if (dp_pdev->ppdu_id == hal_rx_attn_phy_ppdu_id_get(soc->hal_soc,
  924. rx_tlv_hdr) &&
  925. hal_rx_attn_msdu_done_get(soc->hal_soc, rx_tlv_hdr)) {
  926. qdf_nbuf_set_rx_chfrag_end(nbuf, 1);
  927. qdf_assert_always(dp_pdev->first_nbuf);
  928. dp_pdev->first_nbuf = false;
  929. mpdu_done = true;
  930. }
  931. /*
  932. * For MCL, invalid_peer_head_msdu and invalid_peer_tail_msdu
  933. * should be NULL here, add the checking for debugging purpose
  934. * in case some corner case.
  935. */
  936. DP_PDEV_INVALID_PEER_MSDU_CHECK(dp_pdev->invalid_peer_head_msdu,
  937. dp_pdev->invalid_peer_tail_msdu);
  938. DP_RX_LIST_APPEND(dp_pdev->invalid_peer_head_msdu,
  939. dp_pdev->invalid_peer_tail_msdu,
  940. nbuf);
  941. return mpdu_done;
  942. }