dp_be_rx.c 33 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175
  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_PEER_METADATA_PEER_ID_GET(peer_mdata);
  311. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  312. DP_PEER_METADATA_VDEV_ID_GET(peer_mdata);
  313. /* to indicate whether this msdu is rx offload */
  314. pkt_capture_offload =
  315. DP_PEER_METADATA_OFFLOAD_GET(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. qdf_nbuf_set_tid_val(rx_desc->nbuf,
  339. HAL_RX_REO_QUEUE_NUMBER_GET(ring_desc));
  340. #ifdef CONFIG_LITHIUM
  341. qdf_nbuf_set_rx_reo_dest_ind(
  342. rx_desc->nbuf,
  343. HAL_RX_REO_MSDU_REO_DST_IND_GET(ring_desc));
  344. #endif
  345. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  346. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  347. /*
  348. * move unmap after scattered msdu waiting break logic
  349. * in case double skb unmap happened.
  350. */
  351. rx_desc_pool = &soc->rx_desc_buf[rx_desc->pool_id];
  352. dp_ipa_reo_ctx_buf_mapping_lock(soc, reo_ring_num);
  353. dp_ipa_handle_rx_buf_smmu_mapping(soc, rx_desc->nbuf,
  354. rx_desc_pool->buf_size,
  355. false);
  356. qdf_nbuf_unmap_nbytes_single(soc->osdev, rx_desc->nbuf,
  357. QDF_DMA_FROM_DEVICE,
  358. rx_desc_pool->buf_size);
  359. rx_desc->unmapped = 1;
  360. dp_ipa_reo_ctx_buf_mapping_unlock(soc, reo_ring_num);
  361. DP_RX_PROCESS_NBUF(soc, nbuf_head, nbuf_tail, ebuf_head,
  362. ebuf_tail, rx_desc);
  363. /*
  364. * if continuation bit is set then we have MSDU spread
  365. * across multiple buffers, let us not decrement quota
  366. * till we reap all buffers of that MSDU.
  367. */
  368. if (qdf_likely(!qdf_nbuf_is_rx_chfrag_cont(rx_desc->nbuf)))
  369. quota -= 1;
  370. dp_rx_add_to_free_desc_list(&head[rx_desc->pool_id],
  371. &tail[rx_desc->pool_id], rx_desc);
  372. num_rx_bufs_reaped++;
  373. /*
  374. * only if complete msdu is received for scatter case,
  375. * then allow break.
  376. */
  377. if (is_prev_msdu_last &&
  378. dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped,
  379. max_reap_limit))
  380. break;
  381. }
  382. done:
  383. dp_rx_srng_access_end(int_ctx, soc, hal_ring_hdl);
  384. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  385. /*
  386. * continue with next mac_id if no pkts were reaped
  387. * from that pool
  388. */
  389. if (!rx_bufs_reaped[mac_id])
  390. continue;
  391. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  392. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  393. dp_rx_buffers_replenish(soc, mac_id, dp_rxdma_srng,
  394. rx_desc_pool, rx_bufs_reaped[mac_id],
  395. &head[mac_id], &tail[mac_id]);
  396. }
  397. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  398. /* Peer can be NULL is case of LFR */
  399. if (qdf_likely(peer))
  400. vdev = NULL;
  401. /*
  402. * BIG loop where each nbuf is dequeued from global queue,
  403. * processed and queued back on a per vdev basis. These nbufs
  404. * are sent to stack as and when we run out of nbufs
  405. * or a new nbuf dequeued from global queue has a different
  406. * vdev when compared to previous nbuf.
  407. */
  408. nbuf = nbuf_head;
  409. while (nbuf) {
  410. next = nbuf->next;
  411. if (qdf_unlikely(dp_rx_is_raw_frame_dropped(nbuf))) {
  412. nbuf = next;
  413. DP_STATS_INC(soc, rx.err.raw_frm_drop, 1);
  414. continue;
  415. }
  416. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  417. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  418. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  419. if (dp_rx_is_list_ready(deliver_list_head, vdev, peer,
  420. peer_id, vdev_id)) {
  421. dp_rx_deliver_to_stack(soc, vdev, peer,
  422. deliver_list_head,
  423. deliver_list_tail);
  424. deliver_list_head = NULL;
  425. deliver_list_tail = NULL;
  426. }
  427. /* Get TID from struct cb->tid_val, save to tid */
  428. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  429. tid = qdf_nbuf_get_tid_val(nbuf);
  430. if (qdf_unlikely(!peer)) {
  431. peer = dp_peer_get_ref_by_id(soc, peer_id,
  432. DP_MOD_ID_RX);
  433. } else if (peer && peer->peer_id != peer_id) {
  434. dp_peer_unref_delete(peer, DP_MOD_ID_RX);
  435. peer = dp_peer_get_ref_by_id(soc, peer_id,
  436. DP_MOD_ID_RX);
  437. }
  438. if (peer) {
  439. QDF_NBUF_CB_DP_TRACE_PRINT(nbuf) = false;
  440. qdf_dp_trace_set_track(nbuf, QDF_RX);
  441. QDF_NBUF_CB_RX_DP_TRACE(nbuf) = 1;
  442. QDF_NBUF_CB_RX_PACKET_TRACK(nbuf) =
  443. QDF_NBUF_RX_PKT_DATA_TRACK;
  444. }
  445. rx_bufs_used++;
  446. if (qdf_likely(peer)) {
  447. vdev = peer->vdev;
  448. } else {
  449. nbuf->next = NULL;
  450. dp_rx_deliver_to_pkt_capture_no_peer(
  451. soc, nbuf, pkt_capture_offload);
  452. if (!pkt_capture_offload)
  453. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  454. nbuf = next;
  455. continue;
  456. }
  457. if (qdf_unlikely(!vdev)) {
  458. qdf_nbuf_free(nbuf);
  459. nbuf = next;
  460. DP_STATS_INC(soc, rx.err.invalid_vdev, 1);
  461. continue;
  462. }
  463. /* when hlos tid override is enabled, save tid in
  464. * skb->priority
  465. */
  466. if (qdf_unlikely(vdev->skip_sw_tid_classification &
  467. DP_TXRX_HLOS_TID_OVERRIDE_ENABLED))
  468. qdf_nbuf_set_priority(nbuf, tid);
  469. rx_pdev = vdev->pdev;
  470. DP_RX_TID_SAVE(nbuf, tid);
  471. if (qdf_unlikely(rx_pdev->delay_stats_flag) ||
  472. qdf_unlikely(wlan_cfg_is_peer_ext_stats_enabled(
  473. soc->wlan_cfg_ctx)))
  474. qdf_nbuf_set_timestamp(nbuf);
  475. tid_stats =
  476. &rx_pdev->stats.tid_stats.tid_rx_stats[reo_ring_num][tid];
  477. /*
  478. * Check if DMA completed -- msdu_done is the last bit
  479. * to be written
  480. */
  481. if (qdf_unlikely(!qdf_nbuf_is_rx_chfrag_cont(nbuf) &&
  482. !hal_rx_attn_msdu_done_get(hal_soc,
  483. rx_tlv_hdr))) {
  484. dp_err("MSDU DONE failure");
  485. DP_STATS_INC(soc, rx.err.msdu_done_fail, 1);
  486. hal_rx_dump_pkt_tlvs(hal_soc, rx_tlv_hdr,
  487. QDF_TRACE_LEVEL_INFO);
  488. tid_stats->fail_cnt[MSDU_DONE_FAILURE]++;
  489. qdf_nbuf_free(nbuf);
  490. qdf_assert(0);
  491. nbuf = next;
  492. continue;
  493. }
  494. DP_HIST_PACKET_COUNT_INC(vdev->pdev->pdev_id);
  495. /*
  496. * First IF condition:
  497. * 802.11 Fragmented pkts are reinjected to REO
  498. * HW block as SG pkts and for these pkts we only
  499. * need to pull the RX TLVS header length.
  500. * Second IF condition:
  501. * The below condition happens when an MSDU is spread
  502. * across multiple buffers. This can happen in two cases
  503. * 1. The nbuf size is smaller then the received msdu.
  504. * ex: we have set the nbuf size to 2048 during
  505. * nbuf_alloc. but we received an msdu which is
  506. * 2304 bytes in size then this msdu is spread
  507. * across 2 nbufs.
  508. *
  509. * 2. AMSDUs when RAW mode is enabled.
  510. * ex: 1st MSDU is in 1st nbuf and 2nd MSDU is spread
  511. * across 1st nbuf and 2nd nbuf and last MSDU is
  512. * spread across 2nd nbuf and 3rd nbuf.
  513. *
  514. * for these scenarios let us create a skb frag_list and
  515. * append these buffers till the last MSDU of the AMSDU
  516. * Third condition:
  517. * This is the most likely case, we receive 802.3 pkts
  518. * decapsulated by HW, here we need to set the pkt length.
  519. */
  520. hal_rx_msdu_metadata_get(hal_soc, rx_tlv_hdr, &msdu_metadata);
  521. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  522. bool is_mcbc, is_sa_vld, is_da_vld;
  523. is_mcbc = hal_rx_msdu_end_da_is_mcbc_get(soc->hal_soc,
  524. rx_tlv_hdr);
  525. is_sa_vld =
  526. hal_rx_msdu_end_sa_is_valid_get(soc->hal_soc,
  527. rx_tlv_hdr);
  528. is_da_vld =
  529. hal_rx_msdu_end_da_is_valid_get(soc->hal_soc,
  530. rx_tlv_hdr);
  531. qdf_nbuf_set_da_mcbc(nbuf, is_mcbc);
  532. qdf_nbuf_set_da_valid(nbuf, is_da_vld);
  533. qdf_nbuf_set_sa_valid(nbuf, is_sa_vld);
  534. qdf_nbuf_pull_head(nbuf, soc->rx_pkt_tlv_size);
  535. } else if (qdf_nbuf_is_rx_chfrag_cont(nbuf)) {
  536. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  537. nbuf = dp_rx_sg_create(soc, nbuf);
  538. next = nbuf->next;
  539. if (qdf_nbuf_is_raw_frame(nbuf)) {
  540. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  541. DP_STATS_INC_PKT(peer, rx.raw, 1, msdu_len);
  542. } else {
  543. qdf_nbuf_free(nbuf);
  544. DP_STATS_INC(soc, rx.err.scatter_msdu, 1);
  545. dp_info_rl("scatter msdu len %d, dropped",
  546. msdu_len);
  547. nbuf = next;
  548. continue;
  549. }
  550. } else {
  551. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  552. pkt_len = msdu_len +
  553. msdu_metadata.l3_hdr_pad +
  554. soc->rx_pkt_tlv_size;
  555. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  556. dp_rx_skip_tlvs(soc, nbuf, msdu_metadata.l3_hdr_pad);
  557. }
  558. /*
  559. * process frame for mulitpass phrase processing
  560. */
  561. if (qdf_unlikely(vdev->multipass_en)) {
  562. if (dp_rx_multipass_process(peer, nbuf, tid) == false) {
  563. DP_STATS_INC(peer, rx.multipass_rx_pkt_drop, 1);
  564. qdf_nbuf_free(nbuf);
  565. nbuf = next;
  566. continue;
  567. }
  568. }
  569. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, peer)) {
  570. dp_rx_err("%pK: Policy Check Drop pkt", soc);
  571. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  572. /* Drop & free packet */
  573. qdf_nbuf_free(nbuf);
  574. /* Statistics */
  575. nbuf = next;
  576. continue;
  577. }
  578. if (qdf_unlikely(peer && (peer->nawds_enabled) &&
  579. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  580. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  581. rx_tlv_hdr) ==
  582. false))) {
  583. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  584. DP_STATS_INC(peer, rx.nawds_mcast_drop, 1);
  585. qdf_nbuf_free(nbuf);
  586. nbuf = next;
  587. continue;
  588. }
  589. /*
  590. * Drop non-EAPOL frames from unauthorized peer.
  591. */
  592. if (qdf_likely(peer) && qdf_unlikely(!peer->authorize) &&
  593. !qdf_nbuf_is_raw_frame(nbuf)) {
  594. bool is_eapol = qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  595. qdf_nbuf_is_ipv4_wapi_pkt(nbuf);
  596. if (!is_eapol) {
  597. DP_STATS_INC(soc,
  598. rx.err.peer_unauth_rx_pkt_drop,
  599. 1);
  600. qdf_nbuf_free(nbuf);
  601. nbuf = next;
  602. continue;
  603. }
  604. }
  605. if (soc->process_rx_status)
  606. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  607. /* Update the protocol tag in SKB based on CCE metadata */
  608. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  609. reo_ring_num, false, true);
  610. /* Update the flow tag in SKB based on FSE metadata */
  611. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  612. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, peer,
  613. reo_ring_num, tid_stats);
  614. if (qdf_unlikely(vdev->mesh_vdev)) {
  615. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  616. == QDF_STATUS_SUCCESS) {
  617. dp_rx_info("%pK: mesh pkt filtered", soc);
  618. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  619. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  620. 1);
  621. qdf_nbuf_free(nbuf);
  622. nbuf = next;
  623. continue;
  624. }
  625. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr, peer);
  626. }
  627. if (qdf_likely(vdev->rx_decap_type ==
  628. htt_cmn_pkt_type_ethernet) &&
  629. qdf_likely(!vdev->mesh_vdev)) {
  630. dp_rx_wds_learn(soc, vdev,
  631. rx_tlv_hdr,
  632. peer,
  633. nbuf,
  634. msdu_metadata);
  635. /* Intrabss-fwd */
  636. if (dp_rx_check_ap_bridge(vdev))
  637. if (dp_rx_intrabss_fwd_be(soc, peer, rx_tlv_hdr,
  638. nbuf,
  639. msdu_metadata)) {
  640. nbuf = next;
  641. tid_stats->intrabss_cnt++;
  642. continue; /* Get next desc */
  643. }
  644. }
  645. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  646. dp_rx_update_stats(soc, nbuf);
  647. DP_RX_LIST_APPEND(deliver_list_head,
  648. deliver_list_tail,
  649. nbuf);
  650. DP_STATS_INC_PKT(peer, rx.to_stack, 1,
  651. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  652. if (qdf_unlikely(peer->in_twt))
  653. DP_STATS_INC_PKT(peer, rx.to_stack_twt, 1,
  654. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  655. tid_stats->delivered_to_stack++;
  656. nbuf = next;
  657. }
  658. if (qdf_likely(deliver_list_head)) {
  659. if (qdf_likely(peer)) {
  660. dp_rx_deliver_to_pkt_capture(soc, vdev->pdev, peer_id,
  661. pkt_capture_offload,
  662. deliver_list_head);
  663. if (!pkt_capture_offload)
  664. dp_rx_deliver_to_stack(soc, vdev, peer,
  665. deliver_list_head,
  666. deliver_list_tail);
  667. } else {
  668. nbuf = deliver_list_head;
  669. while (nbuf) {
  670. next = nbuf->next;
  671. nbuf->next = NULL;
  672. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  673. nbuf = next;
  674. }
  675. }
  676. }
  677. if (qdf_likely(peer))
  678. dp_peer_unref_delete(peer, DP_MOD_ID_RX);
  679. /*
  680. * If we are processing in near-full condition, there are 3 scenario
  681. * 1) Ring entries has reached critical state
  682. * 2) Ring entries are still near high threshold
  683. * 3) Ring entries are below the safe level
  684. *
  685. * One more loop will move the state to normal processing and yield
  686. */
  687. if (ring_near_full)
  688. goto more_data;
  689. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  690. if (quota) {
  691. num_pending =
  692. dp_rx_srng_get_num_pending(hal_soc,
  693. hal_ring_hdl,
  694. num_entries,
  695. &near_full);
  696. if (num_pending) {
  697. DP_STATS_INC(soc, rx.hp_oos2, 1);
  698. if (!hif_exec_should_yield(scn, intr_id))
  699. goto more_data;
  700. if (qdf_unlikely(near_full)) {
  701. DP_STATS_INC(soc, rx.near_full, 1);
  702. goto more_data;
  703. }
  704. }
  705. }
  706. if (vdev && vdev->osif_fisa_flush)
  707. vdev->osif_fisa_flush(soc, reo_ring_num);
  708. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  709. vdev->osif_gro_flush(vdev->osif_vdev,
  710. reo_ring_num);
  711. }
  712. }
  713. /* Update histogram statistics by looping through pdev's */
  714. DP_RX_HIST_STATS_PER_PDEV();
  715. return rx_bufs_used; /* Assume no scale factor for now */
  716. }
  717. #ifdef RX_DESC_MULTI_PAGE_ALLOC
  718. /**
  719. * dp_rx_desc_pool_init_be_cc() - initial RX desc pool for cookie conversion
  720. * @soc: Handle to DP Soc structure
  721. * @rx_desc_pool: Rx descriptor pool handler
  722. * @pool_id: Rx descriptor pool ID
  723. *
  724. * Return: QDF_STATUS_SUCCESS - succeeded, others - failed
  725. */
  726. static QDF_STATUS
  727. dp_rx_desc_pool_init_be_cc(struct dp_soc *soc,
  728. struct rx_desc_pool *rx_desc_pool,
  729. uint32_t pool_id)
  730. {
  731. struct dp_soc_be *be_soc;
  732. union dp_rx_desc_list_elem_t *rx_desc_elem;
  733. struct dp_spt_page_desc *page_desc;
  734. struct dp_spt_page_desc_list *page_desc_list;
  735. be_soc = dp_get_be_soc_from_dp_soc(soc);
  736. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  737. /* allocate SPT pages from page desc pool */
  738. page_desc_list->num_spt_pages =
  739. dp_cc_spt_page_desc_alloc(be_soc,
  740. &page_desc_list->spt_page_list_head,
  741. &page_desc_list->spt_page_list_tail,
  742. rx_desc_pool->pool_size);
  743. if (!page_desc_list->num_spt_pages) {
  744. dp_err("fail to allocate cookie conversion spt pages");
  745. return QDF_STATUS_E_FAILURE;
  746. }
  747. /* put each RX Desc VA to SPT pages and get corresponding ID */
  748. page_desc = page_desc_list->spt_page_list_head;
  749. rx_desc_elem = rx_desc_pool->freelist;
  750. while (rx_desc_elem) {
  751. DP_CC_SPT_PAGE_UPDATE_VA(page_desc->page_v_addr,
  752. page_desc->avail_entry_index,
  753. &rx_desc_elem->rx_desc);
  754. rx_desc_elem->rx_desc.cookie =
  755. dp_cc_desc_id_generate(page_desc->ppt_index,
  756. page_desc->avail_entry_index);
  757. rx_desc_elem->rx_desc.pool_id = pool_id;
  758. rx_desc_elem->rx_desc.in_use = 0;
  759. rx_desc_elem = rx_desc_elem->next;
  760. page_desc->avail_entry_index++;
  761. if (page_desc->avail_entry_index >=
  762. DP_CC_SPT_PAGE_MAX_ENTRIES)
  763. page_desc = page_desc->next;
  764. }
  765. return QDF_STATUS_SUCCESS;
  766. }
  767. #else
  768. static QDF_STATUS
  769. dp_rx_desc_pool_init_be_cc(struct dp_soc *soc,
  770. struct rx_desc_pool *rx_desc_pool,
  771. uint32_t pool_id)
  772. {
  773. struct dp_soc_be *be_soc;
  774. struct dp_spt_page_desc *page_desc;
  775. struct dp_spt_page_desc_list *page_desc_list;
  776. int i;
  777. be_soc = dp_get_be_soc_from_dp_soc(soc);
  778. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  779. /* allocate SPT pages from page desc pool */
  780. page_desc_list->num_spt_pages =
  781. dp_cc_spt_page_desc_alloc(
  782. be_soc,
  783. &page_desc_list->spt_page_list_head,
  784. &page_desc_list->spt_page_list_tail,
  785. rx_desc_pool->pool_size);
  786. if (!page_desc_list->num_spt_pages) {
  787. dp_err("fail to allocate cookie conversion spt pages");
  788. return QDF_STATUS_E_FAILURE;
  789. }
  790. /* put each RX Desc VA to SPT pages and get corresponding ID */
  791. page_desc = page_desc_list->spt_page_list_head;
  792. for (i = 0; i <= rx_desc_pool->pool_size - 1; i++) {
  793. if (i == rx_desc_pool->pool_size - 1)
  794. rx_desc_pool->array[i].next = NULL;
  795. else
  796. rx_desc_pool->array[i].next =
  797. &rx_desc_pool->array[i + 1];
  798. DP_CC_SPT_PAGE_UPDATE_VA(page_desc->page_v_addr,
  799. page_desc->avail_entry_index,
  800. &rx_desc_pool->array[i].rx_desc);
  801. rx_desc_pool->array[i].rx_desc.cookie =
  802. dp_cc_desc_id_generate(page_desc->ppt_index,
  803. page_desc->avail_entry_index);
  804. rx_desc_pool->array[i].rx_desc.pool_id = pool_id;
  805. rx_desc_pool->array[i].rx_desc.in_use = 0;
  806. page_desc->avail_entry_index++;
  807. if (page_desc->avail_entry_index >=
  808. DP_CC_SPT_PAGE_MAX_ENTRIES)
  809. page_desc = page_desc->next;
  810. }
  811. return QDF_STATUS_SUCCESS;
  812. }
  813. #endif
  814. static void
  815. dp_rx_desc_pool_deinit_be_cc(struct dp_soc *soc,
  816. struct rx_desc_pool *rx_desc_pool,
  817. uint32_t pool_id)
  818. {
  819. struct dp_soc_be *be_soc;
  820. struct dp_spt_page_desc *page_desc;
  821. struct dp_spt_page_desc_list *page_desc_list;
  822. be_soc = dp_get_be_soc_from_dp_soc(soc);
  823. page_desc_list = &be_soc->rx_spt_page_desc[pool_id];
  824. if (!page_desc_list->num_spt_pages) {
  825. dp_warn("page_desc_list is empty for pool_id %d", pool_id);
  826. return;
  827. }
  828. /* cleanup for each page */
  829. page_desc = page_desc_list->spt_page_list_head;
  830. while (page_desc) {
  831. page_desc->avail_entry_index = 0;
  832. qdf_mem_zero(page_desc->page_v_addr, qdf_page_size);
  833. page_desc = page_desc->next;
  834. }
  835. /* free pages desc back to pool */
  836. dp_cc_spt_page_desc_free(be_soc,
  837. &page_desc_list->spt_page_list_head,
  838. &page_desc_list->spt_page_list_tail,
  839. page_desc_list->num_spt_pages);
  840. page_desc_list->num_spt_pages = 0;
  841. }
  842. QDF_STATUS dp_rx_desc_pool_init_be(struct dp_soc *soc,
  843. struct rx_desc_pool *rx_desc_pool,
  844. uint32_t pool_id)
  845. {
  846. QDF_STATUS status = QDF_STATUS_SUCCESS;
  847. /* Only regular RX buffer desc pool use HW cookie conversion */
  848. if (rx_desc_pool->desc_type == DP_RX_DESC_BUF_TYPE) {
  849. dp_info("rx_desc_buf pool init");
  850. status = dp_rx_desc_pool_init_be_cc(soc,
  851. rx_desc_pool,
  852. pool_id);
  853. } else {
  854. dp_info("non_rx_desc_buf_pool init");
  855. status = dp_rx_desc_pool_init_generic(soc, rx_desc_pool, pool_id);
  856. }
  857. return status;
  858. }
  859. void dp_rx_desc_pool_deinit_be(struct dp_soc *soc,
  860. struct rx_desc_pool *rx_desc_pool,
  861. uint32_t pool_id)
  862. {
  863. if (rx_desc_pool->desc_type == DP_RX_DESC_BUF_TYPE)
  864. dp_rx_desc_pool_deinit_be_cc(soc, rx_desc_pool, pool_id);
  865. }
  866. #ifdef DP_FEATURE_HW_COOKIE_CONVERSION
  867. #ifdef DP_HW_COOKIE_CONVERT_EXCEPTION
  868. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  869. void *ring_desc,
  870. struct dp_rx_desc **r_rx_desc)
  871. {
  872. if (hal_rx_wbm_get_cookie_convert_done(ring_desc)) {
  873. /* HW cookie conversion done */
  874. *r_rx_desc = (struct dp_rx_desc *)
  875. hal_rx_wbm_get_desc_va(ring_desc);
  876. } else {
  877. /* SW do cookie conversion */
  878. uint32_t cookie = HAL_RX_BUF_COOKIE_GET(ring_desc);
  879. *r_rx_desc = (struct dp_rx_desc *)
  880. dp_cc_desc_find(soc, cookie);
  881. }
  882. return QDF_STATUS_SUCCESS;
  883. }
  884. #else
  885. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  886. void *ring_desc,
  887. struct dp_rx_desc **r_rx_desc)
  888. {
  889. *r_rx_desc = (struct dp_rx_desc *)
  890. hal_rx_wbm_get_desc_va(ring_desc);
  891. return QDF_STATUS_SUCCESS;
  892. }
  893. #endif /* DP_HW_COOKIE_CONVERT_EXCEPTION */
  894. #else
  895. QDF_STATUS dp_wbm_get_rx_desc_from_hal_desc_be(struct dp_soc *soc,
  896. void *ring_desc,
  897. struct dp_rx_desc **r_rx_desc)
  898. {
  899. /* SW do cookie conversion */
  900. uint32_t cookie = HAL_RX_BUF_COOKIE_GET(ring_desc);
  901. *r_rx_desc = (struct dp_rx_desc *)
  902. dp_cc_desc_find(soc, cookie);
  903. return QDF_STATUS_SUCCESS;
  904. }
  905. #endif /* DP_FEATURE_HW_COOKIE_CONVERSION */
  906. struct dp_rx_desc *dp_rx_desc_cookie_2_va_be(struct dp_soc *soc,
  907. uint32_t cookie)
  908. {
  909. return (struct dp_rx_desc *)dp_cc_desc_find(soc, cookie);
  910. }
  911. #ifdef WLAN_FEATURE_NEAR_FULL_IRQ
  912. uint32_t dp_rx_nf_process(struct dp_intr *int_ctx,
  913. hal_ring_handle_t hal_ring_hdl,
  914. uint8_t reo_ring_num,
  915. uint32_t quota)
  916. {
  917. struct dp_soc *soc = int_ctx->soc;
  918. struct dp_srng *rx_ring = &soc->reo_dest_ring[reo_ring_num];
  919. uint32_t work_done = 0;
  920. if (dp_srng_get_near_full_level(soc, rx_ring) <
  921. DP_SRNG_THRESH_NEAR_FULL)
  922. return 0;
  923. qdf_atomic_set(&rx_ring->near_full, 1);
  924. work_done++;
  925. return work_done;
  926. }
  927. #endif
  928. #ifndef QCA_HOST_MODE_WIFI_DISABLED
  929. #if defined(QCA_WIFI_WCN7850) || !defined(INTRA_BSS_FW_OFFLOAD)
  930. bool dp_rx_intrabss_fwd_be(struct dp_soc *soc, struct dp_peer *ta_peer,
  931. uint8_t *rx_tlv_hdr, qdf_nbuf_t nbuf,
  932. struct hal_rx_msdu_metadata msdu_metadata)
  933. {
  934. /* Hamilton V1 uses Lithium path */
  935. return dp_rx_intrabss_fwd(soc, ta_peer, rx_tlv_hdr, nbuf,
  936. msdu_metadata);
  937. }
  938. #else
  939. /*
  940. * dp_rx_intrabss_fwd_be() - API for intrabss fwd. For EAPOL
  941. * pkt with DA not equal to vdev mac addr, fwd is not allowed.
  942. * @soc: core txrx main context
  943. * @ta_peer: source peer entry
  944. * @rx_tlv_hdr: start address of rx tlvs
  945. * @nbuf: nbuf that has to be intrabss forwarded
  946. * @msdu_metadata: msdu metadata
  947. *
  948. * Return: true if it is forwarded else false
  949. */
  950. bool dp_rx_intrabss_fwd_be(struct dp_soc *soc, struct dp_peer *ta_peer,
  951. uint8_t *rx_tlv_hdr, qdf_nbuf_t nbuf,
  952. struct hal_rx_msdu_metadata msdu_metadata)
  953. {
  954. uint16_t len;
  955. qdf_nbuf_t nbuf_copy;
  956. uint8_t tid = qdf_nbuf_get_tid_val(nbuf);
  957. uint8_t ring_id = QDF_NBUF_CB_RX_CTX_ID(nbuf);
  958. struct cdp_tid_rx_stats *tid_stats = &ta_peer->vdev->pdev->stats.
  959. tid_stats.tid_rx_stats[ring_id][tid];
  960. /* if it is a broadcast pkt (eg: ARP) and it is not its own
  961. * source, then clone the pkt and send the cloned pkt for
  962. * intra BSS forwarding and original pkt up the network stack
  963. * Note: how do we handle multicast pkts. do we forward
  964. * all multicast pkts as is or let a higher layer module
  965. * like igmpsnoop decide whether to forward or not with
  966. * Mcast enhancement.
  967. */
  968. if (qdf_nbuf_is_da_mcbc(nbuf) && !ta_peer->bss_peer) {
  969. if (dp_rx_intrabss_eapol_drop_check(soc, ta_peer, rx_tlv_hdr,
  970. nbuf))
  971. return true;
  972. if (!dp_rx_check_ndi_mdns_fwding(ta_peer, nbuf))
  973. return false;
  974. /* If the source peer in the isolation list
  975. * then dont forward instead push to bridge stack
  976. */
  977. if (dp_get_peer_isolation(ta_peer))
  978. return false;
  979. nbuf_copy = qdf_nbuf_copy(nbuf);
  980. if (!nbuf_copy)
  981. return false;
  982. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  983. if (dp_tx_send((struct cdp_soc_t *)soc,
  984. ta_peer->vdev->vdev_id, nbuf_copy)) {
  985. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1, len);
  986. tid_stats->fail_cnt[INTRABSS_DROP]++;
  987. qdf_nbuf_free(nbuf_copy);
  988. } else {
  989. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1, len);
  990. tid_stats->intrabss_cnt++;
  991. }
  992. return false;
  993. }
  994. if (qdf_nbuf_is_intra_bss(nbuf)) {
  995. if (dp_rx_intrabss_eapol_drop_check(soc, ta_peer, rx_tlv_hdr,
  996. nbuf))
  997. return true;
  998. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  999. /* linearize the nbuf just before we send to
  1000. * dp_tx_send()
  1001. */
  1002. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  1003. if (qdf_nbuf_linearize(nbuf) == -ENOMEM)
  1004. return false;
  1005. nbuf = qdf_nbuf_unshare(nbuf);
  1006. if (!nbuf) {
  1007. DP_STATS_INC_PKT(ta_peer,
  1008. rx.intra_bss.fail, 1, len);
  1009. /* return true even though the pkt is
  1010. * not forwarded. Basically skb_unshare
  1011. * failed and we want to continue with
  1012. * next nbuf.
  1013. */
  1014. tid_stats->fail_cnt[INTRABSS_DROP]++;
  1015. return true;
  1016. }
  1017. }
  1018. if (!dp_tx_send((struct cdp_soc_t *)soc,
  1019. ta_peer->vdev->vdev_id, nbuf)) {
  1020. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1,
  1021. len);
  1022. } else {
  1023. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1,
  1024. len);
  1025. tid_stats->fail_cnt[INTRABSS_DROP]++;
  1026. return false;
  1027. }
  1028. return true;
  1029. }
  1030. return false;
  1031. }
  1032. #endif
  1033. #endif