dp_tx_capture.c 90 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284
  1. /*
  2. * Copyright (c) 2017-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 <htt.h>
  19. #include "qdf_trace.h"
  20. #include "qdf_nbuf.h"
  21. #include "dp_peer.h"
  22. #include "dp_types.h"
  23. #include "dp_internal.h"
  24. #include "dp_rx_mon.h"
  25. #include "htt_ppdu_stats.h"
  26. #include "dp_htt.h"
  27. #include "qdf_mem.h" /* qdf_mem_malloc,free */
  28. #include "cdp_txrx_cmn_struct.h"
  29. #include <enet.h>
  30. #include "dp_tx_capture.h"
  31. #define MAX_MONITOR_HEADER (512)
  32. #define MAX_DUMMY_FRM_BODY (128)
  33. #define DP_BA_ACK_FRAME_SIZE (sizeof(struct ieee80211_ctlframe_addr2) + 36)
  34. #define DP_ACK_FRAME_SIZE (struct ieee80211_frame_min_one)
  35. #define DP_MAX_MPDU_64 64
  36. #define DP_NUM_WORDS_PER_PPDU_BITMAP_64 (DP_MAX_MPDU_64 >> 5)
  37. #define DP_NUM_BYTES_PER_PPDU_BITMAP_64 (DP_MAX_MPDU_64 >> 3)
  38. #define DP_NUM_BYTES_PER_PPDU_BITMAP (HAL_RX_MAX_MPDU >> 3)
  39. #define DP_IEEE80211_BAR_CTL_TID_S 12
  40. #define DP_IEEE80211_BA_S_SEQ_S 4
  41. #define DP_IEEE80211_BAR_CTL_COMBA 0x0004
  42. #define INVALID_PPDU_ID 0xFFFF
  43. #define MAX_END_TSF 0xFFFFFFFF
  44. /* Macros to handle sequence number bitmaps */
  45. /* HW generated rts frame flag */
  46. #define SEND_WIFIRTS_LEGACY_E 1
  47. /* HW generated 11 AC static bw flag */
  48. #define SEND_WIFIRTS_11AC_STATIC_BW_E 2
  49. /* HW generated 11 AC dynamic bw flag */
  50. #define SEND_WIFIRTS_11AC_DYNAMIC_BW_E 3
  51. /* HW generated cts frame flag */
  52. #define SEND_WIFICTS2SELF_E 4
  53. /* Size (in bits) of a segment of sequence number bitmap */
  54. #define SEQ_SEG_SZ_BITS(_seqarr) (sizeof(_seqarr[0]) << 3)
  55. /* Array index of a segment of sequence number bitmap */
  56. #define SEQ_SEG_INDEX(_seqarr, _seqno) ((_seqno) / SEQ_SEG_SZ_BITS(_seqarr))
  57. /* Bit mask of a seqno within a segment of sequence bitmap */
  58. #define SEQ_SEG_MSK(_seqseg, _index) \
  59. (1 << ((_index) & ((sizeof(_seqseg) << 3) - 1)))
  60. /* Check seqno bit in a segment of sequence bitmap */
  61. #define SEQ_SEG_BIT(_seqseg, _index) \
  62. ((_seqseg) & SEQ_SEG_MSK((_seqseg), _index))
  63. /* Segment of sequence bitmap containing a given sequence number */
  64. #define SEQ_SEG(_seqarr, _seqno) \
  65. (_seqarr[(_seqno) / (sizeof(_seqarr[0]) << 3)])
  66. /* Check seqno bit in the sequence bitmap */
  67. #define SEQ_BIT(_seqarr, _seqno) \
  68. SEQ_SEG_BIT(SEQ_SEG(_seqarr, (_seqno)), (_seqno))
  69. /* Lower 32 mask for timestamp us as completion path has 32 bits timestamp */
  70. #define LOWER_32_MASK 0xFFFFFFFF
  71. /* Maximum time taken to enqueue next mgmt pkt */
  72. #define MAX_MGMT_ENQ_DELAY 10000
  73. /* Schedule id counter mask in ppdu_id */
  74. #define SCH_ID_MASK 0xFF
  75. #ifdef WLAN_TX_PKT_CAPTURE_ENH
  76. /*
  77. * dp_tx_capture_htt_frame_counter: increment counter for htt_frame_type
  78. * pdev: DP pdev handle
  79. * htt_frame_type: htt frame type received from fw
  80. *
  81. * return: void
  82. */
  83. void dp_tx_capture_htt_frame_counter(struct dp_pdev *pdev,
  84. uint32_t htt_frame_type)
  85. {
  86. if (htt_frame_type >= TX_CAP_HTT_MAX_FTYPE)
  87. return;
  88. pdev->tx_capture.htt_frame_type[htt_frame_type]++;
  89. }
  90. /*
  91. * dp_tx_cature_stats: print tx capture stats
  92. * @pdev: DP PDEV handle
  93. *
  94. * return: void
  95. */
  96. void dp_print_pdev_tx_capture_stats(struct dp_pdev *pdev)
  97. {
  98. struct dp_pdev_tx_capture *ptr_tx_cap;
  99. uint8_t i = 0, j = 0;
  100. ptr_tx_cap = &(pdev->tx_capture);
  101. DP_PRINT_STATS("tx capture stats:");
  102. DP_PRINT_STATS(" mgmt control enqueue stats:");
  103. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  104. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  105. if (ptr_tx_cap->ctl_mgmt_q[i][j].qlen)
  106. DP_PRINT_STATS(" ctl_mgmt_q[%d][%d] = queue_len[%d]",
  107. i, j, ptr_tx_cap->ctl_mgmt_q[i][j].qlen);
  108. }
  109. }
  110. DP_PRINT_STATS(" mgmt control retry queue stats:");
  111. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  112. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  113. if (ptr_tx_cap->ctl_mgmt_q[i][j].qlen)
  114. DP_PRINT_STATS(" retries_ctl_mgmt_q[%d][%d] = queue_len[%d]",
  115. i, j,
  116. ptr_tx_cap->retries_ctl_mgmt_q[i][j].qlen);
  117. }
  118. }
  119. for (i = 0; i < TX_CAP_HTT_MAX_FTYPE; i++) {
  120. if (!ptr_tx_cap->htt_frame_type[i])
  121. continue;
  122. DP_PRINT_STATS(" sgen htt frame type[%d] = %d",
  123. i, ptr_tx_cap->htt_frame_type[i]);
  124. }
  125. }
  126. /**
  127. * dp_peer_or_pdev_tx_cap_enabled - Returns status of tx_cap_enabled
  128. * based on global per-pdev setting or per-peer setting
  129. * @pdev: Datapath pdev handle
  130. * @peer: Datapath peer
  131. *
  132. * Return: true if feature is enabled on a per-pdev basis or if
  133. * enabled for the given peer when per-peer mode is set, false otherwise
  134. */
  135. inline bool
  136. dp_peer_or_pdev_tx_cap_enabled(struct dp_pdev *pdev,
  137. struct dp_peer *peer)
  138. {
  139. if ((pdev->tx_capture_enabled ==
  140. CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS) ||
  141. ((pdev->tx_capture_enabled ==
  142. CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) &&
  143. peer->tx_cap_enabled))
  144. return true;
  145. return false;
  146. }
  147. /*
  148. * dp_peer_tid_queue_init() – Initialize ppdu stats queue per TID
  149. * @peer: Datapath peer
  150. *
  151. */
  152. void dp_peer_tid_queue_init(struct dp_peer *peer)
  153. {
  154. int tid;
  155. struct dp_tx_tid *tx_tid;
  156. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  157. tx_tid = &peer->tx_capture.tx_tid[tid];
  158. tx_tid->tid = tid;
  159. qdf_nbuf_queue_init(&tx_tid->msdu_comp_q);
  160. qdf_nbuf_queue_init(&tx_tid->pending_ppdu_q);
  161. tx_tid->max_ppdu_id = 0;
  162. /* spinlock create */
  163. qdf_spinlock_create(&tx_tid->tid_lock);
  164. }
  165. }
  166. static
  167. void dp_peer_tx_cap_tid_queue_flush(struct dp_peer *peer)
  168. {
  169. int tid;
  170. struct dp_tx_tid *tx_tid;
  171. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  172. tx_tid = &peer->tx_capture.tx_tid[tid];
  173. qdf_spin_lock_bh(&tx_tid->tid_lock);
  174. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  175. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  176. tx_tid->max_ppdu_id = 0;
  177. }
  178. }
  179. /*
  180. * dp_peer_tid_queue_cleanup() – remove ppdu stats queue per TID
  181. * @peer: Datapath peer
  182. *
  183. */
  184. void dp_peer_tid_queue_cleanup(struct dp_peer *peer)
  185. {
  186. int tid;
  187. struct dp_tx_tid *tx_tid;
  188. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  189. tx_tid = &peer->tx_capture.tx_tid[tid];
  190. qdf_spin_lock_bh(&tx_tid->tid_lock);
  191. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  192. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  193. /* spinlock destroy */
  194. qdf_spinlock_destroy(&tx_tid->tid_lock);
  195. tx_tid->max_ppdu_id = 0;
  196. }
  197. }
  198. /*
  199. * dp_peer_update_80211_hdr: update 80211 hdr
  200. * @vdev: DP VDEV
  201. * @peer: DP PEER
  202. *
  203. * return: void
  204. */
  205. void dp_peer_update_80211_hdr(struct dp_vdev *vdev, struct dp_peer *peer)
  206. {
  207. struct ieee80211_frame *ptr_wh;
  208. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  209. /* i_addr1 - Receiver mac address */
  210. /* i_addr2 - Transmitter mac address */
  211. /* i_addr3 - Destination mac address */
  212. qdf_mem_copy(ptr_wh->i_addr1,
  213. peer->mac_addr.raw,
  214. QDF_MAC_ADDR_SIZE);
  215. qdf_mem_copy(ptr_wh->i_addr3,
  216. peer->mac_addr.raw,
  217. QDF_MAC_ADDR_SIZE);
  218. qdf_mem_copy(ptr_wh->i_addr2,
  219. vdev->mac_addr.raw,
  220. QDF_MAC_ADDR_SIZE);
  221. }
  222. /*
  223. * dp_deliver_mgmt_frm: Process
  224. * @pdev: DP PDEV handle
  225. * @nbuf: buffer containing the htt_ppdu_stats_tx_mgmtctrl_payload_tlv
  226. *
  227. * return: void
  228. */
  229. void dp_deliver_mgmt_frm(struct dp_pdev *pdev, qdf_nbuf_t nbuf)
  230. {
  231. if (pdev->tx_sniffer_enable || pdev->mcopy_mode) {
  232. dp_wdi_event_handler(WDI_EVENT_TX_MGMT_CTRL, pdev->soc,
  233. nbuf, HTT_INVALID_PEER,
  234. WDI_NO_VAL, pdev->pdev_id);
  235. return;
  236. }
  237. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  238. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  239. /* invoke WDI event handler here send mgmt pkt here */
  240. struct ieee80211_frame *wh;
  241. uint8_t type, subtype;
  242. struct cdp_tx_mgmt_comp_info *ptr_mgmt_hdr;
  243. ptr_mgmt_hdr = (struct cdp_tx_mgmt_comp_info *)
  244. qdf_nbuf_data(nbuf);
  245. wh = (struct ieee80211_frame *)(qdf_nbuf_data(nbuf) +
  246. sizeof(struct cdp_tx_mgmt_comp_info));
  247. type = (wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) >>
  248. IEEE80211_FC0_TYPE_SHIFT;
  249. subtype = (wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) >>
  250. IEEE80211_FC0_SUBTYPE_SHIFT;
  251. if (!ptr_mgmt_hdr->ppdu_id || !ptr_mgmt_hdr->tx_tsf ||
  252. (!type && !subtype)) {
  253. /*
  254. * if either ppdu_id and tx_tsf are zero then
  255. * storing the payload won't be useful
  256. * in constructing the packet
  257. * Hence freeing the packet
  258. */
  259. qdf_nbuf_free(nbuf);
  260. return;
  261. }
  262. qdf_spin_lock_bh(
  263. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  264. qdf_nbuf_queue_add(&pdev->tx_capture.ctl_mgmt_q[type][subtype],
  265. nbuf);
  266. qdf_spin_unlock_bh(
  267. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  268. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  269. "dlvr mgmt frm(0x%08x): fc 0x%x %x, dur 0x%x%x\n",
  270. ptr_mgmt_hdr->ppdu_id, wh->i_fc[1], wh->i_fc[0],
  271. wh->i_dur[1], wh->i_dur[0]);
  272. }
  273. }
  274. /**
  275. * dp_tx_ppdu_stats_attach - Initialize Tx PPDU stats and enhanced capture
  276. * @pdev: DP PDEV
  277. *
  278. * Return: none
  279. */
  280. void dp_tx_ppdu_stats_attach(struct dp_pdev *pdev)
  281. {
  282. int i, j;
  283. /* Work queue setup for HTT stats and tx capture handling */
  284. qdf_create_work(0, &pdev->tx_capture.ppdu_stats_work,
  285. dp_tx_ppdu_stats_process,
  286. pdev);
  287. pdev->tx_capture.ppdu_stats_workqueue =
  288. qdf_alloc_unbound_workqueue("ppdu_stats_work_queue");
  289. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_queue);
  290. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_defer_queue);
  291. qdf_spinlock_create(&pdev->tx_capture.ppdu_stats_lock);
  292. pdev->tx_capture.ppdu_stats_queue_depth = 0;
  293. pdev->tx_capture.ppdu_stats_next_sched = 0;
  294. pdev->tx_capture.ppdu_stats_defer_queue_depth = 0;
  295. pdev->tx_capture.ppdu_dropped = 0;
  296. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  297. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  298. qdf_nbuf_queue_init(
  299. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  300. qdf_spinlock_create(
  301. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  302. }
  303. }
  304. qdf_mem_zero(&pdev->tx_capture.dummy_ppdu_desc,
  305. sizeof(struct cdp_tx_completion_ppdu));
  306. }
  307. /**
  308. * dp_tx_ppdu_stats_detach - Cleanup Tx PPDU stats and enhanced capture
  309. * @pdev: DP PDEV
  310. *
  311. * Return: none
  312. */
  313. void dp_tx_ppdu_stats_detach(struct dp_pdev *pdev)
  314. {
  315. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  316. int i, j;
  317. if (!pdev || !pdev->tx_capture.ppdu_stats_workqueue)
  318. return;
  319. qdf_flush_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  320. qdf_destroy_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  321. qdf_spinlock_destroy(&pdev->tx_capture.ppdu_stats_lock);
  322. STAILQ_FOREACH_SAFE(ppdu_info,
  323. &pdev->tx_capture.ppdu_stats_queue,
  324. ppdu_info_queue_elem, tmp_ppdu_info) {
  325. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_queue,
  326. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  327. qdf_nbuf_free(ppdu_info->nbuf);
  328. qdf_mem_free(ppdu_info);
  329. }
  330. STAILQ_FOREACH_SAFE(ppdu_info,
  331. &pdev->tx_capture.ppdu_stats_defer_queue,
  332. ppdu_info_queue_elem, tmp_ppdu_info) {
  333. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_defer_queue,
  334. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  335. qdf_nbuf_free(ppdu_info->nbuf);
  336. qdf_mem_free(ppdu_info);
  337. }
  338. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  339. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  340. qdf_spin_lock_bh(
  341. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  342. qdf_nbuf_queue_free(
  343. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  344. qdf_spin_unlock_bh(
  345. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  346. qdf_spinlock_destroy(
  347. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  348. }
  349. }
  350. }
  351. /**
  352. * dp_update_msdu_to_list(): Function to queue msdu from wbm
  353. * @pdev: dp_pdev
  354. * @peer: dp_peer
  355. * @ts: hal tx completion status
  356. * @netbuf: msdu
  357. *
  358. * return: status
  359. */
  360. QDF_STATUS
  361. dp_update_msdu_to_list(struct dp_soc *soc,
  362. struct dp_pdev *pdev,
  363. struct dp_peer *peer,
  364. struct hal_tx_completion_status *ts,
  365. qdf_nbuf_t netbuf)
  366. {
  367. struct dp_tx_tid *tx_tid;
  368. struct msdu_completion_info *msdu_comp_info;
  369. if (!peer) {
  370. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  371. "%s: %d peer NULL !", __func__, __LINE__);
  372. return QDF_STATUS_E_FAILURE;
  373. }
  374. if (ts->tid > DP_MAX_TIDS) {
  375. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  376. "%s: %d peer_id %d, tid %d > NON_QOS_TID!",
  377. __func__, __LINE__, ts->peer_id, ts->tid);
  378. return QDF_STATUS_E_FAILURE;
  379. }
  380. tx_tid = &peer->tx_capture.tx_tid[ts->tid];
  381. if (!tx_tid) {
  382. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  383. "%s: %d tid[%d] NULL !", __func__, __LINE__, ts->tid);
  384. return QDF_STATUS_E_FAILURE;
  385. }
  386. qdf_nbuf_unmap(soc->osdev, netbuf, QDF_DMA_TO_DEVICE);
  387. if (!qdf_nbuf_push_head(netbuf, sizeof(struct msdu_completion_info))) {
  388. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  389. FL("No headroom"));
  390. return QDF_STATUS_E_NOMEM;
  391. }
  392. msdu_comp_info = (struct msdu_completion_info *)qdf_nbuf_data(netbuf);
  393. /* copy msdu_completion_info to control buffer */
  394. msdu_comp_info->ppdu_id = ts->ppdu_id;
  395. msdu_comp_info->peer_id = ts->peer_id;
  396. msdu_comp_info->tid = ts->tid;
  397. msdu_comp_info->first_msdu = ts->first_msdu;
  398. msdu_comp_info->last_msdu = ts->last_msdu;
  399. msdu_comp_info->msdu_part_of_amsdu = ts->msdu_part_of_amsdu;
  400. msdu_comp_info->transmit_cnt = ts->transmit_cnt;
  401. msdu_comp_info->tsf = ts->tsf;
  402. msdu_comp_info->status = ts->status;
  403. /* update max ppdu_id */
  404. tx_tid->max_ppdu_id = ts->ppdu_id;
  405. pdev->tx_capture.last_msdu_id = ts->ppdu_id;
  406. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  407. "msdu_completion: ppdu_id[%d] peer_id[%d] tid[%d] rel_src[%d] status[%d] tsf[%u] A[%d] CNT[%d]",
  408. ts->ppdu_id, ts->peer_id, ts->tid, ts->release_src,
  409. ts->status, ts->tsf, ts->msdu_part_of_amsdu,
  410. ts->transmit_cnt);
  411. /* lock here */
  412. qdf_spin_lock_bh(&tx_tid->tid_lock);
  413. /* add nbuf to tail queue per peer tid */
  414. qdf_nbuf_queue_add(&tx_tid->msdu_comp_q, netbuf);
  415. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  416. return QDF_STATUS_SUCCESS;
  417. }
  418. /**
  419. * dp_tx_add_to_comp_queue() - add completion msdu to queue
  420. * @soc: DP Soc handle
  421. * @tx_desc: software Tx descriptor
  422. * @ts : Tx completion status from HAL/HTT descriptor
  423. * @peer: DP peer
  424. *
  425. * Return: none
  426. */
  427. QDF_STATUS dp_tx_add_to_comp_queue(struct dp_soc *soc,
  428. struct dp_tx_desc_s *desc,
  429. struct hal_tx_completion_status *ts,
  430. struct dp_peer *peer)
  431. {
  432. int ret = QDF_STATUS_E_FAILURE;
  433. if (peer && dp_peer_or_pdev_tx_cap_enabled(desc->pdev, peer) &&
  434. ((ts->status == HAL_TX_TQM_RR_FRAME_ACKED) ||
  435. (ts->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  436. ((ts->status == HAL_TX_TQM_RR_REM_CMD_AGED) && ts->transmit_cnt))) {
  437. ret = dp_update_msdu_to_list(soc, desc->pdev,
  438. peer, ts, desc->nbuf);
  439. }
  440. return ret;
  441. }
  442. /**
  443. * dp_process_ppdu_stats_update_failed_bitmap(): update failed bitmap
  444. * @pdev: dp_pdev
  445. * @data: tx completion ppdu desc
  446. * @ppdu_id: ppdu id
  447. * @size: size of bitmap
  448. *
  449. * return: status
  450. */
  451. void dp_process_ppdu_stats_update_failed_bitmap(struct dp_pdev *pdev,
  452. void *data,
  453. uint32_t ppdu_id,
  454. uint32_t size)
  455. {
  456. struct cdp_tx_completion_ppdu_user *user;
  457. uint32_t mpdu_tried;
  458. uint32_t ba_seq_no;
  459. uint32_t start_seq;
  460. uint32_t num_mpdu;
  461. uint32_t diff;
  462. uint32_t carry = 0;
  463. uint32_t bitmask = 0;
  464. uint32_t i;
  465. uint32_t k;
  466. uint32_t ba_bitmap = 0;
  467. int last_set_bit;
  468. user = (struct cdp_tx_completion_ppdu_user *)data;
  469. /* get number of mpdu from ppdu_desc */
  470. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  471. ba_seq_no = user->ba_seq_no;
  472. start_seq = user->start_seq;
  473. num_mpdu = user->num_mpdu;
  474. /* assumption: number of mpdu will be less than 32 */
  475. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  476. "ppdu_id[%d] ba_seq_no[%d] start_seq_no[%d] mpdu_tried[%d]",
  477. ppdu_id, ba_seq_no, start_seq, mpdu_tried);
  478. for (i = 0; i < size; i++) {
  479. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  480. "ppdu_id[%d] ba_bitmap[%x] enqueue_bitmap[%x]",
  481. ppdu_id, user->ba_bitmap[i], user->enq_bitmap[i]);
  482. }
  483. /* Handle sequence no. wraparound */
  484. if (start_seq <= ba_seq_no) {
  485. diff = ba_seq_no - start_seq;
  486. /* Sequence delta of more than 2048 is considered wraparound
  487. * and we extend start_seq to be more than ba_seq just to
  488. * adjust failed_bitmap
  489. */
  490. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  491. diff = (start_seq - ba_seq_no) &
  492. (IEEE80211_SEQ_MAX - 1);
  493. start_seq = ba_seq_no + diff;
  494. }
  495. } else {
  496. diff = start_seq - ba_seq_no;
  497. /* Sequence delta of more than 2048 is considered wraparound
  498. * and we extend ba_seq to be more than start_seq just to
  499. * adjust failed_bitmap
  500. */
  501. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  502. diff = (ba_seq_no - start_seq) &
  503. (IEEE80211_SEQ_MAX - 1);
  504. ba_seq_no = start_seq + diff;
  505. }
  506. }
  507. /* Adjust failed_bitmap to start from same seq_no as enq_bitmap */
  508. last_set_bit = 0;
  509. if (start_seq <= ba_seq_no) {
  510. bitmask = (1 << diff) - 1;
  511. for (i = 0; i < size; i++) {
  512. ba_bitmap = user->ba_bitmap[i];
  513. user->failed_bitmap[i] = (ba_bitmap << diff);
  514. user->failed_bitmap[i] |= (bitmask & carry);
  515. carry = ((ba_bitmap & (bitmask << (32 - diff))) >>
  516. (32 - diff));
  517. user->failed_bitmap[i] = user->enq_bitmap[i] &
  518. user->failed_bitmap[i];
  519. if (user->enq_bitmap[i]) {
  520. last_set_bit = i * 32 +
  521. qdf_fls(user->enq_bitmap[i]) - 1;
  522. }
  523. }
  524. } else {
  525. /* array index */
  526. k = diff >> 5;
  527. diff = diff & 0x1F;
  528. bitmask = (1 << diff) - 1;
  529. for (i = 0; i < size; i++, k++) {
  530. ba_bitmap = user->ba_bitmap[k];
  531. user->failed_bitmap[i] = ba_bitmap >> diff;
  532. /* get next ba_bitmap */
  533. ba_bitmap = user->ba_bitmap[k + 1];
  534. carry = (ba_bitmap & bitmask);
  535. user->failed_bitmap[i] |=
  536. ((carry & bitmask) << (32 - diff));
  537. user->failed_bitmap[i] = user->enq_bitmap[i] &
  538. user->failed_bitmap[i];
  539. if (user->enq_bitmap[i]) {
  540. last_set_bit = i * 32 +
  541. qdf_fls(user->enq_bitmap[i]) - 1;
  542. }
  543. }
  544. }
  545. user->last_enq_seq = user->start_seq + last_set_bit;
  546. user->ba_size = user->last_enq_seq - user->start_seq + 1;
  547. }
  548. /*
  549. * dp_soc_set_txrx_ring_map_single()
  550. * @dp_soc: DP handler for soc
  551. *
  552. * Return: Void
  553. */
  554. static void dp_soc_set_txrx_ring_map_single(struct dp_soc *soc)
  555. {
  556. uint32_t i;
  557. for (i = 0; i < WLAN_CFG_INT_NUM_CONTEXTS; i++) {
  558. soc->tx_ring_map[i] =
  559. dp_cpu_ring_map[DP_SINGLE_TX_RING_MAP][i];
  560. }
  561. }
  562. /*
  563. * dp_iterate_free_peer_msdu_q()- API to free msdu queue
  564. * @pdev_handle: DP_PDEV handle
  565. *
  566. * Return: void
  567. */
  568. static void dp_iterate_free_peer_msdu_q(void *pdev_hdl)
  569. {
  570. struct dp_pdev *pdev = (struct dp_pdev *)pdev_hdl;
  571. struct dp_soc *soc = pdev->soc;
  572. struct dp_vdev *vdev = NULL;
  573. struct dp_peer *peer = NULL;
  574. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  575. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  576. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  577. DP_VDEV_ITERATE_PEER_LIST(vdev, peer) {
  578. int tid;
  579. struct dp_tx_tid *tx_tid;
  580. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  581. qdf_nbuf_t ppdu_nbuf = NULL;
  582. struct cdp_tx_completion_ppdu *ppdu_desc =
  583. NULL;
  584. int i;
  585. tx_tid = &peer->tx_capture.tx_tid[tid];
  586. /* spinlock hold */
  587. qdf_spin_lock_bh(&tx_tid->tid_lock);
  588. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  589. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  590. while ((ppdu_nbuf = qdf_nbuf_queue_remove(
  591. &tx_tid->pending_ppdu_q))) {
  592. ppdu_desc =
  593. (struct cdp_tx_completion_ppdu *)
  594. qdf_nbuf_data(ppdu_nbuf);
  595. if (!ppdu_desc->mpdus) {
  596. qdf_nbuf_free(ppdu_nbuf);
  597. continue;
  598. }
  599. for (i = 0; i <
  600. ppdu_desc->user[0].ba_size; i++) {
  601. if (!ppdu_desc->mpdus[i])
  602. continue;
  603. qdf_nbuf_free(
  604. ppdu_desc->mpdus[i]);
  605. }
  606. qdf_mem_free(ppdu_desc->mpdus);
  607. ppdu_desc->mpdus = NULL;
  608. qdf_nbuf_free(ppdu_nbuf);
  609. }
  610. }
  611. }
  612. }
  613. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  614. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  615. }
  616. /*
  617. * dp_config_enh_tx_capture()- API to enable/disable enhanced tx capture
  618. * @pdev_handle: DP_PDEV handle
  619. * @val: user provided value
  620. *
  621. * Return: QDF_STATUS
  622. */
  623. QDF_STATUS
  624. dp_config_enh_tx_capture(struct dp_pdev *pdev, uint8_t val)
  625. {
  626. int i, j;
  627. qdf_spin_lock(&pdev->tx_capture.config_lock);
  628. pdev->tx_capture_enabled = val;
  629. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  630. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  631. dp_soc_set_txrx_ring_map_single(pdev->soc);
  632. if (!pdev->pktlog_ppdu_stats)
  633. dp_h2t_cfg_stats_msg_send(pdev,
  634. DP_PPDU_STATS_CFG_SNIFFER,
  635. pdev->pdev_id);
  636. } else {
  637. dp_soc_set_txrx_ring_map(pdev->soc);
  638. dp_h2t_cfg_stats_msg_send(pdev,
  639. DP_PPDU_STATS_CFG_ENH_STATS,
  640. pdev->pdev_id);
  641. dp_iterate_free_peer_msdu_q(pdev);
  642. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  643. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  644. qdf_spin_lock_bh(
  645. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  646. qdf_nbuf_queue_free(
  647. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  648. qdf_spin_unlock_bh(
  649. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  650. }
  651. }
  652. }
  653. qdf_spin_unlock(&pdev->tx_capture.config_lock);
  654. return QDF_STATUS_SUCCESS;
  655. }
  656. /**
  657. * get_number_of_1s(): Function to get number of 1s
  658. * @value: value to find
  659. *
  660. * return: number of 1s
  661. */
  662. static
  663. inline uint32_t get_number_of_1s(uint32_t value)
  664. {
  665. uint32_t shift[] = {1, 2, 4, 8, 16};
  666. uint32_t magic_number[] = { 0x55555555, 0x33333333, 0x0F0F0F0F,
  667. 0x00FF00FF, 0x0000FFFF};
  668. uint8_t k = 0;
  669. for (; k <= 4; k++) {
  670. value = (value & magic_number[k]) +
  671. ((value >> shift[k]) & magic_number[k]);
  672. }
  673. return value;
  674. }
  675. /**
  676. * dp_tx_print_bitmap(): Function to print bitmap
  677. * @pdev: dp_pdev
  678. * @ppdu_desc: ppdu completion descriptor
  679. * @user_inder: user index
  680. * @ppdu_id: ppdu id
  681. *
  682. * return: status
  683. */
  684. static
  685. QDF_STATUS dp_tx_print_bitmap(struct dp_pdev *pdev,
  686. struct cdp_tx_completion_ppdu *ppdu_desc,
  687. uint32_t user_index,
  688. uint32_t ppdu_id)
  689. {
  690. struct cdp_tx_completion_ppdu_user *user;
  691. uint8_t i;
  692. uint32_t mpdu_tried;
  693. uint32_t ba_seq_no;
  694. uint32_t start_seq;
  695. uint32_t num_mpdu;
  696. uint32_t fail_num_mpdu = 0;
  697. user = &ppdu_desc->user[user_index];
  698. /* get number of mpdu from ppdu_desc */
  699. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  700. ba_seq_no = user->ba_seq_no;
  701. start_seq = user->start_seq;
  702. num_mpdu = user->mpdu_success;
  703. if (user->tid > DP_MAX_TIDS) {
  704. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  705. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  706. __func__, ppdu_id, user->peer_id, user->tid);
  707. return QDF_STATUS_E_FAILURE;
  708. }
  709. if (mpdu_tried != num_mpdu) {
  710. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  711. "%s: ppdu[%d] peer[%d] tid[%d] ba[%d] start[%d] mpdu_tri[%d] num_mpdu[%d] is_mcast[%d]",
  712. __func__, ppdu_id, user->peer_id, user->tid,
  713. ba_seq_no, start_seq, mpdu_tried,
  714. num_mpdu, user->is_mcast);
  715. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++) {
  716. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  717. QDF_TRACE_LEVEL_INFO,
  718. "ppdu_id[%d] ba_bitmap[0x%x] enqueue_bitmap[0x%x] failed_bitmap[0x%x]",
  719. ppdu_id, user->ba_bitmap[i],
  720. user->enq_bitmap[i],
  721. user->failed_bitmap[i]);
  722. fail_num_mpdu +=
  723. get_number_of_1s(user->failed_bitmap[i]);
  724. }
  725. }
  726. if (fail_num_mpdu == num_mpdu && num_mpdu)
  727. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  728. "%s: %d ppdu_id[%d] num_mpdu[%d, %d]",
  729. __func__, __LINE__, ppdu_id, num_mpdu, fail_num_mpdu);
  730. return QDF_STATUS_SUCCESS;
  731. }
  732. static uint32_t dp_tx_update_80211_hdr(struct dp_pdev *pdev,
  733. struct dp_peer *peer,
  734. void *data,
  735. qdf_nbuf_t nbuf,
  736. uint16_t ether_type,
  737. uint8_t *src_addr)
  738. {
  739. struct cdp_tx_completion_ppdu *ppdu_desc;
  740. struct ieee80211_frame *ptr_wh;
  741. struct ieee80211_qoscntl *ptr_qoscntl;
  742. uint32_t mpdu_buf_len;
  743. uint8_t *ptr_hdr;
  744. uint16_t eth_type = qdf_htons(ether_type);
  745. ppdu_desc = (struct cdp_tx_completion_ppdu *)data;
  746. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  747. ptr_qoscntl = &peer->tx_capture.tx_qoscntl;
  748. /*
  749. * update framectrl only for first ppdu_id
  750. * rest of mpdu will have same frame ctrl
  751. * mac address and duration
  752. */
  753. if (ppdu_desc->ppdu_id != peer->tx_capture.tx_wifi_ppdu_id) {
  754. ptr_wh->i_fc[1] = (ppdu_desc->frame_ctrl & 0xFF00) >> 8;
  755. ptr_wh->i_fc[0] = (ppdu_desc->frame_ctrl & 0xFF);
  756. ptr_wh->i_dur[1] = (ppdu_desc->tx_duration & 0xFF00) >> 8;
  757. ptr_wh->i_dur[0] = (ppdu_desc->tx_duration & 0xFF);
  758. ptr_qoscntl->i_qos[1] = (ppdu_desc->user[0].qos_ctrl &
  759. 0xFF00) >> 8;
  760. ptr_qoscntl->i_qos[0] = (ppdu_desc->user[0].qos_ctrl & 0xFF);
  761. /* Update Addr 3 (SA) with SA derived from ether packet */
  762. qdf_mem_copy(ptr_wh->i_addr3, src_addr, QDF_MAC_ADDR_SIZE);
  763. peer->tx_capture.tx_wifi_ppdu_id = ppdu_desc->ppdu_id;
  764. }
  765. mpdu_buf_len = sizeof(struct ieee80211_frame) + LLC_SNAP_HDR_LEN;
  766. if (qdf_likely(ppdu_desc->user[0].tid != DP_NON_QOS_TID))
  767. mpdu_buf_len += sizeof(struct ieee80211_qoscntl);
  768. nbuf->protocol = qdf_htons(ETH_P_802_2);
  769. /* update ieee80211_frame header */
  770. if (!qdf_nbuf_push_head(nbuf, mpdu_buf_len)) {
  771. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  772. FL("No headroom"));
  773. return QDF_STATUS_E_NOMEM;
  774. }
  775. ptr_hdr = (void *)qdf_nbuf_data(nbuf);
  776. qdf_mem_copy(ptr_hdr, ptr_wh, sizeof(struct ieee80211_frame));
  777. ptr_hdr = ptr_hdr + (sizeof(struct ieee80211_frame));
  778. /* update qoscntl header */
  779. if (qdf_likely(ppdu_desc->user[0].tid != DP_NON_QOS_TID)) {
  780. qdf_mem_copy(ptr_hdr, ptr_qoscntl,
  781. sizeof(struct ieee80211_qoscntl));
  782. ptr_hdr = ptr_hdr + sizeof(struct ieee80211_qoscntl);
  783. }
  784. /* update LLC */
  785. *ptr_hdr = LLC_SNAP_LSAP;
  786. *(ptr_hdr + 1) = LLC_SNAP_LSAP;
  787. *(ptr_hdr + 2) = LLC_UI;
  788. *(ptr_hdr + 3) = 0x00;
  789. *(ptr_hdr + 4) = 0x00;
  790. *(ptr_hdr + 5) = 0x00;
  791. *(ptr_hdr + 6) = (eth_type & 0xFF00) >> 8;
  792. *(ptr_hdr + 7) = (eth_type & 0xFF);
  793. qdf_nbuf_trim_tail(nbuf, qdf_nbuf_len(nbuf) - mpdu_buf_len);
  794. return 0;
  795. }
  796. /**
  797. * dp_tx_mon_restitch_mpdu(): Function to restitch msdu to mpdu
  798. * @pdev: dp_pdev
  799. * @peer: dp_peer
  800. * @head_msdu: head msdu queue
  801. *
  802. * return: status
  803. */
  804. static uint32_t
  805. dp_tx_mon_restitch_mpdu(struct dp_pdev *pdev, struct dp_peer *peer,
  806. struct cdp_tx_completion_ppdu *ppdu_desc,
  807. qdf_nbuf_queue_t *head_msdu,
  808. qdf_nbuf_queue_t *mpdu_q)
  809. {
  810. qdf_nbuf_t curr_nbuf = NULL;
  811. qdf_nbuf_t first_nbuf = NULL;
  812. qdf_nbuf_t prev_nbuf = NULL;
  813. qdf_nbuf_t mpdu_nbuf = NULL;
  814. struct msdu_completion_info *ptr_msdu_info = NULL;
  815. uint8_t first_msdu = 0;
  816. uint8_t last_msdu = 0;
  817. uint32_t frag_list_sum_len = 0;
  818. uint8_t first_msdu_not_seen = 1;
  819. uint16_t ether_type = 0;
  820. qdf_ether_header_t *eh = NULL;
  821. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  822. while (curr_nbuf) {
  823. ptr_msdu_info =
  824. (struct msdu_completion_info *)qdf_nbuf_data(curr_nbuf);
  825. first_msdu = ptr_msdu_info->first_msdu;
  826. last_msdu = ptr_msdu_info->last_msdu;
  827. eh = (qdf_ether_header_t *)(curr_nbuf->data +
  828. sizeof(struct msdu_completion_info));
  829. ether_type = eh->ether_type;
  830. /* pull msdu_completion_info added in pre header */
  831. qdf_nbuf_pull_head(curr_nbuf,
  832. sizeof(struct msdu_completion_info));
  833. if (first_msdu && first_msdu_not_seen) {
  834. first_nbuf = curr_nbuf;
  835. frag_list_sum_len = 0;
  836. first_msdu_not_seen = 0;
  837. /* pull ethernet header from first MSDU alone */
  838. qdf_nbuf_pull_head(curr_nbuf,
  839. sizeof(qdf_ether_header_t));
  840. mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  841. MAX_MONITOR_HEADER,
  842. MAX_MONITOR_HEADER,
  843. 4, FALSE);
  844. if (!mpdu_nbuf) {
  845. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  846. QDF_TRACE_LEVEL_FATAL,
  847. "MPDU head allocation failed !!!");
  848. goto free_ppdu_desc_mpdu_q;
  849. }
  850. dp_tx_update_80211_hdr(pdev, peer,
  851. ppdu_desc, mpdu_nbuf,
  852. ether_type, eh->ether_shost);
  853. /* update first buffer to previous buffer */
  854. prev_nbuf = curr_nbuf;
  855. } else if (first_msdu && !first_msdu_not_seen) {
  856. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  857. QDF_TRACE_LEVEL_FATAL,
  858. "!!!!! NO LAST MSDU\n");
  859. /*
  860. * no last msdu in a mpdu
  861. * handle this case
  862. */
  863. qdf_nbuf_free(curr_nbuf);
  864. /*
  865. * No last msdu found because WBM comes out
  866. * of order, free the pkt
  867. */
  868. goto free_ppdu_desc_mpdu_q;
  869. } else if (!first_msdu && first_msdu_not_seen) {
  870. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  871. QDF_TRACE_LEVEL_FATAL,
  872. "!!!!! NO FIRST MSDU\n");
  873. /*
  874. * no first msdu in a mpdu
  875. * handle this case
  876. */
  877. qdf_nbuf_free(curr_nbuf);
  878. /*
  879. * no first msdu found beacuse WBM comes out
  880. * of order, free the pkt
  881. */
  882. goto free_ppdu_desc_mpdu_q;
  883. } else {
  884. /* update current buffer to previous buffer next */
  885. prev_nbuf->next = curr_nbuf;
  886. /* move the previous buffer to next buffer */
  887. prev_nbuf = prev_nbuf->next;
  888. }
  889. frag_list_sum_len += qdf_nbuf_len(curr_nbuf);
  890. if (last_msdu) {
  891. /*
  892. * first nbuf will hold list of msdu
  893. * stored in prev_nbuf
  894. */
  895. qdf_nbuf_append_ext_list(mpdu_nbuf,
  896. first_nbuf,
  897. frag_list_sum_len);
  898. /* add mpdu to mpdu queue */
  899. qdf_nbuf_queue_add(mpdu_q, mpdu_nbuf);
  900. first_nbuf = NULL;
  901. mpdu_nbuf = NULL;
  902. /* next msdu will start with first msdu */
  903. first_msdu_not_seen = 1;
  904. goto check_for_next_msdu;
  905. }
  906. /* get next msdu from the head_msdu */
  907. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  908. if (!curr_nbuf) {
  909. /* msdu missed in list */
  910. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  911. QDF_TRACE_LEVEL_FATAL,
  912. "!!!! WAITING for msdu but list empty !!!!");
  913. }
  914. continue;
  915. check_for_next_msdu:
  916. if (qdf_nbuf_is_queue_empty(head_msdu))
  917. return 0;
  918. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  919. }
  920. return 0;
  921. free_ppdu_desc_mpdu_q:
  922. /* free already chained msdu pkt */
  923. while (first_nbuf) {
  924. curr_nbuf = first_nbuf;
  925. first_nbuf = first_nbuf->next;
  926. qdf_nbuf_free(curr_nbuf);
  927. }
  928. /* free allocated mpdu hdr */
  929. if (mpdu_nbuf)
  930. qdf_nbuf_free(mpdu_nbuf);
  931. /* free queued remaining msdu pkt per ppdu */
  932. qdf_nbuf_queue_free(head_msdu);
  933. /* free queued mpdu per ppdu */
  934. qdf_nbuf_queue_free(mpdu_q);
  935. return 0;
  936. }
  937. /**
  938. * dp_tx_msdu_dequeue(): Function to dequeue msdu from peer based tid
  939. * @peer: dp_peer
  940. * @ppdu_id: ppdu_id
  941. * @tid: tid
  942. * @num_msdu: number of msdu
  943. * @head: head queue
  944. * @start_tsf: start tsf from ppdu_desc
  945. * @end_tsf: end tsf from ppdu_desc
  946. *
  947. * return: status
  948. */
  949. static
  950. uint32_t dp_tx_msdu_dequeue(struct dp_peer *peer, uint32_t ppdu_id,
  951. uint16_t tid, uint32_t num_msdu,
  952. qdf_nbuf_queue_t *head,
  953. qdf_nbuf_queue_t *head_xretries,
  954. uint32_t start_tsf, uint32_t end_tsf)
  955. {
  956. struct dp_tx_tid *tx_tid = NULL;
  957. uint32_t msdu_ppdu_id;
  958. qdf_nbuf_t curr_msdu = NULL;
  959. qdf_nbuf_t prev_msdu = NULL;
  960. struct msdu_completion_info *ptr_msdu_info = NULL;
  961. uint32_t wbm_tsf;
  962. uint32_t matched = 0;
  963. if (qdf_unlikely(!peer))
  964. return 0;
  965. /* Non-QOS frames are being indicated with TID 0
  966. * in WBM completion path, an hence we should
  967. * TID 0 to reap MSDUs from completion path
  968. */
  969. if (qdf_unlikely(tid == DP_NON_QOS_TID))
  970. tid = 0;
  971. tx_tid = &peer->tx_capture.tx_tid[tid];
  972. if (qdf_unlikely(!tx_tid))
  973. return 0;
  974. if (qdf_nbuf_is_queue_empty(&tx_tid->msdu_comp_q))
  975. return 0;
  976. /* lock here */
  977. qdf_spin_lock_bh(&tx_tid->tid_lock);
  978. curr_msdu = qdf_nbuf_queue_first(&tx_tid->msdu_comp_q);
  979. while (curr_msdu) {
  980. if (qdf_nbuf_queue_len(head) == num_msdu) {
  981. matched = 1;
  982. break;
  983. }
  984. ptr_msdu_info =
  985. (struct msdu_completion_info *)qdf_nbuf_data(curr_msdu);
  986. msdu_ppdu_id = ptr_msdu_info->ppdu_id;
  987. wbm_tsf = ptr_msdu_info->tsf;
  988. if ((ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  989. (ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_AGED)) {
  990. /* Frames removed due to excessive retries */
  991. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  992. qdf_nbuf_queue_add(head_xretries, curr_msdu);
  993. curr_msdu = qdf_nbuf_queue_first(
  994. &tx_tid->msdu_comp_q);
  995. prev_msdu = NULL;
  996. continue;
  997. }
  998. if (wbm_tsf > end_tsf) {
  999. /* PPDU being matched is older than MSDU at head of
  1000. * completion queue. Return matched=1 to skip PPDU
  1001. */
  1002. matched = 1;
  1003. break;
  1004. }
  1005. if (wbm_tsf && (wbm_tsf < start_tsf)) {
  1006. /* remove the aged packet */
  1007. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  1008. qdf_nbuf_free(curr_msdu);
  1009. curr_msdu = qdf_nbuf_queue_first(
  1010. &tx_tid->msdu_comp_q);
  1011. prev_msdu = NULL;
  1012. continue;
  1013. }
  1014. if (msdu_ppdu_id == ppdu_id) {
  1015. if (qdf_likely(!prev_msdu)) {
  1016. /* remove head */
  1017. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  1018. /* add msdu to head queue */
  1019. qdf_nbuf_queue_add(head, curr_msdu);
  1020. /* get next msdu from msdu_comp_q */
  1021. curr_msdu = qdf_nbuf_queue_first(
  1022. &tx_tid->msdu_comp_q);
  1023. continue;
  1024. } else {
  1025. /* update prev_msdu next to current msdu next */
  1026. prev_msdu->next = curr_msdu->next;
  1027. /* set current msdu next as NULL */
  1028. curr_msdu->next = NULL;
  1029. /* decrement length */
  1030. ((qdf_nbuf_queue_t *)(
  1031. &tx_tid->msdu_comp_q))->qlen--;
  1032. /* add msdu to head queue */
  1033. qdf_nbuf_queue_add(head, curr_msdu);
  1034. /* set previous msdu to current msdu */
  1035. curr_msdu = prev_msdu->next;
  1036. continue;
  1037. }
  1038. }
  1039. prev_msdu = curr_msdu;
  1040. curr_msdu = prev_msdu->next;
  1041. }
  1042. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  1043. return matched;
  1044. }
  1045. /**
  1046. * get_mpdu_clone_from_next_ppdu(): Function to clone missing mpdu from
  1047. * next ppdu
  1048. * @nbuf_ppdu_desc_list: nbuf list
  1049. * @ppdu_desc_cnt: ppdu_desc_cnt
  1050. * @missed_seq_no:
  1051. * @ppdu_id: ppdu_id
  1052. * @mpdu_info: cdp_tx_indication_mpdu_info
  1053. *
  1054. * return: void
  1055. */
  1056. static
  1057. qdf_nbuf_t get_mpdu_clone_from_next_ppdu(qdf_nbuf_t nbuf_ppdu_desc_list[],
  1058. uint32_t ppdu_desc_cnt,
  1059. uint16_t missed_seq_no,
  1060. uint16_t peer_id, uint32_t ppdu_id)
  1061. {
  1062. uint32_t i = 0;
  1063. uint32_t found = 0;
  1064. uint32_t seq_no = 0;
  1065. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1066. qdf_nbuf_t mpdu = NULL;
  1067. for (i = 1; i < ppdu_desc_cnt; i++) {
  1068. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1069. qdf_nbuf_data(nbuf_ppdu_desc_list[i]);
  1070. /* check if seq number is between the range */
  1071. if ((peer_id == ppdu_desc->user[0].peer_id) &&
  1072. ((missed_seq_no >= ppdu_desc->user[0].start_seq) &&
  1073. (missed_seq_no <= ppdu_desc->user[0].last_enq_seq))) {
  1074. seq_no = ppdu_desc->user[0].start_seq;
  1075. if (SEQ_BIT(ppdu_desc->user[0].failed_bitmap,
  1076. (missed_seq_no - seq_no))) {
  1077. found = 1;
  1078. break;
  1079. }
  1080. }
  1081. }
  1082. if (found == 0) {
  1083. /* mpdu not found in sched cmd id */
  1084. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  1085. "%s: missed seq_no[%d] ppdu_id[%d] [%d] not found!!!",
  1086. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  1087. return NULL;
  1088. }
  1089. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  1090. "%s: seq_no[%d] missed ppdu_id[%d] m[%d] found in ppdu_id[%d]!!",
  1091. __func__,
  1092. missed_seq_no, ppdu_id,
  1093. (missed_seq_no - seq_no), ppdu_desc->ppdu_id);
  1094. mpdu = qdf_nbuf_queue_first(&ppdu_desc->mpdu_q);
  1095. if (!mpdu) {
  1096. /* bitmap shows it found sequence number, but
  1097. * MPDU not found in PPDU
  1098. */
  1099. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1100. "%s: missed seq_no[%d] ppdu_id[%d] [%d] found but queue empty!!!",
  1101. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  1102. return NULL;
  1103. }
  1104. for (i = 0; i < (missed_seq_no - seq_no); i++) {
  1105. mpdu = mpdu->next;
  1106. if (!mpdu) {
  1107. /*
  1108. * bitmap shows it found sequence number,
  1109. * but queue empty, do we need to allocate
  1110. * skb and send instead of NULL ?
  1111. * add counter here:
  1112. */
  1113. return NULL;
  1114. }
  1115. }
  1116. return qdf_nbuf_copy_expand(mpdu, MAX_MONITOR_HEADER, 0);
  1117. }
  1118. /**
  1119. * dp_tx_update_user_mpdu_info(): Function to update mpdu info
  1120. * from ppdu_desc
  1121. * @ppdu_id: ppdu_id
  1122. * @mpdu_info: cdp_tx_indication_mpdu_info
  1123. * @user: cdp_tx_completion_ppdu_user
  1124. *
  1125. * return: void
  1126. */
  1127. static void
  1128. dp_tx_update_user_mpdu_info(uint32_t ppdu_id,
  1129. struct cdp_tx_indication_mpdu_info *mpdu_info,
  1130. struct cdp_tx_completion_ppdu_user *user)
  1131. {
  1132. mpdu_info->ppdu_id = ppdu_id;
  1133. mpdu_info->frame_ctrl = user->frame_ctrl;
  1134. mpdu_info->qos_ctrl = user->qos_ctrl;
  1135. mpdu_info->tid = user->tid;
  1136. mpdu_info->ltf_size = user->ltf_size;
  1137. mpdu_info->he_re = user->he_re;
  1138. mpdu_info->txbf = user->txbf;
  1139. mpdu_info->bw = user->bw;
  1140. mpdu_info->nss = user->nss;
  1141. mpdu_info->mcs = user->mcs;
  1142. mpdu_info->preamble = user->preamble;
  1143. mpdu_info->gi = user->gi;
  1144. mpdu_info->ack_rssi = user->ack_rssi[0];
  1145. mpdu_info->tx_rate = user->tx_rate;
  1146. mpdu_info->ldpc = user->ldpc;
  1147. mpdu_info->ppdu_cookie = user->ppdu_cookie;
  1148. mpdu_info->long_retries = user->long_retries;
  1149. mpdu_info->short_retries = user->short_retries;
  1150. mpdu_info->completion_status = user->completion_status;
  1151. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, 6);
  1152. mpdu_info->ba_start_seq = user->ba_seq_no;
  1153. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  1154. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  1155. }
  1156. static inline
  1157. void dp_tx_update_sequence_number(qdf_nbuf_t nbuf, uint32_t seq_no)
  1158. {
  1159. struct ieee80211_frame *ptr_wh = NULL;
  1160. uint16_t wh_seq = 0;
  1161. if (!nbuf)
  1162. return;
  1163. /* update sequence number in frame header */
  1164. ptr_wh = (struct ieee80211_frame *)qdf_nbuf_data(nbuf);
  1165. wh_seq = (seq_no & 0xFFF) << 4;
  1166. qdf_mem_copy(ptr_wh->i_seq, &wh_seq, sizeof(uint16_t));
  1167. }
  1168. static inline
  1169. void dp_update_frame_ctrl_from_frame_type(void *desc)
  1170. {
  1171. struct cdp_tx_completion_ppdu *ppdu_desc = desc;
  1172. /* frame control is not set properly, sometimes it is zero */
  1173. switch (ppdu_desc->htt_frame_type) {
  1174. case HTT_STATS_FTYPE_SGEN_NDPA:
  1175. case HTT_STATS_FTYPE_SGEN_NDP:
  1176. case HTT_STATS_FTYPE_SGEN_AX_NDPA:
  1177. case HTT_STATS_FTYPE_SGEN_AX_NDP:
  1178. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_NDPA |
  1179. IEEE80211_FC0_TYPE_CTL);
  1180. break;
  1181. case HTT_STATS_FTYPE_SGEN_BRP:
  1182. case HTT_STATS_FTYPE_SGEN_MU_BRP:
  1183. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BRPOLL |
  1184. IEEE80211_FC0_TYPE_CTL);
  1185. break;
  1186. case HTT_STATS_FTYPE_SGEN_RTS:
  1187. case HTT_STATS_FTYPE_SGEN_MU_RTS:
  1188. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_RTS |
  1189. IEEE80211_FC0_TYPE_CTL);
  1190. break;
  1191. case HTT_STATS_FTYPE_SGEN_CTS:
  1192. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CTS |
  1193. IEEE80211_FC0_TYPE_CTL);
  1194. break;
  1195. case HTT_STATS_FTYPE_SGEN_CFEND:
  1196. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CF_END |
  1197. IEEE80211_FC0_TYPE_CTL);
  1198. break;
  1199. case HTT_STATS_FTYPE_SGEN_MU_TRIG:
  1200. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_TRIGGER |
  1201. IEEE80211_FC0_TYPE_CTL);
  1202. break;
  1203. case HTT_STATS_FTYPE_SGEN_BAR:
  1204. case HTT_STATS_FTYPE_SGEN_MU_BAR:
  1205. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BAR |
  1206. IEEE80211_FC0_TYPE_CTL);
  1207. break;
  1208. }
  1209. }
  1210. /**
  1211. * dp_send_dummy_mpdu_info_to_stack(): send dummy payload to stack
  1212. * to upper layer if complete
  1213. * @pdev: DP pdev handle
  1214. * @desc: cdp tx completion ppdu desc
  1215. *
  1216. * return: status
  1217. */
  1218. static inline
  1219. QDF_STATUS dp_send_dummy_mpdu_info_to_stack(struct dp_pdev *pdev,
  1220. void *desc)
  1221. {
  1222. struct dp_peer *peer;
  1223. struct cdp_tx_completion_ppdu *ppdu_desc = desc;
  1224. struct cdp_tx_completion_ppdu_user *user = &ppdu_desc->user[0];
  1225. struct ieee80211_ctlframe_addr2 *wh_min;
  1226. uint16_t frame_ctrl_le, duration_le;
  1227. struct cdp_tx_indication_info tx_capture_info;
  1228. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1229. uint8_t type, subtype;
  1230. qdf_mem_set(&tx_capture_info,
  1231. sizeof(struct cdp_tx_indication_info),
  1232. 0);
  1233. tx_capture_info.mpdu_nbuf =
  1234. qdf_nbuf_alloc(pdev->soc->osdev,
  1235. MAX_MONITOR_HEADER + MAX_DUMMY_FRM_BODY,
  1236. MAX_MONITOR_HEADER,
  1237. 4, FALSE);
  1238. if (!tx_capture_info.mpdu_nbuf)
  1239. return QDF_STATUS_E_ABORTED;
  1240. mpdu_info = &tx_capture_info.mpdu_info;
  1241. mpdu_info->resp_type = ppdu_desc->resp_type;
  1242. mpdu_info->mprot_type = ppdu_desc->mprot_type;
  1243. mpdu_info->rts_success = ppdu_desc->rts_success;
  1244. mpdu_info->rts_failure = ppdu_desc->rts_failure;
  1245. /* update cdp_tx_indication_mpdu_info */
  1246. dp_tx_update_user_mpdu_info(ppdu_desc->bar_ppdu_id,
  1247. &tx_capture_info.mpdu_info,
  1248. &ppdu_desc->user[0]);
  1249. tx_capture_info.ppdu_desc = ppdu_desc;
  1250. mpdu_info->ppdu_id = ppdu_desc->ppdu_id;
  1251. mpdu_info->channel_num = pdev->operating_channel;
  1252. mpdu_info->channel = ppdu_desc->channel;
  1253. mpdu_info->frame_type = ppdu_desc->frame_type;
  1254. mpdu_info->ppdu_start_timestamp = ppdu_desc->ppdu_start_timestamp;
  1255. mpdu_info->ppdu_end_timestamp = ppdu_desc->ppdu_end_timestamp;
  1256. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1257. mpdu_info->seq_no = user->start_seq;
  1258. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, QDF_MAC_ADDR_SIZE);
  1259. mpdu_info->ba_start_seq = user->ba_seq_no;
  1260. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  1261. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  1262. mpdu_info->frame_ctrl = ppdu_desc->frame_ctrl;
  1263. type = (ppdu_desc->frame_ctrl & IEEE80211_FC0_TYPE_MASK);
  1264. subtype = (ppdu_desc->frame_ctrl & IEEE80211_FC0_SUBTYPE_MASK);
  1265. if (type == IEEE80211_FC0_TYPE_CTL &&
  1266. subtype == IEEE80211_FC0_SUBTYPE_BAR) {
  1267. mpdu_info->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BAR |
  1268. IEEE80211_FC0_TYPE_CTL);
  1269. mpdu_info->ppdu_id = ppdu_desc->bar_ppdu_id;
  1270. mpdu_info->ppdu_start_timestamp =
  1271. ppdu_desc->bar_ppdu_start_timestamp;
  1272. mpdu_info->ppdu_end_timestamp =
  1273. ppdu_desc->bar_ppdu_end_timestamp;
  1274. mpdu_info->tx_duration = ppdu_desc->bar_tx_duration;
  1275. }
  1276. wh_min = (struct ieee80211_ctlframe_addr2 *)
  1277. qdf_nbuf_data(
  1278. tx_capture_info.mpdu_nbuf);
  1279. qdf_mem_zero(wh_min, MAX_DUMMY_FRM_BODY);
  1280. frame_ctrl_le =
  1281. qdf_cpu_to_le16(mpdu_info->frame_ctrl);
  1282. duration_le =
  1283. qdf_cpu_to_le16(ppdu_desc->bar_tx_duration);
  1284. wh_min->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  1285. wh_min->i_fc[0] = (frame_ctrl_le & 0xFF);
  1286. wh_min->i_aidordur[1] = (duration_le & 0xFF00) >> 8;
  1287. wh_min->i_aidordur[0] = (duration_le & 0xFF);
  1288. qdf_mem_copy(wh_min->i_addr1,
  1289. mpdu_info->mac_address,
  1290. QDF_MAC_ADDR_SIZE);
  1291. peer = dp_peer_find_by_id(pdev->soc, user->peer_id);
  1292. if (peer) {
  1293. struct dp_vdev *vdev = NULL;
  1294. vdev = peer->vdev;
  1295. if (vdev)
  1296. qdf_mem_copy(wh_min->i_addr2,
  1297. vdev->mac_addr.raw,
  1298. QDF_MAC_ADDR_SIZE);
  1299. dp_peer_unref_del_find_by_id(peer);
  1300. }
  1301. qdf_nbuf_set_pktlen(tx_capture_info.mpdu_nbuf,
  1302. sizeof(*wh_min));
  1303. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1304. QDF_TRACE_LEVEL_DEBUG,
  1305. "HTT_FTYPE[%d] frm(0x%08x): fc %x %x, dur 0x%x%x\n",
  1306. ppdu_desc->htt_frame_type, mpdu_info->ppdu_id,
  1307. wh_min->i_fc[1], wh_min->i_fc[0],
  1308. wh_min->i_aidordur[1], wh_min->i_aidordur[0]);
  1309. /*
  1310. * send MPDU to osif layer
  1311. */
  1312. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1313. &tx_capture_info, HTT_INVALID_PEER,
  1314. WDI_NO_VAL, pdev->pdev_id);
  1315. if (tx_capture_info.mpdu_nbuf)
  1316. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1317. return QDF_STATUS_SUCCESS;
  1318. }
  1319. /**
  1320. * dp_send_dummy_rts_cts_frame(): send dummy rts and cts frame out
  1321. * to upper layer if complete
  1322. * @pdev: DP pdev handle
  1323. * @cur_ppdu_desc: cdp tx completion ppdu desc
  1324. *
  1325. * return: void
  1326. */
  1327. static
  1328. void dp_send_dummy_rts_cts_frame(struct dp_pdev *pdev,
  1329. struct cdp_tx_completion_ppdu *cur_ppdu_desc)
  1330. {
  1331. struct cdp_tx_completion_ppdu *ppdu_desc;
  1332. struct dp_pdev_tx_capture *ptr_tx_cap;
  1333. struct dp_peer *peer;
  1334. uint8_t rts_send;
  1335. rts_send = 0;
  1336. ptr_tx_cap = &pdev->tx_capture;
  1337. ppdu_desc = &ptr_tx_cap->dummy_ppdu_desc;
  1338. ppdu_desc->channel = cur_ppdu_desc->channel;
  1339. ppdu_desc->num_mpdu = 1;
  1340. ppdu_desc->num_msdu = 1;
  1341. ppdu_desc->user[0].ppdu_type = HTT_PPDU_STATS_PPDU_TYPE_SU;
  1342. ppdu_desc->bar_num_users = 0;
  1343. ppdu_desc->num_users = 1;
  1344. if (cur_ppdu_desc->mprot_type == SEND_WIFIRTS_LEGACY_E ||
  1345. cur_ppdu_desc->mprot_type == SEND_WIFIRTS_11AC_DYNAMIC_BW_E ||
  1346. cur_ppdu_desc->mprot_type == SEND_WIFIRTS_11AC_STATIC_BW_E) {
  1347. rts_send = 1;
  1348. /*
  1349. * send dummy RTS frame followed by CTS
  1350. * update frame_ctrl and htt_frame_type
  1351. */
  1352. ppdu_desc->htt_frame_type = HTT_STATS_FTYPE_SGEN_RTS;
  1353. ppdu_desc->frame_type = CDP_PPDU_FTYPE_CTRL;
  1354. ppdu_desc->ppdu_start_timestamp =
  1355. cur_ppdu_desc->ppdu_start_timestamp;
  1356. ppdu_desc->ppdu_end_timestamp =
  1357. cur_ppdu_desc->ppdu_end_timestamp;
  1358. ppdu_desc->user[0].peer_id = cur_ppdu_desc->user[0].peer_id;
  1359. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_RTS |
  1360. IEEE80211_FC0_TYPE_CTL);
  1361. qdf_mem_copy(&ppdu_desc->user[0].mac_addr,
  1362. &cur_ppdu_desc->user[0].mac_addr,
  1363. QDF_MAC_ADDR_SIZE);
  1364. dp_send_dummy_mpdu_info_to_stack(pdev, ppdu_desc);
  1365. }
  1366. if ((rts_send && cur_ppdu_desc->rts_success) ||
  1367. cur_ppdu_desc->mprot_type == SEND_WIFICTS2SELF_E) {
  1368. /* send dummy CTS frame */
  1369. ppdu_desc->htt_frame_type = HTT_STATS_FTYPE_SGEN_CTS;
  1370. ppdu_desc->frame_type = CDP_PPDU_FTYPE_CTRL;
  1371. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CTS |
  1372. IEEE80211_FC0_TYPE_CTL);
  1373. ppdu_desc->ppdu_start_timestamp =
  1374. cur_ppdu_desc->ppdu_start_timestamp;
  1375. ppdu_desc->ppdu_end_timestamp =
  1376. cur_ppdu_desc->ppdu_end_timestamp;
  1377. ppdu_desc->user[0].peer_id = cur_ppdu_desc->user[0].peer_id;
  1378. peer = dp_peer_find_by_id(pdev->soc,
  1379. cur_ppdu_desc->user[0].peer_id);
  1380. if (peer) {
  1381. struct dp_vdev *vdev = NULL;
  1382. vdev = peer->vdev;
  1383. if (vdev)
  1384. qdf_mem_copy(&ppdu_desc->user[0].mac_addr,
  1385. vdev->mac_addr.raw,
  1386. QDF_MAC_ADDR_SIZE);
  1387. dp_peer_unref_del_find_by_id(peer);
  1388. }
  1389. dp_send_dummy_mpdu_info_to_stack(pdev, ppdu_desc);
  1390. }
  1391. }
  1392. /**
  1393. * dp_send_data_to_stack(): Function to deliver mpdu info to stack
  1394. * to upper layer
  1395. * @pdev: DP pdev handle
  1396. * @nbuf_ppdu_desc_list: ppdu_desc_list per sched cmd id
  1397. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  1398. *
  1399. * return: status
  1400. */
  1401. static
  1402. void dp_send_data_to_stack(struct dp_pdev *pdev,
  1403. struct cdp_tx_completion_ppdu *ppdu_desc)
  1404. {
  1405. struct cdp_tx_indication_info tx_capture_info;
  1406. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1407. int i;
  1408. uint32_t seq_no, start_seq;
  1409. uint32_t ppdu_id = ppdu_desc->ppdu_id;
  1410. qdf_mem_set(&tx_capture_info,
  1411. sizeof(struct cdp_tx_indication_info),
  1412. 0);
  1413. mpdu_info = &tx_capture_info.mpdu_info;
  1414. mpdu_info->channel = ppdu_desc->channel;
  1415. mpdu_info->frame_type = ppdu_desc->frame_type;
  1416. mpdu_info->ppdu_start_timestamp =
  1417. ppdu_desc->ppdu_start_timestamp;
  1418. mpdu_info->ppdu_end_timestamp =
  1419. ppdu_desc->ppdu_end_timestamp;
  1420. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1421. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  1422. mpdu_info->resp_type = ppdu_desc->resp_type;
  1423. mpdu_info->mprot_type = ppdu_desc->mprot_type;
  1424. mpdu_info->rts_success = ppdu_desc->rts_success;
  1425. mpdu_info->rts_failure = ppdu_desc->rts_failure;
  1426. /* update cdp_tx_indication_mpdu_info */
  1427. dp_tx_update_user_mpdu_info(ppdu_id,
  1428. &tx_capture_info.mpdu_info,
  1429. &ppdu_desc->user[0]);
  1430. tx_capture_info.ppdu_desc = ppdu_desc;
  1431. tx_capture_info.mpdu_info.channel_num =
  1432. pdev->operating_channel;
  1433. if (ppdu_desc->mprot_type)
  1434. dp_send_dummy_rts_cts_frame(pdev, ppdu_desc);
  1435. start_seq = ppdu_desc->user[0].start_seq;
  1436. for (i = 0; i < ppdu_desc->user[0].ba_size; i++) {
  1437. if (qdf_likely(ppdu_desc->user[0].tid !=
  1438. DP_NON_QOS_TID) &&
  1439. !(SEQ_BIT(ppdu_desc->user[0].enq_bitmap, i))) {
  1440. continue;
  1441. }
  1442. seq_no = start_seq + i;
  1443. if (!ppdu_desc->mpdus[i])
  1444. continue;
  1445. tx_capture_info.mpdu_nbuf = ppdu_desc->mpdus[i];
  1446. ppdu_desc->mpdus[i] = NULL;
  1447. mpdu_info->seq_no = seq_no;
  1448. dp_tx_update_sequence_number(tx_capture_info.mpdu_nbuf, seq_no);
  1449. /*
  1450. * send MPDU to osif layer
  1451. * do we need to update mpdu_info before tranmit
  1452. * get current mpdu_nbuf
  1453. */
  1454. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1455. &tx_capture_info,
  1456. HTT_INVALID_PEER,
  1457. WDI_NO_VAL, pdev->pdev_id);
  1458. if (tx_capture_info.mpdu_nbuf)
  1459. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1460. }
  1461. }
  1462. static void
  1463. dp_tx_mon_proc_xretries(struct dp_pdev *pdev, struct dp_peer *peer,
  1464. uint16_t tid)
  1465. {
  1466. struct dp_tx_tid *tx_tid = &peer->tx_capture.tx_tid[tid];
  1467. struct cdp_tx_completion_ppdu *ppdu_desc;
  1468. struct cdp_tx_completion_ppdu *xretry_ppdu;
  1469. qdf_nbuf_t ppdu_nbuf;
  1470. qdf_nbuf_t mpdu_nbuf;
  1471. uint32_t mpdu_tried = 0;
  1472. int i;
  1473. uint32_t seq_no;
  1474. xretry_ppdu = &tx_tid->xretry_ppdu;
  1475. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  1476. qdf_nbuf_queue_free(&xretry_ppdu->mpdu_q);
  1477. return;
  1478. }
  1479. if (qdf_nbuf_is_queue_empty(&xretry_ppdu->mpdu_q))
  1480. return;
  1481. ppdu_nbuf = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  1482. while (ppdu_nbuf) {
  1483. struct msdu_completion_info *ptr_msdu_info = NULL;
  1484. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1485. qdf_nbuf_data(ppdu_nbuf);
  1486. if (ppdu_desc->pending_retries) {
  1487. uint32_t start_seq = ppdu_desc->user[0].start_seq;
  1488. mpdu_tried = ppdu_desc->user[0].mpdu_tried_ucast +
  1489. ppdu_desc->user[0].mpdu_tried_mcast;
  1490. mpdu_nbuf = qdf_nbuf_queue_first(&xretry_ppdu->mpdu_q);
  1491. for (i = 0; (mpdu_tried > 0) && mpdu_nbuf; i++) {
  1492. if (!(SEQ_BIT(ppdu_desc->user[0].enq_bitmap,
  1493. i)))
  1494. continue;
  1495. mpdu_tried--;
  1496. /* missed seq number */
  1497. seq_no = start_seq + i;
  1498. if (SEQ_BIT(ppdu_desc->user[0].failed_bitmap, i))
  1499. continue;
  1500. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1501. QDF_TRACE_LEVEL_INFO,
  1502. "%s: fill seqno %d from xretries",
  1503. __func__, seq_no);
  1504. ptr_msdu_info = (struct msdu_completion_info *)
  1505. (qdf_nbuf_data(qdf_nbuf_get_ext_list(
  1506. mpdu_nbuf)) -
  1507. (sizeof(struct msdu_completion_info) +
  1508. sizeof(qdf_ether_header_t)));
  1509. ptr_msdu_info->transmit_cnt--;
  1510. SEQ_SEG(ppdu_desc->user[0].failed_bitmap, i) |=
  1511. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[0],
  1512. i);
  1513. ppdu_desc->pending_retries--;
  1514. if (ptr_msdu_info->transmit_cnt == 0) {
  1515. ppdu_desc->mpdus[seq_no - start_seq] =
  1516. mpdu_nbuf;
  1517. qdf_nbuf_queue_remove(
  1518. &xretry_ppdu->mpdu_q);
  1519. mpdu_nbuf = qdf_nbuf_queue_first(
  1520. &xretry_ppdu->mpdu_q);
  1521. } else {
  1522. ppdu_desc->mpdus[seq_no - start_seq] =
  1523. qdf_nbuf_copy_expand(mpdu_nbuf,
  1524. MAX_MONITOR_HEADER,
  1525. 0);
  1526. mpdu_nbuf =
  1527. qdf_nbuf_queue_next(mpdu_nbuf);
  1528. }
  1529. }
  1530. }
  1531. if ((ppdu_desc->pending_retries == 0) && (ppdu_nbuf ==
  1532. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q))) {
  1533. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  1534. /* Deliver PPDU */
  1535. dp_send_data_to_stack(pdev, ppdu_desc);
  1536. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1537. qdf_mem_free(ppdu_desc->mpdus);
  1538. ppdu_desc->mpdus = NULL;
  1539. qdf_nbuf_free(ppdu_nbuf);
  1540. ppdu_nbuf = qdf_nbuf_queue_first(
  1541. &tx_tid->pending_ppdu_q);
  1542. } else {
  1543. ppdu_nbuf = qdf_nbuf_queue_next(ppdu_nbuf);
  1544. }
  1545. }
  1546. qdf_nbuf_queue_free(&xretry_ppdu->mpdu_q);
  1547. }
  1548. #define MAX_PENDING_PPDUS 32
  1549. static void
  1550. dp_tx_mon_proc_pending_ppdus(struct dp_pdev *pdev, struct dp_tx_tid *tx_tid,
  1551. qdf_nbuf_t nbuf_ppdu_desc_list[], uint32_t
  1552. ppdu_desc_cnt, qdf_nbuf_queue_t *head_ppdu,
  1553. uint32_t peer_id)
  1554. {
  1555. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1556. struct cdp_tx_completion_ppdu *cur_ppdu_desc = NULL;
  1557. qdf_nbuf_t pend_ppdu;
  1558. uint32_t ppdu_cnt;
  1559. uint32_t failed_seq;
  1560. uint32_t cur_index, cur_start_seq, cur_last_seq;
  1561. int i, k;
  1562. bool last_pend_ppdu = false;
  1563. qdf_nbuf_t tmp_nbuf;
  1564. pend_ppdu = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  1565. if (!pend_ppdu) {
  1566. for (ppdu_cnt = 0; ppdu_cnt < ppdu_desc_cnt; ppdu_cnt++) {
  1567. if (!nbuf_ppdu_desc_list[ppdu_cnt])
  1568. continue;
  1569. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1570. qdf_nbuf_data(
  1571. nbuf_ppdu_desc_list[ppdu_cnt]);
  1572. if (!ppdu_desc || (peer_id !=
  1573. ppdu_desc->user[0].peer_id) || (tx_tid->tid !=
  1574. ppdu_desc->user[0].tid))
  1575. continue;
  1576. if ((ppdu_desc->pending_retries == 0) &&
  1577. qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q) &&
  1578. qdf_nbuf_is_queue_empty(head_ppdu)) {
  1579. dp_send_data_to_stack(pdev, ppdu_desc);
  1580. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1581. qdf_mem_free(ppdu_desc->mpdus);
  1582. ppdu_desc->mpdus = NULL;
  1583. tmp_nbuf = nbuf_ppdu_desc_list[ppdu_cnt];
  1584. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1585. qdf_nbuf_free(tmp_nbuf);
  1586. } else {
  1587. qdf_nbuf_queue_add(head_ppdu,
  1588. nbuf_ppdu_desc_list[ppdu_cnt]);
  1589. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1590. }
  1591. }
  1592. return;
  1593. }
  1594. while (pend_ppdu) {
  1595. qdf_nbuf_t mpdu_nbuf;
  1596. /* Find missing mpdus from current schedule list */
  1597. ppdu_cnt = 0;
  1598. if (!nbuf_ppdu_desc_list[ppdu_cnt]) {
  1599. ppdu_cnt++;
  1600. if (ppdu_cnt < ppdu_desc_cnt)
  1601. continue;
  1602. break;
  1603. }
  1604. ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  1605. pend_ppdu);
  1606. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  1607. nbuf_ppdu_desc_list[ppdu_cnt]);
  1608. if (pend_ppdu == qdf_nbuf_queue_last(
  1609. &tx_tid->pending_ppdu_q)) {
  1610. last_pend_ppdu = true;
  1611. qdf_nbuf_queue_add(head_ppdu,
  1612. nbuf_ppdu_desc_list[ppdu_cnt]);
  1613. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1614. }
  1615. cur_index = 0;
  1616. cur_start_seq = cur_ppdu_desc->user[0].start_seq;
  1617. cur_last_seq = cur_ppdu_desc->user[0].last_enq_seq;
  1618. if (qdf_unlikely(ppdu_desc->user[0].ba_size >
  1619. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  1620. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))) {
  1621. qdf_assert_always(0);
  1622. return;
  1623. }
  1624. for (i = 0; (i < ppdu_desc->user[0].ba_size) && cur_ppdu_desc;
  1625. i++) {
  1626. if (!(i & (SEQ_SEG_SZ_BITS(
  1627. ppdu_desc->user[0].failed_bitmap) - 1))) {
  1628. k =
  1629. SEQ_SEG_INDEX(ppdu_desc->user[0].failed_bitmap,
  1630. i);
  1631. failed_seq =
  1632. ppdu_desc->user[0].failed_bitmap[k] ^
  1633. ppdu_desc->user[0].enq_bitmap[k];
  1634. }
  1635. /* Skip to next bitmap segment if there are no
  1636. * more holes in current segment
  1637. */
  1638. if (!failed_seq) {
  1639. i = ((k + 1) *
  1640. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))
  1641. - 1;
  1642. continue;
  1643. }
  1644. if (!(SEQ_SEG_BIT(failed_seq, i)))
  1645. continue;
  1646. failed_seq ^= SEQ_SEG_MSK(failed_seq, i);
  1647. mpdu_nbuf = cur_ppdu_desc->mpdus[cur_index];
  1648. if (mpdu_nbuf) {
  1649. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1650. QDF_TRACE_LEVEL_INFO,
  1651. "%s: fill seqno %d (%d) from swretries",
  1652. __func__,
  1653. ppdu_desc->user[0].start_seq + i,
  1654. ppdu_desc->ppdu_id);
  1655. ppdu_desc->mpdus[i] =
  1656. qdf_nbuf_copy_expand(mpdu_nbuf,
  1657. MAX_MONITOR_HEADER, 0);
  1658. ppdu_desc->user[0].failed_bitmap[k] |=
  1659. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[k],
  1660. i);
  1661. ppdu_desc->pending_retries--;
  1662. }
  1663. cur_index++;
  1664. if (cur_index >= cur_ppdu_desc->user[0].ba_size) {
  1665. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1666. QDF_TRACE_LEVEL_INFO,
  1667. "%s: ba_size[%d] cur_index[%d]\n",
  1668. __func__,
  1669. cur_ppdu_desc->user[0].ba_size,
  1670. cur_index);
  1671. break;
  1672. }
  1673. /* Skip through empty slots in current PPDU */
  1674. while (!(SEQ_BIT(cur_ppdu_desc->user[0].enq_bitmap,
  1675. cur_index))) {
  1676. struct cdp_tx_completion_ppdu *next_ppdu = NULL;
  1677. cur_index++;
  1678. if (cur_index <= (cur_last_seq -
  1679. cur_start_seq))
  1680. continue;
  1681. cur_ppdu_desc = NULL;
  1682. /* Check if subsequent PPDUs in this schedule
  1683. * has higher sequence numbers enqueued
  1684. */
  1685. while (ppdu_cnt < (ppdu_desc_cnt - 1)) {
  1686. ppdu_cnt++;
  1687. if (!nbuf_ppdu_desc_list[ppdu_cnt])
  1688. continue;
  1689. next_ppdu =
  1690. (struct cdp_tx_completion_ppdu *)
  1691. qdf_nbuf_data(
  1692. nbuf_ppdu_desc_list[
  1693. ppdu_cnt]);
  1694. if (!next_ppdu || (peer_id !=
  1695. next_ppdu->user[0].peer_id))
  1696. continue;
  1697. if (last_pend_ppdu) {
  1698. qdf_nbuf_queue_add(head_ppdu,
  1699. nbuf_ppdu_desc_list[ppdu_cnt]);
  1700. nbuf_ppdu_desc_list[ppdu_cnt] =
  1701. NULL;
  1702. }
  1703. if (next_ppdu->user[0].last_enq_seq >
  1704. cur_last_seq) {
  1705. cur_ppdu_desc = next_ppdu;
  1706. break;
  1707. }
  1708. }
  1709. if (!cur_ppdu_desc)
  1710. break;
  1711. /* Start from seq. no following cur_last_seq
  1712. * since everything before is already populated
  1713. * from previous PPDU
  1714. */
  1715. cur_start_seq =
  1716. cur_ppdu_desc->user[0].start_seq;
  1717. cur_index = (cur_last_seq >= cur_start_seq) ?
  1718. cur_last_seq - cur_start_seq + 1 : 0;
  1719. cur_last_seq =
  1720. cur_ppdu_desc->user[0].last_enq_seq;
  1721. }
  1722. }
  1723. if ((pend_ppdu ==
  1724. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q)) &&
  1725. (ppdu_desc->pending_retries == 0)) {
  1726. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  1727. dp_send_data_to_stack(pdev, ppdu_desc);
  1728. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1729. qdf_mem_free(ppdu_desc->mpdus);
  1730. ppdu_desc->mpdus = NULL;
  1731. qdf_nbuf_free(pend_ppdu);
  1732. pend_ppdu = qdf_nbuf_queue_first(
  1733. &tx_tid->pending_ppdu_q);
  1734. } else {
  1735. pend_ppdu = qdf_nbuf_queue_next(pend_ppdu);
  1736. }
  1737. }
  1738. }
  1739. static uint32_t
  1740. dp_send_mgmt_ctrl_to_stack(struct dp_pdev *pdev,
  1741. qdf_nbuf_t nbuf_ppdu_desc,
  1742. struct cdp_tx_indication_info *ptr_tx_cap_info,
  1743. qdf_nbuf_t mgmt_ctl_nbuf,
  1744. bool is_payload)
  1745. {
  1746. struct cdp_tx_completion_ppdu *ppdu_desc;
  1747. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1748. struct ieee80211_frame *wh;
  1749. uint16_t duration_le, seq_le;
  1750. struct ieee80211_frame_min_one *wh_min;
  1751. uint16_t frame_ctrl_le;
  1752. uint8_t type, subtype;
  1753. mpdu_info = &ptr_tx_cap_info->mpdu_info;
  1754. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1755. qdf_nbuf_data(nbuf_ppdu_desc);
  1756. type = (ppdu_desc->frame_ctrl &
  1757. IEEE80211_FC0_TYPE_MASK) >>
  1758. IEEE80211_FC0_TYPE_SHIFT;
  1759. subtype = (ppdu_desc->frame_ctrl &
  1760. IEEE80211_FC0_SUBTYPE_MASK) >>
  1761. IEEE80211_FC0_SUBTYPE_SHIFT;
  1762. if (is_payload) {
  1763. wh = (struct ieee80211_frame *)qdf_nbuf_data(mgmt_ctl_nbuf);
  1764. if (subtype != IEEE80211_FC0_SUBTYPE_BEACON) {
  1765. duration_le = qdf_cpu_to_le16(ppdu_desc->tx_duration);
  1766. wh->i_dur[1] = (duration_le & 0xFF00) >> 8;
  1767. wh->i_dur[0] = duration_le & 0xFF;
  1768. seq_le = qdf_cpu_to_le16(ppdu_desc->user[0].start_seq <<
  1769. IEEE80211_SEQ_SEQ_SHIFT);
  1770. wh->i_seq[1] = (seq_le & 0xFF00) >> 8;
  1771. wh->i_seq[0] = seq_le & 0xFF;
  1772. }
  1773. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1774. QDF_TRACE_LEVEL_DEBUG,
  1775. "ctrl/mgmt frm(0x%08x): fc 0x%x 0x%x\n",
  1776. ptr_tx_cap_info->mpdu_info.ppdu_id,
  1777. wh->i_fc[1], wh->i_fc[0]);
  1778. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1779. QDF_TRACE_LEVEL_DEBUG,
  1780. "desc->ppdu_id 0x%08x\n", ppdu_desc->ppdu_id);
  1781. /* append ext list */
  1782. qdf_nbuf_append_ext_list(ptr_tx_cap_info->mpdu_nbuf,
  1783. mgmt_ctl_nbuf,
  1784. qdf_nbuf_len(mgmt_ctl_nbuf));
  1785. } else {
  1786. wh_min = (struct ieee80211_frame_min_one *)
  1787. qdf_nbuf_data(ptr_tx_cap_info->mpdu_nbuf);
  1788. qdf_mem_zero(wh_min, MAX_DUMMY_FRM_BODY);
  1789. frame_ctrl_le = qdf_cpu_to_le16(ppdu_desc->frame_ctrl);
  1790. duration_le = qdf_cpu_to_le16(ppdu_desc->tx_duration);
  1791. wh_min->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  1792. wh_min->i_fc[0] = (frame_ctrl_le & 0xFF);
  1793. wh_min->i_dur[1] = (duration_le & 0xFF00) >> 8;
  1794. wh_min->i_dur[0] = (duration_le & 0xFF);
  1795. qdf_mem_copy(wh_min->i_addr1, mpdu_info->mac_address,
  1796. QDF_MAC_ADDR_SIZE);
  1797. qdf_nbuf_set_pktlen(ptr_tx_cap_info->mpdu_nbuf,
  1798. sizeof(*wh_min));
  1799. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1800. QDF_TRACE_LEVEL_DEBUG,
  1801. "frm(0x%08x): fc %x %x, dur 0x%x%x\n",
  1802. ptr_tx_cap_info->mpdu_info.ppdu_id,
  1803. wh_min->i_fc[1], wh_min->i_fc[0],
  1804. wh_min->i_dur[1], wh_min->i_dur[0]);
  1805. }
  1806. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1807. ptr_tx_cap_info, HTT_INVALID_PEER,
  1808. WDI_NO_VAL, pdev->pdev_id);
  1809. if (ptr_tx_cap_info->mpdu_nbuf)
  1810. qdf_nbuf_free(ptr_tx_cap_info->mpdu_nbuf);
  1811. return 0;
  1812. }
  1813. static uint32_t
  1814. dp_update_tx_cap_info(struct dp_pdev *pdev,
  1815. qdf_nbuf_t nbuf_ppdu_desc,
  1816. void *tx_info, bool is_payload)
  1817. {
  1818. struct cdp_tx_completion_ppdu *ppdu_desc;
  1819. struct cdp_tx_indication_info *tx_capture_info =
  1820. (struct cdp_tx_indication_info *)tx_info;
  1821. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1822. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1823. qdf_nbuf_data(nbuf_ppdu_desc);
  1824. qdf_mem_set(tx_capture_info, sizeof(struct cdp_tx_indication_info), 0);
  1825. mpdu_info = &tx_capture_info->mpdu_info;
  1826. mpdu_info->channel = ppdu_desc->channel;
  1827. mpdu_info->frame_type = ppdu_desc->frame_type;
  1828. mpdu_info->ppdu_start_timestamp = ppdu_desc->ppdu_start_timestamp;
  1829. mpdu_info->ppdu_end_timestamp = ppdu_desc->ppdu_end_timestamp;
  1830. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1831. mpdu_info->seq_no = ppdu_desc->user[0].start_seq;
  1832. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  1833. /* update cdp_tx_indication_mpdu_info */
  1834. dp_tx_update_user_mpdu_info(ppdu_desc->ppdu_id,
  1835. &tx_capture_info->mpdu_info,
  1836. &ppdu_desc->user[0]);
  1837. tx_capture_info->ppdu_desc = ppdu_desc;
  1838. tx_capture_info->mpdu_info.channel_num = pdev->operating_channel;
  1839. tx_capture_info->mpdu_info.ppdu_id = ppdu_desc->ppdu_id;
  1840. if (is_payload)
  1841. tx_capture_info->mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  1842. MAX_MONITOR_HEADER,
  1843. MAX_MONITOR_HEADER,
  1844. 4, FALSE);
  1845. else
  1846. tx_capture_info->mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  1847. MAX_MONITOR_HEADER +
  1848. MAX_DUMMY_FRM_BODY,
  1849. MAX_MONITOR_HEADER,
  1850. 4, FALSE);
  1851. return 0;
  1852. }
  1853. static uint32_t
  1854. dp_check_mgmt_ctrl_ppdu(struct dp_pdev *pdev,
  1855. qdf_nbuf_t nbuf_ppdu_desc)
  1856. {
  1857. struct cdp_tx_indication_info tx_capture_info;
  1858. qdf_nbuf_t mgmt_ctl_nbuf;
  1859. uint8_t type, subtype;
  1860. bool is_sgen_pkt;
  1861. struct cdp_tx_mgmt_comp_info *ptr_comp_info;
  1862. qdf_nbuf_queue_t *retries_q;
  1863. struct cdp_tx_completion_ppdu *ppdu_desc;
  1864. uint32_t ppdu_id;
  1865. size_t head_size;
  1866. uint32_t status = 1;
  1867. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1868. qdf_nbuf_data(nbuf_ppdu_desc);
  1869. /*
  1870. * only for host generated frame we do have
  1871. * timestamp and retries count.
  1872. */
  1873. head_size = sizeof(struct cdp_tx_mgmt_comp_info);
  1874. type = (ppdu_desc->frame_ctrl &
  1875. IEEE80211_FC0_TYPE_MASK) >>
  1876. IEEE80211_FC0_TYPE_SHIFT;
  1877. subtype = (ppdu_desc->frame_ctrl &
  1878. IEEE80211_FC0_SUBTYPE_MASK) >>
  1879. IEEE80211_FC0_SUBTYPE_SHIFT;
  1880. if (ppdu_desc->htt_frame_type == HTT_STATS_FTYPE_SGEN_NDP) {
  1881. dp_update_frame_ctrl_from_frame_type(ppdu_desc);
  1882. type = 0;
  1883. subtype = 0;
  1884. }
  1885. retries_q = &pdev->tx_capture.retries_ctl_mgmt_q[type][subtype];
  1886. get_mgmt_pkt_from_queue:
  1887. qdf_spin_lock_bh(
  1888. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1889. mgmt_ctl_nbuf = qdf_nbuf_queue_remove(
  1890. &pdev->tx_capture.ctl_mgmt_q[type][subtype]);
  1891. qdf_spin_unlock_bh(&pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1892. if (mgmt_ctl_nbuf) {
  1893. qdf_nbuf_t tmp_mgmt_ctl_nbuf;
  1894. uint32_t start_tsf;
  1895. ptr_comp_info = (struct cdp_tx_mgmt_comp_info *)
  1896. qdf_nbuf_data(mgmt_ctl_nbuf);
  1897. is_sgen_pkt = ptr_comp_info->is_sgen_pkt;
  1898. ppdu_id = ptr_comp_info->ppdu_id;
  1899. if (!is_sgen_pkt && ptr_comp_info->tx_tsf <
  1900. ppdu_desc->ppdu_start_timestamp) {
  1901. /*
  1902. * free the older mgmt buffer from
  1903. * the queue and get new mgmt buffer
  1904. */
  1905. qdf_nbuf_free(mgmt_ctl_nbuf);
  1906. goto get_mgmt_pkt_from_queue;
  1907. }
  1908. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1909. QDF_TRACE_LEVEL_INFO_HIGH,
  1910. "ppdu_id [%d 0x%x] type_subtype[%d %d] is_sgen[%d] h_sz[%d]",
  1911. ppdu_id, ppdu_id, type, subtype,
  1912. is_sgen_pkt, head_size);
  1913. QDF_TRACE_HEX_DUMP(QDF_MODULE_ID_TX_CAPTURE,
  1914. QDF_TRACE_LEVEL_INFO_HIGH,
  1915. qdf_nbuf_data(mgmt_ctl_nbuf), 32);
  1916. /*
  1917. * for sgen frame we won't have, retries count
  1918. * and 64 bits tsf in the head.
  1919. */
  1920. if (ppdu_id != ppdu_desc->ppdu_id) {
  1921. if (is_sgen_pkt) {
  1922. start_tsf = (ppdu_desc->ppdu_start_timestamp &
  1923. LOWER_32_MASK);
  1924. if ((ptr_comp_info->tx_tsf <
  1925. (start_tsf + MAX_MGMT_ENQ_DELAY)) &&
  1926. ((ppdu_id & SCH_ID_MASK) <
  1927. (ppdu_desc->ppdu_id & SCH_ID_MASK))) {
  1928. /*
  1929. * free the older mgmt buffer from
  1930. * the queue and get new mgmt buffer
  1931. */
  1932. qdf_nbuf_free(mgmt_ctl_nbuf);
  1933. goto get_mgmt_pkt_from_queue;
  1934. }
  1935. }
  1936. if (ppdu_desc->user[0].completion_status ==
  1937. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  1938. qdf_nbuf_free(nbuf_ppdu_desc);
  1939. status = 0;
  1940. goto free_ppdu_desc;
  1941. }
  1942. /*
  1943. * add the ppdu_desc into retry queue
  1944. */
  1945. qdf_nbuf_queue_add(retries_q, nbuf_ppdu_desc);
  1946. status = 0;
  1947. /*
  1948. * insert the mgmt_ctl buffer back to
  1949. * the queue
  1950. */
  1951. qdf_spin_lock_bh(
  1952. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1953. qdf_nbuf_queue_insert_head(
  1954. &pdev->tx_capture.ctl_mgmt_q[type][subtype],
  1955. mgmt_ctl_nbuf);
  1956. qdf_spin_unlock_bh(
  1957. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1958. } else {
  1959. qdf_nbuf_t nbuf_retry_ppdu;
  1960. struct cdp_tx_completion_ppdu *tmp_ppdu_desc;
  1961. uint16_t frame_ctrl_le;
  1962. struct ieee80211_frame *wh;
  1963. if (ppdu_desc->user[0].completion_status ==
  1964. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  1965. qdf_nbuf_free(nbuf_ppdu_desc);
  1966. qdf_nbuf_free(mgmt_ctl_nbuf);
  1967. status = 0;
  1968. goto free_ppdu_desc;
  1969. }
  1970. while (!!qdf_nbuf_queue_len(retries_q)) {
  1971. /*
  1972. * send retried packet stored
  1973. * in queue
  1974. */
  1975. nbuf_retry_ppdu =
  1976. qdf_nbuf_queue_remove(retries_q);
  1977. tmp_ppdu_desc =
  1978. (struct cdp_tx_completion_ppdu *)
  1979. qdf_nbuf_data(nbuf_retry_ppdu);
  1980. tmp_mgmt_ctl_nbuf =
  1981. skb_copy_expand(mgmt_ctl_nbuf,
  1982. 0, 0, GFP_ATOMIC);
  1983. dp_update_tx_cap_info(pdev, nbuf_retry_ppdu,
  1984. &tx_capture_info, true);
  1985. if (!tx_capture_info.mpdu_nbuf) {
  1986. qdf_nbuf_free(nbuf_retry_ppdu);
  1987. qdf_nbuf_free(tmp_mgmt_ctl_nbuf);
  1988. continue;
  1989. }
  1990. /* pull head based on sgen pkt or mgmt pkt */
  1991. qdf_nbuf_pull_head(tmp_mgmt_ctl_nbuf,
  1992. head_size);
  1993. /*
  1994. * frame control from ppdu_desc has
  1995. * retry flag set
  1996. */
  1997. frame_ctrl_le =
  1998. qdf_cpu_to_le16(tmp_ppdu_desc->frame_ctrl);
  1999. wh = (struct ieee80211_frame *)
  2000. (qdf_nbuf_data(tmp_mgmt_ctl_nbuf));
  2001. wh->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  2002. wh->i_fc[0] = (frame_ctrl_le & 0xFF);
  2003. tx_capture_info.ppdu_desc = tmp_ppdu_desc;
  2004. /*
  2005. * send MPDU to osif layer
  2006. */
  2007. dp_send_mgmt_ctrl_to_stack(pdev,
  2008. nbuf_retry_ppdu,
  2009. &tx_capture_info,
  2010. tmp_mgmt_ctl_nbuf,
  2011. true);
  2012. /* free retried queue nbuf ppdu_desc */
  2013. qdf_nbuf_free(nbuf_retry_ppdu);
  2014. }
  2015. dp_update_tx_cap_info(pdev, nbuf_ppdu_desc,
  2016. &tx_capture_info, true);
  2017. if (!tx_capture_info.mpdu_nbuf) {
  2018. qdf_nbuf_free(mgmt_ctl_nbuf);
  2019. goto free_ppdu_desc;
  2020. }
  2021. tx_capture_info.mpdu_info.ppdu_id =
  2022. *(uint32_t *)qdf_nbuf_data(mgmt_ctl_nbuf);
  2023. /* pull head based on sgen pkt or mgmt pkt */
  2024. qdf_nbuf_pull_head(mgmt_ctl_nbuf, head_size);
  2025. /* frame control from ppdu_desc has retry flag set */
  2026. frame_ctrl_le = qdf_cpu_to_le16(ppdu_desc->frame_ctrl);
  2027. wh = (struct ieee80211_frame *)
  2028. (qdf_nbuf_data(mgmt_ctl_nbuf));
  2029. wh->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  2030. wh->i_fc[0] = (frame_ctrl_le & 0xFF);
  2031. tx_capture_info.ppdu_desc = ppdu_desc;
  2032. /*
  2033. * send MPDU to osif layer
  2034. */
  2035. dp_send_mgmt_ctrl_to_stack(pdev, nbuf_ppdu_desc,
  2036. &tx_capture_info,
  2037. mgmt_ctl_nbuf, true);
  2038. }
  2039. } else if ((ppdu_desc->frame_ctrl &
  2040. IEEE80211_FC0_TYPE_MASK) ==
  2041. IEEE80211_FC0_TYPE_CTL) {
  2042. if (ppdu_desc->user[0].completion_status ==
  2043. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  2044. qdf_nbuf_free(nbuf_ppdu_desc);
  2045. status = 0;
  2046. goto free_ppdu_desc;
  2047. }
  2048. dp_update_tx_cap_info(pdev, nbuf_ppdu_desc,
  2049. &tx_capture_info, false);
  2050. if (!tx_capture_info.mpdu_nbuf)
  2051. goto free_ppdu_desc;
  2052. /*
  2053. * send MPDU to osif layer
  2054. */
  2055. dp_send_mgmt_ctrl_to_stack(pdev, nbuf_ppdu_desc,
  2056. &tx_capture_info, NULL, false);
  2057. }
  2058. free_ppdu_desc:
  2059. return status;
  2060. }
  2061. /**
  2062. * dp_peer_tx_cap_tid_queue_flush_tlv(): Function to dequeue peer queue
  2063. * @pdev: DP pdev handle
  2064. * @peer; DP peer handle
  2065. * @ppdu_desc: ppdu_desc
  2066. *
  2067. * return: void
  2068. */
  2069. static void
  2070. dp_peer_tx_cap_tid_queue_flush_tlv(struct dp_pdev *pdev,
  2071. struct dp_peer *peer,
  2072. struct cdp_tx_completion_ppdu *ppdu_desc)
  2073. {
  2074. int tid;
  2075. struct dp_tx_tid *tx_tid;
  2076. qdf_nbuf_queue_t head_xretries;
  2077. qdf_nbuf_queue_t head_msdu;
  2078. uint32_t qlen = 0;
  2079. uint32_t qlen_curr = 0;
  2080. tid = ppdu_desc->user[0].tid;
  2081. tx_tid = &peer->tx_capture.tx_tid[tid];
  2082. qdf_nbuf_queue_init(&head_msdu);
  2083. qdf_nbuf_queue_init(&head_xretries);
  2084. qlen = qdf_nbuf_queue_len(&tx_tid->msdu_comp_q);
  2085. dp_tx_msdu_dequeue(peer, INVALID_PPDU_ID,
  2086. tid, ppdu_desc->num_msdu,
  2087. &head_msdu,
  2088. &head_xretries,
  2089. 0, MAX_END_TSF);
  2090. if (!qdf_nbuf_is_queue_empty(&head_xretries)) {
  2091. struct cdp_tx_completion_ppdu *xretry_ppdu =
  2092. &tx_tid->xretry_ppdu;
  2093. xretry_ppdu->ppdu_id = peer->tx_capture.tx_wifi_ppdu_id;
  2094. /* Restitch MPDUs from xretry MSDUs */
  2095. dp_tx_mon_restitch_mpdu(pdev, peer,
  2096. xretry_ppdu,
  2097. &head_xretries,
  2098. &xretry_ppdu->mpdu_q);
  2099. }
  2100. qdf_nbuf_queue_free(&head_msdu);
  2101. qdf_nbuf_queue_free(&head_xretries);
  2102. qlen_curr = qdf_nbuf_queue_len(&tx_tid->msdu_comp_q);
  2103. dp_tx_mon_proc_xretries(pdev, peer, tid);
  2104. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2105. QDF_TRACE_LEVEL_INFO_MED,
  2106. "peer_id [%d 0x%x] tid[%d] qlen[%d -> %d]",
  2107. ppdu_desc->user[0].peer_id, peer, tid, qlen, qlen_curr);
  2108. }
  2109. /**
  2110. * dp_tx_ppdu_stats_flush(): Function to flush pending retried ppdu desc
  2111. * @pdev: DP pdev handle
  2112. * @nbuf: ppdu_desc
  2113. *
  2114. * return: void
  2115. */
  2116. static void
  2117. dp_tx_ppdu_stats_flush(struct dp_pdev *pdev,
  2118. struct cdp_tx_completion_ppdu *ppdu_desc)
  2119. {
  2120. struct dp_peer *peer;
  2121. peer = dp_peer_find_by_id(pdev->soc,
  2122. ppdu_desc->user[0].peer_id);
  2123. if (!peer)
  2124. return;
  2125. dp_peer_tx_cap_tid_queue_flush_tlv(pdev, peer, ppdu_desc);
  2126. dp_peer_unref_del_find_by_id(peer);
  2127. return;
  2128. }
  2129. /**
  2130. * dp_check_ppdu_and_deliver(): Check PPDUs for any holes and deliver
  2131. * to upper layer if complete
  2132. * @pdev: DP pdev handle
  2133. * @nbuf_ppdu_desc_list: ppdu_desc_list per sched cmd id
  2134. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  2135. *
  2136. * return: status
  2137. */
  2138. static void
  2139. dp_check_ppdu_and_deliver(struct dp_pdev *pdev,
  2140. qdf_nbuf_t nbuf_ppdu_desc_list[],
  2141. uint32_t ppdu_desc_cnt)
  2142. {
  2143. uint32_t ppdu_id;
  2144. uint32_t desc_cnt;
  2145. qdf_nbuf_t tmp_nbuf;
  2146. struct dp_tx_tid *tx_tid = NULL;
  2147. int i;
  2148. for (desc_cnt = 0; desc_cnt < ppdu_desc_cnt; desc_cnt++) {
  2149. struct cdp_tx_completion_ppdu *ppdu_desc;
  2150. uint32_t num_mpdu;
  2151. uint16_t start_seq, seq_no = 0;
  2152. int i;
  2153. uint32_t len;
  2154. qdf_nbuf_t mpdu_nbuf;
  2155. struct dp_peer *peer;
  2156. uint8_t type;
  2157. if (!nbuf_ppdu_desc_list[desc_cnt])
  2158. continue;
  2159. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2160. qdf_nbuf_data(nbuf_ppdu_desc_list[desc_cnt]);
  2161. ppdu_id = ppdu_desc->ppdu_id;
  2162. type = (ppdu_desc->frame_ctrl & IEEE80211_FC0_TYPE_MASK) >>
  2163. IEEE80211_FC0_TYPE_SHIFT;
  2164. if (ppdu_desc->is_flush) {
  2165. dp_tx_ppdu_stats_flush(pdev, ppdu_desc);
  2166. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  2167. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2168. qdf_nbuf_free(tmp_nbuf);
  2169. continue;
  2170. }
  2171. if (ppdu_desc->frame_type == CDP_PPDU_FTYPE_CTRL ||
  2172. ppdu_desc->htt_frame_type ==
  2173. HTT_STATS_FTYPE_SGEN_QOS_NULL ||
  2174. type != FRAME_CTRL_TYPE_DATA) {
  2175. qdf_nbuf_t nbuf_ppdu = nbuf_ppdu_desc_list[desc_cnt];
  2176. if (dp_check_mgmt_ctrl_ppdu(pdev, nbuf_ppdu)) {
  2177. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  2178. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2179. qdf_nbuf_free(tmp_nbuf);
  2180. continue;
  2181. }
  2182. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2183. continue;
  2184. }
  2185. peer = dp_peer_find_by_id(pdev->soc,
  2186. ppdu_desc->user[0].peer_id);
  2187. if (!peer) {
  2188. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  2189. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2190. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  2191. qdf_nbuf_free(tmp_nbuf);
  2192. continue;
  2193. }
  2194. tx_tid = &peer->tx_capture.tx_tid[ppdu_desc->user[0].tid];
  2195. ppdu_id = ppdu_desc->ppdu_id;
  2196. /* find mpdu tried is same as success mpdu */
  2197. num_mpdu = ppdu_desc->user[0].mpdu_success;
  2198. /* get length */
  2199. len = qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  2200. /* ba_size is updated in BA bitmap TLVs, which are not received
  2201. * in case of non-QoS TID.
  2202. */
  2203. if (qdf_unlikely(ppdu_desc->user[0].tid == DP_NON_QOS_TID)) {
  2204. ppdu_desc->user[0].ba_size = 1;
  2205. ppdu_desc->user[0].last_enq_seq =
  2206. ppdu_desc->user[0].start_seq;
  2207. }
  2208. if (ppdu_desc->user[0].ba_size == 0)
  2209. ppdu_desc->user[0].ba_size = 1;
  2210. /* find list of missing sequence */
  2211. ppdu_desc->mpdus = qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  2212. ppdu_desc->user[0].ba_size);
  2213. if (ppdu_desc->frame_type == CDP_PPDU_FTYPE_BAR)
  2214. dp_send_dummy_mpdu_info_to_stack(pdev,
  2215. ppdu_desc);
  2216. if (qdf_unlikely(!ppdu_desc->mpdus)) {
  2217. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2218. QDF_TRACE_LEVEL_FATAL,
  2219. "%s: ppdu_desc->mpdus allocation failed",
  2220. __func__);
  2221. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  2222. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2223. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  2224. qdf_nbuf_free(tmp_nbuf);
  2225. dp_peer_unref_del_find_by_id(peer);
  2226. continue;
  2227. }
  2228. if (qdf_unlikely(ppdu_desc->user[0].ba_size >
  2229. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  2230. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))) {
  2231. dp_peer_unref_del_find_by_id(peer);
  2232. qdf_assert_always(0);
  2233. return;
  2234. }
  2235. /* Fill seq holes within current schedule list */
  2236. start_seq = ppdu_desc->user[0].start_seq;
  2237. for (i = 0; i < ppdu_desc->user[0].ba_size; i++) {
  2238. if (qdf_likely(ppdu_desc->user[0].tid !=
  2239. DP_NON_QOS_TID) &&
  2240. !(SEQ_BIT(ppdu_desc->user[0].enq_bitmap, i)))
  2241. continue;
  2242. /* missed seq number */
  2243. seq_no = start_seq + i;
  2244. /* Fill failed MPDUs in AMPDU if they're available in
  2245. * subsequent PPDUs in current burst schedule. This
  2246. * is not applicable for non-QoS TIDs (no AMPDUs)
  2247. */
  2248. if (qdf_likely(ppdu_desc->user[0].tid !=
  2249. DP_NON_QOS_TID) &&
  2250. !(SEQ_BIT(ppdu_desc->user[0].failed_bitmap, i))) {
  2251. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2252. QDF_TRACE_LEVEL_DEBUG,
  2253. "%s:find seq %d in next ppdu %d",
  2254. __func__, seq_no,
  2255. ppdu_desc_cnt);
  2256. mpdu_nbuf = get_mpdu_clone_from_next_ppdu(
  2257. nbuf_ppdu_desc_list +
  2258. desc_cnt,
  2259. ppdu_desc_cnt -
  2260. desc_cnt, seq_no,
  2261. ppdu_desc->user[0].peer_id,
  2262. ppdu_id);
  2263. /* check mpdu_nbuf NULL */
  2264. if (!mpdu_nbuf) {
  2265. ppdu_desc->pending_retries++;
  2266. continue;
  2267. }
  2268. ppdu_desc->mpdus[seq_no - start_seq] =
  2269. mpdu_nbuf;
  2270. SEQ_SEG(ppdu_desc->user[0].failed_bitmap, i) |=
  2271. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[0],
  2272. i);
  2273. } else {
  2274. /* any error case we need to handle */
  2275. ppdu_desc->mpdus[seq_no - start_seq] =
  2276. qdf_nbuf_queue_remove(
  2277. &ppdu_desc->mpdu_q);
  2278. }
  2279. }
  2280. dp_peer_unref_del_find_by_id(peer);
  2281. if ((ppdu_desc->pending_retries == 0) &&
  2282. qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  2283. dp_send_data_to_stack(pdev, ppdu_desc);
  2284. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  2285. qdf_mem_free(ppdu_desc->mpdus);
  2286. ppdu_desc->mpdus = NULL;
  2287. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  2288. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  2289. qdf_nbuf_free(tmp_nbuf);
  2290. }
  2291. }
  2292. for (i = 0; i < ppdu_desc_cnt; i++) {
  2293. uint32_t pending_ppdus;
  2294. struct cdp_tx_completion_ppdu *cur_ppdu_desc;
  2295. struct dp_peer *peer;
  2296. qdf_nbuf_queue_t head_ppdu;
  2297. if (!nbuf_ppdu_desc_list[i])
  2298. continue;
  2299. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  2300. nbuf_ppdu_desc_list[i]);
  2301. if (!cur_ppdu_desc)
  2302. continue;
  2303. peer = dp_peer_find_by_id(pdev->soc,
  2304. cur_ppdu_desc->user[0].peer_id);
  2305. if (!peer) {
  2306. tmp_nbuf = nbuf_ppdu_desc_list[i];
  2307. nbuf_ppdu_desc_list[i] = NULL;
  2308. qdf_nbuf_queue_free(&cur_ppdu_desc->mpdu_q);
  2309. qdf_mem_free(cur_ppdu_desc->mpdus);
  2310. cur_ppdu_desc->mpdus = NULL;
  2311. qdf_nbuf_free(tmp_nbuf);
  2312. continue;
  2313. }
  2314. tx_tid = &peer->tx_capture.tx_tid[cur_ppdu_desc->user[0].tid];
  2315. qdf_nbuf_queue_init(&head_ppdu);
  2316. dp_tx_mon_proc_pending_ppdus(pdev, tx_tid,
  2317. nbuf_ppdu_desc_list + i,
  2318. ppdu_desc_cnt - i, &head_ppdu,
  2319. cur_ppdu_desc->user[0].peer_id);
  2320. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  2321. while ((tmp_nbuf = qdf_nbuf_queue_first(&head_ppdu))) {
  2322. cur_ppdu_desc =
  2323. (struct cdp_tx_completion_ppdu *)
  2324. qdf_nbuf_data(tmp_nbuf);
  2325. if (cur_ppdu_desc->pending_retries)
  2326. break;
  2327. dp_send_data_to_stack(pdev, cur_ppdu_desc);
  2328. qdf_nbuf_queue_free(&cur_ppdu_desc->mpdu_q);
  2329. qdf_mem_free(cur_ppdu_desc->mpdus);
  2330. cur_ppdu_desc->mpdus = NULL;
  2331. qdf_nbuf_queue_remove(&head_ppdu);
  2332. qdf_nbuf_free(tmp_nbuf);
  2333. }
  2334. }
  2335. qdf_nbuf_queue_append(&tx_tid->pending_ppdu_q, &head_ppdu);
  2336. dp_tx_mon_proc_xretries(pdev, peer, tx_tid->tid);
  2337. dp_peer_unref_del_find_by_id(peer);
  2338. pending_ppdus = qdf_nbuf_queue_len(&tx_tid->pending_ppdu_q);
  2339. if (pending_ppdus > MAX_PENDING_PPDUS) {
  2340. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2341. QDF_TRACE_LEVEL_FATAL,
  2342. "pending ppdus (%d, %d) : %d\n",
  2343. cur_ppdu_desc->user[0].peer_id,
  2344. tx_tid->tid, pending_ppdus);
  2345. }
  2346. }
  2347. }
  2348. /**
  2349. * dp_tx_ppdu_stats_process - Deferred PPDU stats handler
  2350. * @context: Opaque work context (PDEV)
  2351. *
  2352. * Return: none
  2353. */
  2354. void dp_tx_ppdu_stats_process(void *context)
  2355. {
  2356. uint32_t curr_sched_cmdid;
  2357. uint32_t last_ppdu_id;
  2358. uint32_t ppdu_cnt;
  2359. uint32_t ppdu_desc_cnt = 0;
  2360. struct dp_pdev *pdev = (struct dp_pdev *)context;
  2361. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  2362. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  2363. struct ppdu_info *sched_ppdu_info = NULL;
  2364. STAILQ_HEAD(, ppdu_info) sched_ppdu_queue;
  2365. struct ppdu_info *sched_ppdu_list_last_ptr;
  2366. qdf_nbuf_t *nbuf_ppdu_desc_list;
  2367. qdf_nbuf_t tmp_nbuf;
  2368. struct dp_pdev_tx_capture *ptr_tx_cap = &pdev->tx_capture;
  2369. qdf_nbuf_queue_t head_xretries;
  2370. STAILQ_INIT(&sched_ppdu_queue);
  2371. /* Move the PPDU entries to defer list */
  2372. qdf_spin_lock_bh(&ptr_tx_cap->ppdu_stats_lock);
  2373. STAILQ_CONCAT(&ptr_tx_cap->ppdu_stats_defer_queue,
  2374. &ptr_tx_cap->ppdu_stats_queue);
  2375. ptr_tx_cap->ppdu_stats_defer_queue_depth +=
  2376. ptr_tx_cap->ppdu_stats_queue_depth;
  2377. ptr_tx_cap->ppdu_stats_queue_depth = 0;
  2378. qdf_spin_unlock_bh(&ptr_tx_cap->ppdu_stats_lock);
  2379. while (!STAILQ_EMPTY(&ptr_tx_cap->ppdu_stats_defer_queue)) {
  2380. ppdu_info =
  2381. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  2382. curr_sched_cmdid = ppdu_info->sched_cmdid;
  2383. ppdu_cnt = 0;
  2384. STAILQ_FOREACH_SAFE(ppdu_info,
  2385. &ptr_tx_cap->ppdu_stats_defer_queue,
  2386. ppdu_info_queue_elem, tmp_ppdu_info) {
  2387. if (curr_sched_cmdid != ppdu_info->sched_cmdid)
  2388. break;
  2389. sched_ppdu_list_last_ptr = ppdu_info;
  2390. ppdu_cnt++;
  2391. }
  2392. if (ppdu_info && (curr_sched_cmdid == ppdu_info->sched_cmdid) &&
  2393. ptr_tx_cap->ppdu_stats_next_sched < now_ms)
  2394. break;
  2395. last_ppdu_id = sched_ppdu_list_last_ptr->ppdu_id;
  2396. STAILQ_FIRST(&sched_ppdu_queue) =
  2397. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  2398. STAILQ_REMOVE_HEAD_UNTIL(&ptr_tx_cap->ppdu_stats_defer_queue,
  2399. sched_ppdu_list_last_ptr,
  2400. ppdu_info_queue_elem);
  2401. STAILQ_NEXT(sched_ppdu_list_last_ptr,
  2402. ppdu_info_queue_elem) = NULL;
  2403. ptr_tx_cap->ppdu_stats_defer_queue_depth -= ppdu_cnt;
  2404. nbuf_ppdu_desc_list =
  2405. (qdf_nbuf_t *) qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  2406. ppdu_cnt);
  2407. /*
  2408. * if there is no memory allocated we need to free sched ppdu
  2409. * list, no ppdu stats will be updated.
  2410. */
  2411. if (!nbuf_ppdu_desc_list) {
  2412. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  2413. &sched_ppdu_queue,
  2414. ppdu_info_queue_elem,
  2415. tmp_ppdu_info) {
  2416. ppdu_info = sched_ppdu_info;
  2417. tmp_nbuf = ppdu_info->nbuf;
  2418. qdf_mem_free(ppdu_info);
  2419. qdf_nbuf_free(tmp_nbuf);
  2420. }
  2421. continue;
  2422. }
  2423. qdf_spin_lock(&ptr_tx_cap->config_lock);
  2424. ppdu_desc_cnt = 0;
  2425. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  2426. &sched_ppdu_queue,
  2427. ppdu_info_queue_elem, tmp_ppdu_info) {
  2428. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  2429. struct dp_peer *peer = NULL;
  2430. qdf_nbuf_t nbuf;
  2431. uint32_t retries = 0;
  2432. uint32_t ret = 0;
  2433. qdf_nbuf_queue_t head_msdu;
  2434. uint32_t start_tsf = 0;
  2435. uint32_t end_tsf = 0;
  2436. uint16_t tid = 0;
  2437. uint32_t num_msdu = 0;
  2438. uint32_t qlen = 0;
  2439. qdf_nbuf_queue_init(&head_msdu);
  2440. qdf_nbuf_queue_init(&head_xretries);
  2441. ppdu_info = sched_ppdu_info;
  2442. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2443. qdf_nbuf_data(ppdu_info->nbuf);
  2444. pdev->tx_ppdu_proc++;
  2445. dp_ppdu_desc_user_stats_update(pdev, ppdu_info);
  2446. /*
  2447. * While processing/corelating Tx buffers, we should
  2448. * hold the entire PPDU list for the give sched_cmdid
  2449. * instead of freeing below.
  2450. */
  2451. nbuf = ppdu_info->nbuf;
  2452. qdf_mem_free(ppdu_info);
  2453. qdf_assert_always(nbuf);
  2454. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2455. qdf_nbuf_data(nbuf);
  2456. /* send WDI event */
  2457. if (pdev->tx_capture_enabled ==
  2458. CDP_TX_ENH_CAPTURE_DISABLED) {
  2459. /**
  2460. * Deliver PPDU stats only for valid (acked)
  2461. * data frames if sniffer mode is not enabled.
  2462. * If sniffer mode is enabled,
  2463. * PPDU stats for all frames including
  2464. * mgmt/control frames should be delivered
  2465. * to upper layer
  2466. */
  2467. if (pdev->tx_sniffer_enable ||
  2468. pdev->mcopy_mode) {
  2469. dp_wdi_event_handler(
  2470. WDI_EVENT_TX_PPDU_DESC,
  2471. pdev->soc,
  2472. nbuf,
  2473. HTT_INVALID_PEER,
  2474. WDI_NO_VAL,
  2475. pdev->pdev_id);
  2476. } else {
  2477. if (ppdu_desc->num_mpdu != 0 &&
  2478. ppdu_desc->num_users != 0 &&
  2479. (ppdu_desc->frame_ctrl &
  2480. HTT_FRAMECTRL_DATATYPE)) {
  2481. dp_wdi_event_handler(
  2482. WDI_EVENT_TX_PPDU_DESC,
  2483. pdev->soc,
  2484. nbuf,
  2485. HTT_INVALID_PEER,
  2486. WDI_NO_VAL,
  2487. pdev->pdev_id);
  2488. } else {
  2489. qdf_nbuf_free(nbuf);
  2490. }
  2491. }
  2492. continue;
  2493. }
  2494. peer = dp_peer_find_by_id(pdev->soc,
  2495. ppdu_desc->user[0].peer_id);
  2496. /**
  2497. * peer can be NULL
  2498. */
  2499. if (!peer) {
  2500. qdf_nbuf_free(nbuf);
  2501. continue;
  2502. }
  2503. if ((ppdu_desc->frame_type == CDP_PPDU_FTYPE_DATA) ||
  2504. (ppdu_desc->num_mpdu &&
  2505. ppdu_desc->frame_type == CDP_PPDU_FTYPE_BAR)) {
  2506. /**
  2507. * check whether it is bss peer,
  2508. * if bss_peer no need to process further
  2509. * check whether tx_capture feature is enabled
  2510. * for this peer or globally for all peers
  2511. */
  2512. if (peer->bss_peer ||
  2513. !dp_peer_or_pdev_tx_cap_enabled(pdev,
  2514. peer)) {
  2515. dp_peer_unref_del_find_by_id(peer);
  2516. qdf_nbuf_free(nbuf);
  2517. continue;
  2518. }
  2519. /* print the bit map */
  2520. dp_tx_print_bitmap(pdev, ppdu_desc,
  2521. 0, ppdu_desc->ppdu_id);
  2522. if (ppdu_desc->user[0].tid > DP_MAX_TIDS) {
  2523. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2524. QDF_TRACE_LEVEL_ERROR,
  2525. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  2526. __func__,
  2527. ppdu_desc->ppdu_id,
  2528. ppdu_desc->user[0].peer_id,
  2529. ppdu_desc->user[0].tid);
  2530. dp_peer_unref_del_find_by_id(peer);
  2531. qdf_nbuf_free(nbuf);
  2532. continue;
  2533. }
  2534. tid = ppdu_desc->user[0].tid;
  2535. dequeue_msdu_again:
  2536. num_msdu = ppdu_desc->user[0].num_msdu;
  2537. start_tsf = ppdu_desc->ppdu_start_timestamp;
  2538. end_tsf = ppdu_desc->ppdu_end_timestamp;
  2539. /*
  2540. * retrieve msdu buffer based on ppdu_id & tid
  2541. * based msdu queue and store it in local queue
  2542. * sometimes, wbm comes later than per ppdu
  2543. * stats. Assumption: all packets are SU,
  2544. * and packets comes in order
  2545. */
  2546. ret = dp_tx_msdu_dequeue(peer,
  2547. ppdu_desc->ppdu_id,
  2548. ppdu_desc->user[0].tid,
  2549. num_msdu,
  2550. &head_msdu,
  2551. &head_xretries,
  2552. start_tsf, end_tsf);
  2553. if (!ret && (++retries < 2)) {
  2554. /* wait for wbm to complete */
  2555. qdf_mdelay(2);
  2556. goto dequeue_msdu_again;
  2557. }
  2558. if (!qdf_nbuf_is_queue_empty(&head_xretries)) {
  2559. struct dp_tx_tid *tx_tid =
  2560. &peer->tx_capture.tx_tid[tid];
  2561. struct cdp_tx_completion_ppdu
  2562. *xretry_ppdu =
  2563. &tx_tid->xretry_ppdu;
  2564. xretry_ppdu->ppdu_id =
  2565. peer->tx_capture.tx_wifi_ppdu_id;
  2566. /* Restitch MPDUs from xretry MSDUs */
  2567. dp_tx_mon_restitch_mpdu(pdev, peer,
  2568. xretry_ppdu,
  2569. &head_xretries,
  2570. &xretry_ppdu->mpdu_q);
  2571. }
  2572. if (!qdf_nbuf_is_queue_empty(&head_msdu)) {
  2573. /*
  2574. * now head_msdu hold - msdu list for
  2575. * that particular ppdu_id, restitch
  2576. * mpdu from msdu and create a mpdu
  2577. * queue
  2578. */
  2579. dp_tx_mon_restitch_mpdu(pdev, peer,
  2580. ppdu_desc,
  2581. &head_msdu,
  2582. &ppdu_desc->mpdu_q);
  2583. /*
  2584. * sanity: free local head msdu queue
  2585. * do we need this ?
  2586. */
  2587. qdf_nbuf_queue_free(&head_msdu);
  2588. qlen =
  2589. qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  2590. if (!qlen) {
  2591. qdf_nbuf_free(nbuf);
  2592. dp_peer_unref_del_find_by_id(peer);
  2593. continue;
  2594. }
  2595. }
  2596. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  2597. /* print ppdu_desc info for debugging purpose */
  2598. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2599. QDF_TRACE_LEVEL_INFO,
  2600. "%s: ppdu[%d], p_id[%d], tid[%d], n_mpdu[%d %d] n_msdu[%d] retr[%d] qlen[%d] s_tsf[%u] dur[%u] seq[%d] [%d %d]",
  2601. __func__, ppdu_desc->ppdu_id,
  2602. ppdu_desc->user[0].peer_id,
  2603. ppdu_desc->user[0].tid,
  2604. ppdu_desc->num_mpdu,
  2605. ppdu_desc->user[0].mpdu_success,
  2606. ppdu_desc->num_msdu, retries,
  2607. qlen,
  2608. ppdu_desc->ppdu_start_timestamp,
  2609. ppdu_desc->tx_duration,
  2610. ppdu_desc->user[0].start_seq,
  2611. ppdu_cnt,
  2612. ppdu_desc_cnt);
  2613. } else {
  2614. /*
  2615. * other packet frame also added to
  2616. * descriptor list
  2617. */
  2618. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  2619. }
  2620. dp_peer_unref_del_find_by_id(peer);
  2621. }
  2622. /*
  2623. * At this point we have mpdu queued per ppdu_desc
  2624. * based on packet capture flags send mpdu info to upper stack
  2625. */
  2626. if (ppdu_desc_cnt) {
  2627. dp_check_ppdu_and_deliver(pdev, nbuf_ppdu_desc_list,
  2628. ppdu_desc_cnt);
  2629. }
  2630. qdf_spin_unlock(&ptr_tx_cap->config_lock);
  2631. qdf_mem_free(nbuf_ppdu_desc_list);
  2632. }
  2633. }
  2634. /**
  2635. * dp_ppdu_desc_deliver(): Function to deliver Tx PPDU status descriptor
  2636. * to upper layer
  2637. * @pdev: DP pdev handle
  2638. * @ppdu_info: per PPDU TLV descriptor
  2639. *
  2640. * return: void
  2641. */
  2642. void dp_ppdu_desc_deliver(struct dp_pdev *pdev,
  2643. struct ppdu_info *ppdu_info)
  2644. {
  2645. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  2646. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  2647. TAILQ_REMOVE(&pdev->ppdu_info_list, ppdu_info, ppdu_info_list_elem);
  2648. pdev->list_depth--;
  2649. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2650. qdf_nbuf_data(ppdu_info->nbuf);
  2651. qdf_spin_lock_bh(&pdev->tx_capture.ppdu_stats_lock);
  2652. if (qdf_unlikely(!pdev->tx_capture_enabled &&
  2653. (pdev->tx_capture.ppdu_stats_queue_depth +
  2654. pdev->tx_capture.ppdu_stats_defer_queue_depth) >
  2655. DP_TX_PPDU_PROC_MAX_DEPTH)) {
  2656. qdf_nbuf_free(ppdu_info->nbuf);
  2657. qdf_mem_free(ppdu_info);
  2658. pdev->tx_capture.ppdu_dropped++;
  2659. } else {
  2660. STAILQ_INSERT_TAIL(&pdev->tx_capture.ppdu_stats_queue,
  2661. ppdu_info, ppdu_info_queue_elem);
  2662. pdev->tx_capture.ppdu_stats_queue_depth++;
  2663. }
  2664. qdf_spin_unlock_bh(&pdev->tx_capture.ppdu_stats_lock);
  2665. if ((pdev->tx_capture.ppdu_stats_queue_depth >
  2666. DP_TX_PPDU_PROC_THRESHOLD) ||
  2667. (pdev->tx_capture.ppdu_stats_next_sched <= now_ms)) {
  2668. qdf_queue_work(0, pdev->tx_capture.ppdu_stats_workqueue,
  2669. &pdev->tx_capture.ppdu_stats_work);
  2670. pdev->tx_capture.ppdu_stats_next_sched =
  2671. now_ms + DP_TX_PPDU_PROC_TIMEOUT;
  2672. }
  2673. }
  2674. static void set_mpdu_info(
  2675. struct cdp_tx_indication_info *tx_capture_info,
  2676. struct mon_rx_status *rx_status,
  2677. struct mon_rx_user_status *rx_user_status)
  2678. {
  2679. struct cdp_tx_indication_mpdu_info *mpdu_info;
  2680. qdf_mem_set(tx_capture_info,
  2681. sizeof(struct cdp_tx_indication_info), 0);
  2682. mpdu_info = &tx_capture_info->mpdu_info;
  2683. mpdu_info->ppdu_start_timestamp = rx_status->tsft + 16;
  2684. mpdu_info->channel_num = rx_status->chan_num;
  2685. mpdu_info->bw = 0;
  2686. if (mpdu_info->channel_num < 20)
  2687. mpdu_info->preamble = DOT11_B;
  2688. else
  2689. mpdu_info->preamble = DOT11_A;
  2690. }
  2691. static void dp_gen_ack_frame(struct hal_rx_ppdu_info *ppdu_info,
  2692. struct dp_peer *peer,
  2693. qdf_nbuf_t mpdu_nbuf)
  2694. {
  2695. struct ieee80211_frame_min_one *wh_addr1;
  2696. wh_addr1 = (struct ieee80211_frame_min_one *)
  2697. qdf_nbuf_data(mpdu_nbuf);
  2698. wh_addr1->i_fc[0] = 0;
  2699. wh_addr1->i_fc[1] = 0;
  2700. wh_addr1->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  2701. IEEE80211_FC0_TYPE_CTL |
  2702. IEEE80211_FC0_SUBTYPE_ACK;
  2703. if (peer) {
  2704. qdf_mem_copy(wh_addr1->i_addr1,
  2705. &peer->mac_addr.raw[0],
  2706. QDF_MAC_ADDR_SIZE);
  2707. } else {
  2708. qdf_mem_copy(wh_addr1->i_addr1,
  2709. &ppdu_info->nac_info.mac_addr2[0],
  2710. QDF_MAC_ADDR_SIZE);
  2711. }
  2712. *(u_int16_t *)(&wh_addr1->i_dur) = qdf_cpu_to_le16(0x0000);
  2713. qdf_nbuf_set_pktlen(mpdu_nbuf, sizeof(*wh_addr1));
  2714. }
  2715. static void dp_gen_block_ack_frame(
  2716. struct mon_rx_user_status *rx_user_status,
  2717. struct dp_peer *peer,
  2718. qdf_nbuf_t mpdu_nbuf)
  2719. {
  2720. struct dp_vdev *vdev = NULL;
  2721. struct ieee80211_ctlframe_addr2 *wh_addr2;
  2722. uint8_t *frm;
  2723. wh_addr2 = (struct ieee80211_ctlframe_addr2 *)
  2724. qdf_nbuf_data(mpdu_nbuf);
  2725. qdf_mem_zero(wh_addr2, DP_BA_ACK_FRAME_SIZE);
  2726. wh_addr2->i_fc[0] = 0;
  2727. wh_addr2->i_fc[1] = 0;
  2728. wh_addr2->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  2729. IEEE80211_FC0_TYPE_CTL |
  2730. IEEE80211_FC0_BLOCK_ACK;
  2731. *(u_int16_t *)(&wh_addr2->i_aidordur) = qdf_cpu_to_le16(0x0000);
  2732. vdev = peer->vdev;
  2733. if (vdev)
  2734. qdf_mem_copy(wh_addr2->i_addr2, vdev->mac_addr.raw,
  2735. QDF_MAC_ADDR_SIZE);
  2736. qdf_mem_copy(wh_addr2->i_addr1, &peer->mac_addr.raw[0],
  2737. QDF_MAC_ADDR_SIZE);
  2738. frm = (uint8_t *)&wh_addr2[1];
  2739. *((uint16_t *)frm) =
  2740. qdf_cpu_to_le16((rx_user_status->tid <<
  2741. DP_IEEE80211_BAR_CTL_TID_S) |
  2742. DP_IEEE80211_BAR_CTL_COMBA);
  2743. frm += 2;
  2744. *((uint16_t *)frm) =
  2745. rx_user_status->first_data_seq_ctrl;
  2746. frm += 2;
  2747. if ((rx_user_status->mpdu_cnt_fcs_ok +
  2748. rx_user_status->mpdu_cnt_fcs_err)
  2749. > DP_MAX_MPDU_64) {
  2750. qdf_mem_copy(frm,
  2751. rx_user_status->mpdu_fcs_ok_bitmap,
  2752. HAL_RX_NUM_WORDS_PER_PPDU_BITMAP *
  2753. sizeof(rx_user_status->mpdu_fcs_ok_bitmap[0]));
  2754. frm += DP_NUM_BYTES_PER_PPDU_BITMAP;
  2755. } else {
  2756. qdf_mem_copy(frm,
  2757. rx_user_status->mpdu_fcs_ok_bitmap,
  2758. DP_NUM_WORDS_PER_PPDU_BITMAP_64 *
  2759. sizeof(rx_user_status->mpdu_fcs_ok_bitmap[0]));
  2760. frm += DP_NUM_BYTES_PER_PPDU_BITMAP_64;
  2761. }
  2762. qdf_nbuf_set_pktlen(mpdu_nbuf,
  2763. (frm - (uint8_t *)qdf_nbuf_data(mpdu_nbuf)));
  2764. }
  2765. /**
  2766. * dp_send_ack_frame_to_stack(): Function to generate BA or ACK frame and
  2767. * send to upper layer on received unicast frame
  2768. * @soc: core txrx main context
  2769. * @pdev: DP pdev object
  2770. * @ppdu_info: HAL RX PPDU info retrieved from status ring TLV
  2771. *
  2772. * return: status
  2773. */
  2774. QDF_STATUS dp_send_ack_frame_to_stack(struct dp_soc *soc,
  2775. struct dp_pdev *pdev,
  2776. struct hal_rx_ppdu_info *ppdu_info)
  2777. {
  2778. struct cdp_tx_indication_info tx_capture_info;
  2779. struct dp_peer *peer;
  2780. struct dp_ast_entry *ast_entry;
  2781. uint32_t peer_id;
  2782. struct mon_rx_status *rx_status;
  2783. struct mon_rx_user_status *rx_user_status;
  2784. uint32_t ast_index;
  2785. uint32_t i;
  2786. rx_status = &ppdu_info->rx_status;
  2787. if (!rx_status->rxpcu_filter_pass)
  2788. return QDF_STATUS_SUCCESS;
  2789. if (ppdu_info->sw_frame_group_id ==
  2790. HAL_MPDU_SW_FRAME_GROUP_MGMT_BEACON)
  2791. return QDF_STATUS_SUCCESS;
  2792. for (i = 0; i < ppdu_info->com_info.num_users; i++) {
  2793. if (i > OFDMA_NUM_USERS)
  2794. return QDF_STATUS_E_FAULT;
  2795. rx_user_status = &ppdu_info->rx_user_status[i];
  2796. ast_index = rx_user_status->ast_index;
  2797. if (ast_index >=
  2798. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  2799. set_mpdu_info(&tx_capture_info,
  2800. rx_status, rx_user_status);
  2801. tx_capture_info.mpdu_nbuf =
  2802. qdf_nbuf_alloc(pdev->soc->osdev,
  2803. MAX_MONITOR_HEADER +
  2804. DP_BA_ACK_FRAME_SIZE,
  2805. MAX_MONITOR_HEADER,
  2806. 4, FALSE);
  2807. if (!tx_capture_info.mpdu_nbuf)
  2808. continue;
  2809. dp_gen_ack_frame(ppdu_info, NULL,
  2810. tx_capture_info.mpdu_nbuf);
  2811. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  2812. &tx_capture_info, HTT_INVALID_PEER,
  2813. WDI_NO_VAL, pdev->pdev_id);
  2814. continue;
  2815. }
  2816. qdf_spin_lock_bh(&soc->ast_lock);
  2817. ast_entry = soc->ast_table[ast_index];
  2818. if (!ast_entry) {
  2819. qdf_spin_unlock_bh(&soc->ast_lock);
  2820. continue;
  2821. }
  2822. peer = ast_entry->peer;
  2823. if (!peer || peer->peer_ids[0] == HTT_INVALID_PEER) {
  2824. qdf_spin_unlock_bh(&soc->ast_lock);
  2825. continue;
  2826. }
  2827. peer_id = peer->peer_ids[0];
  2828. qdf_spin_unlock_bh(&soc->ast_lock);
  2829. peer = dp_peer_find_by_id(soc, peer_id);
  2830. if (!peer)
  2831. continue;
  2832. if (!dp_peer_or_pdev_tx_cap_enabled(pdev,
  2833. peer)) {
  2834. dp_peer_unref_del_find_by_id(peer);
  2835. continue;
  2836. }
  2837. set_mpdu_info(&tx_capture_info,
  2838. rx_status, rx_user_status);
  2839. tx_capture_info.mpdu_nbuf =
  2840. qdf_nbuf_alloc(pdev->soc->osdev,
  2841. MAX_MONITOR_HEADER +
  2842. DP_BA_ACK_FRAME_SIZE,
  2843. MAX_MONITOR_HEADER,
  2844. 4, FALSE);
  2845. if (!tx_capture_info.mpdu_nbuf) {
  2846. dp_peer_unref_del_find_by_id(peer);
  2847. return QDF_STATUS_E_NOMEM;
  2848. }
  2849. if (rx_status->rs_flags & IEEE80211_AMPDU_FLAG) {
  2850. dp_gen_block_ack_frame(
  2851. rx_user_status, peer,
  2852. tx_capture_info.mpdu_nbuf);
  2853. tx_capture_info.mpdu_info.tid = rx_user_status->tid;
  2854. } else {
  2855. dp_gen_ack_frame(ppdu_info, peer,
  2856. tx_capture_info.mpdu_nbuf);
  2857. }
  2858. dp_peer_unref_del_find_by_id(peer);
  2859. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  2860. &tx_capture_info, HTT_INVALID_PEER,
  2861. WDI_NO_VAL, pdev->pdev_id);
  2862. }
  2863. return QDF_STATUS_SUCCESS;
  2864. }
  2865. /**
  2866. * dp_peer_set_tx_capture_enabled: Set tx_cap_enabled bit in peer
  2867. * @peer: Peer handle
  2868. * @value: Enable/disable setting for tx_cap_enabled
  2869. *
  2870. * Return: None
  2871. */
  2872. void
  2873. dp_peer_set_tx_capture_enabled(struct dp_peer *peer, bool value)
  2874. {
  2875. peer->tx_cap_enabled = value;
  2876. if (!value)
  2877. dp_peer_tx_cap_tid_queue_flush(peer);
  2878. }
  2879. #endif