dp_tx_capture.c 155 KB

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