dp_li_rx.c 28 KB

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