dp_be_rx.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176
  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_tx.h"
  23. #include "dp_be_rx.h"
  24. #include "dp_peer.h"
  25. #include "hal_rx.h"
  26. #include "hal_be_rx.h"
  27. #include "hal_api.h"
  28. #include "hal_be_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 FEATURE_WDS
  36. #include "dp_txrx_wds.h"
  37. #endif
  38. #include "dp_hist.h"
  39. #include "dp_rx_buffer_pool.h"
  40. #ifndef AST_OFFLOAD_ENABLE
  41. static void
  42. dp_rx_wds_learn(struct dp_soc *soc,
  43. struct dp_vdev *vdev,
  44. uint8_t *rx_tlv_hdr,
  45. struct dp_peer *peer,
  46. qdf_nbuf_t nbuf,
  47. struct hal_rx_msdu_metadata msdu_metadata)
  48. {
  49. /* WDS Source Port Learning */
  50. if (qdf_likely(vdev->wds_enabled))
  51. dp_rx_wds_srcport_learn(soc,
  52. rx_tlv_hdr,
  53. peer,
  54. nbuf,
  55. msdu_metadata);
  56. }
  57. #else
  58. static void
  59. dp_rx_wds_learn(struct dp_soc *soc,
  60. struct dp_vdev *vdev,
  61. uint8_t *rx_tlv_hdr,
  62. struct dp_peer *ta_peer,
  63. qdf_nbuf_t nbuf,
  64. struct hal_rx_msdu_metadata msdu_metadata)
  65. {
  66. }
  67. #endif
  68. /**
  69. * dp_rx_process_be() - Brain of the Rx processing functionality
  70. * Called from the bottom half (tasklet/NET_RX_SOFTIRQ)
  71. * @int_ctx: per interrupt context
  72. * @hal_ring: opaque pointer to the HAL Rx Ring, which will be serviced
  73. * @reo_ring_num: ring number (0, 1, 2 or 3) of the reo ring.
  74. * @quota: No. of units (packets) that can be serviced in one shot.
  75. *
  76. * This function implements the core of Rx functionality. This is
  77. * expected to handle only non-error frames.
  78. *
  79. * Return: uint32_t: No. of elements processed
  80. */
  81. uint32_t dp_rx_process_be(struct dp_intr *int_ctx,
  82. hal_ring_handle_t hal_ring_hdl, uint8_t reo_ring_num,
  83. uint32_t quota)
  84. {
  85. hal_ring_desc_t ring_desc;
  86. hal_soc_handle_t hal_soc;
  87. struct dp_rx_desc *rx_desc = NULL;
  88. qdf_nbuf_t nbuf, next;
  89. bool near_full;
  90. union dp_rx_desc_list_elem_t *head[MAX_PDEV_CNT];
  91. union dp_rx_desc_list_elem_t *tail[MAX_PDEV_CNT];
  92. uint32_t num_pending;
  93. uint32_t rx_bufs_used = 0, rx_buf_cookie;
  94. uint16_t msdu_len = 0;
  95. uint16_t peer_id;
  96. uint8_t vdev_id;
  97. struct dp_peer *peer;
  98. struct dp_vdev *vdev;
  99. uint32_t pkt_len = 0;
  100. struct hal_rx_mpdu_desc_info mpdu_desc_info;
  101. struct hal_rx_msdu_desc_info msdu_desc_info;
  102. enum hal_reo_error_status error;
  103. uint32_t peer_mdata;
  104. uint8_t *rx_tlv_hdr;
  105. uint32_t rx_bufs_reaped[MAX_PDEV_CNT];
  106. uint8_t mac_id = 0;
  107. struct dp_pdev *rx_pdev;
  108. struct dp_srng *dp_rxdma_srng;
  109. struct rx_desc_pool *rx_desc_pool;
  110. struct dp_soc *soc = int_ctx->soc;
  111. uint8_t core_id = 0;
  112. struct cdp_tid_rx_stats *tid_stats;
  113. qdf_nbuf_t nbuf_head;
  114. qdf_nbuf_t nbuf_tail;
  115. qdf_nbuf_t deliver_list_head;
  116. qdf_nbuf_t deliver_list_tail;
  117. uint32_t num_rx_bufs_reaped = 0;
  118. uint32_t intr_id;
  119. struct hif_opaque_softc *scn;
  120. int32_t tid = 0;
  121. bool is_prev_msdu_last = true;
  122. uint32_t num_entries_avail = 0;
  123. uint32_t rx_ol_pkt_cnt = 0;
  124. uint32_t num_entries = 0;
  125. struct hal_rx_msdu_metadata msdu_metadata;
  126. QDF_STATUS status;
  127. qdf_nbuf_t ebuf_head;
  128. qdf_nbuf_t ebuf_tail;
  129. uint8_t pkt_capture_offload = 0;
  130. struct dp_srng *rx_ring = &soc->reo_dest_ring[reo_ring_num];
  131. int max_reap_limit, ring_near_full;
  132. DP_HIST_INIT();
  133. qdf_assert_always(soc && hal_ring_hdl);
  134. hal_soc = soc->hal_soc;
  135. qdf_assert_always(hal_soc);
  136. scn = soc->hif_handle;
  137. hif_pm_runtime_mark_dp_rx_busy(scn);
  138. intr_id = int_ctx->dp_intr_id;
  139. num_entries = hal_srng_get_num_entries(hal_soc, hal_ring_hdl);
  140. more_data:
  141. /* reset local variables here to be re-used in the function */
  142. nbuf_head = NULL;
  143. nbuf_tail = NULL;
  144. deliver_list_head = NULL;
  145. deliver_list_tail = NULL;
  146. peer = NULL;
  147. vdev = NULL;
  148. num_rx_bufs_reaped = 0;
  149. ebuf_head = NULL;
  150. ebuf_tail = NULL;
  151. ring_near_full = 0;
  152. max_reap_limit = dp_rx_get_loop_pkt_limit(soc);
  153. qdf_mem_zero(rx_bufs_reaped, sizeof(rx_bufs_reaped));
  154. qdf_mem_zero(&mpdu_desc_info, sizeof(mpdu_desc_info));
  155. qdf_mem_zero(&msdu_desc_info, sizeof(msdu_desc_info));
  156. qdf_mem_zero(head, sizeof(head));
  157. qdf_mem_zero(tail, sizeof(tail));
  158. ring_near_full = _dp_srng_test_and_update_nf_params(soc, rx_ring,
  159. &max_reap_limit);
  160. if (qdf_unlikely(dp_rx_srng_access_start(int_ctx, soc, hal_ring_hdl))) {
  161. /*
  162. * Need API to convert from hal_ring pointer to
  163. * Ring Type / Ring Id combo
  164. */
  165. DP_STATS_INC(soc, rx.err.hal_ring_access_fail, 1);
  166. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  167. FL("HAL RING Access Failed -- %pK"), hal_ring_hdl);
  168. goto done;
  169. }
  170. /*
  171. * start reaping the buffers from reo ring and queue
  172. * them in per vdev queue.
  173. * Process the received pkts in a different per vdev loop.
  174. */
  175. while (qdf_likely(quota &&
  176. (ring_desc = hal_srng_dst_peek(hal_soc,
  177. hal_ring_hdl)))) {
  178. error = HAL_RX_ERROR_STATUS_GET(ring_desc);
  179. if (qdf_unlikely(error == HAL_REO_ERROR_DETECTED)) {
  180. dp_rx_err("%pK: HAL RING 0x%pK:error %d",
  181. soc, hal_ring_hdl, error);
  182. DP_STATS_INC(soc, rx.err.hal_reo_error[reo_ring_num],
  183. 1);
  184. /* Don't know how to deal with this -- assert */
  185. qdf_assert(0);
  186. }
  187. dp_rx_ring_record_entry(soc, reo_ring_num, ring_desc);
  188. rx_buf_cookie = HAL_RX_REO_BUF_COOKIE_GET(ring_desc);
  189. status = dp_rx_cookie_check_and_invalidate(ring_desc);
  190. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  191. DP_STATS_INC(soc, rx.err.stale_cookie, 1);
  192. break;
  193. }
  194. rx_desc = (struct dp_rx_desc *)
  195. hal_rx_get_reo_desc_va(ring_desc);
  196. dp_rx_desc_sw_cc_check(soc, rx_buf_cookie, &rx_desc);
  197. status = dp_rx_desc_sanity(soc, hal_soc, hal_ring_hdl,
  198. ring_desc, rx_desc);
  199. if (QDF_IS_STATUS_ERROR(status)) {
  200. if (qdf_unlikely(rx_desc && rx_desc->nbuf)) {
  201. qdf_assert_always(!rx_desc->unmapped);
  202. dp_ipa_reo_ctx_buf_mapping_lock(
  203. soc,
  204. reo_ring_num);
  205. dp_ipa_handle_rx_buf_smmu_mapping(
  206. soc,
  207. rx_desc->nbuf,
  208. RX_DATA_BUFFER_SIZE,
  209. false);
  210. qdf_nbuf_unmap_nbytes_single(
  211. soc->osdev,
  212. rx_desc->nbuf,
  213. QDF_DMA_FROM_DEVICE,
  214. RX_DATA_BUFFER_SIZE);
  215. rx_desc->unmapped = 1;
  216. dp_ipa_reo_ctx_buf_mapping_unlock(
  217. soc,
  218. reo_ring_num);
  219. dp_rx_buffer_pool_nbuf_free(soc, rx_desc->nbuf,
  220. rx_desc->pool_id);
  221. dp_rx_add_to_free_desc_list(
  222. &head[rx_desc->pool_id],
  223. &tail[rx_desc->pool_id],
  224. rx_desc);
  225. }
  226. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  227. continue;
  228. }
  229. /*
  230. * this is a unlikely scenario where the host is reaping
  231. * a descriptor which it already reaped just a while ago
  232. * but is yet to replenish it back to HW.
  233. * In this case host will dump the last 128 descriptors
  234. * including the software descriptor rx_desc and assert.
  235. */
  236. if (qdf_unlikely(!rx_desc->in_use)) {
  237. DP_STATS_INC(soc, rx.err.hal_reo_dest_dup, 1);
  238. dp_info_rl("Reaping rx_desc not in use!");
  239. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  240. ring_desc, rx_desc);
  241. /* ignore duplicate RX desc and continue to process */
  242. /* Pop out the descriptor */
  243. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  244. continue;
  245. }
  246. status = dp_rx_desc_nbuf_sanity_check(soc, ring_desc, rx_desc);
  247. if (qdf_unlikely(QDF_IS_STATUS_ERROR(status))) {
  248. DP_STATS_INC(soc, rx.err.nbuf_sanity_fail, 1);
  249. dp_info_rl("Nbuf sanity check failure!");
  250. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  251. ring_desc, rx_desc);
  252. rx_desc->in_err_state = 1;
  253. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  254. continue;
  255. }
  256. if (qdf_unlikely(!dp_rx_desc_check_magic(rx_desc))) {
  257. dp_err("Invalid rx_desc cookie=%d", rx_buf_cookie);
  258. DP_STATS_INC(soc, rx.err.rx_desc_invalid_magic, 1);
  259. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  260. ring_desc, rx_desc);
  261. }
  262. /* Get MPDU DESC info */
  263. hal_rx_mpdu_desc_info_get_be(ring_desc, &mpdu_desc_info);
  264. /* Get MSDU DESC info */
  265. hal_rx_msdu_desc_info_get_be(ring_desc, &msdu_desc_info);
  266. if (qdf_unlikely(msdu_desc_info.msdu_flags &
  267. HAL_MSDU_F_MSDU_CONTINUATION)) {
  268. /* previous msdu has end bit set, so current one is
  269. * the new MPDU
  270. */
  271. if (is_prev_msdu_last) {
  272. /* Get number of entries available in HW ring */
  273. num_entries_avail =
  274. hal_srng_dst_num_valid(hal_soc,
  275. hal_ring_hdl, 1);
  276. /* For new MPDU check if we can read complete
  277. * MPDU by comparing the number of buffers
  278. * available and number of buffers needed to
  279. * reap this MPDU
  280. */
  281. if ((msdu_desc_info.msdu_len /
  282. (RX_DATA_BUFFER_SIZE -
  283. soc->rx_pkt_tlv_size) + 1) >
  284. num_entries_avail) {
  285. DP_STATS_INC(soc,
  286. rx.msdu_scatter_wait_break,
  287. 1);
  288. dp_rx_cookie_reset_invalid_bit(
  289. ring_desc);
  290. break;
  291. }
  292. is_prev_msdu_last = false;
  293. }
  294. }
  295. core_id = smp_processor_id();
  296. DP_STATS_INC(soc, rx.ring_packets[core_id][reo_ring_num], 1);
  297. if (mpdu_desc_info.mpdu_flags & HAL_MPDU_F_RETRY_BIT)
  298. qdf_nbuf_set_rx_retry_flag(rx_desc->nbuf, 1);
  299. if (qdf_unlikely(mpdu_desc_info.mpdu_flags &
  300. HAL_MPDU_F_RAW_AMPDU))
  301. qdf_nbuf_set_raw_frame(rx_desc->nbuf, 1);
  302. if (!is_prev_msdu_last &&
  303. msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  304. is_prev_msdu_last = true;
  305. /* Pop out the descriptor*/
  306. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  307. rx_bufs_reaped[rx_desc->pool_id]++;
  308. peer_mdata = mpdu_desc_info.peer_meta_data;
  309. QDF_NBUF_CB_RX_PEER_ID(rx_desc->nbuf) =
  310. dp_rx_peer_metadata_peer_id_get_be(soc, peer_mdata);
  311. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  312. dp_rx_peer_metadata_vdev_id_get_be(soc, peer_mdata);
  313. /* to indicate whether this msdu is rx offload */
  314. pkt_capture_offload =
  315. DP_PEER_METADATA_OFFLOAD_GET_BE(peer_mdata);
  316. /*
  317. * save msdu flags first, last and continuation msdu in
  318. * nbuf->cb, also save mcbc, is_da_valid, is_sa_valid and
  319. * length to nbuf->cb. This ensures the info required for
  320. * per pkt processing is always in the same cache line.
  321. * This helps in improving throughput for smaller pkt
  322. * sizes.
  323. */
  324. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_FIRST_MSDU_IN_MPDU)
  325. qdf_nbuf_set_rx_chfrag_start(rx_desc->nbuf, 1);
  326. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_MSDU_CONTINUATION)
  327. qdf_nbuf_set_rx_chfrag_cont(rx_desc->nbuf, 1);
  328. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  329. qdf_nbuf_set_rx_chfrag_end(rx_desc->nbuf, 1);
  330. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_MCBC)
  331. qdf_nbuf_set_da_mcbc(rx_desc->nbuf, 1);
  332. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_VALID)
  333. qdf_nbuf_set_da_valid(rx_desc->nbuf, 1);
  334. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_SA_IS_VALID)
  335. qdf_nbuf_set_sa_valid(rx_desc->nbuf, 1);
  336. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_INTRA_BSS)
  337. qdf_nbuf_set_intra_bss(rx_desc->nbuf, 1);
  338. if (qdf_likely(mpdu_desc_info.mpdu_flags &
  339. HAL_MPDU_F_QOS_CONTROL_VALID))
  340. qdf_nbuf_set_tid_val(rx_desc->nbuf, mpdu_desc_info.tid);
  341. #ifdef CONFIG_LITHIUM
  342. qdf_nbuf_set_rx_reo_dest_ind(
  343. rx_desc->nbuf,
  344. HAL_RX_REO_MSDU_REO_DST_IND_GET(ring_desc));
  345. #endif
  346. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  347. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  348. /*
  349. * move unmap after scattered msdu waiting break logic
  350. * in case double skb unmap happened.
  351. */
  352. rx_desc_pool = &soc->rx_desc_buf[rx_desc->pool_id];
  353. dp_ipa_reo_ctx_buf_mapping_lock(soc, reo_ring_num);
  354. dp_ipa_handle_rx_buf_smmu_mapping(soc, rx_desc->nbuf,
  355. rx_desc_pool->buf_size,
  356. false);
  357. qdf_nbuf_unmap_nbytes_single(soc->osdev, rx_desc->nbuf,
  358. QDF_DMA_FROM_DEVICE,
  359. rx_desc_pool->buf_size);
  360. rx_desc->unmapped = 1;
  361. dp_ipa_reo_ctx_buf_mapping_unlock(soc, reo_ring_num);
  362. DP_RX_PROCESS_NBUF(soc, nbuf_head, nbuf_tail, ebuf_head,
  363. ebuf_tail, rx_desc);
  364. /*
  365. * if continuation bit is set then we have MSDU spread
  366. * across multiple buffers, let us not decrement quota
  367. * till we reap all buffers of that MSDU.
  368. */
  369. if (qdf_likely(!qdf_nbuf_is_rx_chfrag_cont(rx_desc->nbuf)))
  370. quota -= 1;
  371. dp_rx_add_to_free_desc_list(&head[rx_desc->pool_id],
  372. &tail[rx_desc->pool_id], rx_desc);
  373. num_rx_bufs_reaped++;
  374. /*
  375. * only if complete msdu is received for scatter case,
  376. * then allow break.
  377. */
  378. if (is_prev_msdu_last &&
  379. dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped,
  380. max_reap_limit))
  381. break;
  382. }
  383. done:
  384. dp_rx_srng_access_end(int_ctx, soc, hal_ring_hdl);
  385. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  386. /*
  387. * continue with next mac_id if no pkts were reaped
  388. * from that pool
  389. */
  390. if (!rx_bufs_reaped[mac_id])
  391. continue;
  392. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  393. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  394. dp_rx_buffers_replenish(soc, mac_id, dp_rxdma_srng,
  395. rx_desc_pool, rx_bufs_reaped[mac_id],
  396. &head[mac_id], &tail[mac_id]);
  397. }
  398. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  399. /* Peer can be NULL is case of LFR */
  400. if (qdf_likely(peer))
  401. vdev = NULL;
  402. /*
  403. * BIG loop where each nbuf is dequeued from global queue,
  404. * processed and queued back on a per vdev basis. These nbufs
  405. * are sent to stack as and when we run out of nbufs
  406. * or a new nbuf dequeued from global queue has a different
  407. * vdev when compared to previous nbuf.
  408. */
  409. nbuf = nbuf_head;
  410. while (nbuf) {
  411. next = nbuf->next;
  412. if (qdf_unlikely(dp_rx_is_raw_frame_dropped(nbuf))) {
  413. nbuf = next;
  414. DP_STATS_INC(soc, rx.err.raw_frm_drop, 1);
  415. continue;
  416. }
  417. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  418. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  419. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  420. if (dp_rx_is_list_ready(deliver_list_head, vdev, peer,
  421. peer_id, vdev_id)) {
  422. dp_rx_deliver_to_stack(soc, vdev, peer,
  423. deliver_list_head,
  424. deliver_list_tail);
  425. deliver_list_head = NULL;
  426. deliver_list_tail = NULL;
  427. }
  428. /* Get TID from struct cb->tid_val, save to tid */
  429. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  430. tid = qdf_nbuf_get_tid_val(nbuf);
  431. if (qdf_unlikely(!peer)) {
  432. peer = dp_peer_get_ref_by_id(soc, peer_id,
  433. DP_MOD_ID_RX);
  434. } else if (peer && peer->peer_id != peer_id) {
  435. dp_peer_unref_delete(peer, DP_MOD_ID_RX);
  436. peer = dp_peer_get_ref_by_id(soc, peer_id,
  437. DP_MOD_ID_RX);
  438. }
  439. if (peer) {
  440. QDF_NBUF_CB_DP_TRACE_PRINT(nbuf) = false;
  441. qdf_dp_trace_set_track(nbuf, QDF_RX);
  442. QDF_NBUF_CB_RX_DP_TRACE(nbuf) = 1;
  443. QDF_NBUF_CB_RX_PACKET_TRACK(nbuf) =
  444. QDF_NBUF_RX_PKT_DATA_TRACK;
  445. }
  446. rx_bufs_used++;
  447. if (qdf_likely(peer)) {
  448. vdev = peer->vdev;
  449. } else {
  450. nbuf->next = NULL;
  451. dp_rx_deliver_to_pkt_capture_no_peer(
  452. soc, nbuf, pkt_capture_offload);
  453. if (!pkt_capture_offload)
  454. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  455. nbuf = next;
  456. continue;
  457. }
  458. if (qdf_unlikely(!vdev)) {
  459. qdf_nbuf_free(nbuf);
  460. nbuf = next;
  461. DP_STATS_INC(soc, rx.err.invalid_vdev, 1);
  462. continue;
  463. }
  464. /* when hlos tid override is enabled, save tid in
  465. * skb->priority
  466. */
  467. if (qdf_unlikely(vdev->skip_sw_tid_classification &
  468. DP_TXRX_HLOS_TID_OVERRIDE_ENABLED))
  469. qdf_nbuf_set_priority(nbuf, tid);
  470. rx_pdev = vdev->pdev;
  471. DP_RX_TID_SAVE(nbuf, tid);
  472. if (qdf_unlikely(rx_pdev->delay_stats_flag) ||
  473. qdf_unlikely(wlan_cfg_is_peer_ext_stats_enabled(
  474. soc->wlan_cfg_ctx)))
  475. qdf_nbuf_set_timestamp(nbuf);
  476. tid_stats =
  477. &rx_pdev->stats.tid_stats.tid_rx_stats[reo_ring_num][tid];
  478. /*
  479. * Check if DMA completed -- msdu_done is the last bit
  480. * to be written
  481. */
  482. if (qdf_unlikely(!qdf_nbuf_is_rx_chfrag_cont(nbuf) &&
  483. !hal_rx_attn_msdu_done_get(hal_soc,
  484. rx_tlv_hdr))) {
  485. dp_err("MSDU DONE failure");
  486. DP_STATS_INC(soc, rx.err.msdu_done_fail, 1);
  487. hal_rx_dump_pkt_tlvs(hal_soc, rx_tlv_hdr,
  488. QDF_TRACE_LEVEL_INFO);
  489. tid_stats->fail_cnt[MSDU_DONE_FAILURE]++;
  490. qdf_nbuf_free(nbuf);
  491. qdf_assert(0);
  492. nbuf = next;
  493. continue;
  494. }
  495. DP_HIST_PACKET_COUNT_INC(vdev->pdev->pdev_id);
  496. /*
  497. * First IF condition:
  498. * 802.11 Fragmented pkts are reinjected to REO
  499. * HW block as SG pkts and for these pkts we only
  500. * need to pull the RX TLVS header length.
  501. * Second IF condition:
  502. * The below condition happens when an MSDU is spread
  503. * across multiple buffers. This can happen in two cases
  504. * 1. The nbuf size is smaller then the received msdu.
  505. * ex: we have set the nbuf size to 2048 during
  506. * nbuf_alloc. but we received an msdu which is
  507. * 2304 bytes in size then this msdu is spread
  508. * across 2 nbufs.
  509. *
  510. * 2. AMSDUs when RAW mode is enabled.
  511. * ex: 1st MSDU is in 1st nbuf and 2nd MSDU is spread
  512. * across 1st nbuf and 2nd nbuf and last MSDU is
  513. * spread across 2nd nbuf and 3rd nbuf.
  514. *
  515. * for these scenarios let us create a skb frag_list and
  516. * append these buffers till the last MSDU of the AMSDU
  517. * Third condition:
  518. * This is the most likely case, we receive 802.3 pkts
  519. * decapsulated by HW, here we need to set the pkt length.
  520. */
  521. hal_rx_msdu_metadata_get(hal_soc, rx_tlv_hdr, &msdu_metadata);
  522. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  523. bool is_mcbc, is_sa_vld, is_da_vld;
  524. is_mcbc = hal_rx_msdu_end_da_is_mcbc_get(soc->hal_soc,
  525. rx_tlv_hdr);
  526. is_sa_vld =
  527. hal_rx_msdu_end_sa_is_valid_get(soc->hal_soc,
  528. rx_tlv_hdr);
  529. is_da_vld =
  530. hal_rx_msdu_end_da_is_valid_get(soc->hal_soc,
  531. rx_tlv_hdr);
  532. qdf_nbuf_set_da_mcbc(nbuf, is_mcbc);
  533. qdf_nbuf_set_da_valid(nbuf, is_da_vld);
  534. qdf_nbuf_set_sa_valid(nbuf, is_sa_vld);
  535. qdf_nbuf_pull_head(nbuf, soc->rx_pkt_tlv_size);
  536. } else if (qdf_nbuf_is_rx_chfrag_cont(nbuf)) {
  537. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  538. nbuf = dp_rx_sg_create(soc, nbuf);
  539. next = nbuf->next;
  540. if (qdf_nbuf_is_raw_frame(nbuf)) {
  541. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  542. DP_STATS_INC_PKT(peer, rx.raw, 1, msdu_len);
  543. } else {
  544. qdf_nbuf_free(nbuf);
  545. DP_STATS_INC(soc, rx.err.scatter_msdu, 1);
  546. dp_info_rl("scatter msdu len %d, dropped",
  547. msdu_len);
  548. nbuf = next;
  549. continue;
  550. }
  551. } else {
  552. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  553. pkt_len = msdu_len +
  554. msdu_metadata.l3_hdr_pad +
  555. soc->rx_pkt_tlv_size;
  556. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  557. dp_rx_skip_tlvs(soc, nbuf, msdu_metadata.l3_hdr_pad);
  558. }
  559. /*
  560. * process frame for mulitpass phrase processing
  561. */
  562. if (qdf_unlikely(vdev->multipass_en)) {
  563. if (dp_rx_multipass_process(peer, nbuf, tid) == false) {
  564. DP_STATS_INC(peer, rx.multipass_rx_pkt_drop, 1);
  565. qdf_nbuf_free(nbuf);
  566. nbuf = next;
  567. continue;
  568. }
  569. }
  570. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, peer)) {
  571. dp_rx_err("%pK: Policy Check Drop pkt", soc);
  572. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  573. /* Drop & free packet */
  574. qdf_nbuf_free(nbuf);
  575. /* Statistics */
  576. nbuf = next;
  577. continue;
  578. }
  579. if (qdf_unlikely(peer && (peer->nawds_enabled) &&
  580. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  581. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  582. rx_tlv_hdr) ==
  583. false))) {
  584. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  585. DP_STATS_INC(peer, rx.nawds_mcast_drop, 1);
  586. qdf_nbuf_free(nbuf);
  587. nbuf = next;
  588. continue;
  589. }
  590. /*
  591. * Drop non-EAPOL frames from unauthorized peer.
  592. */
  593. if (qdf_likely(peer) && qdf_unlikely(!peer->authorize) &&
  594. !qdf_nbuf_is_raw_frame(nbuf)) {
  595. bool is_eapol = qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  596. qdf_nbuf_is_ipv4_wapi_pkt(nbuf);
  597. if (!is_eapol) {
  598. DP_STATS_INC(soc,
  599. rx.err.peer_unauth_rx_pkt_drop,
  600. 1);
  601. qdf_nbuf_free(nbuf);
  602. nbuf = next;
  603. continue;
  604. }
  605. }
  606. if (soc->process_rx_status)
  607. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  608. /* Update the protocol tag in SKB based on CCE metadata */
  609. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  610. reo_ring_num, false, true);
  611. /* Update the flow tag in SKB based on FSE metadata */
  612. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  613. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, peer,
  614. reo_ring_num, tid_stats);
  615. if (qdf_unlikely(vdev->mesh_vdev)) {
  616. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  617. == QDF_STATUS_SUCCESS) {
  618. dp_rx_info("%pK: mesh pkt filtered", soc);
  619. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  620. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  621. 1);
  622. qdf_nbuf_free(nbuf);
  623. nbuf = next;
  624. continue;
  625. }
  626. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr, peer);
  627. }
  628. if (qdf_likely(vdev->rx_decap_type ==
  629. htt_cmn_pkt_type_ethernet) &&
  630. qdf_likely(!vdev->mesh_vdev)) {
  631. dp_rx_wds_learn(soc, vdev,
  632. rx_tlv_hdr,
  633. peer,
  634. nbuf,
  635. msdu_metadata);
  636. /* Intrabss-fwd */
  637. if (dp_rx_check_ap_bridge(vdev))
  638. if (dp_rx_intrabss_fwd_be(soc, peer, rx_tlv_hdr,
  639. nbuf,
  640. msdu_metadata)) {
  641. nbuf = next;
  642. tid_stats->intrabss_cnt++;
  643. continue; /* Get next desc */
  644. }
  645. }
  646. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  647. dp_rx_update_stats(soc, nbuf);
  648. DP_RX_LIST_APPEND(deliver_list_head,
  649. deliver_list_tail,
  650. nbuf);
  651. DP_STATS_INC_PKT(peer, rx.to_stack, 1,
  652. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  653. if (qdf_unlikely(peer->in_twt))
  654. DP_STATS_INC_PKT(peer, rx.to_stack_twt, 1,
  655. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  656. tid_stats->delivered_to_stack++;
  657. nbuf = next;
  658. }
  659. if (qdf_likely(deliver_list_head)) {
  660. if (qdf_likely(peer)) {
  661. dp_rx_deliver_to_pkt_capture(soc, vdev->pdev, peer_id,
  662. pkt_capture_offload,
  663. deliver_list_head);
  664. if (!pkt_capture_offload)
  665. dp_rx_deliver_to_stack(soc, vdev, peer,
  666. deliver_list_head,
  667. deliver_list_tail);
  668. } else {
  669. nbuf = deliver_list_head;
  670. while (nbuf) {
  671. next = nbuf->next;
  672. nbuf->next = NULL;
  673. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  674. nbuf = next;
  675. }
  676. }
  677. }
  678. if (qdf_likely(peer))
  679. dp_peer_unref_delete(peer, DP_MOD_ID_RX);
  680. /*
  681. * If we are processing in near-full condition, there are 3 scenario
  682. * 1) Ring entries has reached critical state
  683. * 2) Ring entries are still near high threshold
  684. * 3) Ring entries are below the safe level
  685. *
  686. * One more loop will move the state to normal processing and yield
  687. */
  688. if (ring_near_full)
  689. goto more_data;
  690. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  691. if (quota) {
  692. num_pending =
  693. dp_rx_srng_get_num_pending(hal_soc,
  694. hal_ring_hdl,
  695. num_entries,
  696. &near_full);
  697. if (num_pending) {
  698. DP_STATS_INC(soc, rx.hp_oos2, 1);
  699. if (!hif_exec_should_yield(scn, intr_id))
  700. goto more_data;
  701. if (qdf_unlikely(near_full)) {
  702. DP_STATS_INC(soc, rx.near_full, 1);
  703. goto more_data;
  704. }
  705. }
  706. }
  707. if (vdev && vdev->osif_fisa_flush)
  708. vdev->osif_fisa_flush(soc, reo_ring_num);
  709. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  710. vdev->osif_gro_flush(vdev->osif_vdev,
  711. reo_ring_num);
  712. }
  713. }
  714. /* Update histogram statistics by looping through pdev's */
  715. DP_RX_HIST_STATS_PER_PDEV();
  716. return rx_bufs_used; /* Assume no scale factor for now */
  717. }
  718. #ifdef RX_DESC_MULTI_PAGE_ALLOC
  719. /**
  720. * dp_rx_desc_pool_init_be_cc() - initial RX desc pool for cookie conversion
  721. * @soc: Handle to DP Soc structure
  722. * @rx_desc_pool: Rx descriptor pool handler
  723. * @pool_id: Rx descriptor pool ID
  724. *
  725. * Return: QDF_STATUS_SUCCESS - succeeded, others - failed
  726. */
  727. static QDF_STATUS
  728. dp_rx_desc_pool_init_be_cc(struct dp_soc *soc,
  729. struct rx_desc_pool *rx_desc_pool,
  730. uint32_t pool_id)
  731. {
  732. struct dp_soc_be *be_soc;
  733. union dp_rx_desc_list_elem_t *rx_desc_elem;
  734. struct dp_spt_page_desc *page_desc;
  735. struct dp_spt_page_desc_list *page_desc_list;
  736. be_soc = dp_get_be_soc_from_dp_soc(soc);
  737. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  738. /* allocate SPT pages from page desc pool */
  739. page_desc_list->num_spt_pages =
  740. dp_cc_spt_page_desc_alloc(be_soc,
  741. &page_desc_list->spt_page_list_head,
  742. &page_desc_list->spt_page_list_tail,
  743. rx_desc_pool->pool_size);
  744. if (!page_desc_list->num_spt_pages) {
  745. dp_err("fail to allocate cookie conversion spt pages");
  746. return QDF_STATUS_E_FAILURE;
  747. }
  748. /* put each RX Desc VA to SPT pages and get corresponding ID */
  749. page_desc = page_desc_list->spt_page_list_head;
  750. rx_desc_elem = rx_desc_pool->freelist;
  751. while (rx_desc_elem) {
  752. DP_CC_SPT_PAGE_UPDATE_VA(page_desc->page_v_addr,
  753. page_desc->avail_entry_index,
  754. &rx_desc_elem->rx_desc);
  755. rx_desc_elem->rx_desc.cookie =
  756. dp_cc_desc_id_generate(page_desc->ppt_index,
  757. page_desc->avail_entry_index);
  758. rx_desc_elem->rx_desc.pool_id = pool_id;
  759. rx_desc_elem->rx_desc.in_use = 0;
  760. rx_desc_elem = rx_desc_elem->next;
  761. page_desc->avail_entry_index++;
  762. if (page_desc->avail_entry_index >=
  763. DP_CC_SPT_PAGE_MAX_ENTRIES)
  764. page_desc = page_desc->next;
  765. }
  766. return QDF_STATUS_SUCCESS;
  767. }
  768. #else
  769. static QDF_STATUS
  770. dp_rx_desc_pool_init_be_cc(struct dp_soc *soc,
  771. struct rx_desc_pool *rx_desc_pool,
  772. uint32_t pool_id)
  773. {
  774. struct dp_soc_be *be_soc;
  775. struct dp_spt_page_desc *page_desc;
  776. struct dp_spt_page_desc_list *page_desc_list;
  777. int i;
  778. be_soc = dp_get_be_soc_from_dp_soc(soc);
  779. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  780. /* allocate SPT pages from page desc pool */
  781. page_desc_list->num_spt_pages =
  782. dp_cc_spt_page_desc_alloc(
  783. be_soc,
  784. &page_desc_list->spt_page_list_head,
  785. &page_desc_list->spt_page_list_tail,
  786. rx_desc_pool->pool_size);
  787. if (!page_desc_list->num_spt_pages) {
  788. dp_err("fail to allocate cookie conversion spt pages");
  789. return QDF_STATUS_E_FAILURE;
  790. }
  791. /* put each RX Desc VA to SPT pages and get corresponding ID */
  792. page_desc = page_desc_list->spt_page_list_head;
  793. for (i = 0; i <= rx_desc_pool->pool_size - 1; i++) {
  794. if (i == rx_desc_pool->pool_size - 1)
  795. rx_desc_pool->array[i].next = NULL;
  796. else
  797. rx_desc_pool->array[i].next =
  798. &rx_desc_pool->array[i + 1];
  799. DP_CC_SPT_PAGE_UPDATE_VA(page_desc->page_v_addr,
  800. page_desc->avail_entry_index,
  801. &rx_desc_pool->array[i].rx_desc);
  802. rx_desc_pool->array[i].rx_desc.cookie =
  803. dp_cc_desc_id_generate(page_desc->ppt_index,
  804. page_desc->avail_entry_index);
  805. rx_desc_pool->array[i].rx_desc.pool_id = pool_id;
  806. rx_desc_pool->array[i].rx_desc.in_use = 0;
  807. page_desc->avail_entry_index++;
  808. if (page_desc->avail_entry_index >=
  809. DP_CC_SPT_PAGE_MAX_ENTRIES)
  810. page_desc = page_desc->next;
  811. }
  812. return QDF_STATUS_SUCCESS;
  813. }
  814. #endif
  815. static void
  816. dp_rx_desc_pool_deinit_be_cc(struct dp_soc *soc,
  817. struct rx_desc_pool *rx_desc_pool,
  818. uint32_t pool_id)
  819. {
  820. struct dp_soc_be *be_soc;
  821. struct dp_spt_page_desc *page_desc;
  822. struct dp_spt_page_desc_list *page_desc_list;
  823. be_soc = dp_get_be_soc_from_dp_soc(soc);
  824. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  825. if (!page_desc_list->num_spt_pages) {
  826. dp_warn("page_desc_list is empty for pool_id %d", pool_id);
  827. return;
  828. }
  829. /* cleanup for each page */
  830. page_desc = page_desc_list->spt_page_list_head;
  831. while (page_desc) {
  832. page_desc->avail_entry_index = 0;
  833. qdf_mem_zero(page_desc->page_v_addr, qdf_page_size);
  834. page_desc = page_desc->next;
  835. }
  836. /* free pages desc back to pool */
  837. dp_cc_spt_page_desc_free(be_soc,
  838. &page_desc_list->spt_page_list_head,
  839. &page_desc_list->spt_page_list_tail,
  840. page_desc_list->num_spt_pages);
  841. page_desc_list->num_spt_pages = 0;
  842. }
  843. QDF_STATUS dp_rx_desc_pool_init_be(struct dp_soc *soc,
  844. struct rx_desc_pool *rx_desc_pool,
  845. uint32_t pool_id)
  846. {
  847. QDF_STATUS status = QDF_STATUS_SUCCESS;
  848. /* Only regular RX buffer desc pool use HW cookie conversion */
  849. if (rx_desc_pool->desc_type == DP_RX_DESC_BUF_TYPE) {
  850. dp_info("rx_desc_buf pool init");
  851. status = dp_rx_desc_pool_init_be_cc(soc,
  852. rx_desc_pool,
  853. pool_id);
  854. } else {
  855. dp_info("non_rx_desc_buf_pool init");
  856. status = dp_rx_desc_pool_init_generic(soc, rx_desc_pool, pool_id);
  857. }
  858. return status;
  859. }
  860. void dp_rx_desc_pool_deinit_be(struct dp_soc *soc,
  861. struct rx_desc_pool *rx_desc_pool,
  862. uint32_t pool_id)
  863. {
  864. if (rx_desc_pool->desc_type == DP_RX_DESC_BUF_TYPE)
  865. dp_rx_desc_pool_deinit_be_cc(soc, rx_desc_pool, pool_id);
  866. }
  867. #ifdef DP_FEATURE_HW_COOKIE_CONVERSION
  868. #ifdef DP_HW_COOKIE_CONVERT_EXCEPTION
  869. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  870. void *ring_desc,
  871. struct dp_rx_desc **r_rx_desc)
  872. {
  873. if (hal_rx_wbm_get_cookie_convert_done(ring_desc)) {
  874. /* HW cookie conversion done */
  875. *r_rx_desc = (struct dp_rx_desc *)
  876. hal_rx_wbm_get_desc_va(ring_desc);
  877. } else {
  878. /* SW do cookie conversion */
  879. uint32_t cookie = HAL_RX_BUF_COOKIE_GET(ring_desc);
  880. *r_rx_desc = (struct dp_rx_desc *)
  881. dp_cc_desc_find(soc, cookie);
  882. }
  883. return QDF_STATUS_SUCCESS;
  884. }
  885. #else
  886. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  887. void *ring_desc,
  888. struct dp_rx_desc **r_rx_desc)
  889. {
  890. *r_rx_desc = (struct dp_rx_desc *)
  891. hal_rx_wbm_get_desc_va(ring_desc);
  892. return QDF_STATUS_SUCCESS;
  893. }
  894. #endif /* DP_HW_COOKIE_CONVERT_EXCEPTION */
  895. #else
  896. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  897. void *ring_desc,
  898. struct dp_rx_desc **r_rx_desc)
  899. {
  900. /* SW do cookie conversion */
  901. uint32_t cookie = HAL_RX_BUF_COOKIE_GET(ring_desc);
  902. *r_rx_desc = (struct dp_rx_desc *)
  903. dp_cc_desc_find(soc, cookie);
  904. return QDF_STATUS_SUCCESS;
  905. }
  906. #endif /* DP_FEATURE_HW_COOKIE_CONVERSION */
  907. struct dp_rx_desc *dp_rx_desc_cookie_2_va_be(struct dp_soc *soc,
  908. uint32_t cookie)
  909. {
  910. return (struct dp_rx_desc *)dp_cc_desc_find(soc, cookie);
  911. }
  912. #ifdef WLAN_FEATURE_NEAR_FULL_IRQ
  913. uint32_t dp_rx_nf_process(struct dp_intr *int_ctx,
  914. hal_ring_handle_t hal_ring_hdl,
  915. uint8_t reo_ring_num,
  916. uint32_t quota)
  917. {
  918. struct dp_soc *soc = int_ctx->soc;
  919. struct dp_srng *rx_ring = &soc->reo_dest_ring[reo_ring_num];
  920. uint32_t work_done = 0;
  921. if (dp_srng_get_near_full_level(soc, rx_ring) <
  922. DP_SRNG_THRESH_NEAR_FULL)
  923. return 0;
  924. qdf_atomic_set(&rx_ring->near_full, 1);
  925. work_done++;
  926. return work_done;
  927. }
  928. #endif
  929. #ifndef QCA_HOST_MODE_WIFI_DISABLED
  930. #if defined(QCA_WIFI_WCN7850) || !defined(INTRA_BSS_FW_OFFLOAD)
  931. bool dp_rx_intrabss_fwd_be(struct dp_soc *soc, struct dp_peer *ta_peer,
  932. uint8_t *rx_tlv_hdr, qdf_nbuf_t nbuf,
  933. struct hal_rx_msdu_metadata msdu_metadata)
  934. {
  935. /* Hamilton V1 uses Lithium path */
  936. return dp_rx_intrabss_fwd(soc, ta_peer, rx_tlv_hdr, nbuf,
  937. msdu_metadata);
  938. }
  939. #else
  940. /*
  941. * dp_rx_intrabss_fwd_be() - API for intrabss fwd. For EAPOL
  942. * pkt with DA not equal to vdev mac addr, fwd is not allowed.
  943. * @soc: core txrx main context
  944. * @ta_peer: source peer entry
  945. * @rx_tlv_hdr: start address of rx tlvs
  946. * @nbuf: nbuf that has to be intrabss forwarded
  947. * @msdu_metadata: msdu metadata
  948. *
  949. * Return: true if it is forwarded else false
  950. */
  951. bool dp_rx_intrabss_fwd_be(struct dp_soc *soc, struct dp_peer *ta_peer,
  952. uint8_t *rx_tlv_hdr, qdf_nbuf_t nbuf,
  953. struct hal_rx_msdu_metadata msdu_metadata)
  954. {
  955. uint16_t len;
  956. qdf_nbuf_t nbuf_copy;
  957. uint8_t tid = qdf_nbuf_get_tid_val(nbuf);
  958. uint8_t ring_id = QDF_NBUF_CB_RX_CTX_ID(nbuf);
  959. struct cdp_tid_rx_stats *tid_stats = &ta_peer->vdev->pdev->stats.
  960. tid_stats.tid_rx_stats[ring_id][tid];
  961. /* if it is a broadcast pkt (eg: ARP) and it is not its own
  962. * source, then clone the pkt and send the cloned pkt for
  963. * intra BSS forwarding and original pkt up the network stack
  964. * Note: how do we handle multicast pkts. do we forward
  965. * all multicast pkts as is or let a higher layer module
  966. * like igmpsnoop decide whether to forward or not with
  967. * Mcast enhancement.
  968. */
  969. if (qdf_nbuf_is_da_mcbc(nbuf) && !ta_peer->bss_peer) {
  970. if (dp_rx_intrabss_eapol_drop_check(soc, ta_peer, rx_tlv_hdr,
  971. nbuf))
  972. return true;
  973. if (!dp_rx_check_ndi_mdns_fwding(ta_peer, nbuf))
  974. return false;
  975. /* If the source peer in the isolation list
  976. * then dont forward instead push to bridge stack
  977. */
  978. if (dp_get_peer_isolation(ta_peer))
  979. return false;
  980. nbuf_copy = qdf_nbuf_copy(nbuf);
  981. if (!nbuf_copy)
  982. return false;
  983. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  984. if (dp_tx_send((struct cdp_soc_t *)soc,
  985. ta_peer->vdev->vdev_id, nbuf_copy)) {
  986. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1, len);
  987. tid_stats->fail_cnt[INTRABSS_DROP]++;
  988. qdf_nbuf_free(nbuf_copy);
  989. } else {
  990. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1, len);
  991. tid_stats->intrabss_cnt++;
  992. }
  993. return false;
  994. }
  995. if (qdf_nbuf_is_intra_bss(nbuf)) {
  996. if (dp_rx_intrabss_eapol_drop_check(soc, ta_peer, rx_tlv_hdr,
  997. nbuf))
  998. return true;
  999. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  1000. /* linearize the nbuf just before we send to
  1001. * dp_tx_send()
  1002. */
  1003. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  1004. if (qdf_nbuf_linearize(nbuf) == -ENOMEM)
  1005. return false;
  1006. nbuf = qdf_nbuf_unshare(nbuf);
  1007. if (!nbuf) {
  1008. DP_STATS_INC_PKT(ta_peer,
  1009. rx.intra_bss.fail, 1, len);
  1010. /* return true even though the pkt is
  1011. * not forwarded. Basically skb_unshare
  1012. * failed and we want to continue with
  1013. * next nbuf.
  1014. */
  1015. tid_stats->fail_cnt[INTRABSS_DROP]++;
  1016. return true;
  1017. }
  1018. }
  1019. if (!dp_tx_send((struct cdp_soc_t *)soc,
  1020. ta_peer->vdev->vdev_id, nbuf)) {
  1021. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1,
  1022. len);
  1023. } else {
  1024. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1,
  1025. len);
  1026. tid_stats->fail_cnt[INTRABSS_DROP]++;
  1027. return false;
  1028. }
  1029. return true;
  1030. }
  1031. return false;
  1032. }
  1033. #endif
  1034. #endif