dp_tx_capture.c 155 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797
  1. /*
  2. * Copyright (c) 2017-2020 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 "htt_ppdu_stats.h"
  25. #include "dp_htt.h"
  26. #include "qdf_mem.h" /* qdf_mem_malloc,free */
  27. #include "cdp_txrx_cmn_struct.h"
  28. #include <enet.h>
  29. #include "dp_tx_capture.h"
  30. #define MAX_MONITOR_HEADER (512)
  31. #define MAX_DUMMY_FRM_BODY (128)
  32. #define DP_BA_ACK_FRAME_SIZE (sizeof(struct ieee80211_ctlframe_addr2) + 36)
  33. #define DP_ACK_FRAME_SIZE (sizeof(struct ieee80211_frame_min_one))
  34. #define DP_CTS_FRAME_SIZE (sizeof(struct ieee80211_frame_min_one))
  35. #define DP_ACKNOACK_FRAME_SIZE (sizeof(struct ieee80211_frame) + 16)
  36. #define DP_MAX_MPDU_64 64
  37. #define DP_NUM_WORDS_PER_PPDU_BITMAP_64 (DP_MAX_MPDU_64 >> 5)
  38. #define DP_NUM_BYTES_PER_PPDU_BITMAP_64 (DP_MAX_MPDU_64 >> 3)
  39. #define DP_NUM_BYTES_PER_PPDU_BITMAP (HAL_RX_MAX_MPDU >> 3)
  40. #define DP_IEEE80211_BAR_CTL_TID_S 12
  41. #define DP_IEEE80211_BAR_CTL_TID_M 0xf
  42. #define DP_IEEE80211_BAR_CTL_POLICY_S 0
  43. #define DP_IEEE80211_BAR_CTL_POLICY_M 0x1
  44. #define DP_IEEE80211_BA_S_SEQ_S 4
  45. #define DP_IEEE80211_BAR_CTL_COMBA 0x0004
  46. #define INVALID_PPDU_ID 0xFFFF
  47. #define MAX_END_TSF 0xFFFFFFFF
  48. #define DP_IEEE80211_CATEGORY_VHT (21)
  49. #define DP_NOACK_SOUNDING_TOKEN_POS (4)
  50. #define DP_NOACK_STOKEN_POS_SHIFT (2)
  51. #define DP_NDPA_TOKEN_POS (16)
  52. /* Macros to handle sequence number bitmaps */
  53. /* HW generated rts frame flag */
  54. #define SEND_WIFIRTS_LEGACY_E 1
  55. /* HW generated 11 AC static bw flag */
  56. #define SEND_WIFIRTS_11AC_STATIC_BW_E 2
  57. /* HW generated 11 AC dynamic bw flag */
  58. #define SEND_WIFIRTS_11AC_DYNAMIC_BW_E 3
  59. /* HW generated cts frame flag */
  60. #define SEND_WIFICTS2SELF_E 4
  61. /* Size (in bits) of a segment of sequence number bitmap */
  62. #define SEQ_SEG_SZ_BITS(_seqarr) (sizeof(_seqarr[0]) << 3)
  63. /* Array index of a segment of sequence number bitmap */
  64. #define SEQ_SEG_INDEX(_seqarr, _seqno) ((_seqno) / SEQ_SEG_SZ_BITS(_seqarr))
  65. /* Bit mask of a seqno within a segment of sequence bitmap */
  66. #define SEQ_SEG_MSK(_seqseg, _index) \
  67. (1 << ((_index) & ((sizeof(_seqseg) << 3) - 1)))
  68. /* Check seqno bit in a segment of sequence bitmap */
  69. #define SEQ_SEG_BIT(_seqseg, _index) \
  70. ((_seqseg) & SEQ_SEG_MSK((_seqseg), _index))
  71. /* Segment of sequence bitmap containing a given sequence number */
  72. #define SEQ_SEG(_seqarr, _seqno) \
  73. (_seqarr[(_seqno) / (sizeof(_seqarr[0]) << 3)])
  74. /* Check seqno bit in the sequence bitmap */
  75. #define SEQ_BIT(_seqarr, _seqno) \
  76. SEQ_SEG_BIT(SEQ_SEG(_seqarr, (_seqno)), (_seqno))
  77. /* Lower 32 mask for timestamp us as completion path has 32 bits timestamp */
  78. #define LOWER_32_MASK 0xFFFFFFFF
  79. /* Maximum time taken to enqueue next mgmt pkt */
  80. #define MAX_MGMT_ENQ_DELAY 10000
  81. /* Schedule id counter mask in ppdu_id */
  82. #define SCH_ID_MASK 0xFF
  83. #define IEEE80211_IS_ZERO(_a) \
  84. ((_a)[0] == 0x00 && \
  85. (_a)[1] == 0x00 && \
  86. (_a)[2] == 0x00 && \
  87. (_a)[3] == 0x00 && \
  88. (_a)[4] == 0x00 && \
  89. (_a)[5] == 0x00)
  90. /* Maximum number of retries */
  91. #define MAX_RETRY_Q_COUNT 20
  92. #ifdef WLAN_TX_PKT_CAPTURE_ENH
  93. /* stats counter */
  94. #ifdef WLAN_TX_PKT_CAPTURE_ENH_DEBUG
  95. /**
  96. * dp_tx_cap_stats_msdu_update() - update msdu level stats counter per peer
  97. * @peer: DP PEER object
  98. * @msdu_desc: msdu desc index
  99. * @count: count to update
  100. *
  101. * Return: void
  102. */
  103. static inline
  104. void dp_tx_cap_stats_msdu_update(struct dp_peer *peer,
  105. uint8_t msdu_desc, uint32_t count)
  106. {
  107. struct dp_peer_tx_capture_stats *stats;
  108. stats = &peer->tx_capture.stats;
  109. stats->msdu[msdu_desc] += count;
  110. }
  111. /**
  112. * dp_tx_cap_stats_mpdu_update() - update mpdu level stats counter per peer
  113. * @peer: DP PEER object
  114. * @mpdu_desc: mpdu desc index
  115. * @count: count to update
  116. *
  117. * Return: void
  118. */
  119. static inline
  120. void dp_tx_cap_stats_mpdu_update(struct dp_peer *peer,
  121. uint8_t mpdu_desc, uint32_t count)
  122. {
  123. struct dp_peer_tx_capture_stats *stats;
  124. stats = &peer->tx_capture.stats;
  125. stats->mpdu[mpdu_desc] += count;
  126. }
  127. /**
  128. * dp_tx_capture_print_stats() - print stats counter per peer
  129. * @peer: DP PEER object
  130. *
  131. * Return: void
  132. */
  133. static inline
  134. void dp_tx_capture_print_stats(struct dp_peer *peer)
  135. {
  136. struct dp_peer_tx_capture_stats *stats;
  137. stats = &peer->tx_capture.stats;
  138. DP_PRINT_STATS(" peer_id[%d] MSDU[S:%u E:%u D:%u F:%u DP:%u X:%u] MPDU[T:%u S:%u R:%u A:%u C:%u ST:%u]",
  139. peer->peer_id,
  140. stats->msdu[PEER_MSDU_SUCC],
  141. stats->msdu[PEER_MSDU_ENQ],
  142. stats->msdu[PEER_MSDU_DEQ],
  143. stats->msdu[PEER_MSDU_FLUSH],
  144. stats->msdu[PEER_MSDU_DROP],
  145. stats->msdu[PEER_MSDU_XRETRY],
  146. stats->mpdu[PEER_MPDU_TRI],
  147. stats->mpdu[PEER_MPDU_SUCC],
  148. stats->mpdu[PEER_MPDU_RESTITCH],
  149. stats->mpdu[PEER_MPDU_ARR],
  150. stats->mpdu[PEER_MPDU_CLONE],
  151. stats->mpdu[PEER_MPDU_TO_STACK]);
  152. }
  153. #else
  154. /**
  155. * dp_tx_cap_stats_msdu_update() - update msdu level stats counter per peer
  156. * @peer: DP PEER object
  157. * @msdu_desc: msdu desc index
  158. * @count: count to update
  159. *
  160. * Return: void
  161. */
  162. static inline
  163. void dp_tx_cap_stats_msdu_update(struct dp_peer *peer,
  164. uint8_t msdu_desc, uint32_t count)
  165. {
  166. }
  167. /**
  168. * dp_tx_cap_stats_mpdu_update() - update mpdu level stats counter per peer
  169. * @peer: DP PEER object
  170. * @mpdu_desc: mpdu desc index
  171. * @count: count to update
  172. *
  173. * Return: void
  174. */
  175. static inline
  176. void dp_tx_cap_stats_mpdu_update(struct dp_peer *peer,
  177. uint8_t mpdu_desc, uint32_t count)
  178. {
  179. }
  180. /**
  181. * dp_tx_capture_print_stats() - print stats counter per peer
  182. * @peer: DP PEER object
  183. *
  184. * Return: void
  185. */
  186. static inline
  187. void dp_tx_capture_print_stats(struct dp_peer *peer)
  188. {
  189. }
  190. #endif
  191. /**
  192. * dp_tx_cap_peer_find_by_id() - Returns peer object given the peer id
  193. * if delete_in_progress in not set for peer
  194. *
  195. * @soc: core DP soc context
  196. * @peer_id: peer id from peer object can be retrieved
  197. *
  198. * Return: struct dp_peer*: Pointer to DP peer object
  199. */
  200. static inline
  201. struct dp_peer *dp_tx_cap_peer_find_by_id(struct dp_soc *soc,
  202. uint16_t peer_id)
  203. {
  204. struct dp_peer *peer;
  205. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  206. peer = __dp_peer_find_by_id(soc, peer_id);
  207. if (!peer || (peer && peer->delete_in_progress)) {
  208. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  209. return NULL;
  210. }
  211. qdf_atomic_inc(&peer->ref_cnt);
  212. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  213. return peer;
  214. }
  215. /**
  216. * dp_tx_cap_peer_unref_del() - dec ref and del peer if ref count is
  217. * taken by dp_tx_cap_peer_find_by_id
  218. * @peer: peer context
  219. *
  220. * Return: none
  221. */
  222. static inline void dp_tx_cap_peer_unref_del(struct dp_peer *peer)
  223. {
  224. dp_peer_unref_delete(peer);
  225. }
  226. /*
  227. * dp_tx_capture_htt_frame_counter: increment counter for htt_frame_type
  228. * pdev: DP pdev handle
  229. * htt_frame_type: htt frame type received from fw
  230. *
  231. * return: void
  232. */
  233. void dp_tx_capture_htt_frame_counter(struct dp_pdev *pdev,
  234. uint32_t htt_frame_type)
  235. {
  236. if (htt_frame_type >= TX_CAP_HTT_MAX_FTYPE)
  237. return;
  238. pdev->tx_capture.htt_frame_type[htt_frame_type]++;
  239. }
  240. /*
  241. * dp_iterate_print_tid_qlen_per_peer()- API to print peer tid msdu queue
  242. * @pdev_handle: DP_PDEV handle
  243. *
  244. * Return: void
  245. */
  246. void dp_print_tid_qlen_per_peer(void *pdev_hdl, uint8_t consolidated)
  247. {
  248. struct dp_pdev *pdev = (struct dp_pdev *)pdev_hdl;
  249. struct dp_soc *soc = pdev->soc;
  250. struct dp_vdev *vdev = NULL;
  251. struct dp_peer *peer = NULL;
  252. uint64_t c_defer_msdu_len = 0;
  253. uint64_t c_tasklet_msdu_len = 0;
  254. uint64_t c_pending_q_len = 0;
  255. DP_PRINT_STATS("pending peer msdu and ppdu:");
  256. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  257. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  258. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  259. DP_VDEV_ITERATE_PEER_LIST(vdev, peer) {
  260. int tid;
  261. struct dp_tx_tid *tx_tid;
  262. uint32_t msdu_len;
  263. uint32_t tasklet_msdu_len;
  264. uint32_t ppdu_len;
  265. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  266. tx_tid = &peer->tx_capture.tx_tid[tid];
  267. msdu_len =
  268. qdf_nbuf_queue_len(&tx_tid->defer_msdu_q);
  269. tasklet_msdu_len =
  270. qdf_nbuf_queue_len(&tx_tid->msdu_comp_q);
  271. ppdu_len =
  272. qdf_nbuf_queue_len(&tx_tid->pending_ppdu_q);
  273. c_defer_msdu_len += msdu_len;
  274. c_tasklet_msdu_len += tasklet_msdu_len;
  275. c_pending_q_len += ppdu_len;
  276. if (consolidated)
  277. continue;
  278. if (!msdu_len && !ppdu_len && !tasklet_msdu_len)
  279. continue;
  280. DP_PRINT_STATS(" peer_id[%d] tid[%d] msdu_comp_q[%d] defer_msdu_q[%d] pending_ppdu_q[%d]",
  281. peer->peer_id, tid,
  282. tasklet_msdu_len,
  283. msdu_len, ppdu_len);
  284. }
  285. if (!consolidated)
  286. dp_tx_capture_print_stats(peer);
  287. }
  288. }
  289. DP_PRINT_STATS("consolidated: msdu_comp_q[%d] defer_msdu_q[%d] pending_ppdu_q[%d]",
  290. c_tasklet_msdu_len, c_defer_msdu_len,
  291. c_pending_q_len);
  292. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  293. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  294. }
  295. static void
  296. dp_ppdu_queue_free(qdf_nbuf_t ppdu_nbuf, uint8_t usr_idx)
  297. {
  298. int i;
  299. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  300. struct cdp_tx_completion_ppdu_user *user;
  301. qdf_nbuf_t mpdu_nbuf = NULL;
  302. if (!ppdu_nbuf)
  303. return;
  304. ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(ppdu_nbuf);
  305. if (!ppdu_desc)
  306. return;
  307. user = &ppdu_desc->user[usr_idx];
  308. if (!user->mpdus)
  309. goto free_ppdu_desc_mpdu_q;
  310. for (i = 0; i < user->ba_size &&
  311. i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++) {
  312. mpdu_nbuf = user->mpdus[i];
  313. if (mpdu_nbuf) {
  314. qdf_nbuf_free(mpdu_nbuf);
  315. user->mpdus[i] = NULL;
  316. }
  317. }
  318. free_ppdu_desc_mpdu_q:
  319. if (!qdf_nbuf_is_queue_empty(&user->mpdu_q))
  320. qdf_nbuf_queue_free(&user->mpdu_q);
  321. if (user->mpdus)
  322. qdf_mem_free(user->mpdus);
  323. user->mpdus = NULL;
  324. }
  325. /*
  326. * dp_tx_cature_stats: print tx capture stats
  327. * @pdev: DP PDEV handle
  328. *
  329. * return: void
  330. */
  331. void dp_print_pdev_tx_capture_stats(struct dp_pdev *pdev)
  332. {
  333. struct dp_pdev_tx_capture *ptr_tx_cap;
  334. uint8_t i = 0, j = 0;
  335. ptr_tx_cap = &(pdev->tx_capture);
  336. DP_PRINT_STATS("tx capture stats:");
  337. DP_PRINT_STATS(" pending ppdu dropped: %u",
  338. ptr_tx_cap->pend_ppdu_dropped);
  339. DP_PRINT_STATS(" ppdu stats queue depth: %u",
  340. ptr_tx_cap->ppdu_stats_queue_depth);
  341. DP_PRINT_STATS(" ppdu stats defer queue depth: %u",
  342. ptr_tx_cap->ppdu_stats_defer_queue_depth);
  343. DP_PRINT_STATS(" mgmt control enqueue stats:");
  344. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  345. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  346. if (ptr_tx_cap->ctl_mgmt_q[i][j].qlen)
  347. DP_PRINT_STATS(" ctl_mgmt_q[%d][%d] = queue_len[%d]",
  348. i, j, ptr_tx_cap->ctl_mgmt_q[i][j].qlen);
  349. }
  350. }
  351. DP_PRINT_STATS(" mgmt control retry queue stats:");
  352. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  353. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  354. if (ptr_tx_cap->retries_ctl_mgmt_q[i][j].qlen)
  355. DP_PRINT_STATS(" retries_ctl_mgmt_q[%d][%d] = queue_len[%d]",
  356. i, j,
  357. ptr_tx_cap->retries_ctl_mgmt_q[i][j].qlen);
  358. }
  359. }
  360. for (i = 0; i < TX_CAP_HTT_MAX_FTYPE; i++) {
  361. if (!ptr_tx_cap->htt_frame_type[i])
  362. continue;
  363. DP_PRINT_STATS(" sgen htt frame type[%d] = %d",
  364. i, ptr_tx_cap->htt_frame_type[i]);
  365. }
  366. dp_print_tid_qlen_per_peer(pdev, 0);
  367. }
  368. /**
  369. * dp_peer_or_pdev_tx_cap_enabled - Returns status of tx_cap_enabled
  370. * based on global per-pdev setting or per-peer setting
  371. * @pdev: Datapath pdev handle
  372. * @peer: Datapath peer
  373. * @mac_addr: peer mac address
  374. *
  375. * Return: true if feature is enabled on a per-pdev basis or if
  376. * enabled for the given peer when per-peer mode is set, false otherwise
  377. */
  378. inline bool
  379. dp_peer_or_pdev_tx_cap_enabled(struct dp_pdev *pdev,
  380. struct dp_peer *peer, uint8_t *mac_addr)
  381. {
  382. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS) {
  383. return true;
  384. } else if (pdev->tx_capture_enabled ==
  385. CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  386. if (peer && peer->tx_cap_enabled)
  387. return true;
  388. /* do search based on mac address */
  389. return is_dp_peer_mgmt_pkt_filter(pdev,
  390. HTT_INVALID_PEER,
  391. mac_addr);
  392. }
  393. return false;
  394. }
  395. /*
  396. * dp_tx_find_usr_idx_from_peer_id()- find user index based on peer_id
  397. * @ppdu_desc: pointer to ppdu_desc structure
  398. * @peer_id: peer id
  399. *
  400. * Return: user index
  401. */
  402. static uint8_t
  403. dp_tx_find_usr_idx_from_peer_id(struct cdp_tx_completion_ppdu *ppdu_desc,
  404. uint16_t peer_id)
  405. {
  406. uint8_t usr_idx = 0;
  407. bool found = false;
  408. for (usr_idx = 0; usr_idx < ppdu_desc->num_users; usr_idx++) {
  409. if (ppdu_desc->user[usr_idx].peer_id == peer_id) {
  410. found = true;
  411. break;
  412. }
  413. }
  414. if (!found) {
  415. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  416. QDF_TRACE_LEVEL_FATAL,
  417. "%s: %d peer_id: %d, ppdu_desc[%p][num_users: %d]\n",
  418. __func__, __LINE__, peer_id, ppdu_desc,
  419. ppdu_desc->num_users);
  420. qdf_assert_always(0);
  421. }
  422. return usr_idx;
  423. }
  424. /*
  425. * dp_peer_tid_peer_id_update() – update peer_id to tid structure
  426. * @peer: Datapath peer
  427. * @peer_id: peer_id
  428. *
  429. */
  430. void dp_peer_tid_peer_id_update(struct dp_peer *peer, uint16_t peer_id)
  431. {
  432. int tid;
  433. struct dp_tx_tid *tx_tid;
  434. dp_peer_tid_queue_init(peer);
  435. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  436. tx_tid = &peer->tx_capture.tx_tid[tid];
  437. tx_tid->peer_id = peer_id;
  438. if (tx_tid->tid != tid) {
  439. qdf_err("tx tid is corrupted for tid %d, peer_id %d", tid, peer_id);
  440. tx_tid->tid = tid;
  441. }
  442. }
  443. }
  444. /*
  445. * dp_peer_tid_queue_init() – Initialize ppdu stats queue per TID
  446. * @peer: Datapath peer
  447. *
  448. */
  449. void dp_peer_tid_queue_init(struct dp_peer *peer)
  450. {
  451. int tid;
  452. struct dp_tx_tid *tx_tid;
  453. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  454. tx_tid = &peer->tx_capture.tx_tid[tid];
  455. if (tx_tid->init_done)
  456. continue;
  457. tx_tid->tid = tid;
  458. qdf_nbuf_queue_init(&tx_tid->defer_msdu_q);
  459. qdf_nbuf_queue_init(&tx_tid->msdu_comp_q);
  460. qdf_nbuf_queue_init(&tx_tid->pending_ppdu_q);
  461. tx_tid->max_ppdu_id = 0;
  462. /* spinlock create */
  463. qdf_spinlock_create(&tx_tid->tid_lock);
  464. qdf_spinlock_create(&tx_tid->tasklet_tid_lock);
  465. tx_tid->init_done = 1;
  466. }
  467. }
  468. /*
  469. * dp_peer_tx_cap_tid_queue_flush() – flush peer tx cap per TID
  470. * @peer: Datapath peer
  471. *
  472. * return: void
  473. */
  474. static
  475. void dp_peer_tx_cap_tid_queue_flush(struct dp_peer *peer)
  476. {
  477. int tid;
  478. struct dp_tx_tid *tx_tid;
  479. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  480. tx_tid = &peer->tx_capture.tx_tid[tid];
  481. qdf_spin_lock_bh(&tx_tid->tid_lock);
  482. qdf_nbuf_queue_free(&tx_tid->defer_msdu_q);
  483. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  484. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  485. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  486. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  487. tx_tid->max_ppdu_id = 0;
  488. }
  489. }
  490. /*
  491. * dp_peer_tid_queue_cleanup() – remove ppdu stats queue per TID
  492. * @peer: Datapath peer
  493. *
  494. */
  495. void dp_peer_tid_queue_cleanup(struct dp_peer *peer)
  496. {
  497. struct dp_tx_tid *tx_tid;
  498. struct cdp_tx_completion_ppdu *xretry_ppdu;
  499. struct cdp_tx_completion_ppdu_user *xretry_user;
  500. struct cdp_tx_completion_ppdu *ppdu_desc;
  501. struct cdp_tx_completion_ppdu_user *user;
  502. qdf_nbuf_t ppdu_nbuf = NULL;
  503. int tid;
  504. uint16_t peer_id;
  505. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  506. tx_tid = &peer->tx_capture.tx_tid[tid];
  507. xretry_ppdu = &tx_tid->xretry_ppdu;
  508. xretry_user = &xretry_ppdu->user[0];
  509. qdf_spin_lock_bh(&tx_tid->tid_lock);
  510. qdf_nbuf_queue_free(&tx_tid->defer_msdu_q);
  511. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  512. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  513. qdf_nbuf_queue_free(&tx_tid->msdu_comp_q);
  514. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  515. /* spinlock destroy */
  516. qdf_spinlock_destroy(&tx_tid->tid_lock);
  517. qdf_spinlock_destroy(&tx_tid->tasklet_tid_lock);
  518. peer_id = tx_tid->peer_id;
  519. /* free pending ppdu_q and xretry mpdu_q */
  520. while ((ppdu_nbuf = qdf_nbuf_queue_remove(
  521. &tx_tid->pending_ppdu_q))) {
  522. uint8_t usr_idx;
  523. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  524. qdf_nbuf_data(ppdu_nbuf);
  525. /*
  526. * check if peer id is matching
  527. * the user peer_id
  528. */
  529. usr_idx = dp_tx_find_usr_idx_from_peer_id(ppdu_desc,
  530. peer_id);
  531. user = &ppdu_desc->user[usr_idx];
  532. /* free all the mpdu_q and mpdus for usr_idx */
  533. dp_ppdu_queue_free(ppdu_nbuf, usr_idx);
  534. qdf_nbuf_free(ppdu_nbuf);
  535. }
  536. qdf_nbuf_queue_free(&xretry_user->mpdu_q);
  537. tx_tid->max_ppdu_id = 0;
  538. }
  539. }
  540. /*
  541. * dp_peer_update_80211_hdr: update 80211 hdr
  542. * @vdev: DP VDEV
  543. * @peer: DP PEER
  544. *
  545. * return: void
  546. */
  547. void dp_peer_update_80211_hdr(struct dp_vdev *vdev, struct dp_peer *peer)
  548. {
  549. struct ieee80211_frame *ptr_wh;
  550. ptr_wh = &peer->tx_capture.tx_wifi_hdr;
  551. /* i_addr1 - Receiver mac address */
  552. /* i_addr2 - Transmitter mac address */
  553. /* i_addr3 - Destination mac address */
  554. qdf_mem_copy(ptr_wh->i_addr1,
  555. peer->mac_addr.raw,
  556. QDF_MAC_ADDR_SIZE);
  557. qdf_mem_copy(ptr_wh->i_addr3,
  558. peer->mac_addr.raw,
  559. QDF_MAC_ADDR_SIZE);
  560. qdf_mem_copy(ptr_wh->i_addr2,
  561. vdev->mac_addr.raw,
  562. QDF_MAC_ADDR_SIZE);
  563. }
  564. /*
  565. * dp_deliver_mgmt_frm: Process
  566. * @pdev: DP PDEV handle
  567. * @nbuf: buffer containing the htt_ppdu_stats_tx_mgmtctrl_payload_tlv
  568. *
  569. * return: void
  570. */
  571. void dp_deliver_mgmt_frm(struct dp_pdev *pdev, qdf_nbuf_t nbuf)
  572. {
  573. if (pdev->tx_sniffer_enable || pdev->mcopy_mode) {
  574. dp_wdi_event_handler(WDI_EVENT_TX_MGMT_CTRL, pdev->soc,
  575. nbuf, HTT_INVALID_PEER,
  576. WDI_NO_VAL, pdev->pdev_id);
  577. return;
  578. }
  579. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS ||
  580. pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENDIS_PER_PEER) {
  581. /* invoke WDI event handler here send mgmt pkt here */
  582. struct ieee80211_frame *wh;
  583. uint8_t type, subtype;
  584. struct cdp_tx_mgmt_comp_info *ptr_mgmt_hdr;
  585. ptr_mgmt_hdr = (struct cdp_tx_mgmt_comp_info *)
  586. qdf_nbuf_data(nbuf);
  587. wh = (struct ieee80211_frame *)(qdf_nbuf_data(nbuf) +
  588. sizeof(struct cdp_tx_mgmt_comp_info));
  589. type = (wh->i_fc[0] & IEEE80211_FC0_TYPE_MASK) >>
  590. IEEE80211_FC0_TYPE_SHIFT;
  591. subtype = (wh->i_fc[0] & IEEE80211_FC0_SUBTYPE_MASK) >>
  592. IEEE80211_FC0_SUBTYPE_SHIFT;
  593. if (!ptr_mgmt_hdr->ppdu_id || !ptr_mgmt_hdr->tx_tsf ||
  594. (!type && !subtype)) {
  595. /*
  596. * if either ppdu_id and tx_tsf are zero then
  597. * storing the payload won't be useful
  598. * in constructing the packet
  599. * Hence freeing the packet
  600. */
  601. qdf_nbuf_free(nbuf);
  602. return;
  603. }
  604. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, NULL, wh->i_addr1)) {
  605. qdf_nbuf_free(nbuf);
  606. return;
  607. }
  608. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  609. "dlvr mgmt frm(%d 0x%08x): fc 0x%x %x, dur 0x%x%x tsf:%u",
  610. ptr_mgmt_hdr->ppdu_id,
  611. ptr_mgmt_hdr->ppdu_id,
  612. wh->i_fc[1], wh->i_fc[0],
  613. wh->i_dur[1], wh->i_dur[0], ptr_mgmt_hdr->tx_tsf);
  614. QDF_TRACE_HEX_DUMP(QDF_MODULE_ID_TX_CAPTURE,
  615. QDF_TRACE_LEVEL_DEBUG,
  616. qdf_nbuf_data(nbuf), 64);
  617. qdf_spin_lock_bh(
  618. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  619. qdf_nbuf_queue_add(&pdev->tx_capture.ctl_mgmt_q[type][subtype],
  620. nbuf);
  621. qdf_spin_unlock_bh(
  622. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  623. } else {
  624. if (!pdev->bpr_enable)
  625. qdf_nbuf_free(nbuf);
  626. }
  627. }
  628. static inline int dp_peer_compare_mac_addr(void *addr1, void *addr2)
  629. {
  630. union dp_align_mac_addr *mac_addr1 = (union dp_align_mac_addr *)addr1;
  631. union dp_align_mac_addr *mac_addr2 = (union dp_align_mac_addr *)addr2;
  632. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  633. & (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  634. }
  635. /*
  636. * dp_peer_tx_cap_search: filter mgmt pkt based on peer and mac address
  637. * @pdev: DP PDEV handle
  638. * @peer_id: DP PEER ID
  639. * @mac_addr: pointer to mac address
  640. *
  641. * return: true on matched and false on not found
  642. */
  643. static
  644. bool dp_peer_tx_cap_search(struct dp_pdev *pdev,
  645. uint16_t peer_id, uint8_t *mac_addr)
  646. {
  647. struct dp_pdev_tx_capture *tx_capture;
  648. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  649. uint8_t i = 0;
  650. bool found = false;
  651. tx_capture = &pdev->tx_capture;
  652. /* search based on mac address */
  653. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  654. uint8_t *peer_mac_addr;
  655. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  656. if (ptr_peer_mgmt_list->avail)
  657. continue;
  658. peer_mac_addr = ptr_peer_mgmt_list->mac_addr;
  659. if (!dp_peer_compare_mac_addr(mac_addr,
  660. peer_mac_addr)) {
  661. found = true;
  662. break;
  663. }
  664. }
  665. return found;
  666. }
  667. /*
  668. * dp_peer_tx_cap_add_filter: add peer filter mgmt pkt based on peer
  669. * and mac address
  670. * @pdev: DP PDEV handle
  671. * @peer_id: DP PEER ID
  672. * @mac_addr: pointer to mac address
  673. *
  674. * return: true on added and false on not failed
  675. */
  676. bool dp_peer_tx_cap_add_filter(struct dp_pdev *pdev,
  677. uint16_t peer_id, uint8_t *mac_addr)
  678. {
  679. struct dp_pdev_tx_capture *tx_capture;
  680. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  681. uint8_t i = 0;
  682. bool status = false;
  683. tx_capture = &pdev->tx_capture;
  684. if (dp_peer_tx_cap_search(pdev, peer_id, mac_addr)) {
  685. /* mac address and peer_id already there */
  686. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  687. "%s: %d peer_id[%d] mac_addr[%pM] already there\n",
  688. __func__, __LINE__, peer_id, mac_addr);
  689. return status;
  690. }
  691. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  692. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  693. if (!ptr_peer_mgmt_list->avail)
  694. continue;
  695. qdf_mem_copy(ptr_peer_mgmt_list->mac_addr,
  696. mac_addr, QDF_MAC_ADDR_SIZE);
  697. ptr_peer_mgmt_list->avail = false;
  698. ptr_peer_mgmt_list->peer_id = peer_id;
  699. status = true;
  700. break;
  701. }
  702. return status;
  703. }
  704. /*
  705. * dp_peer_tx_cap_del_all_filter: delete all peer filter mgmt pkt based on peer
  706. * and mac address
  707. * @pdev: DP PDEV handle
  708. * @peer_id: DP PEER ID
  709. * @mac_addr: pointer to mac address
  710. *
  711. * return: void
  712. */
  713. void dp_peer_tx_cap_del_all_filter(struct dp_pdev *pdev)
  714. {
  715. struct dp_pdev_tx_capture *tx_capture;
  716. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  717. uint8_t i = 0;
  718. tx_capture = &pdev->tx_capture;
  719. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  720. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  721. ptr_peer_mgmt_list->avail = true;
  722. ptr_peer_mgmt_list->peer_id = HTT_INVALID_PEER;
  723. qdf_mem_zero(ptr_peer_mgmt_list->mac_addr, QDF_MAC_ADDR_SIZE);
  724. }
  725. }
  726. /*
  727. * dp_peer_tx_cap_del_filter: delete peer filter mgmt pkt based on peer
  728. * and mac address
  729. * @pdev: DP PDEV handle
  730. * @peer_id: DP PEER ID
  731. * @mac_addr: pointer to mac address
  732. *
  733. * return: true on added and false on not failed
  734. */
  735. bool dp_peer_tx_cap_del_filter(struct dp_pdev *pdev,
  736. uint16_t peer_id, uint8_t *mac_addr)
  737. {
  738. struct dp_pdev_tx_capture *tx_capture;
  739. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  740. uint8_t i = 0;
  741. bool status = false;
  742. tx_capture = &pdev->tx_capture;
  743. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  744. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  745. if (!dp_peer_compare_mac_addr(mac_addr,
  746. ptr_peer_mgmt_list->mac_addr) &&
  747. (!ptr_peer_mgmt_list->avail)) {
  748. ptr_peer_mgmt_list->avail = true;
  749. ptr_peer_mgmt_list->peer_id = HTT_INVALID_PEER;
  750. qdf_mem_zero(ptr_peer_mgmt_list->mac_addr,
  751. QDF_MAC_ADDR_SIZE);
  752. status = true;
  753. break;
  754. }
  755. }
  756. if (!status)
  757. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  758. "unable to delete peer[%d] mac[%pM] filter list",
  759. peer_id, mac_addr);
  760. return status;
  761. }
  762. /*
  763. * dp_peer_tx_cap_print_mgmt_filter: pradd peer filter mgmt pkt based on peer
  764. * and mac address
  765. * @pdev: DP PDEV handle
  766. * @peer_id: DP PEER ID
  767. * @mac_addr: pointer to mac address
  768. *
  769. * return: true on added and false on not failed
  770. */
  771. void dp_peer_tx_cap_print_mgmt_filter(struct dp_pdev *pdev,
  772. uint16_t peer_id, uint8_t *mac_addr)
  773. {
  774. struct dp_pdev_tx_capture *tx_capture;
  775. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  776. uint8_t i = 0;
  777. tx_capture = &pdev->tx_capture;
  778. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  779. "peer filter list:");
  780. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  781. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  782. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  783. "peer_id[%d] mac_addr[%pM] avail[%d]",
  784. ptr_peer_mgmt_list->peer_id,
  785. ptr_peer_mgmt_list->mac_addr,
  786. ptr_peer_mgmt_list->avail);
  787. }
  788. }
  789. /*
  790. * dp_peer_mgmt_pkt_filter: filter mgmt pkt based on peer and mac address
  791. * @pdev: DP PDEV handle
  792. * @nbuf: buffer containing the ppdu_desc
  793. *
  794. * return: status
  795. */
  796. bool is_dp_peer_mgmt_pkt_filter(struct dp_pdev *pdev,
  797. uint32_t peer_id, uint8_t *mac_addr)
  798. {
  799. bool found = false;
  800. found = dp_peer_tx_cap_search(pdev, peer_id, mac_addr);
  801. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  802. "%s: %d peer_id[%d] mac_addr[%pM] found[%d]!",
  803. __func__, __LINE__, peer_id, mac_addr, found);
  804. return found;
  805. }
  806. /**
  807. * dp_tx_ppdu_stats_attach - Initialize Tx PPDU stats and enhanced capture
  808. * @pdev: DP PDEV
  809. *
  810. * Return: none
  811. */
  812. void dp_tx_ppdu_stats_attach(struct dp_pdev *pdev)
  813. {
  814. struct dp_peer_mgmt_list *ptr_peer_mgmt_list;
  815. struct dp_pdev_tx_capture *tx_capture;
  816. int i, j;
  817. qdf_atomic_init(&pdev->tx_capture.tx_cap_usr_mode);
  818. qdf_atomic_set(&pdev->tx_capture.tx_cap_usr_mode, 0);
  819. tx_capture = &pdev->tx_capture;
  820. /* Work queue setup for HTT stats and tx capture handling */
  821. qdf_create_work(0, &pdev->tx_capture.ppdu_stats_work,
  822. dp_tx_ppdu_stats_process,
  823. pdev);
  824. pdev->tx_capture.ppdu_stats_workqueue =
  825. qdf_alloc_unbound_workqueue("ppdu_stats_work_queue");
  826. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_queue);
  827. STAILQ_INIT(&pdev->tx_capture.ppdu_stats_defer_queue);
  828. qdf_spinlock_create(&pdev->tx_capture.ppdu_stats_lock);
  829. pdev->tx_capture.ppdu_stats_queue_depth = 0;
  830. pdev->tx_capture.ppdu_stats_next_sched = 0;
  831. pdev->tx_capture.ppdu_stats_defer_queue_depth = 0;
  832. pdev->tx_capture.ppdu_dropped = 0;
  833. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  834. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  835. qdf_nbuf_queue_init(
  836. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  837. qdf_spinlock_create(
  838. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  839. }
  840. }
  841. qdf_mem_zero(&pdev->tx_capture.dummy_ppdu_desc,
  842. sizeof(struct cdp_tx_completion_ppdu));
  843. pdev->tx_capture.ptr_peer_mgmt_list = (struct dp_peer_mgmt_list *)
  844. qdf_mem_malloc(sizeof(struct dp_peer_mgmt_list) *
  845. MAX_MGMT_PEER_FILTER);
  846. for (i = 0; i < MAX_MGMT_PEER_FILTER; i++) {
  847. ptr_peer_mgmt_list = &tx_capture->ptr_peer_mgmt_list[i];
  848. ptr_peer_mgmt_list->avail = true;
  849. }
  850. }
  851. /**
  852. * dp_tx_ppdu_stats_detach - Cleanup Tx PPDU stats and enhanced capture
  853. * @pdev: DP PDEV
  854. *
  855. * Return: none
  856. */
  857. void dp_tx_ppdu_stats_detach(struct dp_pdev *pdev)
  858. {
  859. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  860. int i, j;
  861. if (!pdev || !pdev->tx_capture.ppdu_stats_workqueue)
  862. return;
  863. qdf_flush_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  864. qdf_destroy_workqueue(0, pdev->tx_capture.ppdu_stats_workqueue);
  865. qdf_spinlock_destroy(&pdev->tx_capture.ppdu_stats_lock);
  866. STAILQ_FOREACH_SAFE(ppdu_info,
  867. &pdev->tx_capture.ppdu_stats_queue,
  868. ppdu_info_queue_elem, tmp_ppdu_info) {
  869. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_queue,
  870. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  871. qdf_nbuf_free(ppdu_info->nbuf);
  872. qdf_mem_free(ppdu_info);
  873. }
  874. STAILQ_FOREACH_SAFE(ppdu_info,
  875. &pdev->tx_capture.ppdu_stats_defer_queue,
  876. ppdu_info_queue_elem, tmp_ppdu_info) {
  877. STAILQ_REMOVE(&pdev->tx_capture.ppdu_stats_defer_queue,
  878. ppdu_info, ppdu_info, ppdu_info_queue_elem);
  879. qdf_nbuf_free(ppdu_info->nbuf);
  880. qdf_mem_free(ppdu_info);
  881. }
  882. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  883. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  884. qdf_nbuf_queue_t *retries_q;
  885. qdf_spin_lock_bh(
  886. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  887. qdf_nbuf_queue_free(
  888. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  889. qdf_spin_unlock_bh(
  890. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  891. qdf_spinlock_destroy(
  892. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  893. retries_q = &pdev->tx_capture.retries_ctl_mgmt_q[i][j];
  894. if (!qdf_nbuf_is_queue_empty(retries_q))
  895. qdf_nbuf_queue_free(retries_q);
  896. }
  897. }
  898. qdf_mem_free(pdev->tx_capture.ptr_peer_mgmt_list);
  899. }
  900. #define MAX_MSDU_THRESHOLD_TSF 100000
  901. #define MAX_MSDU_ENQUEUE_THRESHOLD 4096
  902. /**
  903. * dp_drop_enq_msdu_on_thresh(): Function to drop msdu when exceed
  904. * storing threshold limit
  905. * @peer: dp_peer
  906. * @tx_tid: tx tid
  907. * @ptr_msdu_comp_q: pointer to skb queue, it can be either tasklet or WQ msdu q
  908. * @tsf: current timestamp
  909. *
  910. * return: status
  911. */
  912. QDF_STATUS
  913. dp_drop_enq_msdu_on_thresh(struct dp_peer *peer,
  914. struct dp_tx_tid *tx_tid,
  915. qdf_nbuf_queue_t *ptr_msdu_comp_q,
  916. uint32_t tsf)
  917. {
  918. struct msdu_completion_info *ptr_msdu_info = NULL;
  919. qdf_nbuf_t nbuf;
  920. qdf_nbuf_t head_msdu;
  921. uint32_t tsf_delta;
  922. uint32_t qlen;
  923. /* take lock here */
  924. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  925. while ((head_msdu = qdf_nbuf_queue_first(ptr_msdu_comp_q))) {
  926. ptr_msdu_info =
  927. (struct msdu_completion_info *)qdf_nbuf_data(head_msdu);
  928. if (tsf > ptr_msdu_info->tsf)
  929. tsf_delta = tsf - ptr_msdu_info->tsf;
  930. else
  931. tsf_delta = LOWER_32_MASK - ptr_msdu_info->tsf + tsf;
  932. if (tsf_delta < MAX_MSDU_THRESHOLD_TSF)
  933. break;
  934. /* free head */
  935. nbuf = qdf_nbuf_queue_remove(ptr_msdu_comp_q);
  936. if (qdf_unlikely(!nbuf)) {
  937. qdf_assert_always(0);
  938. break;
  939. }
  940. qdf_nbuf_free(nbuf);
  941. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_DROP, 1);
  942. }
  943. /* get queue length */
  944. qlen = qdf_nbuf_queue_len(ptr_msdu_comp_q);
  945. /* release lock here */
  946. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  947. /* take lock here */
  948. qdf_spin_lock_bh(&tx_tid->tid_lock);
  949. qlen += qdf_nbuf_queue_len(&tx_tid->defer_msdu_q);
  950. if (qlen > MAX_MSDU_ENQUEUE_THRESHOLD) {
  951. qdf_nbuf_t nbuf = NULL;
  952. /* free head, nbuf will be NULL if queue empty */
  953. nbuf = qdf_nbuf_queue_remove(&tx_tid->defer_msdu_q);
  954. /* release lock here */
  955. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  956. if (qdf_likely(nbuf)) {
  957. qdf_nbuf_free(nbuf);
  958. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_DROP, 1);
  959. return QDF_STATUS_SUCCESS;
  960. }
  961. /* take lock here */
  962. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  963. if (!qdf_nbuf_is_queue_empty(ptr_msdu_comp_q)) {
  964. /* free head, nbuf will be NULL if queue empty */
  965. nbuf = qdf_nbuf_queue_remove(ptr_msdu_comp_q);
  966. /* release lock here */
  967. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  968. if (qdf_unlikely(!nbuf)) {
  969. qdf_assert_always(0);
  970. return QDF_STATUS_E_ABORTED;
  971. }
  972. qdf_nbuf_free(nbuf);
  973. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_DROP, 1);
  974. } else {
  975. /* release lock here */
  976. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  977. }
  978. } else {
  979. /* release lock here */
  980. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  981. }
  982. return QDF_STATUS_SUCCESS;
  983. }
  984. /**
  985. * dp_update_msdu_to_list(): Function to queue msdu from wbm
  986. * @pdev: dp_pdev
  987. * @peer: dp_peer
  988. * @ts: hal tx completion status
  989. * @netbuf: msdu
  990. *
  991. * return: status
  992. */
  993. QDF_STATUS
  994. dp_update_msdu_to_list(struct dp_soc *soc,
  995. struct dp_pdev *pdev,
  996. struct dp_peer *peer,
  997. struct hal_tx_completion_status *ts,
  998. qdf_nbuf_t netbuf)
  999. {
  1000. struct dp_tx_tid *tx_tid;
  1001. struct msdu_completion_info *msdu_comp_info;
  1002. if (!peer) {
  1003. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1004. "%s: %d peer NULL !", __func__, __LINE__);
  1005. return QDF_STATUS_E_FAILURE;
  1006. }
  1007. if ((ts->tid > DP_MAX_TIDS) ||
  1008. (peer->bss_peer && ts->tid == DP_NON_QOS_TID)) {
  1009. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1010. "%s: %d peer_id %d, tid %d > NON_QOS_TID!",
  1011. __func__, __LINE__, ts->peer_id, ts->tid);
  1012. return QDF_STATUS_E_FAILURE;
  1013. }
  1014. tx_tid = &peer->tx_capture.tx_tid[ts->tid];
  1015. if (!tx_tid) {
  1016. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1017. "%s: %d tid[%d] NULL !", __func__, __LINE__, ts->tid);
  1018. return QDF_STATUS_E_FAILURE;
  1019. }
  1020. if (!qdf_nbuf_push_head(netbuf, sizeof(struct msdu_completion_info))) {
  1021. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  1022. FL("No headroom"));
  1023. return QDF_STATUS_E_NOMEM;
  1024. }
  1025. qdf_nbuf_unmap(soc->osdev, netbuf, QDF_DMA_TO_DEVICE);
  1026. msdu_comp_info = (struct msdu_completion_info *)qdf_nbuf_data(netbuf);
  1027. /* copy msdu_completion_info to control buffer */
  1028. msdu_comp_info->ppdu_id = ts->ppdu_id;
  1029. msdu_comp_info->peer_id = ts->peer_id;
  1030. msdu_comp_info->tid = ts->tid;
  1031. msdu_comp_info->first_msdu = ts->first_msdu;
  1032. msdu_comp_info->last_msdu = ts->last_msdu;
  1033. msdu_comp_info->msdu_part_of_amsdu = ts->msdu_part_of_amsdu;
  1034. msdu_comp_info->transmit_cnt = ts->transmit_cnt;
  1035. msdu_comp_info->tsf = ts->tsf;
  1036. msdu_comp_info->status = ts->status;
  1037. if (tx_tid->max_ppdu_id != ts->ppdu_id)
  1038. dp_drop_enq_msdu_on_thresh(peer, tx_tid, &tx_tid->msdu_comp_q,
  1039. ts->tsf);
  1040. /* lock here */
  1041. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  1042. /* add nbuf to tail queue per peer tid */
  1043. qdf_nbuf_queue_add(&tx_tid->msdu_comp_q, netbuf);
  1044. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_ENQ, 1);
  1045. /* unlock here */
  1046. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  1047. /* update max ppdu_id */
  1048. tx_tid->max_ppdu_id = ts->ppdu_id;
  1049. pdev->tx_capture.last_msdu_id = ts->ppdu_id;
  1050. pdev->tx_capture.last_peer_id = ts->peer_id;
  1051. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  1052. "msdu_completion: ppdu_id[%d] peer_id[%d] tid[%d] rel_src[%d] status[%d] tsf[%u] A[%d] CNT[%d]",
  1053. ts->ppdu_id, ts->peer_id, ts->tid, ts->release_src,
  1054. ts->status, ts->tsf, ts->msdu_part_of_amsdu,
  1055. ts->transmit_cnt);
  1056. return QDF_STATUS_SUCCESS;
  1057. }
  1058. /**
  1059. * dp_tx_add_to_comp_queue() - add completion msdu to queue
  1060. * @soc: DP Soc handle
  1061. * @tx_desc: software Tx descriptor
  1062. * @ts: Tx completion status from HAL/HTT descriptor
  1063. * @peer: DP peer
  1064. *
  1065. * Return: none
  1066. */
  1067. QDF_STATUS dp_tx_add_to_comp_queue(struct dp_soc *soc,
  1068. struct dp_tx_desc_s *desc,
  1069. struct hal_tx_completion_status *ts,
  1070. struct dp_peer *peer)
  1071. {
  1072. int ret = QDF_STATUS_E_FAILURE;
  1073. struct dp_pdev *pdev = desc->pdev;
  1074. if (peer &&
  1075. dp_peer_or_pdev_tx_cap_enabled(pdev, peer, peer->mac_addr.raw) &&
  1076. ((ts->status == HAL_TX_TQM_RR_FRAME_ACKED) ||
  1077. (ts->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  1078. ((ts->status == HAL_TX_TQM_RR_REM_CMD_AGED) && ts->transmit_cnt))) {
  1079. if (qdf_unlikely(desc->pkt_offset != 0) &&
  1080. (qdf_nbuf_pull_head(
  1081. desc->nbuf, desc->pkt_offset) == NULL)) {
  1082. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1083. QDF_TRACE_LEVEL_ERROR,
  1084. "netbuf %pK offset %d",
  1085. desc->nbuf, desc->pkt_offset);
  1086. return ret;
  1087. }
  1088. ret = dp_update_msdu_to_list(soc, pdev, peer, ts, desc->nbuf);
  1089. }
  1090. return ret;
  1091. }
  1092. /**
  1093. * dp_process_ppdu_stats_update_failed_bitmap(): update failed bitmap
  1094. * @pdev: dp_pdev
  1095. * @data: tx completion ppdu desc
  1096. * @ppdu_id: ppdu id
  1097. * @size: size of bitmap
  1098. *
  1099. * return: status
  1100. */
  1101. void dp_process_ppdu_stats_update_failed_bitmap(struct dp_pdev *pdev,
  1102. void *data,
  1103. uint32_t ppdu_id,
  1104. uint32_t size)
  1105. {
  1106. struct cdp_tx_completion_ppdu_user *user;
  1107. uint32_t mpdu_tried;
  1108. uint32_t ba_seq_no;
  1109. uint32_t start_seq;
  1110. uint32_t num_mpdu;
  1111. uint32_t diff;
  1112. uint32_t carry = 0;
  1113. uint32_t bitmask = 0;
  1114. uint32_t i;
  1115. uint32_t k;
  1116. uint32_t ba_bitmap = 0;
  1117. int last_set_bit;
  1118. user = (struct cdp_tx_completion_ppdu_user *)data;
  1119. /* get number of mpdu from ppdu_desc */
  1120. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  1121. ba_seq_no = user->ba_seq_no;
  1122. start_seq = user->start_seq;
  1123. num_mpdu = user->num_mpdu;
  1124. /* assumption: number of mpdu will be less than 32 */
  1125. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  1126. "ppdu_id[%d] ba_seq_no[%d] start_seq_no[%d] mpdu_tried[%d]",
  1127. ppdu_id, ba_seq_no, start_seq, mpdu_tried);
  1128. for (i = 0; i < size; i++) {
  1129. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  1130. "ppdu_id[%d] ba_bitmap[%x] enqueue_bitmap[%x]",
  1131. ppdu_id, user->ba_bitmap[i], user->enq_bitmap[i]);
  1132. }
  1133. /* Handle sequence no. wraparound */
  1134. if (start_seq <= ba_seq_no) {
  1135. diff = ba_seq_no - start_seq;
  1136. /* Sequence delta of more than 2048 is considered wraparound
  1137. * and we extend start_seq to be more than ba_seq just to
  1138. * adjust failed_bitmap
  1139. */
  1140. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  1141. diff = (start_seq - ba_seq_no) &
  1142. (IEEE80211_SEQ_MAX - 1);
  1143. start_seq = ba_seq_no + diff;
  1144. }
  1145. } else {
  1146. diff = start_seq - ba_seq_no;
  1147. /* Sequence delta of more than 2048 is considered wraparound
  1148. * and we extend ba_seq to be more than start_seq just to
  1149. * adjust failed_bitmap
  1150. */
  1151. if (qdf_unlikely(diff > (IEEE80211_SEQ_MAX / 2))) {
  1152. diff = (ba_seq_no - start_seq) &
  1153. (IEEE80211_SEQ_MAX - 1);
  1154. ba_seq_no = start_seq + diff;
  1155. }
  1156. }
  1157. /* Adjust failed_bitmap to start from same seq_no as enq_bitmap */
  1158. last_set_bit = 0;
  1159. if (start_seq <= ba_seq_no) {
  1160. bitmask = (1 << diff) - 1;
  1161. for (i = 0; i < size; i++) {
  1162. ba_bitmap = user->ba_bitmap[i];
  1163. user->failed_bitmap[i] = (ba_bitmap << diff);
  1164. user->failed_bitmap[i] |= (bitmask & carry);
  1165. carry = ((ba_bitmap & (bitmask << (32 - diff))) >>
  1166. (32 - diff));
  1167. user->failed_bitmap[i] = user->enq_bitmap[i] &
  1168. user->failed_bitmap[i];
  1169. if (user->enq_bitmap[i]) {
  1170. last_set_bit = i * 32 +
  1171. qdf_fls(user->enq_bitmap[i]) - 1;
  1172. }
  1173. }
  1174. } else {
  1175. /* array index */
  1176. k = diff >> 5;
  1177. diff = diff & 0x1F;
  1178. bitmask = (1 << diff) - 1;
  1179. for (i = 0; i < size; i++, k++) {
  1180. ba_bitmap = user->ba_bitmap[k];
  1181. user->failed_bitmap[i] = ba_bitmap >> diff;
  1182. /* get next ba_bitmap */
  1183. ba_bitmap = user->ba_bitmap[k + 1];
  1184. carry = (ba_bitmap & bitmask);
  1185. user->failed_bitmap[i] |=
  1186. ((carry & bitmask) << (32 - diff));
  1187. user->failed_bitmap[i] = user->enq_bitmap[i] &
  1188. user->failed_bitmap[i];
  1189. if (user->enq_bitmap[i]) {
  1190. last_set_bit = i * 32 +
  1191. qdf_fls(user->enq_bitmap[i]) - 1;
  1192. }
  1193. }
  1194. }
  1195. user->last_enq_seq = user->start_seq + last_set_bit;
  1196. user->ba_size = user->last_enq_seq - user->start_seq + 1;
  1197. }
  1198. /*
  1199. * dp_soc_set_txrx_ring_map_single()
  1200. * @dp_soc: DP handler for soc
  1201. *
  1202. * Return: Void
  1203. */
  1204. static void dp_soc_set_txrx_ring_map_single(struct dp_soc *soc)
  1205. {
  1206. uint32_t i;
  1207. for (i = 0; i < WLAN_CFG_INT_NUM_CONTEXTS; i++) {
  1208. soc->tx_ring_map[i] =
  1209. dp_cpu_ring_map[DP_SINGLE_TX_RING_MAP][i];
  1210. }
  1211. }
  1212. /*
  1213. * dp_iterate_free_peer_msdu_q()- API to free msdu queue
  1214. * @pdev_handle: DP_PDEV handle
  1215. *
  1216. * Return: void
  1217. */
  1218. static void dp_iterate_free_peer_msdu_q(void *pdev_hdl)
  1219. {
  1220. struct dp_pdev *pdev = (struct dp_pdev *)pdev_hdl;
  1221. struct dp_soc *soc = pdev->soc;
  1222. struct dp_vdev *vdev = NULL;
  1223. struct dp_peer *peer = NULL;
  1224. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  1225. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  1226. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  1227. DP_VDEV_ITERATE_PEER_LIST(vdev, peer) {
  1228. /* set peer tx cap enabled to 0, when feature disable */
  1229. peer->tx_cap_enabled = 0;
  1230. dp_peer_tid_queue_cleanup(peer);
  1231. }
  1232. }
  1233. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  1234. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  1235. }
  1236. /*
  1237. * dp_soc_check_enh_tx_capture() - API to get tx capture set in any pdev
  1238. * @soc_handle: DP_SOC handle
  1239. *
  1240. * return: true
  1241. */
  1242. uint8_t
  1243. dp_soc_is_tx_capture_set_in_pdev(struct dp_soc *soc)
  1244. {
  1245. struct dp_pdev *pdev;
  1246. uint8_t pdev_tx_capture = 0;
  1247. uint8_t i;
  1248. for (i = 0; i < MAX_PDEV_CNT; i++) {
  1249. pdev = soc->pdev_list[i];
  1250. if (!pdev)
  1251. continue;
  1252. if (!pdev->tx_capture_enabled)
  1253. continue;
  1254. pdev_tx_capture++;
  1255. }
  1256. return pdev_tx_capture;
  1257. }
  1258. /*
  1259. * dp_enh_tx_capture_disable()- API to disable enhanced tx capture
  1260. * @pdev_handle: DP_PDEV handle
  1261. * Return: void
  1262. */
  1263. void
  1264. dp_enh_tx_capture_disable(struct dp_pdev *pdev)
  1265. {
  1266. int i, j;
  1267. if (!dp_soc_is_tx_capture_set_in_pdev(pdev->soc))
  1268. dp_soc_set_txrx_ring_map(pdev->soc);
  1269. dp_h2t_cfg_stats_msg_send(pdev,
  1270. DP_PPDU_STATS_CFG_ENH_STATS,
  1271. pdev->pdev_id);
  1272. dp_iterate_free_peer_msdu_q(pdev);
  1273. for (i = 0; i < TXCAP_MAX_TYPE; i++) {
  1274. for (j = 0; j < TXCAP_MAX_SUBTYPE; j++) {
  1275. qdf_nbuf_queue_t *retries_q;
  1276. qdf_spin_lock_bh(
  1277. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  1278. qdf_nbuf_queue_free(
  1279. &pdev->tx_capture.ctl_mgmt_q[i][j]);
  1280. qdf_spin_unlock_bh(
  1281. &pdev->tx_capture.ctl_mgmt_lock[i][j]);
  1282. retries_q = &pdev->tx_capture.retries_ctl_mgmt_q[i][j];
  1283. if (!qdf_nbuf_is_queue_empty(retries_q))
  1284. qdf_nbuf_queue_free(retries_q);
  1285. }
  1286. }
  1287. dp_peer_tx_cap_del_all_filter(pdev);
  1288. pdev->tx_capture_enabled = CDP_TX_ENH_CAPTURE_DISABLED;
  1289. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  1290. "Mode change request done cur mode - %d user_mode - %d\n",
  1291. pdev->tx_capture_enabled, CDP_TX_ENH_CAPTURE_DISABLED);
  1292. }
  1293. /*
  1294. * dp_enh_tx_capture_enable()- API to disable enhanced tx capture
  1295. * @pdev_handle: DP_PDEV handle
  1296. * @user_mode: user mode
  1297. *
  1298. * Return: void
  1299. */
  1300. void
  1301. dp_enh_tx_capture_enable(struct dp_pdev *pdev, uint8_t user_mode)
  1302. {
  1303. if (dp_soc_is_tx_capture_set_in_pdev(pdev->soc) == 1)
  1304. dp_soc_set_txrx_ring_map_single(pdev->soc);
  1305. if (!pdev->pktlog_ppdu_stats)
  1306. dp_h2t_cfg_stats_msg_send(pdev,
  1307. DP_PPDU_STATS_CFG_SNIFFER,
  1308. pdev->pdev_id);
  1309. pdev->tx_capture_enabled = user_mode;
  1310. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  1311. "Mode change request done cur mode - %d user_mode - %d\n",
  1312. pdev->tx_capture_enabled, user_mode);
  1313. }
  1314. /*
  1315. * dp_enh_tx_cap_mode_change()- API to enable/disable enhanced tx capture
  1316. * @pdev_handle: DP_PDEV handle
  1317. * @user_mode: user provided value
  1318. *
  1319. * Return: void
  1320. */
  1321. static void
  1322. dp_enh_tx_cap_mode_change(struct dp_pdev *pdev, uint8_t user_mode)
  1323. {
  1324. if (user_mode == CDP_TX_ENH_CAPTURE_DISABLED) {
  1325. dp_enh_tx_capture_disable(pdev);
  1326. } else {
  1327. dp_enh_tx_capture_enable(pdev, user_mode);
  1328. }
  1329. }
  1330. /*
  1331. * dp_config_enh_tx_capture()- API to enable/disable enhanced tx capture
  1332. * @pdev_handle: DP_PDEV handle
  1333. * @val: user provided value
  1334. *
  1335. * Return: QDF_STATUS
  1336. */
  1337. QDF_STATUS
  1338. dp_config_enh_tx_capture(struct dp_pdev *pdev, uint8_t val)
  1339. {
  1340. qdf_atomic_set(&pdev->tx_capture.tx_cap_usr_mode, val);
  1341. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_LOW,
  1342. "User mode change requested - %d\n",
  1343. qdf_atomic_read(&pdev->tx_capture.tx_cap_usr_mode));
  1344. return QDF_STATUS_SUCCESS;
  1345. }
  1346. /**
  1347. * get_number_of_1s(): Function to get number of 1s
  1348. * @value: value to find
  1349. *
  1350. * return: number of 1s
  1351. */
  1352. static
  1353. inline uint32_t get_number_of_1s(uint32_t value)
  1354. {
  1355. uint32_t shift[] = {1, 2, 4, 8, 16};
  1356. uint32_t magic_number[] = { 0x55555555, 0x33333333, 0x0F0F0F0F,
  1357. 0x00FF00FF, 0x0000FFFF};
  1358. uint8_t k = 0;
  1359. for (; k <= 4; k++) {
  1360. value = (value & magic_number[k]) +
  1361. ((value >> shift[k]) & magic_number[k]);
  1362. }
  1363. return value;
  1364. }
  1365. /**
  1366. * dp_tx_print_bitmap(): Function to print bitmap
  1367. * @pdev: dp_pdev
  1368. * @ppdu_desc: ppdu completion descriptor
  1369. * @user_inder: user index
  1370. * @ppdu_id: ppdu id
  1371. *
  1372. * return: status
  1373. */
  1374. static
  1375. QDF_STATUS dp_tx_print_bitmap(struct dp_pdev *pdev,
  1376. struct cdp_tx_completion_ppdu *ppdu_desc,
  1377. uint32_t user_index,
  1378. uint32_t ppdu_id)
  1379. {
  1380. struct cdp_tx_completion_ppdu_user *user;
  1381. uint8_t i;
  1382. uint32_t mpdu_tried;
  1383. uint32_t ba_seq_no;
  1384. uint32_t start_seq;
  1385. uint32_t num_mpdu;
  1386. uint32_t fail_num_mpdu = 0;
  1387. user = &ppdu_desc->user[user_index];
  1388. /* get number of mpdu from ppdu_desc */
  1389. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  1390. ba_seq_no = user->ba_seq_no;
  1391. start_seq = user->start_seq;
  1392. num_mpdu = user->mpdu_success;
  1393. if (user->tid > DP_MAX_TIDS) {
  1394. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1395. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  1396. __func__, ppdu_id, user->peer_id, user->tid);
  1397. return QDF_STATUS_E_FAILURE;
  1398. }
  1399. if (mpdu_tried != num_mpdu) {
  1400. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO,
  1401. "%s: ppdu[%d] peer[%d] tid[%d] ba[%d] start[%d] mpdu_tri[%d] num_mpdu[%d] is_mcast[%d]",
  1402. __func__, ppdu_id, user->peer_id, user->tid,
  1403. ba_seq_no, start_seq, mpdu_tried,
  1404. num_mpdu, user->is_mcast);
  1405. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++) {
  1406. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1407. QDF_TRACE_LEVEL_INFO,
  1408. "ppdu_id[%d] ba_bitmap[0x%x] enqueue_bitmap[0x%x] failed_bitmap[0x%x]",
  1409. ppdu_id, user->ba_bitmap[i],
  1410. user->enq_bitmap[i],
  1411. user->failed_bitmap[i]);
  1412. fail_num_mpdu +=
  1413. get_number_of_1s(user->failed_bitmap[i]);
  1414. }
  1415. }
  1416. if (fail_num_mpdu == num_mpdu && num_mpdu)
  1417. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  1418. "%s: %d ppdu_id[%d] num_mpdu[%d, %d]",
  1419. __func__, __LINE__, ppdu_id, num_mpdu, fail_num_mpdu);
  1420. return QDF_STATUS_SUCCESS;
  1421. }
  1422. /**
  1423. * dp_ppdu_desc_debug_print(): Function to print ppdu_desc
  1424. * @ppdu_desc: ppdu desc pointer
  1425. * @usr_idx: user index
  1426. * @func: caller function name
  1427. * @line: caller function line number
  1428. *
  1429. * return: void
  1430. */
  1431. void dp_ppdu_desc_debug_print(struct cdp_tx_completion_ppdu *ppdu_desc,
  1432. uint8_t usr_idx, const char *func, uint32_t line)
  1433. {
  1434. struct cdp_tx_completion_ppdu_user *user;
  1435. uint8_t num_users;
  1436. num_users = ppdu_desc->num_users;
  1437. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_MED,
  1438. "%s: %d PID: %d, BPID: %d SCHED: %d usr_idx: %d TLV_BITMAP[0x%x] num_users:%d",
  1439. func, line,
  1440. ppdu_desc->ppdu_id, ppdu_desc->bar_ppdu_id,
  1441. ppdu_desc->sched_cmdid,
  1442. usr_idx, ppdu_desc->tlv_bitmap, ppdu_desc->num_users);
  1443. user = &ppdu_desc->user[usr_idx];
  1444. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_INFO_MED,
  1445. "%s: %d P[%d] CS:%d S_SEQ: %d L_ENQ_SEQ:%d BA_SEQ:%d BA_SZ:%d M[TRI: %d, SUC: %d] ENQ[%x:%x:%x:%x] BA[%x:%x:%x:%x] F[%x:%x:%x:%x] tlv[0x%x]",
  1446. func, line, user->peer_id,
  1447. user->completion_status,
  1448. user->start_seq, user->last_enq_seq,
  1449. user->ba_seq_no, user->ba_size,
  1450. user->mpdu_tried_ucast + user->mpdu_tried_mcast,
  1451. user->mpdu_success,
  1452. user->enq_bitmap[0], user->enq_bitmap[1],
  1453. user->enq_bitmap[2], user->enq_bitmap[3],
  1454. user->ba_bitmap[0], user->ba_bitmap[1],
  1455. user->ba_bitmap[2], user->ba_bitmap[3],
  1456. user->failed_bitmap[0], user->failed_bitmap[1],
  1457. user->failed_bitmap[2], user->failed_bitmap[3],
  1458. user->tlv_bitmap);
  1459. }
  1460. /*
  1461. * dp_peer_tx_wds_addr_add() – Update WDS peer to include 4th address
  1462. * @peer: Datapath peer
  1463. * @addr4_mac_addr: Source MAC address for WDS TX
  1464. *
  1465. */
  1466. static
  1467. void dp_peer_tx_wds_addr_add(struct dp_peer *peer, uint8_t *addr4_mac_addr)
  1468. {
  1469. struct ieee80211_frame_addr4 *ptr_wh;
  1470. if (!peer)
  1471. return;
  1472. ptr_wh = &peer->tx_capture.tx_wifi_addr4_hdr;
  1473. qdf_mem_copy(ptr_wh->i_addr4,
  1474. addr4_mac_addr,
  1475. QDF_MAC_ADDR_SIZE);
  1476. }
  1477. /*
  1478. * dp_peer_tx_update_80211_wds_hdr() – Update 80211 frame header to include a
  1479. * 4 address frame, and set QoS related information if necessary
  1480. * @pdev: Physical device reference
  1481. * @peer: Datapath peer
  1482. * @data: ppdu_descriptor
  1483. * @nbuf: 802.11 frame
  1484. * @ether_type: ethernet type
  1485. * @src_addr: ether shost address
  1486. * @usr_idx: user index
  1487. *
  1488. */
  1489. static uint32_t dp_tx_update_80211_wds_hdr(struct dp_pdev *pdev,
  1490. struct dp_peer *peer,
  1491. void *data,
  1492. qdf_nbuf_t nbuf,
  1493. uint16_t ether_type,
  1494. uint8_t *src_addr,
  1495. uint8_t usr_idx)
  1496. {
  1497. struct cdp_tx_completion_ppdu *ppdu_desc;
  1498. struct cdp_tx_completion_ppdu_user *user;
  1499. uint32_t mpdu_buf_len, frame_size;
  1500. uint8_t *ptr_hdr;
  1501. uint16_t eth_type = qdf_htons(ether_type);
  1502. struct ieee80211_qosframe_addr4 *ptr_wh;
  1503. ppdu_desc = (struct cdp_tx_completion_ppdu *)data;
  1504. user = &ppdu_desc->user[usr_idx];
  1505. ptr_wh = &peer->tx_capture.tx_wifi_addr4_qos_hdr;
  1506. /*
  1507. * update framectrl only for first ppdu_id
  1508. * rest of mpdu will have same frame ctrl
  1509. * mac address and duration
  1510. */
  1511. if (ppdu_desc->ppdu_id != peer->tx_capture.tx_wifi_ppdu_id) {
  1512. ptr_wh->i_fc[1] = (ppdu_desc->frame_ctrl & 0xFF00) >> 8;
  1513. ptr_wh->i_fc[0] = (ppdu_desc->frame_ctrl & 0xFF);
  1514. ptr_wh->i_dur[1] = (ppdu_desc->tx_duration & 0xFF00) >> 8;
  1515. ptr_wh->i_dur[0] = (ppdu_desc->tx_duration & 0xFF);
  1516. ptr_wh->i_qos[1] = (user->qos_ctrl & 0xFF00) >> 8;
  1517. ptr_wh->i_qos[0] = (user->qos_ctrl & 0xFF);
  1518. /* Update Addr 3 (SA) with SA derived from ether packet */
  1519. qdf_mem_copy(ptr_wh->i_addr3, src_addr, QDF_MAC_ADDR_SIZE);
  1520. peer->tx_capture.tx_wifi_ppdu_id = ppdu_desc->ppdu_id;
  1521. }
  1522. frame_size = (user->tid != DP_NON_QOS_TID) ?
  1523. sizeof(struct ieee80211_qosframe_addr4) :
  1524. sizeof(struct ieee80211_frame_addr4);
  1525. mpdu_buf_len = frame_size + LLC_SNAP_HDR_LEN;
  1526. nbuf->protocol = qdf_htons(ETH_P_802_2);
  1527. /* update ieee80211_frame header */
  1528. if (!qdf_nbuf_push_head(nbuf, mpdu_buf_len)) {
  1529. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1530. FL("No headroom"));
  1531. return QDF_STATUS_E_NOMEM;
  1532. }
  1533. ptr_hdr = (void *)qdf_nbuf_data(nbuf);
  1534. qdf_mem_copy(ptr_hdr, ptr_wh, frame_size);
  1535. ptr_hdr = ptr_hdr + frame_size;
  1536. /* update LLC */
  1537. *ptr_hdr = LLC_SNAP_LSAP;
  1538. *(ptr_hdr + 1) = LLC_SNAP_LSAP;
  1539. *(ptr_hdr + 2) = LLC_UI;
  1540. *(ptr_hdr + 3) = 0x00;
  1541. *(ptr_hdr + 4) = 0x00;
  1542. *(ptr_hdr + 5) = 0x00;
  1543. *(ptr_hdr + 6) = (eth_type & 0xFF00) >> 8;
  1544. *(ptr_hdr + 7) = (eth_type & 0xFF);
  1545. qdf_nbuf_trim_tail(nbuf, qdf_nbuf_len(nbuf) - mpdu_buf_len);
  1546. return 0;
  1547. }
  1548. /**
  1549. * dp_tx_update_80211_hdr() – Update 80211 frame header to set QoS
  1550. * related information if necessary
  1551. * @pdev: Physical device reference
  1552. * @peer: Datapath peer
  1553. * @data: ppdu_descriptor
  1554. * @nbuf: 802.11 frame
  1555. * @ether_type: ethernet type
  1556. * @src_addr: ether shost address
  1557. *
  1558. */
  1559. static uint32_t dp_tx_update_80211_hdr(struct dp_pdev *pdev,
  1560. struct dp_peer *peer,
  1561. void *data,
  1562. qdf_nbuf_t nbuf,
  1563. uint16_t ether_type,
  1564. uint8_t *src_addr,
  1565. uint8_t usr_idx)
  1566. {
  1567. struct cdp_tx_completion_ppdu *ppdu_desc;
  1568. struct cdp_tx_completion_ppdu_user *user;
  1569. uint32_t mpdu_buf_len, frame_size;
  1570. uint8_t *ptr_hdr;
  1571. uint16_t eth_type = qdf_htons(ether_type);
  1572. struct ieee80211_qosframe *ptr_wh;
  1573. ppdu_desc = (struct cdp_tx_completion_ppdu *)data;
  1574. user = &ppdu_desc->user[usr_idx];
  1575. ptr_wh = &peer->tx_capture.tx_wifi_qos_hdr;
  1576. /*
  1577. * update framectrl only for first ppdu_id
  1578. * rest of mpdu will have same frame ctrl
  1579. * mac address and duration
  1580. */
  1581. if (ppdu_desc->ppdu_id != peer->tx_capture.tx_wifi_ppdu_id) {
  1582. ptr_wh->i_fc[1] = (user->frame_ctrl & 0xFF00) >> 8;
  1583. ptr_wh->i_fc[0] = (user->frame_ctrl & 0xFF);
  1584. ptr_wh->i_dur[1] = (ppdu_desc->tx_duration & 0xFF00) >> 8;
  1585. ptr_wh->i_dur[0] = (ppdu_desc->tx_duration & 0xFF);
  1586. ptr_wh->i_qos[1] = (user->qos_ctrl & 0xFF00) >> 8;
  1587. ptr_wh->i_qos[0] = (user->qos_ctrl & 0xFF);
  1588. /* Update Addr 3 (SA) with SA derived from ether packet */
  1589. qdf_mem_copy(ptr_wh->i_addr3, src_addr, QDF_MAC_ADDR_SIZE);
  1590. peer->tx_capture.tx_wifi_ppdu_id = ppdu_desc->ppdu_id;
  1591. }
  1592. frame_size = (user->tid != DP_NON_QOS_TID) ?
  1593. sizeof(struct ieee80211_qosframe) :
  1594. sizeof(struct ieee80211_frame);
  1595. mpdu_buf_len = frame_size + LLC_SNAP_HDR_LEN;
  1596. nbuf->protocol = qdf_htons(ETH_P_802_2);
  1597. /* update ieee80211_frame header */
  1598. if (!qdf_nbuf_push_head(nbuf, mpdu_buf_len)) {
  1599. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  1600. FL("No headroom"));
  1601. return QDF_STATUS_E_NOMEM;
  1602. }
  1603. ptr_hdr = (void *)qdf_nbuf_data(nbuf);
  1604. qdf_mem_copy(ptr_hdr, ptr_wh, frame_size);
  1605. ptr_hdr = ptr_hdr + frame_size;
  1606. /* update LLC */
  1607. *ptr_hdr = LLC_SNAP_LSAP;
  1608. *(ptr_hdr + 1) = LLC_SNAP_LSAP;
  1609. *(ptr_hdr + 2) = LLC_UI;
  1610. *(ptr_hdr + 3) = 0x00;
  1611. *(ptr_hdr + 4) = 0x00;
  1612. *(ptr_hdr + 5) = 0x00;
  1613. *(ptr_hdr + 6) = (eth_type & 0xFF00) >> 8;
  1614. *(ptr_hdr + 7) = (eth_type & 0xFF);
  1615. qdf_nbuf_trim_tail(nbuf, qdf_nbuf_len(nbuf) - mpdu_buf_len);
  1616. return 0;
  1617. }
  1618. /**
  1619. * dp_tx_mon_restitch_mpdu(): Function to restitch msdu to mpdu
  1620. * @pdev: dp_pdev
  1621. * @peer: dp_peer
  1622. * @head_msdu: head msdu queue
  1623. *
  1624. * return: status
  1625. */
  1626. static uint32_t
  1627. dp_tx_mon_restitch_mpdu(struct dp_pdev *pdev, struct dp_peer *peer,
  1628. struct cdp_tx_completion_ppdu *ppdu_desc,
  1629. qdf_nbuf_queue_t *head_msdu,
  1630. qdf_nbuf_queue_t *mpdu_q, uint8_t usr_idx)
  1631. {
  1632. qdf_nbuf_t curr_nbuf = NULL;
  1633. qdf_nbuf_t first_nbuf = NULL;
  1634. qdf_nbuf_t prev_nbuf = NULL;
  1635. qdf_nbuf_t mpdu_nbuf = NULL;
  1636. struct msdu_completion_info *ptr_msdu_info = NULL;
  1637. uint8_t first_msdu = 0;
  1638. uint8_t last_msdu = 0;
  1639. uint32_t frag_list_sum_len = 0;
  1640. uint8_t first_msdu_not_seen = 1;
  1641. uint16_t ether_type = 0;
  1642. qdf_ether_header_t *eh = NULL;
  1643. size_t msdu_comp_info_sz;
  1644. size_t ether_hdr_sz;
  1645. if (qdf_nbuf_is_queue_empty(head_msdu))
  1646. return 0;
  1647. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  1648. while (curr_nbuf) {
  1649. ptr_msdu_info =
  1650. (struct msdu_completion_info *)qdf_nbuf_data(curr_nbuf);
  1651. first_msdu = ptr_msdu_info->first_msdu;
  1652. last_msdu = ptr_msdu_info->last_msdu;
  1653. eh = (qdf_ether_header_t *)(curr_nbuf->data +
  1654. sizeof(struct msdu_completion_info));
  1655. ether_type = eh->ether_type;
  1656. msdu_comp_info_sz = sizeof(struct msdu_completion_info);
  1657. /* pull msdu_completion_info added in pre header */
  1658. if (NULL == qdf_nbuf_pull_head(curr_nbuf, msdu_comp_info_sz)) {
  1659. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1660. QDF_TRACE_LEVEL_FATAL,
  1661. " No Head space to pull !!\n");
  1662. qdf_assert_always(0);
  1663. }
  1664. if ((qdf_likely((peer->vdev->tx_encap_type !=
  1665. htt_cmn_pkt_type_raw))) &&
  1666. ((ppdu_desc->frame_ctrl & IEEE80211_FC1_DIR_MASK) &&
  1667. (IEEE80211_FC1_DIR_TODS | IEEE80211_FC1_DIR_FROMDS)))
  1668. dp_peer_tx_wds_addr_add(peer, eh->ether_shost);
  1669. if (first_msdu && first_msdu_not_seen) {
  1670. first_nbuf = curr_nbuf;
  1671. frag_list_sum_len = 0;
  1672. first_msdu_not_seen = 0;
  1673. ether_hdr_sz = sizeof(qdf_ether_header_t);
  1674. /* pull ethernet header from first MSDU alone */
  1675. if (NULL == qdf_nbuf_pull_head(curr_nbuf,
  1676. ether_hdr_sz)) {
  1677. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1678. QDF_TRACE_LEVEL_FATAL,
  1679. " No Head space to pull !!\n");
  1680. qdf_assert_always(0);
  1681. }
  1682. /* update first buffer to previous buffer */
  1683. prev_nbuf = curr_nbuf;
  1684. } else if (first_msdu && !first_msdu_not_seen) {
  1685. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1686. QDF_TRACE_LEVEL_ERROR,
  1687. "!!!!! NO LAST MSDU\n");
  1688. /*
  1689. * no last msdu in a mpdu
  1690. * handle this case
  1691. */
  1692. qdf_nbuf_free(curr_nbuf);
  1693. /*
  1694. * No last msdu found because WBM comes out
  1695. * of order, free the pkt
  1696. */
  1697. goto free_ppdu_desc_mpdu_q;
  1698. } else if (!first_msdu && first_msdu_not_seen) {
  1699. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1700. QDF_TRACE_LEVEL_ERROR,
  1701. "!!!!! NO FIRST MSDU\n");
  1702. /*
  1703. * no first msdu in a mpdu
  1704. * handle this case
  1705. */
  1706. qdf_nbuf_free(curr_nbuf);
  1707. /*
  1708. * no first msdu found beacuse WBM comes out
  1709. * of order, free the pkt
  1710. */
  1711. goto free_ppdu_desc_mpdu_q;
  1712. } else {
  1713. /* update current buffer to previous buffer next */
  1714. prev_nbuf->next = curr_nbuf;
  1715. /* move the previous buffer to next buffer */
  1716. prev_nbuf = prev_nbuf->next;
  1717. }
  1718. frag_list_sum_len += qdf_nbuf_len(curr_nbuf);
  1719. if (last_msdu) {
  1720. mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  1721. MAX_MONITOR_HEADER,
  1722. MAX_MONITOR_HEADER,
  1723. 4, FALSE);
  1724. if (!mpdu_nbuf) {
  1725. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1726. QDF_TRACE_LEVEL_ERROR,
  1727. "MPDU head allocation failed !!!");
  1728. goto free_ppdu_desc_mpdu_q;
  1729. }
  1730. if (((ppdu_desc->frame_ctrl & IEEE80211_FC1_DIR_MASK) &&
  1731. (IEEE80211_FC1_DIR_TODS |
  1732. IEEE80211_FC1_DIR_FROMDS))) {
  1733. dp_tx_update_80211_wds_hdr(pdev, peer,
  1734. ppdu_desc, mpdu_nbuf,
  1735. ether_type,
  1736. eh->ether_shost,
  1737. usr_idx);
  1738. } else {
  1739. dp_tx_update_80211_hdr(pdev, peer,
  1740. ppdu_desc, mpdu_nbuf,
  1741. ether_type,
  1742. eh->ether_shost,
  1743. usr_idx);
  1744. }
  1745. /*
  1746. * first nbuf will hold list of msdu
  1747. * stored in prev_nbuf
  1748. */
  1749. qdf_nbuf_append_ext_list(mpdu_nbuf,
  1750. first_nbuf,
  1751. frag_list_sum_len);
  1752. /* add mpdu to mpdu queue */
  1753. qdf_nbuf_queue_add(mpdu_q, mpdu_nbuf);
  1754. first_nbuf = NULL;
  1755. mpdu_nbuf = NULL;
  1756. /* next msdu will start with first msdu */
  1757. first_msdu_not_seen = 1;
  1758. goto check_for_next_msdu;
  1759. }
  1760. /* get next msdu from the head_msdu */
  1761. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  1762. if (!curr_nbuf) {
  1763. /* msdu missed in list */
  1764. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  1765. QDF_TRACE_LEVEL_ERROR,
  1766. "!!!! WAITING for msdu but list empty !!!!");
  1767. /* for incomplete list, free up the queue */
  1768. goto free_ppdu_desc_mpdu_q;
  1769. }
  1770. continue;
  1771. check_for_next_msdu:
  1772. if (qdf_nbuf_is_queue_empty(head_msdu))
  1773. return 0;
  1774. curr_nbuf = qdf_nbuf_queue_remove(head_msdu);
  1775. }
  1776. return 0;
  1777. free_ppdu_desc_mpdu_q:
  1778. /* free already chained msdu pkt */
  1779. while (first_nbuf) {
  1780. curr_nbuf = first_nbuf;
  1781. first_nbuf = first_nbuf->next;
  1782. qdf_nbuf_free(curr_nbuf);
  1783. }
  1784. /* free allocated mpdu hdr */
  1785. if (mpdu_nbuf)
  1786. qdf_nbuf_free(mpdu_nbuf);
  1787. /* free queued remaining msdu pkt per ppdu */
  1788. qdf_nbuf_queue_free(head_msdu);
  1789. /* free queued mpdu per ppdu */
  1790. qdf_nbuf_queue_free(mpdu_q);
  1791. return 0;
  1792. }
  1793. /**
  1794. * dp_tx_msdu_dequeue(): Function to dequeue msdu from peer based tid
  1795. * @peer: dp_peer
  1796. * @ppdu_id: ppdu_id
  1797. * @tid: tid
  1798. * @num_msdu: number of msdu
  1799. * @head: head queue
  1800. * @start_tsf: start tsf from ppdu_desc
  1801. * @end_tsf: end tsf from ppdu_desc
  1802. *
  1803. * return: status
  1804. */
  1805. static
  1806. uint32_t dp_tx_msdu_dequeue(struct dp_peer *peer, uint32_t ppdu_id,
  1807. uint16_t tid, uint32_t num_msdu,
  1808. qdf_nbuf_queue_t *head,
  1809. qdf_nbuf_queue_t *head_xretries,
  1810. uint32_t start_tsf, uint32_t end_tsf)
  1811. {
  1812. struct dp_tx_tid *tx_tid = NULL;
  1813. uint32_t msdu_ppdu_id;
  1814. qdf_nbuf_t curr_msdu = NULL;
  1815. struct msdu_completion_info *ptr_msdu_info = NULL;
  1816. uint32_t wbm_tsf;
  1817. uint32_t matched = 0;
  1818. if (qdf_unlikely(!peer))
  1819. return 0;
  1820. /* Non-QOS frames are being indicated with TID 0
  1821. * in WBM completion path, an hence we should
  1822. * TID 0 to reap MSDUs from completion path
  1823. */
  1824. if (qdf_unlikely(tid == DP_NON_QOS_TID))
  1825. tid = 0;
  1826. tx_tid = &peer->tx_capture.tx_tid[tid];
  1827. if (qdf_unlikely(!tx_tid))
  1828. return 0;
  1829. /* lock here */
  1830. qdf_spin_lock_bh(&tx_tid->tasklet_tid_lock);
  1831. qdf_nbuf_queue_append(&tx_tid->defer_msdu_q, &tx_tid->msdu_comp_q);
  1832. qdf_nbuf_queue_init(&tx_tid->msdu_comp_q);
  1833. /* unlock here */
  1834. qdf_spin_unlock_bh(&tx_tid->tasklet_tid_lock);
  1835. /* lock here */
  1836. qdf_spin_lock_bh(&tx_tid->tid_lock);
  1837. if (qdf_nbuf_is_queue_empty(&tx_tid->defer_msdu_q)) {
  1838. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  1839. return 0;
  1840. }
  1841. curr_msdu = qdf_nbuf_queue_first(&tx_tid->defer_msdu_q);
  1842. while (curr_msdu) {
  1843. if (qdf_nbuf_queue_len(head) == num_msdu) {
  1844. matched = 1;
  1845. break;
  1846. }
  1847. ptr_msdu_info =
  1848. (struct msdu_completion_info *)qdf_nbuf_data(curr_msdu);
  1849. msdu_ppdu_id = ptr_msdu_info->ppdu_id;
  1850. wbm_tsf = ptr_msdu_info->tsf;
  1851. if ((ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_TX) ||
  1852. (ptr_msdu_info->status == HAL_TX_TQM_RR_REM_CMD_AGED)) {
  1853. /* Frames removed due to excessive retries */
  1854. qdf_nbuf_queue_remove(&tx_tid->defer_msdu_q);
  1855. qdf_nbuf_queue_add(head_xretries, curr_msdu);
  1856. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_XRETRY, 1);
  1857. curr_msdu = qdf_nbuf_queue_first(
  1858. &tx_tid->defer_msdu_q);
  1859. continue;
  1860. }
  1861. if (wbm_tsf > end_tsf) {
  1862. /* PPDU being matched is older than MSDU at head of
  1863. * completion queue. Return matched=1 to skip PPDU
  1864. */
  1865. matched = 1;
  1866. break;
  1867. }
  1868. if (wbm_tsf && (wbm_tsf < start_tsf)) {
  1869. /* remove the aged packet */
  1870. qdf_nbuf_queue_remove(&tx_tid->defer_msdu_q);
  1871. qdf_nbuf_free(curr_msdu);
  1872. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_DROP, 1);
  1873. curr_msdu = qdf_nbuf_queue_first(
  1874. &tx_tid->defer_msdu_q);
  1875. continue;
  1876. }
  1877. if (msdu_ppdu_id == ppdu_id) {
  1878. /* remove head */
  1879. qdf_nbuf_queue_remove(&tx_tid->defer_msdu_q);
  1880. /* add msdu to head queue */
  1881. qdf_nbuf_queue_add(head, curr_msdu);
  1882. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_DEQ,
  1883. 1);
  1884. /* get next msdu from defer_msdu_q */
  1885. curr_msdu = qdf_nbuf_queue_first(&tx_tid->defer_msdu_q);
  1886. continue;
  1887. } else {
  1888. /*
  1889. * at this point wbm_tsf is inbetween start_tsf and
  1890. * end tsf but there is a mismatch in ppdu_id
  1891. */
  1892. break;
  1893. }
  1894. }
  1895. qdf_spin_unlock_bh(&tx_tid->tid_lock);
  1896. return matched;
  1897. }
  1898. /**
  1899. * dp_tx_cap_nbuf_list_get_ref() - get nbuf_list reference
  1900. * @ptr_nbuf_list: dp_tx_cap_nbuf_list list
  1901. *
  1902. * Return: reference count
  1903. */
  1904. static inline uint8_t
  1905. dp_tx_cap_nbuf_list_get_ref(struct dp_tx_cap_nbuf_list *ptr_nbuf_list)
  1906. {
  1907. return ptr_nbuf_list->ref_cnt;
  1908. }
  1909. /**
  1910. * dp_tx_cap_nbuf_list_dec_ref() - dec nbuf_list reference
  1911. * @ptr_nbuf_list: dp_tx_cap_nbuf_list list
  1912. *
  1913. * Return: none
  1914. */
  1915. static inline
  1916. void dp_tx_cap_nbuf_list_dec_ref(struct dp_tx_cap_nbuf_list *ptr_nbuf_list)
  1917. {
  1918. ptr_nbuf_list->ref_cnt--;
  1919. if (!ptr_nbuf_list->ref_cnt)
  1920. ptr_nbuf_list->nbuf_ppdu = NULL;
  1921. }
  1922. /**
  1923. * dp_tx_cap_nbuf_list_inc_ref() - inc nbuf_list reference
  1924. * @ptr_nbuf_list: dp_tx_cap_nbuf_list list
  1925. *
  1926. * Return: none
  1927. */
  1928. static inline
  1929. void dp_tx_cap_nbuf_list_inc_ref(struct dp_tx_cap_nbuf_list *ptr_nbuf_list)
  1930. {
  1931. ptr_nbuf_list->ref_cnt++;
  1932. }
  1933. /**
  1934. * dp_tx_cap_nbuf_list_update_ref() - update nbuf_list reference
  1935. * @ptr_nbuf_list: dp_tx_cap_nbuf_list list
  1936. * @ref_cnt: reference count
  1937. *
  1938. * Return: none
  1939. */
  1940. static inline void
  1941. dp_tx_cap_nbuf_list_update_ref(struct dp_tx_cap_nbuf_list *ptr_nbuf_list,
  1942. uint8_t ref_cnt)
  1943. {
  1944. ptr_nbuf_list->ref_cnt = ref_cnt;
  1945. }
  1946. /**
  1947. * get_mpdu_clone_from_next_ppdu(): Function to clone missing mpdu from
  1948. * next ppdu
  1949. * @nbuf_ppdu_list: nbuf list
  1950. * @ppdu_desc_cnt: ppdu_desc_cnt
  1951. * @missed_seq_no:
  1952. * @ppdu_id: ppdu_id
  1953. * @mpdu_info: cdp_tx_indication_mpdu_info
  1954. *
  1955. * return: void
  1956. */
  1957. static qdf_nbuf_t
  1958. get_mpdu_clone_from_next_ppdu(struct dp_tx_cap_nbuf_list nbuf_list[],
  1959. uint32_t ppdu_desc_cnt,
  1960. uint16_t missed_seq_no,
  1961. uint16_t peer_id, uint32_t ppdu_id,
  1962. uint8_t usr_idx)
  1963. {
  1964. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  1965. struct cdp_tx_completion_ppdu_user *user;
  1966. qdf_nbuf_t mpdu = NULL;
  1967. struct dp_tx_cap_nbuf_list *ptr_nbuf_list;
  1968. qdf_nbuf_t nbuf_ppdu;
  1969. uint32_t i = 0;
  1970. uint32_t found = 0;
  1971. uint32_t seq_no = 0;
  1972. uint32_t mpdu_q_len;
  1973. for (i = 1; i < ppdu_desc_cnt; i++) {
  1974. ptr_nbuf_list = &nbuf_list[i];
  1975. nbuf_ppdu = ptr_nbuf_list->nbuf_ppdu;
  1976. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  1977. qdf_nbuf_data(nbuf_ppdu);
  1978. user = &ppdu_desc->user[usr_idx];
  1979. if (user->skip == 1)
  1980. continue;
  1981. /* check if seq number is between the range */
  1982. if ((peer_id == user->peer_id) &&
  1983. ((missed_seq_no >= user->start_seq) &&
  1984. (missed_seq_no <= user->last_enq_seq))) {
  1985. seq_no = user->start_seq;
  1986. if (SEQ_BIT(user->failed_bitmap,
  1987. (missed_seq_no - seq_no))) {
  1988. found = 1;
  1989. break;
  1990. }
  1991. }
  1992. }
  1993. if (found == 0) {
  1994. /* mpdu not found in sched cmd id */
  1995. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  1996. "%s: peer_id[%d] missed seq_no[%d] ppdu_id[%d] [%d] not found!!!",
  1997. __func__, peer_id,
  1998. missed_seq_no, ppdu_id, ppdu_desc_cnt);
  1999. return NULL;
  2000. }
  2001. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_DEBUG,
  2002. "%s: peer_id[%d] seq_no[%d] missed ppdu_id[%d] m[%d] found in ppdu_id[%d]!!",
  2003. __func__, peer_id,
  2004. missed_seq_no, ppdu_id,
  2005. (missed_seq_no - seq_no), ppdu_desc->ppdu_id);
  2006. mpdu = qdf_nbuf_queue_first(&ppdu_desc->user[usr_idx].mpdu_q);
  2007. mpdu_q_len = qdf_nbuf_queue_len(&ppdu_desc->user[usr_idx].mpdu_q);
  2008. if (!mpdu) {
  2009. /* bitmap shows it found sequence number, but
  2010. * MPDU not found in PPDU
  2011. */
  2012. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE, QDF_TRACE_LEVEL_ERROR,
  2013. "%s: missed seq_no[%d] ppdu_id[%d] [%d] found but queue empty!!!",
  2014. __func__, missed_seq_no, ppdu_id, ppdu_desc_cnt);
  2015. if (mpdu_q_len)
  2016. qdf_assert_always(0);
  2017. return NULL;
  2018. }
  2019. for (i = 0; i < (missed_seq_no - seq_no); i++) {
  2020. mpdu = mpdu->next;
  2021. if (!mpdu) {
  2022. /*
  2023. * bitmap shows it found sequence number,
  2024. * but queue empty, do we need to allocate
  2025. * skb and send instead of NULL ?
  2026. * add counter here:
  2027. */
  2028. return NULL;
  2029. }
  2030. }
  2031. if (!mpdu)
  2032. return NULL;
  2033. return qdf_nbuf_copy_expand_fraglist(mpdu, MAX_MONITOR_HEADER, 0);
  2034. }
  2035. /**
  2036. * dp_tx_update_user_mpdu_info(): Function to update mpdu info
  2037. * from ppdu_desc
  2038. * @ppdu_id: ppdu_id
  2039. * @mpdu_info: cdp_tx_indication_mpdu_info
  2040. * @user: cdp_tx_completion_ppdu_user
  2041. *
  2042. * return: void
  2043. */
  2044. static void
  2045. dp_tx_update_user_mpdu_info(uint32_t ppdu_id,
  2046. struct cdp_tx_indication_mpdu_info *mpdu_info,
  2047. struct cdp_tx_completion_ppdu_user *user)
  2048. {
  2049. mpdu_info->ppdu_id = ppdu_id;
  2050. mpdu_info->frame_ctrl = user->frame_ctrl;
  2051. mpdu_info->qos_ctrl = user->qos_ctrl;
  2052. mpdu_info->tid = user->tid;
  2053. mpdu_info->ltf_size = user->ltf_size;
  2054. mpdu_info->he_re = user->he_re;
  2055. mpdu_info->txbf = user->txbf;
  2056. mpdu_info->bw = user->bw;
  2057. mpdu_info->nss = user->nss;
  2058. mpdu_info->mcs = user->mcs;
  2059. mpdu_info->preamble = user->preamble;
  2060. mpdu_info->gi = user->gi;
  2061. mpdu_info->ack_rssi = user->ack_rssi[0];
  2062. mpdu_info->tx_rate = user->tx_rate;
  2063. mpdu_info->ldpc = user->ldpc;
  2064. mpdu_info->ppdu_cookie = user->ppdu_cookie;
  2065. mpdu_info->long_retries = user->long_retries;
  2066. mpdu_info->short_retries = user->short_retries;
  2067. mpdu_info->completion_status = user->completion_status;
  2068. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, 6);
  2069. mpdu_info->ba_start_seq = user->ba_seq_no;
  2070. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  2071. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  2072. }
  2073. static inline
  2074. void dp_tx_update_sequence_number(qdf_nbuf_t nbuf, uint32_t seq_no)
  2075. {
  2076. struct ieee80211_frame *ptr_wh = NULL;
  2077. uint16_t wh_seq = 0;
  2078. if (!nbuf)
  2079. return;
  2080. /* update sequence number in frame header */
  2081. ptr_wh = (struct ieee80211_frame *)qdf_nbuf_data(nbuf);
  2082. wh_seq = (seq_no & 0xFFF) << 4;
  2083. qdf_mem_copy(ptr_wh->i_seq, &wh_seq, sizeof(uint16_t));
  2084. }
  2085. static inline
  2086. void dp_update_frame_ctrl_from_frame_type(void *desc)
  2087. {
  2088. struct cdp_tx_completion_ppdu *ppdu_desc = desc;
  2089. /* frame control is not set properly, sometimes it is zero */
  2090. switch (ppdu_desc->htt_frame_type) {
  2091. case HTT_STATS_FTYPE_SGEN_NDPA:
  2092. case HTT_STATS_FTYPE_SGEN_NDP:
  2093. case HTT_STATS_FTYPE_SGEN_AX_NDPA:
  2094. case HTT_STATS_FTYPE_SGEN_AX_NDP:
  2095. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_NDPA |
  2096. IEEE80211_FC0_TYPE_CTL);
  2097. break;
  2098. case HTT_STATS_FTYPE_SGEN_BRP:
  2099. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BRPOLL |
  2100. IEEE80211_FC0_TYPE_CTL);
  2101. break;
  2102. case HTT_STATS_FTYPE_SGEN_RTS:
  2103. case HTT_STATS_FTYPE_SGEN_MU_RTS:
  2104. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_RTS |
  2105. IEEE80211_FC0_TYPE_CTL);
  2106. break;
  2107. case HTT_STATS_FTYPE_SGEN_CTS:
  2108. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CTS |
  2109. IEEE80211_FC0_TYPE_CTL);
  2110. break;
  2111. case HTT_STATS_FTYPE_SGEN_CFEND:
  2112. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CF_END |
  2113. IEEE80211_FC0_TYPE_CTL);
  2114. break;
  2115. case HTT_STATS_FTYPE_SGEN_MU_TRIG:
  2116. case HTT_STATS_FTYPE_SGEN_MU_BAR:
  2117. case HTT_STATS_FTYPE_SGEN_MU_BRP:
  2118. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_TRIGGER |
  2119. IEEE80211_FC0_TYPE_CTL);
  2120. break;
  2121. case HTT_STATS_FTYPE_SGEN_BAR:
  2122. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BAR |
  2123. IEEE80211_FC0_TYPE_CTL);
  2124. break;
  2125. }
  2126. }
  2127. /**
  2128. * dp_send_dummy_mpdu_info_to_stack(): send dummy payload to stack
  2129. * to upper layer if complete
  2130. * @pdev: DP pdev handle
  2131. * @desc: cdp tx completion ppdu desc
  2132. * @usr_idx: user index
  2133. *
  2134. * return: status
  2135. */
  2136. static inline
  2137. QDF_STATUS dp_send_dummy_mpdu_info_to_stack(struct dp_pdev *pdev,
  2138. void *desc, uint8_t usr_idx)
  2139. {
  2140. struct dp_peer *peer;
  2141. struct dp_vdev *vdev = NULL;
  2142. struct cdp_tx_completion_ppdu *ppdu_desc = desc;
  2143. struct cdp_tx_completion_ppdu_user *user = &ppdu_desc->user[usr_idx];
  2144. struct ieee80211_ctlframe_addr2 *wh_min;
  2145. uint16_t frame_ctrl_le, duration_le;
  2146. struct cdp_tx_indication_info tx_capture_info;
  2147. struct cdp_tx_indication_mpdu_info *mpdu_info;
  2148. uint8_t type, subtype;
  2149. qdf_mem_set(&tx_capture_info,
  2150. sizeof(struct cdp_tx_indication_info),
  2151. 0);
  2152. tx_capture_info.mpdu_nbuf =
  2153. qdf_nbuf_alloc(pdev->soc->osdev,
  2154. MAX_MONITOR_HEADER + MAX_DUMMY_FRM_BODY,
  2155. MAX_MONITOR_HEADER,
  2156. 4, FALSE);
  2157. if (!tx_capture_info.mpdu_nbuf)
  2158. return QDF_STATUS_E_ABORTED;
  2159. mpdu_info = &tx_capture_info.mpdu_info;
  2160. mpdu_info->resp_type = ppdu_desc->resp_type;
  2161. mpdu_info->mprot_type = ppdu_desc->mprot_type;
  2162. mpdu_info->rts_success = ppdu_desc->rts_success;
  2163. mpdu_info->rts_failure = ppdu_desc->rts_failure;
  2164. /* update cdp_tx_indication_mpdu_info */
  2165. dp_tx_update_user_mpdu_info(ppdu_desc->bar_ppdu_id,
  2166. &tx_capture_info.mpdu_info,
  2167. user);
  2168. tx_capture_info.ppdu_desc = ppdu_desc;
  2169. mpdu_info->ppdu_id = ppdu_desc->ppdu_id;
  2170. mpdu_info->channel_num = pdev->operating_channel.num;
  2171. mpdu_info->channel = ppdu_desc->channel;
  2172. mpdu_info->frame_type = ppdu_desc->frame_type;
  2173. mpdu_info->ppdu_start_timestamp = ppdu_desc->ppdu_start_timestamp;
  2174. mpdu_info->ppdu_end_timestamp = ppdu_desc->ppdu_end_timestamp;
  2175. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  2176. mpdu_info->seq_no = user->start_seq;
  2177. qdf_mem_copy(mpdu_info->mac_address, user->mac_addr, QDF_MAC_ADDR_SIZE);
  2178. mpdu_info->ba_start_seq = user->ba_seq_no;
  2179. qdf_mem_copy(mpdu_info->ba_bitmap, user->ba_bitmap,
  2180. CDP_BA_256_BIT_MAP_SIZE_DWORDS * sizeof(uint32_t));
  2181. mpdu_info->frame_ctrl = ppdu_desc->frame_ctrl;
  2182. type = (ppdu_desc->frame_ctrl & IEEE80211_FC0_TYPE_MASK);
  2183. subtype = (ppdu_desc->frame_ctrl & IEEE80211_FC0_SUBTYPE_MASK);
  2184. if (type == IEEE80211_FC0_TYPE_CTL &&
  2185. subtype == IEEE80211_FC0_SUBTYPE_BAR) {
  2186. mpdu_info->frame_ctrl = (IEEE80211_FC0_SUBTYPE_BAR |
  2187. IEEE80211_FC0_TYPE_CTL);
  2188. mpdu_info->ppdu_id = ppdu_desc->bar_ppdu_id;
  2189. mpdu_info->ppdu_start_timestamp =
  2190. ppdu_desc->bar_ppdu_start_timestamp;
  2191. mpdu_info->ppdu_end_timestamp =
  2192. ppdu_desc->bar_ppdu_end_timestamp;
  2193. mpdu_info->tx_duration = ppdu_desc->bar_tx_duration;
  2194. }
  2195. wh_min = (struct ieee80211_ctlframe_addr2 *)
  2196. qdf_nbuf_data(
  2197. tx_capture_info.mpdu_nbuf);
  2198. qdf_mem_zero(wh_min, MAX_DUMMY_FRM_BODY);
  2199. frame_ctrl_le =
  2200. qdf_cpu_to_le16(mpdu_info->frame_ctrl);
  2201. duration_le =
  2202. qdf_cpu_to_le16(mpdu_info->tx_duration);
  2203. wh_min->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  2204. wh_min->i_fc[0] = (frame_ctrl_le & 0xFF);
  2205. wh_min->i_aidordur[1] = (duration_le & 0xFF00) >> 8;
  2206. wh_min->i_aidordur[0] = (duration_le & 0xFF);
  2207. qdf_mem_copy(wh_min->i_addr1,
  2208. mpdu_info->mac_address,
  2209. QDF_MAC_ADDR_SIZE);
  2210. if (subtype == IEEE80211_FC0_SUBTYPE_ACK)
  2211. qdf_nbuf_set_pktlen(tx_capture_info.mpdu_nbuf,
  2212. sizeof(struct ieee80211_frame_min_one));
  2213. else {
  2214. peer = dp_tx_cap_peer_find_by_id(pdev->soc, user->peer_id);
  2215. if (peer) {
  2216. vdev = peer->vdev;
  2217. dp_tx_cap_peer_unref_del(peer);
  2218. } else {
  2219. vdev =
  2220. dp_get_vdev_from_soc_vdev_id_wifi3(pdev->soc,
  2221. ppdu_desc->vdev_id);
  2222. }
  2223. if (vdev)
  2224. qdf_mem_copy(wh_min->i_addr2,
  2225. vdev->mac_addr.raw,
  2226. QDF_MAC_ADDR_SIZE);
  2227. qdf_nbuf_set_pktlen(tx_capture_info.mpdu_nbuf, sizeof(*wh_min));
  2228. }
  2229. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2230. QDF_TRACE_LEVEL_DEBUG,
  2231. "HTT_FTYPE[%d] frm(0x%08x): fc %x %x, dur 0x%x%x\n",
  2232. ppdu_desc->htt_frame_type, mpdu_info->ppdu_id,
  2233. wh_min->i_fc[1], wh_min->i_fc[0],
  2234. wh_min->i_aidordur[1], wh_min->i_aidordur[0]);
  2235. /*
  2236. * send MPDU to osif layer
  2237. */
  2238. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  2239. &tx_capture_info, HTT_INVALID_PEER,
  2240. WDI_NO_VAL, pdev->pdev_id);
  2241. if (tx_capture_info.mpdu_nbuf)
  2242. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  2243. return QDF_STATUS_SUCCESS;
  2244. }
  2245. /**
  2246. * dp_send_dummy_rts_cts_frame(): send dummy rts and cts frame out
  2247. * to upper layer if complete
  2248. * @pdev: DP pdev handle
  2249. * @cur_ppdu_desc: cdp tx completion ppdu desc
  2250. *
  2251. * return: void
  2252. */
  2253. static
  2254. void dp_send_dummy_rts_cts_frame(struct dp_pdev *pdev,
  2255. struct cdp_tx_completion_ppdu *cur_ppdu_desc,
  2256. uint8_t usr_idx)
  2257. {
  2258. struct cdp_tx_completion_ppdu *ppdu_desc;
  2259. struct dp_pdev_tx_capture *ptr_tx_cap;
  2260. struct dp_peer *peer;
  2261. uint8_t rts_send;
  2262. struct dp_vdev *vdev = NULL;
  2263. rts_send = 0;
  2264. ptr_tx_cap = &pdev->tx_capture;
  2265. ppdu_desc = &ptr_tx_cap->dummy_ppdu_desc;
  2266. ppdu_desc->channel = cur_ppdu_desc->channel;
  2267. ppdu_desc->num_mpdu = 1;
  2268. ppdu_desc->num_msdu = 1;
  2269. ppdu_desc->user[usr_idx].ppdu_type = HTT_PPDU_STATS_PPDU_TYPE_SU;
  2270. ppdu_desc->bar_num_users = 0;
  2271. ppdu_desc->num_users = 1;
  2272. if (cur_ppdu_desc->mprot_type == SEND_WIFIRTS_LEGACY_E ||
  2273. cur_ppdu_desc->mprot_type == SEND_WIFIRTS_11AC_DYNAMIC_BW_E ||
  2274. cur_ppdu_desc->mprot_type == SEND_WIFIRTS_11AC_STATIC_BW_E) {
  2275. rts_send = 1;
  2276. /*
  2277. * send dummy RTS frame followed by CTS
  2278. * update frame_ctrl and htt_frame_type
  2279. */
  2280. ppdu_desc->htt_frame_type = HTT_STATS_FTYPE_SGEN_RTS;
  2281. ppdu_desc->frame_type = CDP_PPDU_FTYPE_CTRL;
  2282. ppdu_desc->ppdu_start_timestamp =
  2283. cur_ppdu_desc->ppdu_start_timestamp;
  2284. ppdu_desc->ppdu_end_timestamp =
  2285. cur_ppdu_desc->ppdu_end_timestamp;
  2286. ppdu_desc->tx_duration = cur_ppdu_desc->tx_duration;
  2287. ppdu_desc->user[usr_idx].peer_id =
  2288. cur_ppdu_desc->user[usr_idx].peer_id;
  2289. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_RTS |
  2290. IEEE80211_FC0_TYPE_CTL);
  2291. qdf_mem_copy(&ppdu_desc->user[usr_idx].mac_addr,
  2292. &cur_ppdu_desc->user[usr_idx].mac_addr,
  2293. QDF_MAC_ADDR_SIZE);
  2294. dp_send_dummy_mpdu_info_to_stack(pdev, ppdu_desc, usr_idx);
  2295. }
  2296. if ((rts_send && cur_ppdu_desc->rts_success) ||
  2297. cur_ppdu_desc->mprot_type == SEND_WIFICTS2SELF_E) {
  2298. uint16_t peer_id;
  2299. peer_id = cur_ppdu_desc->user[usr_idx].peer_id;
  2300. /* send dummy CTS frame */
  2301. ppdu_desc->htt_frame_type = HTT_STATS_FTYPE_SGEN_CTS;
  2302. ppdu_desc->frame_type = CDP_PPDU_FTYPE_CTRL;
  2303. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_CTS |
  2304. IEEE80211_FC0_TYPE_CTL);
  2305. ppdu_desc->ppdu_start_timestamp =
  2306. cur_ppdu_desc->ppdu_start_timestamp;
  2307. ppdu_desc->ppdu_end_timestamp =
  2308. cur_ppdu_desc->ppdu_end_timestamp;
  2309. ppdu_desc->tx_duration = cur_ppdu_desc->tx_duration -
  2310. (RTS_INTERVAL + SIFS_INTERVAL);
  2311. ppdu_desc->user[usr_idx].peer_id = peer_id;
  2312. peer = dp_tx_cap_peer_find_by_id(pdev->soc, peer_id);
  2313. if (peer) {
  2314. vdev = peer->vdev;
  2315. dp_tx_cap_peer_unref_del(peer);
  2316. } else {
  2317. uint8_t vdev_id;
  2318. vdev_id = ppdu_desc->vdev_id;
  2319. vdev = dp_get_vdev_from_soc_vdev_id_wifi3(pdev->soc,
  2320. vdev_id);
  2321. }
  2322. if (vdev)
  2323. qdf_mem_copy(&ppdu_desc->user[usr_idx].mac_addr,
  2324. vdev->mac_addr.raw, QDF_MAC_ADDR_SIZE);
  2325. dp_send_dummy_mpdu_info_to_stack(pdev, ppdu_desc, usr_idx);
  2326. }
  2327. }
  2328. static void dp_gen_ack_rx_frame(struct dp_pdev *pdev,
  2329. struct cdp_tx_indication_info *tx_capture_info)
  2330. {
  2331. struct cdp_tx_completion_ppdu *ppdu_desc;
  2332. struct dp_peer *peer;
  2333. struct dp_pdev_tx_capture *ptr_tx_cap;
  2334. ptr_tx_cap = &pdev->tx_capture;
  2335. ppdu_desc = &ptr_tx_cap->dummy_ppdu_desc;
  2336. ppdu_desc->channel = tx_capture_info->ppdu_desc->channel;
  2337. ppdu_desc->num_mpdu = 1;
  2338. ppdu_desc->num_msdu = 1;
  2339. ppdu_desc->user[0].ppdu_type = HTT_PPDU_STATS_PPDU_TYPE_SU;
  2340. ppdu_desc->bar_num_users = 0;
  2341. ppdu_desc->num_users = 1;
  2342. ppdu_desc->frame_type = CDP_PPDU_FTYPE_CTRL;
  2343. ppdu_desc->frame_ctrl = (IEEE80211_FC0_SUBTYPE_ACK |
  2344. IEEE80211_FC0_TYPE_CTL);
  2345. ppdu_desc->ppdu_start_timestamp =
  2346. tx_capture_info->ppdu_desc->ppdu_start_timestamp;
  2347. ppdu_desc->ppdu_end_timestamp =
  2348. tx_capture_info->ppdu_desc->ppdu_end_timestamp;
  2349. ppdu_desc->user[0].peer_id =
  2350. tx_capture_info->ppdu_desc->user[0].peer_id;
  2351. peer = dp_peer_find_by_id(pdev->soc,
  2352. tx_capture_info->ppdu_desc->user[0].peer_id);
  2353. if (peer) {
  2354. struct dp_vdev *vdev = NULL;
  2355. vdev = peer->vdev;
  2356. if (vdev)
  2357. qdf_mem_copy(&ppdu_desc->user[0].mac_addr,
  2358. vdev->mac_addr.raw,
  2359. QDF_MAC_ADDR_SIZE);
  2360. dp_peer_unref_del_find_by_id(peer);
  2361. }
  2362. dp_send_dummy_mpdu_info_to_stack(pdev, ppdu_desc, 0);
  2363. }
  2364. /**
  2365. * dp_send_data_to_stack(): Function to deliver mpdu info to stack
  2366. * to upper layer
  2367. * @pdev: DP pdev handle
  2368. * @nbuf_ppdu_list: ppdu_desc_list per sched cmd id
  2369. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  2370. *
  2371. * return: status
  2372. */
  2373. static
  2374. void dp_send_data_to_stack(struct dp_pdev *pdev,
  2375. struct cdp_tx_completion_ppdu *ppdu_desc,
  2376. uint8_t usr_idx)
  2377. {
  2378. struct cdp_tx_completion_ppdu_user *user = NULL;
  2379. struct cdp_tx_indication_info tx_capture_info;
  2380. struct cdp_tx_indication_mpdu_info *mpdu_info;
  2381. int i;
  2382. uint32_t seq_no, start_seq;
  2383. uint32_t ppdu_id;
  2384. uint32_t mpdu_tried;
  2385. uint32_t mpdu_enq = 0;
  2386. struct dp_peer *peer;
  2387. if (!ppdu_desc)
  2388. return;
  2389. ppdu_id = ppdu_desc->ppdu_id;
  2390. user = &ppdu_desc->user[usr_idx];
  2391. peer = dp_tx_cap_peer_find_by_id(pdev->soc, user->peer_id);
  2392. if (!peer) {
  2393. return;
  2394. }
  2395. qdf_mem_set(&tx_capture_info,
  2396. sizeof(struct cdp_tx_indication_info),
  2397. 0);
  2398. mpdu_info = &tx_capture_info.mpdu_info;
  2399. mpdu_info->usr_idx = usr_idx;
  2400. mpdu_info->channel = ppdu_desc->channel;
  2401. mpdu_info->frame_type = ppdu_desc->frame_type;
  2402. mpdu_info->ppdu_start_timestamp =
  2403. ppdu_desc->ppdu_start_timestamp;
  2404. mpdu_info->ppdu_end_timestamp =
  2405. ppdu_desc->ppdu_end_timestamp;
  2406. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  2407. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  2408. mpdu_info->resp_type = ppdu_desc->resp_type;
  2409. mpdu_info->mprot_type = ppdu_desc->mprot_type;
  2410. mpdu_info->rts_success = ppdu_desc->rts_success;
  2411. mpdu_info->rts_failure = ppdu_desc->rts_failure;
  2412. /* update cdp_tx_indication_mpdu_info */
  2413. dp_tx_update_user_mpdu_info(ppdu_id,
  2414. &tx_capture_info.mpdu_info,
  2415. user);
  2416. tx_capture_info.ppdu_desc = ppdu_desc;
  2417. tx_capture_info.mpdu_info.channel_num = pdev->operating_channel.num;
  2418. if (ppdu_desc->mprot_type && (usr_idx == 0))
  2419. dp_send_dummy_rts_cts_frame(pdev, ppdu_desc, usr_idx);
  2420. start_seq = user->start_seq;
  2421. if (!user->mpdus)
  2422. goto return_send_to_stack;
  2423. mpdu_tried = user->mpdu_tried_ucast + user->mpdu_tried_mcast;
  2424. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++)
  2425. mpdu_enq += get_number_of_1s(user->enq_bitmap[i]);
  2426. if (mpdu_tried > mpdu_enq)
  2427. dp_ppdu_desc_debug_print(ppdu_desc, usr_idx,
  2428. __func__, __LINE__);
  2429. for (i = 0; i < user->ba_size && mpdu_tried; i++) {
  2430. if (qdf_likely(user->tid != DP_NON_QOS_TID) &&
  2431. !(SEQ_BIT(user->enq_bitmap, i))) {
  2432. continue;
  2433. }
  2434. mpdu_tried--;
  2435. seq_no = start_seq + i;
  2436. if (!user->mpdus[i])
  2437. continue;
  2438. tx_capture_info.mpdu_nbuf = user->mpdus[i];
  2439. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_TO_STACK, 1);
  2440. user->mpdus[i] = NULL;
  2441. mpdu_info->seq_no = seq_no;
  2442. dp_tx_update_sequence_number(tx_capture_info.mpdu_nbuf, seq_no);
  2443. /*
  2444. * send MPDU to osif layer
  2445. * do we need to update mpdu_info before tranmit
  2446. * get current mpdu_nbuf
  2447. */
  2448. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  2449. &tx_capture_info,
  2450. HTT_INVALID_PEER,
  2451. WDI_NO_VAL, pdev->pdev_id);
  2452. if (tx_capture_info.mpdu_nbuf)
  2453. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  2454. }
  2455. if (ppdu_desc->resp_type == HTT_PPDU_STATS_ACK_EXPECTED_E &&
  2456. ppdu_desc->user[usr_idx].completion_status ==
  2457. HTT_PPDU_STATS_USER_STATUS_OK)
  2458. dp_gen_ack_rx_frame(pdev, &tx_capture_info);
  2459. return_send_to_stack:
  2460. dp_tx_cap_peer_unref_del(peer);
  2461. return;
  2462. }
  2463. /**
  2464. * dp_ppdu_desc_free(): Function to free ppdu_desc and stored queue
  2465. * @ptr_nbuf_list: pointer to ptr_nbuf_list
  2466. * @usr_idx: user index
  2467. *
  2468. * return: void
  2469. */
  2470. static void dp_ppdu_desc_free(struct dp_tx_cap_nbuf_list *ptr_nbuf_list,
  2471. uint8_t usr_idx)
  2472. {
  2473. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  2474. qdf_nbuf_t tmp_nbuf;
  2475. if (!ptr_nbuf_list->nbuf_ppdu ||
  2476. !dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list))
  2477. return;
  2478. tmp_nbuf = ptr_nbuf_list->nbuf_ppdu;
  2479. if (tmp_nbuf) {
  2480. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2481. qdf_nbuf_data(tmp_nbuf);
  2482. dp_ppdu_queue_free(tmp_nbuf, usr_idx);
  2483. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  2484. qdf_nbuf_free(tmp_nbuf);
  2485. }
  2486. }
  2487. /**
  2488. * dp_ppdu_desc_free_all(): Function to free all user in a ppdu_desc and
  2489. * its stored queue
  2490. * @ptr_nbuf_list: pointer to ptr_nbuf_list
  2491. * @max_users: maximum number of users
  2492. *
  2493. * return: void
  2494. */
  2495. static void dp_ppdu_desc_free_all(struct dp_tx_cap_nbuf_list *ptr_nbuf_list,
  2496. uint8_t max_users)
  2497. {
  2498. uint8_t i = 0;
  2499. for (i = 0; i < max_users; i++)
  2500. dp_ppdu_desc_free(ptr_nbuf_list, i);
  2501. }
  2502. /**
  2503. * dp_tx_mon_get_next_mpdu(): get next mpdu from retry queue.
  2504. * @xretry_user: pointer to ppdu_desc user.
  2505. * @mpdu_nbuf: mpdu nbuf
  2506. *
  2507. * return: qdf_nbuf_t
  2508. */
  2509. static qdf_nbuf_t
  2510. dp_tx_mon_get_next_mpdu(struct cdp_tx_completion_ppdu_user *xretry_user,
  2511. qdf_nbuf_t mpdu_nbuf)
  2512. {
  2513. qdf_nbuf_t next_nbuf = NULL;
  2514. qdf_nbuf_queue_t temp_xretries;
  2515. if (mpdu_nbuf != qdf_nbuf_queue_first(&xretry_user->mpdu_q)) {
  2516. qdf_err(" mpdu_nbuf is not the head");
  2517. next_nbuf = qdf_nbuf_queue_next(mpdu_nbuf);
  2518. /* Initialize temp list */
  2519. qdf_nbuf_queue_init(&temp_xretries);
  2520. /* Move entries into temp list till the mpdu_nbuf is found */
  2521. while ((qdf_nbuf_queue_first(&xretry_user->mpdu_q)) &&
  2522. (mpdu_nbuf !=
  2523. qdf_nbuf_queue_first(&xretry_user->mpdu_q))) {
  2524. qdf_nbuf_queue_add(&temp_xretries,
  2525. qdf_nbuf_queue_remove(&xretry_user->mpdu_q));
  2526. }
  2527. if ((qdf_nbuf_queue_first(&xretry_user->mpdu_q)) &&
  2528. (mpdu_nbuf == qdf_nbuf_queue_first(&xretry_user->mpdu_q))) {
  2529. /* Remove mpdu_nbuf from queue */
  2530. qdf_nbuf_queue_remove(&xretry_user->mpdu_q);
  2531. /* Add remaining nbufs into temp queue */
  2532. qdf_nbuf_queue_append(&temp_xretries,
  2533. &xretry_user->mpdu_q);
  2534. /* Reinit xretry_user->mpdu_q */
  2535. qdf_nbuf_queue_init(&xretry_user->mpdu_q);
  2536. /* append all the entries into original queue */
  2537. qdf_nbuf_queue_append(&xretry_user->mpdu_q,
  2538. &temp_xretries);
  2539. } else {
  2540. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2541. QDF_TRACE_LEVEL_FATAL,
  2542. "%s: This is buggy scenario, did not find nbuf in queue ",
  2543. __func__);
  2544. qdf_assert_always(0);
  2545. }
  2546. } else {
  2547. qdf_nbuf_queue_remove(&xretry_user->mpdu_q);
  2548. next_nbuf = qdf_nbuf_queue_first(&xretry_user->mpdu_q);
  2549. }
  2550. return next_nbuf;
  2551. }
  2552. static void
  2553. dp_tx_mon_proc_xretries(struct dp_pdev *pdev, struct dp_peer *peer,
  2554. uint16_t tid)
  2555. {
  2556. struct dp_tx_tid *tx_tid = &peer->tx_capture.tx_tid[tid];
  2557. struct cdp_tx_completion_ppdu *ppdu_desc;
  2558. struct cdp_tx_completion_ppdu *xretry_ppdu;
  2559. struct cdp_tx_completion_ppdu_user *user = NULL;
  2560. struct cdp_tx_completion_ppdu_user *xretry_user = NULL;
  2561. qdf_nbuf_t ppdu_nbuf;
  2562. qdf_nbuf_t mpdu_nbuf;
  2563. uint32_t mpdu_tried = 0;
  2564. int i;
  2565. uint32_t seq_no;
  2566. uint8_t usr_idx = 0;
  2567. xretry_ppdu = &tx_tid->xretry_ppdu;
  2568. xretry_user = &xretry_ppdu->user[0];
  2569. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  2570. qdf_nbuf_queue_free(&xretry_user->mpdu_q);
  2571. return;
  2572. }
  2573. if (qdf_nbuf_is_queue_empty(&xretry_user->mpdu_q))
  2574. return;
  2575. ppdu_nbuf = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  2576. while (ppdu_nbuf) {
  2577. struct msdu_completion_info *ptr_msdu_info = NULL;
  2578. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2579. qdf_nbuf_data(ppdu_nbuf);
  2580. usr_idx = dp_tx_find_usr_idx_from_peer_id(ppdu_desc,
  2581. peer->peer_id);
  2582. user = &ppdu_desc->user[usr_idx];
  2583. if (user->pending_retries) {
  2584. uint32_t start_seq = user->start_seq;
  2585. mpdu_tried = user->mpdu_tried_ucast +
  2586. user->mpdu_tried_mcast;
  2587. mpdu_nbuf = qdf_nbuf_queue_first(&xretry_user->mpdu_q);
  2588. for (i = 0;
  2589. (i < user->ba_size) &&
  2590. (mpdu_tried > 0) && mpdu_nbuf;
  2591. i++) {
  2592. if (!(SEQ_BIT(user->enq_bitmap, i)))
  2593. continue;
  2594. mpdu_tried--;
  2595. /* missed seq number */
  2596. seq_no = start_seq + i;
  2597. if (SEQ_BIT(user->failed_bitmap, i))
  2598. continue;
  2599. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2600. QDF_TRACE_LEVEL_INFO,
  2601. "%s: fill seqno %d from xretries",
  2602. __func__, seq_no);
  2603. ptr_msdu_info = (struct msdu_completion_info *)
  2604. (qdf_nbuf_data(qdf_nbuf_get_ext_list(
  2605. mpdu_nbuf)) -
  2606. (sizeof(struct msdu_completion_info) +
  2607. sizeof(qdf_ether_header_t)));
  2608. ptr_msdu_info->transmit_cnt--;
  2609. SEQ_SEG(user->failed_bitmap, i) |=
  2610. SEQ_SEG_MSK(user->failed_bitmap[0], i);
  2611. user->pending_retries--;
  2612. if (ptr_msdu_info->transmit_cnt == 0) {
  2613. user->mpdus[seq_no - start_seq] =
  2614. mpdu_nbuf;
  2615. dp_tx_cap_stats_mpdu_update(peer,
  2616. PEER_MPDU_ARR, 1);
  2617. /*
  2618. * This API removes mpdu_nbuf from q
  2619. * and returns next mpdu from the queue
  2620. */
  2621. mpdu_nbuf = dp_tx_mon_get_next_mpdu(
  2622. xretry_user, mpdu_nbuf);
  2623. } else {
  2624. user->mpdus[seq_no - start_seq] =
  2625. qdf_nbuf_copy_expand_fraglist(
  2626. mpdu_nbuf,
  2627. MAX_MONITOR_HEADER, 0);
  2628. dp_tx_cap_stats_mpdu_update(peer,
  2629. PEER_MPDU_CLONE, 1);
  2630. mpdu_nbuf =
  2631. qdf_nbuf_queue_next(mpdu_nbuf);
  2632. }
  2633. }
  2634. }
  2635. if ((user->pending_retries == 0) &&
  2636. (ppdu_nbuf ==
  2637. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q))) {
  2638. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  2639. /* Deliver PPDU */
  2640. dp_send_data_to_stack(pdev, ppdu_desc, usr_idx);
  2641. dp_ppdu_queue_free(ppdu_nbuf, usr_idx);
  2642. qdf_nbuf_free(ppdu_nbuf);
  2643. ppdu_nbuf = qdf_nbuf_queue_first(
  2644. &tx_tid->pending_ppdu_q);
  2645. } else {
  2646. ppdu_nbuf = qdf_nbuf_queue_next(ppdu_nbuf);
  2647. }
  2648. }
  2649. qdf_nbuf_queue_free(&xretry_user->mpdu_q);
  2650. }
  2651. static
  2652. struct cdp_tx_completion_ppdu *
  2653. check_subseq_ppdu_to_pending_q(struct dp_tx_cap_nbuf_list nbuf_ppdu_list[],
  2654. uint32_t ppdu_desc_cnt,
  2655. uint32_t *ppdu_cnt,
  2656. qdf_nbuf_queue_t *head_ppdu,
  2657. uint32_t peer_id, uint32_t cur_last_seq,
  2658. bool last_pend_ppdu)
  2659. {
  2660. struct cdp_tx_completion_ppdu *next_ppdu = NULL;
  2661. struct cdp_tx_completion_ppdu_user *next_user;
  2662. struct dp_tx_cap_nbuf_list *ptr_nbuf_list = NULL;
  2663. uint8_t cur_usr_idx;
  2664. while (*ppdu_cnt < (ppdu_desc_cnt - 1)) {
  2665. (*ppdu_cnt)++;
  2666. ptr_nbuf_list = &nbuf_ppdu_list[*ppdu_cnt];
  2667. if (!ptr_nbuf_list->nbuf_ppdu ||
  2668. !dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list))
  2669. continue;
  2670. next_ppdu = (struct cdp_tx_completion_ppdu *)
  2671. qdf_nbuf_data(ptr_nbuf_list->nbuf_ppdu);
  2672. if (!next_ppdu)
  2673. continue;
  2674. cur_usr_idx = dp_tx_find_usr_idx_from_peer_id(next_ppdu,
  2675. peer_id);
  2676. next_user = &next_ppdu->user[cur_usr_idx];
  2677. if ((next_user->skip == 1) || (peer_id != next_user->peer_id))
  2678. continue;
  2679. if (last_pend_ppdu) {
  2680. qdf_nbuf_t tmp_pend_nbuf;
  2681. uint32_t ppdu_ref_cnt;
  2682. /*
  2683. * get reference count if it
  2684. * more than one do clone and
  2685. * add that to head_ppdu
  2686. */
  2687. ppdu_ref_cnt =
  2688. dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list);
  2689. if (ppdu_ref_cnt == 1) {
  2690. tmp_pend_nbuf = ptr_nbuf_list->nbuf_ppdu;
  2691. } else {
  2692. tmp_pend_nbuf = qdf_nbuf_clone(
  2693. ptr_nbuf_list->nbuf_ppdu);
  2694. if (qdf_unlikely(!tmp_pend_nbuf)) {
  2695. qdf_assert_always(0);
  2696. continue;
  2697. }
  2698. qdf_nbuf_free(ptr_nbuf_list->nbuf_ppdu);
  2699. }
  2700. qdf_nbuf_queue_add(head_ppdu, tmp_pend_nbuf);
  2701. /* decrement reference */
  2702. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  2703. }
  2704. if (next_user->last_enq_seq > cur_last_seq)
  2705. return next_ppdu;
  2706. }
  2707. return NULL;
  2708. }
  2709. #define MAX_PENDING_PPDUS 32
  2710. static void
  2711. dp_tx_mon_proc_pending_ppdus(struct dp_pdev *pdev, struct dp_tx_tid *tx_tid,
  2712. struct dp_tx_cap_nbuf_list nbuf_ppdu_list[],
  2713. uint32_t ppdu_desc_cnt, qdf_nbuf_queue_t *head_ppdu,
  2714. uint32_t peer_id, uint8_t cur_usr_idx)
  2715. {
  2716. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  2717. struct cdp_tx_completion_ppdu *cur_ppdu_desc = NULL;
  2718. struct cdp_tx_completion_ppdu_user *user = NULL;
  2719. struct cdp_tx_completion_ppdu_user *cur_user = NULL;
  2720. struct dp_tx_cap_nbuf_list *ptr_nbuf_list = NULL;
  2721. qdf_nbuf_t pend_ppdu;
  2722. uint32_t ppdu_cnt;
  2723. uint32_t failed_seq;
  2724. uint32_t cur_index, cur_start_seq, cur_last_seq;
  2725. int i, k;
  2726. bool last_pend_ppdu = false;
  2727. uint8_t usr_idx;
  2728. pend_ppdu = qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q);
  2729. if (!pend_ppdu) {
  2730. for (ppdu_cnt = 0; ppdu_cnt < ppdu_desc_cnt; ppdu_cnt++) {
  2731. ptr_nbuf_list = &nbuf_ppdu_list[ppdu_cnt];
  2732. if (!dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list)) {
  2733. if (ptr_nbuf_list->nbuf_ppdu)
  2734. qdf_assert_always(0);
  2735. continue;
  2736. }
  2737. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2738. qdf_nbuf_data(ptr_nbuf_list->nbuf_ppdu);
  2739. if (!ppdu_desc)
  2740. continue;
  2741. user = &ppdu_desc->user[cur_usr_idx];
  2742. if ((user->skip == 1) || (peer_id != user->peer_id) ||
  2743. (tx_tid->tid != user->tid))
  2744. continue;
  2745. if ((user->pending_retries == 0) &&
  2746. qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q) &&
  2747. qdf_nbuf_is_queue_empty(head_ppdu)) {
  2748. dp_send_data_to_stack(pdev, ppdu_desc,
  2749. cur_usr_idx);
  2750. /* free ppd_desc from list */
  2751. dp_ppdu_desc_free(ptr_nbuf_list, cur_usr_idx);
  2752. } else {
  2753. qdf_nbuf_t tmp_pend_nbuf;
  2754. uint32_t ppdu_ref_cnt;
  2755. /*
  2756. * get reference count if it more than one
  2757. * do clone and add that to head_ppdu
  2758. */
  2759. ppdu_ref_cnt =
  2760. dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list);
  2761. if (ppdu_ref_cnt == 1) {
  2762. tmp_pend_nbuf =
  2763. ptr_nbuf_list->nbuf_ppdu;
  2764. } else {
  2765. tmp_pend_nbuf =
  2766. qdf_nbuf_clone(
  2767. ptr_nbuf_list->nbuf_ppdu);
  2768. if (qdf_unlikely(!tmp_pend_nbuf)) {
  2769. qdf_assert_always(0);
  2770. continue;
  2771. }
  2772. /*
  2773. * free ppdu_desc to
  2774. * decrease reference
  2775. */
  2776. qdf_nbuf_free(ptr_nbuf_list->nbuf_ppdu);
  2777. }
  2778. qdf_nbuf_queue_add(head_ppdu, tmp_pend_nbuf);
  2779. /* decrement reference */
  2780. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  2781. }
  2782. }
  2783. return;
  2784. }
  2785. while (pend_ppdu) {
  2786. qdf_nbuf_t mpdu_nbuf;
  2787. uint32_t mpdu_tried = 0;
  2788. /* Find missing mpdus from current schedule list */
  2789. ppdu_cnt = 0;
  2790. while (ppdu_cnt < ppdu_desc_cnt) {
  2791. ptr_nbuf_list = &nbuf_ppdu_list[ppdu_cnt];
  2792. ppdu_cnt++;
  2793. if (!dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list))
  2794. continue;
  2795. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2796. qdf_nbuf_data(ptr_nbuf_list->nbuf_ppdu);
  2797. if (!cur_ppdu_desc)
  2798. continue;
  2799. cur_usr_idx = dp_tx_find_usr_idx_from_peer_id(
  2800. cur_ppdu_desc, peer_id);
  2801. cur_user = &cur_ppdu_desc->user[cur_usr_idx];
  2802. if (cur_user->skip == 1)
  2803. continue;
  2804. /* to handle last ppdu case we need to decrement */
  2805. ppdu_cnt--;
  2806. break;
  2807. }
  2808. if (ppdu_cnt == ppdu_desc_cnt)
  2809. break;
  2810. if (qdf_unlikely(!cur_user))
  2811. break;
  2812. ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(
  2813. pend_ppdu);
  2814. usr_idx = dp_tx_find_usr_idx_from_peer_id(ppdu_desc,
  2815. peer_id);
  2816. user = &ppdu_desc->user[usr_idx];
  2817. if (pend_ppdu == qdf_nbuf_queue_last(
  2818. &tx_tid->pending_ppdu_q)) {
  2819. qdf_nbuf_t tmp_pend_nbuf;
  2820. uint32_t ppdu_ref_cnt;
  2821. last_pend_ppdu = true;
  2822. /*
  2823. * get reference count if it more than one
  2824. * do clone and add that to head_ppdu
  2825. */
  2826. ppdu_ref_cnt =
  2827. dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list);
  2828. if (ppdu_ref_cnt == 1) {
  2829. tmp_pend_nbuf =
  2830. ptr_nbuf_list->nbuf_ppdu;
  2831. } else {
  2832. tmp_pend_nbuf = qdf_nbuf_clone(
  2833. ptr_nbuf_list->nbuf_ppdu);
  2834. if (qdf_unlikely(!tmp_pend_nbuf)) {
  2835. qdf_assert_always(0);
  2836. break;
  2837. }
  2838. qdf_nbuf_free(ptr_nbuf_list->nbuf_ppdu);
  2839. }
  2840. qdf_nbuf_queue_add(head_ppdu, tmp_pend_nbuf);
  2841. /* decrement reference */
  2842. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  2843. }
  2844. cur_index = 0;
  2845. cur_start_seq = cur_user->start_seq;
  2846. cur_last_seq = cur_user->last_enq_seq;
  2847. if (qdf_unlikely(user->ba_size >
  2848. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  2849. SEQ_SEG_SZ_BITS(user->failed_bitmap))) {
  2850. dp_ppdu_desc_debug_print(ppdu_desc, usr_idx,
  2851. __func__, __LINE__);
  2852. qdf_assert_always(0);
  2853. return;
  2854. }
  2855. /* mpdu tried */
  2856. mpdu_tried = user->mpdu_tried_mcast + user->mpdu_tried_ucast;
  2857. for (i = 0; (i < user->ba_size) && cur_ppdu_desc &&
  2858. mpdu_tried && cur_index < cur_user->ba_size; i++) {
  2859. if (!(i & (SEQ_SEG_SZ_BITS(user->failed_bitmap) - 1))) {
  2860. k = SEQ_SEG_INDEX(user->failed_bitmap, i);
  2861. failed_seq = user->failed_bitmap[k] ^
  2862. user->enq_bitmap[k];
  2863. }
  2864. if (SEQ_BIT(user->enq_bitmap, i))
  2865. mpdu_tried--;
  2866. /* Skip to next bitmap segment if there are no
  2867. * more holes in current segment
  2868. */
  2869. if (!failed_seq) {
  2870. i = ((k + 1) *
  2871. SEQ_SEG_SZ_BITS(user->failed_bitmap)) - 1;
  2872. continue;
  2873. }
  2874. if (!(SEQ_SEG_BIT(failed_seq, i)))
  2875. continue;
  2876. failed_seq ^= SEQ_SEG_MSK(failed_seq, i);
  2877. if (!cur_user->mpdus) {
  2878. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2879. QDF_TRACE_LEVEL_INFO,
  2880. "%s: %d peer_id:%d usr_idx:%d cur_usr_idx:%d cur_usr_peer_id:%d\n",
  2881. __func__, __LINE__,
  2882. peer_id, usr_idx,
  2883. cur_usr_idx, cur_user->peer_id);
  2884. continue;
  2885. }
  2886. mpdu_nbuf = cur_user->mpdus[cur_index];
  2887. if (mpdu_nbuf) {
  2888. struct dp_peer *peer;
  2889. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2890. QDF_TRACE_LEVEL_INFO,
  2891. "%s: fill seqno %d (%d) from swretries",
  2892. __func__,
  2893. user->start_seq + i,
  2894. ppdu_desc->ppdu_id);
  2895. user->mpdus[i] =
  2896. qdf_nbuf_copy_expand_fraglist(
  2897. mpdu_nbuf, MAX_MONITOR_HEADER, 0);
  2898. peer = dp_tx_cap_peer_find_by_id(pdev->soc,
  2899. user->peer_id);
  2900. if (peer) {
  2901. dp_tx_cap_stats_mpdu_update(peer,
  2902. PEER_MPDU_CLONE, 1);
  2903. dp_tx_cap_peer_unref_del(peer);
  2904. }
  2905. user->failed_bitmap[k] |=
  2906. SEQ_SEG_MSK(user->failed_bitmap[k], i);
  2907. user->pending_retries--;
  2908. }
  2909. cur_index++;
  2910. if (cur_index >= cur_user->ba_size) {
  2911. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  2912. QDF_TRACE_LEVEL_INFO,
  2913. "%s: ba_size[%d] cur_index[%d]\n",
  2914. __func__,
  2915. cur_user->ba_size, cur_index);
  2916. break;
  2917. }
  2918. /* Skip through empty slots in current PPDU */
  2919. while (!(SEQ_BIT(cur_user->enq_bitmap, cur_index))) {
  2920. cur_index++;
  2921. if (cur_index <= (cur_last_seq - cur_start_seq))
  2922. continue;
  2923. cur_ppdu_desc = NULL;
  2924. /*
  2925. * Check if subsequent PPDUs in this schedule
  2926. * has higher sequence numbers enqueued
  2927. */
  2928. cur_ppdu_desc = check_subseq_ppdu_to_pending_q(
  2929. nbuf_ppdu_list,
  2930. ppdu_desc_cnt,
  2931. &ppdu_cnt,
  2932. head_ppdu,
  2933. peer_id,
  2934. cur_last_seq,
  2935. last_pend_ppdu);
  2936. if (!cur_ppdu_desc)
  2937. break;
  2938. cur_usr_idx = dp_tx_find_usr_idx_from_peer_id(
  2939. cur_ppdu_desc, peer_id);
  2940. cur_user = &cur_ppdu_desc->user[cur_usr_idx];
  2941. /* Start from seq. no following cur_last_seq
  2942. * since everything before is already populated
  2943. * from previous PPDU
  2944. */
  2945. cur_start_seq = cur_user->start_seq;
  2946. cur_index = (cur_last_seq >= cur_start_seq) ?
  2947. cur_last_seq - cur_start_seq + 1 : 0;
  2948. cur_last_seq = cur_user->last_enq_seq;
  2949. }
  2950. }
  2951. if ((pend_ppdu ==
  2952. qdf_nbuf_queue_first(&tx_tid->pending_ppdu_q)) &&
  2953. (user->pending_retries == 0)) {
  2954. qdf_nbuf_queue_remove(&tx_tid->pending_ppdu_q);
  2955. dp_send_data_to_stack(pdev, ppdu_desc, usr_idx);
  2956. dp_ppdu_queue_free(pend_ppdu, usr_idx);
  2957. qdf_nbuf_free(pend_ppdu);
  2958. pend_ppdu = qdf_nbuf_queue_first(
  2959. &tx_tid->pending_ppdu_q);
  2960. } else {
  2961. pend_ppdu = qdf_nbuf_queue_next(pend_ppdu);
  2962. }
  2963. }
  2964. }
  2965. static uint32_t
  2966. dp_send_mgmt_ctrl_to_stack(struct dp_pdev *pdev,
  2967. qdf_nbuf_t nbuf_ppdu_desc,
  2968. struct cdp_tx_indication_info *ptr_tx_cap_info,
  2969. qdf_nbuf_t mgmt_ctl_nbuf,
  2970. bool is_payload)
  2971. {
  2972. struct cdp_tx_completion_ppdu *ppdu_desc;
  2973. struct cdp_tx_completion_ppdu_user *user;
  2974. struct cdp_tx_indication_mpdu_info *mpdu_info;
  2975. struct ieee80211_frame *wh;
  2976. uint16_t duration_le, seq_le;
  2977. struct ieee80211_frame_min_one *wh_min;
  2978. uint16_t frame_ctrl_le;
  2979. uint8_t type, subtype;
  2980. mpdu_info = &ptr_tx_cap_info->mpdu_info;
  2981. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  2982. qdf_nbuf_data(nbuf_ppdu_desc);
  2983. user = &ppdu_desc->user[0];
  2984. if (ppdu_desc->mprot_type)
  2985. dp_send_dummy_rts_cts_frame(pdev, ppdu_desc, 0);
  2986. type = (ppdu_desc->frame_ctrl &
  2987. IEEE80211_FC0_TYPE_MASK) >>
  2988. IEEE80211_FC0_TYPE_SHIFT;
  2989. subtype = (ppdu_desc->frame_ctrl &
  2990. IEEE80211_FC0_SUBTYPE_MASK) >>
  2991. IEEE80211_FC0_SUBTYPE_SHIFT;
  2992. if (is_payload) {
  2993. wh = (struct ieee80211_frame *)qdf_nbuf_data(mgmt_ctl_nbuf);
  2994. if (subtype != IEEE80211_FC0_SUBTYPE_BEACON) {
  2995. duration_le = qdf_cpu_to_le16(ppdu_desc->tx_duration);
  2996. wh->i_dur[1] = (duration_le & 0xFF00) >> 8;
  2997. wh->i_dur[0] = duration_le & 0xFF;
  2998. seq_le = qdf_cpu_to_le16(user->start_seq <<
  2999. IEEE80211_SEQ_SEQ_SHIFT);
  3000. wh->i_seq[1] = (seq_le & 0xFF00) >> 8;
  3001. wh->i_seq[0] = seq_le & 0xFF;
  3002. }
  3003. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3004. QDF_TRACE_LEVEL_DEBUG,
  3005. "ctrl/mgmt frm(0x%08x): fc 0x%x 0x%x\n",
  3006. ptr_tx_cap_info->mpdu_info.ppdu_id,
  3007. wh->i_fc[1], wh->i_fc[0]);
  3008. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3009. QDF_TRACE_LEVEL_DEBUG,
  3010. "desc->ppdu_id 0x%08x\n", ppdu_desc->ppdu_id);
  3011. /* append ext list */
  3012. qdf_nbuf_append_ext_list(ptr_tx_cap_info->mpdu_nbuf,
  3013. mgmt_ctl_nbuf,
  3014. qdf_nbuf_len(mgmt_ctl_nbuf));
  3015. } else {
  3016. wh_min = (struct ieee80211_frame_min_one *)
  3017. qdf_nbuf_data(ptr_tx_cap_info->mpdu_nbuf);
  3018. qdf_mem_zero(wh_min, MAX_DUMMY_FRM_BODY);
  3019. frame_ctrl_le = qdf_cpu_to_le16(ppdu_desc->frame_ctrl);
  3020. duration_le = qdf_cpu_to_le16(ppdu_desc->tx_duration);
  3021. wh_min->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  3022. wh_min->i_fc[0] = (frame_ctrl_le & 0xFF);
  3023. wh_min->i_dur[1] = (duration_le & 0xFF00) >> 8;
  3024. wh_min->i_dur[0] = (duration_le & 0xFF);
  3025. qdf_mem_copy(wh_min->i_addr1, mpdu_info->mac_address,
  3026. QDF_MAC_ADDR_SIZE);
  3027. qdf_nbuf_set_pktlen(ptr_tx_cap_info->mpdu_nbuf,
  3028. sizeof(*wh_min));
  3029. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3030. QDF_TRACE_LEVEL_DEBUG,
  3031. "frm(0x%08x): fc %x %x, dur 0x%x%x\n",
  3032. ptr_tx_cap_info->mpdu_info.ppdu_id,
  3033. wh_min->i_fc[1], wh_min->i_fc[0],
  3034. wh_min->i_dur[1], wh_min->i_dur[0]);
  3035. }
  3036. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  3037. ptr_tx_cap_info, HTT_INVALID_PEER,
  3038. WDI_NO_VAL, pdev->pdev_id);
  3039. if (ptr_tx_cap_info->mpdu_nbuf)
  3040. qdf_nbuf_free(ptr_tx_cap_info->mpdu_nbuf);
  3041. return 0;
  3042. }
  3043. static uint32_t
  3044. dp_update_tx_cap_info(struct dp_pdev *pdev,
  3045. qdf_nbuf_t nbuf_ppdu_desc,
  3046. void *tx_info, bool is_payload,
  3047. bool bar_frm_with_data)
  3048. {
  3049. struct cdp_tx_completion_ppdu *ppdu_desc;
  3050. struct cdp_tx_completion_ppdu_user *user;
  3051. struct cdp_tx_indication_info *tx_capture_info =
  3052. (struct cdp_tx_indication_info *)tx_info;
  3053. struct cdp_tx_indication_mpdu_info *mpdu_info;
  3054. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  3055. qdf_nbuf_data(nbuf_ppdu_desc);
  3056. user = &ppdu_desc->user[0];
  3057. qdf_mem_set(tx_capture_info, sizeof(struct cdp_tx_indication_info), 0);
  3058. mpdu_info = &tx_capture_info->mpdu_info;
  3059. mpdu_info->channel = ppdu_desc->channel;
  3060. mpdu_info->frame_type = ppdu_desc->frame_type;
  3061. mpdu_info->ppdu_start_timestamp = ppdu_desc->ppdu_start_timestamp;
  3062. mpdu_info->ppdu_end_timestamp = ppdu_desc->ppdu_end_timestamp;
  3063. mpdu_info->tx_duration = ppdu_desc->tx_duration;
  3064. /* update cdp_tx_indication_mpdu_info */
  3065. dp_tx_update_user_mpdu_info(ppdu_desc->ppdu_id,
  3066. &tx_capture_info->mpdu_info,
  3067. user);
  3068. if (bar_frm_with_data) {
  3069. mpdu_info->ppdu_start_timestamp =
  3070. ppdu_desc->bar_ppdu_start_timestamp;
  3071. mpdu_info->ppdu_end_timestamp =
  3072. ppdu_desc->bar_ppdu_end_timestamp;
  3073. mpdu_info->tx_duration = ppdu_desc->bar_tx_duration;
  3074. mpdu_info->preamble = ppdu_desc->phy_mode;
  3075. }
  3076. mpdu_info->seq_no = user->start_seq;
  3077. mpdu_info->num_msdu = ppdu_desc->num_msdu;
  3078. tx_capture_info->ppdu_desc = ppdu_desc;
  3079. tx_capture_info->mpdu_info.channel_num = pdev->operating_channel.num;
  3080. tx_capture_info->mpdu_info.ppdu_id = ppdu_desc->ppdu_id;
  3081. if (is_payload)
  3082. tx_capture_info->mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  3083. MAX_MONITOR_HEADER,
  3084. MAX_MONITOR_HEADER,
  3085. 4, FALSE);
  3086. else
  3087. tx_capture_info->mpdu_nbuf = qdf_nbuf_alloc(pdev->soc->osdev,
  3088. MAX_MONITOR_HEADER +
  3089. MAX_DUMMY_FRM_BODY,
  3090. MAX_MONITOR_HEADER,
  3091. 4, FALSE);
  3092. return 0;
  3093. }
  3094. static uint32_t
  3095. dp_check_mgmt_ctrl_ppdu(struct dp_pdev *pdev,
  3096. qdf_nbuf_t nbuf_ppdu_desc, bool bar_frm_with_data)
  3097. {
  3098. struct cdp_tx_indication_info tx_capture_info;
  3099. qdf_nbuf_t mgmt_ctl_nbuf, tmp_nbuf;
  3100. uint8_t type, subtype;
  3101. uint8_t fc_type, fc_subtype;
  3102. bool is_sgen_pkt;
  3103. struct cdp_tx_mgmt_comp_info *ptr_comp_info;
  3104. qdf_nbuf_queue_t *retries_q;
  3105. struct cdp_tx_completion_ppdu *ppdu_desc, *retry_ppdu;
  3106. struct cdp_tx_completion_ppdu_user *user;
  3107. uint32_t ppdu_id;
  3108. uint32_t desc_ppdu_id;
  3109. size_t head_size;
  3110. uint32_t status = 1;
  3111. uint32_t tsf_delta;
  3112. uint64_t start_tsf;
  3113. uint64_t end_tsf;
  3114. uint16_t ppdu_desc_frame_ctrl;
  3115. struct dp_peer *peer;
  3116. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  3117. qdf_nbuf_data(nbuf_ppdu_desc);
  3118. user = &ppdu_desc->user[0];
  3119. ppdu_desc_frame_ctrl = ppdu_desc->frame_ctrl;
  3120. if ((ppdu_desc->htt_frame_type == HTT_STATS_FTYPE_SGEN_MU_BAR) ||
  3121. (ppdu_desc->htt_frame_type == HTT_STATS_FTYPE_SGEN_MU_BRP))
  3122. ppdu_desc_frame_ctrl = (IEEE80211_FC0_SUBTYPE_TRIGGER |
  3123. IEEE80211_FC0_TYPE_CTL);
  3124. if (bar_frm_with_data) {
  3125. desc_ppdu_id = ppdu_desc->bar_ppdu_id;
  3126. start_tsf = ppdu_desc->bar_ppdu_start_timestamp;
  3127. end_tsf = ppdu_desc->bar_ppdu_end_timestamp;
  3128. } else {
  3129. desc_ppdu_id = ppdu_desc->ppdu_id;
  3130. start_tsf = ppdu_desc->ppdu_start_timestamp;
  3131. end_tsf = ppdu_desc->ppdu_end_timestamp;
  3132. }
  3133. /*
  3134. * only for host generated frame we do have
  3135. * timestamp and retries count.
  3136. */
  3137. head_size = sizeof(struct cdp_tx_mgmt_comp_info);
  3138. fc_type = (ppdu_desc_frame_ctrl &
  3139. IEEE80211_FC0_TYPE_MASK);
  3140. fc_subtype = (ppdu_desc_frame_ctrl &
  3141. IEEE80211_FC0_SUBTYPE_MASK);
  3142. type = (ppdu_desc_frame_ctrl &
  3143. IEEE80211_FC0_TYPE_MASK) >>
  3144. IEEE80211_FC0_TYPE_SHIFT;
  3145. subtype = (ppdu_desc_frame_ctrl &
  3146. IEEE80211_FC0_SUBTYPE_MASK) >>
  3147. IEEE80211_FC0_SUBTYPE_SHIFT;
  3148. if (ppdu_desc->htt_frame_type == HTT_STATS_FTYPE_SGEN_NDP) {
  3149. dp_update_frame_ctrl_from_frame_type(ppdu_desc);
  3150. type = 0;
  3151. subtype = 0;
  3152. }
  3153. peer = dp_tx_cap_peer_find_by_id(pdev->soc, ppdu_desc->user[0].peer_id);
  3154. if (peer && !peer->bss_peer) {
  3155. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, peer,
  3156. ppdu_desc->user[0].mac_addr
  3157. )) {
  3158. qdf_nbuf_free(nbuf_ppdu_desc);
  3159. status = 0;
  3160. dp_tx_cap_peer_unref_del(peer);
  3161. goto free_ppdu_desc;
  3162. }
  3163. dp_tx_cap_peer_unref_del(peer);
  3164. } else {
  3165. if (peer)
  3166. dp_tx_cap_peer_unref_del(peer);
  3167. if (!(type == IEEE80211_FC0_TYPE_MGT &&
  3168. (subtype == MGMT_SUBTYPE_PROBE_RESP >> 4 ||
  3169. subtype == MGMT_SUBTYPE_DISASSOC >> 4 ||
  3170. subtype == MGMT_SUBTYPE_DEAUTH >> 4))) {
  3171. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, NULL,
  3172. ppdu_desc->user[0]
  3173. .mac_addr)) {
  3174. qdf_nbuf_free(nbuf_ppdu_desc);
  3175. status = 0;
  3176. goto free_ppdu_desc;
  3177. }
  3178. }
  3179. }
  3180. switch (ppdu_desc->htt_frame_type) {
  3181. case HTT_STATS_FTYPE_TIDQ_DATA_SU:
  3182. case HTT_STATS_FTYPE_TIDQ_DATA_MU:
  3183. if ((fc_type == IEEE80211_FC0_TYPE_MGT) &&
  3184. (fc_subtype == IEEE80211_FC0_SUBTYPE_BEACON))
  3185. is_sgen_pkt = true;
  3186. else
  3187. is_sgen_pkt = false;
  3188. break;
  3189. default:
  3190. is_sgen_pkt = true;
  3191. break;
  3192. }
  3193. retries_q = &pdev->tx_capture.retries_ctl_mgmt_q[type][subtype];
  3194. if (!qdf_nbuf_is_queue_empty(retries_q)) {
  3195. tmp_nbuf = qdf_nbuf_queue_first(retries_q);
  3196. retry_ppdu = (struct cdp_tx_completion_ppdu *)
  3197. qdf_nbuf_data(tmp_nbuf);
  3198. if (ppdu_desc->sched_cmdid != retry_ppdu->sched_cmdid)
  3199. qdf_nbuf_queue_free(retries_q);
  3200. }
  3201. get_mgmt_pkt_from_queue:
  3202. qdf_spin_lock_bh(
  3203. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  3204. mgmt_ctl_nbuf = qdf_nbuf_queue_remove(
  3205. &pdev->tx_capture.ctl_mgmt_q[type][subtype]);
  3206. qdf_spin_unlock_bh(&pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  3207. if (mgmt_ctl_nbuf) {
  3208. qdf_nbuf_t tmp_mgmt_ctl_nbuf;
  3209. ptr_comp_info = (struct cdp_tx_mgmt_comp_info *)
  3210. qdf_nbuf_data(mgmt_ctl_nbuf);
  3211. is_sgen_pkt = ptr_comp_info->is_sgen_pkt;
  3212. ppdu_id = ptr_comp_info->ppdu_id;
  3213. if (!is_sgen_pkt && ptr_comp_info->tx_tsf < start_tsf) {
  3214. /*
  3215. * free the older mgmt buffer from
  3216. * the queue and get new mgmt buffer
  3217. */
  3218. qdf_nbuf_free(mgmt_ctl_nbuf);
  3219. goto get_mgmt_pkt_from_queue;
  3220. }
  3221. /*
  3222. * for sgen frame we won't have, retries count
  3223. * and 64 bits tsf in the head.
  3224. */
  3225. if (ppdu_id != desc_ppdu_id) {
  3226. if (is_sgen_pkt) {
  3227. start_tsf = (start_tsf & LOWER_32_MASK);
  3228. if (start_tsf > ptr_comp_info->tx_tsf)
  3229. tsf_delta = start_tsf -
  3230. ptr_comp_info->tx_tsf;
  3231. else
  3232. tsf_delta = LOWER_32_MASK -
  3233. ptr_comp_info->tx_tsf +
  3234. start_tsf;
  3235. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3236. QDF_TRACE_LEVEL_INFO,
  3237. "%s: ppdu_id[m:%d desc:%d] start_tsf: %u mgmt_tsf:%u tsf_delta:%u bar_frm_with_data:%d",
  3238. __func__, ppdu_id, desc_ppdu_id,
  3239. start_tsf, ptr_comp_info->tx_tsf,
  3240. tsf_delta, bar_frm_with_data);
  3241. if (tsf_delta > MAX_MGMT_ENQ_DELAY) {
  3242. /*
  3243. * free the older mgmt buffer from
  3244. * the queue and get new mgmt buffer
  3245. */
  3246. qdf_nbuf_free(mgmt_ctl_nbuf);
  3247. goto get_mgmt_pkt_from_queue;
  3248. } else {
  3249. /* drop the ppdu_desc */
  3250. qdf_nbuf_free(nbuf_ppdu_desc);
  3251. status = 0;
  3252. goto insert_mgmt_buf_to_queue;
  3253. }
  3254. }
  3255. /*
  3256. * only for the packets send over the air are handled
  3257. * packets drop by firmware is not handled in this
  3258. * feature
  3259. */
  3260. if (user->completion_status ==
  3261. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  3262. qdf_nbuf_free(nbuf_ppdu_desc);
  3263. status = 0;
  3264. goto insert_mgmt_buf_to_queue;
  3265. }
  3266. /* check for max retry count */
  3267. if (qdf_nbuf_queue_len(retries_q) >=
  3268. MAX_RETRY_Q_COUNT) {
  3269. qdf_nbuf_t nbuf_retry_ppdu;
  3270. nbuf_retry_ppdu =
  3271. qdf_nbuf_queue_remove(retries_q);
  3272. qdf_nbuf_free(nbuf_retry_ppdu);
  3273. }
  3274. /*
  3275. * add the ppdu_desc into retry queue
  3276. */
  3277. qdf_nbuf_queue_add(retries_q, nbuf_ppdu_desc);
  3278. /* flushing retry queue since completion status is
  3279. * in final state. meaning that even though ppdu_id are
  3280. * different there is a payload already.
  3281. */
  3282. if (qdf_unlikely(ppdu_desc->user[0].completion_status ==
  3283. HTT_PPDU_STATS_USER_STATUS_OK)) {
  3284. qdf_nbuf_queue_free(retries_q);
  3285. }
  3286. status = 0;
  3287. insert_mgmt_buf_to_queue:
  3288. /*
  3289. * insert the mgmt_ctl buffer back to
  3290. * the queue
  3291. */
  3292. qdf_spin_lock_bh(
  3293. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  3294. qdf_nbuf_queue_insert_head(
  3295. &pdev->tx_capture.ctl_mgmt_q[type][subtype],
  3296. mgmt_ctl_nbuf);
  3297. qdf_spin_unlock_bh(
  3298. &pdev->tx_capture.ctl_mgmt_lock[type][subtype]);
  3299. } else {
  3300. qdf_nbuf_t nbuf_retry_ppdu;
  3301. struct cdp_tx_completion_ppdu *tmp_ppdu_desc;
  3302. uint16_t frame_ctrl_le;
  3303. struct ieee80211_frame *wh;
  3304. uint32_t retry_len = 0;
  3305. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3306. QDF_TRACE_LEVEL_INFO,
  3307. "%s: ppdu_id[m:%d desc:%d] start_tsf: %u mgmt_tsf:%u bar_frm_with_data:%d is_sgen:%d",
  3308. __func__, ppdu_id, desc_ppdu_id,
  3309. start_tsf, ptr_comp_info->tx_tsf,
  3310. bar_frm_with_data, is_sgen_pkt);
  3311. /*
  3312. * only for the packets send over the air are handled
  3313. * packets drop by firmware is not handled in this
  3314. * feature
  3315. */
  3316. if (user->completion_status ==
  3317. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  3318. qdf_nbuf_free(nbuf_ppdu_desc);
  3319. qdf_nbuf_free(mgmt_ctl_nbuf);
  3320. status = 0;
  3321. goto free_ppdu_desc;
  3322. }
  3323. /* pull head based on sgen pkt or mgmt pkt */
  3324. if (NULL == qdf_nbuf_pull_head(mgmt_ctl_nbuf,
  3325. head_size)) {
  3326. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3327. QDF_TRACE_LEVEL_FATAL,
  3328. " No Head space to pull !!\n");
  3329. qdf_assert_always(0);
  3330. }
  3331. wh = (struct ieee80211_frame *)
  3332. (qdf_nbuf_data(mgmt_ctl_nbuf));
  3333. if (type == IEEE80211_FC0_TYPE_MGT &&
  3334. (subtype == MGMT_SUBTYPE_PROBE_RESP >> 4 ||
  3335. subtype == MGMT_SUBTYPE_DISASSOC >> 4 ||
  3336. subtype == MGMT_SUBTYPE_DEAUTH >> 4)) {
  3337. if (!dp_peer_or_pdev_tx_cap_enabled(pdev,
  3338. NULL,
  3339. wh->i_addr1
  3340. )) {
  3341. qdf_nbuf_free(nbuf_ppdu_desc);
  3342. qdf_nbuf_free(mgmt_ctl_nbuf);
  3343. qdf_nbuf_queue_free(retries_q);
  3344. status = 0;
  3345. goto free_ppdu_desc;
  3346. }
  3347. }
  3348. while (qdf_nbuf_queue_len(retries_q)) {
  3349. /*
  3350. * send retried packet stored
  3351. * in queue
  3352. */
  3353. nbuf_retry_ppdu =
  3354. qdf_nbuf_queue_remove(retries_q);
  3355. retry_len = qdf_nbuf_queue_len(retries_q);
  3356. if (!nbuf_retry_ppdu) {
  3357. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3358. QDF_TRACE_LEVEL_FATAL,
  3359. "%s: %d retry q type[%d][%d] retry q len = %d\n",
  3360. __func__, __LINE__,
  3361. type, subtype, retry_len);
  3362. qdf_assert_always(0);
  3363. break;
  3364. }
  3365. tmp_ppdu_desc =
  3366. (struct cdp_tx_completion_ppdu *)
  3367. qdf_nbuf_data(nbuf_retry_ppdu);
  3368. tmp_mgmt_ctl_nbuf =
  3369. qdf_nbuf_copy_expand(mgmt_ctl_nbuf,
  3370. 0, 0);
  3371. if (qdf_unlikely(!tmp_mgmt_ctl_nbuf)) {
  3372. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3373. QDF_TRACE_LEVEL_FATAL,
  3374. "No memory to do copy!!");
  3375. qdf_assert_always(0);
  3376. }
  3377. dp_update_tx_cap_info(pdev, nbuf_retry_ppdu,
  3378. &tx_capture_info, true,
  3379. bar_frm_with_data);
  3380. if (!tx_capture_info.mpdu_nbuf) {
  3381. qdf_nbuf_free(nbuf_retry_ppdu);
  3382. qdf_nbuf_free(tmp_mgmt_ctl_nbuf);
  3383. continue;
  3384. }
  3385. /*
  3386. * frame control from ppdu_desc has
  3387. * retry flag set
  3388. */
  3389. frame_ctrl_le =
  3390. qdf_cpu_to_le16(tmp_ppdu_desc->frame_ctrl);
  3391. wh = (struct ieee80211_frame *)
  3392. (qdf_nbuf_data(tmp_mgmt_ctl_nbuf));
  3393. wh->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  3394. wh->i_fc[0] = (frame_ctrl_le & 0xFF);
  3395. tx_capture_info.ppdu_desc = tmp_ppdu_desc;
  3396. /*
  3397. * send MPDU to osif layer
  3398. */
  3399. dp_send_mgmt_ctrl_to_stack(pdev,
  3400. nbuf_retry_ppdu,
  3401. &tx_capture_info,
  3402. tmp_mgmt_ctl_nbuf,
  3403. true);
  3404. /* free retried queue nbuf ppdu_desc */
  3405. qdf_nbuf_free(nbuf_retry_ppdu);
  3406. }
  3407. dp_update_tx_cap_info(pdev, nbuf_ppdu_desc,
  3408. &tx_capture_info, true,
  3409. bar_frm_with_data);
  3410. if (!tx_capture_info.mpdu_nbuf) {
  3411. qdf_nbuf_free(mgmt_ctl_nbuf);
  3412. qdf_nbuf_free(nbuf_ppdu_desc);
  3413. status = 0;
  3414. goto free_ppdu_desc;
  3415. }
  3416. tx_capture_info.mpdu_info.ppdu_id =
  3417. *(uint32_t *)qdf_nbuf_data(mgmt_ctl_nbuf);
  3418. /* frame control from ppdu_desc has retry flag set */
  3419. frame_ctrl_le = qdf_cpu_to_le16(ppdu_desc_frame_ctrl);
  3420. wh = (struct ieee80211_frame *)
  3421. (qdf_nbuf_data(mgmt_ctl_nbuf));
  3422. wh->i_fc[1] = (frame_ctrl_le & 0xFF00) >> 8;
  3423. wh->i_fc[0] = (frame_ctrl_le & 0xFF);
  3424. tx_capture_info.ppdu_desc = ppdu_desc;
  3425. /*
  3426. * send MPDU to osif layer
  3427. */
  3428. dp_send_mgmt_ctrl_to_stack(pdev, nbuf_ppdu_desc,
  3429. &tx_capture_info,
  3430. mgmt_ctl_nbuf, true);
  3431. }
  3432. } else if (!is_sgen_pkt) {
  3433. /*
  3434. * only for the packets send over the air are handled
  3435. * packets drop by firmware is not handled in this
  3436. * feature
  3437. */
  3438. if (user->completion_status ==
  3439. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  3440. qdf_nbuf_free(nbuf_ppdu_desc);
  3441. status = 0;
  3442. goto free_ppdu_desc;
  3443. }
  3444. /* check for max retry count */
  3445. if (qdf_nbuf_queue_len(retries_q) >= MAX_RETRY_Q_COUNT) {
  3446. qdf_nbuf_t nbuf_retry_ppdu;
  3447. nbuf_retry_ppdu =
  3448. qdf_nbuf_queue_remove(retries_q);
  3449. qdf_nbuf_free(nbuf_retry_ppdu);
  3450. }
  3451. /*
  3452. * add the ppdu_desc into retry queue
  3453. */
  3454. qdf_nbuf_queue_add(retries_q, nbuf_ppdu_desc);
  3455. /* flushing retry queue since completion status is
  3456. * in final state. meaning that even though ppdu_id are
  3457. * different there is a payload already.
  3458. */
  3459. if (qdf_unlikely(ppdu_desc->user[0].completion_status ==
  3460. HTT_PPDU_STATS_USER_STATUS_OK)) {
  3461. qdf_nbuf_queue_free(retries_q);
  3462. }
  3463. status = 0;
  3464. } else if ((ppdu_desc_frame_ctrl &
  3465. IEEE80211_FC0_TYPE_MASK) ==
  3466. IEEE80211_FC0_TYPE_CTL) {
  3467. /*
  3468. * only for the packets send over the air are handled
  3469. * packets drop by firmware is not handled in this
  3470. * feature
  3471. */
  3472. if (user->completion_status ==
  3473. HTT_PPDU_STATS_USER_STATUS_FILTERED) {
  3474. qdf_nbuf_free(nbuf_ppdu_desc);
  3475. status = 0;
  3476. goto free_ppdu_desc;
  3477. }
  3478. dp_update_tx_cap_info(pdev, nbuf_ppdu_desc,
  3479. &tx_capture_info, false,
  3480. bar_frm_with_data);
  3481. if (!tx_capture_info.mpdu_nbuf) {
  3482. qdf_nbuf_free(nbuf_ppdu_desc);
  3483. status = 0;
  3484. goto free_ppdu_desc;
  3485. }
  3486. /*
  3487. * send MPDU to osif layer
  3488. */
  3489. dp_send_mgmt_ctrl_to_stack(pdev, nbuf_ppdu_desc,
  3490. &tx_capture_info, NULL, false);
  3491. }
  3492. free_ppdu_desc:
  3493. return status;
  3494. }
  3495. /**
  3496. * dp_peer_tx_cap_tid_queue_flush_tlv(): Function to dequeue peer queue
  3497. * @pdev: DP pdev handle
  3498. * @peer; DP peer handle
  3499. * @ppdu_desc: ppdu_desc
  3500. *
  3501. * return: void
  3502. */
  3503. static void
  3504. dp_peer_tx_cap_tid_queue_flush_tlv(struct dp_pdev *pdev,
  3505. struct dp_peer *peer,
  3506. struct cdp_tx_completion_ppdu *ppdu_desc,
  3507. uint8_t usr_idx)
  3508. {
  3509. int tid;
  3510. struct dp_tx_tid *tx_tid;
  3511. qdf_nbuf_queue_t head_xretries;
  3512. qdf_nbuf_queue_t head_msdu;
  3513. uint32_t qlen = 0;
  3514. uint32_t qlen_curr = 0;
  3515. struct cdp_tx_completion_ppdu_user *xretry_user;
  3516. xretry_user = &ppdu_desc->user[usr_idx];
  3517. tid = xretry_user->tid;
  3518. tx_tid = &peer->tx_capture.tx_tid[tid];
  3519. qdf_nbuf_queue_init(&head_msdu);
  3520. qdf_nbuf_queue_init(&head_xretries);
  3521. qlen = qdf_nbuf_queue_len(&tx_tid->defer_msdu_q);
  3522. dp_tx_msdu_dequeue(peer, INVALID_PPDU_ID,
  3523. tid, ppdu_desc->num_msdu,
  3524. &head_msdu,
  3525. &head_xretries,
  3526. 0, MAX_END_TSF);
  3527. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_FLUSH,
  3528. qdf_nbuf_queue_len(&head_msdu));
  3529. dp_tx_cap_stats_msdu_update(peer, PEER_MSDU_FLUSH,
  3530. qdf_nbuf_queue_len(&head_xretries));
  3531. if (!qdf_nbuf_is_queue_empty(&head_xretries)) {
  3532. struct cdp_tx_completion_ppdu *xretry_ppdu =
  3533. &tx_tid->xretry_ppdu;
  3534. uint32_t xretry_qlen;
  3535. xretry_ppdu->ppdu_id = peer->tx_capture.tx_wifi_ppdu_id;
  3536. /* Restitch MPDUs from xretry MSDUs */
  3537. dp_tx_mon_restitch_mpdu(pdev, peer,
  3538. xretry_ppdu,
  3539. &head_xretries,
  3540. &xretry_user->mpdu_q,
  3541. 0);
  3542. xretry_qlen = qdf_nbuf_queue_len(&xretry_user->mpdu_q);
  3543. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_RESTITCH,
  3544. xretry_qlen);
  3545. }
  3546. qdf_nbuf_queue_free(&head_msdu);
  3547. qdf_nbuf_queue_free(&head_xretries);
  3548. qlen_curr = qdf_nbuf_queue_len(&tx_tid->defer_msdu_q);
  3549. dp_tx_mon_proc_xretries(pdev, peer, tid);
  3550. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3551. QDF_TRACE_LEVEL_INFO_MED,
  3552. "peer_id [%d 0x%x] tid[%d] qlen[%d -> %d]",
  3553. ppdu_desc->user[usr_idx].peer_id, peer, tid, qlen, qlen_curr);
  3554. }
  3555. /**
  3556. * dp_tx_ppdu_stats_flush(): Function to flush pending retried ppdu desc
  3557. * @pdev: DP pdev handle
  3558. * @nbuf: ppdu_desc
  3559. *
  3560. * return: void
  3561. */
  3562. static void
  3563. dp_tx_ppdu_stats_flush(struct dp_pdev *pdev,
  3564. struct cdp_tx_completion_ppdu *ppdu_desc,
  3565. uint8_t usr_idx)
  3566. {
  3567. struct dp_peer *peer;
  3568. struct cdp_tx_completion_ppdu_user *user;
  3569. user = &ppdu_desc->user[usr_idx];
  3570. peer = dp_tx_cap_peer_find_by_id(pdev->soc, user->peer_id);
  3571. if (!peer)
  3572. return;
  3573. dp_peer_tx_cap_tid_queue_flush_tlv(pdev, peer, ppdu_desc, usr_idx);
  3574. dp_tx_cap_peer_unref_del(peer);
  3575. return;
  3576. }
  3577. /**
  3578. * dp_check_ppdu_and_deliver(): Check PPDUs for any holes and deliver
  3579. * to upper layer if complete
  3580. * @pdev: DP pdev handle
  3581. * @nbuf_ppdu_list: ppdu_desc_list per sched cmd id
  3582. * @ppdu_desc_cnt: number of ppdu_desc_cnt
  3583. *
  3584. * return: status
  3585. */
  3586. static void
  3587. dp_check_ppdu_and_deliver(struct dp_pdev *pdev,
  3588. struct dp_tx_cap_nbuf_list nbuf_ppdu_list[],
  3589. uint32_t ppdu_desc_cnt)
  3590. {
  3591. uint32_t ppdu_id;
  3592. uint32_t desc_cnt;
  3593. qdf_nbuf_t tmp_nbuf;
  3594. struct dp_tx_tid *tx_tid = NULL;
  3595. int i;
  3596. uint8_t max_num_users = 0;
  3597. uint8_t usr_idx;
  3598. struct dp_tx_cap_nbuf_list *ptr_nbuf_list;
  3599. for (desc_cnt = 0; desc_cnt < ppdu_desc_cnt; desc_cnt++) {
  3600. struct cdp_tx_completion_ppdu *ppdu_desc;
  3601. struct cdp_tx_completion_ppdu_user *user;
  3602. uint32_t num_mpdu;
  3603. uint16_t start_seq, seq_no = 0;
  3604. int i;
  3605. qdf_nbuf_t mpdu_nbuf;
  3606. struct dp_peer *peer;
  3607. uint8_t type;
  3608. uint8_t subtype;
  3609. uint8_t usr_type;
  3610. uint32_t mpdus_tried;
  3611. uint8_t num_users;
  3612. qdf_nbuf_t nbuf_ppdu;
  3613. bool is_bar_frm_with_data = false;
  3614. ptr_nbuf_list = &nbuf_ppdu_list[desc_cnt];
  3615. if (!dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list)) {
  3616. if (ptr_nbuf_list->nbuf_ppdu)
  3617. qdf_assert_always(0);
  3618. continue;
  3619. }
  3620. nbuf_ppdu = ptr_nbuf_list->nbuf_ppdu;
  3621. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  3622. qdf_nbuf_data(nbuf_ppdu);
  3623. ppdu_id = ppdu_desc->ppdu_id;
  3624. num_users = ppdu_desc->num_users;
  3625. if (ppdu_desc->is_flush) {
  3626. dp_tx_ppdu_stats_flush(pdev, ppdu_desc, 0);
  3627. dp_ppdu_desc_free_all(ptr_nbuf_list, num_users);
  3628. continue;
  3629. }
  3630. if (max_num_users < ppdu_desc->num_users)
  3631. max_num_users = ppdu_desc->num_users;
  3632. type = (ppdu_desc->frame_ctrl & IEEE80211_FC0_TYPE_MASK);
  3633. subtype = (ppdu_desc->frame_ctrl &
  3634. IEEE80211_FC0_SUBTYPE_MASK);
  3635. usr_type = (ppdu_desc->user[0].frame_ctrl &
  3636. IEEE80211_FC0_TYPE_MASK);
  3637. /* handle management frame */
  3638. if ((type != IEEE80211_FC0_TYPE_DATA) ||
  3639. (ppdu_desc->htt_frame_type ==
  3640. HTT_STATS_FTYPE_SGEN_MU_BAR) ||
  3641. (ppdu_desc->htt_frame_type ==
  3642. HTT_STATS_FTYPE_SGEN_QOS_NULL)) {
  3643. qdf_nbuf_t tmp_nbuf_ppdu;
  3644. tmp_nbuf_ppdu = nbuf_ppdu;
  3645. /*
  3646. * take reference of ppdu_desc if the htt_frame_type is
  3647. * HTT_STATS_FTYPE_SGEN_MU_BAR, as there will be
  3648. * corresponding data frame
  3649. */
  3650. if (((type == IEEE80211_FC0_TYPE_CTL) &&
  3651. (subtype == IEEE80211_FC0_SUBTYPE_BAR) &&
  3652. (usr_type == IEEE80211_FC0_TYPE_DATA)) ||
  3653. (ppdu_desc->htt_frame_type ==
  3654. HTT_STATS_FTYPE_SGEN_MU_BAR)) {
  3655. /*
  3656. * clonning ppdu_desc additional reference as
  3657. * handling data frame
  3658. */
  3659. tmp_nbuf_ppdu = qdf_nbuf_clone(nbuf_ppdu);
  3660. if (qdf_unlikely(!tmp_nbuf_ppdu)) {
  3661. qdf_assert_always(0);
  3662. continue;
  3663. }
  3664. dp_tx_cap_nbuf_list_inc_ref(ptr_nbuf_list);
  3665. is_bar_frm_with_data = true;
  3666. }
  3667. if (dp_check_mgmt_ctrl_ppdu(pdev, tmp_nbuf_ppdu,
  3668. is_bar_frm_with_data)) {
  3669. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  3670. qdf_nbuf_free(tmp_nbuf_ppdu);
  3671. } else {
  3672. dp_tx_cap_nbuf_list_dec_ref(ptr_nbuf_list);
  3673. }
  3674. if (!is_bar_frm_with_data)
  3675. continue;
  3676. }
  3677. /*
  3678. * process only data frame and other
  3679. */
  3680. for (usr_idx = 0; usr_idx < num_users; usr_idx++) {
  3681. uint32_t mpdu_enq = 0;
  3682. uint32_t mpdu_tried = 0;
  3683. if (!ptr_nbuf_list->nbuf_ppdu ||
  3684. !dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list))
  3685. continue;
  3686. nbuf_ppdu = ptr_nbuf_list->nbuf_ppdu;
  3687. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  3688. qdf_nbuf_data(nbuf_ppdu);
  3689. user = &ppdu_desc->user[usr_idx];
  3690. if (user->delayed_ba || user->skip == 1)
  3691. continue;
  3692. peer = dp_tx_cap_peer_find_by_id(pdev->soc,
  3693. user->peer_id);
  3694. if (!peer) {
  3695. dp_ppdu_desc_free(ptr_nbuf_list, usr_idx);
  3696. user->skip = 1;
  3697. continue;
  3698. }
  3699. tx_tid = &peer->tx_capture.tx_tid[user->tid];
  3700. ppdu_id = ppdu_desc->ppdu_id;
  3701. /* find mpdu tried is same as success mpdu */
  3702. num_mpdu = user->mpdu_success;
  3703. /*
  3704. * ba_size is updated in BA bitmap TLVs,
  3705. * which are not received
  3706. * in case of non-QoS TID.
  3707. */
  3708. if (qdf_unlikely(user->tid == DP_NON_QOS_TID)) {
  3709. user->ba_size = 1;
  3710. user->last_enq_seq = user->start_seq;
  3711. }
  3712. if (user->ba_size == 0)
  3713. user->ba_size = 1;
  3714. /* find list of missing sequence */
  3715. user->mpdus = qdf_mem_malloc(sizeof(qdf_nbuf_t) *
  3716. user->ba_size);
  3717. if (qdf_unlikely(!user->mpdus)) {
  3718. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3719. QDF_TRACE_LEVEL_FATAL,
  3720. "%s: ppdu_desc->mpdus allocation failed",
  3721. __func__);
  3722. dp_ppdu_desc_free_all(ptr_nbuf_list, num_users);
  3723. dp_tx_cap_peer_unref_del(peer);
  3724. dp_print_pdev_tx_capture_stats(pdev);
  3725. qdf_assert_always(0);
  3726. return;
  3727. }
  3728. if (qdf_unlikely(user->ba_size >
  3729. CDP_BA_256_BIT_MAP_SIZE_DWORDS *
  3730. SEQ_SEG_SZ_BITS(user->failed_bitmap))) {
  3731. dp_tx_cap_peer_unref_del(peer);
  3732. qdf_assert_always(0);
  3733. return;
  3734. }
  3735. /* Fill seq holes within current schedule list */
  3736. start_seq = user->start_seq;
  3737. seq_no = 0;
  3738. mpdus_tried = user->mpdu_tried_mcast +
  3739. user->mpdu_tried_ucast;
  3740. for (i = 0; (i < user->ba_size) && mpdus_tried; i++) {
  3741. if (qdf_likely(user->tid != DP_NON_QOS_TID) &&
  3742. !(SEQ_BIT(user->enq_bitmap, i)))
  3743. continue;
  3744. mpdus_tried--;
  3745. /* missed seq number */
  3746. seq_no = start_seq + i;
  3747. /*
  3748. * Fill failed MPDUs in AMPDU if they're
  3749. * available in subsequent PPDUs in current
  3750. * burst schedule. This is not applicable
  3751. * for non-QoS TIDs (no AMPDUs)
  3752. */
  3753. if (qdf_likely(user->tid != DP_NON_QOS_TID) &&
  3754. !(SEQ_BIT(user->failed_bitmap, i))) {
  3755. uint8_t seq_idx;
  3756. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3757. QDF_TRACE_LEVEL_DEBUG,
  3758. "%s:find seq %d in next ppdu %d",
  3759. __func__, seq_no,
  3760. ppdu_desc_cnt);
  3761. mpdu_nbuf =
  3762. get_mpdu_clone_from_next_ppdu(
  3763. nbuf_ppdu_list +
  3764. desc_cnt,
  3765. ppdu_desc_cnt -
  3766. desc_cnt, seq_no,
  3767. user->peer_id,
  3768. ppdu_id, usr_idx);
  3769. seq_idx = seq_no - start_seq;
  3770. /* check mpdu_nbuf NULL */
  3771. if (!mpdu_nbuf) {
  3772. user->mpdus[seq_idx] = NULL;
  3773. user->pending_retries++;
  3774. continue;
  3775. }
  3776. dp_tx_cap_stats_mpdu_update(peer,
  3777. PEER_MPDU_CLONE, 1);
  3778. user->mpdus[seq_idx] = mpdu_nbuf;
  3779. SEQ_SEG(user->failed_bitmap, i) |=
  3780. SEQ_SEG_MSK(user->failed_bitmap[0], i);
  3781. } else {
  3782. qdf_nbuf_queue_t *tmp_q;
  3783. tmp_q = &user->mpdu_q;
  3784. /* any error case we need to handle */
  3785. mpdu_nbuf =
  3786. qdf_nbuf_queue_remove(tmp_q);
  3787. /* check mpdu_nbuf NULL */
  3788. if (!mpdu_nbuf)
  3789. continue;
  3790. user->mpdus[seq_no - start_seq] =
  3791. mpdu_nbuf;
  3792. dp_tx_cap_stats_mpdu_update(peer,
  3793. PEER_MPDU_ARR, 1);
  3794. }
  3795. }
  3796. mpdu_tried = user->mpdu_tried_ucast +
  3797. user->mpdu_tried_mcast;
  3798. for (i = 0; i < CDP_BA_256_BIT_MAP_SIZE_DWORDS; i++)
  3799. mpdu_enq +=
  3800. get_number_of_1s(user->enq_bitmap[i]);
  3801. if (mpdu_tried > mpdu_enq)
  3802. dp_ppdu_desc_debug_print(ppdu_desc, usr_idx,
  3803. __func__, __LINE__);
  3804. /*
  3805. * It is possible that enq_bitmap received has
  3806. * more bits than actual mpdus tried if HW was
  3807. * unable to send all MPDUs, and last_enq_seq
  3808. * and ba_size should be adjusted in that case
  3809. */
  3810. if (i < user->ba_size) {
  3811. user->last_enq_seq = seq_no;
  3812. user->ba_size = seq_no - start_seq + 1;
  3813. }
  3814. dp_tx_cap_peer_unref_del(peer);
  3815. }
  3816. }
  3817. for (usr_idx = 0; usr_idx < max_num_users; usr_idx++) {
  3818. for (i = 0; i < ppdu_desc_cnt; i++) {
  3819. uint32_t pending_ppdus;
  3820. struct cdp_tx_completion_ppdu *cur_ppdu_desc;
  3821. struct cdp_tx_completion_ppdu_user *cur_user;
  3822. struct dp_peer *peer;
  3823. qdf_nbuf_queue_t head_ppdu;
  3824. uint16_t peer_id;
  3825. ptr_nbuf_list = &nbuf_ppdu_list[i];
  3826. if (!ptr_nbuf_list->nbuf_ppdu ||
  3827. !dp_tx_cap_nbuf_list_get_ref(ptr_nbuf_list))
  3828. continue;
  3829. cur_ppdu_desc = (struct cdp_tx_completion_ppdu *)
  3830. qdf_nbuf_data(ptr_nbuf_list->nbuf_ppdu);
  3831. if (!cur_ppdu_desc)
  3832. continue;
  3833. if (usr_idx >= cur_ppdu_desc->num_users)
  3834. continue;
  3835. cur_user = &cur_ppdu_desc->user[usr_idx];
  3836. if ((cur_user->delayed_ba == 1) ||
  3837. (cur_user->skip == 1))
  3838. continue;
  3839. peer_id = cur_ppdu_desc->user[usr_idx].peer_id;
  3840. peer = dp_tx_cap_peer_find_by_id(pdev->soc, peer_id);
  3841. if (!peer) {
  3842. dp_ppdu_desc_free(ptr_nbuf_list, usr_idx);
  3843. continue;
  3844. }
  3845. tx_tid = &peer->tx_capture.tx_tid[cur_user->tid];
  3846. qdf_nbuf_queue_init(&head_ppdu);
  3847. dp_tx_mon_proc_pending_ppdus(pdev, tx_tid,
  3848. nbuf_ppdu_list + i,
  3849. ppdu_desc_cnt - i,
  3850. &head_ppdu,
  3851. cur_user->peer_id,
  3852. usr_idx);
  3853. if (qdf_nbuf_is_queue_empty(&tx_tid->pending_ppdu_q)) {
  3854. while ((tmp_nbuf =
  3855. qdf_nbuf_queue_first(&head_ppdu))) {
  3856. cur_ppdu_desc =
  3857. (struct cdp_tx_completion_ppdu *)
  3858. qdf_nbuf_data(tmp_nbuf);
  3859. cur_user =
  3860. &cur_ppdu_desc->user[usr_idx];
  3861. if (cur_user->pending_retries)
  3862. break;
  3863. dp_send_data_to_stack(pdev,
  3864. cur_ppdu_desc,
  3865. usr_idx);
  3866. dp_ppdu_queue_free(tmp_nbuf, usr_idx);
  3867. qdf_nbuf_queue_remove(&head_ppdu);
  3868. qdf_nbuf_free(tmp_nbuf);
  3869. }
  3870. }
  3871. qdf_nbuf_queue_append(&tx_tid->pending_ppdu_q,
  3872. &head_ppdu);
  3873. dp_tx_mon_proc_xretries(pdev, peer, tx_tid->tid);
  3874. pending_ppdus =
  3875. qdf_nbuf_queue_len(&tx_tid->pending_ppdu_q);
  3876. if (pending_ppdus > MAX_PENDING_PPDUS) {
  3877. struct cdp_tx_completion_ppdu *tmp_ppdu_desc;
  3878. uint8_t tmp_usr_idx;
  3879. qdf_nbuf_queue_t *tmp_ppdu_q;
  3880. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  3881. QDF_TRACE_LEVEL_ERROR,
  3882. "pending ppdus (%d, %d) : %d\n",
  3883. peer_id,
  3884. tx_tid->tid, pending_ppdus);
  3885. tmp_ppdu_q = &tx_tid->pending_ppdu_q;
  3886. tmp_nbuf = qdf_nbuf_queue_remove(tmp_ppdu_q);
  3887. if (qdf_unlikely(!tmp_nbuf)) {
  3888. qdf_assert_always(0);
  3889. return;
  3890. }
  3891. tmp_ppdu_desc =
  3892. (struct cdp_tx_completion_ppdu *)
  3893. qdf_nbuf_data(tmp_nbuf);
  3894. tmp_usr_idx = dp_tx_find_usr_idx_from_peer_id(
  3895. tmp_ppdu_desc, peer_id);
  3896. dp_send_data_to_stack(pdev, tmp_ppdu_desc,
  3897. tmp_usr_idx);
  3898. dp_ppdu_queue_free(tmp_nbuf, tmp_usr_idx);
  3899. qdf_nbuf_free(tmp_nbuf);
  3900. pdev->tx_capture.pend_ppdu_dropped++;
  3901. }
  3902. dp_tx_cap_peer_unref_del(peer);
  3903. }
  3904. }
  3905. }
  3906. static uint32_t
  3907. dp_tx_cap_proc_per_ppdu_info(struct dp_pdev *pdev, qdf_nbuf_t nbuf_ppdu,
  3908. struct dp_tx_cap_nbuf_list nbuf_ppdu_list[],
  3909. uint32_t ppdu_desc_cnt)
  3910. {
  3911. struct dp_tx_cap_nbuf_list *ptr_nbuf_list;
  3912. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  3913. struct dp_peer *peer = NULL;
  3914. qdf_nbuf_queue_t head_msdu;
  3915. qdf_nbuf_queue_t head_xretries;
  3916. uint32_t retries = 0;
  3917. uint32_t ret = 0;
  3918. uint32_t start_tsf = 0;
  3919. uint32_t end_tsf = 0;
  3920. uint32_t bar_start_tsf = 0;
  3921. uint32_t bar_end_tsf = 0;
  3922. uint16_t tid = 0;
  3923. uint32_t num_msdu = 0;
  3924. uint32_t qlen = 0;
  3925. uint16_t peer_id;
  3926. uint8_t type, subtype;
  3927. uint8_t usr_idx;
  3928. bool is_bar_frm_with_data = false;
  3929. uint8_t usr_type;
  3930. uint8_t usr_subtype;
  3931. qdf_nbuf_queue_init(&head_msdu);
  3932. qdf_nbuf_queue_init(&head_xretries);
  3933. ppdu_desc = (struct cdp_tx_completion_ppdu *)qdf_nbuf_data(nbuf_ppdu);
  3934. type = (ppdu_desc->frame_ctrl &
  3935. IEEE80211_FC0_TYPE_MASK);
  3936. subtype = (ppdu_desc->frame_ctrl &
  3937. IEEE80211_FC0_SUBTYPE_MASK);
  3938. if ((type == IEEE80211_FC0_TYPE_DATA) &&
  3939. (subtype == IEEE80211_FC0_SUBTYPE_QOS_NULL) &&
  3940. (ppdu_desc->htt_frame_type ==
  3941. HTT_STATS_FTYPE_TIDQ_DATA_SU)) {
  3942. ppdu_desc->htt_frame_type =
  3943. HTT_STATS_FTYPE_SGEN_QOS_NULL;
  3944. }
  3945. usr_type = (ppdu_desc->user[0].frame_ctrl &
  3946. IEEE80211_FC0_TYPE_MASK);
  3947. usr_subtype = (ppdu_desc->user[0].frame_ctrl &
  3948. IEEE80211_FC0_SUBTYPE_MASK);
  3949. if (((type == IEEE80211_FC0_TYPE_CTL) &&
  3950. (subtype == IEEE80211_FC0_SUBTYPE_BAR) &&
  3951. (usr_type == IEEE80211_FC0_TYPE_DATA)) ||
  3952. ppdu_desc->htt_frame_type == HTT_STATS_FTYPE_SGEN_MU_BAR)
  3953. is_bar_frm_with_data = true;
  3954. ptr_nbuf_list = &nbuf_ppdu_list[ppdu_desc_cnt];
  3955. /* ppdu start timestamp */
  3956. start_tsf = ppdu_desc->ppdu_start_timestamp;
  3957. end_tsf = ppdu_desc->ppdu_end_timestamp;
  3958. bar_start_tsf = ppdu_desc->bar_ppdu_start_timestamp;
  3959. bar_end_tsf = ppdu_desc->bar_ppdu_end_timestamp;
  3960. if (((ppdu_desc->frame_type == CDP_PPDU_FTYPE_DATA) &&
  3961. (ppdu_desc->htt_frame_type !=
  3962. HTT_STATS_FTYPE_SGEN_QOS_NULL)) ||
  3963. is_bar_frm_with_data) {
  3964. uint32_t mpdu_suc;
  3965. uint32_t mpdu_tri;
  3966. uint8_t ref_cnt = 0;
  3967. uint8_t num_users = ppdu_desc->num_users;
  3968. struct dp_tx_tid *tx_tid;
  3969. struct cdp_tx_completion_ppdu *xretry_ppdu;
  3970. struct cdp_tx_completion_ppdu_user *xretry_user;
  3971. struct cdp_tx_completion_ppdu_user *user;
  3972. qdf_nbuf_queue_t *mpdu_q;
  3973. qdf_nbuf_queue_t *x_mpdu_q;
  3974. for (usr_idx = 0; usr_idx < num_users;
  3975. usr_idx++) {
  3976. uint32_t ppdu_id;
  3977. peer = NULL;
  3978. user = &ppdu_desc->user[usr_idx];
  3979. if (usr_idx + 1 != num_users)
  3980. qdf_nbuf_ref(nbuf_ppdu);
  3981. if (user->delayed_ba == 1) {
  3982. user->skip = 1;
  3983. goto free_nbuf_dec_ref;
  3984. }
  3985. peer_id = user->peer_id;
  3986. peer = dp_tx_cap_peer_find_by_id(pdev->soc,
  3987. peer_id);
  3988. /**
  3989. * peer can be NULL
  3990. */
  3991. if (!peer) {
  3992. user->skip = 1;
  3993. goto free_nbuf_dec_ref;
  3994. }
  3995. /**
  3996. * check whether it is bss peer,
  3997. * if bss_peer no need to process
  3998. * further check whether tx_capture
  3999. * feature is enabled for this peer
  4000. * or globally for all peers
  4001. */
  4002. if (peer->bss_peer ||
  4003. !dp_peer_or_pdev_tx_cap_enabled(pdev,
  4004. NULL, peer->mac_addr.raw) || user->is_mcast) {
  4005. user->skip = 1;
  4006. goto free_nbuf_dec_ref;
  4007. }
  4008. /* update failed bitmap */
  4009. dp_process_ppdu_stats_update_failed_bitmap(
  4010. pdev, user, ppdu_desc->ppdu_id,
  4011. CDP_BA_256_BIT_MAP_SIZE_DWORDS);
  4012. /* print the bit map */
  4013. dp_tx_print_bitmap(pdev, ppdu_desc,
  4014. usr_idx,
  4015. ppdu_desc->ppdu_id);
  4016. if (user->tid > DP_MAX_TIDS) {
  4017. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  4018. QDF_TRACE_LEVEL_ERROR,
  4019. "%s: ppdu[%d] peer_id[%d] TID[%d] > NON_QOS_TID!",
  4020. __func__,
  4021. ppdu_desc->ppdu_id,
  4022. user->peer_id,
  4023. user->tid);
  4024. user->skip = 1;
  4025. goto free_nbuf_dec_ref;
  4026. }
  4027. if (is_bar_frm_with_data)
  4028. ppdu_id = ppdu_desc->bar_ppdu_id;
  4029. else
  4030. ppdu_id = ppdu_desc->ppdu_id;
  4031. tid = user->tid;
  4032. num_msdu = user->num_msdu;
  4033. dequeue_msdu_again:
  4034. /*
  4035. * retrieve msdu buffer based on ppdu_id & tid
  4036. * based msdu queue and store it in local queue
  4037. * sometimes, wbm comes later than per ppdu
  4038. * stats. Assumption: all packets are SU,
  4039. * and packets comes in order
  4040. */
  4041. ret = dp_tx_msdu_dequeue(peer,
  4042. ppdu_id,
  4043. tid,
  4044. num_msdu,
  4045. &head_msdu,
  4046. &head_xretries,
  4047. start_tsf,
  4048. end_tsf);
  4049. if (!ret && (++retries < 2)) {
  4050. /* wait for wbm to complete */
  4051. qdf_mdelay(2);
  4052. goto dequeue_msdu_again;
  4053. }
  4054. /*
  4055. * restitch mpdu from xretry msdu
  4056. * xretry msdu queue empty check is
  4057. * done inside restitch function
  4058. */
  4059. tx_tid = &peer->tx_capture.tx_tid[tid];
  4060. xretry_ppdu = &tx_tid->xretry_ppdu;
  4061. xretry_user = &xretry_ppdu->user[0];
  4062. xretry_ppdu->ppdu_id =
  4063. peer->tx_capture.tx_wifi_ppdu_id;
  4064. x_mpdu_q = &xretry_user->mpdu_q;
  4065. /* Restitch MPDUs from xretry MSDUs */
  4066. dp_tx_mon_restitch_mpdu(pdev, peer,
  4067. xretry_ppdu,
  4068. &head_xretries,
  4069. x_mpdu_q, 0);
  4070. qlen = qdf_nbuf_queue_len(x_mpdu_q);
  4071. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_RESTITCH,
  4072. qlen);
  4073. if (qdf_nbuf_is_queue_empty(
  4074. &head_msdu)) {
  4075. user->skip = 1;
  4076. goto free_nbuf_dec_ref;
  4077. }
  4078. mpdu_q = &user->mpdu_q;
  4079. /*
  4080. * now head_msdu hold - msdu list for
  4081. * that particular ppdu_id, restitch
  4082. * mpdu from msdu and create a mpdu
  4083. * queue
  4084. */
  4085. dp_tx_mon_restitch_mpdu(pdev,
  4086. peer,
  4087. ppdu_desc,
  4088. &head_msdu,
  4089. mpdu_q,
  4090. usr_idx);
  4091. /*
  4092. * sanity: free local head msdu queue
  4093. * do we need this ?
  4094. */
  4095. qdf_nbuf_queue_free(&head_msdu);
  4096. qlen = qdf_nbuf_queue_len(mpdu_q);
  4097. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_RESTITCH,
  4098. qlen);
  4099. if (!qlen) {
  4100. dp_ppdu_queue_free(nbuf_ppdu,
  4101. usr_idx);
  4102. user->skip = 1;
  4103. goto free_nbuf_dec_ref;
  4104. }
  4105. mpdu_suc = user->mpdu_success;
  4106. mpdu_tri = user->mpdu_tried_ucast +
  4107. user->mpdu_tried_mcast;
  4108. /* print ppdu_desc info for debugging purpose */
  4109. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  4110. QDF_TRACE_LEVEL_INFO,
  4111. "%s: ppdu[%d] b_ppdu_id[%d] p_id[%d], tid[%d], n_mpdu[%d %d] n_msdu[%d] retr[%d] qlen[%d] tsf[%u - %u] b_tsf[%u - %u] dur[%u] seq[%d] ppdu_desc_cnt[%d]",
  4112. __func__,
  4113. ppdu_desc->ppdu_id,
  4114. ppdu_desc->bar_ppdu_id,
  4115. user->peer_id,
  4116. user->tid,
  4117. ppdu_desc->num_mpdu,
  4118. mpdu_suc,
  4119. ppdu_desc->num_msdu, retries,
  4120. qlen,
  4121. start_tsf, end_tsf,
  4122. bar_start_tsf, bar_end_tsf,
  4123. ppdu_desc->tx_duration,
  4124. user->start_seq,
  4125. ppdu_desc_cnt);
  4126. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_SUCC,
  4127. mpdu_suc);
  4128. dp_tx_cap_stats_mpdu_update(peer, PEER_MPDU_TRI,
  4129. mpdu_tri);
  4130. dp_tx_cap_peer_unref_del(peer);
  4131. /* get reference count */
  4132. ref_cnt = qdf_nbuf_get_users(nbuf_ppdu);
  4133. continue;
  4134. free_nbuf_dec_ref:
  4135. /* get reference before free */
  4136. ref_cnt = qdf_nbuf_get_users(nbuf_ppdu);
  4137. qdf_nbuf_free(nbuf_ppdu);
  4138. ref_cnt--;
  4139. if (peer)
  4140. dp_tx_cap_peer_unref_del(peer);
  4141. continue;
  4142. }
  4143. if (ref_cnt == 0)
  4144. return ppdu_desc_cnt;
  4145. ptr_nbuf_list->nbuf_ppdu = nbuf_ppdu;
  4146. dp_tx_cap_nbuf_list_update_ref(ptr_nbuf_list, ref_cnt);
  4147. ppdu_desc_cnt++;
  4148. } else {
  4149. /*
  4150. * other packet frame also added to
  4151. * descriptor list
  4152. */
  4153. /* print ppdu_desc info for debugging purpose */
  4154. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  4155. QDF_TRACE_LEVEL_INFO_HIGH,
  4156. "%s: ppdu[%d], p_id[%d], tid[%d], fctrl[0x%x 0x%x] ftype[%d] h_frm_t[%d] seq[%d] tsf[%u b %u] dur[%u]",
  4157. __func__, ppdu_desc->ppdu_id,
  4158. ppdu_desc->user[0].peer_id,
  4159. ppdu_desc->user[0].tid,
  4160. ppdu_desc->frame_ctrl,
  4161. ppdu_desc->user[0].frame_ctrl,
  4162. ppdu_desc->frame_type,
  4163. ppdu_desc->htt_frame_type,
  4164. ppdu_desc->user[0].start_seq,
  4165. ppdu_desc->ppdu_start_timestamp,
  4166. ppdu_desc->bar_ppdu_start_timestamp,
  4167. ppdu_desc->tx_duration);
  4168. ptr_nbuf_list->nbuf_ppdu = nbuf_ppdu;
  4169. dp_tx_cap_nbuf_list_update_ref(ptr_nbuf_list,
  4170. 1);
  4171. ppdu_desc_cnt++;
  4172. }
  4173. return ppdu_desc_cnt;
  4174. }
  4175. /**
  4176. * dp_tx_ppdu_stats_process - Deferred PPDU stats handler
  4177. * @context: Opaque work context (PDEV)
  4178. *
  4179. * Return: none
  4180. */
  4181. void dp_tx_ppdu_stats_process(void *context)
  4182. {
  4183. uint32_t curr_sched_cmdid;
  4184. uint32_t last_ppdu_id;
  4185. uint32_t ppdu_cnt;
  4186. uint32_t ppdu_desc_cnt = 0;
  4187. struct dp_pdev *pdev = (struct dp_pdev *)context;
  4188. struct ppdu_info *ppdu_info, *tmp_ppdu_info = NULL;
  4189. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  4190. struct ppdu_info *sched_ppdu_info = NULL;
  4191. STAILQ_HEAD(, ppdu_info) sched_ppdu_queue;
  4192. struct ppdu_info *sched_ppdu_list_last_ptr;
  4193. struct dp_tx_cap_nbuf_list *nbuf_ppdu_list;
  4194. struct dp_tx_cap_nbuf_list *ptr_nbuf_list;
  4195. qdf_nbuf_t tmp_nbuf;
  4196. qdf_nbuf_t nbuf_ppdu;
  4197. struct dp_pdev_tx_capture *ptr_tx_cap = &pdev->tx_capture;
  4198. size_t nbuf_list_sz;
  4199. uint8_t user_mode;
  4200. STAILQ_INIT(&sched_ppdu_queue);
  4201. /* Move the PPDU entries to defer list */
  4202. qdf_spin_lock_bh(&ptr_tx_cap->ppdu_stats_lock);
  4203. STAILQ_CONCAT(&ptr_tx_cap->ppdu_stats_defer_queue,
  4204. &ptr_tx_cap->ppdu_stats_queue);
  4205. ptr_tx_cap->ppdu_stats_defer_queue_depth +=
  4206. ptr_tx_cap->ppdu_stats_queue_depth;
  4207. ptr_tx_cap->ppdu_stats_queue_depth = 0;
  4208. qdf_spin_unlock_bh(&ptr_tx_cap->ppdu_stats_lock);
  4209. while (!STAILQ_EMPTY(&ptr_tx_cap->ppdu_stats_defer_queue)) {
  4210. ppdu_info =
  4211. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  4212. curr_sched_cmdid = ppdu_info->sched_cmdid;
  4213. ppdu_cnt = 0;
  4214. STAILQ_FOREACH_SAFE(ppdu_info,
  4215. &ptr_tx_cap->ppdu_stats_defer_queue,
  4216. ppdu_info_queue_elem, tmp_ppdu_info) {
  4217. if (curr_sched_cmdid != ppdu_info->sched_cmdid)
  4218. break;
  4219. sched_ppdu_list_last_ptr = ppdu_info;
  4220. ppdu_cnt++;
  4221. }
  4222. if (ppdu_info && (curr_sched_cmdid == ppdu_info->sched_cmdid) &&
  4223. ptr_tx_cap->ppdu_stats_next_sched < now_ms)
  4224. break;
  4225. last_ppdu_id = sched_ppdu_list_last_ptr->ppdu_id;
  4226. STAILQ_FIRST(&sched_ppdu_queue) =
  4227. STAILQ_FIRST(&ptr_tx_cap->ppdu_stats_defer_queue);
  4228. STAILQ_REMOVE_HEAD_UNTIL(&ptr_tx_cap->ppdu_stats_defer_queue,
  4229. sched_ppdu_list_last_ptr,
  4230. ppdu_info_queue_elem);
  4231. STAILQ_NEXT(sched_ppdu_list_last_ptr,
  4232. ppdu_info_queue_elem) = NULL;
  4233. ptr_tx_cap->ppdu_stats_defer_queue_depth -= ppdu_cnt;
  4234. nbuf_list_sz = sizeof(struct dp_tx_cap_nbuf_list);
  4235. nbuf_ppdu_list = (struct dp_tx_cap_nbuf_list *)
  4236. qdf_mem_malloc(nbuf_list_sz * ppdu_cnt);
  4237. /*
  4238. * if there is no memory allocated we need to free sched ppdu
  4239. * list, no ppdu stats will be updated.
  4240. */
  4241. if (!nbuf_ppdu_list) {
  4242. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  4243. &sched_ppdu_queue,
  4244. ppdu_info_queue_elem,
  4245. tmp_ppdu_info) {
  4246. ppdu_info = sched_ppdu_info;
  4247. tmp_nbuf = ppdu_info->nbuf;
  4248. qdf_mem_free(ppdu_info);
  4249. qdf_nbuf_free(tmp_nbuf);
  4250. }
  4251. continue;
  4252. }
  4253. ppdu_desc_cnt = 0;
  4254. STAILQ_FOREACH_SAFE(sched_ppdu_info,
  4255. &sched_ppdu_queue,
  4256. ppdu_info_queue_elem, tmp_ppdu_info) {
  4257. ppdu_info = sched_ppdu_info;
  4258. pdev->stats.tx_ppdu_proc++;
  4259. /* update ppdu desc user stats */
  4260. dp_ppdu_desc_user_stats_update(pdev, ppdu_info);
  4261. /*
  4262. * While processing/corelating Tx buffers, we should
  4263. * hold the entire PPDU list for the give sched_cmdid
  4264. * instead of freeing below.
  4265. */
  4266. nbuf_ppdu = ppdu_info->nbuf;
  4267. qdf_mem_free(ppdu_info);
  4268. qdf_assert_always(nbuf_ppdu);
  4269. /* check tx capture disable */
  4270. if (pdev->tx_capture_enabled ==
  4271. CDP_TX_ENH_CAPTURE_DISABLED) {
  4272. struct cdp_tx_completion_ppdu *ppdu_desc;
  4273. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  4274. qdf_nbuf_data(nbuf_ppdu);
  4275. /**
  4276. * Deliver PPDU stats only for valid (acked)
  4277. * data frames if sniffer mode is not enabled.
  4278. * If sniffer mode is enabled,
  4279. * PPDU stats for all frames including
  4280. * mgmt/control frames should be delivered
  4281. * to upper layer
  4282. */
  4283. if (pdev->tx_sniffer_enable ||
  4284. pdev->mcopy_mode) {
  4285. dp_wdi_event_handler(
  4286. WDI_EVENT_TX_PPDU_DESC,
  4287. pdev->soc,
  4288. nbuf_ppdu,
  4289. HTT_INVALID_PEER,
  4290. WDI_NO_VAL,
  4291. pdev->pdev_id);
  4292. } else {
  4293. if (ppdu_desc->num_mpdu != 0 &&
  4294. ppdu_desc->num_users != 0 &&
  4295. (ppdu_desc->frame_ctrl &
  4296. HTT_FRAMECTRL_DATATYPE)) {
  4297. dp_wdi_event_handler(
  4298. WDI_EVENT_TX_PPDU_DESC,
  4299. pdev->soc,
  4300. nbuf_ppdu,
  4301. HTT_INVALID_PEER,
  4302. WDI_NO_VAL,
  4303. pdev->pdev_id);
  4304. } else {
  4305. qdf_nbuf_free(nbuf_ppdu);
  4306. }
  4307. }
  4308. continue;
  4309. } else {
  4310. /* process ppdu_info on tx capture turned on */
  4311. ppdu_desc_cnt = dp_tx_cap_proc_per_ppdu_info(
  4312. pdev,
  4313. nbuf_ppdu,
  4314. nbuf_ppdu_list,
  4315. ppdu_desc_cnt);
  4316. }
  4317. }
  4318. /*
  4319. * At this point we have mpdu queued per ppdu_desc
  4320. * based on packet capture flags send mpdu info to upper stack
  4321. */
  4322. if (ppdu_desc_cnt) {
  4323. uint32_t i;
  4324. dp_check_ppdu_and_deliver(pdev, nbuf_ppdu_list,
  4325. ppdu_desc_cnt);
  4326. for (i = 0; i < ppdu_desc_cnt; i++) {
  4327. ptr_nbuf_list = &nbuf_ppdu_list[i];
  4328. if (dp_tx_cap_nbuf_list_get_ref(
  4329. ptr_nbuf_list)) {
  4330. QDF_TRACE(QDF_MODULE_ID_TX_CAPTURE,
  4331. QDF_TRACE_LEVEL_FATAL,
  4332. "%s: %d missing handling of ppdu_desc ref_cnt:%d ,i : %d ptr %p, ppdu_desc_cnt %d!!!\n",
  4333. __func__, __LINE__,
  4334. ptr_nbuf_list->ref_cnt, i, ptr_nbuf_list, ppdu_desc_cnt);
  4335. QDF_BUG(0);
  4336. }
  4337. }
  4338. }
  4339. qdf_mem_free(nbuf_ppdu_list);
  4340. /* get user mode */
  4341. user_mode = qdf_atomic_read(&pdev->tx_capture.tx_cap_usr_mode);
  4342. /*
  4343. * invoke mode change if user mode value is
  4344. * different from driver mode value,
  4345. * this was done to reduce config lock
  4346. */
  4347. if (user_mode != pdev->tx_capture_enabled)
  4348. dp_enh_tx_cap_mode_change(pdev, user_mode);
  4349. }
  4350. }
  4351. /**
  4352. * dp_ppdu_desc_deliver(): Function to deliver Tx PPDU status descriptor
  4353. * to upper layer
  4354. * @pdev: DP pdev handle
  4355. * @ppdu_info: per PPDU TLV descriptor
  4356. *
  4357. * return: void
  4358. */
  4359. void dp_ppdu_desc_deliver(struct dp_pdev *pdev,
  4360. struct ppdu_info *ppdu_info)
  4361. {
  4362. uint32_t now_ms = qdf_system_ticks_to_msecs(qdf_system_ticks());
  4363. struct cdp_tx_completion_ppdu *ppdu_desc = NULL;
  4364. TAILQ_REMOVE(&pdev->ppdu_info_list, ppdu_info, ppdu_info_list_elem);
  4365. pdev->list_depth--;
  4366. ppdu_desc = (struct cdp_tx_completion_ppdu *)
  4367. qdf_nbuf_data(ppdu_info->nbuf);
  4368. ppdu_desc->tlv_bitmap = ppdu_info->tlv_bitmap;
  4369. qdf_spin_lock_bh(&pdev->tx_capture.ppdu_stats_lock);
  4370. if (qdf_unlikely(!pdev->tx_capture_enabled &&
  4371. (pdev->tx_capture.ppdu_stats_queue_depth +
  4372. pdev->tx_capture.ppdu_stats_defer_queue_depth) >
  4373. DP_TX_PPDU_PROC_MAX_DEPTH)) {
  4374. qdf_nbuf_free(ppdu_info->nbuf);
  4375. qdf_mem_free(ppdu_info);
  4376. pdev->tx_capture.ppdu_dropped++;
  4377. } else {
  4378. STAILQ_INSERT_TAIL(&pdev->tx_capture.ppdu_stats_queue,
  4379. ppdu_info, ppdu_info_queue_elem);
  4380. pdev->tx_capture.ppdu_stats_queue_depth++;
  4381. }
  4382. qdf_spin_unlock_bh(&pdev->tx_capture.ppdu_stats_lock);
  4383. if ((pdev->tx_capture.ppdu_stats_queue_depth >
  4384. DP_TX_PPDU_PROC_THRESHOLD) ||
  4385. (pdev->tx_capture.ppdu_stats_next_sched <= now_ms)) {
  4386. qdf_queue_work(0, pdev->tx_capture.ppdu_stats_workqueue,
  4387. &pdev->tx_capture.ppdu_stats_work);
  4388. pdev->tx_capture.ppdu_stats_next_sched =
  4389. now_ms + DP_TX_PPDU_PROC_TIMEOUT;
  4390. }
  4391. }
  4392. static void set_mpdu_info(
  4393. struct cdp_tx_indication_info *tx_capture_info,
  4394. struct mon_rx_status *rx_status,
  4395. struct mon_rx_user_status *rx_user_status)
  4396. {
  4397. struct cdp_tx_indication_mpdu_info *mpdu_info;
  4398. qdf_mem_set(tx_capture_info,
  4399. sizeof(struct cdp_tx_indication_info), 0);
  4400. mpdu_info = &tx_capture_info->mpdu_info;
  4401. mpdu_info->ppdu_start_timestamp = rx_status->tsft + 16;
  4402. mpdu_info->channel_num = rx_status->chan_num;
  4403. mpdu_info->channel = rx_status->chan_freq;
  4404. mpdu_info->bw = 0;
  4405. if (rx_status->preamble_type == HAL_RX_PKT_TYPE_11B) {
  4406. mpdu_info->preamble = DOT11_B;
  4407. mpdu_info->mcs = CDP_LEGACY_MCS3;
  4408. } else if (rx_status->preamble_type == HAL_RX_PKT_TYPE_11A) {
  4409. mpdu_info->preamble = DOT11_A;
  4410. mpdu_info->mcs = CDP_LEGACY_MCS3;
  4411. } else {
  4412. mpdu_info->preamble = DOT11_A;
  4413. mpdu_info->mcs = CDP_LEGACY_MCS1;
  4414. }
  4415. }
  4416. static void dp_gen_ack_frame(struct hal_rx_ppdu_info *ppdu_info,
  4417. struct dp_peer *peer,
  4418. qdf_nbuf_t mpdu_nbuf)
  4419. {
  4420. struct ieee80211_frame_min_one *wh_addr1;
  4421. wh_addr1 = (struct ieee80211_frame_min_one *)
  4422. qdf_nbuf_data(mpdu_nbuf);
  4423. wh_addr1->i_fc[0] = 0;
  4424. wh_addr1->i_fc[1] = 0;
  4425. wh_addr1->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  4426. IEEE80211_FC0_TYPE_CTL |
  4427. IEEE80211_FC0_SUBTYPE_ACK;
  4428. if (peer) {
  4429. qdf_mem_copy(wh_addr1->i_addr1,
  4430. &peer->mac_addr.raw[0],
  4431. QDF_MAC_ADDR_SIZE);
  4432. } else {
  4433. qdf_mem_copy(wh_addr1->i_addr1,
  4434. &ppdu_info->nac_info.mac_addr2[0],
  4435. QDF_MAC_ADDR_SIZE);
  4436. }
  4437. *(u_int16_t *)(&wh_addr1->i_dur) = qdf_cpu_to_le16(0x0000);
  4438. qdf_nbuf_set_pktlen(mpdu_nbuf, sizeof(*wh_addr1));
  4439. }
  4440. static void dp_gen_block_ack_frame(
  4441. struct hal_rx_ppdu_info *ppdu_info,
  4442. struct mon_rx_user_status *rx_user_status,
  4443. struct mon_rx_user_info *rx_user_info,
  4444. struct dp_peer *peer,
  4445. qdf_nbuf_t mpdu_nbuf)
  4446. {
  4447. struct dp_vdev *vdev = NULL;
  4448. uint32_t tid;
  4449. struct dp_tx_tid *tx_tid;
  4450. struct ieee80211_ctlframe_addr2 *wh_addr2;
  4451. uint8_t *frm;
  4452. tid = rx_user_status->tid;
  4453. tx_tid = &peer->tx_capture.tx_tid[tid];
  4454. if (ppdu_info->sw_frame_group_id != HAL_MPDU_SW_FRAME_GROUP_CTRL_BAR) {
  4455. tx_tid->first_data_seq_ctrl =
  4456. rx_user_status->first_data_seq_ctrl;
  4457. tx_tid->mpdu_cnt = rx_user_status->mpdu_cnt_fcs_ok +
  4458. rx_user_status->mpdu_cnt_fcs_err;
  4459. if (tx_tid->mpdu_cnt > DP_MAX_MPDU_64)
  4460. qdf_mem_copy(tx_tid->mpdu_fcs_ok_bitmap,
  4461. rx_user_status->mpdu_fcs_ok_bitmap,
  4462. HAL_RX_NUM_WORDS_PER_PPDU_BITMAP * sizeof(
  4463. rx_user_status->mpdu_fcs_ok_bitmap[0]));
  4464. else
  4465. qdf_mem_copy(tx_tid->mpdu_fcs_ok_bitmap,
  4466. rx_user_status->mpdu_fcs_ok_bitmap,
  4467. DP_NUM_WORDS_PER_PPDU_BITMAP_64 * sizeof(
  4468. rx_user_status->mpdu_fcs_ok_bitmap[0]));
  4469. }
  4470. wh_addr2 = (struct ieee80211_ctlframe_addr2 *)
  4471. qdf_nbuf_data(mpdu_nbuf);
  4472. qdf_mem_zero(wh_addr2, DP_BA_ACK_FRAME_SIZE);
  4473. wh_addr2->i_fc[0] = 0;
  4474. wh_addr2->i_fc[1] = 0;
  4475. wh_addr2->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  4476. IEEE80211_FC0_TYPE_CTL |
  4477. IEEE80211_FC0_BLOCK_ACK;
  4478. *(u_int16_t *)(&wh_addr2->i_aidordur) = qdf_cpu_to_le16(0x0000);
  4479. vdev = peer->vdev;
  4480. if (vdev)
  4481. qdf_mem_copy(wh_addr2->i_addr2, vdev->mac_addr.raw,
  4482. QDF_MAC_ADDR_SIZE);
  4483. qdf_mem_copy(wh_addr2->i_addr1, &peer->mac_addr.raw[0],
  4484. QDF_MAC_ADDR_SIZE);
  4485. frm = (uint8_t *)&wh_addr2[1];
  4486. *((uint16_t *)frm) =
  4487. qdf_cpu_to_le16((rx_user_status->tid <<
  4488. DP_IEEE80211_BAR_CTL_TID_S) |
  4489. DP_IEEE80211_BAR_CTL_COMBA);
  4490. frm += 2;
  4491. *((uint16_t *)frm) =
  4492. tx_tid->first_data_seq_ctrl;
  4493. frm += 2;
  4494. if (tx_tid->mpdu_cnt > DP_MAX_MPDU_64) {
  4495. qdf_mem_copy(frm,
  4496. tx_tid->mpdu_fcs_ok_bitmap,
  4497. HAL_RX_NUM_WORDS_PER_PPDU_BITMAP *
  4498. sizeof(rx_user_status->mpdu_fcs_ok_bitmap[0]));
  4499. frm += DP_NUM_BYTES_PER_PPDU_BITMAP;
  4500. } else {
  4501. qdf_mem_copy(frm,
  4502. tx_tid->mpdu_fcs_ok_bitmap,
  4503. DP_NUM_WORDS_PER_PPDU_BITMAP_64 *
  4504. sizeof(rx_user_status->mpdu_fcs_ok_bitmap[0]));
  4505. frm += DP_NUM_BYTES_PER_PPDU_BITMAP_64;
  4506. }
  4507. qdf_nbuf_set_pktlen(mpdu_nbuf,
  4508. (frm - (uint8_t *)qdf_nbuf_data(mpdu_nbuf)));
  4509. }
  4510. static void dp_gen_cts_frame(struct hal_rx_ppdu_info *ppdu_info,
  4511. struct dp_peer *peer,
  4512. qdf_nbuf_t mpdu_nbuf)
  4513. {
  4514. struct ieee80211_frame_min_one *wh_addr1;
  4515. uint16_t duration;
  4516. wh_addr1 = (struct ieee80211_frame_min_one *)
  4517. qdf_nbuf_data(mpdu_nbuf);
  4518. wh_addr1->i_fc[0] = 0;
  4519. wh_addr1->i_fc[1] = 0;
  4520. wh_addr1->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  4521. IEEE80211_FC0_TYPE_CTL |
  4522. IEEE80211_FC0_SUBTYPE_CTS;
  4523. qdf_mem_copy(wh_addr1->i_addr1, &peer->mac_addr.raw[0],
  4524. QDF_MAC_ADDR_SIZE);
  4525. duration = (ppdu_info->rx_status.duration > SIFS_INTERVAL) ?
  4526. ppdu_info->rx_status.duration - SIFS_INTERVAL : 0;
  4527. wh_addr1->i_dur[0] = duration & 0xff;
  4528. wh_addr1->i_dur[1] = (duration >> 8) & 0xff;
  4529. qdf_nbuf_set_pktlen(mpdu_nbuf, sizeof(*wh_addr1));
  4530. }
  4531. /**
  4532. * dp_send_cts_frame_to_stack(): Function to deliver HW generated CTS frame
  4533. * in reponse to RTS
  4534. * @soc: core txrx main context
  4535. * @pdev: DP pdev object
  4536. * @ppdu_info: HAL RX PPDU info retrieved from status ring TLV
  4537. *
  4538. * return: status
  4539. */
  4540. QDF_STATUS dp_send_cts_frame_to_stack(struct dp_soc *soc,
  4541. struct dp_pdev *pdev,
  4542. struct hal_rx_ppdu_info *ppdu_info)
  4543. {
  4544. struct cdp_tx_indication_info tx_capture_info;
  4545. struct mon_rx_user_status *rx_user_status =
  4546. &ppdu_info->rx_user_status[0];
  4547. struct dp_ast_entry *ast_entry;
  4548. uint32_t peer_id;
  4549. struct dp_peer *peer;
  4550. struct dp_vdev *vdev = NULL;
  4551. if (rx_user_status->ast_index >=
  4552. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  4553. return QDF_STATUS_E_FAILURE;
  4554. }
  4555. qdf_spin_lock_bh(&soc->ast_lock);
  4556. ast_entry = soc->ast_table[rx_user_status->ast_index];
  4557. if (!ast_entry) {
  4558. qdf_spin_unlock_bh(&soc->ast_lock);
  4559. return QDF_STATUS_E_FAILURE;
  4560. }
  4561. peer = ast_entry->peer;
  4562. if (!peer || peer->peer_id == HTT_INVALID_PEER) {
  4563. qdf_spin_unlock_bh(&soc->ast_lock);
  4564. return QDF_STATUS_E_FAILURE;
  4565. }
  4566. peer_id = peer->peer_id;
  4567. qdf_spin_unlock_bh(&soc->ast_lock);
  4568. peer = dp_peer_find_by_id(soc, peer_id);
  4569. if (!peer)
  4570. return QDF_STATUS_E_FAILURE;
  4571. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, NULL, peer->mac_addr.raw)) {
  4572. dp_peer_unref_del_find_by_id(peer);
  4573. return QDF_STATUS_E_FAILURE;
  4574. }
  4575. if (pdev->tx_capture_enabled == CDP_TX_ENH_CAPTURE_ENABLE_ALL_PEERS) {
  4576. int8_t match = 0;
  4577. TAILQ_FOREACH(vdev, &pdev->vdev_list, vdev_list_elem) {
  4578. if (!qdf_mem_cmp(vdev->mac_addr.raw,
  4579. ppdu_info->rx_info.mac_addr1,
  4580. QDF_MAC_ADDR_SIZE)) {
  4581. match = 1;
  4582. break;
  4583. }
  4584. }
  4585. if (!match)
  4586. return QDF_STATUS_E_FAILURE;
  4587. }
  4588. set_mpdu_info(&tx_capture_info,
  4589. &ppdu_info->rx_status, rx_user_status);
  4590. /* ppdu_desc is not required for legacy frames */
  4591. tx_capture_info.ppdu_desc = NULL;
  4592. tx_capture_info.mpdu_nbuf =
  4593. qdf_nbuf_alloc(pdev->soc->osdev,
  4594. MAX_MONITOR_HEADER +
  4595. DP_CTS_FRAME_SIZE,
  4596. MAX_MONITOR_HEADER,
  4597. 4, FALSE);
  4598. if (!tx_capture_info.mpdu_nbuf) {
  4599. dp_peer_unref_del_find_by_id(peer);
  4600. return QDF_STATUS_E_NOMEM;
  4601. }
  4602. dp_gen_cts_frame(ppdu_info, peer,
  4603. tx_capture_info.mpdu_nbuf);
  4604. dp_peer_unref_del_find_by_id(peer);
  4605. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  4606. &tx_capture_info, HTT_INVALID_PEER,
  4607. WDI_NO_VAL, pdev->pdev_id);
  4608. if (tx_capture_info.mpdu_nbuf)
  4609. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  4610. return QDF_STATUS_SUCCESS;
  4611. }
  4612. /**
  4613. * dp_send_usr_ack_frm_to_stack(): Function to generate BA or ACK frame and
  4614. * send to upper layer
  4615. * @soc: core txrx main context
  4616. * @pdev: DP pdev object
  4617. * @ppdu_info: HAL RX PPDU info retrieved from status ring TLV
  4618. * @rx_status: variable for rx status
  4619. * @rx_user_status: variable for rx user status
  4620. * @rx_user_info: variable for rx user info
  4621. *
  4622. * return: no
  4623. */
  4624. void dp_send_usr_ack_frm_to_stack(struct dp_soc *soc,
  4625. struct dp_pdev *pdev,
  4626. struct hal_rx_ppdu_info *ppdu_info,
  4627. struct mon_rx_status *rx_status,
  4628. struct mon_rx_user_status *rx_user_status,
  4629. struct mon_rx_user_info *rx_user_info)
  4630. {
  4631. struct cdp_tx_indication_info tx_capture_info;
  4632. struct dp_peer *peer;
  4633. struct dp_ast_entry *ast_entry;
  4634. uint32_t peer_id;
  4635. uint32_t ast_index;
  4636. uint8_t *ptr_mac_addr;
  4637. if (rx_user_info->qos_control_info_valid &&
  4638. ((rx_user_info->qos_control &
  4639. IEEE80211_QOS_ACKPOLICY) >> IEEE80211_QOS_ACKPOLICY_S)
  4640. == IEEE80211_BAR_CTL_NOACK)
  4641. return;
  4642. ast_index = rx_user_status->ast_index;
  4643. if (ast_index >=
  4644. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  4645. if (ppdu_info->sw_frame_group_id ==
  4646. HAL_MPDU_SW_FRAME_GROUP_CTRL_BAR)
  4647. return;
  4648. ptr_mac_addr = &ppdu_info->nac_info.mac_addr2[0];
  4649. if (!dp_peer_or_pdev_tx_cap_enabled(pdev,
  4650. NULL, ptr_mac_addr))
  4651. return;
  4652. if (IEEE80211_IS_ZERO(ppdu_info->nac_info.mac_addr2))
  4653. return;
  4654. set_mpdu_info(&tx_capture_info,
  4655. rx_status, rx_user_status);
  4656. tx_capture_info.mpdu_nbuf =
  4657. qdf_nbuf_alloc(pdev->soc->osdev,
  4658. MAX_MONITOR_HEADER +
  4659. DP_BA_ACK_FRAME_SIZE,
  4660. MAX_MONITOR_HEADER,
  4661. 4, FALSE);
  4662. if (!tx_capture_info.mpdu_nbuf)
  4663. return;
  4664. dp_gen_ack_frame(ppdu_info, NULL,
  4665. tx_capture_info.mpdu_nbuf);
  4666. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  4667. &tx_capture_info, HTT_INVALID_PEER,
  4668. WDI_NO_VAL, pdev->pdev_id);
  4669. if (tx_capture_info.mpdu_nbuf)
  4670. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  4671. return;
  4672. }
  4673. qdf_spin_lock_bh(&soc->ast_lock);
  4674. ast_entry = soc->ast_table[ast_index];
  4675. if (!ast_entry) {
  4676. qdf_spin_unlock_bh(&soc->ast_lock);
  4677. return;
  4678. }
  4679. peer = ast_entry->peer;
  4680. if (!peer || peer->peer_id == HTT_INVALID_PEER) {
  4681. qdf_spin_unlock_bh(&soc->ast_lock);
  4682. return;
  4683. }
  4684. peer_id = peer->peer_id;
  4685. qdf_spin_unlock_bh(&soc->ast_lock);
  4686. peer = dp_peer_find_by_id(soc, peer_id);
  4687. if (!peer)
  4688. return;
  4689. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, peer,
  4690. peer->mac_addr.raw)) {
  4691. dp_peer_unref_del_find_by_id(peer);
  4692. return;
  4693. }
  4694. set_mpdu_info(&tx_capture_info,
  4695. rx_status, rx_user_status);
  4696. tx_capture_info.mpdu_nbuf =
  4697. qdf_nbuf_alloc(pdev->soc->osdev,
  4698. MAX_MONITOR_HEADER +
  4699. DP_BA_ACK_FRAME_SIZE,
  4700. MAX_MONITOR_HEADER,
  4701. 4, FALSE);
  4702. if (!tx_capture_info.mpdu_nbuf) {
  4703. dp_peer_unref_del_find_by_id(peer);
  4704. return;
  4705. }
  4706. if (peer->rx_tid[rx_user_status->tid].ba_status == DP_RX_BA_ACTIVE ||
  4707. ppdu_info->sw_frame_group_id == HAL_MPDU_SW_FRAME_GROUP_CTRL_BAR) {
  4708. dp_gen_block_ack_frame(ppdu_info,
  4709. rx_user_status,
  4710. rx_user_info,
  4711. peer,
  4712. tx_capture_info.mpdu_nbuf);
  4713. tx_capture_info.mpdu_info.tid = rx_user_status->tid;
  4714. } else {
  4715. dp_gen_ack_frame(ppdu_info, peer,
  4716. tx_capture_info.mpdu_nbuf);
  4717. }
  4718. dp_peer_unref_del_find_by_id(peer);
  4719. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  4720. &tx_capture_info, HTT_INVALID_PEER,
  4721. WDI_NO_VAL, pdev->pdev_id);
  4722. if (tx_capture_info.mpdu_nbuf)
  4723. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  4724. }
  4725. /**
  4726. * dp_send_ack_frame_to_stack(): Function to generate BA or ACK frame and
  4727. * send to upper layer on received unicast frame
  4728. * @soc: core txrx main context
  4729. * @pdev: DP pdev object
  4730. * @ppdu_info: HAL RX PPDU info retrieved from status ring TLV
  4731. *
  4732. * return: status
  4733. */
  4734. QDF_STATUS dp_send_ack_frame_to_stack(struct dp_soc *soc,
  4735. struct dp_pdev *pdev,
  4736. struct hal_rx_ppdu_info *ppdu_info)
  4737. {
  4738. struct mon_rx_status *rx_status;
  4739. struct mon_rx_user_status *rx_user_status;
  4740. struct mon_rx_user_info *rx_user_info;
  4741. uint32_t i;
  4742. rx_status = &ppdu_info->rx_status;
  4743. if (ppdu_info->sw_frame_group_id ==
  4744. HAL_MPDU_SW_FRAME_GROUP_CTRL_RTS) {
  4745. return dp_send_cts_frame_to_stack(soc, pdev, ppdu_info);
  4746. }
  4747. if (!rx_status->rxpcu_filter_pass)
  4748. return QDF_STATUS_SUCCESS;
  4749. if (ppdu_info->sw_frame_group_id ==
  4750. HAL_MPDU_SW_FRAME_GROUP_MGMT_BEACON ||
  4751. ppdu_info->sw_frame_group_id ==
  4752. HAL_MPDU_SW_FRAME_GROUP_CTRL_NDPA)
  4753. return QDF_STATUS_SUCCESS;
  4754. if (ppdu_info->sw_frame_group_id == HAL_MPDU_SW_FRAME_GROUP_MGMT_PROBE_REQ &&
  4755. (ppdu_info->rx_info.mac_addr1[0] & 1)) {
  4756. return QDF_STATUS_SUCCESS;
  4757. }
  4758. if (ppdu_info->sw_frame_group_id == HAL_MPDU_SW_FRAME_GROUP_CTRL_BAR)
  4759. return QDF_STATUS_SUCCESS;
  4760. for (i = 0; i < ppdu_info->com_info.num_users; i++) {
  4761. if (i > OFDMA_NUM_USERS)
  4762. return QDF_STATUS_E_FAULT;
  4763. rx_user_status = &ppdu_info->rx_user_status[i];
  4764. rx_user_info = &ppdu_info->rx_user_info[i];
  4765. dp_send_usr_ack_frm_to_stack(soc, pdev, ppdu_info, rx_status,
  4766. rx_user_status, rx_user_info);
  4767. }
  4768. return QDF_STATUS_SUCCESS;
  4769. }
  4770. /**
  4771. * dp_bar_send_ack_frm_to_stack(): send BA or ACK frame
  4772. * to upper layers on received BAR packet for tx capture feature
  4773. *
  4774. * @soc: soc handle
  4775. * @pdev: pdev handle
  4776. * @nbuf: received packet
  4777. *
  4778. * Return: QDF_STATUS_SUCCESS on success
  4779. * others on error
  4780. */
  4781. QDF_STATUS
  4782. dp_bar_send_ack_frm_to_stack(struct dp_soc *soc,
  4783. struct dp_pdev *pdev,
  4784. qdf_nbuf_t nbuf)
  4785. {
  4786. struct ieee80211_ctlframe_addr2 *wh;
  4787. uint8_t *frm;
  4788. struct hal_rx_ppdu_info *ppdu_info;
  4789. struct mon_rx_status *rx_status;
  4790. struct mon_rx_user_status *rx_user_status;
  4791. struct mon_rx_user_info *rx_user_info;
  4792. uint16_t bar_ctl;
  4793. uint32_t user_id;
  4794. uint8_t tid;
  4795. if (!nbuf)
  4796. return QDF_STATUS_E_INVAL;
  4797. wh = (struct ieee80211_ctlframe_addr2 *)qdf_nbuf_data(nbuf);
  4798. if (wh->i_fc[0] != (IEEE80211_FC0_VERSION_0 |
  4799. IEEE80211_FC0_TYPE_CTL | IEEE80211_FC0_SUBTYPE_BAR)) {
  4800. return QDF_STATUS_SUCCESS;
  4801. }
  4802. frm = (uint8_t *)&wh[1];
  4803. bar_ctl = qdf_le16_to_cpu(*(uint16_t *)frm);
  4804. if (bar_ctl & DP_IEEE80211_BAR_CTL_POLICY_M)
  4805. return QDF_STATUS_SUCCESS;
  4806. tid = (bar_ctl >> DP_IEEE80211_BAR_CTL_TID_S) &
  4807. DP_IEEE80211_BAR_CTL_TID_M;
  4808. ppdu_info = &pdev->ppdu_info;
  4809. user_id = ppdu_info->rx_info.user_id;
  4810. rx_status = &ppdu_info->rx_status;
  4811. rx_user_status = &ppdu_info->rx_user_status[user_id];
  4812. rx_user_info = &ppdu_info->rx_user_info[user_id];
  4813. rx_user_status->tid = tid;
  4814. dp_send_usr_ack_frm_to_stack(soc, pdev, ppdu_info, rx_status,
  4815. rx_user_status, rx_user_info);
  4816. return QDF_STATUS_SUCCESS;
  4817. }
  4818. /**
  4819. * dp_gen_noack_frame: generate noack Action frame by using parameters
  4820. * from received NDPA frame
  4821. * @ppdu_info: pointer to ppdu_info
  4822. * @peer: pointer to peer structure
  4823. * @mpdu_nbuf: buffer for the generated noack frame
  4824. * @mon_mpdu: mpdu from monitor destination path
  4825. *
  4826. * Return: QDF_STATUS
  4827. */
  4828. static void dp_gen_noack_frame(struct hal_rx_ppdu_info *ppdu_info,
  4829. struct dp_peer *peer, qdf_nbuf_t mpdu_nbuf,
  4830. qdf_nbuf_t mon_mpdu)
  4831. {
  4832. struct ieee80211_frame *wh;
  4833. uint16_t duration;
  4834. struct dp_vdev *vdev = NULL;
  4835. char *ndpa_buf = qdf_nbuf_data(mon_mpdu);
  4836. uint8_t token = 0;
  4837. uint8_t *frm;
  4838. wh = (struct ieee80211_frame *)qdf_nbuf_data(mpdu_nbuf);
  4839. qdf_mem_zero(((char *)wh), DP_ACKNOACK_FRAME_SIZE);
  4840. wh->i_fc[0] = IEEE80211_FC0_VERSION_0 |
  4841. IEEE80211_FC0_TYPE_MGT |
  4842. IEEE80211_FCO_SUBTYPE_ACTION_NO_ACK;
  4843. qdf_mem_copy(wh->i_addr1, &peer->mac_addr.raw[0], QDF_MAC_ADDR_SIZE);
  4844. vdev = peer->vdev;
  4845. if (vdev) {
  4846. qdf_mem_copy(wh->i_addr2,
  4847. vdev->mac_addr.raw,
  4848. QDF_MAC_ADDR_SIZE);
  4849. qdf_mem_copy(wh->i_addr3,
  4850. vdev->mac_addr.raw,
  4851. QDF_MAC_ADDR_SIZE);
  4852. }
  4853. duration = (ppdu_info->rx_status.duration > SIFS_INTERVAL) ?
  4854. ppdu_info->rx_status.duration - SIFS_INTERVAL : 0;
  4855. wh->i_dur[0] = duration & 0xff;
  4856. wh->i_dur[1] = (duration >> 8) & 0xff;
  4857. frm = (uint8_t *)&wh[1];
  4858. /*
  4859. * Update category field
  4860. */
  4861. *frm = DP_IEEE80211_CATEGORY_VHT;
  4862. /*
  4863. * Update sounding token obtained from NDPA,
  4864. * shift to get upper six bits
  4865. */
  4866. frm += DP_NOACK_SOUNDING_TOKEN_POS;
  4867. token = ndpa_buf[DP_NDPA_TOKEN_POS] >> DP_NOACK_STOKEN_POS_SHIFT;
  4868. *frm = (token) << DP_NOACK_STOKEN_POS_SHIFT;
  4869. qdf_nbuf_set_pktlen(mpdu_nbuf, DP_ACKNOACK_FRAME_SIZE);
  4870. }
  4871. /**
  4872. * dp_send_noack_frame_to_stack: Sends noack Action frame to upper stack
  4873. * in response to received NDPA frame.
  4874. * @soc: SoC handle
  4875. * @pdev: PDEV pointer
  4876. * @mon_mpdu: mpdu from monitor destination path
  4877. *
  4878. * Return: QDF_STATUS
  4879. */
  4880. QDF_STATUS dp_send_noack_frame_to_stack(struct dp_soc *soc,
  4881. struct dp_pdev *pdev,
  4882. qdf_nbuf_t mon_mpdu)
  4883. {
  4884. struct hal_rx_ppdu_info *ppdu_info = &pdev->ppdu_info;
  4885. struct mon_rx_user_status *rx_user_status =
  4886. &ppdu_info->rx_user_status[0];
  4887. struct dp_ast_entry *ast_entry;
  4888. uint32_t peer_id;
  4889. struct dp_peer *peer;
  4890. struct cdp_tx_indication_info tx_capture_info;
  4891. if (rx_user_status->ast_index >=
  4892. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  4893. return QDF_STATUS_E_FAILURE;
  4894. }
  4895. qdf_spin_lock_bh(&soc->ast_lock);
  4896. ast_entry = soc->ast_table[rx_user_status->ast_index];
  4897. if (!ast_entry) {
  4898. qdf_spin_unlock_bh(&soc->ast_lock);
  4899. return QDF_STATUS_E_FAILURE;
  4900. }
  4901. peer = ast_entry->peer;
  4902. if (!peer || peer->peer_id == HTT_INVALID_PEER) {
  4903. qdf_spin_unlock_bh(&soc->ast_lock);
  4904. return QDF_STATUS_E_FAILURE;
  4905. }
  4906. peer_id = peer->peer_id;
  4907. qdf_spin_unlock_bh(&soc->ast_lock);
  4908. peer = dp_peer_find_by_id(soc, peer_id);
  4909. if (!peer) {
  4910. return QDF_STATUS_E_FAILURE;
  4911. }
  4912. if (!dp_peer_or_pdev_tx_cap_enabled(pdev, peer, peer->mac_addr.raw)) {
  4913. dp_peer_unref_del_find_by_id(peer);
  4914. return QDF_STATUS_E_FAILURE;
  4915. }
  4916. set_mpdu_info(&tx_capture_info,
  4917. &ppdu_info->rx_status, rx_user_status);
  4918. tx_capture_info.mpdu_info.mcs = rx_user_status->mcs;
  4919. /*
  4920. *ppdu_desc is not required for legacy frames
  4921. */
  4922. tx_capture_info.ppdu_desc = NULL;
  4923. tx_capture_info.mpdu_nbuf =
  4924. qdf_nbuf_alloc(pdev->soc->osdev,
  4925. MAX_MONITOR_HEADER +
  4926. DP_ACKNOACK_FRAME_SIZE,
  4927. MAX_MONITOR_HEADER,
  4928. 4, FALSE);
  4929. if (!tx_capture_info.mpdu_nbuf) {
  4930. dp_peer_unref_del_find_by_id(peer);
  4931. return QDF_STATUS_E_NOMEM;
  4932. }
  4933. dp_gen_noack_frame(ppdu_info, peer,
  4934. tx_capture_info.mpdu_nbuf, mon_mpdu);
  4935. dp_peer_unref_del_find_by_id(peer);
  4936. dp_wdi_event_handler(WDI_EVENT_TX_DATA, pdev->soc,
  4937. &tx_capture_info, HTT_INVALID_PEER,
  4938. WDI_NO_VAL, pdev->pdev_id);
  4939. if (tx_capture_info.mpdu_nbuf)
  4940. qdf_nbuf_free(tx_capture_info.mpdu_nbuf);
  4941. return QDF_STATUS_SUCCESS;
  4942. }
  4943. /**
  4944. * dp_handle_tx_capture_from_dest: Handle any TX capture frames from
  4945. * monitor destination path.
  4946. * @soc: SoC handle
  4947. * @pdev: PDEV pointer
  4948. * @mon_mpdu: mpdu from monitor destination path
  4949. *
  4950. * Return: QDF_STATUS
  4951. */
  4952. QDF_STATUS dp_handle_tx_capture_from_dest(struct dp_soc *soc,
  4953. struct dp_pdev *pdev,
  4954. qdf_nbuf_t mon_mpdu)
  4955. {
  4956. struct hal_rx_ppdu_info *ppdu_info = &pdev->ppdu_info;
  4957. /*
  4958. * The below switch case can be extended to
  4959. * add more frame types as needed
  4960. */
  4961. switch (ppdu_info->sw_frame_group_id) {
  4962. case HAL_MPDU_SW_FRAME_GROUP_CTRL_NDPA:
  4963. return dp_send_noack_frame_to_stack(soc, pdev, mon_mpdu);
  4964. case HAL_MPDU_SW_FRAME_GROUP_CTRL_BAR:
  4965. return dp_bar_send_ack_frm_to_stack(soc, pdev, mon_mpdu);
  4966. default:
  4967. break;
  4968. }
  4969. return QDF_STATUS_SUCCESS;
  4970. }
  4971. /**
  4972. * dp_peer_set_tx_capture_enabled: Set tx_cap_enabled bit in peer
  4973. * @pdev: DP PDEV handle
  4974. * @peer: Peer handle
  4975. * @value: Enable/disable setting for tx_cap_enabled
  4976. * @peer_mac: peer mac address
  4977. *
  4978. * Return: QDF_STATUS
  4979. */
  4980. QDF_STATUS
  4981. dp_peer_set_tx_capture_enabled(struct dp_pdev *pdev,
  4982. struct dp_peer *peer, uint8_t value,
  4983. uint8_t *peer_mac)
  4984. {
  4985. uint32_t peer_id = HTT_INVALID_PEER;
  4986. QDF_STATUS status = QDF_STATUS_E_FAILURE;
  4987. if (value) {
  4988. if (dp_peer_tx_cap_add_filter(pdev, peer_id, peer_mac)) {
  4989. if (peer)
  4990. peer->tx_cap_enabled = value;
  4991. status = QDF_STATUS_SUCCESS;
  4992. }
  4993. } else {
  4994. if (dp_peer_tx_cap_del_filter(pdev, peer_id, peer_mac)) {
  4995. if (peer)
  4996. peer->tx_cap_enabled = value;
  4997. status = QDF_STATUS_SUCCESS;
  4998. }
  4999. }
  5000. return status;
  5001. }
  5002. /*
  5003. * dp_peer_tx_capture_filter_check: check filter is enable for the filter
  5004. * and update tx_cap_enabled flag
  5005. * @pdev: DP PDEV handle
  5006. * @peer: DP PEER handle
  5007. *
  5008. * return: void
  5009. */
  5010. void dp_peer_tx_capture_filter_check(struct dp_pdev *pdev,
  5011. struct dp_peer *peer)
  5012. {
  5013. if (!peer)
  5014. return;
  5015. if (dp_peer_tx_cap_search(pdev, peer->peer_id,
  5016. peer->mac_addr.raw)) {
  5017. peer->tx_cap_enabled = 1;
  5018. }
  5019. return;
  5020. }
  5021. #endif