dp_tx_capture.c 89 KB

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