dp_li_rx.c 28 KB

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