dp_tx_capture.c 41 KB

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