dp_rx.c 72 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624
  1. /*
  2. * Copyright (c) 2016-2020 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 "hal_hw_headers.h"
  19. #include "dp_types.h"
  20. #include "dp_rx.h"
  21. #include "dp_peer.h"
  22. #include "hal_rx.h"
  23. #include "hal_api.h"
  24. #include "qdf_nbuf.h"
  25. #ifdef MESH_MODE_SUPPORT
  26. #include "if_meta_hdr.h"
  27. #endif
  28. #include "dp_internal.h"
  29. #include "dp_rx_mon.h"
  30. #include "dp_ipa.h"
  31. #ifdef FEATURE_WDS
  32. #include "dp_txrx_wds.h"
  33. #endif
  34. #ifdef ATH_RX_PRI_SAVE
  35. #define DP_RX_TID_SAVE(_nbuf, _tid) \
  36. (qdf_nbuf_set_priority(_nbuf, _tid))
  37. #else
  38. #define DP_RX_TID_SAVE(_nbuf, _tid)
  39. #endif
  40. #ifdef DP_RX_DISABLE_NDI_MDNS_FORWARDING
  41. static inline
  42. bool dp_rx_check_ndi_mdns_fwding(struct dp_peer *ta_peer, qdf_nbuf_t nbuf)
  43. {
  44. if (ta_peer->vdev->opmode == wlan_op_mode_ndi &&
  45. qdf_nbuf_is_ipv6_mdns_pkt(nbuf)) {
  46. DP_STATS_INC(ta_peer, rx.intra_bss.mdns_no_fwd, 1);
  47. return false;
  48. }
  49. return true;
  50. }
  51. #else
  52. static inline
  53. bool dp_rx_check_ndi_mdns_fwding(struct dp_peer *ta_peer, qdf_nbuf_t nbuf)
  54. {
  55. return true;
  56. }
  57. #endif
  58. static inline bool dp_rx_check_ap_bridge(struct dp_vdev *vdev)
  59. {
  60. return vdev->ap_bridge_enabled;
  61. }
  62. #ifdef DUP_RX_DESC_WAR
  63. void dp_rx_dump_info_and_assert(struct dp_soc *soc,
  64. hal_ring_handle_t hal_ring,
  65. hal_ring_desc_t ring_desc,
  66. struct dp_rx_desc *rx_desc)
  67. {
  68. void *hal_soc = soc->hal_soc;
  69. hal_srng_dump_ring_desc(hal_soc, hal_ring, ring_desc);
  70. dp_rx_desc_dump(rx_desc);
  71. }
  72. #else
  73. void dp_rx_dump_info_and_assert(struct dp_soc *soc,
  74. hal_ring_handle_t hal_ring_hdl,
  75. hal_ring_desc_t ring_desc,
  76. struct dp_rx_desc *rx_desc)
  77. {
  78. hal_soc_handle_t hal_soc = soc->hal_soc;
  79. dp_rx_desc_dump(rx_desc);
  80. hal_srng_dump_ring_desc(hal_soc, hal_ring_hdl, ring_desc);
  81. hal_srng_dump_ring(hal_soc, hal_ring_hdl);
  82. qdf_assert_always(0);
  83. }
  84. #endif
  85. /*
  86. * dp_rx_buffers_replenish() - replenish rxdma ring with rx nbufs
  87. * called during dp rx initialization
  88. * and at the end of dp_rx_process.
  89. *
  90. * @soc: core txrx main context
  91. * @mac_id: mac_id which is one of 3 mac_ids
  92. * @dp_rxdma_srng: dp rxdma circular ring
  93. * @rx_desc_pool: Pointer to free Rx descriptor pool
  94. * @num_req_buffers: number of buffer to be replenished
  95. * @desc_list: list of descs if called from dp_rx_process
  96. * or NULL during dp rx initialization or out of buffer
  97. * interrupt.
  98. * @tail: tail of descs list
  99. * Return: return success or failure
  100. */
  101. QDF_STATUS dp_rx_buffers_replenish(struct dp_soc *dp_soc, uint32_t mac_id,
  102. struct dp_srng *dp_rxdma_srng,
  103. struct rx_desc_pool *rx_desc_pool,
  104. uint32_t num_req_buffers,
  105. union dp_rx_desc_list_elem_t **desc_list,
  106. union dp_rx_desc_list_elem_t **tail)
  107. {
  108. uint32_t num_alloc_desc;
  109. uint16_t num_desc_to_free = 0;
  110. struct dp_pdev *dp_pdev = dp_get_pdev_for_lmac_id(dp_soc, mac_id);
  111. uint32_t num_entries_avail;
  112. uint32_t count;
  113. int sync_hw_ptr = 1;
  114. qdf_dma_addr_t paddr;
  115. qdf_nbuf_t rx_netbuf;
  116. void *rxdma_ring_entry;
  117. union dp_rx_desc_list_elem_t *next;
  118. QDF_STATUS ret;
  119. void *rxdma_srng;
  120. rxdma_srng = dp_rxdma_srng->hal_srng;
  121. if (!rxdma_srng) {
  122. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  123. "rxdma srng not initialized");
  124. DP_STATS_INC(dp_pdev, replenish.rxdma_err, num_req_buffers);
  125. return QDF_STATUS_E_FAILURE;
  126. }
  127. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  128. "requested %d buffers for replenish", num_req_buffers);
  129. hal_srng_access_start(dp_soc->hal_soc, rxdma_srng);
  130. num_entries_avail = hal_srng_src_num_avail(dp_soc->hal_soc,
  131. rxdma_srng,
  132. sync_hw_ptr);
  133. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  134. "no of available entries in rxdma ring: %d",
  135. num_entries_avail);
  136. if (!(*desc_list) && (num_entries_avail >
  137. ((dp_rxdma_srng->num_entries * 3) / 4))) {
  138. num_req_buffers = num_entries_avail;
  139. } else if (num_entries_avail < num_req_buffers) {
  140. num_desc_to_free = num_req_buffers - num_entries_avail;
  141. num_req_buffers = num_entries_avail;
  142. }
  143. if (qdf_unlikely(!num_req_buffers)) {
  144. num_desc_to_free = num_req_buffers;
  145. hal_srng_access_end(dp_soc->hal_soc, rxdma_srng);
  146. goto free_descs;
  147. }
  148. /*
  149. * if desc_list is NULL, allocate the descs from freelist
  150. */
  151. if (!(*desc_list)) {
  152. num_alloc_desc = dp_rx_get_free_desc_list(dp_soc, mac_id,
  153. rx_desc_pool,
  154. num_req_buffers,
  155. desc_list,
  156. tail);
  157. if (!num_alloc_desc) {
  158. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  159. "no free rx_descs in freelist");
  160. DP_STATS_INC(dp_pdev, err.desc_alloc_fail,
  161. num_req_buffers);
  162. hal_srng_access_end(dp_soc->hal_soc, rxdma_srng);
  163. return QDF_STATUS_E_NOMEM;
  164. }
  165. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  166. "%d rx desc allocated", num_alloc_desc);
  167. num_req_buffers = num_alloc_desc;
  168. }
  169. count = 0;
  170. while (count < num_req_buffers) {
  171. rx_netbuf = qdf_nbuf_alloc(dp_soc->osdev,
  172. RX_BUFFER_SIZE,
  173. RX_BUFFER_RESERVATION,
  174. RX_BUFFER_ALIGNMENT,
  175. FALSE);
  176. if (qdf_unlikely(!rx_netbuf)) {
  177. DP_STATS_INC(dp_pdev, replenish.nbuf_alloc_fail, 1);
  178. break;
  179. }
  180. ret = qdf_nbuf_map_single(dp_soc->osdev, rx_netbuf,
  181. QDF_DMA_FROM_DEVICE);
  182. if (qdf_unlikely(QDF_IS_STATUS_ERROR(ret))) {
  183. qdf_nbuf_free(rx_netbuf);
  184. DP_STATS_INC(dp_pdev, replenish.map_err, 1);
  185. continue;
  186. }
  187. paddr = qdf_nbuf_get_frag_paddr(rx_netbuf, 0);
  188. dp_ipa_handle_rx_buf_smmu_mapping(dp_soc, rx_netbuf, true);
  189. /*
  190. * check if the physical address of nbuf->data is
  191. * less then 0x50000000 then free the nbuf and try
  192. * allocating new nbuf. We can try for 100 times.
  193. * this is a temp WAR till we fix it properly.
  194. */
  195. ret = check_x86_paddr(dp_soc, &rx_netbuf, &paddr, dp_pdev);
  196. if (ret == QDF_STATUS_E_FAILURE) {
  197. DP_STATS_INC(dp_pdev, replenish.x86_fail, 1);
  198. break;
  199. }
  200. count++;
  201. rxdma_ring_entry = hal_srng_src_get_next(dp_soc->hal_soc,
  202. rxdma_srng);
  203. qdf_assert_always(rxdma_ring_entry);
  204. next = (*desc_list)->next;
  205. dp_rx_desc_prep(&((*desc_list)->rx_desc), rx_netbuf);
  206. /* rx_desc.in_use should be zero at this time*/
  207. qdf_assert_always((*desc_list)->rx_desc.in_use == 0);
  208. (*desc_list)->rx_desc.in_use = 1;
  209. dp_verbose_debug("rx_netbuf=%pK, buf=%pK, paddr=0x%llx, cookie=%d",
  210. rx_netbuf, qdf_nbuf_data(rx_netbuf),
  211. (unsigned long long)paddr,
  212. (*desc_list)->rx_desc.cookie);
  213. hal_rxdma_buff_addr_info_set(rxdma_ring_entry, paddr,
  214. (*desc_list)->rx_desc.cookie,
  215. rx_desc_pool->owner);
  216. *desc_list = next;
  217. }
  218. hal_srng_access_end(dp_soc->hal_soc, rxdma_srng);
  219. dp_verbose_debug("replenished buffers %d, rx desc added back to free list %u",
  220. count, num_desc_to_free);
  221. DP_STATS_INC_PKT(dp_pdev, replenish.pkts, count,
  222. (RX_BUFFER_SIZE * count));
  223. free_descs:
  224. DP_STATS_INC(dp_pdev, buf_freelist, num_desc_to_free);
  225. /*
  226. * add any available free desc back to the free list
  227. */
  228. if (*desc_list)
  229. dp_rx_add_desc_list_to_free_list(dp_soc, desc_list, tail,
  230. mac_id, rx_desc_pool);
  231. return QDF_STATUS_SUCCESS;
  232. }
  233. /*
  234. * dp_rx_deliver_raw() - process RAW mode pkts and hand over the
  235. * pkts to RAW mode simulation to
  236. * decapsulate the pkt.
  237. *
  238. * @vdev: vdev on which RAW mode is enabled
  239. * @nbuf_list: list of RAW pkts to process
  240. * @peer: peer object from which the pkt is rx
  241. *
  242. * Return: void
  243. */
  244. void
  245. dp_rx_deliver_raw(struct dp_vdev *vdev, qdf_nbuf_t nbuf_list,
  246. struct dp_peer *peer)
  247. {
  248. qdf_nbuf_t deliver_list_head = NULL;
  249. qdf_nbuf_t deliver_list_tail = NULL;
  250. qdf_nbuf_t nbuf;
  251. nbuf = nbuf_list;
  252. while (nbuf) {
  253. qdf_nbuf_t next = qdf_nbuf_next(nbuf);
  254. DP_RX_LIST_APPEND(deliver_list_head, deliver_list_tail, nbuf);
  255. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  256. DP_STATS_INC_PKT(peer, rx.raw, 1, qdf_nbuf_len(nbuf));
  257. /*
  258. * reset the chfrag_start and chfrag_end bits in nbuf cb
  259. * as this is a non-amsdu pkt and RAW mode simulation expects
  260. * these bit s to be 0 for non-amsdu pkt.
  261. */
  262. if (qdf_nbuf_is_rx_chfrag_start(nbuf) &&
  263. qdf_nbuf_is_rx_chfrag_end(nbuf)) {
  264. qdf_nbuf_set_rx_chfrag_start(nbuf, 0);
  265. qdf_nbuf_set_rx_chfrag_end(nbuf, 0);
  266. }
  267. nbuf = next;
  268. }
  269. vdev->osif_rsim_rx_decap(vdev->osif_vdev, &deliver_list_head,
  270. &deliver_list_tail, peer->mac_addr.raw);
  271. vdev->osif_rx(vdev->osif_vdev, deliver_list_head);
  272. }
  273. #ifdef DP_LFR
  274. /*
  275. * In case of LFR, data of a new peer might be sent up
  276. * even before peer is added.
  277. */
  278. static inline struct dp_vdev *
  279. dp_get_vdev_from_peer(struct dp_soc *soc,
  280. uint16_t peer_id,
  281. struct dp_peer *peer,
  282. struct hal_rx_mpdu_desc_info mpdu_desc_info)
  283. {
  284. struct dp_vdev *vdev;
  285. uint8_t vdev_id;
  286. if (unlikely(!peer)) {
  287. if (peer_id != HTT_INVALID_PEER) {
  288. vdev_id = DP_PEER_METADATA_VDEV_ID_GET(
  289. mpdu_desc_info.peer_meta_data);
  290. QDF_TRACE(QDF_MODULE_ID_DP,
  291. QDF_TRACE_LEVEL_DEBUG,
  292. FL("PeerID %d not found use vdevID %d"),
  293. peer_id, vdev_id);
  294. vdev = dp_get_vdev_from_soc_vdev_id_wifi3(soc,
  295. vdev_id);
  296. } else {
  297. QDF_TRACE(QDF_MODULE_ID_DP,
  298. QDF_TRACE_LEVEL_DEBUG,
  299. FL("Invalid PeerID %d"),
  300. peer_id);
  301. return NULL;
  302. }
  303. } else {
  304. vdev = peer->vdev;
  305. }
  306. return vdev;
  307. }
  308. #else
  309. static inline struct dp_vdev *
  310. dp_get_vdev_from_peer(struct dp_soc *soc,
  311. uint16_t peer_id,
  312. struct dp_peer *peer,
  313. struct hal_rx_mpdu_desc_info mpdu_desc_info)
  314. {
  315. if (unlikely(!peer)) {
  316. QDF_TRACE(QDF_MODULE_ID_DP,
  317. QDF_TRACE_LEVEL_DEBUG,
  318. FL("Peer not found for peerID %d"),
  319. peer_id);
  320. return NULL;
  321. } else {
  322. return peer->vdev;
  323. }
  324. }
  325. #endif
  326. #ifndef FEATURE_WDS
  327. static void
  328. dp_rx_da_learn(struct dp_soc *soc,
  329. uint8_t *rx_tlv_hdr,
  330. struct dp_peer *ta_peer,
  331. qdf_nbuf_t nbuf)
  332. {
  333. }
  334. #endif
  335. /*
  336. * dp_rx_intrabss_fwd() - Implements the Intra-BSS forwarding logic
  337. *
  338. * @soc: core txrx main context
  339. * @ta_peer : source peer entry
  340. * @rx_tlv_hdr : start address of rx tlvs
  341. * @nbuf : nbuf that has to be intrabss forwarded
  342. *
  343. * Return: bool: true if it is forwarded else false
  344. */
  345. static bool
  346. dp_rx_intrabss_fwd(struct dp_soc *soc,
  347. struct dp_peer *ta_peer,
  348. uint8_t *rx_tlv_hdr,
  349. qdf_nbuf_t nbuf)
  350. {
  351. uint16_t da_idx;
  352. uint16_t len;
  353. uint8_t is_frag;
  354. struct dp_peer *da_peer;
  355. struct dp_ast_entry *ast_entry;
  356. qdf_nbuf_t nbuf_copy;
  357. uint8_t tid = qdf_nbuf_get_tid_val(nbuf);
  358. uint8_t ring_id = QDF_NBUF_CB_RX_CTX_ID(nbuf);
  359. struct cdp_tid_rx_stats *tid_stats = &ta_peer->vdev->pdev->stats.
  360. tid_stats.tid_rx_stats[ring_id][tid];
  361. /* check if the destination peer is available in peer table
  362. * and also check if the source peer and destination peer
  363. * belong to the same vap and destination peer is not bss peer.
  364. */
  365. if ((qdf_nbuf_is_da_valid(nbuf) && !qdf_nbuf_is_da_mcbc(nbuf))) {
  366. da_idx = hal_rx_msdu_end_da_idx_get(soc->hal_soc, rx_tlv_hdr);
  367. ast_entry = soc->ast_table[da_idx];
  368. if (!ast_entry)
  369. return false;
  370. if (ast_entry->type == CDP_TXRX_AST_TYPE_DA) {
  371. ast_entry->is_active = TRUE;
  372. return false;
  373. }
  374. da_peer = ast_entry->peer;
  375. if (!da_peer)
  376. return false;
  377. /* TA peer cannot be same as peer(DA) on which AST is present
  378. * this indicates a change in topology and that AST entries
  379. * are yet to be updated.
  380. */
  381. if (da_peer == ta_peer)
  382. return false;
  383. if (da_peer->vdev == ta_peer->vdev && !da_peer->bss_peer) {
  384. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  385. is_frag = qdf_nbuf_is_frag(nbuf);
  386. memset(nbuf->cb, 0x0, sizeof(nbuf->cb));
  387. /* linearize the nbuf just before we send to
  388. * dp_tx_send()
  389. */
  390. if (qdf_unlikely(is_frag)) {
  391. if (qdf_nbuf_linearize(nbuf) == -ENOMEM)
  392. return false;
  393. nbuf = qdf_nbuf_unshare(nbuf);
  394. if (!nbuf) {
  395. DP_STATS_INC_PKT(ta_peer,
  396. rx.intra_bss.fail,
  397. 1,
  398. len);
  399. /* return true even though the pkt is
  400. * not forwarded. Basically skb_unshare
  401. * failed and we want to continue with
  402. * next nbuf.
  403. */
  404. tid_stats->fail_cnt[INTRABSS_DROP]++;
  405. return true;
  406. }
  407. }
  408. if (!dp_tx_send((struct cdp_soc_t *)soc,
  409. ta_peer->vdev->vdev_id, nbuf)) {
  410. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1,
  411. len);
  412. return true;
  413. } else {
  414. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1,
  415. len);
  416. tid_stats->fail_cnt[INTRABSS_DROP]++;
  417. return false;
  418. }
  419. }
  420. }
  421. /* if it is a broadcast pkt (eg: ARP) and it is not its own
  422. * source, then clone the pkt and send the cloned pkt for
  423. * intra BSS forwarding and original pkt up the network stack
  424. * Note: how do we handle multicast pkts. do we forward
  425. * all multicast pkts as is or let a higher layer module
  426. * like igmpsnoop decide whether to forward or not with
  427. * Mcast enhancement.
  428. */
  429. else if (qdf_unlikely((qdf_nbuf_is_da_mcbc(nbuf) &&
  430. !ta_peer->bss_peer))) {
  431. if (!dp_rx_check_ndi_mdns_fwding(ta_peer, nbuf))
  432. goto end;
  433. nbuf_copy = qdf_nbuf_copy(nbuf);
  434. if (!nbuf_copy)
  435. goto end;
  436. len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  437. memset(nbuf_copy->cb, 0x0, sizeof(nbuf_copy->cb));
  438. /* Set cb->ftype to intrabss FWD */
  439. qdf_nbuf_set_tx_ftype(nbuf_copy, CB_FTYPE_INTRABSS_FWD);
  440. if (dp_tx_send((struct cdp_soc_t *)soc,
  441. ta_peer->vdev->vdev_id, nbuf_copy)) {
  442. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.fail, 1, len);
  443. tid_stats->fail_cnt[INTRABSS_DROP]++;
  444. qdf_nbuf_free(nbuf_copy);
  445. } else {
  446. DP_STATS_INC_PKT(ta_peer, rx.intra_bss.pkts, 1, len);
  447. tid_stats->intrabss_cnt++;
  448. }
  449. }
  450. end:
  451. /* return false as we have to still send the original pkt
  452. * up the stack
  453. */
  454. return false;
  455. }
  456. #ifdef MESH_MODE_SUPPORT
  457. /**
  458. * dp_rx_fill_mesh_stats() - Fills the mesh per packet receive stats
  459. *
  460. * @vdev: DP Virtual device handle
  461. * @nbuf: Buffer pointer
  462. * @rx_tlv_hdr: start of rx tlv header
  463. * @peer: pointer to peer
  464. *
  465. * This function allocated memory for mesh receive stats and fill the
  466. * required stats. Stores the memory address in skb cb.
  467. *
  468. * Return: void
  469. */
  470. void dp_rx_fill_mesh_stats(struct dp_vdev *vdev, qdf_nbuf_t nbuf,
  471. uint8_t *rx_tlv_hdr, struct dp_peer *peer)
  472. {
  473. struct mesh_recv_hdr_s *rx_info = NULL;
  474. uint32_t pkt_type;
  475. uint32_t nss;
  476. uint32_t rate_mcs;
  477. uint32_t bw;
  478. /* fill recv mesh stats */
  479. rx_info = qdf_mem_malloc(sizeof(struct mesh_recv_hdr_s));
  480. /* upper layers are resposible to free this memory */
  481. if (!rx_info) {
  482. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  483. "Memory allocation failed for mesh rx stats");
  484. DP_STATS_INC(vdev->pdev, mesh_mem_alloc, 1);
  485. return;
  486. }
  487. rx_info->rs_flags = MESH_RXHDR_VER1;
  488. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  489. rx_info->rs_flags |= MESH_RX_FIRST_MSDU;
  490. if (qdf_nbuf_is_rx_chfrag_end(nbuf))
  491. rx_info->rs_flags |= MESH_RX_LAST_MSDU;
  492. if (hal_rx_attn_msdu_get_is_decrypted(rx_tlv_hdr)) {
  493. rx_info->rs_flags |= MESH_RX_DECRYPTED;
  494. rx_info->rs_keyix = hal_rx_msdu_get_keyid(rx_tlv_hdr);
  495. if (vdev->osif_get_key)
  496. vdev->osif_get_key(vdev->osif_vdev,
  497. &rx_info->rs_decryptkey[0],
  498. &peer->mac_addr.raw[0],
  499. rx_info->rs_keyix);
  500. }
  501. rx_info->rs_rssi = hal_rx_msdu_start_get_rssi(rx_tlv_hdr);
  502. rx_info->rs_channel = hal_rx_msdu_start_get_freq(rx_tlv_hdr);
  503. pkt_type = hal_rx_msdu_start_get_pkt_type(rx_tlv_hdr);
  504. rate_mcs = hal_rx_msdu_start_rate_mcs_get(rx_tlv_hdr);
  505. bw = hal_rx_msdu_start_bw_get(rx_tlv_hdr);
  506. nss = hal_rx_msdu_start_nss_get(vdev->pdev->soc->hal_soc, rx_tlv_hdr);
  507. rx_info->rs_ratephy1 = rate_mcs | (nss << 0x8) | (pkt_type << 16) |
  508. (bw << 24);
  509. qdf_nbuf_set_rx_fctx_type(nbuf, (void *)rx_info, CB_FTYPE_MESH_RX_INFO);
  510. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_MED,
  511. FL("Mesh rx stats: flags %x, rssi %x, chn %x, rate %x, kix %x"),
  512. rx_info->rs_flags,
  513. rx_info->rs_rssi,
  514. rx_info->rs_channel,
  515. rx_info->rs_ratephy1,
  516. rx_info->rs_keyix);
  517. }
  518. /**
  519. * dp_rx_filter_mesh_packets() - Filters mesh unwanted packets
  520. *
  521. * @vdev: DP Virtual device handle
  522. * @nbuf: Buffer pointer
  523. * @rx_tlv_hdr: start of rx tlv header
  524. *
  525. * This checks if the received packet is matching any filter out
  526. * catogery and and drop the packet if it matches.
  527. *
  528. * Return: status(0 indicates drop, 1 indicate to no drop)
  529. */
  530. QDF_STATUS dp_rx_filter_mesh_packets(struct dp_vdev *vdev, qdf_nbuf_t nbuf,
  531. uint8_t *rx_tlv_hdr)
  532. {
  533. union dp_align_mac_addr mac_addr;
  534. struct dp_soc *soc = vdev->pdev->soc;
  535. if (qdf_unlikely(vdev->mesh_rx_filter)) {
  536. if (vdev->mesh_rx_filter & MESH_FILTER_OUT_FROMDS)
  537. if (hal_rx_mpdu_get_fr_ds(soc->hal_soc,
  538. rx_tlv_hdr))
  539. return QDF_STATUS_SUCCESS;
  540. if (vdev->mesh_rx_filter & MESH_FILTER_OUT_TODS)
  541. if (hal_rx_mpdu_get_to_ds(soc->hal_soc,
  542. rx_tlv_hdr))
  543. return QDF_STATUS_SUCCESS;
  544. if (vdev->mesh_rx_filter & MESH_FILTER_OUT_NODS)
  545. if (!hal_rx_mpdu_get_fr_ds(soc->hal_soc,
  546. rx_tlv_hdr) &&
  547. !hal_rx_mpdu_get_to_ds(soc->hal_soc,
  548. rx_tlv_hdr))
  549. return QDF_STATUS_SUCCESS;
  550. if (vdev->mesh_rx_filter & MESH_FILTER_OUT_RA) {
  551. if (hal_rx_mpdu_get_addr1(soc->hal_soc,
  552. rx_tlv_hdr,
  553. &mac_addr.raw[0]))
  554. return QDF_STATUS_E_FAILURE;
  555. if (!qdf_mem_cmp(&mac_addr.raw[0],
  556. &vdev->mac_addr.raw[0],
  557. QDF_MAC_ADDR_SIZE))
  558. return QDF_STATUS_SUCCESS;
  559. }
  560. if (vdev->mesh_rx_filter & MESH_FILTER_OUT_TA) {
  561. if (hal_rx_mpdu_get_addr2(soc->hal_soc,
  562. rx_tlv_hdr,
  563. &mac_addr.raw[0]))
  564. return QDF_STATUS_E_FAILURE;
  565. if (!qdf_mem_cmp(&mac_addr.raw[0],
  566. &vdev->mac_addr.raw[0],
  567. QDF_MAC_ADDR_SIZE))
  568. return QDF_STATUS_SUCCESS;
  569. }
  570. }
  571. return QDF_STATUS_E_FAILURE;
  572. }
  573. #else
  574. void dp_rx_fill_mesh_stats(struct dp_vdev *vdev, qdf_nbuf_t nbuf,
  575. uint8_t *rx_tlv_hdr, struct dp_peer *peer)
  576. {
  577. }
  578. QDF_STATUS dp_rx_filter_mesh_packets(struct dp_vdev *vdev, qdf_nbuf_t nbuf,
  579. uint8_t *rx_tlv_hdr)
  580. {
  581. return QDF_STATUS_E_FAILURE;
  582. }
  583. #endif
  584. #ifdef FEATURE_NAC_RSSI
  585. /**
  586. * dp_rx_nac_filter(): Function to perform filtering of non-associated
  587. * clients
  588. * @pdev: DP pdev handle
  589. * @rx_pkt_hdr: Rx packet Header
  590. *
  591. * return: dp_vdev*
  592. */
  593. static
  594. struct dp_vdev *dp_rx_nac_filter(struct dp_pdev *pdev,
  595. uint8_t *rx_pkt_hdr)
  596. {
  597. struct ieee80211_frame *wh;
  598. struct dp_neighbour_peer *peer = NULL;
  599. wh = (struct ieee80211_frame *)rx_pkt_hdr;
  600. if ((wh->i_fc[1] & IEEE80211_FC1_DIR_MASK) != IEEE80211_FC1_DIR_TODS)
  601. return NULL;
  602. qdf_spin_lock_bh(&pdev->neighbour_peer_mutex);
  603. TAILQ_FOREACH(peer, &pdev->neighbour_peers_list,
  604. neighbour_peer_list_elem) {
  605. if (qdf_mem_cmp(&peer->neighbour_peers_macaddr.raw[0],
  606. wh->i_addr2, QDF_MAC_ADDR_SIZE) == 0) {
  607. QDF_TRACE(
  608. QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  609. FL("NAC configuration matched for mac-%2x:%2x:%2x:%2x:%2x:%2x"),
  610. peer->neighbour_peers_macaddr.raw[0],
  611. peer->neighbour_peers_macaddr.raw[1],
  612. peer->neighbour_peers_macaddr.raw[2],
  613. peer->neighbour_peers_macaddr.raw[3],
  614. peer->neighbour_peers_macaddr.raw[4],
  615. peer->neighbour_peers_macaddr.raw[5]);
  616. qdf_spin_unlock_bh(&pdev->neighbour_peer_mutex);
  617. return pdev->monitor_vdev;
  618. }
  619. }
  620. qdf_spin_unlock_bh(&pdev->neighbour_peer_mutex);
  621. return NULL;
  622. }
  623. /**
  624. * dp_rx_process_invalid_peer(): Function to pass invalid peer list to umac
  625. * @soc: DP SOC handle
  626. * @mpdu: mpdu for which peer is invalid
  627. * @mac_id: mac_id which is one of 3 mac_ids(Assuming mac_id and
  628. * pool_id has same mapping)
  629. *
  630. * return: integer type
  631. */
  632. uint8_t dp_rx_process_invalid_peer(struct dp_soc *soc, qdf_nbuf_t mpdu,
  633. uint8_t mac_id)
  634. {
  635. struct dp_invalid_peer_msg msg;
  636. struct dp_vdev *vdev = NULL;
  637. struct dp_pdev *pdev = NULL;
  638. struct ieee80211_frame *wh;
  639. qdf_nbuf_t curr_nbuf, next_nbuf;
  640. uint8_t *rx_tlv_hdr = qdf_nbuf_data(mpdu);
  641. uint8_t *rx_pkt_hdr = hal_rx_pkt_hdr_get(rx_tlv_hdr);
  642. rx_pkt_hdr = hal_rx_pkt_hdr_get(rx_tlv_hdr);
  643. if (!HAL_IS_DECAP_FORMAT_RAW(soc->hal_soc, rx_tlv_hdr)) {
  644. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  645. "Drop decapped frames");
  646. goto free;
  647. }
  648. wh = (struct ieee80211_frame *)rx_pkt_hdr;
  649. if (!DP_FRAME_IS_DATA(wh)) {
  650. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_DEBUG,
  651. "NAWDS valid only for data frames");
  652. goto free;
  653. }
  654. if (qdf_nbuf_len(mpdu) < sizeof(struct ieee80211_frame)) {
  655. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  656. "Invalid nbuf length");
  657. goto free;
  658. }
  659. pdev = dp_get_pdev_for_lmac_id(soc, mac_id);
  660. if (!pdev || qdf_unlikely(pdev->is_pdev_down)) {
  661. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  662. "PDEV %s", !pdev ? "not found" : "down");
  663. goto free;
  664. }
  665. if (pdev->filter_neighbour_peers) {
  666. /* Next Hop scenario not yet handle */
  667. vdev = dp_rx_nac_filter(pdev, rx_pkt_hdr);
  668. if (vdev) {
  669. dp_rx_mon_deliver(soc, pdev->pdev_id,
  670. pdev->invalid_peer_head_msdu,
  671. pdev->invalid_peer_tail_msdu);
  672. pdev->invalid_peer_head_msdu = NULL;
  673. pdev->invalid_peer_tail_msdu = NULL;
  674. return 0;
  675. }
  676. }
  677. TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) {
  678. if (qdf_mem_cmp(wh->i_addr1, vdev->mac_addr.raw,
  679. QDF_MAC_ADDR_SIZE) == 0) {
  680. goto out;
  681. }
  682. }
  683. if (!vdev) {
  684. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  685. "VDEV not found");
  686. goto free;
  687. }
  688. out:
  689. msg.wh = wh;
  690. qdf_nbuf_pull_head(mpdu, RX_PKT_TLVS_LEN);
  691. msg.nbuf = mpdu;
  692. msg.vdev_id = vdev->vdev_id;
  693. if (pdev->soc->cdp_soc.ol_ops->rx_invalid_peer)
  694. pdev->soc->cdp_soc.ol_ops->rx_invalid_peer(
  695. (struct cdp_ctrl_objmgr_psoc *)soc->ctrl_psoc,
  696. pdev->pdev_id, &msg);
  697. free:
  698. /* Drop and free packet */
  699. curr_nbuf = mpdu;
  700. while (curr_nbuf) {
  701. next_nbuf = qdf_nbuf_next(curr_nbuf);
  702. qdf_nbuf_free(curr_nbuf);
  703. curr_nbuf = next_nbuf;
  704. }
  705. return 0;
  706. }
  707. /**
  708. * dp_rx_process_invalid_peer_wrapper(): Function to wrap invalid peer handler
  709. * @soc: DP SOC handle
  710. * @mpdu: mpdu for which peer is invalid
  711. * @mpdu_done: if an mpdu is completed
  712. * @mac_id: mac_id which is one of 3 mac_ids(Assuming mac_id and
  713. * pool_id has same mapping)
  714. *
  715. * return: integer type
  716. */
  717. void dp_rx_process_invalid_peer_wrapper(struct dp_soc *soc,
  718. qdf_nbuf_t mpdu, bool mpdu_done,
  719. uint8_t mac_id)
  720. {
  721. /* Only trigger the process when mpdu is completed */
  722. if (mpdu_done)
  723. dp_rx_process_invalid_peer(soc, mpdu, mac_id);
  724. }
  725. #else
  726. uint8_t dp_rx_process_invalid_peer(struct dp_soc *soc, qdf_nbuf_t mpdu,
  727. uint8_t mac_id)
  728. {
  729. qdf_nbuf_t curr_nbuf, next_nbuf;
  730. struct dp_pdev *pdev;
  731. struct dp_vdev *vdev = NULL;
  732. struct ieee80211_frame *wh;
  733. uint8_t *rx_tlv_hdr = qdf_nbuf_data(mpdu);
  734. uint8_t *rx_pkt_hdr = hal_rx_pkt_hdr_get(rx_tlv_hdr);
  735. wh = (struct ieee80211_frame *)rx_pkt_hdr;
  736. if (!DP_FRAME_IS_DATA(wh)) {
  737. QDF_TRACE_ERROR_RL(QDF_MODULE_ID_DP,
  738. "only for data frames");
  739. goto free;
  740. }
  741. if (qdf_nbuf_len(mpdu) < sizeof(struct ieee80211_frame)) {
  742. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  743. "Invalid nbuf length");
  744. goto free;
  745. }
  746. pdev = dp_get_pdev_for_lmac_id(soc, mac_id);
  747. if (!pdev) {
  748. QDF_TRACE(QDF_MODULE_ID_DP,
  749. QDF_TRACE_LEVEL_ERROR,
  750. "PDEV not found");
  751. goto free;
  752. }
  753. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  754. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  755. if (qdf_mem_cmp(wh->i_addr1, vdev->mac_addr.raw,
  756. QDF_MAC_ADDR_SIZE) == 0) {
  757. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  758. goto out;
  759. }
  760. }
  761. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  762. if (!vdev) {
  763. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  764. "VDEV not found");
  765. goto free;
  766. }
  767. out:
  768. if (soc->cdp_soc.ol_ops->rx_invalid_peer)
  769. soc->cdp_soc.ol_ops->rx_invalid_peer(vdev->vdev_id, wh);
  770. free:
  771. /* reset the head and tail pointers */
  772. pdev = dp_get_pdev_for_lmac_id(soc, mac_id);
  773. if (pdev) {
  774. pdev->invalid_peer_head_msdu = NULL;
  775. pdev->invalid_peer_tail_msdu = NULL;
  776. }
  777. /* Drop and free packet */
  778. curr_nbuf = mpdu;
  779. while (curr_nbuf) {
  780. next_nbuf = qdf_nbuf_next(curr_nbuf);
  781. qdf_nbuf_free(curr_nbuf);
  782. curr_nbuf = next_nbuf;
  783. }
  784. /* Reset the head and tail pointers */
  785. pdev = dp_get_pdev_for_mac_id(soc, mac_id);
  786. if (pdev) {
  787. pdev->invalid_peer_head_msdu = NULL;
  788. pdev->invalid_peer_tail_msdu = NULL;
  789. }
  790. return 0;
  791. }
  792. void dp_rx_process_invalid_peer_wrapper(struct dp_soc *soc,
  793. qdf_nbuf_t mpdu, bool mpdu_done,
  794. uint8_t mac_id)
  795. {
  796. /* Process the nbuf */
  797. dp_rx_process_invalid_peer(soc, mpdu, mac_id);
  798. }
  799. #endif
  800. #ifdef RECEIVE_OFFLOAD
  801. /**
  802. * dp_rx_print_offload_info() - Print offload info from RX TLV
  803. * @soc: dp soc handle
  804. * @rx_tlv: RX TLV for which offload information is to be printed
  805. *
  806. * Return: None
  807. */
  808. static void dp_rx_print_offload_info(struct dp_soc *soc, uint8_t *rx_tlv)
  809. {
  810. dp_verbose_debug("----------------------RX DESC LRO/GRO----------------------");
  811. dp_verbose_debug("lro_eligible 0x%x", HAL_RX_TLV_GET_LRO_ELIGIBLE(rx_tlv));
  812. dp_verbose_debug("pure_ack 0x%x", HAL_RX_TLV_GET_TCP_PURE_ACK(rx_tlv));
  813. dp_verbose_debug("chksum 0x%x", hal_rx_tlv_get_tcp_chksum(soc->hal_soc,
  814. rx_tlv));
  815. dp_verbose_debug("TCP seq num 0x%x", HAL_RX_TLV_GET_TCP_SEQ(rx_tlv));
  816. dp_verbose_debug("TCP ack num 0x%x", HAL_RX_TLV_GET_TCP_ACK(rx_tlv));
  817. dp_verbose_debug("TCP window 0x%x", HAL_RX_TLV_GET_TCP_WIN(rx_tlv));
  818. dp_verbose_debug("TCP protocol 0x%x", HAL_RX_TLV_GET_TCP_PROTO(rx_tlv));
  819. dp_verbose_debug("TCP offset 0x%x", HAL_RX_TLV_GET_TCP_OFFSET(rx_tlv));
  820. dp_verbose_debug("toeplitz 0x%x", HAL_RX_TLV_GET_FLOW_ID_TOEPLITZ(rx_tlv));
  821. dp_verbose_debug("---------------------------------------------------------");
  822. }
  823. /**
  824. * dp_rx_fill_gro_info() - Fill GRO info from RX TLV into skb->cb
  825. * @soc: DP SOC handle
  826. * @rx_tlv: RX TLV received for the msdu
  827. * @msdu: msdu for which GRO info needs to be filled
  828. * @rx_ol_pkt_cnt: counter to be incremented for GRO eligible packets
  829. *
  830. * Return: None
  831. */
  832. static
  833. void dp_rx_fill_gro_info(struct dp_soc *soc, uint8_t *rx_tlv,
  834. qdf_nbuf_t msdu, uint32_t *rx_ol_pkt_cnt)
  835. {
  836. if (!wlan_cfg_is_gro_enabled(soc->wlan_cfg_ctx))
  837. return;
  838. /* Filling up RX offload info only for TCP packets */
  839. if (!HAL_RX_TLV_GET_TCP_PROTO(rx_tlv))
  840. return;
  841. *rx_ol_pkt_cnt = *rx_ol_pkt_cnt + 1;
  842. QDF_NBUF_CB_RX_LRO_ELIGIBLE(msdu) =
  843. HAL_RX_TLV_GET_LRO_ELIGIBLE(rx_tlv);
  844. QDF_NBUF_CB_RX_TCP_PURE_ACK(msdu) =
  845. HAL_RX_TLV_GET_TCP_PURE_ACK(rx_tlv);
  846. QDF_NBUF_CB_RX_TCP_CHKSUM(msdu) =
  847. hal_rx_tlv_get_tcp_chksum(soc->hal_soc,
  848. rx_tlv);
  849. QDF_NBUF_CB_RX_TCP_SEQ_NUM(msdu) =
  850. HAL_RX_TLV_GET_TCP_SEQ(rx_tlv);
  851. QDF_NBUF_CB_RX_TCP_ACK_NUM(msdu) =
  852. HAL_RX_TLV_GET_TCP_ACK(rx_tlv);
  853. QDF_NBUF_CB_RX_TCP_WIN(msdu) =
  854. HAL_RX_TLV_GET_TCP_WIN(rx_tlv);
  855. QDF_NBUF_CB_RX_TCP_PROTO(msdu) =
  856. HAL_RX_TLV_GET_TCP_PROTO(rx_tlv);
  857. QDF_NBUF_CB_RX_IPV6_PROTO(msdu) =
  858. HAL_RX_TLV_GET_IPV6(rx_tlv);
  859. QDF_NBUF_CB_RX_TCP_OFFSET(msdu) =
  860. HAL_RX_TLV_GET_TCP_OFFSET(rx_tlv);
  861. QDF_NBUF_CB_RX_FLOW_ID(msdu) =
  862. HAL_RX_TLV_GET_FLOW_ID_TOEPLITZ(rx_tlv);
  863. dp_rx_print_offload_info(soc, rx_tlv);
  864. }
  865. #else
  866. static void dp_rx_fill_gro_info(struct dp_soc *soc, uint8_t *rx_tlv,
  867. qdf_nbuf_t msdu, uint32_t *rx_ol_pkt_cnt)
  868. {
  869. }
  870. #endif /* RECEIVE_OFFLOAD */
  871. /**
  872. * dp_rx_adjust_nbuf_len() - set appropriate msdu length in nbuf.
  873. *
  874. * @nbuf: pointer to msdu.
  875. * @mpdu_len: mpdu length
  876. *
  877. * Return: returns true if nbuf is last msdu of mpdu else retuns false.
  878. */
  879. static inline bool dp_rx_adjust_nbuf_len(qdf_nbuf_t nbuf, uint16_t *mpdu_len)
  880. {
  881. bool last_nbuf;
  882. if (*mpdu_len > (RX_BUFFER_SIZE - RX_PKT_TLVS_LEN)) {
  883. qdf_nbuf_set_pktlen(nbuf, RX_BUFFER_SIZE);
  884. last_nbuf = false;
  885. } else {
  886. qdf_nbuf_set_pktlen(nbuf, (*mpdu_len + RX_PKT_TLVS_LEN));
  887. last_nbuf = true;
  888. }
  889. *mpdu_len -= (RX_BUFFER_SIZE - RX_PKT_TLVS_LEN);
  890. return last_nbuf;
  891. }
  892. /**
  893. * dp_rx_sg_create() - create a frag_list for MSDUs which are spread across
  894. * multiple nbufs.
  895. * @nbuf: pointer to the first msdu of an amsdu.
  896. * @rx_tlv_hdr: pointer to the start of RX TLV headers.
  897. *
  898. *
  899. * This function implements the creation of RX frag_list for cases
  900. * where an MSDU is spread across multiple nbufs.
  901. *
  902. * Return: returns the head nbuf which contains complete frag_list.
  903. */
  904. qdf_nbuf_t dp_rx_sg_create(qdf_nbuf_t nbuf, uint8_t *rx_tlv_hdr)
  905. {
  906. qdf_nbuf_t parent, frag_list, next = NULL;
  907. uint16_t frag_list_len = 0;
  908. uint16_t mpdu_len;
  909. bool last_nbuf;
  910. mpdu_len = hal_rx_msdu_start_msdu_len_get(rx_tlv_hdr);
  911. /*
  912. * this is a case where the complete msdu fits in one single nbuf.
  913. * in this case HW sets both start and end bit and we only need to
  914. * reset these bits for RAW mode simulator to decap the pkt
  915. */
  916. if (qdf_nbuf_is_rx_chfrag_start(nbuf) &&
  917. qdf_nbuf_is_rx_chfrag_end(nbuf)) {
  918. qdf_nbuf_set_pktlen(nbuf, mpdu_len + RX_PKT_TLVS_LEN);
  919. qdf_nbuf_pull_head(nbuf, RX_PKT_TLVS_LEN);
  920. return nbuf;
  921. }
  922. /*
  923. * This is a case where we have multiple msdus (A-MSDU) spread across
  924. * multiple nbufs. here we create a fraglist out of these nbufs.
  925. *
  926. * the moment we encounter a nbuf with continuation bit set we
  927. * know for sure we have an MSDU which is spread across multiple
  928. * nbufs. We loop through and reap nbufs till we reach last nbuf.
  929. */
  930. parent = nbuf;
  931. frag_list = nbuf->next;
  932. nbuf = nbuf->next;
  933. /*
  934. * set the start bit in the first nbuf we encounter with continuation
  935. * bit set. This has the proper mpdu length set as it is the first
  936. * msdu of the mpdu. this becomes the parent nbuf and the subsequent
  937. * nbufs will form the frag_list of the parent nbuf.
  938. */
  939. qdf_nbuf_set_rx_chfrag_start(parent, 1);
  940. last_nbuf = dp_rx_adjust_nbuf_len(parent, &mpdu_len);
  941. /*
  942. * this is where we set the length of the fragments which are
  943. * associated to the parent nbuf. We iterate through the frag_list
  944. * till we hit the last_nbuf of the list.
  945. */
  946. do {
  947. last_nbuf = dp_rx_adjust_nbuf_len(nbuf, &mpdu_len);
  948. qdf_nbuf_pull_head(nbuf, RX_PKT_TLVS_LEN);
  949. frag_list_len += qdf_nbuf_len(nbuf);
  950. if (last_nbuf) {
  951. next = nbuf->next;
  952. nbuf->next = NULL;
  953. break;
  954. }
  955. nbuf = nbuf->next;
  956. } while (!last_nbuf);
  957. qdf_nbuf_set_rx_chfrag_start(nbuf, 0);
  958. qdf_nbuf_append_ext_list(parent, frag_list, frag_list_len);
  959. parent->next = next;
  960. qdf_nbuf_pull_head(parent, RX_PKT_TLVS_LEN);
  961. return parent;
  962. }
  963. /**
  964. * dp_rx_compute_delay() - Compute and fill in all timestamps
  965. * to pass in correct fields
  966. *
  967. * @vdev: pdev handle
  968. * @tx_desc: tx descriptor
  969. * @tid: tid value
  970. * Return: none
  971. */
  972. void dp_rx_compute_delay(struct dp_vdev *vdev, qdf_nbuf_t nbuf)
  973. {
  974. uint8_t ring_id = QDF_NBUF_CB_RX_CTX_ID(nbuf);
  975. int64_t current_ts = qdf_ktime_to_ms(qdf_ktime_get());
  976. uint32_t to_stack = qdf_nbuf_get_timedelta_ms(nbuf);
  977. uint8_t tid = qdf_nbuf_get_tid_val(nbuf);
  978. uint32_t interframe_delay =
  979. (uint32_t)(current_ts - vdev->prev_rx_deliver_tstamp);
  980. dp_update_delay_stats(vdev->pdev, to_stack, tid,
  981. CDP_DELAY_STATS_REAP_STACK, ring_id);
  982. /*
  983. * Update interframe delay stats calculated at deliver_data_ol point.
  984. * Value of vdev->prev_rx_deliver_tstamp will be 0 for 1st frame, so
  985. * interframe delay will not be calculate correctly for 1st frame.
  986. * On the other side, this will help in avoiding extra per packet check
  987. * of vdev->prev_rx_deliver_tstamp.
  988. */
  989. dp_update_delay_stats(vdev->pdev, interframe_delay, tid,
  990. CDP_DELAY_STATS_RX_INTERFRAME, ring_id);
  991. vdev->prev_rx_deliver_tstamp = current_ts;
  992. }
  993. /**
  994. * dp_rx_drop_nbuf_list() - drop an nbuf list
  995. * @pdev: dp pdev reference
  996. * @buf_list: buffer list to be dropepd
  997. *
  998. * Return: int (number of bufs dropped)
  999. */
  1000. static inline int dp_rx_drop_nbuf_list(struct dp_pdev *pdev,
  1001. qdf_nbuf_t buf_list)
  1002. {
  1003. struct cdp_tid_rx_stats *stats = NULL;
  1004. uint8_t tid = 0, ring_id = 0;
  1005. int num_dropped = 0;
  1006. qdf_nbuf_t buf, next_buf;
  1007. buf = buf_list;
  1008. while (buf) {
  1009. ring_id = QDF_NBUF_CB_RX_CTX_ID(buf);
  1010. next_buf = qdf_nbuf_queue_next(buf);
  1011. tid = qdf_nbuf_get_tid_val(buf);
  1012. stats = &pdev->stats.tid_stats.tid_rx_stats[ring_id][tid];
  1013. stats->fail_cnt[INVALID_PEER_VDEV]++;
  1014. stats->delivered_to_stack--;
  1015. qdf_nbuf_free(buf);
  1016. buf = next_buf;
  1017. num_dropped++;
  1018. }
  1019. return num_dropped;
  1020. }
  1021. #ifdef PEER_CACHE_RX_PKTS
  1022. /**
  1023. * dp_rx_flush_rx_cached() - flush cached rx frames
  1024. * @peer: peer
  1025. * @drop: flag to drop frames or forward to net stack
  1026. *
  1027. * Return: None
  1028. */
  1029. void dp_rx_flush_rx_cached(struct dp_peer *peer, bool drop)
  1030. {
  1031. struct dp_peer_cached_bufq *bufqi;
  1032. struct dp_rx_cached_buf *cache_buf = NULL;
  1033. ol_txrx_rx_fp data_rx = NULL;
  1034. int num_buff_elem;
  1035. QDF_STATUS status;
  1036. if (qdf_atomic_inc_return(&peer->flush_in_progress) > 1) {
  1037. qdf_atomic_dec(&peer->flush_in_progress);
  1038. return;
  1039. }
  1040. qdf_spin_lock_bh(&peer->peer_info_lock);
  1041. if (peer->state >= OL_TXRX_PEER_STATE_CONN && peer->vdev->osif_rx)
  1042. data_rx = peer->vdev->osif_rx;
  1043. else
  1044. drop = true;
  1045. qdf_spin_unlock_bh(&peer->peer_info_lock);
  1046. bufqi = &peer->bufq_info;
  1047. qdf_spin_lock_bh(&bufqi->bufq_lock);
  1048. qdf_list_remove_front(&bufqi->cached_bufq,
  1049. (qdf_list_node_t **)&cache_buf);
  1050. while (cache_buf) {
  1051. num_buff_elem = QDF_NBUF_CB_RX_NUM_ELEMENTS_IN_LIST(
  1052. cache_buf->buf);
  1053. bufqi->entries -= num_buff_elem;
  1054. qdf_spin_unlock_bh(&bufqi->bufq_lock);
  1055. if (drop) {
  1056. bufqi->dropped = dp_rx_drop_nbuf_list(peer->vdev->pdev,
  1057. cache_buf->buf);
  1058. } else {
  1059. /* Flush the cached frames to OSIF DEV */
  1060. status = data_rx(peer->vdev->osif_vdev, cache_buf->buf);
  1061. if (status != QDF_STATUS_SUCCESS)
  1062. bufqi->dropped = dp_rx_drop_nbuf_list(
  1063. peer->vdev->pdev,
  1064. cache_buf->buf);
  1065. }
  1066. qdf_mem_free(cache_buf);
  1067. cache_buf = NULL;
  1068. qdf_spin_lock_bh(&bufqi->bufq_lock);
  1069. qdf_list_remove_front(&bufqi->cached_bufq,
  1070. (qdf_list_node_t **)&cache_buf);
  1071. }
  1072. qdf_spin_unlock_bh(&bufqi->bufq_lock);
  1073. qdf_atomic_dec(&peer->flush_in_progress);
  1074. }
  1075. /**
  1076. * dp_rx_enqueue_rx() - cache rx frames
  1077. * @peer: peer
  1078. * @rx_buf_list: cache buffer list
  1079. *
  1080. * Return: None
  1081. */
  1082. static QDF_STATUS
  1083. dp_rx_enqueue_rx(struct dp_peer *peer, qdf_nbuf_t rx_buf_list)
  1084. {
  1085. struct dp_rx_cached_buf *cache_buf;
  1086. struct dp_peer_cached_bufq *bufqi = &peer->bufq_info;
  1087. int num_buff_elem;
  1088. QDF_TRACE_DEBUG_RL(QDF_MODULE_ID_TXRX, "bufq->curr %d bufq->drops %d",
  1089. bufqi->entries, bufqi->dropped);
  1090. if (!peer->valid) {
  1091. bufqi->dropped = dp_rx_drop_nbuf_list(peer->vdev->pdev,
  1092. rx_buf_list);
  1093. return QDF_STATUS_E_INVAL;
  1094. }
  1095. qdf_spin_lock_bh(&bufqi->bufq_lock);
  1096. if (bufqi->entries >= bufqi->thresh) {
  1097. bufqi->dropped = dp_rx_drop_nbuf_list(peer->vdev->pdev,
  1098. rx_buf_list);
  1099. qdf_spin_unlock_bh(&bufqi->bufq_lock);
  1100. return QDF_STATUS_E_RESOURCES;
  1101. }
  1102. qdf_spin_unlock_bh(&bufqi->bufq_lock);
  1103. num_buff_elem = QDF_NBUF_CB_RX_NUM_ELEMENTS_IN_LIST(rx_buf_list);
  1104. cache_buf = qdf_mem_malloc_atomic(sizeof(*cache_buf));
  1105. if (!cache_buf) {
  1106. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1107. "Failed to allocate buf to cache rx frames");
  1108. bufqi->dropped = dp_rx_drop_nbuf_list(peer->vdev->pdev,
  1109. rx_buf_list);
  1110. return QDF_STATUS_E_NOMEM;
  1111. }
  1112. cache_buf->buf = rx_buf_list;
  1113. qdf_spin_lock_bh(&bufqi->bufq_lock);
  1114. qdf_list_insert_back(&bufqi->cached_bufq,
  1115. &cache_buf->node);
  1116. bufqi->entries += num_buff_elem;
  1117. qdf_spin_unlock_bh(&bufqi->bufq_lock);
  1118. return QDF_STATUS_SUCCESS;
  1119. }
  1120. static inline
  1121. bool dp_rx_is_peer_cache_bufq_supported(void)
  1122. {
  1123. return true;
  1124. }
  1125. #else
  1126. static inline
  1127. bool dp_rx_is_peer_cache_bufq_supported(void)
  1128. {
  1129. return false;
  1130. }
  1131. static inline QDF_STATUS
  1132. dp_rx_enqueue_rx(struct dp_peer *peer, qdf_nbuf_t rx_buf_list)
  1133. {
  1134. return QDF_STATUS_SUCCESS;
  1135. }
  1136. #endif
  1137. static inline void dp_rx_deliver_to_stack(struct dp_vdev *vdev,
  1138. struct dp_peer *peer,
  1139. qdf_nbuf_t nbuf_head,
  1140. qdf_nbuf_t nbuf_tail)
  1141. {
  1142. /*
  1143. * highly unlikely to have a vdev without a registered rx
  1144. * callback function. if so let us free the nbuf_list.
  1145. */
  1146. if (qdf_unlikely(!vdev->osif_rx)) {
  1147. if (dp_rx_is_peer_cache_bufq_supported())
  1148. dp_rx_enqueue_rx(peer, nbuf_head);
  1149. else
  1150. dp_rx_drop_nbuf_list(vdev->pdev, nbuf_head);
  1151. return;
  1152. }
  1153. if (qdf_unlikely(vdev->rx_decap_type == htt_cmn_pkt_type_raw) ||
  1154. (vdev->rx_decap_type == htt_cmn_pkt_type_native_wifi)) {
  1155. vdev->osif_rsim_rx_decap(vdev->osif_vdev, &nbuf_head,
  1156. &nbuf_tail, peer->mac_addr.raw);
  1157. }
  1158. vdev->osif_rx(vdev->osif_vdev, nbuf_head);
  1159. }
  1160. /**
  1161. * dp_rx_cksum_offload() - set the nbuf checksum as defined by hardware.
  1162. * @nbuf: pointer to the first msdu of an amsdu.
  1163. * @rx_tlv_hdr: pointer to the start of RX TLV headers.
  1164. *
  1165. * The ipsumed field of the skb is set based on whether HW validated the
  1166. * IP/TCP/UDP checksum.
  1167. *
  1168. * Return: void
  1169. */
  1170. static inline void dp_rx_cksum_offload(struct dp_pdev *pdev,
  1171. qdf_nbuf_t nbuf,
  1172. uint8_t *rx_tlv_hdr)
  1173. {
  1174. qdf_nbuf_rx_cksum_t cksum = {0};
  1175. bool ip_csum_err = hal_rx_attn_ip_cksum_fail_get(rx_tlv_hdr);
  1176. bool tcp_udp_csum_er = hal_rx_attn_tcp_udp_cksum_fail_get(rx_tlv_hdr);
  1177. if (qdf_likely(!ip_csum_err && !tcp_udp_csum_er)) {
  1178. cksum.l4_result = QDF_NBUF_RX_CKSUM_TCP_UDP_UNNECESSARY;
  1179. qdf_nbuf_set_rx_cksum(nbuf, &cksum);
  1180. } else {
  1181. DP_STATS_INCC(pdev, err.ip_csum_err, 1, ip_csum_err);
  1182. DP_STATS_INCC(pdev, err.tcp_udp_csum_err, 1, tcp_udp_csum_er);
  1183. }
  1184. }
  1185. /**
  1186. * dp_rx_msdu_stats_update() - update per msdu stats.
  1187. * @soc: core txrx main context
  1188. * @nbuf: pointer to the first msdu of an amsdu.
  1189. * @rx_tlv_hdr: pointer to the start of RX TLV headers.
  1190. * @peer: pointer to the peer object.
  1191. * @ring_id: reo dest ring number on which pkt is reaped.
  1192. * @tid_stats: per tid rx stats.
  1193. *
  1194. * update all the per msdu stats for that nbuf.
  1195. * Return: void
  1196. */
  1197. static void dp_rx_msdu_stats_update(struct dp_soc *soc,
  1198. qdf_nbuf_t nbuf,
  1199. uint8_t *rx_tlv_hdr,
  1200. struct dp_peer *peer,
  1201. uint8_t ring_id,
  1202. struct cdp_tid_rx_stats *tid_stats)
  1203. {
  1204. bool is_ampdu, is_not_amsdu;
  1205. uint32_t sgi, mcs, tid, nss, bw, reception_type, pkt_type;
  1206. struct dp_vdev *vdev = peer->vdev;
  1207. qdf_ether_header_t *eh;
  1208. uint16_t msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  1209. is_not_amsdu = qdf_nbuf_is_rx_chfrag_start(nbuf) &
  1210. qdf_nbuf_is_rx_chfrag_end(nbuf);
  1211. DP_STATS_INC_PKT(peer, rx.rcvd_reo[ring_id], 1, msdu_len);
  1212. DP_STATS_INCC(peer, rx.non_amsdu_cnt, 1, is_not_amsdu);
  1213. DP_STATS_INCC(peer, rx.amsdu_cnt, 1, !is_not_amsdu);
  1214. DP_STATS_INCC(peer, rx.rx_retries, 1, qdf_nbuf_is_rx_retry_flag(nbuf));
  1215. tid_stats->msdu_cnt++;
  1216. if (qdf_unlikely(qdf_nbuf_is_da_mcbc(nbuf) &&
  1217. (vdev->rx_decap_type == htt_cmn_pkt_type_ethernet))) {
  1218. eh = (qdf_ether_header_t *)qdf_nbuf_data(nbuf);
  1219. DP_STATS_INC_PKT(peer, rx.multicast, 1, msdu_len);
  1220. tid_stats->mcast_msdu_cnt++;
  1221. if (QDF_IS_ADDR_BROADCAST(eh->ether_dhost)) {
  1222. DP_STATS_INC_PKT(peer, rx.bcast, 1, msdu_len);
  1223. tid_stats->bcast_msdu_cnt++;
  1224. }
  1225. }
  1226. /*
  1227. * currently we can return from here as we have similar stats
  1228. * updated at per ppdu level instead of msdu level
  1229. */
  1230. if (!soc->process_rx_status)
  1231. return;
  1232. is_ampdu = hal_rx_mpdu_info_ampdu_flag_get(rx_tlv_hdr);
  1233. DP_STATS_INCC(peer, rx.ampdu_cnt, 1, is_ampdu);
  1234. DP_STATS_INCC(peer, rx.non_ampdu_cnt, 1, !(is_ampdu));
  1235. sgi = hal_rx_msdu_start_sgi_get(rx_tlv_hdr);
  1236. mcs = hal_rx_msdu_start_rate_mcs_get(rx_tlv_hdr);
  1237. tid = qdf_nbuf_get_tid_val(nbuf);
  1238. bw = hal_rx_msdu_start_bw_get(rx_tlv_hdr);
  1239. reception_type = hal_rx_msdu_start_reception_type_get(soc->hal_soc,
  1240. rx_tlv_hdr);
  1241. nss = hal_rx_msdu_start_nss_get(soc->hal_soc, rx_tlv_hdr);
  1242. pkt_type = hal_rx_msdu_start_get_pkt_type(rx_tlv_hdr);
  1243. DP_STATS_INC(peer, rx.bw[bw], 1);
  1244. /*
  1245. * only if nss > 0 and pkt_type is 11N/AC/AX,
  1246. * then increase index [nss - 1] in array counter.
  1247. */
  1248. if (nss > 0 && (pkt_type == DOT11_N ||
  1249. pkt_type == DOT11_AC ||
  1250. pkt_type == DOT11_AX))
  1251. DP_STATS_INC(peer, rx.nss[nss - 1], 1);
  1252. DP_STATS_INC(peer, rx.sgi_count[sgi], 1);
  1253. DP_STATS_INCC(peer, rx.err.mic_err, 1,
  1254. hal_rx_mpdu_end_mic_err_get(rx_tlv_hdr));
  1255. DP_STATS_INCC(peer, rx.err.decrypt_err, 1,
  1256. hal_rx_mpdu_end_decrypt_err_get(rx_tlv_hdr));
  1257. DP_STATS_INC(peer, rx.wme_ac_type[TID_TO_WME_AC(tid)], 1);
  1258. DP_STATS_INC(peer, rx.reception_type[reception_type], 1);
  1259. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[MAX_MCS - 1], 1,
  1260. ((mcs >= MAX_MCS_11A) && (pkt_type == DOT11_A)));
  1261. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[mcs], 1,
  1262. ((mcs <= MAX_MCS_11A) && (pkt_type == DOT11_A)));
  1263. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[MAX_MCS - 1], 1,
  1264. ((mcs >= MAX_MCS_11B) && (pkt_type == DOT11_B)));
  1265. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[mcs], 1,
  1266. ((mcs <= MAX_MCS_11B) && (pkt_type == DOT11_B)));
  1267. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[MAX_MCS - 1], 1,
  1268. ((mcs >= MAX_MCS_11A) && (pkt_type == DOT11_N)));
  1269. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[mcs], 1,
  1270. ((mcs <= MAX_MCS_11A) && (pkt_type == DOT11_N)));
  1271. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[MAX_MCS - 1], 1,
  1272. ((mcs >= MAX_MCS_11AC) && (pkt_type == DOT11_AC)));
  1273. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[mcs], 1,
  1274. ((mcs <= MAX_MCS_11AC) && (pkt_type == DOT11_AC)));
  1275. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[MAX_MCS - 1], 1,
  1276. ((mcs >= MAX_MCS) && (pkt_type == DOT11_AX)));
  1277. DP_STATS_INCC(peer, rx.pkt_type[pkt_type].mcs_count[mcs], 1,
  1278. ((mcs < MAX_MCS) && (pkt_type == DOT11_AX)));
  1279. if ((soc->process_rx_status) &&
  1280. hal_rx_attn_first_mpdu_get(rx_tlv_hdr)) {
  1281. #if defined(FEATURE_PERPKT_INFO) && WDI_EVENT_ENABLE
  1282. if (!vdev->pdev)
  1283. return;
  1284. dp_wdi_event_handler(WDI_EVENT_UPDATE_DP_STATS, vdev->pdev->soc,
  1285. &peer->stats, peer->peer_ids[0],
  1286. UPDATE_PEER_STATS,
  1287. vdev->pdev->pdev_id);
  1288. #endif
  1289. }
  1290. }
  1291. static inline bool is_sa_da_idx_valid(struct dp_soc *soc,
  1292. uint8_t *rx_tlv_hdr,
  1293. qdf_nbuf_t nbuf)
  1294. {
  1295. if ((qdf_nbuf_is_sa_valid(nbuf) &&
  1296. (hal_rx_msdu_end_sa_idx_get(soc->hal_soc, rx_tlv_hdr) >
  1297. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx))) ||
  1298. (!qdf_nbuf_is_da_mcbc(nbuf) &&
  1299. qdf_nbuf_is_da_valid(nbuf) &&
  1300. (hal_rx_msdu_end_da_idx_get(soc->hal_soc, rx_tlv_hdr) >
  1301. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx))))
  1302. return false;
  1303. return true;
  1304. }
  1305. #ifndef WDS_VENDOR_EXTENSION
  1306. int dp_wds_rx_policy_check(uint8_t *rx_tlv_hdr,
  1307. struct dp_vdev *vdev,
  1308. struct dp_peer *peer)
  1309. {
  1310. return 1;
  1311. }
  1312. #endif
  1313. #ifdef RX_DESC_DEBUG_CHECK
  1314. /**
  1315. * dp_rx_desc_nbuf_sanity_check - Add sanity check to catch REO rx_desc paddr
  1316. * corruption
  1317. *
  1318. * @ring_desc: REO ring descriptor
  1319. * @rx_desc: Rx descriptor
  1320. *
  1321. * Return: NONE
  1322. */
  1323. static inline
  1324. void dp_rx_desc_nbuf_sanity_check(hal_ring_desc_t ring_desc,
  1325. struct dp_rx_desc *rx_desc)
  1326. {
  1327. struct hal_buf_info hbi;
  1328. hal_rx_reo_buf_paddr_get(ring_desc, &hbi);
  1329. /* Sanity check for possible buffer paddr corruption */
  1330. qdf_assert_always((&hbi)->paddr ==
  1331. qdf_nbuf_get_frag_paddr(rx_desc->nbuf, 0));
  1332. }
  1333. #else
  1334. static inline
  1335. void dp_rx_desc_nbuf_sanity_check(hal_ring_desc_t ring_desc,
  1336. struct dp_rx_desc *rx_desc)
  1337. {
  1338. }
  1339. #endif
  1340. #ifdef WLAN_FEATURE_RX_SOFTIRQ_TIME_LIMIT
  1341. static inline
  1342. bool dp_rx_reap_loop_pkt_limit_hit(struct dp_soc *soc, int num_reaped)
  1343. {
  1344. bool limit_hit = false;
  1345. struct wlan_cfg_dp_soc_ctxt *cfg = soc->wlan_cfg_ctx;
  1346. limit_hit =
  1347. (num_reaped >= cfg->rx_reap_loop_pkt_limit) ? true : false;
  1348. if (limit_hit)
  1349. DP_STATS_INC(soc, rx.reap_loop_pkt_limit_hit, 1)
  1350. return limit_hit;
  1351. }
  1352. static inline bool dp_rx_enable_eol_data_check(struct dp_soc *soc)
  1353. {
  1354. return soc->wlan_cfg_ctx->rx_enable_eol_data_check;
  1355. }
  1356. #else
  1357. static inline
  1358. bool dp_rx_reap_loop_pkt_limit_hit(struct dp_soc *soc, int num_reaped)
  1359. {
  1360. return false;
  1361. }
  1362. static inline bool dp_rx_enable_eol_data_check(struct dp_soc *soc)
  1363. {
  1364. return false;
  1365. }
  1366. #endif /* WLAN_FEATURE_RX_SOFTIRQ_TIME_LIMIT */
  1367. /**
  1368. * dp_is_special_data() - check is the pkt special like eapol, dhcp, etc
  1369. *
  1370. * @nbuf: pkt skb pointer
  1371. *
  1372. * Return: true if matched, false if not
  1373. */
  1374. static inline
  1375. bool dp_is_special_data(qdf_nbuf_t nbuf)
  1376. {
  1377. if (qdf_nbuf_is_ipv4_arp_pkt(nbuf) ||
  1378. qdf_nbuf_is_ipv4_dhcp_pkt(nbuf) ||
  1379. qdf_nbuf_is_ipv4_eapol_pkt(nbuf) ||
  1380. qdf_nbuf_is_ipv6_dhcp_pkt(nbuf))
  1381. return true;
  1382. else
  1383. return false;
  1384. }
  1385. #ifdef DP_RX_PKT_NO_PEER_DELIVER
  1386. /**
  1387. * dp_rx_deliver_to_stack_no_peer() - try deliver rx data even if
  1388. * no corresbonding peer found
  1389. * @soc: core txrx main context
  1390. * @nbuf: pkt skb pointer
  1391. *
  1392. * This function will try to deliver some RX special frames to stack
  1393. * even there is no peer matched found. for instance, LFR case, some
  1394. * eapol data will be sent to host before peer_map done.
  1395. *
  1396. * Return: None
  1397. */
  1398. static inline
  1399. void dp_rx_deliver_to_stack_no_peer(struct dp_soc *soc, qdf_nbuf_t nbuf)
  1400. {
  1401. uint16_t peer_id;
  1402. uint8_t vdev_id;
  1403. struct dp_vdev *vdev;
  1404. uint32_t l2_hdr_offset = 0;
  1405. uint16_t msdu_len = 0;
  1406. uint32_t pkt_len = 0;
  1407. uint8_t *rx_tlv_hdr;
  1408. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  1409. if (peer_id > soc->max_peers)
  1410. goto deliver_fail;
  1411. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  1412. vdev = dp_get_vdev_from_soc_vdev_id_wifi3(soc, vdev_id);
  1413. if (!vdev || !vdev->osif_rx)
  1414. goto deliver_fail;
  1415. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  1416. l2_hdr_offset =
  1417. hal_rx_msdu_end_l3_hdr_padding_get(soc->hal_soc, rx_tlv_hdr);
  1418. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  1419. pkt_len = msdu_len + l2_hdr_offset + RX_PKT_TLVS_LEN;
  1420. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  1421. qdf_nbuf_pull_head(nbuf, RX_PKT_TLVS_LEN);
  1422. } else {
  1423. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  1424. qdf_nbuf_pull_head(nbuf,
  1425. RX_PKT_TLVS_LEN +
  1426. l2_hdr_offset);
  1427. }
  1428. /* only allow special frames */
  1429. if (!dp_is_special_data(nbuf))
  1430. goto deliver_fail;
  1431. vdev->osif_rx(vdev->osif_vdev, nbuf);
  1432. DP_STATS_INC(soc, rx.err.pkt_delivered_no_peer, 1);
  1433. return;
  1434. deliver_fail:
  1435. DP_STATS_INC_PKT(soc, rx.err.rx_invalid_peer, 1,
  1436. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  1437. qdf_nbuf_free(nbuf);
  1438. }
  1439. #else
  1440. static inline
  1441. void dp_rx_deliver_to_stack_no_peer(struct dp_soc *soc, qdf_nbuf_t nbuf)
  1442. {
  1443. DP_STATS_INC_PKT(soc, rx.err.rx_invalid_peer, 1,
  1444. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  1445. qdf_nbuf_free(nbuf);
  1446. }
  1447. #endif
  1448. /**
  1449. * dp_rx_srng_get_num_pending() - get number of pending entries
  1450. * @hal_soc: hal soc opaque pointer
  1451. * @hal_ring: opaque pointer to the HAL Rx Ring
  1452. * @num_entries: number of entries in the hal_ring.
  1453. * @near_full: pointer to a boolean. This is set if ring is near full.
  1454. *
  1455. * The function returns the number of entries in a destination ring which are
  1456. * yet to be reaped. The function also checks if the ring is near full.
  1457. * If more than half of the ring needs to be reaped, the ring is considered
  1458. * approaching full.
  1459. * The function useses hal_srng_dst_num_valid_locked to get the number of valid
  1460. * entries. It should not be called within a SRNG lock. HW pointer value is
  1461. * synced into cached_hp.
  1462. *
  1463. * Return: Number of pending entries if any
  1464. */
  1465. static
  1466. uint32_t dp_rx_srng_get_num_pending(hal_soc_handle_t hal_soc,
  1467. hal_ring_handle_t hal_ring_hdl,
  1468. uint32_t num_entries,
  1469. bool *near_full)
  1470. {
  1471. uint32_t num_pending = 0;
  1472. num_pending = hal_srng_dst_num_valid_locked(hal_soc,
  1473. hal_ring_hdl,
  1474. true);
  1475. if (num_entries && (num_pending >= num_entries >> 1))
  1476. *near_full = true;
  1477. else
  1478. *near_full = false;
  1479. return num_pending;
  1480. }
  1481. /**
  1482. * dp_rx_process() - Brain of the Rx processing functionality
  1483. * Called from the bottom half (tasklet/NET_RX_SOFTIRQ)
  1484. * @int_ctx: per interrupt context
  1485. * @hal_ring: opaque pointer to the HAL Rx Ring, which will be serviced
  1486. * @reo_ring_num: ring number (0, 1, 2 or 3) of the reo ring.
  1487. * @quota: No. of units (packets) that can be serviced in one shot.
  1488. *
  1489. * This function implements the core of Rx functionality. This is
  1490. * expected to handle only non-error frames.
  1491. *
  1492. * Return: uint32_t: No. of elements processed
  1493. */
  1494. uint32_t dp_rx_process(struct dp_intr *int_ctx, hal_ring_handle_t hal_ring_hdl,
  1495. uint8_t reo_ring_num, uint32_t quota)
  1496. {
  1497. hal_ring_desc_t ring_desc;
  1498. hal_soc_handle_t hal_soc;
  1499. struct dp_rx_desc *rx_desc = NULL;
  1500. qdf_nbuf_t nbuf, next;
  1501. bool near_full;
  1502. union dp_rx_desc_list_elem_t *head[MAX_PDEV_CNT];
  1503. union dp_rx_desc_list_elem_t *tail[MAX_PDEV_CNT];
  1504. uint32_t num_pending;
  1505. uint32_t rx_bufs_used = 0, rx_buf_cookie;
  1506. uint32_t l2_hdr_offset = 0;
  1507. uint16_t msdu_len = 0;
  1508. uint16_t peer_id;
  1509. uint8_t vdev_id;
  1510. struct dp_peer *peer;
  1511. struct dp_vdev *vdev;
  1512. uint32_t pkt_len = 0;
  1513. struct hal_rx_mpdu_desc_info mpdu_desc_info;
  1514. struct hal_rx_msdu_desc_info msdu_desc_info;
  1515. enum hal_reo_error_status error;
  1516. uint32_t peer_mdata;
  1517. uint8_t *rx_tlv_hdr;
  1518. uint32_t rx_bufs_reaped[MAX_PDEV_CNT];
  1519. uint8_t mac_id = 0;
  1520. struct dp_pdev *rx_pdev;
  1521. struct dp_srng *dp_rxdma_srng;
  1522. struct rx_desc_pool *rx_desc_pool;
  1523. struct dp_soc *soc = int_ctx->soc;
  1524. uint8_t ring_id = 0;
  1525. uint8_t core_id = 0;
  1526. struct cdp_tid_rx_stats *tid_stats;
  1527. qdf_nbuf_t nbuf_head;
  1528. qdf_nbuf_t nbuf_tail;
  1529. qdf_nbuf_t deliver_list_head;
  1530. qdf_nbuf_t deliver_list_tail;
  1531. uint32_t num_rx_bufs_reaped = 0;
  1532. uint32_t intr_id;
  1533. struct hif_opaque_softc *scn;
  1534. int32_t tid = 0;
  1535. bool is_prev_msdu_last = true;
  1536. uint32_t num_entries_avail = 0;
  1537. uint32_t rx_ol_pkt_cnt = 0;
  1538. uint32_t num_entries = 0;
  1539. DP_HIST_INIT();
  1540. qdf_assert_always(soc && hal_ring_hdl);
  1541. hal_soc = soc->hal_soc;
  1542. qdf_assert_always(hal_soc);
  1543. scn = soc->hif_handle;
  1544. hif_pm_runtime_mark_dp_rx_busy(scn);
  1545. intr_id = int_ctx->dp_intr_id;
  1546. num_entries = hal_srng_get_num_entries(hal_soc, hal_ring_hdl);
  1547. more_data:
  1548. /* reset local variables here to be re-used in the function */
  1549. nbuf_head = NULL;
  1550. nbuf_tail = NULL;
  1551. deliver_list_head = NULL;
  1552. deliver_list_tail = NULL;
  1553. peer = NULL;
  1554. vdev = NULL;
  1555. num_rx_bufs_reaped = 0;
  1556. qdf_mem_zero(rx_bufs_reaped, sizeof(rx_bufs_reaped));
  1557. qdf_mem_zero(&mpdu_desc_info, sizeof(mpdu_desc_info));
  1558. qdf_mem_zero(&msdu_desc_info, sizeof(msdu_desc_info));
  1559. qdf_mem_zero(head, sizeof(head));
  1560. qdf_mem_zero(tail, sizeof(tail));
  1561. if (qdf_unlikely(dp_srng_access_start(int_ctx, soc, hal_ring_hdl))) {
  1562. /*
  1563. * Need API to convert from hal_ring pointer to
  1564. * Ring Type / Ring Id combo
  1565. */
  1566. DP_STATS_INC(soc, rx.err.hal_ring_access_fail, 1);
  1567. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1568. FL("HAL RING Access Failed -- %pK"), hal_ring_hdl);
  1569. goto done;
  1570. }
  1571. /*
  1572. * start reaping the buffers from reo ring and queue
  1573. * them in per vdev queue.
  1574. * Process the received pkts in a different per vdev loop.
  1575. */
  1576. while (qdf_likely(quota &&
  1577. (ring_desc = hal_srng_dst_peek(hal_soc,
  1578. hal_ring_hdl)))) {
  1579. error = HAL_RX_ERROR_STATUS_GET(ring_desc);
  1580. ring_id = hal_srng_ring_id_get(hal_ring_hdl);
  1581. if (qdf_unlikely(error == HAL_REO_ERROR_DETECTED)) {
  1582. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  1583. FL("HAL RING 0x%pK:error %d"), hal_ring_hdl, error);
  1584. DP_STATS_INC(soc, rx.err.hal_reo_error[ring_id], 1);
  1585. /* Don't know how to deal with this -- assert */
  1586. qdf_assert(0);
  1587. }
  1588. rx_buf_cookie = HAL_RX_REO_BUF_COOKIE_GET(ring_desc);
  1589. rx_desc = dp_rx_cookie_2_va_rxdma_buf(soc, rx_buf_cookie);
  1590. qdf_assert(rx_desc);
  1591. /*
  1592. * this is a unlikely scenario where the host is reaping
  1593. * a descriptor which it already reaped just a while ago
  1594. * but is yet to replenish it back to HW.
  1595. * In this case host will dump the last 128 descriptors
  1596. * including the software descriptor rx_desc and assert.
  1597. */
  1598. if (qdf_unlikely(!rx_desc->in_use)) {
  1599. DP_STATS_INC(soc, rx.err.hal_reo_dest_dup, 1);
  1600. dp_info_rl("Reaping rx_desc not in use!");
  1601. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  1602. ring_desc, rx_desc);
  1603. /* ignore duplicate RX desc and continue to process */
  1604. /* Pop out the descriptor */
  1605. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  1606. continue;
  1607. }
  1608. if (qdf_unlikely(!dp_rx_desc_check_magic(rx_desc))) {
  1609. dp_err("Invalid rx_desc cookie=%d", rx_buf_cookie);
  1610. DP_STATS_INC(soc, rx.err.rx_desc_invalid_magic, 1);
  1611. dp_rx_dump_info_and_assert(soc, hal_ring_hdl,
  1612. ring_desc, rx_desc);
  1613. }
  1614. dp_rx_desc_nbuf_sanity_check(ring_desc, rx_desc);
  1615. /* TODO */
  1616. /*
  1617. * Need a separate API for unmapping based on
  1618. * phyiscal address
  1619. */
  1620. qdf_nbuf_unmap_single(soc->osdev, rx_desc->nbuf,
  1621. QDF_DMA_FROM_DEVICE);
  1622. rx_desc->unmapped = 1;
  1623. core_id = smp_processor_id();
  1624. DP_STATS_INC(soc, rx.ring_packets[core_id][ring_id], 1);
  1625. /* Get MPDU DESC info */
  1626. hal_rx_mpdu_desc_info_get(ring_desc, &mpdu_desc_info);
  1627. /* Get MSDU DESC info */
  1628. hal_rx_msdu_desc_info_get(ring_desc, &msdu_desc_info);
  1629. if (mpdu_desc_info.mpdu_flags & HAL_MPDU_F_RETRY_BIT)
  1630. qdf_nbuf_set_rx_retry_flag(rx_desc->nbuf, 1);
  1631. if (qdf_unlikely(mpdu_desc_info.mpdu_flags &
  1632. HAL_MPDU_F_RAW_AMPDU)) {
  1633. /* previous msdu has end bit set, so current one is
  1634. * the new MPDU
  1635. */
  1636. if (is_prev_msdu_last) {
  1637. is_prev_msdu_last = false;
  1638. /* Get number of entries available in HW ring */
  1639. num_entries_avail =
  1640. hal_srng_dst_num_valid(hal_soc,
  1641. hal_ring_hdl, 1);
  1642. /* For new MPDU check if we can read complete
  1643. * MPDU by comparing the number of buffers
  1644. * available and number of buffers needed to
  1645. * reap this MPDU
  1646. */
  1647. if (((msdu_desc_info.msdu_len /
  1648. (RX_BUFFER_SIZE - RX_PKT_TLVS_LEN) + 1)) >
  1649. num_entries_avail)
  1650. break;
  1651. } else {
  1652. if (msdu_desc_info.msdu_flags &
  1653. HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  1654. is_prev_msdu_last = true;
  1655. }
  1656. qdf_nbuf_set_raw_frame(rx_desc->nbuf, 1);
  1657. }
  1658. /* Pop out the descriptor*/
  1659. hal_srng_dst_get_next(hal_soc, hal_ring_hdl);
  1660. rx_bufs_reaped[rx_desc->pool_id]++;
  1661. peer_mdata = mpdu_desc_info.peer_meta_data;
  1662. QDF_NBUF_CB_RX_PEER_ID(rx_desc->nbuf) =
  1663. DP_PEER_METADATA_PEER_ID_GET(peer_mdata);
  1664. QDF_NBUF_CB_RX_VDEV_ID(rx_desc->nbuf) =
  1665. DP_PEER_METADATA_VDEV_ID_GET(peer_mdata);
  1666. /*
  1667. * save msdu flags first, last and continuation msdu in
  1668. * nbuf->cb, also save mcbc, is_da_valid, is_sa_valid and
  1669. * length to nbuf->cb. This ensures the info required for
  1670. * per pkt processing is always in the same cache line.
  1671. * This helps in improving throughput for smaller pkt
  1672. * sizes.
  1673. */
  1674. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_FIRST_MSDU_IN_MPDU)
  1675. qdf_nbuf_set_rx_chfrag_start(rx_desc->nbuf, 1);
  1676. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_MSDU_CONTINUATION)
  1677. qdf_nbuf_set_rx_chfrag_cont(rx_desc->nbuf, 1);
  1678. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_LAST_MSDU_IN_MPDU)
  1679. qdf_nbuf_set_rx_chfrag_end(rx_desc->nbuf, 1);
  1680. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_MCBC)
  1681. qdf_nbuf_set_da_mcbc(rx_desc->nbuf, 1);
  1682. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_DA_IS_VALID)
  1683. qdf_nbuf_set_da_valid(rx_desc->nbuf, 1);
  1684. if (msdu_desc_info.msdu_flags & HAL_MSDU_F_SA_IS_VALID)
  1685. qdf_nbuf_set_sa_valid(rx_desc->nbuf, 1);
  1686. qdf_nbuf_set_tid_val(rx_desc->nbuf,
  1687. HAL_RX_REO_QUEUE_NUMBER_GET(ring_desc));
  1688. QDF_NBUF_CB_RX_PKT_LEN(rx_desc->nbuf) = msdu_desc_info.msdu_len;
  1689. QDF_NBUF_CB_RX_CTX_ID(rx_desc->nbuf) = reo_ring_num;
  1690. DP_RX_LIST_APPEND(nbuf_head, nbuf_tail, rx_desc->nbuf);
  1691. /*
  1692. * if continuation bit is set then we have MSDU spread
  1693. * across multiple buffers, let us not decrement quota
  1694. * till we reap all buffers of that MSDU.
  1695. */
  1696. if (qdf_likely(!qdf_nbuf_is_rx_chfrag_cont(rx_desc->nbuf)))
  1697. quota -= 1;
  1698. dp_rx_add_to_free_desc_list(&head[rx_desc->pool_id],
  1699. &tail[rx_desc->pool_id],
  1700. rx_desc);
  1701. num_rx_bufs_reaped++;
  1702. if (dp_rx_reap_loop_pkt_limit_hit(soc, num_rx_bufs_reaped))
  1703. break;
  1704. }
  1705. done:
  1706. dp_srng_access_end(int_ctx, soc, hal_ring_hdl);
  1707. for (mac_id = 0; mac_id < MAX_PDEV_CNT; mac_id++) {
  1708. /*
  1709. * continue with next mac_id if no pkts were reaped
  1710. * from that pool
  1711. */
  1712. if (!rx_bufs_reaped[mac_id])
  1713. continue;
  1714. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_id];
  1715. rx_desc_pool = &soc->rx_desc_buf[mac_id];
  1716. dp_rx_buffers_replenish(soc, mac_id, dp_rxdma_srng,
  1717. rx_desc_pool, rx_bufs_reaped[mac_id],
  1718. &head[mac_id], &tail[mac_id]);
  1719. }
  1720. dp_verbose_debug("replenished %u\n", rx_bufs_reaped[0]);
  1721. /* Peer can be NULL is case of LFR */
  1722. if (qdf_likely(peer))
  1723. vdev = NULL;
  1724. /*
  1725. * BIG loop where each nbuf is dequeued from global queue,
  1726. * processed and queued back on a per vdev basis. These nbufs
  1727. * are sent to stack as and when we run out of nbufs
  1728. * or a new nbuf dequeued from global queue has a different
  1729. * vdev when compared to previous nbuf.
  1730. */
  1731. nbuf = nbuf_head;
  1732. while (nbuf) {
  1733. next = nbuf->next;
  1734. rx_tlv_hdr = qdf_nbuf_data(nbuf);
  1735. vdev_id = QDF_NBUF_CB_RX_VDEV_ID(nbuf);
  1736. if (deliver_list_head && vdev && (vdev->vdev_id != vdev_id)) {
  1737. dp_rx_deliver_to_stack(vdev, peer, deliver_list_head,
  1738. deliver_list_tail);
  1739. deliver_list_head = NULL;
  1740. deliver_list_tail = NULL;
  1741. }
  1742. /* Get TID from struct cb->tid_val, save to tid */
  1743. if (qdf_nbuf_is_rx_chfrag_start(nbuf))
  1744. tid = qdf_nbuf_get_tid_val(nbuf);
  1745. peer_id = QDF_NBUF_CB_RX_PEER_ID(nbuf);
  1746. peer = dp_peer_find_by_id(soc, peer_id);
  1747. if (peer) {
  1748. QDF_NBUF_CB_DP_TRACE_PRINT(nbuf) = false;
  1749. qdf_dp_trace_set_track(nbuf, QDF_RX);
  1750. QDF_NBUF_CB_RX_DP_TRACE(nbuf) = 1;
  1751. QDF_NBUF_CB_RX_PACKET_TRACK(nbuf) =
  1752. QDF_NBUF_RX_PKT_DATA_TRACK;
  1753. }
  1754. rx_bufs_used++;
  1755. if (qdf_likely(peer)) {
  1756. vdev = peer->vdev;
  1757. } else {
  1758. nbuf->next = NULL;
  1759. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  1760. nbuf = next;
  1761. continue;
  1762. }
  1763. if (qdf_unlikely(!vdev)) {
  1764. qdf_nbuf_free(nbuf);
  1765. nbuf = next;
  1766. DP_STATS_INC(soc, rx.err.invalid_vdev, 1);
  1767. dp_peer_unref_del_find_by_id(peer);
  1768. continue;
  1769. }
  1770. rx_pdev = vdev->pdev;
  1771. DP_RX_TID_SAVE(nbuf, tid);
  1772. if (qdf_unlikely(rx_pdev->delay_stats_flag))
  1773. qdf_nbuf_set_timestamp(nbuf);
  1774. ring_id = QDF_NBUF_CB_RX_CTX_ID(nbuf);
  1775. tid_stats =
  1776. &rx_pdev->stats.tid_stats.tid_rx_stats[ring_id][tid];
  1777. /*
  1778. * Check if DMA completed -- msdu_done is the last bit
  1779. * to be written
  1780. */
  1781. if (qdf_unlikely(!qdf_nbuf_is_raw_frame(nbuf) &&
  1782. !hal_rx_attn_msdu_done_get(rx_tlv_hdr))) {
  1783. dp_err("MSDU DONE failure");
  1784. DP_STATS_INC(soc, rx.err.msdu_done_fail, 1);
  1785. hal_rx_dump_pkt_tlvs(hal_soc, rx_tlv_hdr,
  1786. QDF_TRACE_LEVEL_INFO);
  1787. tid_stats->fail_cnt[MSDU_DONE_FAILURE]++;
  1788. qdf_nbuf_free(nbuf);
  1789. qdf_assert(0);
  1790. nbuf = next;
  1791. continue;
  1792. }
  1793. DP_HIST_PACKET_COUNT_INC(vdev->pdev->pdev_id);
  1794. /*
  1795. * First IF condition:
  1796. * 802.11 Fragmented pkts are reinjected to REO
  1797. * HW block as SG pkts and for these pkts we only
  1798. * need to pull the RX TLVS header length.
  1799. * Second IF condition:
  1800. * The below condition happens when an MSDU is spread
  1801. * across multiple buffers. This can happen in two cases
  1802. * 1. The nbuf size is smaller then the received msdu.
  1803. * ex: we have set the nbuf size to 2048 during
  1804. * nbuf_alloc. but we received an msdu which is
  1805. * 2304 bytes in size then this msdu is spread
  1806. * across 2 nbufs.
  1807. *
  1808. * 2. AMSDUs when RAW mode is enabled.
  1809. * ex: 1st MSDU is in 1st nbuf and 2nd MSDU is spread
  1810. * across 1st nbuf and 2nd nbuf and last MSDU is
  1811. * spread across 2nd nbuf and 3rd nbuf.
  1812. *
  1813. * for these scenarios let us create a skb frag_list and
  1814. * append these buffers till the last MSDU of the AMSDU
  1815. * Third condition:
  1816. * This is the most likely case, we receive 802.3 pkts
  1817. * decapsulated by HW, here we need to set the pkt length.
  1818. */
  1819. if (qdf_unlikely(qdf_nbuf_is_frag(nbuf))) {
  1820. bool is_mcbc, is_sa_vld, is_da_vld;
  1821. is_mcbc = hal_rx_msdu_end_da_is_mcbc_get(soc->hal_soc,
  1822. rx_tlv_hdr);
  1823. is_sa_vld =
  1824. hal_rx_msdu_end_sa_is_valid_get(soc->hal_soc,
  1825. rx_tlv_hdr);
  1826. is_da_vld =
  1827. hal_rx_msdu_end_da_is_valid_get(soc->hal_soc,
  1828. rx_tlv_hdr);
  1829. qdf_nbuf_set_da_mcbc(nbuf, is_mcbc);
  1830. qdf_nbuf_set_da_valid(nbuf, is_da_vld);
  1831. qdf_nbuf_set_sa_valid(nbuf, is_sa_vld);
  1832. qdf_nbuf_pull_head(nbuf, RX_PKT_TLVS_LEN);
  1833. } else if (qdf_nbuf_is_raw_frame(nbuf)) {
  1834. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  1835. nbuf = dp_rx_sg_create(nbuf, rx_tlv_hdr);
  1836. DP_STATS_INC(vdev->pdev, rx_raw_pkts, 1);
  1837. DP_STATS_INC_PKT(peer, rx.raw, 1, msdu_len);
  1838. next = nbuf->next;
  1839. } else {
  1840. l2_hdr_offset =
  1841. hal_rx_msdu_end_l3_hdr_padding_get(soc->hal_soc,
  1842. rx_tlv_hdr);
  1843. msdu_len = QDF_NBUF_CB_RX_PKT_LEN(nbuf);
  1844. pkt_len = msdu_len + l2_hdr_offset + RX_PKT_TLVS_LEN;
  1845. qdf_nbuf_set_pktlen(nbuf, pkt_len);
  1846. qdf_nbuf_pull_head(nbuf,
  1847. RX_PKT_TLVS_LEN +
  1848. l2_hdr_offset);
  1849. }
  1850. /*
  1851. * process frame for mulitpass phrase processing
  1852. */
  1853. if (qdf_unlikely(vdev->multipass_en)) {
  1854. if (dp_rx_multipass_process(peer, nbuf, tid) == false) {
  1855. DP_STATS_INC(peer, rx.multipass_rx_pkt_drop, 1);
  1856. qdf_nbuf_free(nbuf);
  1857. nbuf = next;
  1858. dp_peer_unref_del_find_by_id(peer);
  1859. continue;
  1860. }
  1861. }
  1862. if (!dp_wds_rx_policy_check(rx_tlv_hdr, vdev, peer)) {
  1863. QDF_TRACE(QDF_MODULE_ID_DP,
  1864. QDF_TRACE_LEVEL_ERROR,
  1865. FL("Policy Check Drop pkt"));
  1866. tid_stats->fail_cnt[POLICY_CHECK_DROP]++;
  1867. /* Drop & free packet */
  1868. qdf_nbuf_free(nbuf);
  1869. /* Statistics */
  1870. nbuf = next;
  1871. dp_peer_unref_del_find_by_id(peer);
  1872. continue;
  1873. }
  1874. if (qdf_unlikely(peer && (peer->nawds_enabled) &&
  1875. (qdf_nbuf_is_da_mcbc(nbuf)) &&
  1876. (hal_rx_get_mpdu_mac_ad4_valid(soc->hal_soc,
  1877. rx_tlv_hdr) ==
  1878. false))) {
  1879. tid_stats->fail_cnt[NAWDS_MCAST_DROP]++;
  1880. DP_STATS_INC(peer, rx.nawds_mcast_drop, 1);
  1881. qdf_nbuf_free(nbuf);
  1882. nbuf = next;
  1883. dp_peer_unref_del_find_by_id(peer);
  1884. continue;
  1885. }
  1886. if (soc->process_rx_status)
  1887. dp_rx_cksum_offload(vdev->pdev, nbuf, rx_tlv_hdr);
  1888. /* Update the protocol tag in SKB based on CCE metadata */
  1889. dp_rx_update_protocol_tag(soc, vdev, nbuf, rx_tlv_hdr,
  1890. reo_ring_num, false, true);
  1891. /* Update the flow tag in SKB based on FSE metadata */
  1892. dp_rx_update_flow_tag(soc, vdev, nbuf, rx_tlv_hdr, true);
  1893. dp_rx_msdu_stats_update(soc, nbuf, rx_tlv_hdr, peer,
  1894. ring_id, tid_stats);
  1895. if (qdf_unlikely(vdev->mesh_vdev)) {
  1896. if (dp_rx_filter_mesh_packets(vdev, nbuf, rx_tlv_hdr)
  1897. == QDF_STATUS_SUCCESS) {
  1898. QDF_TRACE(QDF_MODULE_ID_DP,
  1899. QDF_TRACE_LEVEL_INFO_MED,
  1900. FL("mesh pkt filtered"));
  1901. tid_stats->fail_cnt[MESH_FILTER_DROP]++;
  1902. DP_STATS_INC(vdev->pdev, dropped.mesh_filter,
  1903. 1);
  1904. qdf_nbuf_free(nbuf);
  1905. nbuf = next;
  1906. dp_peer_unref_del_find_by_id(peer);
  1907. continue;
  1908. }
  1909. dp_rx_fill_mesh_stats(vdev, nbuf, rx_tlv_hdr, peer);
  1910. }
  1911. if (qdf_likely(vdev->rx_decap_type ==
  1912. htt_cmn_pkt_type_ethernet) &&
  1913. qdf_likely(!vdev->mesh_vdev)) {
  1914. /* WDS Destination Address Learning */
  1915. dp_rx_da_learn(soc, rx_tlv_hdr, peer, nbuf);
  1916. /* Due to HW issue, sometimes we see that the sa_idx
  1917. * and da_idx are invalid with sa_valid and da_valid
  1918. * bits set
  1919. *
  1920. * in this case we also see that value of
  1921. * sa_sw_peer_id is set as 0
  1922. *
  1923. * Drop the packet if sa_idx and da_idx OOB or
  1924. * sa_sw_peerid is 0
  1925. */
  1926. if (!is_sa_da_idx_valid(soc, rx_tlv_hdr, nbuf)) {
  1927. qdf_nbuf_free(nbuf);
  1928. nbuf = next;
  1929. DP_STATS_INC(soc, rx.err.invalid_sa_da_idx, 1);
  1930. dp_peer_unref_del_find_by_id(peer);
  1931. continue;
  1932. }
  1933. /* WDS Source Port Learning */
  1934. if (qdf_likely(vdev->wds_enabled))
  1935. dp_rx_wds_srcport_learn(soc, rx_tlv_hdr,
  1936. peer, nbuf);
  1937. /* Intrabss-fwd */
  1938. if (dp_rx_check_ap_bridge(vdev))
  1939. if (dp_rx_intrabss_fwd(soc,
  1940. peer,
  1941. rx_tlv_hdr,
  1942. nbuf)) {
  1943. nbuf = next;
  1944. dp_peer_unref_del_find_by_id(peer);
  1945. tid_stats->intrabss_cnt++;
  1946. continue; /* Get next desc */
  1947. }
  1948. }
  1949. dp_rx_fill_gro_info(soc, rx_tlv_hdr, nbuf, &rx_ol_pkt_cnt);
  1950. DP_RX_LIST_APPEND(deliver_list_head,
  1951. deliver_list_tail,
  1952. nbuf);
  1953. DP_STATS_INC_PKT(peer, rx.to_stack, 1,
  1954. QDF_NBUF_CB_RX_PKT_LEN(nbuf));
  1955. tid_stats->delivered_to_stack++;
  1956. nbuf = next;
  1957. dp_peer_unref_del_find_by_id(peer);
  1958. }
  1959. if (qdf_likely(deliver_list_head)) {
  1960. if (qdf_likely(peer))
  1961. dp_rx_deliver_to_stack(vdev, peer, deliver_list_head,
  1962. deliver_list_tail);
  1963. else {
  1964. nbuf = deliver_list_head;
  1965. while (nbuf) {
  1966. next = nbuf->next;
  1967. nbuf->next = NULL;
  1968. dp_rx_deliver_to_stack_no_peer(soc, nbuf);
  1969. nbuf = next;
  1970. }
  1971. }
  1972. }
  1973. if (dp_rx_enable_eol_data_check(soc) && rx_bufs_used) {
  1974. if (quota) {
  1975. num_pending =
  1976. dp_rx_srng_get_num_pending(hal_soc,
  1977. hal_ring_hdl,
  1978. num_entries,
  1979. &near_full);
  1980. if (num_pending) {
  1981. DP_STATS_INC(soc, rx.hp_oos2, 1);
  1982. if (!hif_exec_should_yield(scn, intr_id))
  1983. goto more_data;
  1984. if (qdf_unlikely(near_full)) {
  1985. DP_STATS_INC(soc, rx.near_full, 1);
  1986. goto more_data;
  1987. }
  1988. }
  1989. }
  1990. if (vdev && vdev->osif_gro_flush && rx_ol_pkt_cnt) {
  1991. vdev->osif_gro_flush(vdev->osif_vdev,
  1992. reo_ring_num);
  1993. }
  1994. }
  1995. /* Update histogram statistics by looping through pdev's */
  1996. DP_RX_HIST_STATS_PER_PDEV();
  1997. return rx_bufs_used; /* Assume no scale factor for now */
  1998. }
  1999. QDF_STATUS dp_rx_vdev_detach(struct dp_vdev *vdev)
  2000. {
  2001. QDF_STATUS ret;
  2002. if (vdev->osif_rx_flush) {
  2003. ret = vdev->osif_rx_flush(vdev->osif_vdev, vdev->vdev_id);
  2004. if (!ret) {
  2005. dp_err("Failed to flush rx pkts for vdev %d\n",
  2006. vdev->vdev_id);
  2007. return ret;
  2008. }
  2009. }
  2010. return QDF_STATUS_SUCCESS;
  2011. }
  2012. /**
  2013. * dp_rx_pdev_detach() - detach dp rx
  2014. * @pdev: core txrx pdev context
  2015. *
  2016. * This function will detach DP RX into main device context
  2017. * will free DP Rx resources.
  2018. *
  2019. * Return: void
  2020. */
  2021. void
  2022. dp_rx_pdev_detach(struct dp_pdev *pdev)
  2023. {
  2024. uint8_t mac_for_pdev = pdev->lmac_id;
  2025. struct dp_soc *soc = pdev->soc;
  2026. struct rx_desc_pool *rx_desc_pool;
  2027. rx_desc_pool = &soc->rx_desc_buf[mac_for_pdev];
  2028. if (rx_desc_pool->pool_size != 0) {
  2029. if (!dp_is_soc_reinit(soc))
  2030. dp_rx_desc_nbuf_and_pool_free(soc, mac_for_pdev,
  2031. rx_desc_pool);
  2032. else
  2033. dp_rx_desc_nbuf_free(soc, rx_desc_pool);
  2034. }
  2035. return;
  2036. }
  2037. static QDF_STATUS
  2038. dp_pdev_nbuf_alloc_and_map(struct dp_soc *dp_soc, qdf_nbuf_t *nbuf,
  2039. struct dp_pdev *dp_pdev)
  2040. {
  2041. qdf_dma_addr_t paddr;
  2042. QDF_STATUS ret = QDF_STATUS_E_FAILURE;
  2043. *nbuf = qdf_nbuf_alloc(dp_soc->osdev, RX_BUFFER_SIZE,
  2044. RX_BUFFER_RESERVATION, RX_BUFFER_ALIGNMENT,
  2045. FALSE);
  2046. if (!(*nbuf)) {
  2047. dp_err("nbuf alloc failed");
  2048. DP_STATS_INC(dp_pdev, replenish.nbuf_alloc_fail, 1);
  2049. return ret;
  2050. }
  2051. ret = qdf_nbuf_map_single(dp_soc->osdev, *nbuf,
  2052. QDF_DMA_FROM_DEVICE);
  2053. if (qdf_unlikely(QDF_IS_STATUS_ERROR(ret))) {
  2054. qdf_nbuf_free(*nbuf);
  2055. dp_err("nbuf map failed");
  2056. DP_STATS_INC(dp_pdev, replenish.map_err, 1);
  2057. return ret;
  2058. }
  2059. paddr = qdf_nbuf_get_frag_paddr(*nbuf, 0);
  2060. ret = check_x86_paddr(dp_soc, nbuf, &paddr, dp_pdev);
  2061. if (ret == QDF_STATUS_E_FAILURE) {
  2062. qdf_nbuf_unmap_single(dp_soc->osdev, *nbuf,
  2063. QDF_DMA_FROM_DEVICE);
  2064. qdf_nbuf_free(*nbuf);
  2065. dp_err("nbuf check x86 failed");
  2066. DP_STATS_INC(dp_pdev, replenish.x86_fail, 1);
  2067. return ret;
  2068. }
  2069. return QDF_STATUS_SUCCESS;
  2070. }
  2071. QDF_STATUS
  2072. dp_pdev_rx_buffers_attach(struct dp_soc *dp_soc, uint32_t mac_id,
  2073. struct dp_srng *dp_rxdma_srng,
  2074. struct rx_desc_pool *rx_desc_pool,
  2075. uint32_t num_req_buffers)
  2076. {
  2077. struct dp_pdev *dp_pdev = dp_get_pdev_for_lmac_id(dp_soc, mac_id);
  2078. hal_ring_handle_t rxdma_srng = dp_rxdma_srng->hal_srng;
  2079. union dp_rx_desc_list_elem_t *next;
  2080. void *rxdma_ring_entry;
  2081. qdf_dma_addr_t paddr;
  2082. qdf_nbuf_t *rx_nbuf_arr;
  2083. uint32_t nr_descs, nr_nbuf = 0, nr_nbuf_total = 0;
  2084. uint32_t buffer_index, nbuf_ptrs_per_page;
  2085. qdf_nbuf_t nbuf;
  2086. QDF_STATUS ret;
  2087. int page_idx, total_pages;
  2088. union dp_rx_desc_list_elem_t *desc_list = NULL;
  2089. union dp_rx_desc_list_elem_t *tail = NULL;
  2090. if (qdf_unlikely(!rxdma_srng)) {
  2091. DP_STATS_INC(dp_pdev, replenish.rxdma_err, num_req_buffers);
  2092. return QDF_STATUS_E_FAILURE;
  2093. }
  2094. dp_debug("requested %u RX buffers for driver attach", num_req_buffers);
  2095. nr_descs = dp_rx_get_free_desc_list(dp_soc, mac_id, rx_desc_pool,
  2096. num_req_buffers, &desc_list, &tail);
  2097. if (!nr_descs) {
  2098. dp_err("no free rx_descs in freelist");
  2099. DP_STATS_INC(dp_pdev, err.desc_alloc_fail, num_req_buffers);
  2100. return QDF_STATUS_E_NOMEM;
  2101. }
  2102. dp_debug("got %u RX descs for driver attach", nr_descs);
  2103. /*
  2104. * Try to allocate pointers to the nbuf one page at a time.
  2105. * Take pointers that can fit in one page of memory and
  2106. * iterate through the total descriptors that need to be
  2107. * allocated in order of pages. Reuse the pointers that
  2108. * have been allocated to fit in one page across each
  2109. * iteration to index into the nbuf.
  2110. */
  2111. total_pages = (nr_descs * sizeof(*rx_nbuf_arr)) / PAGE_SIZE;
  2112. /*
  2113. * Add an extra page to store the remainder if any
  2114. */
  2115. if ((nr_descs * sizeof(*rx_nbuf_arr)) % PAGE_SIZE)
  2116. total_pages++;
  2117. rx_nbuf_arr = qdf_mem_malloc(PAGE_SIZE);
  2118. if (!rx_nbuf_arr) {
  2119. dp_err("failed to allocate nbuf array");
  2120. DP_STATS_INC(dp_pdev, replenish.rxdma_err, num_req_buffers);
  2121. QDF_BUG(0);
  2122. return QDF_STATUS_E_NOMEM;
  2123. }
  2124. nbuf_ptrs_per_page = PAGE_SIZE / sizeof(*rx_nbuf_arr);
  2125. for (page_idx = 0; page_idx < total_pages; page_idx++) {
  2126. qdf_mem_zero(rx_nbuf_arr, PAGE_SIZE);
  2127. for (nr_nbuf = 0; nr_nbuf < nbuf_ptrs_per_page; nr_nbuf++) {
  2128. /*
  2129. * The last page of buffer pointers may not be required
  2130. * completely based on the number of descriptors. Below
  2131. * check will ensure we are allocating only the
  2132. * required number of descriptors.
  2133. */
  2134. if (nr_nbuf_total >= nr_descs)
  2135. break;
  2136. ret = dp_pdev_nbuf_alloc_and_map(dp_soc,
  2137. &rx_nbuf_arr[nr_nbuf],
  2138. dp_pdev);
  2139. if (QDF_IS_STATUS_ERROR(ret))
  2140. break;
  2141. nr_nbuf_total++;
  2142. }
  2143. hal_srng_access_start(dp_soc->hal_soc, rxdma_srng);
  2144. for (buffer_index = 0; buffer_index < nr_nbuf; buffer_index++) {
  2145. rxdma_ring_entry =
  2146. hal_srng_src_get_next(dp_soc->hal_soc,
  2147. rxdma_srng);
  2148. qdf_assert_always(rxdma_ring_entry);
  2149. next = desc_list->next;
  2150. nbuf = rx_nbuf_arr[buffer_index];
  2151. paddr = qdf_nbuf_get_frag_paddr(nbuf, 0);
  2152. dp_rx_desc_prep(&desc_list->rx_desc, nbuf);
  2153. desc_list->rx_desc.in_use = 1;
  2154. hal_rxdma_buff_addr_info_set(rxdma_ring_entry, paddr,
  2155. desc_list->rx_desc.cookie,
  2156. rx_desc_pool->owner);
  2157. dp_ipa_handle_rx_buf_smmu_mapping(dp_soc, nbuf, true);
  2158. desc_list = next;
  2159. }
  2160. hal_srng_access_end(dp_soc->hal_soc, rxdma_srng);
  2161. }
  2162. dp_info("filled %u RX buffers for driver attach", nr_nbuf_total);
  2163. qdf_mem_free(rx_nbuf_arr);
  2164. if (!nr_nbuf_total) {
  2165. dp_err("No nbuf's allocated");
  2166. QDF_BUG(0);
  2167. return QDF_STATUS_E_RESOURCES;
  2168. }
  2169. DP_STATS_INC_PKT(dp_pdev, replenish.pkts, nr_nbuf,
  2170. RX_BUFFER_SIZE * nr_nbuf_total);
  2171. return QDF_STATUS_SUCCESS;
  2172. }
  2173. /**
  2174. * dp_rx_attach() - attach DP RX
  2175. * @pdev: core txrx pdev context
  2176. *
  2177. * This function will attach a DP RX instance into the main
  2178. * device (SOC) context. Will allocate dp rx resource and
  2179. * initialize resources.
  2180. *
  2181. * Return: QDF_STATUS_SUCCESS: success
  2182. * QDF_STATUS_E_RESOURCES: Error return
  2183. */
  2184. QDF_STATUS
  2185. dp_rx_pdev_attach(struct dp_pdev *pdev)
  2186. {
  2187. uint8_t pdev_id = pdev->pdev_id;
  2188. struct dp_soc *soc = pdev->soc;
  2189. uint32_t rxdma_entries;
  2190. uint32_t rx_sw_desc_weight;
  2191. struct dp_srng *dp_rxdma_srng;
  2192. struct rx_desc_pool *rx_desc_pool;
  2193. QDF_STATUS ret_val;
  2194. int mac_for_pdev;
  2195. if (wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx)) {
  2196. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_INFO,
  2197. "nss-wifi<4> skip Rx refil %d", pdev_id);
  2198. return QDF_STATUS_SUCCESS;
  2199. }
  2200. pdev = soc->pdev_list[pdev_id];
  2201. mac_for_pdev = pdev->lmac_id;
  2202. dp_rxdma_srng = &soc->rx_refill_buf_ring[mac_for_pdev];
  2203. rxdma_entries = dp_rxdma_srng->num_entries;
  2204. soc->process_rx_status = CONFIG_PROCESS_RX_STATUS;
  2205. rx_desc_pool = &soc->rx_desc_buf[mac_for_pdev];
  2206. rx_sw_desc_weight = wlan_cfg_get_dp_soc_rx_sw_desc_weight(soc->wlan_cfg_ctx);
  2207. dp_rx_desc_pool_alloc(soc, mac_for_pdev,
  2208. rx_sw_desc_weight * rxdma_entries,
  2209. rx_desc_pool);
  2210. rx_desc_pool->owner = DP_WBM2SW_RBM;
  2211. /* For Rx buffers, WBM release ring is SW RING 3,for all pdev's */
  2212. ret_val = dp_rx_fst_attach(soc, pdev);
  2213. if ((ret_val != QDF_STATUS_SUCCESS) &&
  2214. (ret_val != QDF_STATUS_E_NOSUPPORT)) {
  2215. QDF_TRACE(QDF_MODULE_ID_ANY, QDF_TRACE_LEVEL_ERROR,
  2216. "RX Flow Search Table attach failed: pdev %d err %d",
  2217. pdev_id, ret_val);
  2218. return ret_val;
  2219. }
  2220. return dp_pdev_rx_buffers_attach(soc, mac_for_pdev, dp_rxdma_srng,
  2221. rx_desc_pool, rxdma_entries - 1);
  2222. }
  2223. /*
  2224. * dp_rx_nbuf_prepare() - prepare RX nbuf
  2225. * @soc: core txrx main context
  2226. * @pdev: core txrx pdev context
  2227. *
  2228. * This function alloc & map nbuf for RX dma usage, retry it if failed
  2229. * until retry times reaches max threshold or succeeded.
  2230. *
  2231. * Return: qdf_nbuf_t pointer if succeeded, NULL if failed.
  2232. */
  2233. qdf_nbuf_t
  2234. dp_rx_nbuf_prepare(struct dp_soc *soc, struct dp_pdev *pdev)
  2235. {
  2236. uint8_t *buf;
  2237. int32_t nbuf_retry_count;
  2238. QDF_STATUS ret;
  2239. qdf_nbuf_t nbuf = NULL;
  2240. for (nbuf_retry_count = 0; nbuf_retry_count <
  2241. QDF_NBUF_ALLOC_MAP_RETRY_THRESHOLD;
  2242. nbuf_retry_count++) {
  2243. /* Allocate a new skb */
  2244. nbuf = qdf_nbuf_alloc(soc->osdev,
  2245. RX_BUFFER_SIZE,
  2246. RX_BUFFER_RESERVATION,
  2247. RX_BUFFER_ALIGNMENT,
  2248. FALSE);
  2249. if (!nbuf) {
  2250. DP_STATS_INC(pdev,
  2251. replenish.nbuf_alloc_fail, 1);
  2252. continue;
  2253. }
  2254. buf = qdf_nbuf_data(nbuf);
  2255. memset(buf, 0, RX_BUFFER_SIZE);
  2256. ret = qdf_nbuf_map_single(soc->osdev, nbuf,
  2257. QDF_DMA_FROM_DEVICE);
  2258. /* nbuf map failed */
  2259. if (qdf_unlikely(QDF_IS_STATUS_ERROR(ret))) {
  2260. qdf_nbuf_free(nbuf);
  2261. DP_STATS_INC(pdev, replenish.map_err, 1);
  2262. continue;
  2263. }
  2264. /* qdf_nbuf alloc and map succeeded */
  2265. break;
  2266. }
  2267. /* qdf_nbuf still alloc or map failed */
  2268. if (qdf_unlikely(nbuf_retry_count >=
  2269. QDF_NBUF_ALLOC_MAP_RETRY_THRESHOLD))
  2270. return NULL;
  2271. return nbuf;
  2272. }