dp_tx_capture.c 89 KB

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