dp_tx_capture.c 78 KB

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