dp_tx_capture.c 39 KB

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