dp_tx_capture.c 64 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309
  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. /* Macros to handle sequence number bitmaps */
  34. /* Size (in bits) of a segment of sequence number bitmap */
  35. #define SEQ_SEG_SZ_BITS(_seqarr) (sizeof(_seqarr[0]) << 3)
  36. /* Array index of a segment of sequence number bitmap */
  37. #define SEQ_SEG_INDEX(_seqarr, _seqno) ((_seqno) / SEQ_SEG_SZ_BITS(_seqarr))
  38. /* Bit mask of a seqno within a segment of sequence bitmap */
  39. #define SEQ_SEG_MSK(_seqseg, _index) \
  40. (1 << ((_index) & ((sizeof(_seqseg) << 3) - 1)))
  41. /* Check seqno bit in a segment of sequence bitmap */
  42. #define SEQ_SEG_BIT(_seqseg, _index) \
  43. ((_seqseg) & SEQ_SEG_MSK((_seqseg), _index))
  44. /* Segment of sequence bitmap containing a given sequence number */
  45. #define SEQ_SEG(_seqarr, _seqno) \
  46. (_seqarr[(_seqno) / (sizeof(_seqarr[0]) << 3)])
  47. /* Check seqno bit in the sequence bitmap */
  48. #define SEQ_BIT(_seqarr, _seqno) \
  49. SEQ_SEG_BIT(SEQ_SEG(_seqarr, (_seqno)), (_seqno))
  50. #ifdef WLAN_TX_PKT_CAPTURE_ENH
  51. /**
  52. * dp_peer_or_pdev_tx_cap_enabled - Returns status of tx_cap_enabled
  53. * based on global per-pdev setting or per-peer setting
  54. * @pdev: Datapath pdev handle
  55. * @peer: Datapath peer
  56. *
  57. * Return: true if feature is enabled on a per-pdev basis or if
  58. * enabled for the given peer when per-peer mode is set, false otherwise
  59. */
  60. inline bool
  61. dp_peer_or_pdev_tx_cap_enabled(struct dp_pdev *pdev,
  62. struct dp_peer *peer)
  63. {
  64. if ((pdev->tx_capture_enabled ==
  65. CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS) ||
  66. ((pdev->tx_capture_enabled ==
  67. CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) &&
  68. peer->tx_cap_enabled))
  69. return true;
  70. return false;
  71. }
  72. /*
  73. * dp_peer_tid_queue_init() – Initialize ppdu stats queue per TID
  74. * @peer: Datapath peer
  75. *
  76. */
  77. void dp_peer_tid_queue_init(struct dp_peer *peer)
  78. {
  79. int tid;
  80. struct dp_tx_tid *tx_tid;
  81. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  82. tx_tid = &peer->tx_capture.tx_tid[tid];
  83. tx_tid->tid = tid;
  84. qdf_nbuf_queue_init(&tx_tid->msdu_comp_q);
  85. qdf_nbuf_queue_init(&tx_tid->pending_ppdu_q);
  86. tx_tid->max_ppdu_id = 0;
  87. /* spinlock create */
  88. qdf_spinlock_create(&tx_tid->tid_lock);
  89. }
  90. }
  91. /*
  92. * dp_peer_tid_queue_cleanup() – remove ppdu stats queue per TID
  93. * @peer: Datapath peer
  94. *
  95. */
  96. void dp_peer_tid_queue_cleanup(struct dp_peer *peer)
  97. {
  98. int tid;
  99. struct dp_tx_tid *tx_tid;
  100. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  101. tx_tid = &peer->tx_capture.tx_tid[tid];
  102. qdf_spin_lock_bh(&tx_tid->tid_lock);
  103. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  104. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  105. /* spinlock destroy */
  106. qdf_spinlock_destroy(&tx_tid->tid_lock);
  107. tx_tid->max_ppdu_id = 0;
  108. }
  109. }
  110. /*
  111. * dp_peer_update_80211_hdr: update 80211 hdr
  112. * @vdev: DP VDEV
  113. * @peer: DP PEER
  114. *
  115. * return: void
  116. */
  117. void dp_peer_update_80211_hdr(struct dp_vdev *vdev, struct dp_peer *peer)
  118. {
  119. struct ieee80211_frame *ptr_wh;
  120. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  121. /* i_addr1 - Receiver mac address */
  122. /* i_addr2 - Transmitter mac address */
  123. /* i_addr3 - Destination mac address */
  124. qdf_mem_copy(ptr_wh->i_addr1,
  125. peer->mac_addr.raw,
  126. QDF_MAC_ADDR_SIZE);
  127. qdf_mem_copy(ptr_wh->i_addr3,
  128. peer->mac_addr.raw,
  129. QDF_MAC_ADDR_SIZE);
  130. qdf_mem_copy(ptr_wh->i_addr2,
  131. vdev->mac_addr.raw,
  132. QDF_MAC_ADDR_SIZE);
  133. }
  134. /*
  135. * dp_deliver_mgmt_frm: Process
  136. * @pdev: DP PDEV handle
  137. * @nbuf: buffer containing the htt_ppdu_stats_tx_mgmtctrl_payload_tlv
  138. *
  139. * return: void
  140. */
  141. void dp_deliver_mgmt_frm(struct dp_pdev *pdev, qdf_nbuf_t nbuf)
  142. {
  143. uint32_t ppdu_id;
  144. if (pdev->tx_sniffer_enable || pdev->mcopy_mode) {
  145. dp_wdi_event_handler(WDI_EVENT_TX_MGMT_CTRL, pdev->soc,
  146. nbuf, HTT_INVALID_PEER,
  147. WDI_NO_VAL, pdev->pdev_id);
  148. return;
  149. }
  150. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  151. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  152. /* invoke WDI event handler here send mgmt pkt here */
  153. struct ieee80211_frame *wh;
  154. uint8_t type, subtype;
  155. ppdu_id = *(uint32_t *)qdf_nbuf_data(nbuf);
  156. wh = (struct ieee80211_frame *)(qdf_nbuf_data(nbuf) +
  157. sizeof(uint32_t));
  158. type = (wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) >>
  159. IEEE80211_FC0_TYPE_SHIFT;
  160. subtype = (wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) >>
  161. IEEE80211_FC0_SUBTYPE_SHIFT;
  162. qdf_spin_lock_bh(
  163. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  164. qdf_nbuf_queue_add(&pdev->tx_capture.ctl_mgmt_q[type][subtype],
  165. nbuf);
  166. qdf_spin_unlock_bh(
  167. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  168. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  169. "dlvr mgmt frm(0x%08x): fc 0x%x %x, dur 0x%x%x\n",
  170. ppdu_id, wh->i_fc[1], wh->i_fc[0],
  171. wh->i_dur[1], wh->i_dur[0]);
  172. }
  173. }
  174. /**
  175. * dp_tx_ppdu_stats_attach - Initialize Tx PPDU stats and enhanced capture
  176. * @pdev: DP PDEV
  177. *
  178. * Return: none
  179. */
  180. void dp_tx_ppdu_stats_attach(struct dp_pdev *pdev)
  181. {
  182. int i, j;
  183. /* Work queue setup for HTT stats and tx capture handling */
  184. qdf_create_work(0, &pdev->tx_capture.ppdu_stats_work,
  185. dp_tx_ppdu_stats_process,
  186. pdev);
  187. pdev->tx_capture.ppdu_stats_workqueue =
  188. qdf_alloc_unbound_workqueue("ppdu_stats_work_queue");
  189. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_queue);
  190. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_defer_queue);
  191. qdf_spinlock_create(&pdev->tx_capture.ppdu_stats_lock);
  192. pdev->tx_capture.ppdu_stats_queue_depth = 0;
  193. pdev->tx_capture.ppdu_stats_next_sched = 0;
  194. pdev->tx_capture.ppdu_stats_defer_queue_depth = 0;
  195. pdev->tx_capture.ppdu_dropped = 0;
  196. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  197. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  198. qdf_nbuf_queue_init(
  199. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  200. qdf_spinlock_create(
  201. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  202. }
  203. }
  204. }
  205. /**
  206. * dp_tx_ppdu_stats_detach - Cleanup Tx PPDU stats and enhanced capture
  207. * @pdev: DP PDEV
  208. *
  209. * Return: none
  210. */
  211. void dp_tx_ppdu_stats_detach(struct dp_pdev *pdev)
  212. {
  213. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  214. int i, j;
  215. if (!pdev || !pdev->tx_capture.ppdu_stats_workqueue)
  216. return;
  217. qdf_flush_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  218. qdf_destroy_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  219. qdf_spinlock_destroy(&pdev->tx_capture.ppdu_stats_lock);
  220. STAILQ_FOREACH_SAFE(ppdu_info,
  221. &pdev->tx_capture.ppdu_stats_queue,
  222. ppdu_info_queue_elem, tmp_ppdu_info) {
  223. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_queue,
  224. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  225. qdf_nbuf_free(ppdu_info->nbuf);
  226. qdf_mem_free(ppdu_info);
  227. }
  228. STAILQ_FOREACH_SAFE(ppdu_info,
  229. &pdev->tx_capture.ppdu_stats_defer_queue,
  230. ppdu_info_queue_elem, tmp_ppdu_info) {
  231. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_defer_queue,
  232. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  233. qdf_nbuf_free(ppdu_info->nbuf);
  234. qdf_mem_free(ppdu_info);
  235. }
  236. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  237. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  238. qdf_spin_lock_bh(
  239. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  240. qdf_nbuf_queue_free(
  241. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  242. qdf_spin_unlock_bh(
  243. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  244. qdf_spinlock_destroy(
  245. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  246. }
  247. }
  248. }
  249. /**
  250. * dp_update_msdu_to_list(): Function to queue msdu from wbm
  251. * @pdev: dp_pdev
  252. * @peer: dp_peer
  253. * @ts: hal tx completion status
  254. * @netbuf: msdu
  255. *
  256. * return: status
  257. */
  258. QDF_STATUS
  259. dp_update_msdu_to_list(struct dp_soc *soc,
  260. struct dp_pdev *pdev,
  261. struct dp_peer *peer,
  262. struct hal_tx_completion_status *ts,
  263. qdf_nbuf_t netbuf)
  264. {
  265. struct dp_tx_tid *tx_tid;
  266. struct msdu_completion_info *msdu_comp_info;
  267. if (!peer) {
  268. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  269. "%s: %d peer NULL !", __func__, __LINE__);
  270. return QDF_STATUS_E_FAILURE;
  271. }
  272. if (ts->tid > DP_MAX_TIDS) {
  273. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  274. "%s: %d peer_id %d, tid %d > NON_QOS_TID!",
  275. __func__, __LINE__, ts->peer_id, ts->tid);
  276. return QDF_STATUS_E_FAILURE;
  277. }
  278. tx_tid = &peer->tx_capture.tx_tid[ts->tid];
  279. if (!tx_tid) {
  280. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  281. "%s: %d tid[%d] NULL !", __func__, __LINE__, ts->tid);
  282. return QDF_STATUS_E_FAILURE;
  283. }
  284. qdf_nbuf_unmap(soc->osdev, netbuf, QDF_DMA_TO_DEVICE);
  285. if (!qdf_nbuf_push_head(netbuf, sizeof(struct msdu_completion_info))) {
  286. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  287. FL("No headroom"));
  288. return QDF_STATUS_E_NOMEM;
  289. }
  290. msdu_comp_info = (struct msdu_completion_info *)qdf_nbuf_data(netbuf);
  291. /* copy msdu_completion_info to control buffer */
  292. msdu_comp_info->ppdu_id = ts->ppdu_id;
  293. msdu_comp_info->peer_id = ts->peer_id;
  294. msdu_comp_info->tid = ts->tid;
  295. msdu_comp_info->first_msdu = ts->first_msdu;
  296. msdu_comp_info->last_msdu = ts->last_msdu;
  297. msdu_comp_info->msdu_part_of_amsdu = ts->msdu_part_of_amsdu;
  298. msdu_comp_info->transmit_cnt = ts->transmit_cnt;
  299. msdu_comp_info->tsf = ts->tsf;
  300. msdu_comp_info->status = ts->status;
  301. /* update max ppdu_id */
  302. tx_tid->max_ppdu_id = ts->ppdu_id;
  303. pdev->tx_capture.last_msdu_id = ts->ppdu_id;
  304. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  305. "msdu_completion: ppdu_id[%d] peer_id[%d] tid[%d] rel_src[%d] status[%d] tsf[%u] A[%d] CNT[%d]",
  306. ts->ppdu_id, ts->peer_id, ts->tid, ts->release_src,
  307. ts->status, ts->tsf, ts->msdu_part_of_amsdu,
  308. ts->transmit_cnt);
  309. /* lock here */
  310. qdf_spin_lock_bh(&tx_tid->tid_lock);
  311. /* add nbuf to tail queue per peer tid */
  312. qdf_nbuf_queue_add(&tx_tid->msdu_comp_q, netbuf);
  313. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  314. return QDF_STATUS_SUCCESS;
  315. }
  316. /**
  317. * dp_tx_add_to_comp_queue() - add completion msdu to queue
  318. * @soc: DP Soc handle
  319. * @tx_desc: software Tx descriptor
  320. * @ts : Tx completion status from HAL/HTT descriptor
  321. * @peer: DP peer
  322. *
  323. * Return: none
  324. */
  325. QDF_STATUS dp_tx_add_to_comp_queue(struct dp_soc *soc,
  326. struct dp_tx_desc_s *desc,
  327. struct hal_tx_completion_status *ts,
  328. struct dp_peer *peer)
  329. {
  330. int ret = QDF_STATUS_E_FAILURE;
  331. if ((desc->pdev->tx_capture_enabled != CDP_TX_ENH_CAPTURE_DISABLED) &&
  332. ((ts->status == HAL_TX_TQM_RR_FRAME_ACKED) ||
  333. (ts->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  334. ((ts->status == HAL_TX_TQM_RR_REM_CMD_AGED) && ts->transmit_cnt))) {
  335. ret = dp_update_msdu_to_list(soc, desc->pdev,
  336. peer, ts, desc->nbuf);
  337. }
  338. return ret;
  339. }
  340. /**
  341. * dp_process_ppdu_stats_update_failed_bitmap(): update failed bitmap
  342. * @pdev: dp_pdev
  343. * @data: tx completion ppdu desc
  344. * @ppdu_id: ppdu id
  345. * @size: size of bitmap
  346. *
  347. * return: status
  348. */
  349. void dp_process_ppdu_stats_update_failed_bitmap(struct dp_pdev *pdev,
  350. void *data,
  351. uint32_t ppdu_id,
  352. uint32_t size)
  353. {
  354. struct cdp_tx_completion_ppdu_user *user;
  355. uint32_t mpdu_tried;
  356. uint32_t ba_seq_no;
  357. uint32_t start_seq;
  358. uint32_t num_mpdu;
  359. uint32_t diff;
  360. uint32_t carry = 0;
  361. uint32_t bitmask = 0;
  362. uint32_t i;
  363. uint32_t k;
  364. uint32_t ba_bitmap = 0;
  365. int last_set_bit;
  366. user = (struct cdp_tx_completion_ppdu_user *)data;
  367. /* get number of mpdu from ppdu_desc */
  368. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  369. ba_seq_no = user->ba_seq_no;
  370. start_seq = user->start_seq;
  371. num_mpdu = user->num_mpdu;
  372. /* assumption: number of mpdu will be less than 32 */
  373. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  374. "ppdu_id[%d] ba_seq_no[%d] start_seq_no[%d] mpdu_tried[%d]",
  375. ppdu_id, ba_seq_no, start_seq, mpdu_tried);
  376. for (i = 0; i < size; i++) {
  377. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  378. "ppdu_id[%d] ba_bitmap[%x] enqueue_bitmap[%x]",
  379. ppdu_id, user->ba_bitmap[i], user->enq_bitmap[i]);
  380. }
  381. /* Handle sequence no. wraparound */
  382. if (start_seq <= ba_seq_no) {
  383. diff = ba_seq_no - start_seq;
  384. /* Sequence delta of more than 2048 is considered wraparound
  385. * and we extend start_seq to be more than ba_seq just to
  386. * adjust failed_bitmap
  387. */
  388. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  389. diff = (start_seq - ba_seq_no) &
  390. (IEEE80211_SEQ_MAX - 1);
  391. start_seq = ba_seq_no + diff;
  392. }
  393. } else {
  394. diff = start_seq - ba_seq_no;
  395. /* Sequence delta of more than 2048 is considered wraparound
  396. * and we extend ba_seq to be more than start_seq just to
  397. * adjust failed_bitmap
  398. */
  399. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  400. diff = (ba_seq_no - start_seq) &
  401. (IEEE80211_SEQ_MAX - 1);
  402. ba_seq_no = start_seq + diff;
  403. }
  404. }
  405. /* Adjust failed_bitmap to start from same seq_no as enq_bitmap */
  406. last_set_bit = 0;
  407. if (start_seq <= ba_seq_no) {
  408. bitmask = (1 << diff) - 1;
  409. for (i = 0; i < size; i++) {
  410. ba_bitmap = user->ba_bitmap[i];
  411. user->failed_bitmap[i] = (ba_bitmap << diff);
  412. user->failed_bitmap[i] |= (bitmask & carry);
  413. carry = ((ba_bitmap & (bitmask << (32 - diff))) >>
  414. (32 - diff));
  415. user->failed_bitmap[i] = user->enq_bitmap[i] &
  416. user->failed_bitmap[i];
  417. if (user->enq_bitmap[i]) {
  418. last_set_bit = i * 32 +
  419. qdf_fls(user->enq_bitmap[i]) - 1;
  420. }
  421. }
  422. } else {
  423. /* array index */
  424. k = diff >> 5;
  425. diff = diff & 0x1F;
  426. bitmask = (1 << diff) - 1;
  427. for (i = 0; i < size; i++, k++) {
  428. ba_bitmap = user->ba_bitmap[k];
  429. user->failed_bitmap[i] = ba_bitmap >> diff;
  430. /* get next ba_bitmap */
  431. ba_bitmap = user->ba_bitmap[k + 1];
  432. carry = (ba_bitmap & bitmask);
  433. user->failed_bitmap[i] |=
  434. ((carry & bitmask) << (32 - diff));
  435. user->failed_bitmap[i] = user->enq_bitmap[i] &
  436. user->failed_bitmap[i];
  437. if (user->enq_bitmap[i]) {
  438. last_set_bit = i * 32 +
  439. qdf_fls(user->enq_bitmap[i]) - 1;
  440. }
  441. }
  442. }
  443. user->last_enq_seq = user->start_seq + last_set_bit;
  444. user->ba_size = user->last_enq_seq - user->start_seq + 1;
  445. }
  446. /*
  447. * dp_soc_set_txrx_ring_map_single()
  448. * @dp_soc: DP handler for soc
  449. *
  450. * Return: Void
  451. */
  452. static void dp_soc_set_txrx_ring_map_single(struct dp_soc *soc)
  453. {
  454. uint32_t i;
  455. for (i = 0; i < WLAN_CFG_INT_NUM_CONTEXTS; i++) {
  456. soc->tx_ring_map[i] =
  457. dp_cpu_ring_map[DP_SINGLE_TX_RING_MAP][i];
  458. }
  459. }
  460. /*
  461. * dp_iterate_free_peer_msdu_q()- API to free msdu queue
  462. * @pdev_handle: DP_PDEV handle
  463. *
  464. * Return: void
  465. */
  466. static void dp_iterate_free_peer_msdu_q(void *pdev_hdl)
  467. {
  468. struct dp_pdev *pdev = (struct dp_pdev *)pdev_hdl;
  469. struct dp_soc *soc = pdev->soc;
  470. struct dp_vdev *vdev = NULL;
  471. struct dp_peer *peer = NULL;
  472. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  473. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  474. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  475. DP_VDEV_ITERATE_PEER_LIST(vdev, peer) {
  476. int tid;
  477. struct dp_tx_tid *tx_tid;
  478. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  479. qdf_nbuf_t ppdu_nbuf = NULL;
  480. struct cdp_tx_completion_ppdu *ppdu_desc =
  481. NULL;
  482. int i;
  483. tx_tid = &peer->tx_capture.tx_tid[tid];
  484. /* spinlock hold */
  485. qdf_spin_lock_bh(&tx_tid->tid_lock);
  486. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  487. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  488. while ((ppdu_nbuf = qdf_nbuf_queue_remove(
  489. &tx_tid->pending_ppdu_q))) {
  490. ppdu_desc =
  491. (struct cdp_tx_completion_ppdu *)
  492. qdf_nbuf_data(ppdu_nbuf);
  493. if (!ppdu_desc->mpdus) {
  494. qdf_nbuf_free(ppdu_nbuf);
  495. continue;
  496. }
  497. for (i = 0; i <
  498. ppdu_desc->user[0].ba_size; i++) {
  499. if (!ppdu_desc->mpdus[i])
  500. continue;
  501. qdf_nbuf_free(
  502. ppdu_desc->mpdus[i]);
  503. }
  504. qdf_mem_free(ppdu_desc->mpdus);
  505. ppdu_desc->mpdus = NULL;
  506. qdf_nbuf_free(ppdu_nbuf);
  507. }
  508. }
  509. }
  510. }
  511. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  512. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  513. }
  514. /*
  515. * dp_config_enh_tx_capture()- API to enable/disable enhanced tx capture
  516. * @pdev_handle: DP_PDEV handle
  517. * @val: user provided value
  518. *
  519. * Return: QDF_STATUS
  520. */
  521. QDF_STATUS
  522. dp_config_enh_tx_capture(struct cdp_pdev *pdev_handle, uint8_t val)
  523. {
  524. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  525. int i, j;
  526. qdf_spin_lock(&pdev->tx_capture.config_lock);
  527. pdev->tx_capture_enabled = val;
  528. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  529. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  530. dp_soc_set_txrx_ring_map_single(pdev->soc);
  531. if (!pdev->pktlog_ppdu_stats)
  532. dp_h2t_cfg_stats_msg_send(pdev,
  533. DP_PPDU_STATS_CFG_SNIFFER,
  534. pdev->pdev_id);
  535. } else {
  536. dp_soc_set_txrx_ring_map(pdev->soc);
  537. dp_h2t_cfg_stats_msg_send(pdev,
  538. DP_PPDU_STATS_CFG_ENH_STATS,
  539. pdev->pdev_id);
  540. dp_iterate_free_peer_msdu_q(pdev);
  541. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  542. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  543. qdf_spin_lock_bh(
  544. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  545. qdf_nbuf_queue_free(
  546. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  547. qdf_spin_unlock_bh(
  548. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  549. }
  550. }
  551. }
  552. qdf_spin_unlock(&pdev->tx_capture.config_lock);
  553. return QDF_STATUS_SUCCESS;
  554. }
  555. /**
  556. * get_number_of_1s(): Function to get number of 1s
  557. * @value: value to find
  558. *
  559. * return: number of 1s
  560. */
  561. static
  562. inline uint32_t get_number_of_1s(uint32_t value)
  563. {
  564. uint32_t shift[] = {1, 2, 4, 8, 16};
  565. uint32_t magic_number[] = { 0x55555555, 0x33333333, 0x0F0F0F0F,
  566. 0x00FF00FF, 0x0000FFFF};
  567. uint8_t k = 0;
  568. for (; k <= 4; k++) {
  569. value = (value & magic_number[k]) +
  570. ((value >> shift[k]) & magic_number[k]);
  571. }
  572. return value;
  573. }
  574. /**
  575. * dp_tx_print_bitmap(): Function to print bitmap
  576. * @pdev: dp_pdev
  577. * @ppdu_desc: ppdu completion descriptor
  578. * @user_inder: user index
  579. * @ppdu_id: ppdu id
  580. *
  581. * return: status
  582. */
  583. static
  584. QDF_STATUS dp_tx_print_bitmap(struct dp_pdev *pdev,
  585. struct cdp_tx_completion_ppdu *ppdu_desc,
  586. uint32_t user_index,
  587. uint32_t ppdu_id)
  588. {
  589. struct cdp_tx_completion_ppdu_user *user;
  590. uint8_t i;
  591. uint32_t mpdu_tried;
  592. uint32_t ba_seq_no;
  593. uint32_t start_seq;
  594. uint32_t num_mpdu;
  595. uint32_t fail_num_mpdu = 0;
  596. user = &ppdu_desc->user[user_index];
  597. /* get number of mpdu from ppdu_desc */
  598. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  599. ba_seq_no = user->ba_seq_no;
  600. start_seq = user->start_seq;
  601. num_mpdu = user->mpdu_success;
  602. if (user->tid > DP_MAX_TIDS) {
  603. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  604. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  605. __func__, ppdu_id, user->peer_id, user->tid);
  606. return QDF_STATUS_E_FAILURE;
  607. }
  608. if (mpdu_tried != num_mpdu) {
  609. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  610. "%s: ppdu[%d] peer[%d] tid[%d] ba[%d] start[%d] mpdu_tri[%d] num_mpdu[%d] is_mcast[%d]",
  611. __func__, ppdu_id, user->peer_id, user->tid,
  612. ba_seq_no, start_seq, mpdu_tried,
  613. num_mpdu, user->is_mcast);
  614. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++) {
  615. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  616. QDF_TRACE_LEVEL_INFO,
  617. "ppdu_id[%d] ba_bitmap[0x%x] enqueue_bitmap[0x%x] failed_bitmap[0x%x]",
  618. ppdu_id, user->ba_bitmap[i],
  619. user->enq_bitmap[i],
  620. user->failed_bitmap[i]);
  621. fail_num_mpdu +=
  622. get_number_of_1s(user->failed_bitmap[i]);
  623. }
  624. }
  625. if (fail_num_mpdu == num_mpdu && num_mpdu)
  626. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  627. "%s: %d ppdu_id[%d] num_mpdu[%d, %d]",
  628. __func__, __LINE__, ppdu_id, num_mpdu, fail_num_mpdu);
  629. return QDF_STATUS_SUCCESS;
  630. }
  631. static uint32_t dp_tx_update_80211_hdr(struct dp_pdev *pdev,
  632. struct dp_peer *peer,
  633. void *data,
  634. qdf_nbuf_t nbuf,
  635. uint16_t ether_type,
  636. uint8_t *src_addr)
  637. {
  638. struct cdp_tx_completion_ppdu *ppdu_desc;
  639. struct ieee80211_frame *ptr_wh;
  640. struct ieee80211_qoscntl *ptr_qoscntl;
  641. uint32_t mpdu_buf_len;
  642. uint8_t *ptr_hdr;
  643. uint16_t eth_type = qdf_htons(ether_type);
  644. ppdu_desc = (struct cdp_tx_completion_ppdu *)data;
  645. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  646. ptr_qoscntl = &peer->tx_capture.tx_qoscntl;
  647. /*
  648. * update framectrl only for first ppdu_id
  649. * rest of mpdu will have same frame ctrl
  650. * mac address and duration
  651. */
  652. if (ppdu_desc->ppdu_id != peer->tx_capture.tx_wifi_ppdu_id) {
  653. ptr_wh->i_fc[1] = (ppdu_desc->frame_ctrl & 0xFF00) >> 8;
  654. ptr_wh->i_fc[0] = (ppdu_desc->frame_ctrl & 0xFF);
  655. ptr_wh->i_dur[1] = (ppdu_desc->tx_duration & 0xFF00) >> 8;
  656. ptr_wh->i_dur[0] = (ppdu_desc->tx_duration & 0xFF);
  657. ptr_qoscntl->i_qos[1] = (ppdu_desc->user[0].qos_ctrl &
  658. 0xFF00) >> 8;
  659. ptr_qoscntl->i_qos[0] = (ppdu_desc->user[0].qos_ctrl & 0xFF);
  660. /* Update Addr 3 (SA) with SA derived from ether packet */
  661. qdf_mem_copy(ptr_wh->i_addr3, src_addr, QDF_MAC_ADDR_SIZE);
  662. peer->tx_capture.tx_wifi_ppdu_id = ppdu_desc->ppdu_id;
  663. }
  664. mpdu_buf_len = sizeof(struct ieee80211_frame) + LLC_SNAP_HDR_LEN;
  665. if (qdf_likely(ppdu_desc->user[0].tid != DP_NON_QOS_TID))
  666. mpdu_buf_len += sizeof(struct ieee80211_qoscntl);
  667. nbuf->protocol = qdf_htons(ETH_P_802_2);
  668. /* update ieee80211_frame header */
  669. if (!qdf_nbuf_push_head(nbuf, mpdu_buf_len)) {
  670. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  671. FL("No headroom"));
  672. return QDF_STATUS_E_NOMEM;
  673. }
  674. ptr_hdr = (void *)qdf_nbuf_data(nbuf);
  675. qdf_mem_copy(ptr_hdr, ptr_wh, sizeof(struct ieee80211_frame));
  676. ptr_hdr = ptr_hdr + (sizeof(struct ieee80211_frame));
  677. /* update qoscntl header */
  678. if (qdf_likely(ppdu_desc->user[0].tid != DP_NON_QOS_TID)) {
  679. qdf_mem_copy(ptr_hdr, ptr_qoscntl,
  680. sizeof(struct ieee80211_qoscntl));
  681. ptr_hdr = ptr_hdr + sizeof(struct ieee80211_qoscntl);
  682. }
  683. /* update LLC */
  684. *ptr_hdr = LLC_SNAP_LSAP;
  685. *(ptr_hdr + 1) = LLC_SNAP_LSAP;
  686. *(ptr_hdr + 2) = LLC_UI;
  687. *(ptr_hdr + 3) = 0x00;
  688. *(ptr_hdr + 4) = 0x00;
  689. *(ptr_hdr + 5) = 0x00;
  690. *(ptr_hdr + 6) = (eth_type & 0xFF00) >> 8;
  691. *(ptr_hdr + 7) = (eth_type & 0xFF);
  692. qdf_nbuf_trim_tail(nbuf, qdf_nbuf_len(nbuf) - mpdu_buf_len);
  693. return 0;
  694. }
  695. /**
  696. * dp_tx_mon_restitch_mpdu(): Function to restitch msdu to mpdu
  697. * @pdev: dp_pdev
  698. * @peer: dp_peer
  699. * @head_msdu: head msdu queue
  700. *
  701. * return: status
  702. */
  703. static uint32_t
  704. dp_tx_mon_restitch_mpdu(struct dp_pdev *pdev, struct dp_peer *peer,
  705. struct cdp_tx_completion_ppdu *ppdu_desc,
  706. qdf_nbuf_queue_t *head_msdu,
  707. qdf_nbuf_queue_t *mpdu_q)
  708. {
  709. qdf_nbuf_t curr_nbuf = NULL;
  710. qdf_nbuf_t first_nbuf = NULL;
  711. qdf_nbuf_t prev_nbuf = NULL;
  712. qdf_nbuf_t mpdu_nbuf = NULL;
  713. struct msdu_completion_info *ptr_msdu_info = NULL;
  714. uint8_t first_msdu = 0;
  715. uint8_t last_msdu = 0;
  716. uint32_t frag_list_sum_len = 0;
  717. uint8_t first_msdu_not_seen = 1;
  718. uint16_t ether_type = 0;
  719. qdf_ether_header_t *eh = NULL;
  720. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  721. while (curr_nbuf) {
  722. ptr_msdu_info =
  723. (struct msdu_completion_info *)qdf_nbuf_data(curr_nbuf);
  724. first_msdu = ptr_msdu_info->first_msdu;
  725. last_msdu = ptr_msdu_info->last_msdu;
  726. eh = (qdf_ether_header_t *)(curr_nbuf->data +
  727. sizeof(struct msdu_completion_info));
  728. ether_type = eh->ether_type;
  729. /* pull msdu_completion_info added in pre header */
  730. qdf_nbuf_pull_head(curr_nbuf,
  731. sizeof(struct msdu_completion_info));
  732. if (first_msdu && first_msdu_not_seen) {
  733. first_nbuf = curr_nbuf;
  734. frag_list_sum_len = 0;
  735. first_msdu_not_seen = 0;
  736. /* pull ethernet header from first MSDU alone */
  737. qdf_nbuf_pull_head(curr_nbuf,
  738. sizeof(qdf_ether_header_t));
  739. mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  740. MAX_MONITOR_HEADER,
  741. MAX_MONITOR_HEADER,
  742. 4, FALSE);
  743. if (!mpdu_nbuf) {
  744. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  745. QDF_TRACE_LEVEL_FATAL,
  746. "MPDU head allocation failed !!!");
  747. goto free_ppdu_desc_mpdu_q;
  748. }
  749. dp_tx_update_80211_hdr(pdev, peer,
  750. ppdu_desc, mpdu_nbuf,
  751. ether_type, eh->ether_shost);
  752. /* update first buffer to previous buffer */
  753. prev_nbuf = curr_nbuf;
  754. } else if (first_msdu && !first_msdu_not_seen) {
  755. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  756. QDF_TRACE_LEVEL_FATAL,
  757. "!!!!! NO LAST MSDU\n");
  758. /*
  759. * no last msdu in a mpdu
  760. * handle this case
  761. */
  762. qdf_nbuf_free(curr_nbuf);
  763. /*
  764. * No last msdu found because WBM comes out
  765. * of order, free the pkt
  766. */
  767. goto free_ppdu_desc_mpdu_q;
  768. } else if (!first_msdu && first_msdu_not_seen) {
  769. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  770. QDF_TRACE_LEVEL_FATAL,
  771. "!!!!! NO FIRST MSDU\n");
  772. /*
  773. * no first msdu in a mpdu
  774. * handle this case
  775. */
  776. qdf_nbuf_free(curr_nbuf);
  777. /*
  778. * no first msdu found beacuse WBM comes out
  779. * of order, free the pkt
  780. */
  781. goto free_ppdu_desc_mpdu_q;
  782. } else {
  783. /* update current buffer to previous buffer next */
  784. prev_nbuf->next = curr_nbuf;
  785. /* move the previous buffer to next buffer */
  786. prev_nbuf = prev_nbuf->next;
  787. }
  788. frag_list_sum_len += qdf_nbuf_len(curr_nbuf);
  789. if (last_msdu) {
  790. /*
  791. * first nbuf will hold list of msdu
  792. * stored in prev_nbuf
  793. */
  794. qdf_nbuf_append_ext_list(mpdu_nbuf,
  795. first_nbuf,
  796. frag_list_sum_len);
  797. /* add mpdu to mpdu queue */
  798. qdf_nbuf_queue_add(mpdu_q, mpdu_nbuf);
  799. first_nbuf = NULL;
  800. mpdu_nbuf = NULL;
  801. /* next msdu will start with first msdu */
  802. first_msdu_not_seen = 1;
  803. goto check_for_next_msdu;
  804. }
  805. /* get next msdu from the head_msdu */
  806. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  807. if (!curr_nbuf) {
  808. /* msdu missed in list */
  809. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  810. QDF_TRACE_LEVEL_FATAL,
  811. "!!!! WAITING for msdu but list empty !!!!");
  812. }
  813. continue;
  814. check_for_next_msdu:
  815. if (qdf_nbuf_is_queue_empty(head_msdu))
  816. return 0;
  817. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  818. }
  819. return 0;
  820. free_ppdu_desc_mpdu_q:
  821. /* free already chained msdu pkt */
  822. while (first_nbuf) {
  823. curr_nbuf = first_nbuf;
  824. first_nbuf = first_nbuf->next;
  825. qdf_nbuf_free(curr_nbuf);
  826. }
  827. /* free allocated mpdu hdr */
  828. if (mpdu_nbuf)
  829. qdf_nbuf_free(mpdu_nbuf);
  830. /* free queued remaining msdu pkt per ppdu */
  831. qdf_nbuf_queue_free(head_msdu);
  832. /* free queued mpdu per ppdu */
  833. qdf_nbuf_queue_free(mpdu_q);
  834. return 0;
  835. }
  836. /**
  837. * dp_tx_msdu_dequeue(): Function to dequeue msdu from peer based tid
  838. * @peer: dp_peer
  839. * @ppdu_id: ppdu_id
  840. * @tid: tid
  841. * @num_msdu: number of msdu
  842. * @head: head queue
  843. * @start_tsf: start tsf from ppdu_desc
  844. * @end_tsf: end tsf from ppdu_desc
  845. *
  846. * return: status
  847. */
  848. static
  849. uint32_t dp_tx_msdu_dequeue(struct dp_peer *peer, uint32_t ppdu_id,
  850. uint16_t tid, uint32_t num_msdu,
  851. qdf_nbuf_queue_t *head,
  852. qdf_nbuf_queue_t *head_xretries,
  853. uint32_t start_tsf, uint32_t end_tsf)
  854. {
  855. struct dp_tx_tid *tx_tid = NULL;
  856. uint32_t msdu_ppdu_id;
  857. qdf_nbuf_t curr_msdu = NULL;
  858. qdf_nbuf_t prev_msdu = NULL;
  859. struct msdu_completion_info *ptr_msdu_info = NULL;
  860. uint32_t wbm_tsf;
  861. uint32_t matched = 0;
  862. if (qdf_unlikely(!peer))
  863. return 0;
  864. tx_tid = &peer->tx_capture.tx_tid[tid];
  865. if (qdf_unlikely(!tx_tid))
  866. return 0;
  867. if (qdf_nbuf_is_queue_empty(&tx_tid->msdu_comp_q))
  868. return 0;
  869. /* lock here */
  870. qdf_spin_lock_bh(&tx_tid->tid_lock);
  871. curr_msdu = qdf_nbuf_queue_first(&tx_tid->msdu_comp_q);
  872. while (curr_msdu) {
  873. if (qdf_nbuf_queue_len(head) == num_msdu) {
  874. matched = 1;
  875. break;
  876. }
  877. ptr_msdu_info =
  878. (struct msdu_completion_info *)qdf_nbuf_data(curr_msdu);
  879. msdu_ppdu_id = ptr_msdu_info->ppdu_id;
  880. wbm_tsf = ptr_msdu_info->tsf;
  881. if ((ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  882. (ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_AGED)) {
  883. /* Frames removed due to excessive retries */
  884. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  885. qdf_nbuf_queue_add(head_xretries, curr_msdu);
  886. curr_msdu = qdf_nbuf_queue_first(
  887. &tx_tid->msdu_comp_q);
  888. prev_msdu = NULL;
  889. continue;
  890. }
  891. if (wbm_tsf > end_tsf) {
  892. /* PPDU being matched is older than MSDU at head of
  893. * completion queue. Return matched=1 to skip PPDU
  894. */
  895. matched = 1;
  896. break;
  897. }
  898. if (wbm_tsf && (wbm_tsf < start_tsf)) {
  899. /* remove the aged packet */
  900. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  901. qdf_nbuf_free(curr_msdu);
  902. curr_msdu = qdf_nbuf_queue_first(
  903. &tx_tid->msdu_comp_q);
  904. prev_msdu = NULL;
  905. continue;
  906. }
  907. if (msdu_ppdu_id == ppdu_id) {
  908. if (qdf_likely(!prev_msdu)) {
  909. /* remove head */
  910. qdf_nbuf_queue_remove(&tx_tid->msdu_comp_q);
  911. /* add msdu to head queue */
  912. qdf_nbuf_queue_add(head, curr_msdu);
  913. /* get next msdu from msdu_comp_q */
  914. curr_msdu = qdf_nbuf_queue_first(
  915. &tx_tid->msdu_comp_q);
  916. continue;
  917. } else {
  918. /* update prev_msdu next to current msdu next */
  919. prev_msdu->next = curr_msdu->next;
  920. /* set current msdu next as NULL */
  921. curr_msdu->next = NULL;
  922. /* decrement length */
  923. ((qdf_nbuf_queue_t *)(
  924. &tx_tid->msdu_comp_q))->qlen--;
  925. /* add msdu to head queue */
  926. qdf_nbuf_queue_add(head, curr_msdu);
  927. /* set previous msdu to current msdu */
  928. curr_msdu = prev_msdu->next;
  929. continue;
  930. }
  931. }
  932. prev_msdu = curr_msdu;
  933. curr_msdu = prev_msdu->next;
  934. }
  935. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  936. return matched;
  937. }
  938. /**
  939. * get_mpdu_clone_from_next_ppdu(): Function to clone missing mpdu from
  940. * next ppdu
  941. * @nbuf_ppdu_desc_list: nbuf list
  942. * @ppdu_desc_cnt: ppdu_desc_cnt
  943. * @missed_seq_no:
  944. * @ppdu_id: ppdu_id
  945. * @mpdu_info: cdp_tx_indication_mpdu_info
  946. *
  947. * return: void
  948. */
  949. static
  950. qdf_nbuf_t get_mpdu_clone_from_next_ppdu(qdf_nbuf_t nbuf_ppdu_desc_list[],
  951. uint32_t ppdu_desc_cnt,
  952. uint16_t missed_seq_no,
  953. uint16_t peer_id, uint32_t ppdu_id)
  954. {
  955. uint32_t i = 0;
  956. uint32_t found = 0;
  957. uint32_t seq_no = 0;
  958. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  959. qdf_nbuf_t mpdu = NULL;
  960. for (i = 1; i < ppdu_desc_cnt; i++) {
  961. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  962. qdf_nbuf_data(nbuf_ppdu_desc_list[i]);
  963. /* check if seq number is between the range */
  964. if ((peer_id == ppdu_desc->user[0].peer_id) &&
  965. ((missed_seq_no >= ppdu_desc->user[0].start_seq) &&
  966. (missed_seq_no <= ppdu_desc->user[0].last_enq_seq))) {
  967. seq_no = ppdu_desc->user[0].start_seq;
  968. if (SEQ_BIT(ppdu_desc->user[0].failed_bitmap,
  969. (missed_seq_no - seq_no))) {
  970. found = 1;
  971. break;
  972. }
  973. }
  974. }
  975. if (found == 0) {
  976. /* mpdu not found in sched cmd id */
  977. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  978. "%s: missed seq_no[%d] ppdu_id[%d] [%d] not found!!!",
  979. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  980. return NULL;
  981. }
  982. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  983. "%s: seq_no[%d] missed ppdu_id[%d] m[%d] found in ppdu_id[%d]!!",
  984. __func__,
  985. missed_seq_no, ppdu_id,
  986. (missed_seq_no - seq_no), ppdu_desc->ppdu_id);
  987. mpdu = qdf_nbuf_queue_first(&ppdu_desc->mpdu_q);
  988. if (!mpdu) {
  989. /* bitmap shows it found sequence number, but
  990. * MPDU not found in PPDU
  991. */
  992. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  993. "%s: missed seq_no[%d] ppdu_id[%d] [%d] found but queue empty!!!",
  994. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  995. return NULL;
  996. }
  997. for (i = 0; i < (missed_seq_no - seq_no); i++) {
  998. mpdu = mpdu->next;
  999. if (!mpdu) {
  1000. /*
  1001. * bitmap shows it found sequence number,
  1002. * but queue empty, do we need to allocate
  1003. * skb and send instead of NULL ?
  1004. * add counter here:
  1005. */
  1006. return NULL;
  1007. }
  1008. }
  1009. return qdf_nbuf_copy_expand(mpdu, MAX_MONITOR_HEADER, 0);
  1010. }
  1011. /**
  1012. * dp_tx_update_user_mpdu_info(): Function to update mpdu info
  1013. * from ppdu_desc
  1014. * @ppdu_id: ppdu_id
  1015. * @mpdu_info: cdp_tx_indication_mpdu_info
  1016. * @user: cdp_tx_completion_ppdu_user
  1017. *
  1018. * return: void
  1019. */
  1020. static void
  1021. dp_tx_update_user_mpdu_info(uint32_t ppdu_id,
  1022. struct cdp_tx_indication_mpdu_info *mpdu_info,
  1023. struct cdp_tx_completion_ppdu_user *user)
  1024. {
  1025. mpdu_info->ppdu_id = ppdu_id;
  1026. mpdu_info->frame_ctrl = user->frame_ctrl;
  1027. mpdu_info->qos_ctrl = user->qos_ctrl;
  1028. mpdu_info->tid = user->tid;
  1029. mpdu_info->ltf_size = user->ltf_size;
  1030. mpdu_info->he_re = user->he_re;
  1031. mpdu_info->txbf = user->txbf;
  1032. mpdu_info->bw = user->bw;
  1033. mpdu_info->nss = user->nss;
  1034. mpdu_info->mcs = user->mcs;
  1035. mpdu_info->preamble = user->preamble;
  1036. mpdu_info->gi = user->gi;
  1037. mpdu_info->ack_rssi = user->ack_rssi[0];
  1038. mpdu_info->tx_rate = user->tx_rate;
  1039. mpdu_info->ldpc = user->ldpc;
  1040. mpdu_info->ppdu_cookie = user->ppdu_cookie;
  1041. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, 6);
  1042. mpdu_info->ba_start_seq = user->ba_seq_no;
  1043. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  1044. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  1045. }
  1046. static inline
  1047. void dp_tx_update_sequence_number(qdf_nbuf_t nbuf, uint32_t seq_no)
  1048. {
  1049. struct ieee80211_frame *ptr_wh = NULL;
  1050. uint16_t wh_seq = 0;
  1051. if (!nbuf)
  1052. return;
  1053. /* update sequence number in frame header */
  1054. ptr_wh = (struct ieee80211_frame *)qdf_nbuf_data(nbuf);
  1055. wh_seq = (seq_no & 0xFFF) << 4;
  1056. qdf_mem_copy(ptr_wh->i_seq, &wh_seq, sizeof(uint16_t));
  1057. }
  1058. /**
  1059. * dp_send_mpdu_info_to_stack(): Function to deliver mpdu info to stack
  1060. * to upper layer
  1061. * @pdev: DP pdev handle
  1062. * @nbuf_ppdu_desc_list: ppdu_desc_list per sched cmd id
  1063. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  1064. *
  1065. * return: status
  1066. */
  1067. static
  1068. void dp_send_mpdu_info_to_stack(struct dp_pdev *pdev,
  1069. struct cdp_tx_completion_ppdu
  1070. *ppdu_desc)
  1071. {
  1072. struct cdp_tx_indication_info tx_capture_info;
  1073. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1074. int i;
  1075. uint32_t seq_no, start_seq;
  1076. uint32_t ppdu_id = ppdu_desc->ppdu_id;
  1077. qdf_mem_set(&tx_capture_info,
  1078. sizeof(struct cdp_tx_indication_info),
  1079. 0);
  1080. mpdu_info = &tx_capture_info.mpdu_info;
  1081. mpdu_info->channel = ppdu_desc->channel;
  1082. mpdu_info->frame_type = ppdu_desc->frame_type;
  1083. mpdu_info->ppdu_start_timestamp =
  1084. ppdu_desc->ppdu_start_timestamp;
  1085. mpdu_info->ppdu_end_timestamp =
  1086. ppdu_desc->ppdu_end_timestamp;
  1087. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1088. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  1089. /* update cdp_tx_indication_mpdu_info */
  1090. dp_tx_update_user_mpdu_info(ppdu_id,
  1091. &tx_capture_info.mpdu_info,
  1092. &ppdu_desc->user[0]);
  1093. tx_capture_info.mpdu_info.channel_num =
  1094. pdev->operating_channel;
  1095. start_seq = ppdu_desc->user[0].start_seq;
  1096. for (i = 0; i < ppdu_desc->user[0].ba_size; i++) {
  1097. if (qdf_likely(ppdu_desc->user[0].tid !=
  1098. DP_NON_QOS_TID) &&
  1099. !(SEQ_BIT(ppdu_desc->user[0].enq_bitmap, i))) {
  1100. continue;
  1101. }
  1102. seq_no = start_seq + i;
  1103. if (!ppdu_desc->mpdus[i])
  1104. continue;
  1105. tx_capture_info.mpdu_nbuf = ppdu_desc->mpdus[i];
  1106. ppdu_desc->mpdus[i] = NULL;
  1107. mpdu_info->seq_no = seq_no;
  1108. dp_tx_update_sequence_number(tx_capture_info.mpdu_nbuf, seq_no);
  1109. /*
  1110. * send MPDU to osif layer
  1111. * do we need to update mpdu_info before tranmit
  1112. * get current mpdu_nbuf
  1113. */
  1114. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1115. &tx_capture_info,
  1116. HTT_INVALID_PEER,
  1117. WDI_NO_VAL, pdev->pdev_id);
  1118. if (tx_capture_info.mpdu_nbuf)
  1119. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1120. }
  1121. }
  1122. static void
  1123. dp_tx_mon_proc_xretries(struct dp_pdev *pdev, struct dp_peer *peer,
  1124. uint16_t tid)
  1125. {
  1126. struct dp_tx_tid *tx_tid = &peer->tx_capture.tx_tid[tid];
  1127. struct cdp_tx_completion_ppdu *ppdu_desc;
  1128. struct cdp_tx_completion_ppdu *xretry_ppdu;
  1129. qdf_nbuf_t ppdu_nbuf;
  1130. qdf_nbuf_t mpdu_nbuf;
  1131. uint32_t mpdu_tried = 0;
  1132. int i;
  1133. uint32_t seq_no;
  1134. xretry_ppdu = &tx_tid->xretry_ppdu;
  1135. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  1136. qdf_nbuf_queue_free(&xretry_ppdu->mpdu_q);
  1137. return;
  1138. }
  1139. if (qdf_nbuf_is_queue_empty(&xretry_ppdu->mpdu_q))
  1140. return;
  1141. ppdu_nbuf = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  1142. while (ppdu_nbuf) {
  1143. struct msdu_completion_info *ptr_msdu_info = NULL;
  1144. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1145. qdf_nbuf_data(ppdu_nbuf);
  1146. if (ppdu_desc->pending_retries) {
  1147. uint32_t start_seq = ppdu_desc->user[0].start_seq;
  1148. mpdu_tried = ppdu_desc->user[0].mpdu_tried_ucast +
  1149. ppdu_desc->user[0].mpdu_tried_mcast;
  1150. mpdu_nbuf = qdf_nbuf_queue_first(&xretry_ppdu->mpdu_q);
  1151. for (i = 0; (mpdu_tried > 0) && mpdu_nbuf; i++) {
  1152. if (!(SEQ_BIT(ppdu_desc->user[0].enq_bitmap,
  1153. i)))
  1154. continue;
  1155. mpdu_tried--;
  1156. /* missed seq number */
  1157. seq_no = start_seq + i;
  1158. if (SEQ_BIT(ppdu_desc->user[0].failed_bitmap, i))
  1159. continue;
  1160. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1161. QDF_TRACE_LEVEL_INFO,
  1162. "%s: fill seqno %d from xretries",
  1163. __func__, seq_no);
  1164. ptr_msdu_info = (struct msdu_completion_info *)
  1165. (qdf_nbuf_data(qdf_nbuf_get_ext_list(
  1166. mpdu_nbuf)) -
  1167. (sizeof(struct msdu_completion_info) +
  1168. sizeof(qdf_ether_header_t)));
  1169. ptr_msdu_info->transmit_cnt--;
  1170. SEQ_SEG(ppdu_desc->user[0].failed_bitmap, i) |=
  1171. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[0],
  1172. i);
  1173. ppdu_desc->pending_retries--;
  1174. if (ptr_msdu_info->transmit_cnt == 0) {
  1175. ppdu_desc->mpdus[seq_no - start_seq] =
  1176. mpdu_nbuf;
  1177. qdf_nbuf_queue_remove(
  1178. &xretry_ppdu->mpdu_q);
  1179. mpdu_nbuf = qdf_nbuf_queue_first(
  1180. &xretry_ppdu->mpdu_q);
  1181. } else {
  1182. ppdu_desc->mpdus[seq_no - start_seq] =
  1183. qdf_nbuf_copy_expand(mpdu_nbuf,
  1184. MAX_MONITOR_HEADER,
  1185. 0);
  1186. mpdu_nbuf =
  1187. qdf_nbuf_queue_next(mpdu_nbuf);
  1188. }
  1189. }
  1190. }
  1191. if ((ppdu_desc->pending_retries == 0) && (ppdu_nbuf ==
  1192. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q))) {
  1193. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  1194. /* Deliver PPDU */
  1195. dp_send_mpdu_info_to_stack(pdev, ppdu_desc);
  1196. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1197. qdf_mem_free(ppdu_desc->mpdus);
  1198. ppdu_desc->mpdus = NULL;
  1199. qdf_nbuf_free(ppdu_nbuf);
  1200. ppdu_nbuf = qdf_nbuf_queue_first(
  1201. &tx_tid->pending_ppdu_q);
  1202. } else {
  1203. ppdu_nbuf = qdf_nbuf_queue_next(ppdu_nbuf);
  1204. }
  1205. }
  1206. qdf_nbuf_queue_free(&xretry_ppdu->mpdu_q);
  1207. }
  1208. #define MAX_PENDING_PPDUS 32
  1209. static void
  1210. dp_tx_mon_proc_pending_ppdus(struct dp_pdev *pdev, struct dp_tx_tid *tx_tid,
  1211. qdf_nbuf_t nbuf_ppdu_desc_list[], uint32_t
  1212. ppdu_desc_cnt, qdf_nbuf_queue_t *head_ppdu,
  1213. uint32_t peer_id)
  1214. {
  1215. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1216. struct cdp_tx_completion_ppdu *cur_ppdu_desc = NULL;
  1217. qdf_nbuf_t pend_ppdu;
  1218. uint32_t ppdu_cnt;
  1219. uint32_t failed_seq;
  1220. uint32_t cur_index, cur_start_seq, cur_last_seq;
  1221. int i, k;
  1222. bool last_pend_ppdu = false;
  1223. qdf_nbuf_t tmp_nbuf;
  1224. pend_ppdu = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  1225. if (!pend_ppdu) {
  1226. for (ppdu_cnt = 0; ppdu_cnt < ppdu_desc_cnt; ppdu_cnt++) {
  1227. if (!nbuf_ppdu_desc_list[ppdu_cnt])
  1228. continue;
  1229. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1230. qdf_nbuf_data(
  1231. nbuf_ppdu_desc_list[ppdu_cnt]);
  1232. if (!ppdu_desc || (peer_id !=
  1233. ppdu_desc->user[0].peer_id) || (tx_tid->tid !=
  1234. ppdu_desc->user[0].tid))
  1235. continue;
  1236. if ((ppdu_desc->pending_retries == 0) &&
  1237. qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q) &&
  1238. qdf_nbuf_is_queue_empty(head_ppdu)) {
  1239. dp_send_mpdu_info_to_stack(pdev, ppdu_desc);
  1240. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1241. qdf_mem_free(ppdu_desc->mpdus);
  1242. ppdu_desc->mpdus = NULL;
  1243. tmp_nbuf = nbuf_ppdu_desc_list[ppdu_cnt];
  1244. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1245. qdf_nbuf_free(tmp_nbuf);
  1246. } else {
  1247. qdf_nbuf_queue_add(head_ppdu,
  1248. nbuf_ppdu_desc_list[ppdu_cnt]);
  1249. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1250. }
  1251. }
  1252. return;
  1253. }
  1254. while (pend_ppdu) {
  1255. qdf_nbuf_t mpdu_nbuf;
  1256. /* Find missing mpdus from current schedule list */
  1257. ppdu_cnt = 0;
  1258. if (!nbuf_ppdu_desc_list[ppdu_cnt]) {
  1259. ppdu_cnt++;
  1260. if (ppdu_cnt < ppdu_desc_cnt)
  1261. continue;
  1262. break;
  1263. }
  1264. ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  1265. pend_ppdu);
  1266. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  1267. nbuf_ppdu_desc_list[ppdu_cnt]);
  1268. if (pend_ppdu == qdf_nbuf_queue_last(
  1269. &tx_tid->pending_ppdu_q)) {
  1270. last_pend_ppdu = true;
  1271. qdf_nbuf_queue_add(head_ppdu,
  1272. nbuf_ppdu_desc_list[ppdu_cnt]);
  1273. nbuf_ppdu_desc_list[ppdu_cnt] = NULL;
  1274. }
  1275. cur_index = 0;
  1276. cur_start_seq = cur_ppdu_desc->user[0].start_seq;
  1277. cur_last_seq = cur_ppdu_desc->user[0].last_enq_seq;
  1278. if (qdf_unlikely(ppdu_desc->user[0].ba_size >
  1279. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  1280. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))) {
  1281. qdf_assert_always(0);
  1282. return;
  1283. }
  1284. for (i = 0; (i < ppdu_desc->user[0].ba_size) && cur_ppdu_desc;
  1285. i++) {
  1286. if (!(i & (SEQ_SEG_SZ_BITS(
  1287. ppdu_desc->user[0].failed_bitmap) - 1))) {
  1288. k =
  1289. SEQ_SEG_INDEX(ppdu_desc->user[0].failed_bitmap,
  1290. i);
  1291. failed_seq =
  1292. ppdu_desc->user[0].failed_bitmap[k] ^
  1293. ppdu_desc->user[0].enq_bitmap[k];
  1294. }
  1295. /* Skip to next bitmap segment if there are no
  1296. * more holes in current segment
  1297. */
  1298. if (!failed_seq) {
  1299. i = ((k + 1) *
  1300. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))
  1301. - 1;
  1302. continue;
  1303. }
  1304. if (!(SEQ_SEG_BIT(failed_seq, i)))
  1305. continue;
  1306. failed_seq ^= SEQ_SEG_MSK(failed_seq, i);
  1307. mpdu_nbuf = cur_ppdu_desc->mpdus[cur_index];
  1308. if (mpdu_nbuf) {
  1309. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1310. QDF_TRACE_LEVEL_INFO,
  1311. "%s: fill seqno %d (%d) from swretries",
  1312. __func__,
  1313. ppdu_desc->user[0].start_seq + i,
  1314. ppdu_desc->ppdu_id);
  1315. ppdu_desc->mpdus[i] =
  1316. qdf_nbuf_copy_expand(mpdu_nbuf,
  1317. MAX_MONITOR_HEADER, 0);
  1318. ppdu_desc->user[0].failed_bitmap[k] |=
  1319. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[k],
  1320. i);
  1321. ppdu_desc->pending_retries--;
  1322. }
  1323. cur_index++;
  1324. /* Skip through empty slots in current PPDU */
  1325. while (!(SEQ_BIT(cur_ppdu_desc->user[0].enq_bitmap,
  1326. cur_index))) {
  1327. struct cdp_tx_completion_ppdu *next_ppdu = NULL;
  1328. cur_index++;
  1329. if (cur_index <= (cur_last_seq -
  1330. cur_start_seq))
  1331. continue;
  1332. cur_ppdu_desc = NULL;
  1333. /* Check if subsequent PPDUs in this schedule
  1334. * has higher sequence numbers enqueued
  1335. */
  1336. while (ppdu_cnt < (ppdu_desc_cnt - 1)) {
  1337. ppdu_cnt++;
  1338. if (!nbuf_ppdu_desc_list[ppdu_cnt])
  1339. continue;
  1340. next_ppdu =
  1341. (struct cdp_tx_completion_ppdu *)
  1342. qdf_nbuf_data(
  1343. nbuf_ppdu_desc_list[
  1344. ppdu_cnt]);
  1345. if (!next_ppdu || (peer_id !=
  1346. next_ppdu->user[0].peer_id))
  1347. continue;
  1348. if (last_pend_ppdu) {
  1349. qdf_nbuf_queue_add(head_ppdu,
  1350. nbuf_ppdu_desc_list[ppdu_cnt]);
  1351. nbuf_ppdu_desc_list[ppdu_cnt] =
  1352. NULL;
  1353. }
  1354. if (next_ppdu->user[0].last_enq_seq >
  1355. cur_last_seq) {
  1356. cur_ppdu_desc = next_ppdu;
  1357. break;
  1358. }
  1359. }
  1360. if (!cur_ppdu_desc)
  1361. break;
  1362. /* Start from seq. no following cur_last_seq
  1363. * since everything before is already populated
  1364. * from previous PPDU
  1365. */
  1366. cur_start_seq =
  1367. cur_ppdu_desc->user[0].start_seq;
  1368. cur_index = (cur_last_seq >= cur_start_seq) ?
  1369. cur_last_seq - cur_start_seq + 1 : 0;
  1370. cur_last_seq =
  1371. cur_ppdu_desc->user[0].last_enq_seq;
  1372. }
  1373. }
  1374. if ((pend_ppdu ==
  1375. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q)) &&
  1376. (ppdu_desc->pending_retries == 0)) {
  1377. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  1378. dp_send_mpdu_info_to_stack(pdev, ppdu_desc);
  1379. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1380. qdf_mem_free(ppdu_desc->mpdus);
  1381. ppdu_desc->mpdus = NULL;
  1382. qdf_nbuf_free(pend_ppdu);
  1383. pend_ppdu = qdf_nbuf_queue_first(
  1384. &tx_tid->pending_ppdu_q);
  1385. } else {
  1386. pend_ppdu = qdf_nbuf_queue_next(pend_ppdu);
  1387. }
  1388. }
  1389. }
  1390. /**
  1391. * dp_check_ppdu_and_deliver(): Check PPDUs for any holes and deliver
  1392. * to upper layer if complete
  1393. * @pdev: DP pdev handle
  1394. * @nbuf_ppdu_desc_list: ppdu_desc_list per sched cmd id
  1395. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  1396. *
  1397. * return: status
  1398. */
  1399. static void
  1400. dp_check_ppdu_and_deliver(struct dp_pdev *pdev,
  1401. qdf_nbuf_t nbuf_ppdu_desc_list[],
  1402. uint32_t ppdu_desc_cnt)
  1403. {
  1404. uint32_t ppdu_id;
  1405. uint32_t desc_cnt;
  1406. qdf_nbuf_t tmp_nbuf;
  1407. struct dp_tx_tid *tx_tid = NULL;
  1408. int i;
  1409. for (desc_cnt = 0; desc_cnt < ppdu_desc_cnt; desc_cnt++) {
  1410. struct cdp_tx_completion_ppdu *ppdu_desc;
  1411. uint32_t num_mpdu;
  1412. uint16_t start_seq, seq_no = 0;
  1413. int i;
  1414. uint32_t len;
  1415. qdf_nbuf_t mpdu_nbuf;
  1416. struct dp_peer *peer;
  1417. if (!nbuf_ppdu_desc_list[desc_cnt])
  1418. continue;
  1419. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1420. qdf_nbuf_data(nbuf_ppdu_desc_list[desc_cnt]);
  1421. ppdu_id = ppdu_desc->ppdu_id;
  1422. if (ppdu_desc->frame_type == CDP_PPDU_FTYPE_CTRL ||
  1423. ppdu_desc->htt_frame_type ==
  1424. HTT_STATS_FTYPE_SGEN_QOS_NULL) {
  1425. struct cdp_tx_indication_info tx_capture_info;
  1426. struct cdp_tx_indication_mpdu_info *mpdu_info;
  1427. qdf_nbuf_t mgmt_ctl_nbuf;
  1428. uint8_t type, subtype;
  1429. qdf_mem_set(&tx_capture_info,
  1430. sizeof(struct cdp_tx_indication_info),
  1431. 0);
  1432. mpdu_info = &tx_capture_info.mpdu_info;
  1433. mpdu_info->channel = ppdu_desc->channel;
  1434. mpdu_info->frame_type = ppdu_desc->frame_type;
  1435. mpdu_info->ppdu_start_timestamp =
  1436. ppdu_desc->ppdu_start_timestamp;
  1437. mpdu_info->ppdu_end_timestamp =
  1438. ppdu_desc->ppdu_end_timestamp;
  1439. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  1440. mpdu_info->seq_no = seq_no;
  1441. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  1442. /* update cdp_tx_indication_mpdu_info */
  1443. dp_tx_update_user_mpdu_info(ppdu_id,
  1444. &tx_capture_info.mpdu_info,
  1445. &ppdu_desc->user[0]);
  1446. tx_capture_info.mpdu_info.channel_num =
  1447. pdev->operating_channel;
  1448. type = (ppdu_desc->frame_ctrl &
  1449. IEEE80211_FC0_TYPE_MASK) >>
  1450. IEEE80211_FC0_TYPE_SHIFT;
  1451. subtype = (ppdu_desc->frame_ctrl &
  1452. IEEE80211_FC0_SUBTYPE_MASK) >>
  1453. IEEE80211_FC0_SUBTYPE_SHIFT;
  1454. qdf_spin_lock_bh(
  1455. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1456. mgmt_ctl_nbuf = qdf_nbuf_queue_remove(
  1457. &pdev->tx_capture.ctl_mgmt_q[type][subtype]);
  1458. qdf_spin_unlock_bh(
  1459. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  1460. if (mgmt_ctl_nbuf) {
  1461. struct ieee80211_frame *wh;
  1462. uint16_t duration_le, seq_le;
  1463. tx_capture_info.mpdu_nbuf =
  1464. qdf_nbuf_alloc(pdev->soc->osdev,
  1465. MAX_MONITOR_HEADER, MAX_MONITOR_HEADER,
  1466. 4, FALSE);
  1467. if (!tx_capture_info.mpdu_nbuf) {
  1468. qdf_nbuf_free(mgmt_ctl_nbuf);
  1469. goto free_ppdu_desc;
  1470. }
  1471. /* pull ppdu_id from the packet */
  1472. tx_capture_info.mpdu_info.ppdu_id =
  1473. *(uint32_t *)qdf_nbuf_data(mgmt_ctl_nbuf);
  1474. qdf_nbuf_pull_head(mgmt_ctl_nbuf, sizeof(uint32_t));
  1475. wh = (struct ieee80211_frame *)qdf_nbuf_data(mgmt_ctl_nbuf);
  1476. if (subtype != IEEE80211_FC0_SUBTYPE_BEACON) {
  1477. duration_le = qdf_cpu_to_le16(
  1478. ppdu_desc->tx_duration);
  1479. wh->i_dur[1] =
  1480. (duration_le & 0xFF00) >> 8;
  1481. wh->i_dur[0] = duration_le & 0xFF;
  1482. seq_le = qdf_cpu_to_le16(
  1483. ppdu_desc->user[0].start_seq <<
  1484. IEEE80211_SEQ_SEQ_SHIFT);
  1485. wh->i_seq[1] = (seq_le & 0xFF00) >> 8;
  1486. wh->i_seq[0] = seq_le & 0xFF;
  1487. }
  1488. qdf_nbuf_append_ext_list(
  1489. tx_capture_info.mpdu_nbuf,
  1490. mgmt_ctl_nbuf,
  1491. qdf_nbuf_len(mgmt_ctl_nbuf));
  1492. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1493. QDF_TRACE_LEVEL_DEBUG,
  1494. "ctrl/mgmt frm(0x%08x): fc 0x%x 0x%x\n",
  1495. tx_capture_info.mpdu_info.ppdu_id,
  1496. wh->i_fc[1], wh->i_fc[0]);
  1497. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1498. QDF_TRACE_LEVEL_DEBUG,
  1499. "desc->ppdu_id 0x%08x\n", ppdu_id);
  1500. } else if ((ppdu_desc->frame_ctrl &
  1501. IEEE80211_FC0_TYPE_MASK) ==
  1502. IEEE80211_FC0_TYPE_CTL) {
  1503. struct ieee80211_frame_min_one *wh_min;
  1504. uint16_t frame_ctrl_le, duration_le;
  1505. tx_capture_info.mpdu_nbuf =
  1506. qdf_nbuf_alloc(pdev->soc->osdev,
  1507. MAX_MONITOR_HEADER + MAX_DUMMY_FRM_BODY,
  1508. MAX_MONITOR_HEADER,
  1509. 4, FALSE);
  1510. if (!tx_capture_info.mpdu_nbuf)
  1511. goto free_ppdu_desc;
  1512. wh_min = (struct ieee80211_frame_min_one *)
  1513. qdf_nbuf_data(
  1514. tx_capture_info.mpdu_nbuf);
  1515. qdf_mem_zero(wh_min, MAX_DUMMY_FRM_BODY);
  1516. frame_ctrl_le =
  1517. qdf_cpu_to_le16(ppdu_desc->frame_ctrl);
  1518. duration_le =
  1519. qdf_cpu_to_le16(ppdu_desc->tx_duration);
  1520. wh_min->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  1521. wh_min->i_fc[0] = (frame_ctrl_le & 0xFF);
  1522. wh_min->i_dur[1] = (duration_le & 0xFF00) >> 8;
  1523. wh_min->i_dur[0] = (duration_le & 0xFF);
  1524. qdf_mem_copy(wh_min->i_addr1,
  1525. mpdu_info->mac_address,
  1526. QDF_MAC_ADDR_SIZE);
  1527. qdf_nbuf_set_pktlen(tx_capture_info.mpdu_nbuf,
  1528. sizeof(*wh_min));
  1529. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1530. QDF_TRACE_LEVEL_DEBUG,
  1531. "frm(0x%08x): fc %x %x, dur 0x%x%x\n",
  1532. ppdu_id, wh_min->i_fc[1], wh_min->i_fc[0],
  1533. wh_min->i_dur[1], wh_min->i_dur[0]);
  1534. }
  1535. /*
  1536. * send MPDU to osif layer
  1537. */
  1538. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  1539. &tx_capture_info, HTT_INVALID_PEER,
  1540. WDI_NO_VAL, pdev->pdev_id);
  1541. if (tx_capture_info.mpdu_nbuf)
  1542. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  1543. free_ppdu_desc:
  1544. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1545. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1546. qdf_nbuf_free(tmp_nbuf);
  1547. continue;
  1548. }
  1549. if (qdf_nbuf_is_queue_empty(&ppdu_desc->mpdu_q)) {
  1550. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1551. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1552. qdf_nbuf_free(tmp_nbuf);
  1553. continue;
  1554. }
  1555. peer = dp_peer_find_by_id(pdev->soc,
  1556. ppdu_desc->user[0].peer_id);
  1557. if (!peer) {
  1558. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1559. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1560. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1561. qdf_nbuf_free(tmp_nbuf);
  1562. continue;
  1563. }
  1564. tx_tid = &peer->tx_capture.tx_tid[ppdu_desc->user[0].tid];
  1565. ppdu_id = ppdu_desc->ppdu_id;
  1566. /* find mpdu tried is same as success mpdu */
  1567. num_mpdu = ppdu_desc->user[0].mpdu_success;
  1568. /* get length */
  1569. len = qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  1570. /* ba_size is updated in BA bitmap TLVs, which are not received
  1571. * in case of non-QoS TID.
  1572. */
  1573. if (qdf_unlikely(ppdu_desc->user[0].tid == DP_NON_QOS_TID)) {
  1574. ppdu_desc->user[0].ba_size = 1;
  1575. ppdu_desc->user[0].last_enq_seq =
  1576. ppdu_desc->user[0].start_seq;
  1577. }
  1578. /* find list of missing sequence */
  1579. ppdu_desc->mpdus = qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  1580. ppdu_desc->user[0].ba_size);
  1581. if (qdf_unlikely(!ppdu_desc->mpdus)) {
  1582. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1583. QDF_TRACE_LEVEL_FATAL,
  1584. "%s: ppdu_desc->mpdus allocation failed",
  1585. __func__);
  1586. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1587. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1588. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1589. qdf_nbuf_free(tmp_nbuf);
  1590. continue;
  1591. }
  1592. if (qdf_unlikely(ppdu_desc->user[0].ba_size >
  1593. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  1594. SEQ_SEG_SZ_BITS(ppdu_desc->user[0].failed_bitmap))) {
  1595. qdf_assert_always(0);
  1596. return;
  1597. }
  1598. /* Fill seq holes within current schedule list */
  1599. start_seq = ppdu_desc->user[0].start_seq;
  1600. for (i = 0; i < ppdu_desc->user[0].ba_size; i++) {
  1601. if (qdf_likely(ppdu_desc->user[0].tid !=
  1602. DP_NON_QOS_TID) &&
  1603. !(SEQ_BIT(ppdu_desc->user[0].enq_bitmap, i)))
  1604. continue;
  1605. /* missed seq number */
  1606. seq_no = start_seq + i;
  1607. /* Fill failed MPDUs in AMPDU if they're available in
  1608. * subsequent PPDUs in current burst schedule. This
  1609. * is not applicable for non-QoS TIDs (no AMPDUs)
  1610. */
  1611. if (qdf_likely(ppdu_desc->user[0].tid !=
  1612. DP_NON_QOS_TID) &&
  1613. !(SEQ_BIT(ppdu_desc->user[0].failed_bitmap, i))) {
  1614. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1615. QDF_TRACE_LEVEL_DEBUG,
  1616. "%s:find seq %d in next ppdu %d",
  1617. __func__, seq_no,
  1618. ppdu_desc_cnt);
  1619. mpdu_nbuf = get_mpdu_clone_from_next_ppdu(
  1620. nbuf_ppdu_desc_list +
  1621. desc_cnt,
  1622. ppdu_desc_cnt -
  1623. desc_cnt, seq_no,
  1624. ppdu_desc->user[0].peer_id,
  1625. ppdu_id);
  1626. /* check mpdu_nbuf NULL */
  1627. if (!mpdu_nbuf) {
  1628. ppdu_desc->pending_retries++;
  1629. continue;
  1630. }
  1631. ppdu_desc->mpdus[seq_no - start_seq] =
  1632. mpdu_nbuf;
  1633. SEQ_SEG(ppdu_desc->user[0].failed_bitmap, i) |=
  1634. SEQ_SEG_MSK(ppdu_desc->user[0].failed_bitmap[0],
  1635. i);
  1636. } else {
  1637. /* any error case we need to handle */
  1638. ppdu_desc->mpdus[seq_no - start_seq] =
  1639. qdf_nbuf_queue_remove(
  1640. &ppdu_desc->mpdu_q);
  1641. }
  1642. }
  1643. dp_peer_unref_del_find_by_id(peer);
  1644. if ((ppdu_desc->pending_retries == 0) &&
  1645. qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  1646. dp_send_mpdu_info_to_stack(pdev, ppdu_desc);
  1647. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1648. qdf_mem_free(ppdu_desc->mpdus);
  1649. ppdu_desc->mpdus = NULL;
  1650. tmp_nbuf = nbuf_ppdu_desc_list[desc_cnt];
  1651. nbuf_ppdu_desc_list[desc_cnt] = NULL;
  1652. qdf_nbuf_free(tmp_nbuf);
  1653. }
  1654. }
  1655. for (i = 0; i < ppdu_desc_cnt; i++) {
  1656. uint32_t pending_ppdus;
  1657. struct cdp_tx_completion_ppdu *cur_ppdu_desc;
  1658. struct dp_peer *peer;
  1659. qdf_nbuf_queue_t head_ppdu;
  1660. if (!nbuf_ppdu_desc_list[i])
  1661. continue;
  1662. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  1663. nbuf_ppdu_desc_list[i]);
  1664. if (!cur_ppdu_desc)
  1665. continue;
  1666. peer = dp_peer_find_by_id(pdev->soc,
  1667. cur_ppdu_desc->user[0].peer_id);
  1668. if (!peer) {
  1669. tmp_nbuf = nbuf_ppdu_desc_list[i];
  1670. nbuf_ppdu_desc_list[i] = NULL;
  1671. qdf_nbuf_queue_free(&cur_ppdu_desc->mpdu_q);
  1672. qdf_mem_free(cur_ppdu_desc->mpdus);
  1673. qdf_nbuf_free(tmp_nbuf);
  1674. continue;
  1675. }
  1676. tx_tid = &peer->tx_capture.tx_tid[cur_ppdu_desc->user[0].tid];
  1677. qdf_nbuf_queue_init(&head_ppdu);
  1678. dp_tx_mon_proc_pending_ppdus(pdev, tx_tid,
  1679. nbuf_ppdu_desc_list + i,
  1680. ppdu_desc_cnt - i, &head_ppdu,
  1681. cur_ppdu_desc->user[0].peer_id);
  1682. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  1683. while ((tmp_nbuf = qdf_nbuf_queue_first(&head_ppdu))) {
  1684. cur_ppdu_desc =
  1685. (struct cdp_tx_completion_ppdu *)
  1686. qdf_nbuf_data(tmp_nbuf);
  1687. if (cur_ppdu_desc->pending_retries)
  1688. break;
  1689. dp_send_mpdu_info_to_stack(pdev, cur_ppdu_desc);
  1690. qdf_nbuf_queue_free(&cur_ppdu_desc->mpdu_q);
  1691. qdf_mem_free(cur_ppdu_desc->mpdus);
  1692. cur_ppdu_desc->mpdus = NULL;
  1693. qdf_nbuf_queue_remove(&head_ppdu);
  1694. qdf_nbuf_free(tmp_nbuf);
  1695. }
  1696. }
  1697. qdf_nbuf_queue_append(&tx_tid->pending_ppdu_q, &head_ppdu);
  1698. dp_tx_mon_proc_xretries(pdev, peer, tx_tid->tid);
  1699. dp_peer_unref_del_find_by_id(peer);
  1700. pending_ppdus = qdf_nbuf_queue_len(&tx_tid->pending_ppdu_q);
  1701. if (pending_ppdus > MAX_PENDING_PPDUS) {
  1702. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1703. QDF_TRACE_LEVEL_FATAL,
  1704. "pending ppdus (%d, %d) : %d\n",
  1705. cur_ppdu_desc->user[0].peer_id,
  1706. tx_tid->tid, pending_ppdus);
  1707. }
  1708. }
  1709. }
  1710. /**
  1711. * dp_tx_ppdu_stats_process - Deferred PPDU stats handler
  1712. * @context: Opaque work context (PDEV)
  1713. *
  1714. * Return: none
  1715. */
  1716. void dp_tx_ppdu_stats_process(void *context)
  1717. {
  1718. uint32_t curr_sched_cmdid;
  1719. uint32_t last_ppdu_id;
  1720. uint32_t ppdu_cnt;
  1721. uint32_t ppdu_desc_cnt = 0;
  1722. struct dp_pdev *pdev = (struct dp_pdev *)context;
  1723. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  1724. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  1725. struct ppdu_info *sched_ppdu_info = NULL;
  1726. STAILQ_HEAD(, ppdu_info) sched_ppdu_queue;
  1727. struct ppdu_info *sched_ppdu_list_last_ptr;
  1728. qdf_nbuf_t *nbuf_ppdu_desc_list;
  1729. qdf_nbuf_t tmp_nbuf;
  1730. struct dp_pdev_tx_capture *ptr_tx_cap = &pdev->tx_capture;
  1731. qdf_nbuf_queue_t head_xretries;
  1732. STAILQ_INIT(&sched_ppdu_queue);
  1733. /* Move the PPDU entries to defer list */
  1734. qdf_spin_lock_bh(&ptr_tx_cap->ppdu_stats_lock);
  1735. STAILQ_CONCAT(&ptr_tx_cap->ppdu_stats_defer_queue,
  1736. &ptr_tx_cap->ppdu_stats_queue);
  1737. ptr_tx_cap->ppdu_stats_defer_queue_depth +=
  1738. ptr_tx_cap->ppdu_stats_queue_depth;
  1739. ptr_tx_cap->ppdu_stats_queue_depth = 0;
  1740. qdf_spin_unlock_bh(&ptr_tx_cap->ppdu_stats_lock);
  1741. while (!STAILQ_EMPTY(&ptr_tx_cap->ppdu_stats_defer_queue)) {
  1742. ppdu_info =
  1743. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  1744. curr_sched_cmdid = ppdu_info->sched_cmdid;
  1745. ppdu_cnt = 0;
  1746. STAILQ_FOREACH_SAFE(ppdu_info,
  1747. &ptr_tx_cap->ppdu_stats_defer_queue,
  1748. ppdu_info_queue_elem, tmp_ppdu_info) {
  1749. if (curr_sched_cmdid != ppdu_info->sched_cmdid)
  1750. break;
  1751. sched_ppdu_list_last_ptr = ppdu_info;
  1752. ppdu_cnt++;
  1753. }
  1754. if (ppdu_info && (curr_sched_cmdid == ppdu_info->sched_cmdid) &&
  1755. ptr_tx_cap->ppdu_stats_next_sched < now_ms)
  1756. break;
  1757. last_ppdu_id = sched_ppdu_list_last_ptr->ppdu_id;
  1758. STAILQ_FIRST(&sched_ppdu_queue) =
  1759. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  1760. STAILQ_REMOVE_HEAD_UNTIL(&ptr_tx_cap->ppdu_stats_defer_queue,
  1761. sched_ppdu_list_last_ptr,
  1762. ppdu_info_queue_elem);
  1763. STAILQ_NEXT(sched_ppdu_list_last_ptr,
  1764. ppdu_info_queue_elem) = NULL;
  1765. ptr_tx_cap->ppdu_stats_defer_queue_depth -= ppdu_cnt;
  1766. nbuf_ppdu_desc_list =
  1767. (qdf_nbuf_t *) qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  1768. ppdu_cnt);
  1769. /*
  1770. * if there is no memory allocated we need to free sched ppdu
  1771. * list, no ppdu stats will be updated.
  1772. */
  1773. if (!nbuf_ppdu_desc_list) {
  1774. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  1775. &sched_ppdu_queue,
  1776. ppdu_info_queue_elem,
  1777. tmp_ppdu_info) {
  1778. ppdu_info = sched_ppdu_info;
  1779. tmp_nbuf = ppdu_info->nbuf;
  1780. qdf_mem_free(ppdu_info);
  1781. qdf_nbuf_free(tmp_nbuf);
  1782. }
  1783. continue;
  1784. }
  1785. qdf_spin_lock(&ptr_tx_cap->config_lock);
  1786. ppdu_desc_cnt = 0;
  1787. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  1788. &sched_ppdu_queue,
  1789. ppdu_info_queue_elem, tmp_ppdu_info) {
  1790. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1791. struct dp_peer *peer = NULL;
  1792. qdf_nbuf_t nbuf;
  1793. uint32_t retries = 0;
  1794. uint32_t ret = 0;
  1795. qdf_nbuf_queue_t head_msdu;
  1796. uint32_t start_tsf = 0;
  1797. uint32_t end_tsf = 0;
  1798. uint16_t tid = 0;
  1799. uint32_t num_msdu = 0;
  1800. uint32_t qlen = 0;
  1801. qdf_nbuf_queue_init(&head_msdu);
  1802. qdf_nbuf_queue_init(&head_xretries);
  1803. ppdu_info = sched_ppdu_info;
  1804. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1805. qdf_nbuf_data(ppdu_info->nbuf);
  1806. pdev->tx_ppdu_proc++;
  1807. dp_ppdu_desc_user_stats_update(pdev, ppdu_info);
  1808. /*
  1809. * While processing/corelating Tx buffers, we should
  1810. * hold the entire PPDU list for the give sched_cmdid
  1811. * instead of freeing below.
  1812. */
  1813. nbuf = ppdu_info->nbuf;
  1814. qdf_mem_free(ppdu_info);
  1815. qdf_assert_always(nbuf);
  1816. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1817. qdf_nbuf_data(nbuf);
  1818. /* send WDI event */
  1819. if (pdev->tx_capture_enabled ==
  1820. CDP_TX_ENH_CAPTURE_DISABLED) {
  1821. /**
  1822. * Deliver PPDU stats only for valid (acked)
  1823. * data frames if sniffer mode is not enabled.
  1824. * If sniffer mode is enabled,
  1825. * PPDU stats for all frames including
  1826. * mgmt/control frames should be delivered
  1827. * to upper layer
  1828. */
  1829. if (pdev->tx_sniffer_enable ||
  1830. pdev->mcopy_mode) {
  1831. dp_wdi_event_handler(
  1832. WDI_EVENT_TX_PPDU_DESC,
  1833. pdev->soc,
  1834. nbuf,
  1835. HTT_INVALID_PEER,
  1836. WDI_NO_VAL,
  1837. pdev->pdev_id);
  1838. } else {
  1839. if (ppdu_desc->num_mpdu != 0 &&
  1840. ppdu_desc->num_users != 0 &&
  1841. (ppdu_desc->frame_ctrl &
  1842. HTT_FRAMECTRL_DATATYPE)) {
  1843. dp_wdi_event_handler(
  1844. WDI_EVENT_TX_PPDU_DESC,
  1845. pdev->soc,
  1846. nbuf,
  1847. HTT_INVALID_PEER,
  1848. WDI_NO_VAL,
  1849. pdev->pdev_id);
  1850. } else {
  1851. qdf_nbuf_free(nbuf);
  1852. }
  1853. }
  1854. continue;
  1855. }
  1856. peer = dp_peer_find_by_id(pdev->soc,
  1857. ppdu_desc->user[0].peer_id);
  1858. /**
  1859. * peer can be NULL
  1860. */
  1861. if (!peer) {
  1862. qdf_nbuf_free(nbuf);
  1863. continue;
  1864. }
  1865. if (ppdu_desc->frame_type == CDP_PPDU_FTYPE_DATA) {
  1866. /**
  1867. * check whether it is bss peer,
  1868. * if bss_peer no need to process further
  1869. * check whether tx_capture feature is enabled
  1870. * for this peer or globally for all peers
  1871. */
  1872. if (peer->bss_peer ||
  1873. !dp_peer_or_pdev_tx_cap_enabled(pdev,
  1874. peer)) {
  1875. dp_peer_unref_del_find_by_id(peer);
  1876. qdf_nbuf_free(nbuf);
  1877. continue;
  1878. }
  1879. /* print the bit map */
  1880. dp_tx_print_bitmap(pdev, ppdu_desc,
  1881. 0, ppdu_desc->ppdu_id);
  1882. if (ppdu_desc->user[0].tid > DP_MAX_TIDS) {
  1883. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1884. QDF_TRACE_LEVEL_ERROR,
  1885. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  1886. __func__,
  1887. ppdu_desc->ppdu_id,
  1888. ppdu_desc->user[0].peer_id,
  1889. ppdu_desc->user[0].tid);
  1890. dp_peer_unref_del_find_by_id(peer);
  1891. qdf_nbuf_free(nbuf);
  1892. continue;
  1893. }
  1894. /* Non-QOS frames are being indicated with TID 0
  1895. * in WBM completion path, an hence we should
  1896. * TID 0 to reap MSDUs from completion path
  1897. */
  1898. if (qdf_unlikely(ppdu_desc->user[0].tid ==
  1899. DP_NON_QOS_TID))
  1900. tid = 0;
  1901. else
  1902. tid = ppdu_desc->user[0].tid;
  1903. dequeue_msdu_again:
  1904. num_msdu = ppdu_desc->user[0].num_msdu;
  1905. start_tsf = ppdu_desc->ppdu_start_timestamp;
  1906. end_tsf = ppdu_desc->ppdu_end_timestamp;
  1907. /*
  1908. * retrieve msdu buffer based on ppdu_id & tid
  1909. * based msdu queue and store it in local queue
  1910. * sometimes, wbm comes later than per ppdu
  1911. * stats. Assumption: all packets are SU,
  1912. * and packets comes in order
  1913. */
  1914. ret = dp_tx_msdu_dequeue(peer,
  1915. ppdu_desc->ppdu_id,
  1916. tid, num_msdu,
  1917. &head_msdu,
  1918. &head_xretries,
  1919. start_tsf, end_tsf);
  1920. if (!ret && (++retries < 2)) {
  1921. /* wait for wbm to complete */
  1922. qdf_mdelay(2);
  1923. goto dequeue_msdu_again;
  1924. }
  1925. if (!qdf_nbuf_is_queue_empty(&head_xretries)) {
  1926. struct dp_tx_tid *tx_tid =
  1927. &peer->tx_capture.tx_tid[tid];
  1928. struct cdp_tx_completion_ppdu
  1929. *xretry_ppdu =
  1930. &tx_tid->xretry_ppdu;
  1931. xretry_ppdu->ppdu_id =
  1932. peer->tx_capture.tx_wifi_ppdu_id;
  1933. /* Restitch MPDUs from xretry MSDUs */
  1934. dp_tx_mon_restitch_mpdu(pdev, peer,
  1935. xretry_ppdu,
  1936. &head_xretries,
  1937. &xretry_ppdu->mpdu_q);
  1938. }
  1939. if (!qdf_nbuf_is_queue_empty(&head_msdu)) {
  1940. /*
  1941. * now head_msdu hold - msdu list for
  1942. * that particular ppdu_id, restitch
  1943. * mpdu from msdu and create a mpdu
  1944. * queue
  1945. */
  1946. dp_tx_mon_restitch_mpdu(pdev, peer,
  1947. ppdu_desc,
  1948. &head_msdu,
  1949. &ppdu_desc->mpdu_q);
  1950. /*
  1951. * sanity: free local head msdu queue
  1952. * do we need this ?
  1953. */
  1954. qdf_nbuf_queue_free(&head_msdu);
  1955. qlen =
  1956. qdf_nbuf_queue_len(&ppdu_desc->mpdu_q);
  1957. if (!qlen) {
  1958. qdf_nbuf_free(nbuf);
  1959. dp_peer_unref_del_find_by_id(peer);
  1960. continue;
  1961. }
  1962. }
  1963. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  1964. /* print ppdu_desc info for debugging purpose */
  1965. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1966. QDF_TRACE_LEVEL_INFO,
  1967. "%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]",
  1968. __func__, ppdu_desc->ppdu_id,
  1969. ppdu_desc->user[0].peer_id,
  1970. ppdu_desc->user[0].tid,
  1971. ppdu_desc->num_mpdu,
  1972. ppdu_desc->user[0].mpdu_success,
  1973. ppdu_desc->num_msdu, retries,
  1974. qlen,
  1975. ppdu_desc->ppdu_start_timestamp,
  1976. ppdu_desc->tx_duration,
  1977. ppdu_desc->user[0].start_seq,
  1978. ppdu_cnt,
  1979. ppdu_desc_cnt);
  1980. } else if (ppdu_desc->frame_type ==
  1981. CDP_PPDU_FTYPE_CTRL) {
  1982. nbuf_ppdu_desc_list[ppdu_desc_cnt++] = nbuf;
  1983. } else {
  1984. qdf_nbuf_queue_free(&ppdu_desc->mpdu_q);
  1985. qdf_nbuf_free(nbuf);
  1986. }
  1987. dp_peer_unref_del_find_by_id(peer);
  1988. }
  1989. /*
  1990. * At this point we have mpdu queued per ppdu_desc
  1991. * based on packet capture flags send mpdu info to upper stack
  1992. */
  1993. if (ppdu_desc_cnt) {
  1994. dp_check_ppdu_and_deliver(pdev, nbuf_ppdu_desc_list,
  1995. ppdu_desc_cnt);
  1996. }
  1997. qdf_spin_unlock(&ptr_tx_cap->config_lock);
  1998. qdf_mem_free(nbuf_ppdu_desc_list);
  1999. }
  2000. }
  2001. /**
  2002. * dp_ppdu_desc_deliver(): Function to deliver Tx PPDU status descriptor
  2003. * to upper layer
  2004. * @pdev: DP pdev handle
  2005. * @ppdu_info: per PPDU TLV descriptor
  2006. *
  2007. * return: void
  2008. */
  2009. void dp_ppdu_desc_deliver(struct dp_pdev *pdev,
  2010. struct ppdu_info *ppdu_info)
  2011. {
  2012. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  2013. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  2014. TAILQ_REMOVE(&pdev->ppdu_info_list, ppdu_info, ppdu_info_list_elem);
  2015. pdev->list_depth--;
  2016. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2017. qdf_nbuf_data(ppdu_info->nbuf);
  2018. qdf_spin_lock_bh(&pdev->tx_capture.ppdu_stats_lock);
  2019. if (qdf_unlikely(!pdev->tx_capture_enabled &&
  2020. (pdev->tx_capture.ppdu_stats_queue_depth +
  2021. pdev->tx_capture.ppdu_stats_defer_queue_depth) >
  2022. DP_TX_PPDU_PROC_MAX_DEPTH)) {
  2023. qdf_nbuf_free(ppdu_info->nbuf);
  2024. qdf_mem_free(ppdu_info);
  2025. pdev->tx_capture.ppdu_dropped++;
  2026. } else {
  2027. STAILQ_INSERT_TAIL(&pdev->tx_capture.ppdu_stats_queue,
  2028. ppdu_info, ppdu_info_queue_elem);
  2029. pdev->tx_capture.ppdu_stats_queue_depth++;
  2030. }
  2031. qdf_spin_unlock_bh(&pdev->tx_capture.ppdu_stats_lock);
  2032. if ((pdev->tx_capture.ppdu_stats_queue_depth >
  2033. DP_TX_PPDU_PROC_THRESHOLD) ||
  2034. (pdev->tx_capture.ppdu_stats_next_sched <= now_ms)) {
  2035. qdf_queue_work(0, pdev->tx_capture.ppdu_stats_workqueue,
  2036. &pdev->tx_capture.ppdu_stats_work);
  2037. pdev->tx_capture.ppdu_stats_next_sched =
  2038. now_ms + DP_TX_PPDU_PROC_TIMEOUT;
  2039. }
  2040. }
  2041. #endif