dp_li_rx.c 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2022 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. * @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. /**
  173. * dp_rx_process_li() - Brain of the Rx processing functionality
  174. * Called from the bottom half (tasklet/NET_RX_SOFTIRQ)
  175. * @int_ctx: per interrupt context
  176. * @hal_ring: opaque pointer to the HAL Rx Ring, which will be serviced
  177. * @reo_ring_num: ring number (0, 1, 2 or 3) of the reo ring.
  178. * @quota: No. of units (packets) that can be serviced in one shot.
  179. *
  180. * This function implements the core of Rx functionality. This is
  181. * expected to handle only non-error frames.
  182. *
  183. * Return: uint32_t: No. of elements processed
  184. */
  185. uint32_t dp_rx_process_li(struct dp_intr *int_ctx,
  186. hal_ring_handle_t hal_ring_hdl, uint8_t reo_ring_num,
  187. uint32_t quota)
  188. {
  189. hal_ring_desc_t ring_desc;
  190. hal_ring_desc_t last_prefetched_hw_desc;
  191. hal_soc_handle_t hal_soc;
  192. struct dp_rx_desc *rx_desc = NULL;
  193. struct dp_rx_desc *last_prefetched_sw_desc = NULL;
  194. qdf_nbuf_t nbuf, next;
  195. bool near_full;
  196. union dp_rx_desc_list_elem_t *head[MAX_PDEV_CNT];
  197. union dp_rx_desc_list_elem_t *tail[MAX_PDEV_CNT];
  198. uint32_t num_pending = 0;
  199. uint32_t rx_bufs_used = 0, rx_buf_cookie;
  200. uint16_t msdu_len = 0;
  201. uint16_t peer_id;
  202. uint8_t vdev_id;
  203. struct dp_txrx_peer *txrx_peer;
  204. dp_txrx_ref_handle txrx_ref_handle = NULL;
  205. struct dp_vdev *vdev;
  206. uint32_t pkt_len = 0;
  207. struct hal_rx_mpdu_desc_info mpdu_desc_info;
  208. struct hal_rx_msdu_desc_info msdu_desc_info;
  209. enum hal_reo_error_status error;
  210. uint32_t peer_mdata;
  211. uint8_t *rx_tlv_hdr;
  212. uint32_t rx_bufs_reaped[MAX_PDEV_CNT];
  213. uint8_t mac_id = 0;
  214. struct dp_pdev *rx_pdev;
  215. struct dp_srng *dp_rxdma_srng;
  216. struct rx_desc_pool *rx_desc_pool;
  217. struct dp_soc *soc = int_ctx->soc;
  218. struct cdp_tid_rx_stats *tid_stats;
  219. qdf_nbuf_t nbuf_head;
  220. qdf_nbuf_t nbuf_tail;
  221. qdf_nbuf_t deliver_list_head;
  222. qdf_nbuf_t deliver_list_tail;
  223. uint32_t num_rx_bufs_reaped = 0;
  224. uint32_t intr_id;
  225. struct hif_opaque_softc *scn;
  226. int32_t tid = 0;
  227. bool is_prev_msdu_last = true;
  228. uint32_t rx_ol_pkt_cnt = 0;
  229. uint32_t num_entries = 0;
  230. struct hal_rx_msdu_metadata msdu_metadata;
  231. QDF_STATUS status;
  232. qdf_nbuf_t ebuf_head;
  233. qdf_nbuf_t ebuf_tail;
  234. uint8_t pkt_capture_offload = 0;
  235. int max_reap_limit;
  236. uint32_t old_tid;
  237. uint32_t peer_ext_stats;
  238. uint32_t dsf;
  239. uint32_t max_ast;
  240. uint64_t current_time = 0;
  241. DP_HIST_INIT();
  242. qdf_assert_always(soc && hal_ring_hdl);
  243. hal_soc = soc->hal_soc;
  244. qdf_assert_always(hal_soc);
  245. scn = soc->hif_handle;
  246. intr_id = int_ctx->dp_intr_id;
  247. num_entries = hal_srng_get_num_entries(hal_soc, hal_ring_hdl);
  248. dp_runtime_pm_mark_last_busy(soc);
  249. more_data:
  250. /* reset local variables here to be re-used in the function */
  251. nbuf_head = NULL;
  252. nbuf_tail = NULL;
  253. deliver_list_head = NULL;
  254. deliver_list_tail = NULL;
  255. txrx_peer = NULL;
  256. vdev = NULL;
  257. num_rx_bufs_reaped = 0;
  258. ebuf_head = NULL;
  259. ebuf_tail = NULL;
  260. max_reap_limit = dp_rx_get_loop_pkt_limit(soc);
  261. qdf_mem_zero(rx_bufs_reaped, sizeof(rx_bufs_reaped));
  262. qdf_mem_zero(&mpdu_desc_info, sizeof(mpdu_desc_info));
  263. qdf_mem_zero(&msdu_desc_info, sizeof(msdu_desc_info));
  264. qdf_mem_zero(head, sizeof(head));
  265. qdf_mem_zero(tail, sizeof(tail));
  266. old_tid = 0xff;
  267. dsf = 0;
  268. peer_ext_stats = 0;
  269. max_ast = 0;
  270. rx_pdev = NULL;
  271. tid_stats = NULL;
  272. dp_pkt_get_timestamp(&current_time);
  273. if (qdf_unlikely(dp_rx_srng_access_start(int_ctx, soc, hal_ring_hdl))) {
  274. /*
  275. * Need API to convert from hal_ring pointer to
  276. * Ring Type / Ring Id combo
  277. */
  278. DP_STATS_INC(soc, rx.err.hal_ring_access_fail, 1);
  279. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  280. FL("HAL RING Access Failed -- %pK"), hal_ring_hdl);
  281. goto done;
  282. }
  283. if (!num_pending)
  284. num_pending = hal_srng_dst_num_valid(hal_soc, hal_ring_hdl, 0);
  285. dp_srng_dst_inv_cached_descs(soc, hal_ring_hdl, num_pending);
  286. if (num_pending > quota)
  287. num_pending = quota;
  288. last_prefetched_hw_desc = dp_srng_dst_prefetch(hal_soc, hal_ring_hdl,
  289. num_pending);
  290. peer_ext_stats = wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx);
  291. max_ast = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  292. /*
  293. * start reaping the buffers from reo ring and queue
  294. * them in per vdev queue.
  295. * Process the received pkts in a different per vdev loop.
  296. */
  297. while (qdf_likely(num_pending)) {
  298. ring_desc = dp_srng_dst_get_next(soc, hal_ring_hdl);
  299. if (qdf_unlikely(!ring_desc))
  300. break;
  301. error = HAL_RX_ERROR_STATUS_GET(ring_desc);
  302. if (qdf_unlikely(error == HAL_REO_ERROR_DETECTED)) {
  303. dp_rx_err("%pK: HAL RING 0x%pK:error %d",
  304. soc, hal_ring_hdl, error);
  305. DP_STATS_INC(soc, rx.err.hal_reo_error[reo_ring_num],
  306. 1);
  307. /* Don't know how to deal with this -- assert */
  308. qdf_assert(0);
  309. }
  310. dp_rx_ring_record_entry(soc, reo_ring_num, ring_desc);
  311. rx_buf_cookie = HAL_RX_REO_BUF_COOKIE_GET(ring_desc);
  312. status = dp_rx_cookie_check_and_invalidate(ring_desc);
  313. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  314. DP_STATS_INC(soc, rx.err.stale_cookie, 1);
  315. break;
  316. }
  317. rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, rx_buf_cookie);
  318. status = dp_rx_desc_sanity(soc, hal_soc, hal_ring_hdl,
  319. ring_desc, rx_desc);
  320. if (QDF_IS_STATUS_ERROR(status)) {
  321. if (qdf_unlikely(rx_desc && rx_desc->nbuf)) {
  322. qdf_assert_always(!rx_desc->unmapped);
  323. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  324. rx_desc->unmapped = 1;
  325. dp_rx_buffer_pool_nbuf_free(soc, rx_desc->nbuf,
  326. rx_desc->pool_id);
  327. dp_rx_add_to_free_desc_list(
  328. &head[rx_desc->pool_id],
  329. &tail[rx_desc->pool_id],
  330. rx_desc);
  331. }
  332. continue;
  333. }
  334. /*
  335. * this is a unlikely scenario where the host is reaping
  336. * a descriptor which it already reaped just a while ago
  337. * but is yet to replenish it back to HW.
  338. * In this case host will dump the last 128 descriptors
  339. * including the software descriptor rx_desc and assert.
  340. */
  341. if (qdf_unlikely(!rx_desc->in_use)) {
  342. DP_STATS_INC(soc, rx.err.hal_reo_dest_dup, 1);
  343. dp_info_rl("Reaping rx_desc not in use!");
  344. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  345. ring_desc, rx_desc);
  346. /* ignore duplicate RX desc and continue to process */
  347. /* Pop out the descriptor */
  348. continue;
  349. }
  350. status = dp_rx_desc_nbuf_sanity_check(soc, ring_desc, rx_desc);
  351. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  352. DP_STATS_INC(soc, rx.err.nbuf_sanity_fail, 1);
  353. dp_info_rl("Nbuf sanity check failure!");
  354. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  355. ring_desc, rx_desc);
  356. rx_desc->in_err_state = 1;
  357. continue;
  358. }
  359. if (qdf_unlikely(!dp_rx_desc_check_magic(rx_desc))) {
  360. dp_err("Invalid rx_desc cookie=%d", rx_buf_cookie);
  361. DP_STATS_INC(soc, rx.err.rx_desc_invalid_magic, 1);
  362. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  363. ring_desc, rx_desc);
  364. }
  365. /* Get MPDU DESC info */
  366. hal_rx_mpdu_desc_info_get_li(ring_desc, &mpdu_desc_info);
  367. /* Get MSDU DESC info */
  368. hal_rx_msdu_desc_info_get_li(ring_desc, &msdu_desc_info);
  369. if (qdf_unlikely(msdu_desc_info.msdu_flags &
  370. HAL_MSDU_F_MSDU_CONTINUATION)) {
  371. /* previous msdu has end bit set, so current one is
  372. * the new MPDU
  373. */
  374. if (is_prev_msdu_last) {
  375. /* For new MPDU check if we can read complete
  376. * MPDU by comparing the number of buffers
  377. * available and number of buffers needed to
  378. * reap this MPDU
  379. */
  380. if ((msdu_desc_info.msdu_len /
  381. (RX_DATA_BUFFER_SIZE -
  382. soc->rx_pkt_tlv_size) + 1) >
  383. num_pending) {
  384. DP_STATS_INC(soc,
  385. rx.msdu_scatter_wait_break,
  386. 1);
  387. dp_rx_cookie_reset_invalid_bit(
  388. ring_desc);
  389. /* As we are going to break out of the
  390. * loop because of unavailability of
  391. * descs to form complete SG, we need to
  392. * reset the TP in the REO destination
  393. * ring.
  394. */
  395. hal_srng_dst_dec_tp(hal_soc,
  396. hal_ring_hdl);
  397. break;
  398. }
  399. is_prev_msdu_last = false;
  400. }
  401. }
  402. if (mpdu_desc_info.mpdu_flags & HAL_MPDU_F_RETRY_BIT)
  403. qdf_nbuf_set_rx_retry_flag(rx_desc->nbuf, 1);
  404. if (qdf_unlikely(mpdu_desc_info.mpdu_flags &
  405. HAL_MPDU_F_RAW_AMPDU))
  406. qdf_nbuf_set_raw_frame(rx_desc->nbuf, 1);
  407. if (!is_prev_msdu_last &&
  408. msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  409. is_prev_msdu_last = true;
  410. rx_bufs_reaped[rx_desc->pool_id]++;
  411. peer_mdata = mpdu_desc_info.peer_meta_data;
  412. QDF_NBUF_CB_RX_PEER_ID(rx_desc->nbuf) =
  413. dp_rx_peer_metadata_peer_id_get_li(soc, peer_mdata);
  414. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  415. DP_PEER_METADATA_VDEV_ID_GET_LI(peer_mdata);
  416. /* to indicate whether this msdu is rx offload */
  417. pkt_capture_offload =
  418. DP_PEER_METADATA_OFFLOAD_GET_LI(peer_mdata);
  419. /*
  420. * save msdu flags first, last and continuation msdu in
  421. * nbuf->cb, also save mcbc, is_da_valid, is_sa_valid and
  422. * length to nbuf->cb. This ensures the info required for
  423. * per pkt processing is always in the same cache line.
  424. * This helps in improving throughput for smaller pkt
  425. * sizes.
  426. */
  427. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_FIRST_MSDU_IN_MPDU)
  428. qdf_nbuf_set_rx_chfrag_start(rx_desc->nbuf, 1);
  429. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_MSDU_CONTINUATION)
  430. qdf_nbuf_set_rx_chfrag_cont(rx_desc->nbuf, 1);
  431. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  432. qdf_nbuf_set_rx_chfrag_end(rx_desc->nbuf, 1);
  433. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_MCBC)
  434. qdf_nbuf_set_da_mcbc(rx_desc->nbuf, 1);
  435. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_VALID)
  436. qdf_nbuf_set_da_valid(rx_desc->nbuf, 1);
  437. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_SA_IS_VALID)
  438. qdf_nbuf_set_sa_valid(rx_desc->nbuf, 1);
  439. qdf_nbuf_set_tid_val(rx_desc->nbuf,
  440. HAL_RX_REO_QUEUE_NUMBER_GET(ring_desc));
  441. /* set reo dest indication */
  442. qdf_nbuf_set_rx_reo_dest_ind_or_sw_excpt(
  443. rx_desc->nbuf,
  444. HAL_RX_REO_MSDU_REO_DST_IND_GET(ring_desc));
  445. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  446. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  447. /*
  448. * move unmap after scattered msdu waiting break logic
  449. * in case double skb unmap happened.
  450. */
  451. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  452. rx_desc->unmapped = 1;
  453. DP_RX_PROCESS_NBUF(soc, nbuf_head, nbuf_tail, ebuf_head,
  454. ebuf_tail, rx_desc);
  455. quota -= 1;
  456. num_pending -= 1;
  457. dp_rx_add_to_free_desc_list(&head[rx_desc->pool_id],
  458. &tail[rx_desc->pool_id], rx_desc);
  459. num_rx_bufs_reaped++;
  460. dp_rx_prefetch_hw_sw_nbuf_desc(soc, hal_soc, num_pending,
  461. hal_ring_hdl,
  462. &last_prefetched_hw_desc,
  463. &last_prefetched_sw_desc);
  464. /*
  465. * only if complete msdu is received for scatter case,
  466. * then allow break.
  467. */
  468. if (is_prev_msdu_last &&
  469. dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped,
  470. max_reap_limit))
  471. break;
  472. }
  473. done:
  474. dp_rx_srng_access_end(int_ctx, soc, hal_ring_hdl);
  475. dp_rx_per_core_stats_update(soc, reo_ring_num, num_rx_bufs_reaped);
  476. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  477. /*
  478. * continue with next mac_id if no pkts were reaped
  479. * from that pool
  480. */
  481. if (!rx_bufs_reaped[mac_id])
  482. continue;
  483. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  484. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  485. dp_rx_buffers_replenish_simple(soc, mac_id, dp_rxdma_srng,
  486. rx_desc_pool,
  487. rx_bufs_reaped[mac_id],
  488. &head[mac_id], &tail[mac_id]);
  489. }
  490. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  491. /* Peer can be NULL is case of LFR */
  492. if (qdf_likely(txrx_peer))
  493. vdev = NULL;
  494. /*
  495. * BIG loop where each nbuf is dequeued from global queue,
  496. * processed and queued back on a per vdev basis. These nbufs
  497. * are sent to stack as and when we run out of nbufs
  498. * or a new nbuf dequeued from global queue has a different
  499. * vdev when compared to previous nbuf.
  500. */
  501. nbuf = nbuf_head;
  502. while (nbuf) {
  503. next = nbuf->next;
  504. dp_rx_prefetch_nbuf_data(nbuf, next);
  505. if (qdf_unlikely(dp_rx_is_raw_frame_dropped(nbuf))) {
  506. nbuf = next;
  507. DP_STATS_INC(soc, rx.err.raw_frm_drop, 1);
  508. continue;
  509. }
  510. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  511. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  512. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  513. if (dp_rx_is_list_ready(deliver_list_head, vdev, txrx_peer,
  514. peer_id, vdev_id)) {
  515. dp_rx_deliver_to_stack(soc, vdev, txrx_peer,
  516. deliver_list_head,
  517. deliver_list_tail);
  518. deliver_list_head = NULL;
  519. deliver_list_tail = NULL;
  520. }
  521. /* Get TID from struct cb->tid_val, save to tid */
  522. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  523. tid = qdf_nbuf_get_tid_val(nbuf);
  524. if (qdf_unlikely(tid >= CDP_MAX_DATA_TIDS)) {
  525. DP_STATS_INC(soc, rx.err.rx_invalid_tid_err, 1);
  526. dp_rx_nbuf_free(nbuf);
  527. nbuf = next;
  528. continue;
  529. }
  530. if (qdf_unlikely(!txrx_peer)) {
  531. txrx_peer =
  532. dp_rx_get_txrx_peer_and_vdev(soc, nbuf, peer_id,
  533. &txrx_ref_handle,
  534. pkt_capture_offload,
  535. &vdev,
  536. &rx_pdev, &dsf,
  537. &old_tid);
  538. if (qdf_unlikely(!txrx_peer) || qdf_unlikely(!vdev)) {
  539. nbuf = next;
  540. continue;
  541. }
  542. } else if (txrx_peer && txrx_peer->peer_id != peer_id) {
  543. dp_txrx_peer_unref_delete(txrx_ref_handle,
  544. DP_MOD_ID_RX);
  545. txrx_peer =
  546. dp_rx_get_txrx_peer_and_vdev(soc, nbuf, peer_id,
  547. &txrx_ref_handle,
  548. pkt_capture_offload,
  549. &vdev,
  550. &rx_pdev, &dsf,
  551. &old_tid);
  552. if (qdf_unlikely(!txrx_peer) || qdf_unlikely(!vdev)) {
  553. nbuf = next;
  554. continue;
  555. }
  556. }
  557. if (txrx_peer) {
  558. QDF_NBUF_CB_DP_TRACE_PRINT(nbuf) = false;
  559. qdf_dp_trace_set_track(nbuf, QDF_RX);
  560. QDF_NBUF_CB_RX_DP_TRACE(nbuf) = 1;
  561. QDF_NBUF_CB_RX_PACKET_TRACK(nbuf) =
  562. QDF_NBUF_RX_PKT_DATA_TRACK;
  563. }
  564. rx_bufs_used++;
  565. /* when hlos tid override is enabled, save tid in
  566. * skb->priority
  567. */
  568. if (qdf_unlikely(vdev->skip_sw_tid_classification &
  569. DP_TXRX_HLOS_TID_OVERRIDE_ENABLED))
  570. qdf_nbuf_set_priority(nbuf, tid);
  571. DP_RX_TID_SAVE(nbuf, tid);
  572. if (qdf_unlikely(dsf) || qdf_unlikely(peer_ext_stats) ||
  573. dp_rx_pkt_tracepoints_enabled())
  574. qdf_nbuf_set_timestamp(nbuf);
  575. if (qdf_likely(old_tid != tid)) {
  576. tid_stats =
  577. &rx_pdev->stats.tid_stats.tid_rx_stats[reo_ring_num][tid];
  578. old_tid = tid;
  579. }
  580. /*
  581. * Check if DMA completed -- msdu_done is the last bit
  582. * to be written
  583. */
  584. if (qdf_likely(!qdf_nbuf_is_rx_chfrag_cont(nbuf))) {
  585. if (qdf_unlikely(!hal_rx_attn_msdu_done_get_li(
  586. rx_tlv_hdr))) {
  587. dp_err_rl("MSDU DONE failure");
  588. DP_STATS_INC(soc, rx.err.msdu_done_fail, 1);
  589. hal_rx_dump_pkt_tlvs(hal_soc, rx_tlv_hdr,
  590. QDF_TRACE_LEVEL_INFO);
  591. tid_stats->fail_cnt[MSDU_DONE_FAILURE]++;
  592. qdf_assert(0);
  593. dp_rx_nbuf_free(nbuf);
  594. nbuf = next;
  595. continue;
  596. } else if (qdf_unlikely(hal_rx_attn_msdu_len_err_get_li(
  597. rx_tlv_hdr))) {
  598. DP_STATS_INC(soc, rx.err.msdu_len_err, 1);
  599. dp_rx_nbuf_free(nbuf);
  600. nbuf = next;
  601. continue;
  602. }
  603. }
  604. DP_HIST_PACKET_COUNT_INC(vdev->pdev->pdev_id);
  605. /*
  606. * First IF condition:
  607. * 802.11 Fragmented pkts are reinjected to REO
  608. * HW block as SG pkts and for these pkts we only
  609. * need to pull the RX TLVS header length.
  610. * Second IF condition:
  611. * The below condition happens when an MSDU is spread
  612. * across multiple buffers. This can happen in two cases
  613. * 1. The nbuf size is smaller then the received msdu.
  614. * ex: we have set the nbuf size to 2048 during
  615. * nbuf_alloc. but we received an msdu which is
  616. * 2304 bytes in size then this msdu is spread
  617. * across 2 nbufs.
  618. *
  619. * 2. AMSDUs when RAW mode is enabled.
  620. * ex: 1st MSDU is in 1st nbuf and 2nd MSDU is spread
  621. * across 1st nbuf and 2nd nbuf and last MSDU is
  622. * spread across 2nd nbuf and 3rd nbuf.
  623. *
  624. * for these scenarios let us create a skb frag_list and
  625. * append these buffers till the last MSDU of the AMSDU
  626. * Third condition:
  627. * This is the most likely case, we receive 802.3 pkts
  628. * decapsulated by HW, here we need to set the pkt length.
  629. */
  630. hal_rx_msdu_metadata_get(hal_soc, rx_tlv_hdr, &msdu_metadata);
  631. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  632. bool is_mcbc, is_sa_vld, is_da_vld;
  633. is_mcbc = hal_rx_msdu_end_da_is_mcbc_get(soc->hal_soc,
  634. rx_tlv_hdr);
  635. is_sa_vld =
  636. hal_rx_msdu_end_sa_is_valid_get(soc->hal_soc,
  637. rx_tlv_hdr);
  638. is_da_vld =
  639. hal_rx_msdu_end_da_is_valid_get(soc->hal_soc,
  640. rx_tlv_hdr);
  641. qdf_nbuf_set_da_mcbc(nbuf, is_mcbc);
  642. qdf_nbuf_set_da_valid(nbuf, is_da_vld);
  643. qdf_nbuf_set_sa_valid(nbuf, is_sa_vld);
  644. qdf_nbuf_pull_head(nbuf, soc->rx_pkt_tlv_size);
  645. } else if (qdf_nbuf_is_rx_chfrag_cont(nbuf)) {
  646. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  647. nbuf = dp_rx_sg_create(soc, nbuf);
  648. next = nbuf->next;
  649. if (qdf_nbuf_is_raw_frame(nbuf)) {
  650. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  651. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  652. rx.raw, 1,
  653. msdu_len);
  654. } else {
  655. DP_STATS_INC(soc, rx.err.scatter_msdu, 1);
  656. if (!dp_rx_is_sg_supported()) {
  657. dp_rx_nbuf_free(nbuf);
  658. dp_info_rl("sg msdu len %d, dropped",
  659. msdu_len);
  660. nbuf = next;
  661. continue;
  662. }
  663. }
  664. } else {
  665. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  666. pkt_len = msdu_len +
  667. msdu_metadata.l3_hdr_pad +
  668. soc->rx_pkt_tlv_size;
  669. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  670. dp_rx_skip_tlvs(soc, nbuf, msdu_metadata.l3_hdr_pad);
  671. }
  672. dp_rx_send_pktlog(soc, rx_pdev, nbuf, QDF_TX_RX_STATUS_OK);
  673. /*
  674. * process frame for mulitpass phrase processing
  675. */
  676. if (qdf_unlikely(vdev->multipass_en)) {
  677. if (dp_rx_multipass_process(txrx_peer, nbuf,
  678. tid) == false) {
  679. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  680. rx.multipass_rx_pkt_drop,
  681. 1);
  682. dp_rx_nbuf_free(nbuf);
  683. nbuf = next;
  684. continue;
  685. }
  686. }
  687. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, txrx_peer)) {
  688. dp_rx_err("%pK: Policy Check Drop pkt", soc);
  689. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  690. rx.policy_check_drop, 1);
  691. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  692. /* Drop & free packet */
  693. dp_rx_nbuf_free(nbuf);
  694. /* Statistics */
  695. nbuf = next;
  696. continue;
  697. }
  698. if (qdf_unlikely(txrx_peer && (txrx_peer->nawds_enabled) &&
  699. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  700. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  701. rx_tlv_hdr) ==
  702. false))) {
  703. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  704. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  705. rx.nawds_mcast_drop, 1);
  706. dp_rx_nbuf_free(nbuf);
  707. nbuf = next;
  708. continue;
  709. }
  710. /*
  711. * Drop non-EAPOL frames from unauthorized peer.
  712. */
  713. if (qdf_likely(txrx_peer) &&
  714. qdf_unlikely(!txrx_peer->authorize) &&
  715. !qdf_nbuf_is_raw_frame(nbuf)) {
  716. bool is_eapol = qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  717. qdf_nbuf_is_ipv4_wapi_pkt(nbuf);
  718. if (!is_eapol) {
  719. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  720. rx.peer_unauth_rx_pkt_drop,
  721. 1);
  722. dp_rx_nbuf_free(nbuf);
  723. nbuf = next;
  724. continue;
  725. }
  726. }
  727. if (soc->process_rx_status)
  728. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  729. /* Update the protocol tag in SKB based on CCE metadata */
  730. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  731. reo_ring_num, false, true);
  732. /* Update the flow tag in SKB based on FSE metadata */
  733. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  734. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, txrx_peer,
  735. reo_ring_num, tid_stats);
  736. if (qdf_unlikely(vdev->mesh_vdev)) {
  737. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  738. == QDF_STATUS_SUCCESS) {
  739. dp_rx_info("%pK: mesh pkt filtered", soc);
  740. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  741. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  742. 1);
  743. dp_rx_nbuf_free(nbuf);
  744. nbuf = next;
  745. continue;
  746. }
  747. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr,
  748. txrx_peer);
  749. }
  750. if (qdf_likely(vdev->rx_decap_type ==
  751. htt_cmn_pkt_type_ethernet) &&
  752. qdf_likely(!vdev->mesh_vdev)) {
  753. /* Due to HW issue, sometimes we see that the sa_idx
  754. * and da_idx are invalid with sa_valid and da_valid
  755. * bits set
  756. *
  757. * in this case we also see that value of
  758. * sa_sw_peer_id is set as 0
  759. *
  760. * Drop the packet if sa_idx and da_idx OOB or
  761. * sa_sw_peerid is 0
  762. */
  763. if (!is_sa_da_idx_valid(max_ast, nbuf,
  764. msdu_metadata)) {
  765. dp_rx_nbuf_free(nbuf);
  766. nbuf = next;
  767. DP_STATS_INC(soc, rx.err.invalid_sa_da_idx, 1);
  768. continue;
  769. }
  770. if (qdf_unlikely(dp_rx_mec_check_wrapper(soc,
  771. txrx_peer,
  772. rx_tlv_hdr,
  773. nbuf))) {
  774. /* this is a looped back MCBC pkt,drop it */
  775. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  776. rx.mec_drop, 1,
  777. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  778. dp_rx_nbuf_free(nbuf);
  779. nbuf = next;
  780. continue;
  781. }
  782. /* WDS Source Port Learning */
  783. if (qdf_likely(vdev->wds_enabled))
  784. dp_rx_wds_srcport_learn(soc,
  785. rx_tlv_hdr,
  786. txrx_peer,
  787. nbuf,
  788. msdu_metadata);
  789. /* Intrabss-fwd */
  790. if (dp_rx_check_ap_bridge(vdev))
  791. if (dp_rx_intrabss_fwd_li(soc, txrx_peer,
  792. rx_tlv_hdr,
  793. nbuf,
  794. msdu_metadata,
  795. tid_stats)) {
  796. nbuf = next;
  797. tid_stats->intrabss_cnt++;
  798. continue; /* Get next desc */
  799. }
  800. }
  801. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  802. dp_rx_mark_first_packet_after_wow_wakeup(vdev->pdev, rx_tlv_hdr,
  803. nbuf);
  804. dp_rx_update_stats(soc, nbuf);
  805. dp_pkt_add_timestamp(txrx_peer->vdev, QDF_PKT_RX_DRIVER_ENTRY,
  806. current_time, nbuf);
  807. DP_RX_LIST_APPEND(deliver_list_head,
  808. deliver_list_tail,
  809. nbuf);
  810. DP_PEER_STATS_FLAT_INC_PKT(txrx_peer, to_stack, 1,
  811. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  812. if (qdf_unlikely(txrx_peer->in_twt))
  813. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  814. rx.to_stack_twt, 1,
  815. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  816. tid_stats->delivered_to_stack++;
  817. nbuf = next;
  818. }
  819. DP_RX_DELIVER_TO_STACK(soc, vdev, txrx_peer, peer_id,
  820. pkt_capture_offload,
  821. deliver_list_head,
  822. deliver_list_tail);
  823. if (qdf_likely(txrx_peer))
  824. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  825. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  826. if (quota) {
  827. num_pending =
  828. dp_rx_srng_get_num_pending(hal_soc,
  829. hal_ring_hdl,
  830. num_entries,
  831. &near_full);
  832. if (num_pending) {
  833. DP_STATS_INC(soc, rx.hp_oos2, 1);
  834. if (!hif_exec_should_yield(scn, intr_id))
  835. goto more_data;
  836. if (qdf_unlikely(near_full)) {
  837. DP_STATS_INC(soc, rx.near_full, 1);
  838. goto more_data;
  839. }
  840. }
  841. }
  842. if (vdev && vdev->osif_fisa_flush)
  843. vdev->osif_fisa_flush(soc, reo_ring_num);
  844. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  845. vdev->osif_gro_flush(vdev->osif_vdev,
  846. reo_ring_num);
  847. }
  848. }
  849. /* Update histogram statistics by looping through pdev's */
  850. DP_RX_HIST_STATS_PER_PDEV();
  851. return rx_bufs_used; /* Assume no scale factor for now */
  852. }
  853. QDF_STATUS dp_rx_desc_pool_init_li(struct dp_soc *soc,
  854. struct rx_desc_pool *rx_desc_pool,
  855. uint32_t pool_id)
  856. {
  857. return dp_rx_desc_pool_init_generic(soc, rx_desc_pool, pool_id);
  858. }
  859. void dp_rx_desc_pool_deinit_li(struct dp_soc *soc,
  860. struct rx_desc_pool *rx_desc_pool,
  861. uint32_t pool_id)
  862. {
  863. }
  864. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_li(
  865. struct dp_soc *soc,
  866. void *ring_desc,
  867. struct dp_rx_desc **r_rx_desc)
  868. {
  869. struct hal_buf_info buf_info = {0};
  870. hal_soc_handle_t hal_soc = soc->hal_soc;
  871. /* only cookie and rbm will be valid in buf_info */
  872. hal_rx_buf_cookie_rbm_get(hal_soc, (uint32_t *)ring_desc,
  873. &buf_info);
  874. if (qdf_unlikely(buf_info.rbm !=
  875. HAL_RX_BUF_RBM_SW3_BM(soc->wbm_sw0_bm_id))) {
  876. /* TODO */
  877. /* Call appropriate handler */
  878. DP_STATS_INC(soc, rx.err.invalid_rbm, 1);
  879. dp_rx_err("%pK: Invalid RBM %d", soc, buf_info.rbm);
  880. return QDF_STATUS_E_INVAL;
  881. }
  882. if (!dp_rx_is_sw_cookie_valid(soc, buf_info.sw_cookie)) {
  883. dp_rx_err("invalid sw_cookie 0x%x", buf_info.sw_cookie);
  884. return QDF_STATUS_E_INVAL;
  885. }
  886. *r_rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, buf_info.sw_cookie);
  887. return QDF_STATUS_SUCCESS;
  888. }
  889. bool dp_rx_chain_msdus_li(struct dp_soc *soc, qdf_nbuf_t nbuf,
  890. uint8_t *rx_tlv_hdr, uint8_t mac_id)
  891. {
  892. bool mpdu_done = false;
  893. qdf_nbuf_t curr_nbuf = NULL;
  894. qdf_nbuf_t tmp_nbuf = NULL;
  895. /* TODO: Currently only single radio is supported, hence
  896. * pdev hard coded to '0' index
  897. */
  898. struct dp_pdev *dp_pdev = dp_get_pdev_for_lmac_id(soc, mac_id);
  899. if (!dp_pdev) {
  900. dp_rx_debug("%pK: pdev is null for mac_id = %d", soc, mac_id);
  901. return mpdu_done;
  902. }
  903. /* if invalid peer SG list has max values free the buffers in list
  904. * and treat current buffer as start of list
  905. *
  906. * current logic to detect the last buffer from attn_tlv is not reliable
  907. * in OFDMA UL scenario hence add max buffers check to avoid list pile
  908. * up
  909. */
  910. if (!dp_pdev->first_nbuf ||
  911. (dp_pdev->invalid_peer_head_msdu &&
  912. QDF_NBUF_CB_RX_NUM_ELEMENTS_IN_LIST
  913. (dp_pdev->invalid_peer_head_msdu) >= DP_MAX_INVALID_BUFFERS)) {
  914. qdf_nbuf_set_rx_chfrag_start(nbuf, 1);
  915. dp_pdev->ppdu_id = hal_rx_get_ppdu_id(soc->hal_soc,
  916. rx_tlv_hdr);
  917. dp_pdev->first_nbuf = true;
  918. /* If the new nbuf received is the first msdu of the
  919. * amsdu and there are msdus in the invalid peer msdu
  920. * list, then let us free all the msdus of the invalid
  921. * peer msdu list.
  922. * This scenario can happen when we start receiving
  923. * new a-msdu even before the previous a-msdu is completely
  924. * received.
  925. */
  926. curr_nbuf = dp_pdev->invalid_peer_head_msdu;
  927. while (curr_nbuf) {
  928. tmp_nbuf = curr_nbuf->next;
  929. dp_rx_nbuf_free(curr_nbuf);
  930. curr_nbuf = tmp_nbuf;
  931. }
  932. dp_pdev->invalid_peer_head_msdu = NULL;
  933. dp_pdev->invalid_peer_tail_msdu = NULL;
  934. dp_monitor_get_mpdu_status(dp_pdev, soc, rx_tlv_hdr);
  935. }
  936. if (dp_pdev->ppdu_id == hal_rx_attn_phy_ppdu_id_get(soc->hal_soc,
  937. rx_tlv_hdr) &&
  938. hal_rx_attn_msdu_done_get(soc->hal_soc, rx_tlv_hdr)) {
  939. qdf_nbuf_set_rx_chfrag_end(nbuf, 1);
  940. qdf_assert_always(dp_pdev->first_nbuf);
  941. dp_pdev->first_nbuf = false;
  942. mpdu_done = true;
  943. }
  944. /*
  945. * For MCL, invalid_peer_head_msdu and invalid_peer_tail_msdu
  946. * should be NULL here, add the checking for debugging purpose
  947. * in case some corner case.
  948. */
  949. DP_PDEV_INVALID_PEER_MSDU_CHECK(dp_pdev->invalid_peer_head_msdu,
  950. dp_pdev->invalid_peer_tail_msdu);
  951. DP_RX_LIST_APPEND(dp_pdev->invalid_peer_head_msdu,
  952. dp_pdev->invalid_peer_tail_msdu,
  953. nbuf);
  954. return mpdu_done;
  955. }