dp_li_rx.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011
  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_li_rx.h"
  24. #include "dp_peer.h"
  25. #include "hal_rx.h"
  26. #include "hal_li_rx.h"
  27. #include "hal_api.h"
  28. #include "hal_li_api.h"
  29. #include "qdf_nbuf.h"
  30. #ifdef MESH_MODE_SUPPORT
  31. #include "if_meta_hdr.h"
  32. #endif
  33. #include "dp_internal.h"
  34. #include "dp_ipa.h"
  35. #ifdef WIFI_MONITOR_SUPPORT
  36. #include <dp_mon.h>
  37. #endif
  38. #ifdef FEATURE_WDS
  39. #include "dp_txrx_wds.h"
  40. #endif
  41. #include "dp_hist.h"
  42. #include "dp_rx_buffer_pool.h"
  43. #include "dp_li.h"
  44. static inline
  45. bool is_sa_da_idx_valid(uint32_t max_ast,
  46. qdf_nbuf_t nbuf, struct hal_rx_msdu_metadata msdu_info)
  47. {
  48. if ((qdf_nbuf_is_sa_valid(nbuf) && (msdu_info.sa_idx > max_ast)) ||
  49. (!qdf_nbuf_is_da_mcbc(nbuf) && qdf_nbuf_is_da_valid(nbuf) &&
  50. (msdu_info.da_idx > max_ast)))
  51. return false;
  52. return true;
  53. }
  54. #ifndef QCA_HOST_MODE_WIFI_DISABLED
  55. #if defined(FEATURE_MCL_REPEATER) && defined(FEATURE_MEC)
  56. /**
  57. * dp_rx_mec_check_wrapper() - wrapper to dp_rx_mcast_echo_check
  58. * @soc: core DP main context
  59. * @peer: dp peer handler
  60. * @rx_tlv_hdr: start of the rx TLV header
  61. * @nbuf: pkt buffer
  62. *
  63. * Return: bool (true if it is a looped back pkt else false)
  64. */
  65. static inline bool dp_rx_mec_check_wrapper(struct dp_soc *soc,
  66. struct dp_txrx_peer *txrx_peer,
  67. uint8_t *rx_tlv_hdr,
  68. qdf_nbuf_t nbuf)
  69. {
  70. return dp_rx_mcast_echo_check(soc, txrx_peer, rx_tlv_hdr, nbuf);
  71. }
  72. #else
  73. static inline bool dp_rx_mec_check_wrapper(struct dp_soc *soc,
  74. struct dp_txrx_peer *txrx_peer,
  75. uint8_t *rx_tlv_hdr,
  76. qdf_nbuf_t nbuf)
  77. {
  78. return false;
  79. }
  80. #endif
  81. #endif
  82. #ifndef QCA_HOST_MODE_WIFI_DISABLE
  83. static bool
  84. dp_rx_intrabss_ucast_check_li(struct dp_soc *soc, qdf_nbuf_t nbuf,
  85. struct dp_txrx_peer *ta_txrx_peer,
  86. struct hal_rx_msdu_metadata *msdu_metadata,
  87. uint8_t *p_tx_vdev_id)
  88. {
  89. uint16_t da_peer_id;
  90. struct dp_txrx_peer *da_peer;
  91. struct dp_ast_entry *ast_entry;
  92. dp_txrx_ref_handle txrx_ref_handle = NULL;
  93. if (!qdf_nbuf_is_da_valid(nbuf) || qdf_nbuf_is_da_mcbc(nbuf))
  94. return false;
  95. ast_entry = soc->ast_table[msdu_metadata->da_idx];
  96. if (!ast_entry)
  97. return false;
  98. if (ast_entry->type == CDP_TXRX_AST_TYPE_DA) {
  99. ast_entry->is_active = TRUE;
  100. return false;
  101. }
  102. da_peer_id = ast_entry->peer_id;
  103. /* TA peer cannot be same as peer(DA) on which AST is present
  104. * this indicates a change in topology and that AST entries
  105. * are yet to be updated.
  106. */
  107. if (da_peer_id == ta_txrx_peer->peer_id ||
  108. da_peer_id == HTT_INVALID_PEER)
  109. return false;
  110. da_peer = dp_txrx_peer_get_ref_by_id(soc, da_peer_id,
  111. &txrx_ref_handle, DP_MOD_ID_RX);
  112. if (!da_peer)
  113. return false;
  114. *p_tx_vdev_id = da_peer->vdev->vdev_id;
  115. /* If the source or destination peer in the isolation
  116. * list then dont forward instead push to bridge stack.
  117. */
  118. if (dp_get_peer_isolation(ta_txrx_peer) ||
  119. dp_get_peer_isolation(da_peer) ||
  120. da_peer->vdev->vdev_id != ta_txrx_peer->vdev->vdev_id) {
  121. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  122. return false;
  123. }
  124. if (da_peer->bss_peer) {
  125. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  126. return false;
  127. }
  128. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  129. return true;
  130. }
  131. /*
  132. * dp_rx_intrabss_fwd_li() - Implements the Intra-BSS forwarding logic
  133. *
  134. * @soc: core txrx main context
  135. * @ta_txrx_peer : source peer entry
  136. * @rx_tlv_hdr : start address of rx tlvs
  137. * @nbuf : nbuf that has to be intrabss forwarded
  138. *
  139. * Return: bool: true if it is forwarded else false
  140. */
  141. static bool
  142. dp_rx_intrabss_fwd_li(struct dp_soc *soc,
  143. struct dp_txrx_peer *ta_txrx_peer,
  144. uint8_t *rx_tlv_hdr,
  145. qdf_nbuf_t nbuf,
  146. struct hal_rx_msdu_metadata msdu_metadata,
  147. struct cdp_tid_rx_stats *tid_stats)
  148. {
  149. uint8_t tx_vdev_id;
  150. /* if it is a broadcast pkt (eg: ARP) and it is not its own
  151. * source, then clone the pkt and send the cloned pkt for
  152. * intra BSS forwarding and original pkt up the network stack
  153. * Note: how do we handle multicast pkts. do we forward
  154. * all multicast pkts as is or let a higher layer module
  155. * like igmpsnoop decide whether to forward or not with
  156. * Mcast enhancement.
  157. */
  158. if (qdf_nbuf_is_da_mcbc(nbuf) && !ta_txrx_peer->bss_peer)
  159. return dp_rx_intrabss_mcbc_fwd(soc, ta_txrx_peer, rx_tlv_hdr,
  160. nbuf, tid_stats);
  161. if (dp_rx_intrabss_eapol_drop_check(soc, ta_txrx_peer, rx_tlv_hdr,
  162. nbuf))
  163. return true;
  164. if (dp_rx_intrabss_ucast_check_li(soc, nbuf, ta_txrx_peer,
  165. &msdu_metadata, &tx_vdev_id))
  166. return dp_rx_intrabss_ucast_fwd(soc, ta_txrx_peer, tx_vdev_id,
  167. rx_tlv_hdr, nbuf, tid_stats);
  168. return false;
  169. }
  170. #endif
  171. /**
  172. * dp_rx_process_li() - Brain of the Rx processing functionality
  173. * Called from the bottom half (tasklet/NET_RX_SOFTIRQ)
  174. * @int_ctx: per interrupt context
  175. * @hal_ring: opaque pointer to the HAL Rx Ring, which will be serviced
  176. * @reo_ring_num: ring number (0, 1, 2 or 3) of the reo ring.
  177. * @quota: No. of units (packets) that can be serviced in one shot.
  178. *
  179. * This function implements the core of Rx functionality. This is
  180. * expected to handle only non-error frames.
  181. *
  182. * Return: uint32_t: No. of elements processed
  183. */
  184. uint32_t dp_rx_process_li(struct dp_intr *int_ctx,
  185. hal_ring_handle_t hal_ring_hdl, uint8_t reo_ring_num,
  186. uint32_t quota)
  187. {
  188. hal_ring_desc_t ring_desc;
  189. hal_ring_desc_t last_prefetched_hw_desc;
  190. hal_soc_handle_t hal_soc;
  191. struct dp_rx_desc *rx_desc = NULL;
  192. struct dp_rx_desc *last_prefetched_sw_desc = NULL;
  193. qdf_nbuf_t nbuf, next;
  194. bool near_full;
  195. union dp_rx_desc_list_elem_t *head[MAX_PDEV_CNT];
  196. union dp_rx_desc_list_elem_t *tail[MAX_PDEV_CNT];
  197. uint32_t num_pending = 0;
  198. uint32_t rx_bufs_used = 0, rx_buf_cookie;
  199. uint16_t msdu_len = 0;
  200. uint16_t peer_id;
  201. uint8_t vdev_id;
  202. struct dp_txrx_peer *txrx_peer;
  203. dp_txrx_ref_handle txrx_ref_handle = NULL;
  204. struct dp_vdev *vdev;
  205. uint32_t pkt_len = 0;
  206. struct hal_rx_mpdu_desc_info mpdu_desc_info;
  207. struct hal_rx_msdu_desc_info msdu_desc_info;
  208. enum hal_reo_error_status error;
  209. uint32_t peer_mdata;
  210. uint8_t *rx_tlv_hdr;
  211. uint32_t rx_bufs_reaped[MAX_PDEV_CNT];
  212. uint8_t mac_id = 0;
  213. struct dp_pdev *rx_pdev;
  214. struct dp_srng *dp_rxdma_srng;
  215. struct rx_desc_pool *rx_desc_pool;
  216. struct dp_soc *soc = int_ctx->soc;
  217. struct cdp_tid_rx_stats *tid_stats;
  218. qdf_nbuf_t nbuf_head;
  219. qdf_nbuf_t nbuf_tail;
  220. qdf_nbuf_t deliver_list_head;
  221. qdf_nbuf_t deliver_list_tail;
  222. uint32_t num_rx_bufs_reaped = 0;
  223. uint32_t intr_id;
  224. struct hif_opaque_softc *scn;
  225. int32_t tid = 0;
  226. bool is_prev_msdu_last = true;
  227. uint32_t rx_ol_pkt_cnt = 0;
  228. uint32_t num_entries = 0;
  229. struct hal_rx_msdu_metadata msdu_metadata;
  230. QDF_STATUS status;
  231. qdf_nbuf_t ebuf_head;
  232. qdf_nbuf_t ebuf_tail;
  233. uint8_t pkt_capture_offload = 0;
  234. int max_reap_limit;
  235. uint32_t old_tid;
  236. uint32_t peer_ext_stats;
  237. uint32_t dsf;
  238. uint32_t max_ast;
  239. uint64_t current_time = 0;
  240. DP_HIST_INIT();
  241. qdf_assert_always(soc && hal_ring_hdl);
  242. hal_soc = soc->hal_soc;
  243. qdf_assert_always(hal_soc);
  244. scn = soc->hif_handle;
  245. intr_id = int_ctx->dp_intr_id;
  246. num_entries = hal_srng_get_num_entries(hal_soc, hal_ring_hdl);
  247. dp_runtime_pm_mark_last_busy(soc);
  248. more_data:
  249. /* reset local variables here to be re-used in the function */
  250. nbuf_head = NULL;
  251. nbuf_tail = NULL;
  252. deliver_list_head = NULL;
  253. deliver_list_tail = NULL;
  254. txrx_peer = NULL;
  255. vdev = NULL;
  256. num_rx_bufs_reaped = 0;
  257. ebuf_head = NULL;
  258. ebuf_tail = NULL;
  259. max_reap_limit = dp_rx_get_loop_pkt_limit(soc);
  260. qdf_mem_zero(rx_bufs_reaped, sizeof(rx_bufs_reaped));
  261. qdf_mem_zero(&mpdu_desc_info, sizeof(mpdu_desc_info));
  262. qdf_mem_zero(&msdu_desc_info, sizeof(msdu_desc_info));
  263. qdf_mem_zero(head, sizeof(head));
  264. qdf_mem_zero(tail, sizeof(tail));
  265. old_tid = 0xff;
  266. dsf = 0;
  267. peer_ext_stats = 0;
  268. max_ast = 0;
  269. rx_pdev = NULL;
  270. tid_stats = NULL;
  271. dp_pkt_get_timestamp(&current_time);
  272. if (qdf_unlikely(dp_rx_srng_access_start(int_ctx, soc, hal_ring_hdl))) {
  273. /*
  274. * Need API to convert from hal_ring pointer to
  275. * Ring Type / Ring Id combo
  276. */
  277. DP_STATS_INC(soc, rx.err.hal_ring_access_fail, 1);
  278. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  279. FL("HAL RING Access Failed -- %pK"), hal_ring_hdl);
  280. goto done;
  281. }
  282. if (!num_pending)
  283. num_pending = hal_srng_dst_num_valid(hal_soc, hal_ring_hdl, 0);
  284. dp_srng_dst_inv_cached_descs(soc, hal_ring_hdl, num_pending);
  285. if (num_pending > quota)
  286. num_pending = quota;
  287. last_prefetched_hw_desc = dp_srng_dst_prefetch(hal_soc, hal_ring_hdl,
  288. num_pending);
  289. peer_ext_stats = wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx);
  290. max_ast = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  291. /*
  292. * start reaping the buffers from reo ring and queue
  293. * them in per vdev queue.
  294. * Process the received pkts in a different per vdev loop.
  295. */
  296. while (qdf_likely(num_pending)) {
  297. ring_desc = dp_srng_dst_get_next(soc, hal_ring_hdl);
  298. if (qdf_unlikely(!ring_desc))
  299. break;
  300. error = HAL_RX_ERROR_STATUS_GET(ring_desc);
  301. if (qdf_unlikely(error == HAL_REO_ERROR_DETECTED)) {
  302. dp_rx_err("%pK: HAL RING 0x%pK:error %d",
  303. soc, hal_ring_hdl, error);
  304. DP_STATS_INC(soc, rx.err.hal_reo_error[reo_ring_num],
  305. 1);
  306. /* Don't know how to deal with this -- assert */
  307. qdf_assert(0);
  308. }
  309. dp_rx_ring_record_entry(soc, reo_ring_num, ring_desc);
  310. rx_buf_cookie = HAL_RX_REO_BUF_COOKIE_GET(ring_desc);
  311. status = dp_rx_cookie_check_and_invalidate(ring_desc);
  312. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  313. DP_STATS_INC(soc, rx.err.stale_cookie, 1);
  314. break;
  315. }
  316. rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, rx_buf_cookie);
  317. status = dp_rx_desc_sanity(soc, hal_soc, hal_ring_hdl,
  318. ring_desc, rx_desc);
  319. if (QDF_IS_STATUS_ERROR(status)) {
  320. if (qdf_unlikely(rx_desc && rx_desc->nbuf)) {
  321. qdf_assert_always(!rx_desc->unmapped);
  322. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  323. rx_desc->unmapped = 1;
  324. dp_rx_buffer_pool_nbuf_free(soc, rx_desc->nbuf,
  325. rx_desc->pool_id);
  326. dp_rx_add_to_free_desc_list(
  327. &head[rx_desc->pool_id],
  328. &tail[rx_desc->pool_id],
  329. rx_desc);
  330. }
  331. continue;
  332. }
  333. /*
  334. * this is a unlikely scenario where the host is reaping
  335. * a descriptor which it already reaped just a while ago
  336. * but is yet to replenish it back to HW.
  337. * In this case host will dump the last 128 descriptors
  338. * including the software descriptor rx_desc and assert.
  339. */
  340. if (qdf_unlikely(!rx_desc->in_use)) {
  341. DP_STATS_INC(soc, rx.err.hal_reo_dest_dup, 1);
  342. dp_info_rl("Reaping rx_desc not in use!");
  343. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  344. ring_desc, rx_desc);
  345. /* ignore duplicate RX desc and continue to process */
  346. /* Pop out the descriptor */
  347. continue;
  348. }
  349. status = dp_rx_desc_nbuf_sanity_check(soc, ring_desc, rx_desc);
  350. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  351. DP_STATS_INC(soc, rx.err.nbuf_sanity_fail, 1);
  352. dp_info_rl("Nbuf sanity check failure!");
  353. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  354. ring_desc, rx_desc);
  355. rx_desc->in_err_state = 1;
  356. continue;
  357. }
  358. if (qdf_unlikely(!dp_rx_desc_check_magic(rx_desc))) {
  359. dp_err("Invalid rx_desc cookie=%d", rx_buf_cookie);
  360. DP_STATS_INC(soc, rx.err.rx_desc_invalid_magic, 1);
  361. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  362. ring_desc, rx_desc);
  363. }
  364. /* Get MPDU DESC info */
  365. hal_rx_mpdu_desc_info_get_li(ring_desc, &mpdu_desc_info);
  366. /* Get MSDU DESC info */
  367. hal_rx_msdu_desc_info_get_li(ring_desc, &msdu_desc_info);
  368. if (qdf_unlikely(msdu_desc_info.msdu_flags &
  369. HAL_MSDU_F_MSDU_CONTINUATION)) {
  370. /* previous msdu has end bit set, so current one is
  371. * the new MPDU
  372. */
  373. if (is_prev_msdu_last) {
  374. /* For new MPDU check if we can read complete
  375. * MPDU by comparing the number of buffers
  376. * available and number of buffers needed to
  377. * reap this MPDU
  378. */
  379. if ((msdu_desc_info.msdu_len /
  380. (RX_DATA_BUFFER_SIZE -
  381. soc->rx_pkt_tlv_size) + 1) >
  382. num_pending) {
  383. DP_STATS_INC(soc,
  384. rx.msdu_scatter_wait_break,
  385. 1);
  386. dp_rx_cookie_reset_invalid_bit(
  387. ring_desc);
  388. /* As we are going to break out of the
  389. * loop because of unavailability of
  390. * descs to form complete SG, we need to
  391. * reset the TP in the REO destination
  392. * ring.
  393. */
  394. hal_srng_dst_dec_tp(hal_soc,
  395. hal_ring_hdl);
  396. break;
  397. }
  398. is_prev_msdu_last = false;
  399. }
  400. }
  401. if (mpdu_desc_info.mpdu_flags & HAL_MPDU_F_RETRY_BIT)
  402. qdf_nbuf_set_rx_retry_flag(rx_desc->nbuf, 1);
  403. if (qdf_unlikely(mpdu_desc_info.mpdu_flags &
  404. HAL_MPDU_F_RAW_AMPDU))
  405. qdf_nbuf_set_raw_frame(rx_desc->nbuf, 1);
  406. if (!is_prev_msdu_last &&
  407. msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  408. is_prev_msdu_last = true;
  409. rx_bufs_reaped[rx_desc->pool_id]++;
  410. peer_mdata = mpdu_desc_info.peer_meta_data;
  411. QDF_NBUF_CB_RX_PEER_ID(rx_desc->nbuf) =
  412. dp_rx_peer_metadata_peer_id_get_li(soc, peer_mdata);
  413. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  414. DP_PEER_METADATA_VDEV_ID_GET_LI(peer_mdata);
  415. /* to indicate whether this msdu is rx offload */
  416. pkt_capture_offload =
  417. DP_PEER_METADATA_OFFLOAD_GET_LI(peer_mdata);
  418. /*
  419. * save msdu flags first, last and continuation msdu in
  420. * nbuf->cb, also save mcbc, is_da_valid, is_sa_valid and
  421. * length to nbuf->cb. This ensures the info required for
  422. * per pkt processing is always in the same cache line.
  423. * This helps in improving throughput for smaller pkt
  424. * sizes.
  425. */
  426. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_FIRST_MSDU_IN_MPDU)
  427. qdf_nbuf_set_rx_chfrag_start(rx_desc->nbuf, 1);
  428. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_MSDU_CONTINUATION)
  429. qdf_nbuf_set_rx_chfrag_cont(rx_desc->nbuf, 1);
  430. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  431. qdf_nbuf_set_rx_chfrag_end(rx_desc->nbuf, 1);
  432. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_MCBC)
  433. qdf_nbuf_set_da_mcbc(rx_desc->nbuf, 1);
  434. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_VALID)
  435. qdf_nbuf_set_da_valid(rx_desc->nbuf, 1);
  436. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_SA_IS_VALID)
  437. qdf_nbuf_set_sa_valid(rx_desc->nbuf, 1);
  438. qdf_nbuf_set_tid_val(rx_desc->nbuf,
  439. HAL_RX_REO_QUEUE_NUMBER_GET(ring_desc));
  440. /* set reo dest indication */
  441. qdf_nbuf_set_rx_reo_dest_ind_or_sw_excpt(
  442. rx_desc->nbuf,
  443. HAL_RX_REO_MSDU_REO_DST_IND_GET(ring_desc));
  444. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  445. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  446. /*
  447. * move unmap after scattered msdu waiting break logic
  448. * in case double skb unmap happened.
  449. */
  450. dp_rx_nbuf_unmap(soc, rx_desc, reo_ring_num);
  451. rx_desc->unmapped = 1;
  452. DP_RX_PROCESS_NBUF(soc, nbuf_head, nbuf_tail, ebuf_head,
  453. ebuf_tail, rx_desc);
  454. quota -= 1;
  455. num_pending -= 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. dp_rx_prefetch_hw_sw_nbuf_desc(soc, hal_soc, num_pending,
  460. hal_ring_hdl,
  461. &last_prefetched_hw_desc,
  462. &last_prefetched_sw_desc);
  463. /*
  464. * only if complete msdu is received for scatter case,
  465. * then allow break.
  466. */
  467. if (is_prev_msdu_last &&
  468. dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped,
  469. max_reap_limit))
  470. break;
  471. }
  472. done:
  473. dp_rx_srng_access_end(int_ctx, soc, hal_ring_hdl);
  474. dp_rx_per_core_stats_update(soc, reo_ring_num, num_rx_bufs_reaped);
  475. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  476. /*
  477. * continue with next mac_id if no pkts were reaped
  478. * from that pool
  479. */
  480. if (!rx_bufs_reaped[mac_id])
  481. continue;
  482. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  483. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  484. dp_rx_buffers_replenish_simple(soc, mac_id, dp_rxdma_srng,
  485. rx_desc_pool,
  486. rx_bufs_reaped[mac_id],
  487. &head[mac_id], &tail[mac_id]);
  488. }
  489. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  490. /* Peer can be NULL is case of LFR */
  491. if (qdf_likely(txrx_peer))
  492. vdev = NULL;
  493. /*
  494. * BIG loop where each nbuf is dequeued from global queue,
  495. * processed and queued back on a per vdev basis. These nbufs
  496. * are sent to stack as and when we run out of nbufs
  497. * or a new nbuf dequeued from global queue has a different
  498. * vdev when compared to previous nbuf.
  499. */
  500. nbuf = nbuf_head;
  501. while (nbuf) {
  502. next = nbuf->next;
  503. dp_rx_prefetch_nbuf_data(nbuf, next);
  504. if (qdf_unlikely(dp_rx_is_raw_frame_dropped(nbuf))) {
  505. nbuf = next;
  506. DP_STATS_INC(soc, rx.err.raw_frm_drop, 1);
  507. continue;
  508. }
  509. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  510. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  511. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  512. if (dp_rx_is_list_ready(deliver_list_head, vdev, txrx_peer,
  513. peer_id, vdev_id)) {
  514. dp_rx_deliver_to_stack(soc, vdev, txrx_peer,
  515. deliver_list_head,
  516. deliver_list_tail);
  517. deliver_list_head = NULL;
  518. deliver_list_tail = NULL;
  519. }
  520. /* Get TID from struct cb->tid_val, save to tid */
  521. if (qdf_nbuf_is_rx_chfrag_start(nbuf)) {
  522. tid = qdf_nbuf_get_tid_val(nbuf);
  523. if (tid >= CDP_MAX_DATA_TIDS) {
  524. DP_STATS_INC(soc, rx.err.rx_invalid_tid_err, 1);
  525. dp_rx_nbuf_free(nbuf);
  526. nbuf = next;
  527. continue;
  528. }
  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_rx_nbuf_free(nbuf);
  656. DP_STATS_INC(soc, rx.err.scatter_msdu, 1);
  657. dp_info_rl("scatter msdu len %d, dropped",
  658. msdu_len);
  659. nbuf = next;
  660. continue;
  661. }
  662. } else {
  663. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  664. pkt_len = msdu_len +
  665. msdu_metadata.l3_hdr_pad +
  666. soc->rx_pkt_tlv_size;
  667. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  668. dp_rx_skip_tlvs(soc, nbuf, msdu_metadata.l3_hdr_pad);
  669. }
  670. dp_rx_send_pktlog(soc, rx_pdev, nbuf, QDF_TX_RX_STATUS_OK);
  671. /*
  672. * process frame for mulitpass phrase processing
  673. */
  674. if (qdf_unlikely(vdev->multipass_en)) {
  675. if (dp_rx_multipass_process(txrx_peer, nbuf,
  676. tid) == false) {
  677. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  678. rx.multipass_rx_pkt_drop,
  679. 1);
  680. dp_rx_nbuf_free(nbuf);
  681. nbuf = next;
  682. continue;
  683. }
  684. }
  685. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, txrx_peer)) {
  686. dp_rx_err("%pK: Policy Check Drop pkt", soc);
  687. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  688. rx.policy_check_drop, 1);
  689. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  690. /* Drop & free packet */
  691. dp_rx_nbuf_free(nbuf);
  692. /* Statistics */
  693. nbuf = next;
  694. continue;
  695. }
  696. if (qdf_unlikely(txrx_peer && (txrx_peer->nawds_enabled) &&
  697. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  698. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  699. rx_tlv_hdr) ==
  700. false))) {
  701. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  702. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  703. rx.nawds_mcast_drop, 1);
  704. dp_rx_nbuf_free(nbuf);
  705. nbuf = next;
  706. continue;
  707. }
  708. /*
  709. * Drop non-EAPOL frames from unauthorized peer.
  710. */
  711. if (qdf_likely(txrx_peer) &&
  712. qdf_unlikely(!txrx_peer->authorize) &&
  713. !qdf_nbuf_is_raw_frame(nbuf)) {
  714. bool is_eapol = qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  715. qdf_nbuf_is_ipv4_wapi_pkt(nbuf);
  716. if (!is_eapol) {
  717. DP_PEER_PER_PKT_STATS_INC(txrx_peer,
  718. rx.peer_unauth_rx_pkt_drop,
  719. 1);
  720. dp_rx_nbuf_free(nbuf);
  721. nbuf = next;
  722. continue;
  723. }
  724. }
  725. if (soc->process_rx_status)
  726. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  727. /* Update the protocol tag in SKB based on CCE metadata */
  728. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  729. reo_ring_num, false, true);
  730. /* Update the flow tag in SKB based on FSE metadata */
  731. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  732. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, txrx_peer,
  733. reo_ring_num, tid_stats);
  734. if (qdf_unlikely(vdev->mesh_vdev)) {
  735. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  736. == QDF_STATUS_SUCCESS) {
  737. dp_rx_info("%pK: mesh pkt filtered", soc);
  738. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  739. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  740. 1);
  741. dp_rx_nbuf_free(nbuf);
  742. nbuf = next;
  743. continue;
  744. }
  745. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr,
  746. txrx_peer);
  747. }
  748. if (qdf_likely(vdev->rx_decap_type ==
  749. htt_cmn_pkt_type_ethernet) &&
  750. qdf_likely(!vdev->mesh_vdev)) {
  751. /* Due to HW issue, sometimes we see that the sa_idx
  752. * and da_idx are invalid with sa_valid and da_valid
  753. * bits set
  754. *
  755. * in this case we also see that value of
  756. * sa_sw_peer_id is set as 0
  757. *
  758. * Drop the packet if sa_idx and da_idx OOB or
  759. * sa_sw_peerid is 0
  760. */
  761. if (!is_sa_da_idx_valid(max_ast, nbuf,
  762. msdu_metadata)) {
  763. dp_rx_nbuf_free(nbuf);
  764. nbuf = next;
  765. DP_STATS_INC(soc, rx.err.invalid_sa_da_idx, 1);
  766. continue;
  767. }
  768. if (qdf_unlikely(dp_rx_mec_check_wrapper(soc,
  769. txrx_peer,
  770. rx_tlv_hdr,
  771. nbuf))) {
  772. /* this is a looped back MCBC pkt,drop it */
  773. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  774. rx.mec_drop, 1,
  775. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  776. dp_rx_nbuf_free(nbuf);
  777. nbuf = next;
  778. continue;
  779. }
  780. /* WDS Source Port Learning */
  781. if (qdf_likely(vdev->wds_enabled))
  782. dp_rx_wds_srcport_learn(soc,
  783. rx_tlv_hdr,
  784. txrx_peer,
  785. nbuf,
  786. msdu_metadata);
  787. /* Intrabss-fwd */
  788. if (dp_rx_check_ap_bridge(vdev))
  789. if (dp_rx_intrabss_fwd_li(soc, txrx_peer,
  790. rx_tlv_hdr,
  791. nbuf,
  792. msdu_metadata,
  793. tid_stats)) {
  794. nbuf = next;
  795. tid_stats->intrabss_cnt++;
  796. continue; /* Get next desc */
  797. }
  798. }
  799. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  800. dp_rx_mark_first_packet_after_wow_wakeup(vdev->pdev, rx_tlv_hdr,
  801. nbuf);
  802. dp_rx_update_stats(soc, nbuf);
  803. dp_pkt_add_timestamp(txrx_peer->vdev, QDF_PKT_RX_DRIVER_ENTRY,
  804. current_time, nbuf);
  805. DP_RX_LIST_APPEND(deliver_list_head,
  806. deliver_list_tail,
  807. nbuf);
  808. DP_PEER_STATS_FLAT_INC_PKT(txrx_peer, to_stack, 1,
  809. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  810. if (qdf_unlikely(txrx_peer->in_twt))
  811. DP_PEER_PER_PKT_STATS_INC_PKT(txrx_peer,
  812. rx.to_stack_twt, 1,
  813. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  814. tid_stats->delivered_to_stack++;
  815. nbuf = next;
  816. }
  817. DP_RX_DELIVER_TO_STACK(soc, vdev, txrx_peer, peer_id,
  818. pkt_capture_offload,
  819. deliver_list_head,
  820. deliver_list_tail);
  821. if (qdf_likely(txrx_peer))
  822. dp_txrx_peer_unref_delete(txrx_ref_handle, DP_MOD_ID_RX);
  823. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  824. if (quota) {
  825. num_pending =
  826. dp_rx_srng_get_num_pending(hal_soc,
  827. hal_ring_hdl,
  828. num_entries,
  829. &near_full);
  830. if (num_pending) {
  831. DP_STATS_INC(soc, rx.hp_oos2, 1);
  832. if (!hif_exec_should_yield(scn, intr_id))
  833. goto more_data;
  834. if (qdf_unlikely(near_full)) {
  835. DP_STATS_INC(soc, rx.near_full, 1);
  836. goto more_data;
  837. }
  838. }
  839. }
  840. if (vdev && vdev->osif_fisa_flush)
  841. vdev->osif_fisa_flush(soc, reo_ring_num);
  842. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  843. vdev->osif_gro_flush(vdev->osif_vdev,
  844. reo_ring_num);
  845. }
  846. }
  847. /* Update histogram statistics by looping through pdev's */
  848. DP_RX_HIST_STATS_PER_PDEV();
  849. return rx_bufs_used; /* Assume no scale factor for now */
  850. }
  851. QDF_STATUS dp_rx_desc_pool_init_li(struct dp_soc *soc,
  852. struct rx_desc_pool *rx_desc_pool,
  853. uint32_t pool_id)
  854. {
  855. return dp_rx_desc_pool_init_generic(soc, rx_desc_pool, pool_id);
  856. }
  857. void dp_rx_desc_pool_deinit_li(struct dp_soc *soc,
  858. struct rx_desc_pool *rx_desc_pool,
  859. uint32_t pool_id)
  860. {
  861. }
  862. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_li(
  863. struct dp_soc *soc,
  864. void *ring_desc,
  865. struct dp_rx_desc **r_rx_desc)
  866. {
  867. struct hal_buf_info buf_info = {0};
  868. hal_soc_handle_t hal_soc = soc->hal_soc;
  869. /* only cookie and rbm will be valid in buf_info */
  870. hal_rx_buf_cookie_rbm_get(hal_soc, (uint32_t *)ring_desc,
  871. &buf_info);
  872. if (qdf_unlikely(buf_info.rbm !=
  873. HAL_RX_BUF_RBM_SW3_BM(soc->wbm_sw0_bm_id))) {
  874. /* TODO */
  875. /* Call appropriate handler */
  876. DP_STATS_INC(soc, rx.err.invalid_rbm, 1);
  877. dp_rx_err("%pK: Invalid RBM %d", soc, buf_info.rbm);
  878. return QDF_STATUS_E_INVAL;
  879. }
  880. if (!dp_rx_is_sw_cookie_valid(soc, buf_info.sw_cookie)) {
  881. dp_rx_err("invalid sw_cookie 0x%x", buf_info.sw_cookie);
  882. return QDF_STATUS_E_INVAL;
  883. }
  884. *r_rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, buf_info.sw_cookie);
  885. return QDF_STATUS_SUCCESS;
  886. }