dp_rx.c 86 KB

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