dp_tx_capture.c 43 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654
  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. #ifdef WLAN_TX_PKT_CAPTURE_ENH
  32. /**
  33. * dp_peer_or_pdev_tx_cap_enabled - Returns status of tx_cap_enabled
  34. * based on global per-pdev setting or per-peer setting
  35. * @pdev: Datapath pdev handle
  36. * @peer: Datapath peer
  37. *
  38. * Return: true if feature is enabled on a per-pdev basis or if
  39. * enabled for the given peer when per-peer mode is set, false otherwise
  40. */
  41. inline bool
  42. dp_peer_or_pdev_tx_cap_enabled(struct dp_pdev *pdev,
  43. struct dp_peer *peer)
  44. {
  45. if ((pdev->tx_capture_enabled ==
  46. CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS) ||
  47. ((pdev->tx_capture_enabled ==
  48. CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) &&
  49. peer->tx_cap_enabled))
  50. return true;
  51. return false;
  52. }
  53. /*
  54. * dp_peer_tid_queue_init() – Initialize ppdu stats queue per TID
  55. * @peer: Datapath peer
  56. *
  57. */
  58. void dp_peer_tid_queue_init(struct dp_peer *peer)
  59. {
  60. int tid;
  61. struct dp_tx_tid *tx_tid;
  62. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  63. tx_tid = &peer->tx_capture.tx_tid[tid];
  64. tx_tid->tid = tid;
  65. qdf_nbuf_queue_init(&tx_tid->msdu_comp_q);
  66. tx_tid->max_ppdu_id = 0;
  67. /* spinlock create */
  68. qdf_spinlock_create(&tx_tid->tid_lock);
  69. }
  70. }
  71. /*
  72. * dp_peer_tid_queue_cleanup() – remove ppdu stats queue per TID
  73. * @peer: Datapath peer
  74. *
  75. */
  76. void dp_peer_tid_queue_cleanup(struct dp_peer *peer)
  77. {
  78. int tid;
  79. struct dp_tx_tid *tx_tid;
  80. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  81. tx_tid = &peer->tx_capture.tx_tid[tid];
  82. qdf_spin_lock_bh(&tx_tid->tid_lock);
  83. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  84. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  85. /* spinlock destroy */
  86. qdf_spinlock_destroy(&tx_tid->tid_lock);
  87. tx_tid->max_ppdu_id = 0;
  88. }
  89. }
  90. /*
  91. * dp_peer_update_80211_hdr: update 80211 hdr
  92. * @vdev: DP VDEV
  93. * @peer: DP PEER
  94. *
  95. * return: void
  96. */
  97. void dp_peer_update_80211_hdr(struct dp_vdev *vdev, struct dp_peer *peer)
  98. {
  99. struct ieee80211_frame *ptr_wh;
  100. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  101. /* i_addr1 - Receiver mac address */
  102. /* i_addr2 - Transmitter mac address */
  103. /* i_addr3 - Destination mac address */
  104. qdf_mem_copy(ptr_wh->i_addr1,
  105. peer->mac_addr.raw,
  106. QDF_MAC_ADDR_SIZE);
  107. qdf_mem_copy(ptr_wh->i_addr3,
  108. peer->mac_addr.raw,
  109. QDF_MAC_ADDR_SIZE);
  110. qdf_mem_copy(ptr_wh->i_addr2,
  111. vdev->mac_addr.raw,
  112. QDF_MAC_ADDR_SIZE);
  113. }
  114. /*
  115. * dp_deliver_mgmt_frm: Process
  116. * @pdev: DP PDEV handle
  117. * @nbuf: buffer containing the htt_ppdu_stats_tx_mgmtctrl_payload_tlv
  118. *
  119. * return: void
  120. */
  121. void dp_deliver_mgmt_frm(struct dp_pdev *pdev, qdf_nbuf_t nbuf)
  122. {
  123. struct cdp_tx_indication_info tx_capture_info;
  124. if (pdev->tx_sniffer_enable || pdev->mcopy_mode) {
  125. dp_wdi_event_handler(WDI_EVENT_TX_MGMT_CTRL, pdev->soc,
  126. nbuf, HTT_INVALID_PEER,
  127. WDI_NO_VAL, pdev->pdev_id);
  128. return;
  129. }
  130. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  131. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  132. /* invoke WDI event handler here send mgmt pkt here */
  133. /* pull ppdu_id from the packet */
  134. qdf_nbuf_pull_head(nbuf, sizeof(uint32_t));
  135. tx_capture_info.frame_payload = 1;
  136. tx_capture_info.mpdu_nbuf = nbuf;
  137. /*
  138. * send MPDU to osif layer
  139. * do we need to update mpdu_info before tranmit
  140. * get current mpdu_nbuf
  141. */
  142. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  143. &tx_capture_info, HTT_INVALID_PEER,
  144. WDI_NO_VAL, pdev->pdev_id);
  145. if (tx_capture_info.mpdu_nbuf)
  146. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  147. }
  148. }
  149. /**
  150. * dp_tx_ppdu_stats_attach - Initialize Tx PPDU stats and enhanced capture
  151. * @pdev: DP PDEV
  152. *
  153. * Return: none
  154. */
  155. void dp_tx_ppdu_stats_attach(struct dp_pdev *pdev)
  156. {
  157. /* Work queue setup for HTT stats and tx capture handling */
  158. qdf_create_work(0, &pdev->tx_capture.ppdu_stats_work,
  159. dp_tx_ppdu_stats_process,
  160. pdev);
  161. pdev->tx_capture.ppdu_stats_workqueue =
  162. qdf_alloc_unbound_workqueue("ppdu_stats_work_queue");
  163. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_queue);
  164. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_defer_queue);
  165. qdf_spinlock_create(&pdev->tx_capture.ppdu_stats_lock);
  166. pdev->tx_capture.ppdu_stats_queue_depth = 0;
  167. pdev->tx_capture.ppdu_stats_next_sched = 0;
  168. pdev->tx_capture.ppdu_stats_defer_queue_depth = 0;
  169. pdev->tx_capture.ppdu_dropped = 0;
  170. }
  171. /**
  172. * dp_tx_ppdu_stats_detach - Cleanup Tx PPDU stats and enhanced capture
  173. * @pdev: DP PDEV
  174. *
  175. * Return: none
  176. */
  177. void dp_tx_ppdu_stats_detach(struct dp_pdev *pdev)
  178. {
  179. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  180. if (!pdev || !pdev->tx_capture.ppdu_stats_workqueue)
  181. return;
  182. qdf_flush_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  183. qdf_destroy_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  184. qdf_spinlock_destroy(&pdev->tx_capture.ppdu_stats_lock);
  185. STAILQ_FOREACH_SAFE(ppdu_info,
  186. &pdev->tx_capture.ppdu_stats_queue,
  187. ppdu_info_queue_elem, tmp_ppdu_info) {
  188. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_queue,
  189. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  190. qdf_nbuf_free(ppdu_info->nbuf);
  191. qdf_mem_free(ppdu_info);
  192. }
  193. STAILQ_FOREACH_SAFE(ppdu_info,
  194. &pdev->tx_capture.ppdu_stats_defer_queue,
  195. ppdu_info_queue_elem, tmp_ppdu_info) {
  196. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_defer_queue,
  197. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  198. qdf_nbuf_free(ppdu_info->nbuf);
  199. qdf_mem_free(ppdu_info);
  200. }
  201. }
  202. /**
  203. * dp_update_msdu_to_list(): Function to queue msdu from wbm
  204. * @pdev: dp_pdev
  205. * @peer: dp_peer
  206. * @ts: hal tx completion status
  207. * @netbuf: msdu
  208. *
  209. * return: status
  210. */
  211. QDF_STATUS
  212. dp_update_msdu_to_list(struct dp_soc *soc,
  213. struct dp_pdev *pdev,
  214. struct dp_peer *peer,
  215. struct hal_tx_completion_status *ts,
  216. qdf_nbuf_t netbuf)
  217. {
  218. struct dp_tx_tid *tx_tid;
  219. struct msdu_completion_info *msdu_comp_info;
  220. if (!peer) {
  221. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  222. "%s: %d peer NULL !", __func__, __LINE__);
  223. return QDF_STATUS_E_FAILURE;
  224. }
  225. if (ts->tid > DP_NON_QOS_TID) {
  226. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  227. "%s: %d peer_id %d, tid %d > NON_QOS_TID!",
  228. __func__, __LINE__, ts->peer_id, ts->tid);
  229. return QDF_STATUS_E_FAILURE;
  230. }
  231. tx_tid = &peer->tx_capture.tx_tid[ts->tid];
  232. if (!tx_tid) {
  233. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  234. "%s: %d tid[%d] NULL !", __func__, __LINE__, ts->tid);
  235. return QDF_STATUS_E_FAILURE;
  236. }
  237. qdf_nbuf_unmap(soc->osdev, netbuf, QDF_DMA_TO_DEVICE);
  238. if (!qdf_nbuf_push_head(netbuf, sizeof(struct msdu_completion_info))) {
  239. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  240. FL("No headroom"));
  241. return QDF_STATUS_E_NOMEM;
  242. }
  243. msdu_comp_info = (struct msdu_completion_info *)qdf_nbuf_data(netbuf);
  244. /* copy msdu_completion_info to control buffer */
  245. msdu_comp_info->ppdu_id = ts->ppdu_id;
  246. msdu_comp_info->peer_id = ts->peer_id;
  247. msdu_comp_info->tid = ts->tid;
  248. msdu_comp_info->first_msdu = ts->first_msdu;
  249. msdu_comp_info->last_msdu = ts->last_msdu;
  250. msdu_comp_info->msdu_part_of_amsdu = ts->msdu_part_of_amsdu;
  251. msdu_comp_info->transmit_cnt = ts->transmit_cnt;
  252. msdu_comp_info->tsf = ts->tsf;
  253. /* update max ppdu_id */
  254. tx_tid->max_ppdu_id = ts->ppdu_id;
  255. pdev->tx_capture.last_msdu_id = ts->ppdu_id;
  256. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  257. "msdu_completion: ppdu_id[%d] peer_id[%d] tid[%d] rel_src[%d] status[%d] tsf[%u] A[%d] CNT[%d]",
  258. ts->ppdu_id, ts->peer_id, ts->tid, ts->release_src,
  259. ts->status, ts->tsf, ts->msdu_part_of_amsdu,
  260. ts->transmit_cnt);
  261. /* lock here */
  262. qdf_spin_lock_bh(&tx_tid->tid_lock);
  263. /* add nbuf to tail queue per peer tid */
  264. qdf_nbuf_queue_add(&tx_tid->msdu_comp_q, netbuf);
  265. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  266. return QDF_STATUS_SUCCESS;
  267. }
  268. /**
  269. * dp_tx_add_to_comp_queue() - add completion msdu to queue
  270. * @soc: DP Soc handle
  271. * @tx_desc: software Tx descriptor
  272. * @ts : Tx completion status from HAL/HTT descriptor
  273. * @peer: DP peer
  274. *
  275. * Return: none
  276. */
  277. QDF_STATUS dp_tx_add_to_comp_queue(struct dp_soc *soc,
  278. struct dp_tx_desc_s *desc,
  279. struct hal_tx_completion_status *ts,
  280. struct dp_peer *peer)
  281. {
  282. int ret = QDF_STATUS_E_FAILURE;
  283. if (desc->pdev->tx_capture_enabled != CDP_TX_ENH_CAPTURE_DISABLED &&
  284. ts->status == HAL_TX_TQM_RR_FRAME_ACKED) {
  285. ret = dp_update_msdu_to_list(soc, desc->pdev,
  286. peer, ts, desc->nbuf);
  287. }
  288. return ret;
  289. }
  290. /**
  291. * dp_process_ppdu_stats_update_failed_bitmap(): update failed bitmap
  292. * @pdev: dp_pdev
  293. * @data: tx completion ppdu desc
  294. * @ppdu_id: ppdu id
  295. * @size: size of bitmap
  296. *
  297. * return: status
  298. */
  299. void dp_process_ppdu_stats_update_failed_bitmap(struct dp_pdev *pdev,
  300. void *data,
  301. uint32_t ppdu_id,
  302. uint32_t size)
  303. {
  304. struct cdp_tx_completion_ppdu_user *user;
  305. uint32_t mpdu_tried;
  306. uint32_t ba_seq_no;
  307. uint32_t start_seq;
  308. uint32_t num_mpdu;
  309. uint32_t diff;
  310. uint32_t carry = 0;
  311. uint32_t bitmask = 0;
  312. uint32_t i;
  313. uint32_t k;
  314. uint32_t ba_bitmap = 0;
  315. user = (struct cdp_tx_completion_ppdu_user *)data;
  316. /* get number of mpdu from ppdu_desc */
  317. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  318. ba_seq_no = user->ba_seq_no;
  319. start_seq = user->start_seq;
  320. num_mpdu = user->num_mpdu;
  321. /* assumption: number of mpdu will be less than 32 */
  322. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  323. "ppdu_id[%d] ba_seq_no[%d] start_seq_no[%d] mpdu_tried[%d]",
  324. ppdu_id, ba_seq_no, start_seq, mpdu_tried);
  325. for (i = 0; i < size; i++) {
  326. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  327. "ppdu_id[%d] ba_bitmap[%x] enqueue_bitmap[%x]",
  328. ppdu_id, user->ba_bitmap[i], user->enq_bitmap[i]);
  329. }
  330. if (start_seq <= ba_seq_no) {
  331. diff = ba_seq_no - start_seq;
  332. bitmask = (1 << diff) - 1;
  333. for (i = 0; i < size; i++) {
  334. ba_bitmap = user->ba_bitmap[i];
  335. user->failed_bitmap[i] = (ba_bitmap << diff);
  336. user->failed_bitmap[i] |= (bitmask & carry);
  337. carry = ((ba_bitmap & (bitmask << (32 - diff))) >>
  338. (32 - diff));
  339. user->failed_bitmap[i] = user->enq_bitmap[i] &
  340. user->failed_bitmap[i];
  341. }
  342. } else {
  343. diff = start_seq - ba_seq_no;
  344. /* array index */
  345. k = diff >> 5;
  346. diff = diff & 0x1F;
  347. bitmask = (1 << diff) - 1;
  348. for (i = 0; i < size; i++, k++) {
  349. ba_bitmap = user->ba_bitmap[k];
  350. user->failed_bitmap[i] = ba_bitmap >> diff;
  351. /* get next ba_bitmap */
  352. ba_bitmap = user->ba_bitmap[k + 1];
  353. carry = (ba_bitmap & bitmask);
  354. user->failed_bitmap[i] |=
  355. ((carry & bitmask) << (32 - diff));
  356. user->failed_bitmap[i] = user->enq_bitmap[i] &
  357. user->failed_bitmap[i];
  358. }
  359. }
  360. }
  361. /*
  362. * dp_soc_set_txrx_ring_map_single()
  363. * @dp_soc: DP handler for soc
  364. *
  365. * Return: Void
  366. */
  367. static void dp_soc_set_txrx_ring_map_single(struct dp_soc *soc)
  368. {
  369. uint32_t i;
  370. for (i = 0; i < WLAN_CFG_INT_NUM_CONTEXTS; i++) {
  371. soc->tx_ring_map[i] =
  372. dp_cpu_ring_map[DP_SINGLE_TX_RING_MAP][i];
  373. }
  374. }
  375. /*
  376. * dp_iterate_free_peer_msdu_q()- API to free msdu queue
  377. * @pdev_handle: DP_PDEV handle
  378. *
  379. * Return: void
  380. */
  381. static void dp_iterate_free_peer_msdu_q(void *pdev_hdl)
  382. {
  383. struct dp_pdev *pdev = (struct dp_pdev *)pdev_hdl;
  384. struct dp_soc *soc = pdev->soc;
  385. struct dp_vdev *vdev = NULL;
  386. struct dp_peer *peer = NULL;
  387. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  388. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  389. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  390. DP_VDEV_ITERATE_PEER_LIST(vdev, peer) {
  391. int tid;
  392. struct dp_tx_tid *tx_tid;
  393. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  394. tx_tid = &peer->tx_capture.tx_tid[tid];
  395. /* spinlock hold */
  396. qdf_spin_lock_bh(&tx_tid->tid_lock);
  397. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  398. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  399. }
  400. }
  401. }
  402. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  403. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  404. }
  405. /*
  406. * dp_config_enh_tx_capture()- API to enable/disable enhanced tx capture
  407. * @pdev_handle: DP_PDEV handle
  408. * @val: user provided value
  409. *
  410. * Return: QDF_STATUS
  411. */
  412. QDF_STATUS
  413. dp_config_enh_tx_capture(struct cdp_pdev *pdev_handle, uint8_t val)
  414. {
  415. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  416. pdev->tx_capture_enabled = val;
  417. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  418. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  419. dp_soc_set_txrx_ring_map_single(pdev->soc);
  420. if (!pdev->pktlog_ppdu_stats)
  421. dp_h2t_cfg_stats_msg_send(pdev,
  422. DP_PPDU_STATS_CFG_SNIFFER,
  423. pdev->pdev_id);
  424. } else {
  425. dp_soc_set_txrx_ring_map(pdev->soc);
  426. dp_h2t_cfg_stats_msg_send(pdev,
  427. DP_PPDU_STATS_CFG_ENH_STATS,
  428. pdev->pdev_id);
  429. dp_iterate_free_peer_msdu_q(pdev);
  430. }
  431. return QDF_STATUS_SUCCESS;
  432. }
  433. /**
  434. * get_number_of_1s(): Function to get number of 1s
  435. * @value: value to find
  436. *
  437. * return: number of 1s
  438. */
  439. static
  440. inline uint32_t get_number_of_1s(uint32_t value)
  441. {
  442. uint32_t shift[] = {1, 2, 4, 8, 16};
  443. uint32_t magic_number[] = { 0x55555555, 0x33333333, 0x0F0F0F0F,
  444. 0x00FF00FF, 0x0000FFFF};
  445. uint8_t k = 0;
  446. for (; k <= 4; k++) {
  447. value = (value & magic_number[k]) +
  448. ((value >> shift[k]) & magic_number[k]);
  449. }
  450. return value;
  451. }
  452. /**
  453. * dp_tx_print_bitmap(): Function to print bitmap
  454. * @pdev: dp_pdev
  455. * @ppdu_desc: ppdu completion descriptor
  456. * @user_inder: user index
  457. * @ppdu_id: ppdu id
  458. *
  459. * return: status
  460. */
  461. static
  462. QDF_STATUS dp_tx_print_bitmap(struct dp_pdev *pdev,
  463. struct cdp_tx_completion_ppdu *ppdu_desc,
  464. uint32_t user_index,
  465. uint32_t ppdu_id)
  466. {
  467. struct cdp_tx_completion_ppdu_user *user;
  468. uint8_t i;
  469. uint32_t mpdu_tried;
  470. uint32_t ba_seq_no;
  471. uint32_t start_seq;
  472. uint32_t num_mpdu;
  473. uint32_t fail_num_mpdu = 0;
  474. user = &ppdu_desc->user[user_index];
  475. /* get number of mpdu from ppdu_desc */
  476. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  477. ba_seq_no = user->ba_seq_no;
  478. start_seq = user->start_seq;
  479. num_mpdu = user->mpdu_success;
  480. if (user->tid > DP_NON_QOS_TID) {
  481. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  482. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  483. __func__, ppdu_id, user->peer_id, user->tid);
  484. return QDF_STATUS_E_FAILURE;
  485. }
  486. if (mpdu_tried != num_mpdu) {
  487. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  488. "%s: ppdu[%d] peer[%d] tid[%d] ba[%d] start[%d] mpdu_tri[%d] num_mpdu[%d] is_mcast[%d]",
  489. __func__, ppdu_id, user->peer_id, user->tid,
  490. ba_seq_no, start_seq, mpdu_tried,
  491. num_mpdu, user->is_mcast);
  492. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++) {
  493. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  494. QDF_TRACE_LEVEL_ERROR,
  495. "ppdu_id[%d] ba_bitmap[0x%x] enqueue_bitmap[0x%x] failed_bitmap[0x%x]",
  496. ppdu_id, user->ba_bitmap[i],
  497. user->enq_bitmap[i],
  498. user->failed_bitmap[i]);
  499. fail_num_mpdu +=
  500. get_number_of_1s(user->failed_bitmap[i]);
  501. }
  502. }
  503. if (fail_num_mpdu == num_mpdu && num_mpdu)
  504. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  505. "%s: %d ppdu_id[%d] num_mpdu[%d, %d]",
  506. __func__, __LINE__, ppdu_id, num_mpdu, fail_num_mpdu);
  507. return QDF_STATUS_SUCCESS;
  508. }
  509. static uint32_t dp_tx_update_80211_hdr(struct dp_pdev *pdev,
  510. struct dp_peer *peer,
  511. void *data,
  512. qdf_nbuf_t nbuf,
  513. uint16_t ether_type)
  514. {
  515. struct cdp_tx_completion_ppdu *ppdu_desc;
  516. struct ieee80211_frame *ptr_wh;
  517. struct ieee80211_qoscntl *ptr_qoscntl;
  518. uint32_t mpdu_buf_len;
  519. uint8_t *ptr_hdr;
  520. uint16_t eth_type = qdf_htons(ether_type);
  521. ppdu_desc = (struct cdp_tx_completion_ppdu *)data;
  522. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  523. ptr_qoscntl = &peer->tx_capture.tx_qoscntl;
  524. /*
  525. * update framectrl only for first ppdu_id
  526. * rest of mpdu will have same frame ctrl
  527. * mac address and duration
  528. */
  529. if (ppdu_desc->ppdu_id != peer->tx_capture.tx_wifi_ppdu_id) {
  530. ptr_wh->i_fc[1] = (ppdu_desc->frame_ctrl & 0xFF00) >> 8;
  531. ptr_wh->i_fc[0] = (ppdu_desc->frame_ctrl & 0xFF);
  532. ptr_wh->i_dur[1] = (ppdu_desc->tx_duration & 0xFF00) >> 8;
  533. ptr_wh->i_dur[0] = (ppdu_desc->tx_duration & 0xFF);
  534. ptr_qoscntl->i_qos[1] = (ppdu_desc->user[0].qos_ctrl &
  535. 0xFF00) >> 8;
  536. ptr_qoscntl->i_qos[0] = (ppdu_desc->user[0].qos_ctrl & 0xFF);
  537. peer->tx_capture.tx_wifi_ppdu_id = ppdu_desc->ppdu_id;
  538. }
  539. mpdu_buf_len = sizeof(struct ieee80211_frame) + LLC_SNAP_HDR_LEN;
  540. mpdu_buf_len += sizeof(struct ieee80211_qoscntl);
  541. nbuf->protocol = qdf_htons(ETH_P_802_2);
  542. /* update ieee80211_frame header */
  543. if (!qdf_nbuf_push_head(nbuf, mpdu_buf_len)) {
  544. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  545. FL("No headroom"));
  546. return QDF_STATUS_E_NOMEM;
  547. }
  548. ptr_hdr = (void *)qdf_nbuf_data(nbuf);
  549. qdf_mem_copy(ptr_hdr, ptr_wh, sizeof(struct ieee80211_frame));
  550. ptr_hdr = ptr_hdr + (sizeof(struct ieee80211_frame));
  551. /* update qoscntl header */
  552. qdf_mem_copy(ptr_hdr, ptr_qoscntl, sizeof(struct ieee80211_qoscntl));
  553. ptr_hdr = ptr_hdr + sizeof(struct ieee80211_qoscntl);
  554. /* update LLC */
  555. *ptr_hdr = LLC_SNAP_LSAP;
  556. *(ptr_hdr + 1) = LLC_SNAP_LSAP;
  557. *(ptr_hdr + 2) = LLC_UI;
  558. *(ptr_hdr + 3) = 0x00;
  559. *(ptr_hdr + 4) = 0x00;
  560. *(ptr_hdr + 5) = 0x00;
  561. *(ptr_hdr + 6) = (eth_type & 0xFF00) >> 8;
  562. *(ptr_hdr + 7) = (eth_type & 0xFF);
  563. qdf_nbuf_trim_tail(nbuf, qdf_nbuf_len(nbuf) - mpdu_buf_len);
  564. return 0;
  565. }
  566. #define MAX_MONITOR_HEADER (512)
  567. /**
  568. * dp_tx_mon_restitch_mpdu_from_msdus(): Function to restitch msdu to mpdu
  569. * @pdev: dp_pdev
  570. * @peer: dp_peer
  571. * @head_msdu: head msdu queue
  572. *
  573. * return: status
  574. */
  575. static uint32_t
  576. dp_tx_mon_restitch_mpdu_from_msdus(struct dp_pdev *pdev,
  577. struct dp_peer *peer,
  578. struct cdp_tx_completion_ppdu *ppdu_desc,
  579. qdf_nbuf_queue_t *head_msdu)
  580. {
  581. qdf_nbuf_t curr_nbuf = NULL;
  582. qdf_nbuf_t first_nbuf = NULL;
  583. qdf_nbuf_t prev_nbuf = NULL;
  584. qdf_nbuf_t mpdu_nbuf = NULL;
  585. qdf_nbuf_queue_t *mpdu = NULL;
  586. uint32_t num_mpdu = 0;
  587. struct msdu_completion_info *ptr_msdu_info = NULL;
  588. uint8_t first_msdu = 0;
  589. uint8_t last_msdu = 0;
  590. uint32_t frag_list_sum_len = 0;
  591. uint8_t first_msdu_not_seen = 1;
  592. uint16_t ether_type = 0;
  593. qdf_ether_header_t *eh = NULL;
  594. num_mpdu = ppdu_desc->num_mpdu;
  595. mpdu = &ppdu_desc->mpdu_q;
  596. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  597. while (curr_nbuf) {
  598. ptr_msdu_info =
  599. (struct msdu_completion_info *)qdf_nbuf_data(curr_nbuf);
  600. first_msdu = ptr_msdu_info->first_msdu;
  601. last_msdu = ptr_msdu_info->last_msdu;
  602. eh = (qdf_ether_header_t *)(curr_nbuf->data +
  603. sizeof(struct msdu_completion_info));
  604. ether_type = eh->ether_type;
  605. /* pull msdu_completion_info added in pre header */
  606. /* pull ethernet header from header */
  607. qdf_nbuf_pull_head(curr_nbuf,
  608. sizeof(struct msdu_completion_info) +
  609. sizeof(qdf_ether_header_t));
  610. if (first_msdu && first_msdu_not_seen) {
  611. first_nbuf = curr_nbuf;
  612. frag_list_sum_len = 0;
  613. first_msdu_not_seen = 0;
  614. mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  615. MAX_MONITOR_HEADER,
  616. MAX_MONITOR_HEADER,
  617. 4, FALSE);
  618. if (!mpdu_nbuf) {
  619. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  620. QDF_TRACE_LEVEL_FATAL,
  621. "MPDU head allocation failed !!!");
  622. goto free_ppdu_desc_mpdu_q;
  623. }
  624. dp_tx_update_80211_hdr(pdev, peer,
  625. ppdu_desc, mpdu_nbuf,
  626. ether_type);
  627. /* update first buffer to previous buffer */
  628. prev_nbuf = curr_nbuf;
  629. } else if (first_msdu && !first_msdu_not_seen) {
  630. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  631. QDF_TRACE_LEVEL_FATAL,
  632. "!!!!! NO LAST MSDU\n");
  633. /*
  634. * no last msdu in a mpdu
  635. * handle this case
  636. */
  637. qdf_nbuf_free(curr_nbuf);
  638. /*
  639. * No last msdu found because WBM comes out
  640. * of order, free the pkt
  641. */
  642. goto free_ppdu_desc_mpdu_q;
  643. } else if (!first_msdu && first_msdu_not_seen) {
  644. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  645. QDF_TRACE_LEVEL_FATAL,
  646. "!!!!! NO FIRST MSDU\n");
  647. /*
  648. * no first msdu in a mpdu
  649. * handle this case
  650. */
  651. qdf_nbuf_free(curr_nbuf);
  652. /*
  653. * no first msdu found beacuse WBM comes out
  654. * of order, free the pkt
  655. */
  656. goto free_ppdu_desc_mpdu_q;
  657. } else {
  658. /* update current buffer to previous buffer next */
  659. prev_nbuf->next = curr_nbuf;
  660. /* move the previous buffer to next buffer */
  661. prev_nbuf = prev_nbuf->next;
  662. }
  663. frag_list_sum_len += qdf_nbuf_len(curr_nbuf);
  664. if (last_msdu) {
  665. /*
  666. * first nbuf will hold list of msdu
  667. * stored in prev_nbuf
  668. */
  669. qdf_nbuf_append_ext_list(mpdu_nbuf,
  670. first_nbuf,
  671. frag_list_sum_len);
  672. /* add mpdu to mpdu queue */
  673. qdf_nbuf_queue_add(mpdu, mpdu_nbuf);
  674. first_nbuf = NULL;
  675. mpdu_nbuf = NULL;
  676. /* next msdu will start with first msdu */
  677. first_msdu_not_seen = 1;
  678. goto check_for_next_msdu;
  679. }
  680. /* get next msdu from the head_msdu */
  681. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  682. if (!curr_nbuf) {
  683. /* msdu missed in list */
  684. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  685. QDF_TRACE_LEVEL_FATAL,
  686. "!!!! WAITING for msdu but list empty !!!!");
  687. }
  688. continue;
  689. check_for_next_msdu:
  690. if (qdf_nbuf_is_queue_empty(head_msdu))
  691. return 0;
  692. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  693. }
  694. return 0;
  695. free_ppdu_desc_mpdu_q:
  696. /* free already chained msdu pkt */
  697. while (first_nbuf) {
  698. curr_nbuf = first_nbuf;
  699. first_nbuf = first_nbuf->next;
  700. qdf_nbuf_free(curr_nbuf);
  701. }
  702. /* free allocated mpdu hdr */
  703. if (mpdu_nbuf)
  704. qdf_nbuf_free(mpdu_nbuf);
  705. /* free queued remaining msdu pkt per ppdu */
  706. qdf_nbuf_queue_free(head_msdu);
  707. /* free queued mpdu per ppdu */
  708. qdf_nbuf_queue_free(mpdu);
  709. return 0;
  710. }
  711. /**
  712. * dp_tx_msdu_dequeue(): Function to dequeue msdu from peer based tid
  713. * @peer: dp_peer
  714. * @ppdu_id: ppdu_id
  715. * @tid: tid
  716. * @num_msdu: number of msdu
  717. * @head: head queue
  718. * @start_tsf: start tsf from ppdu_desc
  719. * @end_tsf: end tsf from ppdu_desc
  720. *
  721. * return: status
  722. */
  723. static
  724. uint32_t dp_tx_msdu_dequeue(struct dp_peer *peer, uint32_t ppdu_id,
  725. uint16_t tid, uint32_t num_msdu,
  726. qdf_nbuf_queue_t *head,
  727. uint32_t start_tsf, uint32_t end_tsf)
  728. {
  729. struct dp_tx_tid *tx_tid = NULL;
  730. uint32_t msdu_ppdu_id;
  731. qdf_nbuf_t curr_msdu = NULL;
  732. qdf_nbuf_t prev_msdu = NULL;
  733. qdf_nbuf_t nbuf = NULL;
  734. struct msdu_completion_info *ptr_msdu_info = NULL;
  735. uint32_t wbm_tsf;
  736. uint32_t matched = 0;
  737. if (qdf_unlikely(!peer))
  738. return 0;
  739. tx_tid = &peer->tx_capture.tx_tid[tid];
  740. if (qdf_unlikely(!tx_tid))
  741. return 0;
  742. if (qdf_nbuf_is_queue_empty(&tx_tid->msdu_comp_q))
  743. return 0;
  744. /* lock here */
  745. qdf_spin_lock_bh(&tx_tid->tid_lock);
  746. curr_msdu = qdf_nbuf_queue_first(&tx_tid->msdu_comp_q);
  747. while (curr_msdu) {
  748. if (qdf_nbuf_queue_len(head) == num_msdu)
  749. break;
  750. ptr_msdu_info =
  751. (struct msdu_completion_info *)qdf_nbuf_data(curr_msdu);
  752. msdu_ppdu_id = ptr_msdu_info->ppdu_id;
  753. wbm_tsf = ptr_msdu_info->tsf;
  754. if (wbm_tsf < start_tsf) {
  755. /* remove the aged packet */
  756. nbuf = qdf_nbuf_queue_remove(
  757. &tx_tid->msdu_comp_q);
  758. qdf_nbuf_free(nbuf);
  759. curr_msdu = qdf_nbuf_queue_first(
  760. &tx_tid->msdu_comp_q);
  761. prev_msdu = NULL;
  762. continue;
  763. }
  764. if (msdu_ppdu_id == ppdu_id) {
  765. matched = 1;
  766. if (wbm_tsf > start_tsf && wbm_tsf < end_tsf) {
  767. /*packet found */
  768. } else if (wbm_tsf > end_tsf) {
  769. /*
  770. * Do we need delta in above case.
  771. * for searching ppdu out of ppdu tsf
  772. */
  773. break;
  774. }
  775. if (qdf_likely(!prev_msdu)) {
  776. /* remove head */
  777. curr_msdu = qdf_nbuf_queue_remove(
  778. &tx_tid->msdu_comp_q);
  779. /* add msdu to head queue */
  780. qdf_nbuf_queue_add(head, curr_msdu);
  781. /* get next msdu from msdu_comp_q */
  782. curr_msdu = qdf_nbuf_queue_first(
  783. &tx_tid->msdu_comp_q);
  784. continue;
  785. } else {
  786. /* update prev_msdu next to current msdu next */
  787. prev_msdu->next = curr_msdu->next;
  788. /* set current msdu next as NULL */
  789. curr_msdu->next = NULL;
  790. /* decrement length */
  791. ((qdf_nbuf_queue_t *)(
  792. &tx_tid->msdu_comp_q))->qlen--;
  793. /* add msdu to head queue */
  794. qdf_nbuf_queue_add(head, curr_msdu);
  795. /* set previous msdu to current msdu */
  796. curr_msdu = prev_msdu->next;
  797. continue;
  798. }
  799. }
  800. prev_msdu = curr_msdu;
  801. curr_msdu = prev_msdu->next;
  802. }
  803. if (qdf_nbuf_queue_len(head) != num_msdu)
  804. matched = 0;
  805. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  806. return matched;
  807. }
  808. /**
  809. * get_mpdu_clone_from_next_ppdu(): Function to clone missing mpdu from
  810. * next ppdu
  811. * @nbuf_ppdu_desc_list: nbuf list
  812. * @ppdu_desc_cnt: ppdu_desc_cnt
  813. * @missed_seq_no:
  814. * @ppdu_id: ppdu_id
  815. * @mpdu_info: cdp_tx_indication_mpdu_info
  816. *
  817. * return: void
  818. */
  819. static
  820. qdf_nbuf_t get_mpdu_clone_from_next_ppdu(qdf_nbuf_t nbuf_ppdu_desc_list[],
  821. uint32_t ppdu_desc_cnt,
  822. uint32_t missed_seq_no,
  823. uint32_t ppdu_id)
  824. {
  825. uint32_t i = 0;
  826. uint32_t k = 0;
  827. uint32_t mpdu_tried = 0;
  828. uint32_t found = 0;
  829. uint32_t seq_no = 0;
  830. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  831. qdf_nbuf_t mpdu = NULL;
  832. for (i = 1; i < ppdu_desc_cnt; i++) {
  833. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  834. qdf_nbuf_data(nbuf_ppdu_desc_list[i]);
  835. mpdu_tried = ppdu_desc->user[0].mpdu_tried_ucast +
  836. ppdu_desc->user[0].mpdu_tried_mcast;
  837. /* check if seq number is between the range */
  838. if ((missed_seq_no >= ppdu_desc->user[0].start_seq) &&
  839. (missed_seq_no <= ppdu_desc->user[0].start_seq +
  840. mpdu_tried)) {
  841. seq_no = ppdu_desc->user[0].start_seq;
  842. if (ppdu_desc->user[0].failed_bitmap[k] &
  843. (1 << (missed_seq_no - seq_no))) {
  844. found = 1;
  845. break;
  846. }
  847. }
  848. }
  849. if (found == 0) {
  850. /* mpdu not found in sched cmd id */
  851. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  852. "%s: missed seq_no[%d] ppdu_id[%d] [%d] not found!!!",
  853. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  854. return NULL;
  855. }
  856. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  857. "%s: seq_no[%d] missed ppdu_id[%d] m[%d] found in ppdu_id[%d]!!",
  858. __func__,
  859. missed_seq_no, ppdu_id,
  860. (missed_seq_no - seq_no), ppdu_desc->ppdu_id);
  861. mpdu = qdf_nbuf_queue_first(&ppdu_desc->mpdu_q);
  862. if (!mpdu) {
  863. /* bitmap shows it found sequence number, but queue empty */
  864. /* do we need to allocate skb and send instead of NULL ? */
  865. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  866. "%s: missed seq_no[%d] ppdu_id[%d] [%d] found but queue empty!!!",
  867. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  868. return NULL;
  869. }
  870. for (i = 0; i < (missed_seq_no - seq_no); i++) {
  871. mpdu = mpdu->next;
  872. if (!mpdu) {
  873. /*
  874. * bitmap shows it found sequence number,
  875. * but queue empty, do we need to allocate
  876. * skb and send instead of NULL ?
  877. * add counter here:
  878. */
  879. return NULL;
  880. }
  881. }
  882. return skb_copy_expand(mpdu, MAX_MONITOR_HEADER, 0, GFP_ATOMIC);
  883. }
  884. /**
  885. * dp_tx_update_user_mpdu_info(): Function to update mpdu info
  886. * from ppdu_desc
  887. * @ppdu_id: ppdu_id
  888. * @mpdu_info: cdp_tx_indication_mpdu_info
  889. * @user: cdp_tx_completion_ppdu_user
  890. *
  891. * return: void
  892. */
  893. static void
  894. dp_tx_update_user_mpdu_info(uint32_t ppdu_id,
  895. struct cdp_tx_indication_mpdu_info *mpdu_info,
  896. struct cdp_tx_completion_ppdu_user *user)
  897. {
  898. mpdu_info->ppdu_id = ppdu_id;
  899. mpdu_info->frame_ctrl = user->frame_ctrl;
  900. mpdu_info->qos_ctrl = user->qos_ctrl;
  901. mpdu_info->tid = user->tid;
  902. mpdu_info->ltf_size = user->ltf_size;
  903. mpdu_info->he_re = user->he_re;
  904. mpdu_info->txbf = user->txbf;
  905. mpdu_info->bw = user->bw;
  906. mpdu_info->nss = user->nss;
  907. mpdu_info->mcs = user->mcs;
  908. mpdu_info->preamble = user->preamble;
  909. mpdu_info->gi = user->gi;
  910. mpdu_info->ack_rssi = user->ack_rssi[0];
  911. mpdu_info->tx_rate = user->tx_rate;
  912. mpdu_info->ldpc = user->ldpc;
  913. mpdu_info->ppdu_cookie = user->ppdu_cookie;
  914. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, 6);
  915. mpdu_info->ba_start_seq = user->ba_seq_no;
  916. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  917. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  918. }
  919. static inline
  920. void dp_tx_update_sequence_number(qdf_nbuf_t nbuf, uint32_t seq_no)
  921. {
  922. struct ieee80211_frame *ptr_wh = NULL;
  923. uint16_t wh_seq = 0;
  924. if (!nbuf)
  925. return;
  926. /* update sequence number in frame header */
  927. ptr_wh = (struct ieee80211_frame *)qdf_nbuf_data(nbuf);
  928. wh_seq = (seq_no & 0xFFF) << 4;
  929. qdf_mem_copy(ptr_wh->i_seq, &wh_seq, sizeof(uint16_t));
  930. }
  931. /**
  932. * dp_send_mpdu_info_to_stack(): Function to deliver mpdu info to stack
  933. * to upper layer
  934. * @pdev: DP pdev handle
  935. * @nbuf_ppdu_desc_list: ppdu_desc_list per sched cmd id
  936. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  937. *
  938. * return: status
  939. */
  940. static
  941. QDF_STATUS dp_send_mpdu_info_to_stack(struct dp_pdev *pdev,
  942. qdf_nbuf_t nbuf_ppdu_desc_list[],
  943. uint32_t ppdu_desc_cnt)
  944. {
  945. uint32_t ppdu_id;
  946. uint32_t desc_cnt;
  947. qdf_nbuf_t tmp_nbuf;
  948. for (desc_cnt = 0; desc_cnt < ppdu_desc_cnt; desc_cnt++) {
  949. struct cdp_tx_completion_ppdu *ppdu_desc;
  950. uint32_t mpdu_tried;
  951. uint32_t num_mpdu;
  952. uint32_t k;
  953. uint32_t i;
  954. uint32_t seq_no = 0;
  955. uint32_t len;
  956. qdf_nbuf_t mpdu_nbuf;
  957. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  958. qdf_nbuf_data(nbuf_ppdu_desc_list[desc_cnt]);
  959. if (!ppdu_desc)
  960. continue;
  961. if (qdf_nbuf_is_queue_empty(&ppdu_desc->mpdu_q)) {
  962. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  963. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  964. qdf_nbuf_free(tmp_nbuf);
  965. continue;
  966. }
  967. ppdu_id = ppdu_desc->ppdu_id;
  968. if (ppdu_desc->frame_type == CDP_PPDU_FTYPE_CTRL) {
  969. struct cdp_tx_indication_info tx_capture_info;
  970. struct cdp_tx_indication_mpdu_info *mpdu_info;
  971. qdf_mem_set(&tx_capture_info,
  972. sizeof(struct cdp_tx_indication_info),
  973. 0);
  974. mpdu_info = &tx_capture_info.mpdu_info;
  975. mpdu_info->channel = ppdu_desc->channel;
  976. mpdu_info->frame_type = ppdu_desc->frame_type;
  977. mpdu_info->ppdu_start_timestamp =
  978. ppdu_desc->ppdu_start_timestamp;
  979. mpdu_info->ppdu_end_timestamp =
  980. ppdu_desc->ppdu_end_timestamp;
  981. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  982. mpdu_info->seq_no = seq_no;
  983. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  984. /* update cdp_tx_indication_mpdu_info */
  985. dp_tx_update_user_mpdu_info(ppdu_desc->ppdu_id,
  986. &tx_capture_info.mpdu_info,
  987. &ppdu_desc->user[0]);
  988. tx_capture_info.mpdu_info.channel_num =
  989. pdev->operating_channel;
  990. tx_capture_info.mpdu_nbuf =
  991. qdf_nbuf_queue_remove(&ppdu_desc->mpdu_q);
  992. /*
  993. * send MPDU to osif layer
  994. * do we need to update mpdu_info before tranmit
  995. * get current mpdu_nbuf
  996. */
  997. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  998. &tx_capture_info, HTT_INVALID_PEER,
  999. WDI_NO_VAL, pdev->pdev_id);
  1000. if (tx_capture_info.mpdu_nbuf)
  1001. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1002. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1003. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1004. qdf_nbuf_free(tmp_nbuf);
  1005. continue;
  1006. }
  1007. ppdu_id = ppdu_desc->ppdu_id;
  1008. /* find mpdu tried is same as success mpdu */
  1009. mpdu_tried = ppdu_desc->user[0].mpdu_tried_ucast +
  1010. ppdu_desc->user[0].mpdu_tried_mcast;
  1011. num_mpdu = ppdu_desc->user[0].mpdu_success;
  1012. /* get length */
  1013. len = qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  1014. /* find list of missing sequence */
  1015. for (i = 0, k = 0; i < mpdu_tried; i++) {
  1016. struct cdp_tx_indication_info tx_capture_info;
  1017. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1018. qdf_mem_set(&tx_capture_info,
  1019. sizeof(struct cdp_tx_indication_info),
  1020. 0);
  1021. mpdu_info = &tx_capture_info.mpdu_info;
  1022. /* missed seq number */
  1023. seq_no = ppdu_desc->user[0].start_seq + i;
  1024. if (!(ppdu_desc->user[0].failed_bitmap[k] & 1 << i)) {
  1025. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1026. QDF_TRACE_LEVEL_ERROR,
  1027. "%s: finding missing seq no: %d in other ppdu list cnt[%d]",
  1028. __func__, seq_no, ppdu_desc_cnt);
  1029. /* send rest of ppdu_desc list */
  1030. mpdu_nbuf = get_mpdu_clone_from_next_ppdu(
  1031. nbuf_ppdu_desc_list + desc_cnt,
  1032. ppdu_desc_cnt - desc_cnt,
  1033. seq_no,
  1034. ppdu_desc->ppdu_id);
  1035. /* check mpdu_nbuf NULL */
  1036. if (!mpdu_nbuf)
  1037. continue;
  1038. qdf_nbuf_queue_add(&ppdu_desc->mpdu_q,
  1039. mpdu_nbuf);
  1040. } else {
  1041. /* any error case we need to handle */
  1042. }
  1043. /* k need to be increase, if i increased more than 32 */
  1044. tx_capture_info.mpdu_nbuf =
  1045. qdf_nbuf_queue_remove(&ppdu_desc->mpdu_q);
  1046. if (!tx_capture_info.mpdu_nbuf)
  1047. continue;
  1048. mpdu_info->channel = ppdu_desc->channel;
  1049. mpdu_info->frame_type = ppdu_desc->frame_type;
  1050. mpdu_info->ppdu_start_timestamp =
  1051. ppdu_desc->ppdu_start_timestamp;
  1052. mpdu_info->ppdu_end_timestamp =
  1053. ppdu_desc->ppdu_end_timestamp;
  1054. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1055. mpdu_info->seq_no = seq_no;
  1056. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  1057. /* update cdp_tx_indication_mpdu_info */
  1058. dp_tx_update_user_mpdu_info(ppdu_id,
  1059. &tx_capture_info.mpdu_info,
  1060. &ppdu_desc->user[0]);
  1061. tx_capture_info.mpdu_info.channel_num =
  1062. pdev->operating_channel;
  1063. dp_tx_update_sequence_number(tx_capture_info.mpdu_nbuf,
  1064. seq_no);
  1065. /*
  1066. * send MPDU to osif layer
  1067. * do we need to update mpdu_info before tranmit
  1068. * get current mpdu_nbuf
  1069. */
  1070. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1071. &tx_capture_info,
  1072. HTT_INVALID_PEER,
  1073. WDI_NO_VAL, pdev->pdev_id);
  1074. if (tx_capture_info.mpdu_nbuf)
  1075. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1076. }
  1077. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1078. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1079. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1080. qdf_nbuf_free(tmp_nbuf);
  1081. }
  1082. return QDF_STATUS_SUCCESS;
  1083. }
  1084. /**
  1085. * dp_tx_ppdu_stats_process - Deferred PPDU stats handler
  1086. * @context: Opaque work context (PDEV)
  1087. *
  1088. * Return: none
  1089. */
  1090. void dp_tx_ppdu_stats_process(void *context)
  1091. {
  1092. uint32_t curr_sched_cmdid;
  1093. uint32_t last_ppdu_id;
  1094. uint32_t ppdu_cnt;
  1095. uint32_t ppdu_desc_cnt = 0;
  1096. struct dp_pdev *pdev = (struct dp_pdev *)context;
  1097. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  1098. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  1099. struct ppdu_info *sched_ppdu_info = NULL;
  1100. STAILQ_HEAD(, ppdu_info) sched_ppdu_queue;
  1101. struct ppdu_info *sched_ppdu_list_last_ptr;
  1102. qdf_nbuf_t *nbuf_ppdu_desc_list;
  1103. qdf_nbuf_t tmp_nbuf;
  1104. struct dp_pdev_tx_capture *ptr_tx_cap = &pdev->tx_capture;
  1105. STAILQ_INIT(&sched_ppdu_queue);
  1106. /* Move the PPDU entries to defer list */
  1107. qdf_spin_lock_bh(&ptr_tx_cap->ppdu_stats_lock);
  1108. STAILQ_CONCAT(&ptr_tx_cap->ppdu_stats_defer_queue,
  1109. &ptr_tx_cap->ppdu_stats_queue);
  1110. ptr_tx_cap->ppdu_stats_defer_queue_depth +=
  1111. ptr_tx_cap->ppdu_stats_queue_depth;
  1112. ptr_tx_cap->ppdu_stats_queue_depth = 0;
  1113. qdf_spin_unlock_bh(&ptr_tx_cap->ppdu_stats_lock);
  1114. while (!STAILQ_EMPTY(&ptr_tx_cap->ppdu_stats_defer_queue)) {
  1115. ppdu_info =
  1116. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  1117. curr_sched_cmdid = ppdu_info->sched_cmdid;
  1118. ppdu_cnt = 0;
  1119. STAILQ_FOREACH_SAFE(ppdu_info,
  1120. &ptr_tx_cap->ppdu_stats_defer_queue,
  1121. ppdu_info_queue_elem, tmp_ppdu_info) {
  1122. if (curr_sched_cmdid != ppdu_info->sched_cmdid)
  1123. break;
  1124. sched_ppdu_list_last_ptr = ppdu_info;
  1125. ppdu_cnt++;
  1126. }
  1127. if (ppdu_info && (curr_sched_cmdid == ppdu_info->sched_cmdid) &&
  1128. ptr_tx_cap->ppdu_stats_next_sched < now_ms)
  1129. break;
  1130. last_ppdu_id = sched_ppdu_list_last_ptr->ppdu_id;
  1131. STAILQ_FIRST(&sched_ppdu_queue) =
  1132. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  1133. STAILQ_REMOVE_HEAD_UNTIL(&ptr_tx_cap->ppdu_stats_defer_queue,
  1134. sched_ppdu_list_last_ptr,
  1135. ppdu_info_queue_elem);
  1136. STAILQ_NEXT(sched_ppdu_list_last_ptr,
  1137. ppdu_info_queue_elem) = NULL;
  1138. ptr_tx_cap->ppdu_stats_defer_queue_depth -= ppdu_cnt;
  1139. nbuf_ppdu_desc_list =
  1140. (qdf_nbuf_t *) qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  1141. ppdu_cnt);
  1142. /*
  1143. * if there is no memory allocated we need to free sched ppdu
  1144. * list, no ppdu stats will be updated.
  1145. */
  1146. if (!nbuf_ppdu_desc_list) {
  1147. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  1148. &sched_ppdu_queue,
  1149. ppdu_info_queue_elem,
  1150. tmp_ppdu_info) {
  1151. ppdu_info = sched_ppdu_info;
  1152. tmp_nbuf = ppdu_info->nbuf;
  1153. qdf_mem_free(ppdu_info);
  1154. qdf_nbuf_free(tmp_nbuf);
  1155. }
  1156. continue;
  1157. }
  1158. ppdu_desc_cnt = 0;
  1159. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  1160. &sched_ppdu_queue,
  1161. ppdu_info_queue_elem, tmp_ppdu_info) {
  1162. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1163. struct dp_peer *peer = NULL;
  1164. qdf_nbuf_t nbuf;
  1165. uint32_t retries = 0;
  1166. uint32_t ret = 0;
  1167. qdf_nbuf_queue_t head_msdu;
  1168. uint32_t start_tsf = 0;
  1169. uint32_t end_tsf = 0;
  1170. uint16_t tid = 0;
  1171. uint32_t num_msdu = 0;
  1172. uint32_t qlen = 0;
  1173. qdf_nbuf_queue_init(&head_msdu);
  1174. ppdu_info = sched_ppdu_info;
  1175. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1176. qdf_nbuf_data(ppdu_info->nbuf);
  1177. pdev->tx_ppdu_proc++;
  1178. dp_ppdu_desc_user_stats_update(pdev, ppdu_info);
  1179. /*
  1180. * While processing/corelating Tx buffers, we should
  1181. * hold the entire PPDU list for the give sched_cmdid
  1182. * instead of freeing below.
  1183. */
  1184. nbuf = ppdu_info->nbuf;
  1185. qdf_mem_free(ppdu_info);
  1186. qdf_assert_always(nbuf);
  1187. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1188. qdf_nbuf_data(nbuf);
  1189. /* send WDI event */
  1190. if (pdev->tx_capture_enabled ==
  1191. CDP_TX_ENH_CAPTURE_DISABLED) {
  1192. /**
  1193. * Deliver PPDU stats only for valid (acked)
  1194. * data frames if sniffer mode is not enabled.
  1195. * If sniffer mode is enabled,
  1196. * PPDU stats for all frames including
  1197. * mgmt/control frames should be delivered
  1198. * to upper layer
  1199. */
  1200. if (pdev->tx_sniffer_enable ||
  1201. pdev->mcopy_mode) {
  1202. dp_wdi_event_handler(
  1203. WDI_EVENT_TX_PPDU_DESC,
  1204. pdev->soc,
  1205. nbuf,
  1206. HTT_INVALID_PEER,
  1207. WDI_NO_VAL,
  1208. pdev->pdev_id);
  1209. } else {
  1210. if (ppdu_desc->num_mpdu != 0 &&
  1211. ppdu_desc->num_users != 0 &&
  1212. (ppdu_desc->frame_ctrl &
  1213. HTT_FRAMECTRL_DATATYPE)) {
  1214. dp_wdi_event_handler(
  1215. WDI_EVENT_TX_PPDU_DESC,
  1216. pdev->soc,
  1217. nbuf,
  1218. HTT_INVALID_PEER,
  1219. WDI_NO_VAL,
  1220. pdev->pdev_id);
  1221. } else {
  1222. qdf_nbuf_free(nbuf);
  1223. }
  1224. }
  1225. continue;
  1226. }
  1227. peer = dp_peer_find_by_id(pdev->soc,
  1228. ppdu_desc->user[0].peer_id);
  1229. /**
  1230. * peer can be NULL
  1231. */
  1232. if (!peer) {
  1233. qdf_nbuf_free(nbuf);
  1234. continue;
  1235. }
  1236. /**
  1237. * check whether it is bss peer,
  1238. * if bss_peer no need to process further
  1239. */
  1240. if (peer->bss_peer) {
  1241. dp_peer_unref_del_find_by_id(peer);
  1242. qdf_nbuf_free(nbuf);
  1243. continue;
  1244. }
  1245. /**
  1246. * check whether tx_capture feature is enabled
  1247. * for this peer or globally for all peers
  1248. */
  1249. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, peer)) {
  1250. dp_peer_unref_del_find_by_id(peer);
  1251. qdf_nbuf_free(nbuf);
  1252. continue;
  1253. }
  1254. if ((ppdu_desc->frame_type == CDP_PPDU_FTYPE_DATA) &&
  1255. (!ppdu_desc->user[0].completion_status)) {
  1256. /* print the bit map */
  1257. dp_tx_print_bitmap(pdev, ppdu_desc,
  1258. 0, ppdu_desc->ppdu_id);
  1259. if (ppdu_desc->user[0].tid > DP_NON_QOS_TID) {
  1260. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1261. QDF_TRACE_LEVEL_ERROR,
  1262. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  1263. __func__,
  1264. ppdu_desc->ppdu_id,
  1265. ppdu_desc->user[0].peer_id,
  1266. ppdu_desc->user[0].tid);
  1267. dp_peer_unref_del_find_by_id(peer);
  1268. qdf_nbuf_free(nbuf);
  1269. continue;
  1270. }
  1271. dequeue_msdu_again:
  1272. tid = ppdu_desc->user[0].tid;
  1273. num_msdu = ppdu_desc->user[0].num_msdu;
  1274. start_tsf = ppdu_desc->ppdu_start_timestamp;
  1275. end_tsf = ppdu_desc->ppdu_end_timestamp;
  1276. /*
  1277. * retrieve msdu buffer based on ppdu_id & tid
  1278. * based msdu queue and store it in local queue
  1279. * sometimes, wbm comes later than per ppdu
  1280. * stats. Assumption: all packets are SU,
  1281. * and packets comes in order
  1282. */
  1283. ret = dp_tx_msdu_dequeue(peer,
  1284. ppdu_desc->ppdu_id,
  1285. tid, num_msdu,
  1286. &head_msdu, start_tsf,
  1287. end_tsf);
  1288. if (!ret && (++retries < 3)) {
  1289. /* wait for wbm to complete */
  1290. qdf_sleep(20);
  1291. goto dequeue_msdu_again;
  1292. }
  1293. if (qdf_nbuf_is_queue_empty(&head_msdu)) {
  1294. dp_peer_unref_del_find_by_id(peer);
  1295. /*
  1296. * head msdu is NULL
  1297. * free nbuf as no processing required
  1298. */
  1299. qdf_nbuf_free(nbuf);
  1300. continue;
  1301. }
  1302. /*
  1303. * now head_msdu hold - msdu list for that
  1304. * particular ppdu_id, restitch mpdu from
  1305. * msdu and create a mpdu queue
  1306. */
  1307. dp_tx_mon_restitch_mpdu_from_msdus(pdev,
  1308. peer,
  1309. ppdu_desc,
  1310. &head_msdu);
  1311. /*
  1312. * sanity: free local head msdu queue
  1313. * do we need this ?
  1314. */
  1315. qdf_nbuf_queue_free(&head_msdu);
  1316. qlen = qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  1317. if (!qlen) {
  1318. qdf_nbuf_free(nbuf);
  1319. dp_peer_unref_del_find_by_id(peer);
  1320. continue;
  1321. }
  1322. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  1323. /* print ppdu_desc info for debugging purpose */
  1324. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1325. QDF_TRACE_LEVEL_INFO,
  1326. "%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]",
  1327. __func__, ppdu_desc->ppdu_id,
  1328. ppdu_desc->user[0].peer_id,
  1329. ppdu_desc->user[0].tid,
  1330. ppdu_desc->num_mpdu,
  1331. ppdu_desc->user[0].mpdu_success,
  1332. ppdu_desc->num_msdu, retries,
  1333. qlen,
  1334. ppdu_desc->ppdu_start_timestamp,
  1335. ppdu_desc->tx_duration,
  1336. ppdu_desc->user[0].start_seq,
  1337. ppdu_cnt,
  1338. ppdu_desc_cnt);
  1339. nbuf->next =
  1340. qdf_nbuf_queue_first(&ppdu_desc->mpdu_q);
  1341. } else if (ppdu_desc->frame_type ==
  1342. CDP_PPDU_FTYPE_CTRL) {
  1343. nbuf->next =
  1344. qdf_nbuf_queue_first(&ppdu_desc->mpdu_q);
  1345. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  1346. } else {
  1347. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1348. qdf_nbuf_free(nbuf);
  1349. }
  1350. dp_peer_unref_del_find_by_id(peer);
  1351. }
  1352. /*
  1353. * At this point we have mpdu queued per ppdu_desc
  1354. * based on packet capture flags send mpdu info to upper stack
  1355. */
  1356. if (ppdu_desc_cnt) {
  1357. dp_send_mpdu_info_to_stack(pdev,
  1358. nbuf_ppdu_desc_list,
  1359. ppdu_desc_cnt);
  1360. }
  1361. qdf_mem_free(nbuf_ppdu_desc_list);
  1362. }
  1363. }
  1364. /**
  1365. * dp_ppdu_desc_deliver(): Function to deliver Tx PPDU status descriptor
  1366. * to upper layer
  1367. * @pdev: DP pdev handle
  1368. * @ppdu_info: per PPDU TLV descriptor
  1369. *
  1370. * return: void
  1371. */
  1372. void dp_ppdu_desc_deliver(struct dp_pdev *pdev,
  1373. struct ppdu_info *ppdu_info)
  1374. {
  1375. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  1376. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1377. TAILQ_REMOVE(&pdev->ppdu_info_list, ppdu_info, ppdu_info_list_elem);
  1378. pdev->list_depth--;
  1379. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1380. qdf_nbuf_data(ppdu_info->nbuf);
  1381. qdf_spin_lock_bh(&pdev->tx_capture.ppdu_stats_lock);
  1382. if (qdf_unlikely(!pdev->tx_capture_enabled &&
  1383. (pdev->tx_capture.ppdu_stats_queue_depth +
  1384. pdev->tx_capture.ppdu_stats_defer_queue_depth) >
  1385. DP_TX_PPDU_PROC_MAX_DEPTH)) {
  1386. qdf_nbuf_free(ppdu_info->nbuf);
  1387. qdf_mem_free(ppdu_info);
  1388. pdev->tx_capture.ppdu_dropped++;
  1389. } else {
  1390. STAILQ_INSERT_TAIL(&pdev->tx_capture.ppdu_stats_queue,
  1391. ppdu_info, ppdu_info_queue_elem);
  1392. pdev->tx_capture.ppdu_stats_queue_depth++;
  1393. }
  1394. qdf_spin_unlock_bh(&pdev->tx_capture.ppdu_stats_lock);
  1395. if ((pdev->tx_capture.ppdu_stats_queue_depth >
  1396. DP_TX_PPDU_PROC_THRESHOLD) ||
  1397. (pdev->tx_capture.ppdu_stats_next_sched <= now_ms)) {
  1398. qdf_queue_work(0, pdev->tx_capture.ppdu_stats_workqueue,
  1399. &pdev->tx_capture.ppdu_stats_work);
  1400. pdev->tx_capture.ppdu_stats_next_sched =
  1401. now_ms + DP_TX_PPDU_PROC_TIMEOUT;
  1402. }
  1403. }
  1404. #endif