dp_tx_capture.c 40 KB

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