dp_tx_capture.c 47 KB

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