dp_tx_capture.c 88 KB

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