dp_tx_capture.c 87 KB

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