dp_peer.c 163 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2022 Qualcomm Innovation Center, Inc. All rights reserved.
  4. *
  5. * Permission to use, copy, modify, and/or distribute this software for
  6. * any purpose with or without fee is hereby granted, provided that the
  7. * above copyright notice and this permission notice appear in all
  8. * copies.
  9. *
  10. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  11. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  12. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  13. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  14. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  15. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  16. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  17. * PERFORMANCE OF THIS SOFTWARE.
  18. */
  19. #include <qdf_types.h>
  20. #include <qdf_lock.h>
  21. #include <hal_hw_headers.h>
  22. #include "dp_htt.h"
  23. #include "dp_types.h"
  24. #include "dp_internal.h"
  25. #include "dp_peer.h"
  26. #include "dp_rx_defrag.h"
  27. #include "dp_rx.h"
  28. #include <hal_api.h>
  29. #include <hal_reo.h>
  30. #include <cdp_txrx_handle.h>
  31. #include <wlan_cfg.h>
  32. #ifdef WIFI_MONITOR_SUPPORT
  33. #include <dp_mon.h>
  34. #endif
  35. #ifdef FEATURE_WDS
  36. #include "dp_txrx_wds.h"
  37. #endif
  38. #include <qdf_module.h>
  39. #ifdef QCA_PEER_EXT_STATS
  40. #include "dp_hist.h"
  41. #endif
  42. #ifdef BYPASS_OL_OPS
  43. #include <target_if_dp.h>
  44. #endif
  45. #ifdef REO_QDESC_HISTORY
  46. #define REO_QDESC_HISTORY_SIZE 512
  47. uint64_t reo_qdesc_history_idx;
  48. struct reo_qdesc_event reo_qdesc_history[REO_QDESC_HISTORY_SIZE];
  49. #endif
  50. #ifdef FEATURE_AST
  51. #ifdef BYPASS_OL_OPS
  52. /*
  53. * dp_add_wds_entry_wrapper() - Add new AST entry for the wds station
  54. * @soc: DP soc structure pointer
  55. * @peer: dp peer structure
  56. * @dest_mac: MAC address of ast node
  57. * @flags: wds or hmwds
  58. * @type: type from enum cdp_txrx_ast_entry_type
  59. *
  60. * This API is used by WDS source port learning function to
  61. * add a new AST entry in the fw.
  62. *
  63. * Return: 0 on success, error code otherwise.
  64. */
  65. static int dp_add_wds_entry_wrapper(struct dp_soc *soc,
  66. struct dp_peer *peer,
  67. const uint8_t *dest_macaddr,
  68. uint32_t flags,
  69. uint8_t type)
  70. {
  71. QDF_STATUS status;
  72. status = target_if_add_wds_entry(soc->ctrl_psoc,
  73. peer->vdev->vdev_id,
  74. peer->mac_addr.raw,
  75. dest_macaddr,
  76. WMI_HOST_WDS_FLAG_STATIC,
  77. type);
  78. return qdf_status_to_os_return(status);
  79. }
  80. /*
  81. * dp_update_wds_entry_wrapper() - update an existing wds entry with new peer
  82. * @soc: DP soc structure pointer
  83. * @peer: dp peer structure
  84. * @dest_macaddr: MAC address of ast node
  85. * @flags: wds or hmwds
  86. *
  87. * This API is used by update the peer mac address for the ast
  88. * in the fw.
  89. *
  90. * Return: 0 on success, error code otherwise.
  91. */
  92. static int dp_update_wds_entry_wrapper(struct dp_soc *soc,
  93. struct dp_peer *peer,
  94. uint8_t *dest_macaddr,
  95. uint32_t flags)
  96. {
  97. QDF_STATUS status;
  98. status = target_if_update_wds_entry(soc->ctrl_psoc,
  99. peer->vdev->vdev_id,
  100. dest_macaddr,
  101. peer->mac_addr.raw,
  102. WMI_HOST_WDS_FLAG_STATIC);
  103. return qdf_status_to_os_return(status);
  104. }
  105. /*
  106. * dp_del_wds_entry_wrapper() - delete a WSD AST entry
  107. * @soc: DP soc structure pointer
  108. * @vdev_id: vdev_id
  109. * @wds_macaddr: MAC address of ast node
  110. * @type: type from enum cdp_txrx_ast_entry_type
  111. * @delete_in_fw: Flag to indicate if entry needs to be deleted in fw
  112. *
  113. * This API is used to delete an AST entry from fw
  114. *
  115. * Return: None
  116. */
  117. static void dp_del_wds_entry_wrapper(struct dp_soc *soc,
  118. uint8_t vdev_id,
  119. uint8_t *wds_macaddr,
  120. uint8_t type,
  121. uint8_t delete_in_fw)
  122. {
  123. target_if_del_wds_entry(soc->ctrl_psoc, vdev_id,
  124. wds_macaddr, type, delete_in_fw);
  125. }
  126. #else
  127. static int dp_add_wds_entry_wrapper(struct dp_soc *soc,
  128. struct dp_peer *peer,
  129. const uint8_t *dest_macaddr,
  130. uint32_t flags,
  131. uint8_t type)
  132. {
  133. int status;
  134. status = soc->cdp_soc.ol_ops->peer_add_wds_entry(
  135. soc->ctrl_psoc,
  136. peer->vdev->vdev_id,
  137. peer->mac_addr.raw,
  138. peer->peer_id,
  139. dest_macaddr,
  140. peer->mac_addr.raw,
  141. flags,
  142. type);
  143. return status;
  144. }
  145. static int dp_update_wds_entry_wrapper(struct dp_soc *soc,
  146. struct dp_peer *peer,
  147. uint8_t *dest_macaddr,
  148. uint32_t flags)
  149. {
  150. int status;
  151. status = soc->cdp_soc.ol_ops->peer_update_wds_entry(
  152. soc->ctrl_psoc,
  153. peer->vdev->vdev_id,
  154. dest_macaddr,
  155. peer->mac_addr.raw,
  156. flags);
  157. return status;
  158. }
  159. static void dp_del_wds_entry_wrapper(struct dp_soc *soc,
  160. uint8_t vdev_id,
  161. uint8_t *wds_macaddr,
  162. uint8_t type,
  163. uint8_t delete_in_fw)
  164. {
  165. soc->cdp_soc.ol_ops->peer_del_wds_entry(soc->ctrl_psoc,
  166. vdev_id,
  167. wds_macaddr,
  168. type,
  169. delete_in_fw);
  170. }
  171. #endif
  172. #endif
  173. #ifdef FEATURE_WDS
  174. static inline bool
  175. dp_peer_ast_free_in_unmap_supported(struct dp_soc *soc,
  176. struct dp_ast_entry *ast_entry)
  177. {
  178. /* if peer map v2 is enabled we are not freeing ast entry
  179. * here and it is supposed to be freed in unmap event (after
  180. * we receive delete confirmation from target)
  181. *
  182. * if peer_id is invalid we did not get the peer map event
  183. * for the peer free ast entry from here only in this case
  184. */
  185. if ((ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC) &&
  186. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF))
  187. return true;
  188. return false;
  189. }
  190. #else
  191. static inline bool
  192. dp_peer_ast_free_in_unmap_supported(struct dp_soc *soc,
  193. struct dp_ast_entry *ast_entry)
  194. {
  195. return false;
  196. }
  197. void dp_soc_wds_attach(struct dp_soc *soc)
  198. {
  199. }
  200. void dp_soc_wds_detach(struct dp_soc *soc)
  201. {
  202. }
  203. #endif
  204. #ifdef REO_QDESC_HISTORY
  205. static inline void
  206. dp_rx_reo_qdesc_history_add(struct reo_desc_list_node *free_desc,
  207. enum reo_qdesc_event_type type)
  208. {
  209. struct reo_qdesc_event *evt;
  210. struct dp_rx_tid *rx_tid = &free_desc->rx_tid;
  211. uint32_t idx;
  212. reo_qdesc_history_idx++;
  213. idx = (reo_qdesc_history_idx & (REO_QDESC_HISTORY_SIZE - 1));
  214. evt = &reo_qdesc_history[idx];
  215. qdf_mem_copy(evt->peer_mac, free_desc->peer_mac, QDF_MAC_ADDR_SIZE);
  216. evt->qdesc_addr = rx_tid->hw_qdesc_paddr;
  217. evt->ts = qdf_get_log_timestamp();
  218. evt->type = type;
  219. }
  220. #ifdef WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY
  221. static inline void
  222. dp_rx_reo_qdesc_deferred_evt_add(struct reo_desc_deferred_freelist_node *desc,
  223. enum reo_qdesc_event_type type)
  224. {
  225. struct reo_qdesc_event *evt;
  226. uint32_t idx;
  227. reo_qdesc_history_idx++;
  228. idx = (reo_qdesc_history_idx & (REO_QDESC_HISTORY_SIZE - 1));
  229. evt = &reo_qdesc_history[idx];
  230. qdf_mem_copy(evt->peer_mac, desc->peer_mac, QDF_MAC_ADDR_SIZE);
  231. evt->qdesc_addr = desc->hw_qdesc_paddr;
  232. evt->ts = qdf_get_log_timestamp();
  233. evt->type = type;
  234. }
  235. #define DP_RX_REO_QDESC_DEFERRED_FREE_EVT(desc) \
  236. dp_rx_reo_qdesc_deferred_evt_add((desc), REO_QDESC_FREE)
  237. #define DP_RX_REO_QDESC_DEFERRED_GET_MAC(desc, freedesc) \
  238. qdf_mem_copy(desc->peer_mac, freedesc->peer_mac, QDF_MAC_ADDR_SIZE)
  239. #endif /* WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY */
  240. #define DP_RX_REO_QDESC_GET_MAC(freedesc, peer) \
  241. qdf_mem_copy(freedesc->peer_mac, peer->mac_addr.raw, QDF_MAC_ADDR_SIZE)
  242. #define DP_RX_REO_QDESC_UPDATE_EVT(free_desc) \
  243. dp_rx_reo_qdesc_history_add((free_desc), REO_QDESC_UPDATE_CB)
  244. #define DP_RX_REO_QDESC_FREE_EVT(free_desc) \
  245. dp_rx_reo_qdesc_history_add((free_desc), REO_QDESC_FREE)
  246. #else
  247. #define DP_RX_REO_QDESC_GET_MAC(freedesc, peer)
  248. #define DP_RX_REO_QDESC_UPDATE_EVT(free_desc)
  249. #define DP_RX_REO_QDESC_FREE_EVT(free_desc)
  250. #define DP_RX_REO_QDESC_DEFERRED_FREE_EVT(desc)
  251. #define DP_RX_REO_QDESC_DEFERRED_GET_MAC(desc, freedesc)
  252. #endif
  253. static inline void
  254. dp_set_ssn_valid_flag(struct hal_reo_cmd_params *params,
  255. uint8_t valid)
  256. {
  257. params->u.upd_queue_params.update_svld = 1;
  258. params->u.upd_queue_params.svld = valid;
  259. dp_peer_debug("Setting SSN valid bit to %d",
  260. valid);
  261. }
  262. QDF_STATUS dp_peer_ast_table_attach(struct dp_soc *soc)
  263. {
  264. uint32_t max_ast_index;
  265. max_ast_index = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  266. /* allocate ast_table for ast entry to ast_index map */
  267. dp_peer_info("\n%pK:<=== cfg max ast idx %d ====>", soc, max_ast_index);
  268. soc->ast_table = qdf_mem_malloc(max_ast_index *
  269. sizeof(struct dp_ast_entry *));
  270. if (!soc->ast_table) {
  271. dp_peer_err("%pK: ast_table memory allocation failed", soc);
  272. return QDF_STATUS_E_NOMEM;
  273. }
  274. return QDF_STATUS_SUCCESS; /* success */
  275. }
  276. /*
  277. * dp_peer_find_map_attach() - allocate memory for peer_id_to_obj_map
  278. * @soc: soc handle
  279. *
  280. * return: QDF_STATUS
  281. */
  282. static QDF_STATUS dp_peer_find_map_attach(struct dp_soc *soc)
  283. {
  284. uint32_t max_peers, peer_map_size;
  285. max_peers = soc->max_peer_id;
  286. /* allocate the peer ID -> peer object map */
  287. dp_peer_info("\n%pK:<=== cfg max peer id %d ====>", soc, max_peers);
  288. peer_map_size = max_peers * sizeof(soc->peer_id_to_obj_map[0]);
  289. soc->peer_id_to_obj_map = qdf_mem_malloc(peer_map_size);
  290. if (!soc->peer_id_to_obj_map) {
  291. dp_peer_err("%pK: peer map memory allocation failed", soc);
  292. return QDF_STATUS_E_NOMEM;
  293. }
  294. /*
  295. * The peer_id_to_obj_map doesn't really need to be initialized,
  296. * since elements are only used after they have been individually
  297. * initialized.
  298. * However, it is convenient for debugging to have all elements
  299. * that are not in use set to 0.
  300. */
  301. qdf_mem_zero(soc->peer_id_to_obj_map, peer_map_size);
  302. qdf_spinlock_create(&soc->peer_map_lock);
  303. return QDF_STATUS_SUCCESS; /* success */
  304. }
  305. #define DP_AST_HASH_LOAD_MULT 2
  306. #define DP_AST_HASH_LOAD_SHIFT 0
  307. static inline uint32_t
  308. dp_peer_find_hash_index(struct dp_soc *soc,
  309. union dp_align_mac_addr *mac_addr)
  310. {
  311. uint32_t index;
  312. index =
  313. mac_addr->align2.bytes_ab ^
  314. mac_addr->align2.bytes_cd ^
  315. mac_addr->align2.bytes_ef;
  316. index ^= index >> soc->peer_hash.idx_bits;
  317. index &= soc->peer_hash.mask;
  318. return index;
  319. }
  320. /*
  321. * dp_peer_find_hash_find() - returns legacy or mlo link peer from
  322. * peer_hash_table matching vdev_id and mac_address
  323. * @soc: soc handle
  324. * @peer_mac_addr: peer mac address
  325. * @mac_addr_is_aligned: is mac addr aligned
  326. * @vdev_id: vdev_id
  327. * @mod_id: id of module requesting reference
  328. *
  329. * return: peer in sucsess
  330. * NULL in failure
  331. */
  332. struct dp_peer *dp_peer_find_hash_find(
  333. struct dp_soc *soc, uint8_t *peer_mac_addr,
  334. int mac_addr_is_aligned, uint8_t vdev_id,
  335. enum dp_mod_id mod_id)
  336. {
  337. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  338. uint32_t index;
  339. struct dp_peer *peer;
  340. if (!soc->peer_hash.bins)
  341. return NULL;
  342. if (mac_addr_is_aligned) {
  343. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  344. } else {
  345. qdf_mem_copy(
  346. &local_mac_addr_aligned.raw[0],
  347. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  348. mac_addr = &local_mac_addr_aligned;
  349. }
  350. index = dp_peer_find_hash_index(soc, mac_addr);
  351. qdf_spin_lock_bh(&soc->peer_hash_lock);
  352. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  353. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  354. ((peer->vdev->vdev_id == vdev_id) ||
  355. (vdev_id == DP_VDEV_ALL))) {
  356. /* take peer reference before returning */
  357. if (dp_peer_get_ref(soc, peer, mod_id) !=
  358. QDF_STATUS_SUCCESS)
  359. peer = NULL;
  360. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  361. return peer;
  362. }
  363. }
  364. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  365. return NULL; /* failure */
  366. }
  367. qdf_export_symbol(dp_peer_find_hash_find);
  368. #ifdef WLAN_FEATURE_11BE_MLO
  369. /*
  370. * dp_peer_find_hash_detach() - cleanup memory for peer_hash table
  371. * @soc: soc handle
  372. *
  373. * return: none
  374. */
  375. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  376. {
  377. if (soc->peer_hash.bins) {
  378. qdf_mem_free(soc->peer_hash.bins);
  379. soc->peer_hash.bins = NULL;
  380. qdf_spinlock_destroy(&soc->peer_hash_lock);
  381. }
  382. if (soc->arch_ops.mlo_peer_find_hash_detach)
  383. soc->arch_ops.mlo_peer_find_hash_detach(soc);
  384. }
  385. /*
  386. * dp_peer_find_hash_attach() - allocate memory for peer_hash table
  387. * @soc: soc handle
  388. *
  389. * return: QDF_STATUS
  390. */
  391. static QDF_STATUS dp_peer_find_hash_attach(struct dp_soc *soc)
  392. {
  393. int i, hash_elems, log2;
  394. /* allocate the peer MAC address -> peer object hash table */
  395. hash_elems = soc->max_peers;
  396. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  397. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  398. log2 = dp_log2_ceil(hash_elems);
  399. hash_elems = 1 << log2;
  400. soc->peer_hash.mask = hash_elems - 1;
  401. soc->peer_hash.idx_bits = log2;
  402. /* allocate an array of TAILQ peer object lists */
  403. soc->peer_hash.bins = qdf_mem_malloc(
  404. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  405. if (!soc->peer_hash.bins)
  406. return QDF_STATUS_E_NOMEM;
  407. for (i = 0; i < hash_elems; i++)
  408. TAILQ_INIT(&soc->peer_hash.bins[i]);
  409. qdf_spinlock_create(&soc->peer_hash_lock);
  410. if (soc->arch_ops.mlo_peer_find_hash_attach &&
  411. (soc->arch_ops.mlo_peer_find_hash_attach(soc) !=
  412. QDF_STATUS_SUCCESS)) {
  413. dp_peer_find_hash_detach(soc);
  414. return QDF_STATUS_E_NOMEM;
  415. }
  416. return QDF_STATUS_SUCCESS;
  417. }
  418. /*
  419. * dp_peer_find_hash_add() - add peer to peer_hash_table
  420. * @soc: soc handle
  421. * @peer: peer handle
  422. * @peer_type: link or mld peer
  423. *
  424. * return: none
  425. */
  426. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  427. {
  428. unsigned index;
  429. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  430. if (peer->peer_type == CDP_LINK_PEER_TYPE) {
  431. qdf_spin_lock_bh(&soc->peer_hash_lock);
  432. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer,
  433. DP_MOD_ID_CONFIG))) {
  434. dp_err("fail to get peer ref:" QDF_MAC_ADDR_FMT,
  435. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  436. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  437. return;
  438. }
  439. /*
  440. * It is important to add the new peer at the tail of
  441. * peer list with the bin index. Together with having
  442. * the hash_find function search from head to tail,
  443. * this ensures that if two entries with the same MAC address
  444. * are stored, the one added first will be found first.
  445. */
  446. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer,
  447. hash_list_elem);
  448. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  449. } else if (peer->peer_type == CDP_MLD_PEER_TYPE) {
  450. if (soc->arch_ops.mlo_peer_find_hash_add)
  451. soc->arch_ops.mlo_peer_find_hash_add(soc, peer);
  452. } else {
  453. dp_err("unknown peer type %d", peer->peer_type);
  454. }
  455. }
  456. /*
  457. * dp_peer_find_hash_remove() - remove peer from peer_hash_table
  458. * @soc: soc handle
  459. * @peer: peer handle
  460. *
  461. * return: none
  462. */
  463. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  464. {
  465. unsigned index;
  466. struct dp_peer *tmppeer = NULL;
  467. int found = 0;
  468. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  469. if (peer->peer_type == CDP_LINK_PEER_TYPE) {
  470. /* Check if tail is not empty before delete*/
  471. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  472. qdf_spin_lock_bh(&soc->peer_hash_lock);
  473. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index],
  474. hash_list_elem) {
  475. if (tmppeer == peer) {
  476. found = 1;
  477. break;
  478. }
  479. }
  480. QDF_ASSERT(found);
  481. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer,
  482. hash_list_elem);
  483. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  484. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  485. } else if (peer->peer_type == CDP_MLD_PEER_TYPE) {
  486. if (soc->arch_ops.mlo_peer_find_hash_remove)
  487. soc->arch_ops.mlo_peer_find_hash_remove(soc, peer);
  488. } else {
  489. dp_err("unknown peer type %d", peer->peer_type);
  490. }
  491. }
  492. #else
  493. static QDF_STATUS dp_peer_find_hash_attach(struct dp_soc *soc)
  494. {
  495. int i, hash_elems, log2;
  496. /* allocate the peer MAC address -> peer object hash table */
  497. hash_elems = soc->max_peers;
  498. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  499. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  500. log2 = dp_log2_ceil(hash_elems);
  501. hash_elems = 1 << log2;
  502. soc->peer_hash.mask = hash_elems - 1;
  503. soc->peer_hash.idx_bits = log2;
  504. /* allocate an array of TAILQ peer object lists */
  505. soc->peer_hash.bins = qdf_mem_malloc(
  506. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  507. if (!soc->peer_hash.bins)
  508. return QDF_STATUS_E_NOMEM;
  509. for (i = 0; i < hash_elems; i++)
  510. TAILQ_INIT(&soc->peer_hash.bins[i]);
  511. qdf_spinlock_create(&soc->peer_hash_lock);
  512. return QDF_STATUS_SUCCESS;
  513. }
  514. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  515. {
  516. if (soc->peer_hash.bins) {
  517. qdf_mem_free(soc->peer_hash.bins);
  518. soc->peer_hash.bins = NULL;
  519. qdf_spinlock_destroy(&soc->peer_hash_lock);
  520. }
  521. }
  522. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  523. {
  524. unsigned index;
  525. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  526. qdf_spin_lock_bh(&soc->peer_hash_lock);
  527. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  528. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT,
  529. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  530. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  531. return;
  532. }
  533. /*
  534. * It is important to add the new peer at the tail of the peer list
  535. * with the bin index. Together with having the hash_find function
  536. * search from head to tail, this ensures that if two entries with
  537. * the same MAC address are stored, the one added first will be
  538. * found first.
  539. */
  540. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer, hash_list_elem);
  541. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  542. }
  543. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  544. {
  545. unsigned index;
  546. struct dp_peer *tmppeer = NULL;
  547. int found = 0;
  548. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  549. /* Check if tail is not empty before delete*/
  550. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  551. qdf_spin_lock_bh(&soc->peer_hash_lock);
  552. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index], hash_list_elem) {
  553. if (tmppeer == peer) {
  554. found = 1;
  555. break;
  556. }
  557. }
  558. QDF_ASSERT(found);
  559. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer, hash_list_elem);
  560. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  561. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  562. }
  563. #endif/* WLAN_FEATURE_11BE_MLO */
  564. /*
  565. * dp_peer_vdev_list_add() - add peer into vdev's peer list
  566. * @soc: soc handle
  567. * @vdev: vdev handle
  568. * @peer: peer handle
  569. *
  570. * return: none
  571. */
  572. void dp_peer_vdev_list_add(struct dp_soc *soc, struct dp_vdev *vdev,
  573. struct dp_peer *peer)
  574. {
  575. /* only link peer will be added to vdev peer list */
  576. if (IS_MLO_DP_MLD_PEER(peer))
  577. return;
  578. qdf_spin_lock_bh(&vdev->peer_list_lock);
  579. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  580. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT,
  581. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  582. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  583. return;
  584. }
  585. /* add this peer into the vdev's list */
  586. if (wlan_op_mode_sta == vdev->opmode)
  587. TAILQ_INSERT_HEAD(&vdev->peer_list, peer, peer_list_elem);
  588. else
  589. TAILQ_INSERT_TAIL(&vdev->peer_list, peer, peer_list_elem);
  590. vdev->num_peers++;
  591. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  592. }
  593. /*
  594. * dp_peer_vdev_list_remove() - remove peer from vdev's peer list
  595. * @soc: SoC handle
  596. * @vdev: VDEV handle
  597. * @peer: peer handle
  598. *
  599. * Return: none
  600. */
  601. void dp_peer_vdev_list_remove(struct dp_soc *soc, struct dp_vdev *vdev,
  602. struct dp_peer *peer)
  603. {
  604. uint8_t found = 0;
  605. struct dp_peer *tmppeer = NULL;
  606. /* only link peer will be added to vdev peer list */
  607. if (IS_MLO_DP_MLD_PEER(peer))
  608. return;
  609. qdf_spin_lock_bh(&vdev->peer_list_lock);
  610. TAILQ_FOREACH(tmppeer, &peer->vdev->peer_list, peer_list_elem) {
  611. if (tmppeer == peer) {
  612. found = 1;
  613. break;
  614. }
  615. }
  616. if (found) {
  617. TAILQ_REMOVE(&peer->vdev->peer_list, peer,
  618. peer_list_elem);
  619. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  620. vdev->num_peers--;
  621. } else {
  622. /*Ignoring the remove operation as peer not found*/
  623. dp_peer_debug("%pK: peer:%pK not found in vdev:%pK peerlist:%pK"
  624. , soc, peer, vdev, &peer->vdev->peer_list);
  625. }
  626. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  627. }
  628. /*
  629. * dp_txrx_peer_attach_add() - Attach txrx_peer and add it to peer_id table
  630. * @soc: SoC handle
  631. * @peer: peer handle
  632. * @txrx_peer: txrx peer handle
  633. *
  634. * Return: None
  635. */
  636. void dp_txrx_peer_attach_add(struct dp_soc *soc,
  637. struct dp_peer *peer,
  638. struct dp_txrx_peer *txrx_peer)
  639. {
  640. qdf_spin_lock_bh(&soc->peer_map_lock);
  641. peer->txrx_peer = txrx_peer;
  642. txrx_peer->bss_peer = peer->bss_peer;
  643. if (peer->peer_id == HTT_INVALID_PEER) {
  644. qdf_spin_unlock_bh(&soc->peer_map_lock);
  645. return;
  646. }
  647. txrx_peer->peer_id = peer->peer_id;
  648. QDF_ASSERT(soc->peer_id_to_obj_map[peer->peer_id]);
  649. qdf_spin_unlock_bh(&soc->peer_map_lock);
  650. }
  651. /*
  652. * dp_peer_find_id_to_obj_add() - Add peer into peer_id table
  653. * @soc: SoC handle
  654. * @peer: peer handle
  655. * @peer_id: peer_id
  656. *
  657. * Return: None
  658. */
  659. void dp_peer_find_id_to_obj_add(struct dp_soc *soc,
  660. struct dp_peer *peer,
  661. uint16_t peer_id)
  662. {
  663. QDF_ASSERT(peer_id <= soc->max_peer_id);
  664. qdf_spin_lock_bh(&soc->peer_map_lock);
  665. peer->peer_id = peer_id;
  666. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  667. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT" peer_id %u",
  668. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer_id);
  669. qdf_spin_unlock_bh(&soc->peer_map_lock);
  670. return;
  671. }
  672. if (!soc->peer_id_to_obj_map[peer_id]) {
  673. soc->peer_id_to_obj_map[peer_id] = peer;
  674. if (peer->txrx_peer)
  675. peer->txrx_peer->peer_id = peer_id;
  676. } else {
  677. /* Peer map event came for peer_id which
  678. * is already mapped, this is not expected
  679. */
  680. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  681. QDF_ASSERT(0);
  682. }
  683. qdf_spin_unlock_bh(&soc->peer_map_lock);
  684. }
  685. /*
  686. * dp_peer_find_id_to_obj_remove() - remove peer from peer_id table
  687. * @soc: SoC handle
  688. * @peer_id: peer_id
  689. *
  690. * Return: None
  691. */
  692. void dp_peer_find_id_to_obj_remove(struct dp_soc *soc,
  693. uint16_t peer_id)
  694. {
  695. struct dp_peer *peer = NULL;
  696. QDF_ASSERT(peer_id <= soc->max_peer_id);
  697. qdf_spin_lock_bh(&soc->peer_map_lock);
  698. peer = soc->peer_id_to_obj_map[peer_id];
  699. peer->peer_id = HTT_INVALID_PEER;
  700. if (peer->txrx_peer)
  701. peer->txrx_peer->peer_id = HTT_INVALID_PEER;
  702. soc->peer_id_to_obj_map[peer_id] = NULL;
  703. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  704. qdf_spin_unlock_bh(&soc->peer_map_lock);
  705. }
  706. #ifdef FEATURE_MEC
  707. /**
  708. * dp_peer_mec_hash_attach() - Allocate and initialize MEC Hash Table
  709. * @soc: SoC handle
  710. *
  711. * Return: QDF_STATUS
  712. */
  713. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc)
  714. {
  715. int log2, hash_elems, i;
  716. log2 = dp_log2_ceil(DP_PEER_MAX_MEC_IDX);
  717. hash_elems = 1 << log2;
  718. soc->mec_hash.mask = hash_elems - 1;
  719. soc->mec_hash.idx_bits = log2;
  720. dp_peer_info("%pK: max mec index: %d",
  721. soc, DP_PEER_MAX_MEC_IDX);
  722. /* allocate an array of TAILQ mec object lists */
  723. soc->mec_hash.bins = qdf_mem_malloc(hash_elems *
  724. sizeof(TAILQ_HEAD(anonymous_tail_q,
  725. dp_mec_entry)));
  726. if (!soc->mec_hash.bins)
  727. return QDF_STATUS_E_NOMEM;
  728. for (i = 0; i < hash_elems; i++)
  729. TAILQ_INIT(&soc->mec_hash.bins[i]);
  730. return QDF_STATUS_SUCCESS;
  731. }
  732. /**
  733. * dp_peer_mec_hash_index() - Compute the MEC hash from MAC address
  734. * @soc: SoC handle
  735. *
  736. * Return: MEC hash
  737. */
  738. static inline uint32_t dp_peer_mec_hash_index(struct dp_soc *soc,
  739. union dp_align_mac_addr *mac_addr)
  740. {
  741. uint32_t index;
  742. index =
  743. mac_addr->align2.bytes_ab ^
  744. mac_addr->align2.bytes_cd ^
  745. mac_addr->align2.bytes_ef;
  746. index ^= index >> soc->mec_hash.idx_bits;
  747. index &= soc->mec_hash.mask;
  748. return index;
  749. }
  750. struct dp_mec_entry *dp_peer_mec_hash_find_by_pdevid(struct dp_soc *soc,
  751. uint8_t pdev_id,
  752. uint8_t *mec_mac_addr)
  753. {
  754. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  755. uint32_t index;
  756. struct dp_mec_entry *mecentry;
  757. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  758. mec_mac_addr, QDF_MAC_ADDR_SIZE);
  759. mac_addr = &local_mac_addr_aligned;
  760. index = dp_peer_mec_hash_index(soc, mac_addr);
  761. TAILQ_FOREACH(mecentry, &soc->mec_hash.bins[index], hash_list_elem) {
  762. if ((pdev_id == mecentry->pdev_id) &&
  763. !dp_peer_find_mac_addr_cmp(mac_addr, &mecentry->mac_addr))
  764. return mecentry;
  765. }
  766. return NULL;
  767. }
  768. /**
  769. * dp_peer_mec_hash_add() - Add MEC entry into hash table
  770. * @soc: SoC handle
  771. *
  772. * This function adds the MEC entry into SoC MEC hash table
  773. *
  774. * Return: None
  775. */
  776. static inline void dp_peer_mec_hash_add(struct dp_soc *soc,
  777. struct dp_mec_entry *mecentry)
  778. {
  779. uint32_t index;
  780. index = dp_peer_mec_hash_index(soc, &mecentry->mac_addr);
  781. qdf_spin_lock_bh(&soc->mec_lock);
  782. TAILQ_INSERT_TAIL(&soc->mec_hash.bins[index], mecentry, hash_list_elem);
  783. qdf_spin_unlock_bh(&soc->mec_lock);
  784. }
  785. QDF_STATUS dp_peer_mec_add_entry(struct dp_soc *soc,
  786. struct dp_vdev *vdev,
  787. uint8_t *mac_addr)
  788. {
  789. struct dp_mec_entry *mecentry = NULL;
  790. struct dp_pdev *pdev = NULL;
  791. if (!vdev) {
  792. dp_peer_err("%pK: Peers vdev is NULL", soc);
  793. return QDF_STATUS_E_INVAL;
  794. }
  795. pdev = vdev->pdev;
  796. if (qdf_unlikely(qdf_atomic_read(&soc->mec_cnt) >=
  797. DP_PEER_MAX_MEC_ENTRY)) {
  798. dp_peer_warn("%pK: max MEC entry limit reached mac_addr: "
  799. QDF_MAC_ADDR_FMT, soc, QDF_MAC_ADDR_REF(mac_addr));
  800. return QDF_STATUS_E_NOMEM;
  801. }
  802. qdf_spin_lock_bh(&soc->mec_lock);
  803. mecentry = dp_peer_mec_hash_find_by_pdevid(soc, pdev->pdev_id,
  804. mac_addr);
  805. if (qdf_likely(mecentry)) {
  806. mecentry->is_active = TRUE;
  807. qdf_spin_unlock_bh(&soc->mec_lock);
  808. return QDF_STATUS_E_ALREADY;
  809. }
  810. qdf_spin_unlock_bh(&soc->mec_lock);
  811. dp_peer_debug("%pK: pdevid: %u vdev: %u type: MEC mac_addr: "
  812. QDF_MAC_ADDR_FMT,
  813. soc, pdev->pdev_id, vdev->vdev_id,
  814. QDF_MAC_ADDR_REF(mac_addr));
  815. mecentry = (struct dp_mec_entry *)
  816. qdf_mem_malloc(sizeof(struct dp_mec_entry));
  817. if (qdf_unlikely(!mecentry)) {
  818. dp_peer_err("%pK: fail to allocate mecentry", soc);
  819. return QDF_STATUS_E_NOMEM;
  820. }
  821. qdf_copy_macaddr((struct qdf_mac_addr *)&mecentry->mac_addr.raw[0],
  822. (struct qdf_mac_addr *)mac_addr);
  823. mecentry->pdev_id = pdev->pdev_id;
  824. mecentry->vdev_id = vdev->vdev_id;
  825. mecentry->is_active = TRUE;
  826. dp_peer_mec_hash_add(soc, mecentry);
  827. qdf_atomic_inc(&soc->mec_cnt);
  828. DP_STATS_INC(soc, mec.added, 1);
  829. return QDF_STATUS_SUCCESS;
  830. }
  831. void dp_peer_mec_detach_entry(struct dp_soc *soc, struct dp_mec_entry *mecentry,
  832. void *ptr)
  833. {
  834. uint32_t index = dp_peer_mec_hash_index(soc, &mecentry->mac_addr);
  835. TAILQ_HEAD(, dp_mec_entry) * free_list = ptr;
  836. TAILQ_REMOVE(&soc->mec_hash.bins[index], mecentry,
  837. hash_list_elem);
  838. TAILQ_INSERT_TAIL(free_list, mecentry, hash_list_elem);
  839. }
  840. void dp_peer_mec_free_list(struct dp_soc *soc, void *ptr)
  841. {
  842. struct dp_mec_entry *mecentry, *mecentry_next;
  843. TAILQ_HEAD(, dp_mec_entry) * free_list = ptr;
  844. TAILQ_FOREACH_SAFE(mecentry, free_list, hash_list_elem,
  845. mecentry_next) {
  846. dp_peer_debug("%pK: MEC delete for mac_addr " QDF_MAC_ADDR_FMT,
  847. soc, QDF_MAC_ADDR_REF(&mecentry->mac_addr));
  848. qdf_mem_free(mecentry);
  849. qdf_atomic_dec(&soc->mec_cnt);
  850. DP_STATS_INC(soc, mec.deleted, 1);
  851. }
  852. }
  853. /**
  854. * dp_peer_mec_hash_detach() - Free MEC Hash table
  855. * @soc: SoC handle
  856. *
  857. * Return: None
  858. */
  859. void dp_peer_mec_hash_detach(struct dp_soc *soc)
  860. {
  861. dp_peer_mec_flush_entries(soc);
  862. qdf_mem_free(soc->mec_hash.bins);
  863. soc->mec_hash.bins = NULL;
  864. }
  865. void dp_peer_mec_spinlock_destroy(struct dp_soc *soc)
  866. {
  867. qdf_spinlock_destroy(&soc->mec_lock);
  868. }
  869. void dp_peer_mec_spinlock_create(struct dp_soc *soc)
  870. {
  871. qdf_spinlock_create(&soc->mec_lock);
  872. }
  873. #else
  874. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc)
  875. {
  876. return QDF_STATUS_SUCCESS;
  877. }
  878. void dp_peer_mec_hash_detach(struct dp_soc *soc)
  879. {
  880. }
  881. #endif
  882. #ifdef FEATURE_AST
  883. #ifdef WLAN_FEATURE_11BE_MLO
  884. /*
  885. * dp_peer_exist_on_pdev - check if peer with mac address exist on pdev
  886. *
  887. * @soc: Datapath SOC handle
  888. * @peer_mac_addr: peer mac address
  889. * @mac_addr_is_aligned: is mac address aligned
  890. * @pdev: Datapath PDEV handle
  891. *
  892. * Return: true if peer found else return false
  893. */
  894. static bool dp_peer_exist_on_pdev(struct dp_soc *soc,
  895. uint8_t *peer_mac_addr,
  896. int mac_addr_is_aligned,
  897. struct dp_pdev *pdev)
  898. {
  899. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  900. unsigned int index;
  901. struct dp_peer *peer;
  902. bool found = false;
  903. if (mac_addr_is_aligned) {
  904. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  905. } else {
  906. qdf_mem_copy(
  907. &local_mac_addr_aligned.raw[0],
  908. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  909. mac_addr = &local_mac_addr_aligned;
  910. }
  911. index = dp_peer_find_hash_index(soc, mac_addr);
  912. qdf_spin_lock_bh(&soc->peer_hash_lock);
  913. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  914. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  915. (peer->vdev->pdev == pdev)) {
  916. found = true;
  917. break;
  918. }
  919. }
  920. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  921. if (found)
  922. return found;
  923. peer = dp_mld_peer_find_hash_find(soc, peer_mac_addr,
  924. mac_addr_is_aligned, DP_VDEV_ALL,
  925. DP_MOD_ID_CDP);
  926. if (peer) {
  927. if (peer->vdev->pdev == pdev)
  928. found = true;
  929. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  930. }
  931. return found;
  932. }
  933. #else
  934. static bool dp_peer_exist_on_pdev(struct dp_soc *soc,
  935. uint8_t *peer_mac_addr,
  936. int mac_addr_is_aligned,
  937. struct dp_pdev *pdev)
  938. {
  939. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  940. unsigned int index;
  941. struct dp_peer *peer;
  942. bool found = false;
  943. if (mac_addr_is_aligned) {
  944. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  945. } else {
  946. qdf_mem_copy(
  947. &local_mac_addr_aligned.raw[0],
  948. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  949. mac_addr = &local_mac_addr_aligned;
  950. }
  951. index = dp_peer_find_hash_index(soc, mac_addr);
  952. qdf_spin_lock_bh(&soc->peer_hash_lock);
  953. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  954. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  955. (peer->vdev->pdev == pdev)) {
  956. found = true;
  957. break;
  958. }
  959. }
  960. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  961. return found;
  962. }
  963. #endif /* WLAN_FEATURE_11BE_MLO */
  964. /*
  965. * dp_peer_ast_hash_attach() - Allocate and initialize AST Hash Table
  966. * @soc: SoC handle
  967. *
  968. * Return: QDF_STATUS
  969. */
  970. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  971. {
  972. int i, hash_elems, log2;
  973. unsigned int max_ast_idx = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  974. hash_elems = ((max_ast_idx * DP_AST_HASH_LOAD_MULT) >>
  975. DP_AST_HASH_LOAD_SHIFT);
  976. log2 = dp_log2_ceil(hash_elems);
  977. hash_elems = 1 << log2;
  978. soc->ast_hash.mask = hash_elems - 1;
  979. soc->ast_hash.idx_bits = log2;
  980. dp_peer_info("%pK: ast hash_elems: %d, max_ast_idx: %d",
  981. soc, hash_elems, max_ast_idx);
  982. /* allocate an array of TAILQ peer object lists */
  983. soc->ast_hash.bins = qdf_mem_malloc(
  984. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q,
  985. dp_ast_entry)));
  986. if (!soc->ast_hash.bins)
  987. return QDF_STATUS_E_NOMEM;
  988. for (i = 0; i < hash_elems; i++)
  989. TAILQ_INIT(&soc->ast_hash.bins[i]);
  990. return QDF_STATUS_SUCCESS;
  991. }
  992. /*
  993. * dp_peer_ast_cleanup() - cleanup the references
  994. * @soc: SoC handle
  995. * @ast: ast entry
  996. *
  997. * Return: None
  998. */
  999. static inline void dp_peer_ast_cleanup(struct dp_soc *soc,
  1000. struct dp_ast_entry *ast)
  1001. {
  1002. txrx_ast_free_cb cb = ast->callback;
  1003. void *cookie = ast->cookie;
  1004. dp_peer_debug("mac_addr: " QDF_MAC_ADDR_FMT ", cb: %pK, cookie: %pK",
  1005. QDF_MAC_ADDR_REF(ast->mac_addr.raw), cb, cookie);
  1006. /* Call the callbacks to free up the cookie */
  1007. if (cb) {
  1008. ast->callback = NULL;
  1009. ast->cookie = NULL;
  1010. cb(soc->ctrl_psoc,
  1011. dp_soc_to_cdp_soc(soc),
  1012. cookie,
  1013. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  1014. }
  1015. }
  1016. /*
  1017. * dp_peer_ast_hash_detach() - Free AST Hash table
  1018. * @soc: SoC handle
  1019. *
  1020. * Return: None
  1021. */
  1022. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  1023. {
  1024. unsigned int index;
  1025. struct dp_ast_entry *ast, *ast_next;
  1026. if (!soc->ast_hash.mask)
  1027. return;
  1028. if (!soc->ast_hash.bins)
  1029. return;
  1030. dp_peer_debug("%pK: num_ast_entries: %u", soc, soc->num_ast_entries);
  1031. qdf_spin_lock_bh(&soc->ast_lock);
  1032. for (index = 0; index <= soc->ast_hash.mask; index++) {
  1033. if (!TAILQ_EMPTY(&soc->ast_hash.bins[index])) {
  1034. TAILQ_FOREACH_SAFE(ast, &soc->ast_hash.bins[index],
  1035. hash_list_elem, ast_next) {
  1036. TAILQ_REMOVE(&soc->ast_hash.bins[index], ast,
  1037. hash_list_elem);
  1038. dp_peer_ast_cleanup(soc, ast);
  1039. soc->num_ast_entries--;
  1040. qdf_mem_free(ast);
  1041. }
  1042. }
  1043. }
  1044. qdf_spin_unlock_bh(&soc->ast_lock);
  1045. qdf_mem_free(soc->ast_hash.bins);
  1046. soc->ast_hash.bins = NULL;
  1047. }
  1048. /*
  1049. * dp_peer_ast_hash_index() - Compute the AST hash from MAC address
  1050. * @soc: SoC handle
  1051. *
  1052. * Return: AST hash
  1053. */
  1054. static inline uint32_t dp_peer_ast_hash_index(struct dp_soc *soc,
  1055. union dp_align_mac_addr *mac_addr)
  1056. {
  1057. uint32_t index;
  1058. index =
  1059. mac_addr->align2.bytes_ab ^
  1060. mac_addr->align2.bytes_cd ^
  1061. mac_addr->align2.bytes_ef;
  1062. index ^= index >> soc->ast_hash.idx_bits;
  1063. index &= soc->ast_hash.mask;
  1064. return index;
  1065. }
  1066. /*
  1067. * dp_peer_ast_hash_add() - Add AST entry into hash table
  1068. * @soc: SoC handle
  1069. *
  1070. * This function adds the AST entry into SoC AST hash table
  1071. * It assumes caller has taken the ast lock to protect the access to this table
  1072. *
  1073. * Return: None
  1074. */
  1075. static inline void dp_peer_ast_hash_add(struct dp_soc *soc,
  1076. struct dp_ast_entry *ase)
  1077. {
  1078. uint32_t index;
  1079. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  1080. TAILQ_INSERT_TAIL(&soc->ast_hash.bins[index], ase, hash_list_elem);
  1081. }
  1082. /*
  1083. * dp_peer_ast_hash_remove() - Look up and remove AST entry from hash table
  1084. * @soc: SoC handle
  1085. *
  1086. * This function removes the AST entry from soc AST hash table
  1087. * It assumes caller has taken the ast lock to protect the access to this table
  1088. *
  1089. * Return: None
  1090. */
  1091. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  1092. struct dp_ast_entry *ase)
  1093. {
  1094. unsigned index;
  1095. struct dp_ast_entry *tmpase;
  1096. int found = 0;
  1097. if (soc->ast_offload_support && !soc->host_ast_db_enable)
  1098. return;
  1099. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  1100. /* Check if tail is not empty before delete*/
  1101. QDF_ASSERT(!TAILQ_EMPTY(&soc->ast_hash.bins[index]));
  1102. dp_peer_debug("ID: %u idx: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1103. ase->peer_id, index, QDF_MAC_ADDR_REF(ase->mac_addr.raw));
  1104. TAILQ_FOREACH(tmpase, &soc->ast_hash.bins[index], hash_list_elem) {
  1105. if (tmpase == ase) {
  1106. found = 1;
  1107. break;
  1108. }
  1109. }
  1110. QDF_ASSERT(found);
  1111. if (found)
  1112. TAILQ_REMOVE(&soc->ast_hash.bins[index], ase, hash_list_elem);
  1113. }
  1114. /*
  1115. * dp_peer_ast_hash_find_by_vdevid() - Find AST entry by MAC address
  1116. * @soc: SoC handle
  1117. *
  1118. * It assumes caller has taken the ast lock to protect the access to
  1119. * AST hash table
  1120. *
  1121. * Return: AST entry
  1122. */
  1123. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  1124. uint8_t *ast_mac_addr,
  1125. uint8_t vdev_id)
  1126. {
  1127. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1128. uint32_t index;
  1129. struct dp_ast_entry *ase;
  1130. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1131. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1132. mac_addr = &local_mac_addr_aligned;
  1133. index = dp_peer_ast_hash_index(soc, mac_addr);
  1134. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1135. if ((vdev_id == ase->vdev_id) &&
  1136. !dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr)) {
  1137. return ase;
  1138. }
  1139. }
  1140. return NULL;
  1141. }
  1142. /*
  1143. * dp_peer_ast_hash_find_by_pdevid() - Find AST entry by MAC address
  1144. * @soc: SoC handle
  1145. *
  1146. * It assumes caller has taken the ast lock to protect the access to
  1147. * AST hash table
  1148. *
  1149. * Return: AST entry
  1150. */
  1151. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1152. uint8_t *ast_mac_addr,
  1153. uint8_t pdev_id)
  1154. {
  1155. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1156. uint32_t index;
  1157. struct dp_ast_entry *ase;
  1158. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1159. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1160. mac_addr = &local_mac_addr_aligned;
  1161. index = dp_peer_ast_hash_index(soc, mac_addr);
  1162. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1163. if ((pdev_id == ase->pdev_id) &&
  1164. !dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr)) {
  1165. return ase;
  1166. }
  1167. }
  1168. return NULL;
  1169. }
  1170. /*
  1171. * dp_peer_ast_hash_find_soc() - Find AST entry by MAC address
  1172. * @soc: SoC handle
  1173. *
  1174. * It assumes caller has taken the ast lock to protect the access to
  1175. * AST hash table
  1176. *
  1177. * Return: AST entry
  1178. */
  1179. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1180. uint8_t *ast_mac_addr)
  1181. {
  1182. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1183. unsigned index;
  1184. struct dp_ast_entry *ase;
  1185. if (!soc->ast_hash.bins)
  1186. return NULL;
  1187. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1188. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1189. mac_addr = &local_mac_addr_aligned;
  1190. index = dp_peer_ast_hash_index(soc, mac_addr);
  1191. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1192. if (dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr) == 0) {
  1193. return ase;
  1194. }
  1195. }
  1196. return NULL;
  1197. }
  1198. /*
  1199. * dp_peer_host_add_map_ast() - Add ast entry with HW AST Index
  1200. * @soc: SoC handle
  1201. * @peer_id: peer id from firmware
  1202. * @mac_addr: MAC address of ast node
  1203. * @hw_peer_id: HW AST Index returned by target in peer map event
  1204. * @vdev_id: vdev id for VAP to which the peer belongs to
  1205. * @ast_hash: ast hash value in HW
  1206. * @is_wds: flag to indicate peer map event for WDS ast entry
  1207. *
  1208. * Return: QDF_STATUS code
  1209. */
  1210. static inline
  1211. QDF_STATUS dp_peer_host_add_map_ast(struct dp_soc *soc, uint16_t peer_id,
  1212. uint8_t *mac_addr, uint16_t hw_peer_id,
  1213. uint8_t vdev_id, uint16_t ast_hash,
  1214. uint8_t is_wds)
  1215. {
  1216. struct dp_vdev *vdev;
  1217. struct dp_ast_entry *ast_entry;
  1218. enum cdp_txrx_ast_entry_type type;
  1219. struct dp_peer *peer;
  1220. struct dp_peer *old_peer;
  1221. QDF_STATUS status = QDF_STATUS_SUCCESS;
  1222. if (is_wds)
  1223. type = CDP_TXRX_AST_TYPE_WDS;
  1224. else
  1225. type = CDP_TXRX_AST_TYPE_STATIC;
  1226. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  1227. if (!peer) {
  1228. dp_peer_info("Peer not found soc:%pK: peer_id %d, peer_mac " QDF_MAC_ADDR_FMT ", vdev_id %d",
  1229. soc, peer_id,
  1230. QDF_MAC_ADDR_REF(mac_addr), vdev_id);
  1231. return QDF_STATUS_E_INVAL;
  1232. }
  1233. if (!is_wds && IS_MLO_DP_MLD_PEER(peer))
  1234. type = CDP_TXRX_AST_TYPE_MLD;
  1235. vdev = peer->vdev;
  1236. if (!vdev) {
  1237. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1238. status = QDF_STATUS_E_INVAL;
  1239. goto fail;
  1240. }
  1241. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1242. if (type != CDP_TXRX_AST_TYPE_STATIC &&
  1243. type != CDP_TXRX_AST_TYPE_MLD &&
  1244. type != CDP_TXRX_AST_TYPE_SELF) {
  1245. status = QDF_STATUS_E_BUSY;
  1246. goto fail;
  1247. }
  1248. }
  1249. dp_peer_debug("%pK: vdev: %u ast_entry->type: %d peer_mac: " QDF_MAC_ADDR_FMT " peer: %pK mac " QDF_MAC_ADDR_FMT,
  1250. soc, vdev->vdev_id, type,
  1251. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1252. QDF_MAC_ADDR_REF(mac_addr));
  1253. /*
  1254. * In MLO scenario, there is possibility for same mac address
  1255. * on both link mac address and MLD mac address.
  1256. * Duplicate AST map needs to be handled for non-mld type.
  1257. */
  1258. qdf_spin_lock_bh(&soc->ast_lock);
  1259. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1260. if (ast_entry && type != CDP_TXRX_AST_TYPE_MLD) {
  1261. dp_peer_debug("AST present ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1262. hw_peer_id, vdev_id,
  1263. QDF_MAC_ADDR_REF(mac_addr));
  1264. old_peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1265. DP_MOD_ID_AST);
  1266. if (!old_peer) {
  1267. dp_peer_info("Peer not found soc:%pK: peer_id %d, peer_mac " QDF_MAC_ADDR_FMT ", vdev_id %d",
  1268. soc, ast_entry->peer_id,
  1269. QDF_MAC_ADDR_REF(mac_addr), vdev_id);
  1270. qdf_spin_unlock_bh(&soc->ast_lock);
  1271. status = QDF_STATUS_E_INVAL;
  1272. goto fail;
  1273. }
  1274. dp_peer_unlink_ast_entry(soc, ast_entry, old_peer);
  1275. dp_peer_free_ast_entry(soc, ast_entry);
  1276. if (old_peer)
  1277. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1278. }
  1279. ast_entry = (struct dp_ast_entry *)
  1280. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1281. if (!ast_entry) {
  1282. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1283. qdf_spin_unlock_bh(&soc->ast_lock);
  1284. QDF_ASSERT(0);
  1285. status = QDF_STATUS_E_NOMEM;
  1286. goto fail;
  1287. }
  1288. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1289. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1290. ast_entry->is_mapped = false;
  1291. ast_entry->delete_in_progress = false;
  1292. ast_entry->next_hop = 0;
  1293. ast_entry->vdev_id = vdev->vdev_id;
  1294. ast_entry->type = type;
  1295. switch (type) {
  1296. case CDP_TXRX_AST_TYPE_STATIC:
  1297. if (peer->vdev->opmode == wlan_op_mode_sta)
  1298. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1299. break;
  1300. case CDP_TXRX_AST_TYPE_WDS:
  1301. ast_entry->next_hop = 1;
  1302. break;
  1303. case CDP_TXRX_AST_TYPE_MLD:
  1304. break;
  1305. default:
  1306. dp_peer_alert("%pK: Incorrect AST entry type", soc);
  1307. }
  1308. ast_entry->is_active = TRUE;
  1309. DP_STATS_INC(soc, ast.added, 1);
  1310. soc->num_ast_entries++;
  1311. dp_peer_ast_hash_add(soc, ast_entry);
  1312. ast_entry->ast_idx = hw_peer_id;
  1313. ast_entry->ast_hash_value = ast_hash;
  1314. ast_entry->peer_id = peer_id;
  1315. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1316. ase_list_elem);
  1317. qdf_spin_unlock_bh(&soc->ast_lock);
  1318. fail:
  1319. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  1320. return status;
  1321. }
  1322. /*
  1323. * dp_peer_map_ast() - Map the ast entry with HW AST Index
  1324. * @soc: SoC handle
  1325. * @peer: peer to which ast node belongs
  1326. * @mac_addr: MAC address of ast node
  1327. * @hw_peer_id: HW AST Index returned by target in peer map event
  1328. * @vdev_id: vdev id for VAP to which the peer belongs to
  1329. * @ast_hash: ast hash value in HW
  1330. * @is_wds: flag to indicate peer map event for WDS ast entry
  1331. *
  1332. * Return: QDF_STATUS code
  1333. */
  1334. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1335. struct dp_peer *peer,
  1336. uint8_t *mac_addr,
  1337. uint16_t hw_peer_id,
  1338. uint8_t vdev_id,
  1339. uint16_t ast_hash,
  1340. uint8_t is_wds)
  1341. {
  1342. struct dp_ast_entry *ast_entry = NULL;
  1343. enum cdp_txrx_ast_entry_type peer_type = CDP_TXRX_AST_TYPE_STATIC;
  1344. void *cookie = NULL;
  1345. txrx_ast_free_cb cb = NULL;
  1346. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1347. if (soc->ast_offload_support)
  1348. return QDF_STATUS_SUCCESS;
  1349. if (!peer) {
  1350. return QDF_STATUS_E_INVAL;
  1351. }
  1352. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1353. soc, peer, hw_peer_id, vdev_id,
  1354. QDF_MAC_ADDR_REF(mac_addr));
  1355. qdf_spin_lock_bh(&soc->ast_lock);
  1356. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  1357. if (is_wds) {
  1358. /*
  1359. * In certain cases like Auth attack on a repeater
  1360. * can result in the number of ast_entries falling
  1361. * in the same hash bucket to exceed the max_skid
  1362. * length supported by HW in root AP. In these cases
  1363. * the FW will return the hw_peer_id (ast_index) as
  1364. * 0xffff indicating HW could not add the entry in
  1365. * its table. Host has to delete the entry from its
  1366. * table in these cases.
  1367. */
  1368. if (hw_peer_id == HTT_INVALID_PEER) {
  1369. DP_STATS_INC(soc, ast.map_err, 1);
  1370. if (ast_entry) {
  1371. if (ast_entry->is_mapped) {
  1372. soc->ast_table[ast_entry->ast_idx] =
  1373. NULL;
  1374. }
  1375. cb = ast_entry->callback;
  1376. cookie = ast_entry->cookie;
  1377. peer_type = ast_entry->type;
  1378. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1379. dp_peer_free_ast_entry(soc, ast_entry);
  1380. qdf_spin_unlock_bh(&soc->ast_lock);
  1381. if (cb) {
  1382. cb(soc->ctrl_psoc,
  1383. dp_soc_to_cdp_soc(soc),
  1384. cookie,
  1385. CDP_TXRX_AST_DELETED);
  1386. }
  1387. } else {
  1388. qdf_spin_unlock_bh(&soc->ast_lock);
  1389. dp_peer_alert("AST entry not found with peer %pK peer_id %u peer_mac " QDF_MAC_ADDR_FMT " mac_addr " QDF_MAC_ADDR_FMT " vdev_id %u next_hop %u",
  1390. peer, peer->peer_id,
  1391. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  1392. QDF_MAC_ADDR_REF(mac_addr),
  1393. vdev_id, is_wds);
  1394. }
  1395. err = QDF_STATUS_E_INVAL;
  1396. dp_hmwds_ast_add_notify(peer, mac_addr,
  1397. peer_type, err, true);
  1398. return err;
  1399. }
  1400. }
  1401. if (ast_entry) {
  1402. ast_entry->ast_idx = hw_peer_id;
  1403. soc->ast_table[hw_peer_id] = ast_entry;
  1404. ast_entry->is_active = TRUE;
  1405. peer_type = ast_entry->type;
  1406. ast_entry->ast_hash_value = ast_hash;
  1407. ast_entry->is_mapped = TRUE;
  1408. qdf_assert_always(ast_entry->peer_id == HTT_INVALID_PEER);
  1409. ast_entry->peer_id = peer->peer_id;
  1410. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1411. ase_list_elem);
  1412. }
  1413. if (ast_entry || (peer->vdev && peer->vdev->proxysta_vdev)) {
  1414. if (soc->cdp_soc.ol_ops->peer_map_event) {
  1415. soc->cdp_soc.ol_ops->peer_map_event(
  1416. soc->ctrl_psoc, peer->peer_id,
  1417. hw_peer_id, vdev_id,
  1418. mac_addr, peer_type, ast_hash);
  1419. }
  1420. } else {
  1421. dp_peer_err("%pK: AST entry not found", soc);
  1422. err = QDF_STATUS_E_NOENT;
  1423. }
  1424. qdf_spin_unlock_bh(&soc->ast_lock);
  1425. dp_hmwds_ast_add_notify(peer, mac_addr,
  1426. peer_type, err, true);
  1427. return err;
  1428. }
  1429. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  1430. struct cdp_soc *dp_soc,
  1431. void *cookie,
  1432. enum cdp_ast_free_status status)
  1433. {
  1434. struct dp_ast_free_cb_params *param =
  1435. (struct dp_ast_free_cb_params *)cookie;
  1436. struct dp_soc *soc = (struct dp_soc *)dp_soc;
  1437. struct dp_peer *peer = NULL;
  1438. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1439. if (status != CDP_TXRX_AST_DELETED) {
  1440. qdf_mem_free(cookie);
  1441. return;
  1442. }
  1443. peer = dp_peer_find_hash_find(soc, &param->peer_mac_addr.raw[0],
  1444. 0, param->vdev_id, DP_MOD_ID_AST);
  1445. if (peer) {
  1446. err = dp_peer_add_ast(soc, peer,
  1447. &param->mac_addr.raw[0],
  1448. param->type,
  1449. param->flags);
  1450. dp_hmwds_ast_add_notify(peer, &param->mac_addr.raw[0],
  1451. param->type, err, false);
  1452. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1453. }
  1454. qdf_mem_free(cookie);
  1455. }
  1456. /*
  1457. * dp_peer_add_ast() - Allocate and add AST entry into peer list
  1458. * @soc: SoC handle
  1459. * @peer: peer to which ast node belongs
  1460. * @mac_addr: MAC address of ast node
  1461. * @is_self: Is this base AST entry with peer mac address
  1462. *
  1463. * This API is used by WDS source port learning function to
  1464. * add a new AST entry into peer AST list
  1465. *
  1466. * Return: QDF_STATUS code
  1467. */
  1468. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1469. struct dp_peer *peer,
  1470. uint8_t *mac_addr,
  1471. enum cdp_txrx_ast_entry_type type,
  1472. uint32_t flags)
  1473. {
  1474. struct dp_ast_entry *ast_entry = NULL;
  1475. struct dp_vdev *vdev = NULL;
  1476. struct dp_pdev *pdev = NULL;
  1477. txrx_ast_free_cb cb = NULL;
  1478. void *cookie = NULL;
  1479. struct dp_peer *vap_bss_peer = NULL;
  1480. bool is_peer_found = false;
  1481. int status = 0;
  1482. if (soc->ast_offload_support)
  1483. return QDF_STATUS_E_INVAL;
  1484. vdev = peer->vdev;
  1485. if (!vdev) {
  1486. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1487. QDF_ASSERT(0);
  1488. return QDF_STATUS_E_INVAL;
  1489. }
  1490. pdev = vdev->pdev;
  1491. is_peer_found = dp_peer_exist_on_pdev(soc, mac_addr, 0, pdev);
  1492. qdf_spin_lock_bh(&soc->ast_lock);
  1493. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1494. if ((type != CDP_TXRX_AST_TYPE_STATIC) &&
  1495. (type != CDP_TXRX_AST_TYPE_SELF)) {
  1496. qdf_spin_unlock_bh(&soc->ast_lock);
  1497. return QDF_STATUS_E_BUSY;
  1498. }
  1499. }
  1500. dp_peer_debug("%pK: pdevid: %u vdev: %u ast_entry->type: %d flags: 0x%x peer_mac: " QDF_MAC_ADDR_FMT " peer: %pK mac " QDF_MAC_ADDR_FMT,
  1501. soc, pdev->pdev_id, vdev->vdev_id, type, flags,
  1502. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1503. QDF_MAC_ADDR_REF(mac_addr));
  1504. /* fw supports only 2 times the max_peers ast entries */
  1505. if (soc->num_ast_entries >=
  1506. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  1507. qdf_spin_unlock_bh(&soc->ast_lock);
  1508. dp_peer_err("%pK: Max ast entries reached", soc);
  1509. return QDF_STATUS_E_RESOURCES;
  1510. }
  1511. /* If AST entry already exists , just return from here
  1512. * ast entry with same mac address can exist on different radios
  1513. * if ast_override support is enabled use search by pdev in this
  1514. * case
  1515. */
  1516. if (soc->ast_override_support) {
  1517. ast_entry = dp_peer_ast_hash_find_by_pdevid(soc, mac_addr,
  1518. pdev->pdev_id);
  1519. if (ast_entry) {
  1520. qdf_spin_unlock_bh(&soc->ast_lock);
  1521. return QDF_STATUS_E_ALREADY;
  1522. }
  1523. if (is_peer_found) {
  1524. /* During WDS to static roaming, peer is added
  1525. * to the list before static AST entry create.
  1526. * So, allow AST entry for STATIC type
  1527. * even if peer is present
  1528. */
  1529. if (type != CDP_TXRX_AST_TYPE_STATIC) {
  1530. qdf_spin_unlock_bh(&soc->ast_lock);
  1531. return QDF_STATUS_E_ALREADY;
  1532. }
  1533. }
  1534. } else {
  1535. /* For HWMWDS_SEC entries can be added for same mac address
  1536. * do not check for existing entry
  1537. */
  1538. if (type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1539. goto add_ast_entry;
  1540. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1541. if (ast_entry) {
  1542. if ((ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM) &&
  1543. !ast_entry->delete_in_progress) {
  1544. qdf_spin_unlock_bh(&soc->ast_lock);
  1545. return QDF_STATUS_E_ALREADY;
  1546. }
  1547. /* Add for HMWDS entry we cannot be ignored if there
  1548. * is AST entry with same mac address
  1549. *
  1550. * if ast entry exists with the requested mac address
  1551. * send a delete command and register callback which
  1552. * can take care of adding HMWDS ast entry on delete
  1553. * confirmation from target
  1554. */
  1555. if (type == CDP_TXRX_AST_TYPE_WDS_HM) {
  1556. struct dp_ast_free_cb_params *param = NULL;
  1557. if (ast_entry->type ==
  1558. CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1559. goto add_ast_entry;
  1560. /* save existing callback */
  1561. if (ast_entry->callback) {
  1562. cb = ast_entry->callback;
  1563. cookie = ast_entry->cookie;
  1564. }
  1565. param = qdf_mem_malloc(sizeof(*param));
  1566. if (!param) {
  1567. QDF_TRACE(QDF_MODULE_ID_TXRX,
  1568. QDF_TRACE_LEVEL_ERROR,
  1569. "Allocation failed");
  1570. qdf_spin_unlock_bh(&soc->ast_lock);
  1571. return QDF_STATUS_E_NOMEM;
  1572. }
  1573. qdf_mem_copy(&param->mac_addr.raw[0], mac_addr,
  1574. QDF_MAC_ADDR_SIZE);
  1575. qdf_mem_copy(&param->peer_mac_addr.raw[0],
  1576. &peer->mac_addr.raw[0],
  1577. QDF_MAC_ADDR_SIZE);
  1578. param->type = type;
  1579. param->flags = flags;
  1580. param->vdev_id = vdev->vdev_id;
  1581. ast_entry->callback = dp_peer_free_hmwds_cb;
  1582. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1583. ast_entry->type = type;
  1584. ast_entry->cookie = (void *)param;
  1585. if (!ast_entry->delete_in_progress)
  1586. dp_peer_del_ast(soc, ast_entry);
  1587. qdf_spin_unlock_bh(&soc->ast_lock);
  1588. /* Call the saved callback*/
  1589. if (cb) {
  1590. cb(soc->ctrl_psoc,
  1591. dp_soc_to_cdp_soc(soc),
  1592. cookie,
  1593. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  1594. }
  1595. return QDF_STATUS_E_AGAIN;
  1596. }
  1597. qdf_spin_unlock_bh(&soc->ast_lock);
  1598. return QDF_STATUS_E_ALREADY;
  1599. }
  1600. }
  1601. add_ast_entry:
  1602. ast_entry = (struct dp_ast_entry *)
  1603. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1604. if (!ast_entry) {
  1605. qdf_spin_unlock_bh(&soc->ast_lock);
  1606. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1607. QDF_ASSERT(0);
  1608. return QDF_STATUS_E_NOMEM;
  1609. }
  1610. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1611. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1612. ast_entry->is_mapped = false;
  1613. ast_entry->delete_in_progress = false;
  1614. ast_entry->peer_id = HTT_INVALID_PEER;
  1615. ast_entry->next_hop = 0;
  1616. ast_entry->vdev_id = vdev->vdev_id;
  1617. switch (type) {
  1618. case CDP_TXRX_AST_TYPE_STATIC:
  1619. peer->self_ast_entry = ast_entry;
  1620. ast_entry->type = CDP_TXRX_AST_TYPE_STATIC;
  1621. if (peer->vdev->opmode == wlan_op_mode_sta)
  1622. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1623. break;
  1624. case CDP_TXRX_AST_TYPE_SELF:
  1625. peer->self_ast_entry = ast_entry;
  1626. ast_entry->type = CDP_TXRX_AST_TYPE_SELF;
  1627. break;
  1628. case CDP_TXRX_AST_TYPE_WDS:
  1629. ast_entry->next_hop = 1;
  1630. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1631. break;
  1632. case CDP_TXRX_AST_TYPE_WDS_HM:
  1633. ast_entry->next_hop = 1;
  1634. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM;
  1635. break;
  1636. case CDP_TXRX_AST_TYPE_WDS_HM_SEC:
  1637. ast_entry->next_hop = 1;
  1638. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM_SEC;
  1639. ast_entry->peer_id = peer->peer_id;
  1640. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1641. ase_list_elem);
  1642. break;
  1643. case CDP_TXRX_AST_TYPE_DA:
  1644. vap_bss_peer = dp_vdev_bss_peer_ref_n_get(soc, vdev,
  1645. DP_MOD_ID_AST);
  1646. if (!vap_bss_peer) {
  1647. qdf_spin_unlock_bh(&soc->ast_lock);
  1648. qdf_mem_free(ast_entry);
  1649. return QDF_STATUS_E_FAILURE;
  1650. }
  1651. peer = vap_bss_peer;
  1652. ast_entry->next_hop = 1;
  1653. ast_entry->type = CDP_TXRX_AST_TYPE_DA;
  1654. break;
  1655. default:
  1656. dp_peer_err("%pK: Incorrect AST entry type", soc);
  1657. }
  1658. ast_entry->is_active = TRUE;
  1659. DP_STATS_INC(soc, ast.added, 1);
  1660. soc->num_ast_entries++;
  1661. dp_peer_ast_hash_add(soc, ast_entry);
  1662. if ((ast_entry->type != CDP_TXRX_AST_TYPE_STATIC) &&
  1663. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF) &&
  1664. (ast_entry->type != CDP_TXRX_AST_TYPE_STA_BSS) &&
  1665. (ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1666. status = dp_add_wds_entry_wrapper(soc,
  1667. peer,
  1668. mac_addr,
  1669. flags,
  1670. ast_entry->type);
  1671. if (vap_bss_peer)
  1672. dp_peer_unref_delete(vap_bss_peer, DP_MOD_ID_AST);
  1673. qdf_spin_unlock_bh(&soc->ast_lock);
  1674. return qdf_status_from_os_return(status);
  1675. }
  1676. qdf_export_symbol(dp_peer_add_ast);
  1677. /*
  1678. * dp_peer_free_ast_entry() - Free up the ast entry memory
  1679. * @soc: SoC handle
  1680. * @ast_entry: Address search entry
  1681. *
  1682. * This API is used to free up the memory associated with
  1683. * AST entry.
  1684. *
  1685. * Return: None
  1686. */
  1687. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1688. struct dp_ast_entry *ast_entry)
  1689. {
  1690. /*
  1691. * NOTE: Ensure that call to this API is done
  1692. * after soc->ast_lock is taken
  1693. */
  1694. dp_peer_debug("type: %d ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1695. ast_entry->type, ast_entry->peer_id, ast_entry->vdev_id,
  1696. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1697. ast_entry->callback = NULL;
  1698. ast_entry->cookie = NULL;
  1699. DP_STATS_INC(soc, ast.deleted, 1);
  1700. dp_peer_ast_hash_remove(soc, ast_entry);
  1701. dp_peer_ast_cleanup(soc, ast_entry);
  1702. qdf_mem_free(ast_entry);
  1703. soc->num_ast_entries--;
  1704. }
  1705. /*
  1706. * dp_peer_unlink_ast_entry() - Free up the ast entry memory
  1707. * @soc: SoC handle
  1708. * @ast_entry: Address search entry
  1709. * @peer: peer
  1710. *
  1711. * This API is used to remove/unlink AST entry from the peer list
  1712. * and hash list.
  1713. *
  1714. * Return: None
  1715. */
  1716. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1717. struct dp_ast_entry *ast_entry,
  1718. struct dp_peer *peer)
  1719. {
  1720. if (!peer) {
  1721. dp_info_rl("NULL peer");
  1722. return;
  1723. }
  1724. if (ast_entry->peer_id == HTT_INVALID_PEER) {
  1725. dp_info_rl("Invalid peer id in AST entry mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1726. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1727. ast_entry->type);
  1728. return;
  1729. }
  1730. /*
  1731. * NOTE: Ensure that call to this API is done
  1732. * after soc->ast_lock is taken
  1733. */
  1734. qdf_assert_always(ast_entry->peer_id == peer->peer_id);
  1735. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1736. if (ast_entry == peer->self_ast_entry)
  1737. peer->self_ast_entry = NULL;
  1738. /*
  1739. * release the reference only if it is mapped
  1740. * to ast_table
  1741. */
  1742. if (ast_entry->is_mapped)
  1743. soc->ast_table[ast_entry->ast_idx] = NULL;
  1744. ast_entry->peer_id = HTT_INVALID_PEER;
  1745. }
  1746. /*
  1747. * dp_peer_del_ast() - Delete and free AST entry
  1748. * @soc: SoC handle
  1749. * @ast_entry: AST entry of the node
  1750. *
  1751. * This function removes the AST entry from peer and soc tables
  1752. * It assumes caller has taken the ast lock to protect the access to these
  1753. * tables
  1754. *
  1755. * Return: None
  1756. */
  1757. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1758. {
  1759. struct dp_peer *peer = NULL;
  1760. if (soc->ast_offload_support)
  1761. return;
  1762. if (!ast_entry) {
  1763. dp_info_rl("NULL AST entry");
  1764. return;
  1765. }
  1766. if (ast_entry->delete_in_progress) {
  1767. dp_info_rl("AST entry deletion in progress mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1768. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1769. ast_entry->type);
  1770. return;
  1771. }
  1772. dp_peer_debug("call by %ps: ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1773. (void *)_RET_IP_, ast_entry->peer_id, ast_entry->vdev_id,
  1774. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1775. ast_entry->delete_in_progress = true;
  1776. /* In teardown del ast is called after setting logical delete state
  1777. * use __dp_peer_get_ref_by_id to get the reference irrespective of
  1778. * state
  1779. */
  1780. peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1781. DP_MOD_ID_AST);
  1782. dp_peer_ast_send_wds_del(soc, ast_entry, peer);
  1783. /* Remove SELF and STATIC entries in teardown itself */
  1784. if (!ast_entry->next_hop)
  1785. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1786. if (ast_entry->is_mapped)
  1787. soc->ast_table[ast_entry->ast_idx] = NULL;
  1788. /* if peer map v2 is enabled we are not freeing ast entry
  1789. * here and it is supposed to be freed in unmap event (after
  1790. * we receive delete confirmation from target)
  1791. *
  1792. * if peer_id is invalid we did not get the peer map event
  1793. * for the peer free ast entry from here only in this case
  1794. */
  1795. if (dp_peer_ast_free_in_unmap_supported(soc, ast_entry))
  1796. goto end;
  1797. /* for WDS secondary entry ast_entry->next_hop would be set so
  1798. * unlinking has to be done explicitly here.
  1799. * As this entry is not a mapped entry unmap notification from
  1800. * FW will not come. Hence unlinkling is done right here.
  1801. */
  1802. if (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1803. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1804. dp_peer_free_ast_entry(soc, ast_entry);
  1805. end:
  1806. if (peer)
  1807. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1808. }
  1809. /*
  1810. * dp_peer_update_ast() - Delete and free AST entry
  1811. * @soc: SoC handle
  1812. * @peer: peer to which ast node belongs
  1813. * @ast_entry: AST entry of the node
  1814. * @flags: wds or hmwds
  1815. *
  1816. * This function update the AST entry to the roamed peer and soc tables
  1817. * It assumes caller has taken the ast lock to protect the access to these
  1818. * tables
  1819. *
  1820. * Return: 0 if ast entry is updated successfully
  1821. * -1 failure
  1822. */
  1823. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1824. struct dp_ast_entry *ast_entry, uint32_t flags)
  1825. {
  1826. int ret = -1;
  1827. struct dp_peer *old_peer;
  1828. if (soc->ast_offload_support)
  1829. return QDF_STATUS_E_INVAL;
  1830. dp_peer_debug("%pK: ast_entry->type: %d pdevid: %u vdevid: %u flags: 0x%x mac_addr: " QDF_MAC_ADDR_FMT " peer_mac: " QDF_MAC_ADDR_FMT "\n",
  1831. soc, ast_entry->type, peer->vdev->pdev->pdev_id,
  1832. peer->vdev->vdev_id, flags,
  1833. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1834. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  1835. /* Do not send AST update in below cases
  1836. * 1) Ast entry delete has already triggered
  1837. * 2) Peer delete is already triggered
  1838. * 3) We did not get the HTT map for create event
  1839. */
  1840. if (ast_entry->delete_in_progress ||
  1841. !dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE) ||
  1842. !ast_entry->is_mapped)
  1843. return ret;
  1844. if ((ast_entry->type == CDP_TXRX_AST_TYPE_STATIC) ||
  1845. (ast_entry->type == CDP_TXRX_AST_TYPE_SELF) ||
  1846. (ast_entry->type == CDP_TXRX_AST_TYPE_STA_BSS) ||
  1847. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1848. return 0;
  1849. /*
  1850. * Avoids flood of WMI update messages sent to FW for same peer.
  1851. */
  1852. if (qdf_unlikely(ast_entry->peer_id == peer->peer_id) &&
  1853. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS) &&
  1854. (ast_entry->vdev_id == peer->vdev->vdev_id) &&
  1855. (ast_entry->is_active))
  1856. return 0;
  1857. old_peer = dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1858. DP_MOD_ID_AST);
  1859. if (!old_peer)
  1860. return 0;
  1861. TAILQ_REMOVE(&old_peer->ast_entry_list, ast_entry, ase_list_elem);
  1862. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1863. ast_entry->peer_id = peer->peer_id;
  1864. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1865. ast_entry->pdev_id = peer->vdev->pdev->pdev_id;
  1866. ast_entry->vdev_id = peer->vdev->vdev_id;
  1867. ast_entry->is_active = TRUE;
  1868. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1869. ret = dp_update_wds_entry_wrapper(soc,
  1870. peer,
  1871. ast_entry->mac_addr.raw,
  1872. flags);
  1873. return ret;
  1874. }
  1875. /*
  1876. * dp_peer_ast_get_pdev_id() - get pdev_id from the ast entry
  1877. * @soc: SoC handle
  1878. * @ast_entry: AST entry of the node
  1879. *
  1880. * This function gets the pdev_id from the ast entry.
  1881. *
  1882. * Return: (uint8_t) pdev_id
  1883. */
  1884. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1885. struct dp_ast_entry *ast_entry)
  1886. {
  1887. return ast_entry->pdev_id;
  1888. }
  1889. /*
  1890. * dp_peer_ast_get_next_hop() - get next_hop from the ast entry
  1891. * @soc: SoC handle
  1892. * @ast_entry: AST entry of the node
  1893. *
  1894. * This function gets the next hop from the ast entry.
  1895. *
  1896. * Return: (uint8_t) next_hop
  1897. */
  1898. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1899. struct dp_ast_entry *ast_entry)
  1900. {
  1901. return ast_entry->next_hop;
  1902. }
  1903. /*
  1904. * dp_peer_ast_set_type() - set type from the ast entry
  1905. * @soc: SoC handle
  1906. * @ast_entry: AST entry of the node
  1907. *
  1908. * This function sets the type in the ast entry.
  1909. *
  1910. * Return:
  1911. */
  1912. void dp_peer_ast_set_type(struct dp_soc *soc,
  1913. struct dp_ast_entry *ast_entry,
  1914. enum cdp_txrx_ast_entry_type type)
  1915. {
  1916. ast_entry->type = type;
  1917. }
  1918. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  1919. struct dp_ast_entry *ast_entry,
  1920. struct dp_peer *peer)
  1921. {
  1922. bool delete_in_fw = false;
  1923. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_TRACE,
  1924. "%s: ast_entry->type: %d pdevid: %u vdev: %u mac_addr: "QDF_MAC_ADDR_FMT" next_hop: %u peer_id: %uM\n",
  1925. __func__, ast_entry->type, ast_entry->pdev_id,
  1926. ast_entry->vdev_id,
  1927. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1928. ast_entry->next_hop, ast_entry->peer_id);
  1929. /*
  1930. * If peer state is logical delete, the peer is about to get
  1931. * teared down with a peer delete command to firmware,
  1932. * which will cleanup all the wds ast entries.
  1933. * So, no need to send explicit wds ast delete to firmware.
  1934. */
  1935. if (ast_entry->next_hop) {
  1936. if (peer && dp_peer_state_cmp(peer,
  1937. DP_PEER_STATE_LOGICAL_DELETE))
  1938. delete_in_fw = false;
  1939. else
  1940. delete_in_fw = true;
  1941. dp_del_wds_entry_wrapper(soc,
  1942. ast_entry->vdev_id,
  1943. ast_entry->mac_addr.raw,
  1944. ast_entry->type,
  1945. delete_in_fw);
  1946. }
  1947. }
  1948. #else
  1949. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1950. struct dp_ast_entry *ast_entry)
  1951. {
  1952. }
  1953. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1954. struct dp_ast_entry *ast_entry,
  1955. struct dp_peer *peer)
  1956. {
  1957. }
  1958. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  1959. struct dp_ast_entry *ase)
  1960. {
  1961. }
  1962. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  1963. uint8_t *ast_mac_addr,
  1964. uint8_t vdev_id)
  1965. {
  1966. return NULL;
  1967. }
  1968. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1969. struct dp_peer *peer,
  1970. uint8_t *mac_addr,
  1971. enum cdp_txrx_ast_entry_type type,
  1972. uint32_t flags)
  1973. {
  1974. return QDF_STATUS_E_FAILURE;
  1975. }
  1976. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1977. {
  1978. }
  1979. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1980. struct dp_ast_entry *ast_entry, uint32_t flags)
  1981. {
  1982. return 1;
  1983. }
  1984. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1985. uint8_t *ast_mac_addr)
  1986. {
  1987. return NULL;
  1988. }
  1989. static inline
  1990. QDF_STATUS dp_peer_host_add_map_ast(struct dp_soc *soc, uint16_t peer_id,
  1991. uint8_t *mac_addr, uint16_t hw_peer_id,
  1992. uint8_t vdev_id, uint16_t ast_hash,
  1993. uint8_t is_wds)
  1994. {
  1995. return QDF_STATUS_SUCCESS;
  1996. }
  1997. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1998. uint8_t *ast_mac_addr,
  1999. uint8_t pdev_id)
  2000. {
  2001. return NULL;
  2002. }
  2003. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  2004. {
  2005. return QDF_STATUS_SUCCESS;
  2006. }
  2007. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  2008. struct dp_peer *peer,
  2009. uint8_t *mac_addr,
  2010. uint16_t hw_peer_id,
  2011. uint8_t vdev_id,
  2012. uint16_t ast_hash,
  2013. uint8_t is_wds)
  2014. {
  2015. return QDF_STATUS_SUCCESS;
  2016. }
  2017. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  2018. {
  2019. }
  2020. void dp_peer_ast_set_type(struct dp_soc *soc,
  2021. struct dp_ast_entry *ast_entry,
  2022. enum cdp_txrx_ast_entry_type type)
  2023. {
  2024. }
  2025. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  2026. struct dp_ast_entry *ast_entry)
  2027. {
  2028. return 0xff;
  2029. }
  2030. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  2031. struct dp_ast_entry *ast_entry)
  2032. {
  2033. return 0xff;
  2034. }
  2035. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  2036. struct dp_ast_entry *ast_entry,
  2037. struct dp_peer *peer)
  2038. {
  2039. }
  2040. #endif
  2041. #ifdef WLAN_FEATURE_MULTI_AST_DEL
  2042. void dp_peer_ast_send_multi_wds_del(
  2043. struct dp_soc *soc, uint8_t vdev_id,
  2044. struct peer_del_multi_wds_entries *wds_list)
  2045. {
  2046. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  2047. if (cdp_soc && cdp_soc->ol_ops &&
  2048. cdp_soc->ol_ops->peer_del_multi_wds_entry)
  2049. cdp_soc->ol_ops->peer_del_multi_wds_entry(soc->ctrl_psoc,
  2050. vdev_id, wds_list);
  2051. }
  2052. #endif
  2053. #ifdef FEATURE_WDS
  2054. /**
  2055. * dp_peer_ast_free_wds_entries() - Free wds ast entries associated with peer
  2056. * @soc: soc handle
  2057. * @peer: peer handle
  2058. *
  2059. * Free all the wds ast entries associated with peer
  2060. *
  2061. * Return: Number of wds ast entries freed
  2062. */
  2063. static uint32_t dp_peer_ast_free_wds_entries(struct dp_soc *soc,
  2064. struct dp_peer *peer)
  2065. {
  2066. TAILQ_HEAD(, dp_ast_entry) ast_local_list = {0};
  2067. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  2068. uint32_t num_ast = 0;
  2069. TAILQ_INIT(&ast_local_list);
  2070. qdf_spin_lock_bh(&soc->ast_lock);
  2071. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  2072. if (ast_entry->next_hop)
  2073. num_ast++;
  2074. if (ast_entry->is_mapped)
  2075. soc->ast_table[ast_entry->ast_idx] = NULL;
  2076. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2077. DP_STATS_INC(soc, ast.deleted, 1);
  2078. dp_peer_ast_hash_remove(soc, ast_entry);
  2079. TAILQ_INSERT_TAIL(&ast_local_list, ast_entry,
  2080. ase_list_elem);
  2081. soc->num_ast_entries--;
  2082. }
  2083. qdf_spin_unlock_bh(&soc->ast_lock);
  2084. TAILQ_FOREACH_SAFE(ast_entry, &ast_local_list, ase_list_elem,
  2085. temp_ast_entry) {
  2086. if (ast_entry->callback)
  2087. ast_entry->callback(soc->ctrl_psoc,
  2088. dp_soc_to_cdp_soc(soc),
  2089. ast_entry->cookie,
  2090. CDP_TXRX_AST_DELETED);
  2091. qdf_mem_free(ast_entry);
  2092. }
  2093. return num_ast;
  2094. }
  2095. /**
  2096. * dp_peer_clean_wds_entries() - Clean wds ast entries and compare
  2097. * @soc: soc handle
  2098. * @peer: peer handle
  2099. * @free_wds_count - number of wds entries freed by FW with peer delete
  2100. *
  2101. * Free all the wds ast entries associated with peer and compare with
  2102. * the value received from firmware
  2103. *
  2104. * Return: Number of wds ast entries freed
  2105. */
  2106. static void
  2107. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  2108. uint32_t free_wds_count)
  2109. {
  2110. uint32_t wds_deleted = 0;
  2111. if (soc->ast_offload_support && !soc->host_ast_db_enable)
  2112. return;
  2113. wds_deleted = dp_peer_ast_free_wds_entries(soc, peer);
  2114. if ((DP_PEER_WDS_COUNT_INVALID != free_wds_count) &&
  2115. (free_wds_count != wds_deleted)) {
  2116. DP_STATS_INC(soc, ast.ast_mismatch, 1);
  2117. dp_alert("For peer %pK (mac: "QDF_MAC_ADDR_FMT")number of wds entries deleted by fw = %d during peer delete is not same as the numbers deleted by host = %d",
  2118. peer, peer->mac_addr.raw, free_wds_count,
  2119. wds_deleted);
  2120. }
  2121. }
  2122. #else
  2123. static void
  2124. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  2125. uint32_t free_wds_count)
  2126. {
  2127. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  2128. qdf_spin_lock_bh(&soc->ast_lock);
  2129. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  2130. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2131. if (ast_entry->is_mapped)
  2132. soc->ast_table[ast_entry->ast_idx] = NULL;
  2133. dp_peer_free_ast_entry(soc, ast_entry);
  2134. }
  2135. peer->self_ast_entry = NULL;
  2136. qdf_spin_unlock_bh(&soc->ast_lock);
  2137. }
  2138. #endif
  2139. /**
  2140. * dp_peer_ast_free_entry_by_mac() - find ast entry by MAC address and delete
  2141. * @soc: soc handle
  2142. * @peer: peer handle
  2143. * @vdev_id: vdev_id
  2144. * @mac_addr: mac address of the AST entry to searc and delete
  2145. *
  2146. * find the ast entry from the peer list using the mac address and free
  2147. * the entry.
  2148. *
  2149. * Return: SUCCESS or NOENT
  2150. */
  2151. static int dp_peer_ast_free_entry_by_mac(struct dp_soc *soc,
  2152. struct dp_peer *peer,
  2153. uint8_t vdev_id,
  2154. uint8_t *mac_addr)
  2155. {
  2156. struct dp_ast_entry *ast_entry;
  2157. void *cookie = NULL;
  2158. txrx_ast_free_cb cb = NULL;
  2159. /*
  2160. * release the reference only if it is mapped
  2161. * to ast_table
  2162. */
  2163. qdf_spin_lock_bh(&soc->ast_lock);
  2164. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  2165. if (!ast_entry) {
  2166. qdf_spin_unlock_bh(&soc->ast_lock);
  2167. return QDF_STATUS_E_NOENT;
  2168. } else if (ast_entry->is_mapped) {
  2169. soc->ast_table[ast_entry->ast_idx] = NULL;
  2170. }
  2171. cb = ast_entry->callback;
  2172. cookie = ast_entry->cookie;
  2173. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2174. dp_peer_free_ast_entry(soc, ast_entry);
  2175. qdf_spin_unlock_bh(&soc->ast_lock);
  2176. if (cb) {
  2177. cb(soc->ctrl_psoc,
  2178. dp_soc_to_cdp_soc(soc),
  2179. cookie,
  2180. CDP_TXRX_AST_DELETED);
  2181. }
  2182. return QDF_STATUS_SUCCESS;
  2183. }
  2184. void dp_peer_find_hash_erase(struct dp_soc *soc)
  2185. {
  2186. int i;
  2187. /*
  2188. * Not really necessary to take peer_ref_mutex lock - by this point,
  2189. * it's known that the soc is no longer in use.
  2190. */
  2191. for (i = 0; i <= soc->peer_hash.mask; i++) {
  2192. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  2193. struct dp_peer *peer, *peer_next;
  2194. /*
  2195. * TAILQ_FOREACH_SAFE must be used here to avoid any
  2196. * memory access violation after peer is freed
  2197. */
  2198. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  2199. hash_list_elem, peer_next) {
  2200. /*
  2201. * Don't remove the peer from the hash table -
  2202. * that would modify the list we are currently
  2203. * traversing, and it's not necessary anyway.
  2204. */
  2205. /*
  2206. * Artificially adjust the peer's ref count to
  2207. * 1, so it will get deleted by
  2208. * dp_peer_unref_delete.
  2209. */
  2210. /* set to zero */
  2211. qdf_atomic_init(&peer->ref_cnt);
  2212. for (i = 0; i < DP_MOD_ID_MAX; i++)
  2213. qdf_atomic_init(&peer->mod_refs[i]);
  2214. /* incr to one */
  2215. qdf_atomic_inc(&peer->ref_cnt);
  2216. qdf_atomic_inc(&peer->mod_refs
  2217. [DP_MOD_ID_CONFIG]);
  2218. dp_peer_unref_delete(peer,
  2219. DP_MOD_ID_CONFIG);
  2220. }
  2221. }
  2222. }
  2223. }
  2224. void dp_peer_ast_table_detach(struct dp_soc *soc)
  2225. {
  2226. if (soc->ast_table) {
  2227. qdf_mem_free(soc->ast_table);
  2228. soc->ast_table = NULL;
  2229. }
  2230. }
  2231. /*
  2232. * dp_peer_find_map_detach() - cleanup memory for peer_id_to_obj_map
  2233. * @soc: soc handle
  2234. *
  2235. * return: none
  2236. */
  2237. void dp_peer_find_map_detach(struct dp_soc *soc)
  2238. {
  2239. if (soc->peer_id_to_obj_map) {
  2240. qdf_mem_free(soc->peer_id_to_obj_map);
  2241. soc->peer_id_to_obj_map = NULL;
  2242. qdf_spinlock_destroy(&soc->peer_map_lock);
  2243. }
  2244. }
  2245. #ifndef AST_OFFLOAD_ENABLE
  2246. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2247. {
  2248. QDF_STATUS status;
  2249. status = dp_peer_find_map_attach(soc);
  2250. if (!QDF_IS_STATUS_SUCCESS(status))
  2251. return status;
  2252. status = dp_peer_find_hash_attach(soc);
  2253. if (!QDF_IS_STATUS_SUCCESS(status))
  2254. goto map_detach;
  2255. status = dp_peer_ast_table_attach(soc);
  2256. if (!QDF_IS_STATUS_SUCCESS(status))
  2257. goto hash_detach;
  2258. status = dp_peer_ast_hash_attach(soc);
  2259. if (!QDF_IS_STATUS_SUCCESS(status))
  2260. goto ast_table_detach;
  2261. status = dp_peer_mec_hash_attach(soc);
  2262. if (QDF_IS_STATUS_SUCCESS(status)) {
  2263. dp_soc_wds_attach(soc);
  2264. return status;
  2265. }
  2266. dp_peer_ast_hash_detach(soc);
  2267. ast_table_detach:
  2268. dp_peer_ast_table_detach(soc);
  2269. hash_detach:
  2270. dp_peer_find_hash_detach(soc);
  2271. map_detach:
  2272. dp_peer_find_map_detach(soc);
  2273. return status;
  2274. }
  2275. #else
  2276. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2277. {
  2278. QDF_STATUS status;
  2279. status = dp_peer_find_map_attach(soc);
  2280. if (!QDF_IS_STATUS_SUCCESS(status))
  2281. return status;
  2282. status = dp_peer_find_hash_attach(soc);
  2283. if (!QDF_IS_STATUS_SUCCESS(status))
  2284. goto map_detach;
  2285. return status;
  2286. map_detach:
  2287. dp_peer_find_map_detach(soc);
  2288. return status;
  2289. }
  2290. #endif
  2291. #ifdef IPA_OFFLOAD
  2292. /*
  2293. * dp_peer_update_tid_stats_from_reo() - update rx pkt and byte count from reo
  2294. * @soc - soc handle
  2295. * @cb_ctxt - combination of peer_id and tid
  2296. * @reo_status - reo status
  2297. *
  2298. * return: void
  2299. */
  2300. void dp_peer_update_tid_stats_from_reo(struct dp_soc *soc, void *cb_ctxt,
  2301. union hal_reo_status *reo_status)
  2302. {
  2303. struct dp_peer *peer = NULL;
  2304. struct dp_rx_tid *rx_tid = NULL;
  2305. unsigned long comb_peer_id_tid;
  2306. struct hal_reo_queue_status *queue_status = &reo_status->queue_status;
  2307. uint16_t tid;
  2308. uint16_t peer_id;
  2309. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  2310. dp_err("REO stats failure %d\n",
  2311. queue_status->header.status);
  2312. return;
  2313. }
  2314. comb_peer_id_tid = (unsigned long)cb_ctxt;
  2315. tid = DP_PEER_GET_REO_STATS_TID(comb_peer_id_tid);
  2316. peer_id = DP_PEER_GET_REO_STATS_PEER_ID(comb_peer_id_tid);
  2317. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_GENERIC_STATS);
  2318. if (!peer)
  2319. return;
  2320. rx_tid = &peer->rx_tid[tid];
  2321. if (!rx_tid) {
  2322. dp_peer_unref_delete(peer, DP_MOD_ID_GENERIC_STATS);
  2323. return;
  2324. }
  2325. rx_tid->rx_msdu_cnt.bytes += queue_status->total_cnt;
  2326. rx_tid->rx_msdu_cnt.num += queue_status->msdu_frms_cnt;
  2327. dp_peer_unref_delete(peer, DP_MOD_ID_GENERIC_STATS);
  2328. }
  2329. qdf_export_symbol(dp_peer_update_tid_stats_from_reo);
  2330. #endif
  2331. void dp_rx_tid_stats_cb(struct dp_soc *soc, void *cb_ctxt,
  2332. union hal_reo_status *reo_status)
  2333. {
  2334. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2335. struct hal_reo_queue_status *queue_status = &(reo_status->queue_status);
  2336. if (queue_status->header.status == HAL_REO_CMD_DRAIN)
  2337. return;
  2338. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  2339. DP_PRINT_STATS("REO stats failure %d for TID %d\n",
  2340. queue_status->header.status, rx_tid->tid);
  2341. return;
  2342. }
  2343. DP_PRINT_STATS("REO queue stats (TID: %d):\n"
  2344. "ssn: %d\n"
  2345. "curr_idx : %d\n"
  2346. "pn_31_0 : %08x\n"
  2347. "pn_63_32 : %08x\n"
  2348. "pn_95_64 : %08x\n"
  2349. "pn_127_96 : %08x\n"
  2350. "last_rx_enq_tstamp : %08x\n"
  2351. "last_rx_deq_tstamp : %08x\n"
  2352. "rx_bitmap_31_0 : %08x\n"
  2353. "rx_bitmap_63_32 : %08x\n"
  2354. "rx_bitmap_95_64 : %08x\n"
  2355. "rx_bitmap_127_96 : %08x\n"
  2356. "rx_bitmap_159_128 : %08x\n"
  2357. "rx_bitmap_191_160 : %08x\n"
  2358. "rx_bitmap_223_192 : %08x\n"
  2359. "rx_bitmap_255_224 : %08x\n",
  2360. rx_tid->tid,
  2361. queue_status->ssn, queue_status->curr_idx,
  2362. queue_status->pn_31_0, queue_status->pn_63_32,
  2363. queue_status->pn_95_64, queue_status->pn_127_96,
  2364. queue_status->last_rx_enq_tstamp,
  2365. queue_status->last_rx_deq_tstamp,
  2366. queue_status->rx_bitmap_31_0,
  2367. queue_status->rx_bitmap_63_32,
  2368. queue_status->rx_bitmap_95_64,
  2369. queue_status->rx_bitmap_127_96,
  2370. queue_status->rx_bitmap_159_128,
  2371. queue_status->rx_bitmap_191_160,
  2372. queue_status->rx_bitmap_223_192,
  2373. queue_status->rx_bitmap_255_224);
  2374. DP_PRINT_STATS(
  2375. "curr_mpdu_cnt : %d\n"
  2376. "curr_msdu_cnt : %d\n"
  2377. "fwd_timeout_cnt : %d\n"
  2378. "fwd_bar_cnt : %d\n"
  2379. "dup_cnt : %d\n"
  2380. "frms_in_order_cnt : %d\n"
  2381. "bar_rcvd_cnt : %d\n"
  2382. "mpdu_frms_cnt : %d\n"
  2383. "msdu_frms_cnt : %d\n"
  2384. "total_byte_cnt : %d\n"
  2385. "late_recv_mpdu_cnt : %d\n"
  2386. "win_jump_2k : %d\n"
  2387. "hole_cnt : %d\n",
  2388. queue_status->curr_mpdu_cnt,
  2389. queue_status->curr_msdu_cnt,
  2390. queue_status->fwd_timeout_cnt,
  2391. queue_status->fwd_bar_cnt,
  2392. queue_status->dup_cnt,
  2393. queue_status->frms_in_order_cnt,
  2394. queue_status->bar_rcvd_cnt,
  2395. queue_status->mpdu_frms_cnt,
  2396. queue_status->msdu_frms_cnt,
  2397. queue_status->total_cnt,
  2398. queue_status->late_recv_mpdu_cnt,
  2399. queue_status->win_jump_2k,
  2400. queue_status->hole_cnt);
  2401. DP_PRINT_STATS("Addba Req : %d\n"
  2402. "Addba Resp : %d\n"
  2403. "Addba Resp success : %d\n"
  2404. "Addba Resp failed : %d\n"
  2405. "Delba Req received : %d\n"
  2406. "Delba Tx success : %d\n"
  2407. "Delba Tx Fail : %d\n"
  2408. "BA window size : %d\n"
  2409. "Pn size : %d\n",
  2410. rx_tid->num_of_addba_req,
  2411. rx_tid->num_of_addba_resp,
  2412. rx_tid->num_addba_rsp_success,
  2413. rx_tid->num_addba_rsp_failed,
  2414. rx_tid->num_of_delba_req,
  2415. rx_tid->delba_tx_success_cnt,
  2416. rx_tid->delba_tx_fail_cnt,
  2417. rx_tid->ba_win_size,
  2418. rx_tid->pn_size);
  2419. }
  2420. #ifdef REO_SHARED_QREF_TABLE_EN
  2421. void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2422. struct dp_peer *peer)
  2423. {
  2424. uint8_t tid;
  2425. if (IS_MLO_DP_LINK_PEER(peer))
  2426. return;
  2427. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc)) {
  2428. for (tid = 0; tid < DP_MAX_TIDS; tid++)
  2429. hal_reo_shared_qaddr_write(soc->hal_soc,
  2430. peer->peer_id, tid, 0);
  2431. }
  2432. }
  2433. #endif
  2434. /*
  2435. * dp_peer_find_add_id() - map peer_id with peer
  2436. * @soc: soc handle
  2437. * @peer_mac_addr: peer mac address
  2438. * @peer_id: peer id to be mapped
  2439. * @hw_peer_id: HW ast index
  2440. * @vdev_id: vdev_id
  2441. * @peer_type: peer type (link or MLD)
  2442. *
  2443. * return: peer in success
  2444. * NULL in failure
  2445. */
  2446. static inline struct dp_peer *dp_peer_find_add_id(struct dp_soc *soc,
  2447. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  2448. uint8_t vdev_id, enum cdp_peer_type peer_type)
  2449. {
  2450. struct dp_peer *peer;
  2451. struct cdp_peer_info peer_info = { 0 };
  2452. QDF_ASSERT(peer_id <= soc->max_peer_id);
  2453. /* check if there's already a peer object with this MAC address */
  2454. DP_PEER_INFO_PARAMS_INIT(&peer_info, vdev_id, peer_mac_addr,
  2455. false, peer_type);
  2456. peer = dp_peer_hash_find_wrapper(soc, &peer_info, DP_MOD_ID_CONFIG);
  2457. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  2458. soc, peer, peer_id, vdev_id,
  2459. QDF_MAC_ADDR_REF(peer_mac_addr));
  2460. if (peer) {
  2461. /* peer's ref count was already incremented by
  2462. * peer_find_hash_find
  2463. */
  2464. dp_peer_info("%pK: ref_cnt: %d", soc,
  2465. qdf_atomic_read(&peer->ref_cnt));
  2466. /*
  2467. * if peer is in logical delete CP triggered delete before map
  2468. * is received ignore this event
  2469. */
  2470. if (dp_peer_state_cmp(peer, DP_PEER_STATE_LOGICAL_DELETE)) {
  2471. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2472. dp_alert("Peer %pK["QDF_MAC_ADDR_FMT"] logical delete state vid %d",
  2473. peer, QDF_MAC_ADDR_REF(peer_mac_addr),
  2474. vdev_id);
  2475. return NULL;
  2476. }
  2477. if (peer->peer_id == HTT_INVALID_PEER) {
  2478. if (!IS_MLO_DP_MLD_PEER(peer))
  2479. dp_monitor_peer_tid_peer_id_update(soc, peer,
  2480. peer_id);
  2481. } else {
  2482. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2483. QDF_ASSERT(0);
  2484. return NULL;
  2485. }
  2486. dp_peer_find_id_to_obj_add(soc, peer, peer_id);
  2487. if (soc->arch_ops.dp_partner_chips_map)
  2488. soc->arch_ops.dp_partner_chips_map(soc, peer, peer_id);
  2489. dp_peer_update_state(soc, peer, DP_PEER_STATE_ACTIVE);
  2490. return peer;
  2491. }
  2492. return NULL;
  2493. }
  2494. #ifdef WLAN_FEATURE_11BE_MLO
  2495. #ifdef DP_USE_REDUCED_PEER_ID_FIELD_WIDTH
  2496. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2497. uint16_t peer_id)
  2498. {
  2499. return ((peer_id & soc->peer_id_mask) | (1 << soc->peer_id_shift));
  2500. }
  2501. #else
  2502. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2503. uint16_t peer_id)
  2504. {
  2505. return (peer_id | (1 << HTT_RX_PEER_META_DATA_V1_ML_PEER_VALID_S));
  2506. }
  2507. #endif
  2508. QDF_STATUS
  2509. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2510. uint8_t *peer_mac_addr,
  2511. struct dp_mlo_flow_override_info *mlo_flow_info,
  2512. struct dp_mlo_link_info *mlo_link_info)
  2513. {
  2514. struct dp_peer *peer = NULL;
  2515. uint16_t hw_peer_id = mlo_flow_info[0].ast_idx;
  2516. uint16_t ast_hash = mlo_flow_info[0].cache_set_num;
  2517. uint8_t vdev_id = 0;
  2518. uint8_t is_wds = 0;
  2519. int i;
  2520. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2521. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2522. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2523. struct dp_soc *primary_soc;
  2524. dp_info("mlo_peer_map_event (soc:%pK): peer_id %d ml_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT,
  2525. soc, peer_id, ml_peer_id,
  2526. QDF_MAC_ADDR_REF(peer_mac_addr));
  2527. /* Get corresponding vdev ID for the peer based
  2528. * on chip ID obtained from mlo peer_map event
  2529. */
  2530. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  2531. if (mlo_link_info[i].peer_chip_id == dp_mlo_get_chip_id(soc)) {
  2532. vdev_id = mlo_link_info[i].vdev_id;
  2533. break;
  2534. }
  2535. }
  2536. peer = dp_peer_find_add_id(soc, peer_mac_addr, ml_peer_id,
  2537. hw_peer_id, vdev_id, CDP_MLD_PEER_TYPE);
  2538. if (peer) {
  2539. if (wlan_op_mode_sta == peer->vdev->opmode &&
  2540. qdf_mem_cmp(peer->mac_addr.raw,
  2541. peer->vdev->mld_mac_addr.raw,
  2542. QDF_MAC_ADDR_SIZE) != 0) {
  2543. dp_peer_info("%pK: STA vdev bss_peer!!!!", soc);
  2544. peer->bss_peer = 1;
  2545. if (peer->txrx_peer)
  2546. peer->txrx_peer->bss_peer = 1;
  2547. }
  2548. if (peer->vdev->opmode == wlan_op_mode_sta) {
  2549. peer->vdev->bss_ast_hash = ast_hash;
  2550. peer->vdev->bss_ast_idx = hw_peer_id;
  2551. }
  2552. /* Add ast entry incase self ast entry is
  2553. * deleted due to DP CP sync issue
  2554. *
  2555. * self_ast_entry is modified in peer create
  2556. * and peer unmap path which cannot run in
  2557. * parllel with peer map, no lock need before
  2558. * referring it
  2559. */
  2560. if (!peer->self_ast_entry) {
  2561. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2562. QDF_MAC_ADDR_REF(peer_mac_addr));
  2563. dp_peer_add_ast(soc, peer,
  2564. peer_mac_addr,
  2565. type, 0);
  2566. }
  2567. /* If peer setup and hence rx_tid setup got called
  2568. * before htt peer map then Qref write to LUT did not
  2569. * happen in rx_tid setup as peer_id was invalid.
  2570. * So defer Qref write to peer map handler. Check if
  2571. * rx_tid qdesc for tid 0 is already setup and perform
  2572. * qref write to LUT for Tid 0 and 16.
  2573. *
  2574. * Peer map could be obtained on assoc link, hence
  2575. * change to primary link's soc.
  2576. */
  2577. primary_soc = peer->vdev->pdev->soc;
  2578. if (hal_reo_shared_qaddr_is_enable(primary_soc->hal_soc) &&
  2579. peer->rx_tid[0].hw_qdesc_vaddr_unaligned) {
  2580. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2581. ml_peer_id,
  2582. 0,
  2583. peer->rx_tid[0].hw_qdesc_paddr);
  2584. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2585. ml_peer_id,
  2586. DP_NON_QOS_TID,
  2587. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2588. }
  2589. }
  2590. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2591. vdev_id, ast_hash, is_wds);
  2592. /*
  2593. * If AST offload and host AST DB is enabled, populate AST entries on
  2594. * host based on mlo peer map event from FW
  2595. */
  2596. if (soc->ast_offload_support && soc->host_ast_db_enable) {
  2597. dp_peer_host_add_map_ast(soc, ml_peer_id, peer_mac_addr,
  2598. hw_peer_id, vdev_id,
  2599. ast_hash, is_wds);
  2600. }
  2601. return err;
  2602. }
  2603. #endif
  2604. #ifdef DP_RX_UDP_OVER_PEER_ROAM
  2605. void dp_rx_reset_roaming_peer(struct dp_soc *soc, uint8_t vdev_id,
  2606. uint8_t *peer_mac_addr)
  2607. {
  2608. struct dp_vdev *vdev = NULL;
  2609. vdev = dp_vdev_get_ref_by_id(soc, vdev_id, DP_MOD_ID_HTT);
  2610. if (vdev) {
  2611. if (qdf_mem_cmp(vdev->roaming_peer_mac.raw, peer_mac_addr,
  2612. QDF_MAC_ADDR_SIZE) == 0) {
  2613. vdev->roaming_peer_status =
  2614. WLAN_ROAM_PEER_AUTH_STATUS_NONE;
  2615. qdf_mem_zero(vdev->roaming_peer_mac.raw,
  2616. QDF_MAC_ADDR_SIZE);
  2617. }
  2618. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_HTT);
  2619. }
  2620. }
  2621. #endif
  2622. /**
  2623. * dp_rx_peer_map_handler() - handle peer map event from firmware
  2624. * @soc_handle - generic soc handle
  2625. * @peeri_id - peer_id from firmware
  2626. * @hw_peer_id - ast index for this peer
  2627. * @vdev_id - vdev ID
  2628. * @peer_mac_addr - mac address of the peer
  2629. * @ast_hash - ast hash value
  2630. * @is_wds - flag to indicate peer map event for WDS ast entry
  2631. *
  2632. * associate the peer_id that firmware provided with peer entry
  2633. * and update the ast table in the host with the hw_peer_id.
  2634. *
  2635. * Return: QDF_STATUS code
  2636. */
  2637. QDF_STATUS
  2638. dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2639. uint16_t hw_peer_id, uint8_t vdev_id,
  2640. uint8_t *peer_mac_addr, uint16_t ast_hash,
  2641. uint8_t is_wds)
  2642. {
  2643. struct dp_peer *peer = NULL;
  2644. struct dp_vdev *vdev = NULL;
  2645. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2646. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2647. dp_info("peer_map_event (soc:%pK): peer_id %d, hw_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT", vdev_id %d",
  2648. soc, peer_id, hw_peer_id,
  2649. QDF_MAC_ADDR_REF(peer_mac_addr), vdev_id);
  2650. /* Peer map event for WDS ast entry get the peer from
  2651. * obj map
  2652. */
  2653. if (is_wds) {
  2654. if (!soc->ast_offload_support) {
  2655. peer = dp_peer_get_ref_by_id(soc, peer_id,
  2656. DP_MOD_ID_HTT);
  2657. err = dp_peer_map_ast(soc, peer, peer_mac_addr,
  2658. hw_peer_id,
  2659. vdev_id, ast_hash, is_wds);
  2660. if (peer)
  2661. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2662. }
  2663. } else {
  2664. /*
  2665. * It's the responsibility of the CP and FW to ensure
  2666. * that peer is created successfully. Ideally DP should
  2667. * not hit the below condition for directly associated
  2668. * peers.
  2669. */
  2670. if ((!soc->ast_offload_support) && ((hw_peer_id < 0) ||
  2671. (hw_peer_id >=
  2672. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)))) {
  2673. dp_peer_err("%pK: invalid hw_peer_id: %d", soc, hw_peer_id);
  2674. qdf_assert_always(0);
  2675. }
  2676. peer = dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  2677. hw_peer_id, vdev_id,
  2678. CDP_LINK_PEER_TYPE);
  2679. if (peer) {
  2680. vdev = peer->vdev;
  2681. /* Only check for STA Vdev and peer is not for TDLS */
  2682. if (wlan_op_mode_sta == vdev->opmode &&
  2683. !peer->is_tdls_peer) {
  2684. if (qdf_mem_cmp(peer->mac_addr.raw,
  2685. vdev->mac_addr.raw,
  2686. QDF_MAC_ADDR_SIZE) != 0) {
  2687. dp_info("%pK: STA vdev bss_peer", soc);
  2688. peer->bss_peer = 1;
  2689. if (peer->txrx_peer)
  2690. peer->txrx_peer->bss_peer = 1;
  2691. }
  2692. dp_info("bss ast_hash 0x%x, ast_index 0x%x",
  2693. ast_hash, hw_peer_id);
  2694. vdev->bss_ast_hash = ast_hash;
  2695. vdev->bss_ast_idx = hw_peer_id;
  2696. }
  2697. /* Add ast entry incase self ast entry is
  2698. * deleted due to DP CP sync issue
  2699. *
  2700. * self_ast_entry is modified in peer create
  2701. * and peer unmap path which cannot run in
  2702. * parllel with peer map, no lock need before
  2703. * referring it
  2704. */
  2705. if (!soc->ast_offload_support &&
  2706. !peer->self_ast_entry) {
  2707. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2708. QDF_MAC_ADDR_REF(peer_mac_addr));
  2709. dp_peer_add_ast(soc, peer,
  2710. peer_mac_addr,
  2711. type, 0);
  2712. }
  2713. /* If peer setup and hence rx_tid setup got called
  2714. * before htt peer map then Qref write to LUT did
  2715. * not happen in rx_tid setup as peer_id was invalid.
  2716. * So defer Qref write to peer map handler. Check if
  2717. * rx_tid qdesc for tid 0 is already setup perform qref
  2718. * write to LUT for Tid 0 and 16.
  2719. */
  2720. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc) &&
  2721. peer->rx_tid[0].hw_qdesc_vaddr_unaligned &&
  2722. !IS_MLO_DP_LINK_PEER(peer)) {
  2723. hal_reo_shared_qaddr_write(soc->hal_soc,
  2724. peer_id,
  2725. 0,
  2726. peer->rx_tid[0].hw_qdesc_paddr);
  2727. hal_reo_shared_qaddr_write(soc->hal_soc,
  2728. peer_id,
  2729. DP_NON_QOS_TID,
  2730. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2731. }
  2732. }
  2733. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2734. vdev_id, ast_hash, is_wds);
  2735. }
  2736. dp_rx_reset_roaming_peer(soc, vdev_id, peer_mac_addr);
  2737. /*
  2738. * If AST offload and host AST DB is enabled, populate AST entries on
  2739. * host based on peer map event from FW
  2740. */
  2741. if (soc->ast_offload_support && soc->host_ast_db_enable) {
  2742. dp_peer_host_add_map_ast(soc, peer_id, peer_mac_addr,
  2743. hw_peer_id, vdev_id,
  2744. ast_hash, is_wds);
  2745. }
  2746. return err;
  2747. }
  2748. /**
  2749. * dp_rx_peer_unmap_handler() - handle peer unmap event from firmware
  2750. * @soc_handle - generic soc handle
  2751. * @peeri_id - peer_id from firmware
  2752. * @vdev_id - vdev ID
  2753. * @mac_addr - mac address of the peer or wds entry
  2754. * @is_wds - flag to indicate peer map event for WDS ast entry
  2755. * @free_wds_count - number of wds entries freed by FW with peer delete
  2756. *
  2757. * Return: none
  2758. */
  2759. void
  2760. dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  2761. uint8_t vdev_id, uint8_t *mac_addr,
  2762. uint8_t is_wds, uint32_t free_wds_count)
  2763. {
  2764. struct dp_peer *peer;
  2765. struct dp_vdev *vdev = NULL;
  2766. /*
  2767. * If FW AST offload is enabled and host AST DB is enabled,
  2768. * the AST entries are created during peer map from FW.
  2769. */
  2770. if (soc->ast_offload_support && is_wds) {
  2771. if (!soc->host_ast_db_enable)
  2772. return;
  2773. }
  2774. peer = __dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  2775. /*
  2776. * Currently peer IDs are assigned for vdevs as well as peers.
  2777. * If the peer ID is for a vdev, then the peer pointer stored
  2778. * in peer_id_to_obj_map will be NULL.
  2779. */
  2780. if (!peer) {
  2781. dp_err("Received unmap event for invalid peer_id %u",
  2782. peer_id);
  2783. return;
  2784. }
  2785. /* If V2 Peer map messages are enabled AST entry has to be
  2786. * freed here
  2787. */
  2788. if (is_wds) {
  2789. if (!dp_peer_ast_free_entry_by_mac(soc, peer, vdev_id,
  2790. mac_addr)) {
  2791. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2792. return;
  2793. }
  2794. dp_alert("AST entry not found with peer %pK peer_id %u peer_mac "QDF_MAC_ADDR_FMT" mac_addr "QDF_MAC_ADDR_FMT" vdev_id %u next_hop %u",
  2795. peer, peer->peer_id,
  2796. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2797. QDF_MAC_ADDR_REF(mac_addr), vdev_id,
  2798. is_wds);
  2799. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2800. return;
  2801. }
  2802. dp_peer_clean_wds_entries(soc, peer, free_wds_count);
  2803. dp_info("peer_unmap_event (soc:%pK) peer_id %d peer %pK",
  2804. soc, peer_id, peer);
  2805. /* Clear entries in Qref LUT */
  2806. /* TODO: Check if this is to be called from
  2807. * dp_peer_delete for MLO case if there is race between
  2808. * new peer id assignment and still not having received
  2809. * peer unmap for MLD peer with same peer id.
  2810. */
  2811. dp_peer_rx_reo_shared_qaddr_delete(soc, peer);
  2812. dp_peer_find_id_to_obj_remove(soc, peer_id);
  2813. if (soc->arch_ops.dp_partner_chips_unmap)
  2814. soc->arch_ops.dp_partner_chips_unmap(soc, peer_id);
  2815. peer->peer_id = HTT_INVALID_PEER;
  2816. /*
  2817. * Reset ast flow mapping table
  2818. */
  2819. if (!soc->ast_offload_support)
  2820. dp_peer_reset_flowq_map(peer);
  2821. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  2822. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  2823. peer_id, vdev_id, mac_addr);
  2824. }
  2825. vdev = peer->vdev;
  2826. dp_update_vdev_stats_on_peer_unmap(vdev, peer);
  2827. dp_peer_update_state(soc, peer, DP_PEER_STATE_INACTIVE);
  2828. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2829. /*
  2830. * Remove a reference to the peer.
  2831. * If there are no more references, delete the peer object.
  2832. */
  2833. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2834. }
  2835. #ifdef WLAN_FEATURE_11BE_MLO
  2836. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id)
  2837. {
  2838. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2839. uint8_t mac_addr[QDF_MAC_ADDR_SIZE] = {0};
  2840. uint8_t vdev_id = DP_VDEV_ALL;
  2841. uint8_t is_wds = 0;
  2842. dp_info("MLO peer_unmap_event (soc:%pK) peer_id %d",
  2843. soc, peer_id);
  2844. dp_rx_peer_unmap_handler(soc, ml_peer_id, vdev_id,
  2845. mac_addr, is_wds,
  2846. DP_PEER_WDS_COUNT_INVALID);
  2847. }
  2848. #endif
  2849. #ifndef AST_OFFLOAD_ENABLE
  2850. void
  2851. dp_peer_find_detach(struct dp_soc *soc)
  2852. {
  2853. dp_soc_wds_detach(soc);
  2854. dp_peer_find_map_detach(soc);
  2855. dp_peer_find_hash_detach(soc);
  2856. dp_peer_ast_hash_detach(soc);
  2857. dp_peer_ast_table_detach(soc);
  2858. dp_peer_mec_hash_detach(soc);
  2859. }
  2860. #else
  2861. void
  2862. dp_peer_find_detach(struct dp_soc *soc)
  2863. {
  2864. dp_peer_find_map_detach(soc);
  2865. dp_peer_find_hash_detach(soc);
  2866. }
  2867. #endif
  2868. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  2869. union hal_reo_status *reo_status)
  2870. {
  2871. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2872. if ((reo_status->rx_queue_status.header.status !=
  2873. HAL_REO_CMD_SUCCESS) &&
  2874. (reo_status->rx_queue_status.header.status !=
  2875. HAL_REO_CMD_DRAIN)) {
  2876. /* Should not happen normally. Just print error for now */
  2877. dp_peer_err("%pK: Rx tid HW desc update failed(%d): tid %d",
  2878. soc, reo_status->rx_queue_status.header.status,
  2879. rx_tid->tid);
  2880. }
  2881. }
  2882. static bool dp_get_peer_vdev_roaming_in_progress(struct dp_peer *peer)
  2883. {
  2884. struct ol_if_ops *ol_ops = NULL;
  2885. bool is_roaming = false;
  2886. uint8_t vdev_id = -1;
  2887. struct cdp_soc_t *soc;
  2888. if (!peer) {
  2889. dp_peer_info("Peer is NULL. No roaming possible");
  2890. return false;
  2891. }
  2892. soc = dp_soc_to_cdp_soc_t(peer->vdev->pdev->soc);
  2893. ol_ops = peer->vdev->pdev->soc->cdp_soc.ol_ops;
  2894. if (ol_ops && ol_ops->is_roam_inprogress) {
  2895. dp_get_vdevid(soc, peer->mac_addr.raw, &vdev_id);
  2896. is_roaming = ol_ops->is_roam_inprogress(vdev_id);
  2897. }
  2898. dp_peer_info("peer: " QDF_MAC_ADDR_FMT ", vdev_id: %d, is_roaming: %d",
  2899. QDF_MAC_ADDR_REF(peer->mac_addr.raw), vdev_id, is_roaming);
  2900. return is_roaming;
  2901. }
  2902. #ifdef WLAN_FEATURE_11BE_MLO
  2903. /**
  2904. * dp_rx_tid_setup_allow() - check if rx_tid and reo queue desc
  2905. setup is necessary
  2906. * @peer: DP peer handle
  2907. *
  2908. * Return: true - allow, false - disallow
  2909. */
  2910. static inline
  2911. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2912. {
  2913. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  2914. return false;
  2915. return true;
  2916. }
  2917. /**
  2918. * dp_rx_tid_update_allow() - check if rx_tid update needed
  2919. * @peer: DP peer handle
  2920. *
  2921. * Return: true - allow, false - disallow
  2922. */
  2923. static inline
  2924. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2925. {
  2926. /* not as expected for MLO connection link peer */
  2927. if (IS_MLO_DP_LINK_PEER(peer)) {
  2928. QDF_BUG(0);
  2929. return false;
  2930. }
  2931. return true;
  2932. }
  2933. #else
  2934. static inline
  2935. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2936. {
  2937. return true;
  2938. }
  2939. static inline
  2940. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2941. {
  2942. return true;
  2943. }
  2944. #endif
  2945. QDF_STATUS dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  2946. ba_window_size, uint32_t start_seq,
  2947. bool bar_update)
  2948. {
  2949. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  2950. struct dp_soc *soc = peer->vdev->pdev->soc;
  2951. struct hal_reo_cmd_params params;
  2952. if (!dp_rx_tid_update_allow(peer)) {
  2953. dp_peer_err("skip tid update for peer:" QDF_MAC_ADDR_FMT,
  2954. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2955. return QDF_STATUS_E_FAILURE;
  2956. }
  2957. qdf_mem_zero(&params, sizeof(params));
  2958. params.std.need_status = 1;
  2959. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  2960. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2961. params.u.upd_queue_params.update_ba_window_size = 1;
  2962. params.u.upd_queue_params.ba_window_size = ba_window_size;
  2963. if (start_seq < IEEE80211_SEQ_MAX) {
  2964. params.u.upd_queue_params.update_ssn = 1;
  2965. params.u.upd_queue_params.ssn = start_seq;
  2966. } else {
  2967. dp_set_ssn_valid_flag(&params, 0);
  2968. }
  2969. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  2970. dp_rx_tid_update_cb, rx_tid)) {
  2971. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  2972. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  2973. }
  2974. rx_tid->ba_win_size = ba_window_size;
  2975. if (dp_get_peer_vdev_roaming_in_progress(peer))
  2976. return QDF_STATUS_E_PERM;
  2977. if (!bar_update)
  2978. dp_peer_rx_reorder_queue_setup(soc, peer,
  2979. tid, ba_window_size);
  2980. return QDF_STATUS_SUCCESS;
  2981. }
  2982. #ifdef WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY
  2983. /*
  2984. * dp_reo_desc_defer_free_enqueue() - enqueue REO QDESC to be freed into
  2985. * the deferred list
  2986. * @soc: Datapath soc handle
  2987. * @free_desc: REO DESC reference that needs to be freed
  2988. *
  2989. * Return: true if enqueued, else false
  2990. */
  2991. static bool dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  2992. struct reo_desc_list_node *freedesc)
  2993. {
  2994. struct reo_desc_deferred_freelist_node *desc;
  2995. if (!qdf_atomic_read(&soc->cmn_init_done))
  2996. return false;
  2997. desc = qdf_mem_malloc(sizeof(*desc));
  2998. if (!desc)
  2999. return false;
  3000. desc->hw_qdesc_paddr = freedesc->rx_tid.hw_qdesc_paddr;
  3001. desc->hw_qdesc_alloc_size = freedesc->rx_tid.hw_qdesc_alloc_size;
  3002. desc->hw_qdesc_vaddr_unaligned =
  3003. freedesc->rx_tid.hw_qdesc_vaddr_unaligned;
  3004. desc->free_ts = qdf_get_system_timestamp();
  3005. DP_RX_REO_QDESC_DEFERRED_GET_MAC(desc, freedesc);
  3006. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  3007. if (!soc->reo_desc_deferred_freelist_init) {
  3008. qdf_mem_free(desc);
  3009. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  3010. return false;
  3011. }
  3012. qdf_list_insert_back(&soc->reo_desc_deferred_freelist,
  3013. (qdf_list_node_t *)desc);
  3014. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  3015. return true;
  3016. }
  3017. /*
  3018. * dp_reo_desc_defer_free() - free the REO QDESC in the deferred list
  3019. * based on time threshold
  3020. * @soc: Datapath soc handle
  3021. * @free_desc: REO DESC reference that needs to be freed
  3022. *
  3023. * Return: true if enqueued, else false
  3024. */
  3025. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  3026. {
  3027. struct reo_desc_deferred_freelist_node *desc;
  3028. unsigned long curr_ts = qdf_get_system_timestamp();
  3029. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  3030. while ((qdf_list_peek_front(&soc->reo_desc_deferred_freelist,
  3031. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  3032. (curr_ts > (desc->free_ts + REO_DESC_DEFERRED_FREE_MS))) {
  3033. qdf_list_remove_front(&soc->reo_desc_deferred_freelist,
  3034. (qdf_list_node_t **)&desc);
  3035. DP_RX_REO_QDESC_DEFERRED_FREE_EVT(desc);
  3036. qdf_mem_unmap_nbytes_single(soc->osdev,
  3037. desc->hw_qdesc_paddr,
  3038. QDF_DMA_BIDIRECTIONAL,
  3039. desc->hw_qdesc_alloc_size);
  3040. qdf_mem_free(desc->hw_qdesc_vaddr_unaligned);
  3041. qdf_mem_free(desc);
  3042. curr_ts = qdf_get_system_timestamp();
  3043. }
  3044. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  3045. }
  3046. #else
  3047. static inline bool
  3048. dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  3049. struct reo_desc_list_node *freedesc)
  3050. {
  3051. return false;
  3052. }
  3053. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  3054. {
  3055. }
  3056. #endif /* !WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY */
  3057. /*
  3058. * dp_reo_desc_free() - Callback free reo descriptor memory after
  3059. * HW cache flush
  3060. *
  3061. * @soc: DP SOC handle
  3062. * @cb_ctxt: Callback context
  3063. * @reo_status: REO command status
  3064. */
  3065. static void dp_reo_desc_free(struct dp_soc *soc, void *cb_ctxt,
  3066. union hal_reo_status *reo_status)
  3067. {
  3068. struct reo_desc_list_node *freedesc =
  3069. (struct reo_desc_list_node *)cb_ctxt;
  3070. struct dp_rx_tid *rx_tid = &freedesc->rx_tid;
  3071. unsigned long curr_ts = qdf_get_system_timestamp();
  3072. if ((reo_status->fl_cache_status.header.status !=
  3073. HAL_REO_CMD_SUCCESS) &&
  3074. (reo_status->fl_cache_status.header.status !=
  3075. HAL_REO_CMD_DRAIN)) {
  3076. dp_peer_err("%pK: Rx tid HW desc flush failed(%d): tid %d",
  3077. soc, reo_status->rx_queue_status.header.status,
  3078. freedesc->rx_tid.tid);
  3079. }
  3080. dp_peer_info("%pK: %lu hw_qdesc_paddr: %pK, tid:%d", soc,
  3081. curr_ts, (void *)(rx_tid->hw_qdesc_paddr),
  3082. rx_tid->tid);
  3083. /* REO desc is enqueued to be freed at a later point
  3084. * in time, just free the freedesc alone and return
  3085. */
  3086. if (dp_reo_desc_defer_free_enqueue(soc, freedesc))
  3087. goto out;
  3088. DP_RX_REO_QDESC_FREE_EVT(freedesc);
  3089. qdf_mem_unmap_nbytes_single(soc->osdev,
  3090. rx_tid->hw_qdesc_paddr,
  3091. QDF_DMA_BIDIRECTIONAL,
  3092. rx_tid->hw_qdesc_alloc_size);
  3093. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3094. out:
  3095. qdf_mem_free(freedesc);
  3096. }
  3097. #if defined(CONFIG_WIFI_EMULATION_WIFI_3_0) && defined(BUILD_X86)
  3098. /* Hawkeye emulation requires bus address to be >= 0x50000000 */
  3099. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  3100. {
  3101. if (dma_addr < 0x50000000)
  3102. return QDF_STATUS_E_FAILURE;
  3103. else
  3104. return QDF_STATUS_SUCCESS;
  3105. }
  3106. #else
  3107. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  3108. {
  3109. return QDF_STATUS_SUCCESS;
  3110. }
  3111. #endif
  3112. /*
  3113. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  3114. * @peer: Datapath peer handle
  3115. * @tid: TID
  3116. * @ba_window_size: BlockAck window size
  3117. * @start_seq: Starting sequence number
  3118. *
  3119. * Return: QDF_STATUS code
  3120. */
  3121. QDF_STATUS dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  3122. uint32_t ba_window_size, uint32_t start_seq)
  3123. {
  3124. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  3125. struct dp_vdev *vdev = peer->vdev;
  3126. struct dp_soc *soc = vdev->pdev->soc;
  3127. uint32_t hw_qdesc_size;
  3128. uint32_t hw_qdesc_align;
  3129. int hal_pn_type;
  3130. void *hw_qdesc_vaddr;
  3131. uint32_t alloc_tries = 0;
  3132. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3133. struct dp_txrx_peer *txrx_peer;
  3134. if (!qdf_atomic_read(&peer->is_default_route_set))
  3135. return QDF_STATUS_E_FAILURE;
  3136. if (!dp_rx_tid_setup_allow(peer)) {
  3137. dp_peer_info("skip rx tid setup for peer" QDF_MAC_ADDR_FMT,
  3138. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  3139. goto send_wmi_reo_cmd;
  3140. }
  3141. rx_tid->ba_win_size = ba_window_size;
  3142. if (rx_tid->hw_qdesc_vaddr_unaligned)
  3143. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  3144. start_seq, false);
  3145. rx_tid->delba_tx_status = 0;
  3146. rx_tid->ppdu_id_2k = 0;
  3147. rx_tid->num_of_addba_req = 0;
  3148. rx_tid->num_of_delba_req = 0;
  3149. rx_tid->num_of_addba_resp = 0;
  3150. rx_tid->num_addba_rsp_failed = 0;
  3151. rx_tid->num_addba_rsp_success = 0;
  3152. rx_tid->delba_tx_success_cnt = 0;
  3153. rx_tid->delba_tx_fail_cnt = 0;
  3154. rx_tid->statuscode = 0;
  3155. /* TODO: Allocating HW queue descriptors based on max BA window size
  3156. * for all QOS TIDs so that same descriptor can be used later when
  3157. * ADDBA request is received. This should be changed to allocate HW
  3158. * queue descriptors based on BA window size being negotiated (0 for
  3159. * non BA cases), and reallocate when BA window size changes and also
  3160. * send WMI message to FW to change the REO queue descriptor in Rx
  3161. * peer entry as part of dp_rx_tid_update.
  3162. */
  3163. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  3164. ba_window_size, tid);
  3165. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  3166. /* To avoid unnecessary extra allocation for alignment, try allocating
  3167. * exact size and see if we already have aligned address.
  3168. */
  3169. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  3170. try_desc_alloc:
  3171. rx_tid->hw_qdesc_vaddr_unaligned =
  3172. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size);
  3173. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  3174. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  3175. soc, tid);
  3176. return QDF_STATUS_E_NOMEM;
  3177. }
  3178. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  3179. hw_qdesc_align) {
  3180. /* Address allocated above is not aligned. Allocate extra
  3181. * memory for alignment
  3182. */
  3183. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3184. rx_tid->hw_qdesc_vaddr_unaligned =
  3185. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size +
  3186. hw_qdesc_align - 1);
  3187. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  3188. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  3189. soc, tid);
  3190. return QDF_STATUS_E_NOMEM;
  3191. }
  3192. hw_qdesc_vaddr = (void *)qdf_align((unsigned long)
  3193. rx_tid->hw_qdesc_vaddr_unaligned,
  3194. hw_qdesc_align);
  3195. dp_peer_debug("%pK: Total Size %d Aligned Addr %pK",
  3196. soc, rx_tid->hw_qdesc_alloc_size,
  3197. hw_qdesc_vaddr);
  3198. } else {
  3199. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  3200. }
  3201. rx_tid->hw_qdesc_vaddr_aligned = hw_qdesc_vaddr;
  3202. txrx_peer = dp_get_txrx_peer(peer);
  3203. /* TODO: Ensure that sec_type is set before ADDBA is received.
  3204. * Currently this is set based on htt indication
  3205. * HTT_T2H_MSG_TYPE_SEC_IND from target
  3206. */
  3207. switch (txrx_peer->security[dp_sec_ucast].sec_type) {
  3208. case cdp_sec_type_tkip_nomic:
  3209. case cdp_sec_type_aes_ccmp:
  3210. case cdp_sec_type_aes_ccmp_256:
  3211. case cdp_sec_type_aes_gcmp:
  3212. case cdp_sec_type_aes_gcmp_256:
  3213. hal_pn_type = HAL_PN_WPA;
  3214. break;
  3215. case cdp_sec_type_wapi:
  3216. if (vdev->opmode == wlan_op_mode_ap)
  3217. hal_pn_type = HAL_PN_WAPI_EVEN;
  3218. else
  3219. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  3220. break;
  3221. default:
  3222. hal_pn_type = HAL_PN_NONE;
  3223. break;
  3224. }
  3225. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  3226. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type,
  3227. vdev->vdev_stats_id);
  3228. qdf_mem_map_nbytes_single(soc->osdev, hw_qdesc_vaddr,
  3229. QDF_DMA_BIDIRECTIONAL, rx_tid->hw_qdesc_alloc_size,
  3230. &(rx_tid->hw_qdesc_paddr));
  3231. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) !=
  3232. QDF_STATUS_SUCCESS) {
  3233. if (alloc_tries++ < 10) {
  3234. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3235. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3236. goto try_desc_alloc;
  3237. } else {
  3238. dp_peer_err("%pK: Rx tid HW desc alloc failed (lowmem): tid %d",
  3239. soc, tid);
  3240. status = QDF_STATUS_E_NOMEM;
  3241. goto error;
  3242. }
  3243. }
  3244. send_wmi_reo_cmd:
  3245. if (dp_get_peer_vdev_roaming_in_progress(peer)) {
  3246. status = QDF_STATUS_E_PERM;
  3247. goto error;
  3248. }
  3249. status = dp_peer_rx_reorder_queue_setup(soc, peer,
  3250. tid, ba_window_size);
  3251. if (QDF_IS_STATUS_SUCCESS(status))
  3252. return status;
  3253. error:
  3254. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  3255. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) ==
  3256. QDF_STATUS_SUCCESS)
  3257. qdf_mem_unmap_nbytes_single(
  3258. soc->osdev,
  3259. rx_tid->hw_qdesc_paddr,
  3260. QDF_DMA_BIDIRECTIONAL,
  3261. rx_tid->hw_qdesc_alloc_size);
  3262. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3263. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3264. rx_tid->hw_qdesc_paddr = 0;
  3265. }
  3266. return status;
  3267. }
  3268. #ifdef DP_UMAC_HW_RESET_SUPPORT
  3269. static
  3270. void dp_peer_rst_tids(struct dp_soc *soc, struct dp_peer *peer, void *arg)
  3271. {
  3272. int tid;
  3273. for (tid = 0; tid < (DP_MAX_TIDS - 1); tid++) {
  3274. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  3275. void *vaddr = rx_tid->hw_qdesc_vaddr_aligned;
  3276. if (vaddr)
  3277. dp_reset_rx_reo_tid_queue(soc, vaddr,
  3278. rx_tid->hw_qdesc_alloc_size);
  3279. }
  3280. }
  3281. void dp_reset_tid_q_setup(struct dp_soc *soc)
  3282. {
  3283. dp_soc_iterate_peer(soc, dp_peer_rst_tids, NULL, DP_MOD_ID_UMAC_RESET);
  3284. }
  3285. #endif
  3286. #ifdef REO_DESC_DEFER_FREE
  3287. /*
  3288. * dp_reo_desc_clean_up() - If cmd to flush base desc fails add
  3289. * desc back to freelist and defer the deletion
  3290. *
  3291. * @soc: DP SOC handle
  3292. * @desc: Base descriptor to be freed
  3293. * @reo_status: REO command status
  3294. */
  3295. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3296. struct reo_desc_list_node *desc,
  3297. union hal_reo_status *reo_status)
  3298. {
  3299. desc->free_ts = qdf_get_system_timestamp();
  3300. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3301. qdf_list_insert_back(&soc->reo_desc_freelist,
  3302. (qdf_list_node_t *)desc);
  3303. }
  3304. /*
  3305. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3306. * ring in avoid of REO hang
  3307. *
  3308. * @list_size: REO desc list size to be cleaned
  3309. */
  3310. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3311. {
  3312. unsigned long curr_ts = qdf_get_system_timestamp();
  3313. if ((*list_size) > REO_DESC_FREELIST_SIZE) {
  3314. dp_err_log("%lu:freedesc number %d in freelist",
  3315. curr_ts, *list_size);
  3316. /* limit the batch queue size */
  3317. *list_size = REO_DESC_FREELIST_SIZE;
  3318. }
  3319. }
  3320. #else
  3321. /*
  3322. * dp_reo_desc_clean_up() - If send cmd to REO inorder to flush
  3323. * cache fails free the base REO desc anyway
  3324. *
  3325. * @soc: DP SOC handle
  3326. * @desc: Base descriptor to be freed
  3327. * @reo_status: REO command status
  3328. */
  3329. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3330. struct reo_desc_list_node *desc,
  3331. union hal_reo_status *reo_status)
  3332. {
  3333. if (reo_status) {
  3334. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3335. reo_status->fl_cache_status.header.status = 0;
  3336. dp_reo_desc_free(soc, (void *)desc, reo_status);
  3337. }
  3338. }
  3339. /*
  3340. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3341. * ring in avoid of REO hang
  3342. *
  3343. * @list_size: REO desc list size to be cleaned
  3344. */
  3345. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3346. {
  3347. }
  3348. #endif
  3349. /*
  3350. * dp_resend_update_reo_cmd() - Resend the UPDATE_REO_QUEUE
  3351. * cmd and re-insert desc into free list if send fails.
  3352. *
  3353. * @soc: DP SOC handle
  3354. * @desc: desc with resend update cmd flag set
  3355. * @rx_tid: Desc RX tid associated with update cmd for resetting
  3356. * valid field to 0 in h/w
  3357. *
  3358. * Return: QDF status
  3359. */
  3360. static QDF_STATUS
  3361. dp_resend_update_reo_cmd(struct dp_soc *soc,
  3362. struct reo_desc_list_node *desc,
  3363. struct dp_rx_tid *rx_tid)
  3364. {
  3365. struct hal_reo_cmd_params params;
  3366. qdf_mem_zero(&params, sizeof(params));
  3367. params.std.need_status = 1;
  3368. params.std.addr_lo =
  3369. rx_tid->hw_qdesc_paddr & 0xffffffff;
  3370. params.std.addr_hi =
  3371. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3372. params.u.upd_queue_params.update_vld = 1;
  3373. params.u.upd_queue_params.vld = 0;
  3374. desc->resend_update_reo_cmd = false;
  3375. /*
  3376. * If the cmd send fails then set resend_update_reo_cmd flag
  3377. * and insert the desc at the end of the free list to retry.
  3378. */
  3379. if (dp_reo_send_cmd(soc,
  3380. CMD_UPDATE_RX_REO_QUEUE,
  3381. &params,
  3382. dp_rx_tid_delete_cb,
  3383. (void *)desc)
  3384. != QDF_STATUS_SUCCESS) {
  3385. desc->resend_update_reo_cmd = true;
  3386. desc->free_ts = qdf_get_system_timestamp();
  3387. qdf_list_insert_back(&soc->reo_desc_freelist,
  3388. (qdf_list_node_t *)desc);
  3389. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  3390. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3391. return QDF_STATUS_E_FAILURE;
  3392. }
  3393. return QDF_STATUS_SUCCESS;
  3394. }
  3395. /*
  3396. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  3397. * after deleting the entries (ie., setting valid=0)
  3398. *
  3399. * @soc: DP SOC handle
  3400. * @cb_ctxt: Callback context
  3401. * @reo_status: REO command status
  3402. */
  3403. void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  3404. union hal_reo_status *reo_status)
  3405. {
  3406. struct reo_desc_list_node *freedesc =
  3407. (struct reo_desc_list_node *)cb_ctxt;
  3408. uint32_t list_size;
  3409. struct reo_desc_list_node *desc;
  3410. unsigned long curr_ts = qdf_get_system_timestamp();
  3411. uint32_t desc_size, tot_desc_size;
  3412. struct hal_reo_cmd_params params;
  3413. bool flush_failure = false;
  3414. DP_RX_REO_QDESC_UPDATE_EVT(freedesc);
  3415. if (reo_status->rx_queue_status.header.status == HAL_REO_CMD_DRAIN) {
  3416. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3417. reo_status->fl_cache_status.header.status = HAL_REO_CMD_DRAIN;
  3418. dp_reo_desc_free(soc, (void *)freedesc, reo_status);
  3419. DP_STATS_INC(soc, rx.err.reo_cmd_send_drain, 1);
  3420. return;
  3421. } else if (reo_status->rx_queue_status.header.status !=
  3422. HAL_REO_CMD_SUCCESS) {
  3423. /* Should not happen normally. Just print error for now */
  3424. dp_info_rl("Rx tid HW desc deletion failed(%d): tid %d",
  3425. reo_status->rx_queue_status.header.status,
  3426. freedesc->rx_tid.tid);
  3427. }
  3428. dp_peer_info("%pK: rx_tid: %d status: %d",
  3429. soc, freedesc->rx_tid.tid,
  3430. reo_status->rx_queue_status.header.status);
  3431. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3432. freedesc->free_ts = curr_ts;
  3433. qdf_list_insert_back_size(&soc->reo_desc_freelist,
  3434. (qdf_list_node_t *)freedesc, &list_size);
  3435. /* MCL path add the desc back to reo_desc_freelist when REO FLUSH
  3436. * failed. it may cause the number of REO queue pending in free
  3437. * list is even larger than REO_CMD_RING max size and lead REO CMD
  3438. * flood then cause REO HW in an unexpected condition. So it's
  3439. * needed to limit the number REO cmds in a batch operation.
  3440. */
  3441. dp_reo_limit_clean_batch_sz(&list_size);
  3442. while ((qdf_list_peek_front(&soc->reo_desc_freelist,
  3443. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  3444. ((list_size >= REO_DESC_FREELIST_SIZE) ||
  3445. (curr_ts > (desc->free_ts + REO_DESC_FREE_DEFER_MS)) ||
  3446. (desc->resend_update_reo_cmd && list_size))) {
  3447. struct dp_rx_tid *rx_tid;
  3448. qdf_list_remove_front(&soc->reo_desc_freelist,
  3449. (qdf_list_node_t **)&desc);
  3450. list_size--;
  3451. rx_tid = &desc->rx_tid;
  3452. /* First process descs with resend_update_reo_cmd set */
  3453. if (desc->resend_update_reo_cmd) {
  3454. if (dp_resend_update_reo_cmd(soc, desc, rx_tid) !=
  3455. QDF_STATUS_SUCCESS)
  3456. break;
  3457. else
  3458. continue;
  3459. }
  3460. /* Flush and invalidate REO descriptor from HW cache: Base and
  3461. * extension descriptors should be flushed separately */
  3462. if (desc->pending_ext_desc_size)
  3463. tot_desc_size = desc->pending_ext_desc_size;
  3464. else
  3465. tot_desc_size = rx_tid->hw_qdesc_alloc_size;
  3466. /* Get base descriptor size by passing non-qos TID */
  3467. desc_size = hal_get_reo_qdesc_size(soc->hal_soc, 0,
  3468. DP_NON_QOS_TID);
  3469. /* Flush reo extension descriptors */
  3470. while ((tot_desc_size -= desc_size) > 0) {
  3471. qdf_mem_zero(&params, sizeof(params));
  3472. params.std.addr_lo =
  3473. ((uint64_t)(rx_tid->hw_qdesc_paddr) +
  3474. tot_desc_size) & 0xffffffff;
  3475. params.std.addr_hi =
  3476. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3477. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3478. CMD_FLUSH_CACHE,
  3479. &params,
  3480. NULL,
  3481. NULL)) {
  3482. dp_info_rl("fail to send CMD_CACHE_FLUSH:"
  3483. "tid %d desc %pK", rx_tid->tid,
  3484. (void *)(rx_tid->hw_qdesc_paddr));
  3485. desc->pending_ext_desc_size = tot_desc_size +
  3486. desc_size;
  3487. dp_reo_desc_clean_up(soc, desc, reo_status);
  3488. flush_failure = true;
  3489. break;
  3490. }
  3491. }
  3492. if (flush_failure)
  3493. break;
  3494. else
  3495. desc->pending_ext_desc_size = desc_size;
  3496. /* Flush base descriptor */
  3497. qdf_mem_zero(&params, sizeof(params));
  3498. params.std.need_status = 1;
  3499. params.std.addr_lo =
  3500. (uint64_t)(rx_tid->hw_qdesc_paddr) & 0xffffffff;
  3501. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3502. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3503. CMD_FLUSH_CACHE,
  3504. &params,
  3505. dp_reo_desc_free,
  3506. (void *)desc)) {
  3507. union hal_reo_status reo_status;
  3508. /*
  3509. * If dp_reo_send_cmd return failure, related TID queue desc
  3510. * should be unmapped. Also locally reo_desc, together with
  3511. * TID queue desc also need to be freed accordingly.
  3512. *
  3513. * Here invoke desc_free function directly to do clean up.
  3514. *
  3515. * In case of MCL path add the desc back to the free
  3516. * desc list and defer deletion.
  3517. */
  3518. dp_info_rl("fail to send REO cmd to flush cache: tid %d",
  3519. rx_tid->tid);
  3520. dp_reo_desc_clean_up(soc, desc, &reo_status);
  3521. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3522. break;
  3523. }
  3524. }
  3525. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3526. dp_reo_desc_defer_free(soc);
  3527. }
  3528. /*
  3529. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  3530. * @peer: Datapath peer handle
  3531. * @tid: TID
  3532. *
  3533. * Return: 0 on success, error code on failure
  3534. */
  3535. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  3536. {
  3537. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  3538. struct dp_soc *soc = peer->vdev->pdev->soc;
  3539. struct hal_reo_cmd_params params;
  3540. struct reo_desc_list_node *freedesc =
  3541. qdf_mem_malloc(sizeof(*freedesc));
  3542. if (!freedesc) {
  3543. dp_peer_err("%pK: malloc failed for freedesc: tid %d",
  3544. soc, tid);
  3545. qdf_assert(0);
  3546. return -ENOMEM;
  3547. }
  3548. freedesc->rx_tid = *rx_tid;
  3549. freedesc->resend_update_reo_cmd = false;
  3550. qdf_mem_zero(&params, sizeof(params));
  3551. DP_RX_REO_QDESC_GET_MAC(freedesc, peer);
  3552. params.std.need_status = 1;
  3553. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  3554. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3555. params.u.upd_queue_params.update_vld = 1;
  3556. params.u.upd_queue_params.vld = 0;
  3557. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  3558. dp_rx_tid_delete_cb, (void *)freedesc)
  3559. != QDF_STATUS_SUCCESS) {
  3560. /* Defer the clean up to the call back context */
  3561. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3562. freedesc->free_ts = qdf_get_system_timestamp();
  3563. freedesc->resend_update_reo_cmd = true;
  3564. qdf_list_insert_front(&soc->reo_desc_freelist,
  3565. (qdf_list_node_t *)freedesc);
  3566. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3567. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3568. dp_info("Failed to send CMD_UPDATE_RX_REO_QUEUE");
  3569. }
  3570. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3571. rx_tid->hw_qdesc_alloc_size = 0;
  3572. rx_tid->hw_qdesc_paddr = 0;
  3573. return 0;
  3574. }
  3575. #ifdef DP_LFR
  3576. static void dp_peer_setup_remaining_tids(struct dp_peer *peer)
  3577. {
  3578. int tid;
  3579. for (tid = 1; tid < DP_MAX_TIDS-1; tid++) {
  3580. dp_rx_tid_setup_wifi3(peer, tid, 1, 0);
  3581. dp_peer_debug("Setting up TID %d for peer %pK peer->local_id %d",
  3582. tid, peer, peer->local_id);
  3583. }
  3584. }
  3585. #else
  3586. static void dp_peer_setup_remaining_tids(struct dp_peer *peer) {};
  3587. #endif
  3588. #ifdef WLAN_FEATURE_11BE_MLO
  3589. /**
  3590. * dp_peer_rx_tids_init() - initialize each tids in peer
  3591. * @peer: peer pointer
  3592. *
  3593. * Return: None
  3594. */
  3595. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3596. {
  3597. int tid;
  3598. struct dp_rx_tid *rx_tid;
  3599. struct dp_rx_tid_defrag *rx_tid_defrag;
  3600. if (!IS_MLO_DP_LINK_PEER(peer)) {
  3601. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3602. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3603. rx_tid_defrag->array = &rx_tid_defrag->base;
  3604. rx_tid_defrag->defrag_timeout_ms = 0;
  3605. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3606. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3607. rx_tid_defrag->base.head = NULL;
  3608. rx_tid_defrag->base.tail = NULL;
  3609. rx_tid_defrag->tid = tid;
  3610. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3611. }
  3612. }
  3613. /* if not first assoc link peer,
  3614. * not to initialize rx_tids again.
  3615. */
  3616. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  3617. return;
  3618. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3619. rx_tid = &peer->rx_tid[tid];
  3620. rx_tid->tid = tid;
  3621. rx_tid->ba_win_size = 0;
  3622. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3623. }
  3624. }
  3625. #else
  3626. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3627. {
  3628. int tid;
  3629. struct dp_rx_tid *rx_tid;
  3630. struct dp_rx_tid_defrag *rx_tid_defrag;
  3631. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3632. rx_tid = &peer->rx_tid[tid];
  3633. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3634. rx_tid->tid = tid;
  3635. rx_tid->ba_win_size = 0;
  3636. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3637. rx_tid_defrag->base.head = NULL;
  3638. rx_tid_defrag->base.tail = NULL;
  3639. rx_tid_defrag->tid = tid;
  3640. rx_tid_defrag->array = &rx_tid_defrag->base;
  3641. rx_tid_defrag->defrag_timeout_ms = 0;
  3642. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3643. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3644. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3645. }
  3646. }
  3647. #endif
  3648. /*
  3649. * dp_peer_rx_init() – Initialize receive TID state
  3650. * @pdev: Datapath pdev
  3651. * @peer: Datapath peer
  3652. *
  3653. */
  3654. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  3655. {
  3656. dp_peer_rx_tids_init(peer);
  3657. peer->active_ba_session_cnt = 0;
  3658. peer->hw_buffer_size = 0;
  3659. peer->kill_256_sessions = 0;
  3660. /* Setup default (non-qos) rx tid queue */
  3661. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  3662. /* Setup rx tid queue for TID 0.
  3663. * Other queues will be setup on receiving first packet, which will cause
  3664. * NULL REO queue error
  3665. */
  3666. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  3667. /*
  3668. * Setup the rest of TID's to handle LFR
  3669. */
  3670. dp_peer_setup_remaining_tids(peer);
  3671. /*
  3672. * Set security defaults: no PN check, no security. The target may
  3673. * send a HTT SEC_IND message to overwrite these defaults.
  3674. */
  3675. if (peer->txrx_peer)
  3676. peer->txrx_peer->security[dp_sec_ucast].sec_type =
  3677. peer->txrx_peer->security[dp_sec_mcast].sec_type =
  3678. cdp_sec_type_none;
  3679. }
  3680. /*
  3681. * dp_peer_rx_cleanup() – Cleanup receive TID state
  3682. * @vdev: Datapath vdev
  3683. * @peer: Datapath peer
  3684. *
  3685. */
  3686. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3687. {
  3688. int tid;
  3689. uint32_t tid_delete_mask = 0;
  3690. if (!peer->txrx_peer)
  3691. return;
  3692. dp_info("Remove tids for peer: %pK", peer);
  3693. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3694. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  3695. struct dp_rx_tid_defrag *defrag_rx_tid =
  3696. &peer->txrx_peer->rx_tid[tid];
  3697. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  3698. if (!peer->bss_peer || peer->vdev->opmode == wlan_op_mode_sta) {
  3699. /* Cleanup defrag related resource */
  3700. dp_rx_defrag_waitlist_remove(peer->txrx_peer, tid);
  3701. dp_rx_reorder_flush_frag(peer->txrx_peer, tid);
  3702. }
  3703. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  3704. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3705. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned) {
  3706. dp_rx_tid_delete_wifi3(peer, tid);
  3707. tid_delete_mask |= (1 << tid);
  3708. }
  3709. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3710. }
  3711. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  3712. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  3713. soc->ol_ops->peer_rx_reorder_queue_remove(soc->ctrl_psoc,
  3714. peer->vdev->pdev->pdev_id,
  3715. peer->vdev->vdev_id, peer->mac_addr.raw,
  3716. tid_delete_mask);
  3717. }
  3718. #endif
  3719. }
  3720. /*
  3721. * dp_peer_cleanup() – Cleanup peer information
  3722. * @vdev: Datapath vdev
  3723. * @peer: Datapath peer
  3724. *
  3725. */
  3726. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3727. {
  3728. enum wlan_op_mode vdev_opmode;
  3729. uint8_t vdev_mac_addr[QDF_MAC_ADDR_SIZE];
  3730. struct dp_pdev *pdev = vdev->pdev;
  3731. struct dp_soc *soc = pdev->soc;
  3732. /* save vdev related member in case vdev freed */
  3733. vdev_opmode = vdev->opmode;
  3734. if (!IS_MLO_DP_MLD_PEER(peer))
  3735. dp_monitor_peer_tx_cleanup(vdev, peer);
  3736. if (vdev_opmode != wlan_op_mode_monitor)
  3737. /* cleanup the Rx reorder queues for this peer */
  3738. dp_peer_rx_cleanup(vdev, peer);
  3739. dp_peer_rx_tids_destroy(peer);
  3740. if (IS_MLO_DP_LINK_PEER(peer))
  3741. dp_link_peer_del_mld_peer(peer);
  3742. if (IS_MLO_DP_MLD_PEER(peer))
  3743. dp_mld_peer_deinit_link_peers_info(peer);
  3744. qdf_mem_copy(vdev_mac_addr, vdev->mac_addr.raw,
  3745. QDF_MAC_ADDR_SIZE);
  3746. if (soc->cdp_soc.ol_ops->peer_unref_delete)
  3747. soc->cdp_soc.ol_ops->peer_unref_delete(
  3748. soc->ctrl_psoc,
  3749. vdev->pdev->pdev_id,
  3750. peer->mac_addr.raw, vdev_mac_addr,
  3751. vdev_opmode);
  3752. }
  3753. /* dp_teardown_256_ba_session() - Teardown sessions using 256
  3754. * window size when a request with
  3755. * 64 window size is received.
  3756. * This is done as a WAR since HW can
  3757. * have only one setting per peer (64 or 256).
  3758. * For HKv2, we use per tid buffersize setting
  3759. * for 0 to per_tid_basize_max_tid. For tid
  3760. * more than per_tid_basize_max_tid we use HKv1
  3761. * method.
  3762. * @peer: Datapath peer
  3763. *
  3764. * Return: void
  3765. */
  3766. static void dp_teardown_256_ba_sessions(struct dp_peer *peer)
  3767. {
  3768. uint8_t delba_rcode = 0;
  3769. int tid;
  3770. struct dp_rx_tid *rx_tid = NULL;
  3771. tid = peer->vdev->pdev->soc->per_tid_basize_max_tid;
  3772. for (; tid < DP_MAX_TIDS; tid++) {
  3773. rx_tid = &peer->rx_tid[tid];
  3774. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3775. if (rx_tid->ba_win_size <= 64) {
  3776. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3777. continue;
  3778. } else {
  3779. if (rx_tid->ba_status == DP_RX_BA_ACTIVE ||
  3780. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3781. /* send delba */
  3782. if (!rx_tid->delba_tx_status) {
  3783. rx_tid->delba_tx_retry++;
  3784. rx_tid->delba_tx_status = 1;
  3785. rx_tid->delba_rcode =
  3786. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  3787. delba_rcode = rx_tid->delba_rcode;
  3788. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3789. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  3790. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  3791. peer->vdev->pdev->soc->ctrl_psoc,
  3792. peer->vdev->vdev_id,
  3793. peer->mac_addr.raw,
  3794. tid, delba_rcode,
  3795. CDP_DELBA_REASON_NONE);
  3796. } else {
  3797. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3798. }
  3799. } else {
  3800. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3801. }
  3802. }
  3803. }
  3804. }
  3805. /*
  3806. * dp_rx_addba_resp_tx_completion_wifi3() – Update Rx Tid State
  3807. *
  3808. * @soc: Datapath soc handle
  3809. * @peer_mac: Datapath peer mac address
  3810. * @vdev_id: id of atapath vdev
  3811. * @tid: TID number
  3812. * @status: tx completion status
  3813. * Return: 0 on success, error code on failure
  3814. */
  3815. int dp_addba_resp_tx_completion_wifi3(struct cdp_soc_t *cdp_soc,
  3816. uint8_t *peer_mac,
  3817. uint16_t vdev_id,
  3818. uint8_t tid, int status)
  3819. {
  3820. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3821. (struct dp_soc *)cdp_soc,
  3822. peer_mac, 0, vdev_id,
  3823. DP_MOD_ID_CDP);
  3824. struct dp_rx_tid *rx_tid = NULL;
  3825. if (!peer) {
  3826. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3827. goto fail;
  3828. }
  3829. rx_tid = &peer->rx_tid[tid];
  3830. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3831. if (status) {
  3832. rx_tid->num_addba_rsp_failed++;
  3833. if (rx_tid->hw_qdesc_vaddr_unaligned)
  3834. dp_rx_tid_update_wifi3(peer, tid, 1,
  3835. IEEE80211_SEQ_MAX, false);
  3836. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3837. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3838. dp_err("RxTid- %d addba rsp tx completion failed", tid);
  3839. goto success;
  3840. }
  3841. rx_tid->num_addba_rsp_success++;
  3842. if (rx_tid->ba_status == DP_RX_BA_INACTIVE) {
  3843. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3844. dp_peer_err("%pK: Rx Tid- %d hw qdesc is not in IN_PROGRESS",
  3845. cdp_soc, tid);
  3846. goto fail;
  3847. }
  3848. if (!qdf_atomic_read(&peer->is_default_route_set)) {
  3849. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3850. dp_peer_debug("%pK: default route is not set for peer: " QDF_MAC_ADDR_FMT,
  3851. cdp_soc, QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  3852. goto fail;
  3853. }
  3854. if (dp_rx_tid_update_wifi3(peer, tid,
  3855. rx_tid->ba_win_size,
  3856. rx_tid->startseqnum,
  3857. false)) {
  3858. dp_err("Failed update REO SSN");
  3859. }
  3860. dp_info("tid %u window_size %u start_seq_num %u",
  3861. tid, rx_tid->ba_win_size,
  3862. rx_tid->startseqnum);
  3863. /* First Session */
  3864. if (peer->active_ba_session_cnt == 0) {
  3865. if (rx_tid->ba_win_size > 64 && rx_tid->ba_win_size <= 256)
  3866. peer->hw_buffer_size = 256;
  3867. else if (rx_tid->ba_win_size <= 1024 &&
  3868. rx_tid->ba_win_size > 256)
  3869. peer->hw_buffer_size = 1024;
  3870. else
  3871. peer->hw_buffer_size = 64;
  3872. }
  3873. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  3874. peer->active_ba_session_cnt++;
  3875. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3876. /* Kill any session having 256 buffer size
  3877. * when 64 buffer size request is received.
  3878. * Also, latch on to 64 as new buffer size.
  3879. */
  3880. if (peer->kill_256_sessions) {
  3881. dp_teardown_256_ba_sessions(peer);
  3882. peer->kill_256_sessions = 0;
  3883. }
  3884. success:
  3885. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3886. return QDF_STATUS_SUCCESS;
  3887. fail:
  3888. if (peer)
  3889. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3890. return QDF_STATUS_E_FAILURE;
  3891. }
  3892. /*
  3893. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  3894. *
  3895. * @soc: Datapath soc handle
  3896. * @peer_mac: Datapath peer mac address
  3897. * @vdev_id: id of atapath vdev
  3898. * @tid: TID number
  3899. * @dialogtoken: output dialogtoken
  3900. * @statuscode: output dialogtoken
  3901. * @buffersize: Output BA window size
  3902. * @batimeout: Output BA timeout
  3903. */
  3904. QDF_STATUS
  3905. dp_addba_responsesetup_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3906. uint16_t vdev_id, uint8_t tid,
  3907. uint8_t *dialogtoken, uint16_t *statuscode,
  3908. uint16_t *buffersize, uint16_t *batimeout)
  3909. {
  3910. struct dp_rx_tid *rx_tid = NULL;
  3911. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3912. struct dp_peer *peer = dp_peer_find_hash_find((struct dp_soc *)cdp_soc,
  3913. peer_mac, 0, vdev_id,
  3914. DP_MOD_ID_CDP);
  3915. if (!peer) {
  3916. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3917. return QDF_STATUS_E_FAILURE;
  3918. }
  3919. rx_tid = &peer->rx_tid[tid];
  3920. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3921. rx_tid->num_of_addba_resp++;
  3922. /* setup ADDBA response parameters */
  3923. *dialogtoken = rx_tid->dialogtoken;
  3924. *statuscode = rx_tid->statuscode;
  3925. *buffersize = rx_tid->ba_win_size;
  3926. *batimeout = 0;
  3927. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3928. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3929. return status;
  3930. }
  3931. /* dp_check_ba_buffersize() - Check buffer size in request
  3932. * and latch onto this size based on
  3933. * size used in first active session.
  3934. * @peer: Datapath peer
  3935. * @tid: Tid
  3936. * @buffersize: Block ack window size
  3937. *
  3938. * Return: void
  3939. */
  3940. static void dp_check_ba_buffersize(struct dp_peer *peer,
  3941. uint16_t tid,
  3942. uint16_t buffersize)
  3943. {
  3944. struct dp_rx_tid *rx_tid = NULL;
  3945. struct dp_soc *soc = peer->vdev->pdev->soc;
  3946. uint16_t max_ba_window;
  3947. max_ba_window = hal_get_rx_max_ba_window(soc->hal_soc, tid);
  3948. dp_info("Input buffersize %d, max dp allowed %d",
  3949. buffersize, max_ba_window);
  3950. /* Adjust BA window size, restrict it to max DP allowed */
  3951. buffersize = QDF_MIN(buffersize, max_ba_window);
  3952. dp_info(QDF_MAC_ADDR_FMT" per_tid_basize_max_tid %d tid %d buffersize %d hw_buffer_size %d",
  3953. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  3954. soc->per_tid_basize_max_tid, tid, buffersize,
  3955. peer->hw_buffer_size);
  3956. rx_tid = &peer->rx_tid[tid];
  3957. if (soc->per_tid_basize_max_tid &&
  3958. tid < soc->per_tid_basize_max_tid) {
  3959. rx_tid->ba_win_size = buffersize;
  3960. goto out;
  3961. } else {
  3962. if (peer->active_ba_session_cnt == 0) {
  3963. rx_tid->ba_win_size = buffersize;
  3964. } else {
  3965. if (peer->hw_buffer_size == 64) {
  3966. if (buffersize <= 64)
  3967. rx_tid->ba_win_size = buffersize;
  3968. else
  3969. rx_tid->ba_win_size = peer->hw_buffer_size;
  3970. } else if (peer->hw_buffer_size == 256) {
  3971. if (buffersize > 64) {
  3972. rx_tid->ba_win_size = buffersize;
  3973. } else {
  3974. rx_tid->ba_win_size = buffersize;
  3975. peer->hw_buffer_size = 64;
  3976. peer->kill_256_sessions = 1;
  3977. }
  3978. } else if (buffersize <= 1024) {
  3979. /**
  3980. * Above checks are only for HK V2
  3981. * Set incoming buffer size for others
  3982. */
  3983. rx_tid->ba_win_size = buffersize;
  3984. } else {
  3985. dp_err("Invalid buffer size %d", buffersize);
  3986. qdf_assert_always(0);
  3987. }
  3988. }
  3989. }
  3990. out:
  3991. dp_info("rx_tid->ba_win_size %d peer->hw_buffer_size %d peer->kill_256_sessions %d",
  3992. rx_tid->ba_win_size,
  3993. peer->hw_buffer_size,
  3994. peer->kill_256_sessions);
  3995. }
  3996. QDF_STATUS dp_rx_tid_update_ba_win_size(struct cdp_soc_t *cdp_soc,
  3997. uint8_t *peer_mac, uint16_t vdev_id,
  3998. uint8_t tid, uint16_t buffersize)
  3999. {
  4000. struct dp_rx_tid *rx_tid = NULL;
  4001. struct dp_peer *peer;
  4002. peer = dp_peer_get_tgt_peer_hash_find((struct dp_soc *)cdp_soc,
  4003. peer_mac, 0, vdev_id,
  4004. DP_MOD_ID_CDP);
  4005. if (!peer) {
  4006. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  4007. return QDF_STATUS_E_FAILURE;
  4008. }
  4009. rx_tid = &peer->rx_tid[tid];
  4010. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4011. rx_tid->ba_win_size = buffersize;
  4012. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4013. dp_info("peer "QDF_MAC_ADDR_FMT", tid %d, update BA win size to %d",
  4014. QDF_MAC_ADDR_REF(peer->mac_addr.raw), tid, buffersize);
  4015. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4016. return QDF_STATUS_SUCCESS;
  4017. }
  4018. #define DP_RX_BA_SESSION_DISABLE 1
  4019. /*
  4020. * dp_addba_requestprocess_wifi3() - Process ADDBA request from peer
  4021. *
  4022. * @soc: Datapath soc handle
  4023. * @peer_mac: Datapath peer mac address
  4024. * @vdev_id: id of atapath vdev
  4025. * @dialogtoken: dialogtoken from ADDBA frame
  4026. * @tid: TID number
  4027. * @batimeout: BA timeout
  4028. * @buffersize: BA window size
  4029. * @startseqnum: Start seq. number received in BA sequence control
  4030. *
  4031. * Return: 0 on success, error code on failure
  4032. */
  4033. int dp_addba_requestprocess_wifi3(struct cdp_soc_t *cdp_soc,
  4034. uint8_t *peer_mac,
  4035. uint16_t vdev_id,
  4036. uint8_t dialogtoken,
  4037. uint16_t tid, uint16_t batimeout,
  4038. uint16_t buffersize,
  4039. uint16_t startseqnum)
  4040. {
  4041. QDF_STATUS status = QDF_STATUS_SUCCESS;
  4042. struct dp_rx_tid *rx_tid = NULL;
  4043. struct dp_peer *peer;
  4044. peer = dp_peer_get_tgt_peer_hash_find((struct dp_soc *)cdp_soc,
  4045. peer_mac,
  4046. 0, vdev_id,
  4047. DP_MOD_ID_CDP);
  4048. if (!peer) {
  4049. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  4050. return QDF_STATUS_E_FAILURE;
  4051. }
  4052. rx_tid = &peer->rx_tid[tid];
  4053. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4054. rx_tid->num_of_addba_req++;
  4055. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE &&
  4056. rx_tid->hw_qdesc_vaddr_unaligned)) {
  4057. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  4058. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  4059. peer->active_ba_session_cnt--;
  4060. dp_peer_debug("%pK: Rx Tid- %d hw qdesc is already setup",
  4061. cdp_soc, tid);
  4062. }
  4063. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  4064. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4065. status = QDF_STATUS_E_FAILURE;
  4066. goto fail;
  4067. }
  4068. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE) {
  4069. dp_peer_info("%pK: disable BA session",
  4070. cdp_soc);
  4071. buffersize = 1;
  4072. } else if (rx_tid->rx_ba_win_size_override) {
  4073. dp_peer_info("%pK: override BA win to %d", cdp_soc,
  4074. rx_tid->rx_ba_win_size_override);
  4075. buffersize = rx_tid->rx_ba_win_size_override;
  4076. } else {
  4077. dp_peer_info("%pK: restore BA win %d based on addba req", cdp_soc,
  4078. buffersize);
  4079. }
  4080. dp_check_ba_buffersize(peer, tid, buffersize);
  4081. if (dp_rx_tid_setup_wifi3(peer, tid,
  4082. rx_tid->ba_win_size, startseqnum)) {
  4083. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  4084. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4085. status = QDF_STATUS_E_FAILURE;
  4086. goto fail;
  4087. }
  4088. rx_tid->ba_status = DP_RX_BA_IN_PROGRESS;
  4089. rx_tid->dialogtoken = dialogtoken;
  4090. rx_tid->startseqnum = startseqnum;
  4091. if (rx_tid->userstatuscode != IEEE80211_STATUS_SUCCESS)
  4092. rx_tid->statuscode = rx_tid->userstatuscode;
  4093. else
  4094. rx_tid->statuscode = IEEE80211_STATUS_SUCCESS;
  4095. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE)
  4096. rx_tid->statuscode = IEEE80211_STATUS_REFUSED;
  4097. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4098. fail:
  4099. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4100. return status;
  4101. }
  4102. /*
  4103. * dp_set_addba_response() – Set a user defined ADDBA response status code
  4104. *
  4105. * @soc: Datapath soc handle
  4106. * @peer_mac: Datapath peer mac address
  4107. * @vdev_id: id of atapath vdev
  4108. * @tid: TID number
  4109. * @statuscode: response status code to be set
  4110. */
  4111. QDF_STATUS
  4112. dp_set_addba_response(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  4113. uint16_t vdev_id, uint8_t tid, uint16_t statuscode)
  4114. {
  4115. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  4116. (struct dp_soc *)cdp_soc,
  4117. peer_mac, 0, vdev_id,
  4118. DP_MOD_ID_CDP);
  4119. struct dp_rx_tid *rx_tid;
  4120. if (!peer) {
  4121. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  4122. return QDF_STATUS_E_FAILURE;
  4123. }
  4124. rx_tid = &peer->rx_tid[tid];
  4125. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4126. rx_tid->userstatuscode = statuscode;
  4127. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4128. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4129. return QDF_STATUS_SUCCESS;
  4130. }
  4131. /*
  4132. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  4133. * @soc: Datapath soc handle
  4134. * @peer_mac: Datapath peer mac address
  4135. * @vdev_id: id of atapath vdev
  4136. * @tid: TID number
  4137. * @reasoncode: Reason code received in DELBA frame
  4138. *
  4139. * Return: 0 on success, error code on failure
  4140. */
  4141. int dp_delba_process_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  4142. uint16_t vdev_id, int tid, uint16_t reasoncode)
  4143. {
  4144. QDF_STATUS status = QDF_STATUS_SUCCESS;
  4145. struct dp_rx_tid *rx_tid;
  4146. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  4147. (struct dp_soc *)cdp_soc,
  4148. peer_mac, 0, vdev_id,
  4149. DP_MOD_ID_CDP);
  4150. if (!peer) {
  4151. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  4152. return QDF_STATUS_E_FAILURE;
  4153. }
  4154. rx_tid = &peer->rx_tid[tid];
  4155. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4156. if (rx_tid->ba_status == DP_RX_BA_INACTIVE ||
  4157. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  4158. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4159. status = QDF_STATUS_E_FAILURE;
  4160. goto fail;
  4161. }
  4162. /* TODO: See if we can delete the existing REO queue descriptor and
  4163. * replace with a new one without queue extension descript to save
  4164. * memory
  4165. */
  4166. rx_tid->delba_rcode = reasoncode;
  4167. rx_tid->num_of_delba_req++;
  4168. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  4169. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  4170. peer->active_ba_session_cnt--;
  4171. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4172. fail:
  4173. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4174. return status;
  4175. }
  4176. /*
  4177. * dp_rx_delba_tx_completion_wifi3() – Send Delba Request
  4178. *
  4179. * @soc: Datapath soc handle
  4180. * @peer_mac: Datapath peer mac address
  4181. * @vdev_id: id of atapath vdev
  4182. * @tid: TID number
  4183. * @status: tx completion status
  4184. * Return: 0 on success, error code on failure
  4185. */
  4186. int dp_delba_tx_completion_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  4187. uint16_t vdev_id,
  4188. uint8_t tid, int status)
  4189. {
  4190. QDF_STATUS ret = QDF_STATUS_SUCCESS;
  4191. struct dp_rx_tid *rx_tid = NULL;
  4192. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  4193. (struct dp_soc *)cdp_soc,
  4194. peer_mac, 0, vdev_id,
  4195. DP_MOD_ID_CDP);
  4196. if (!peer) {
  4197. dp_peer_debug("%pK: Peer is NULL!", cdp_soc);
  4198. return QDF_STATUS_E_FAILURE;
  4199. }
  4200. rx_tid = &peer->rx_tid[tid];
  4201. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4202. if (status) {
  4203. rx_tid->delba_tx_fail_cnt++;
  4204. if (rx_tid->delba_tx_retry >= DP_MAX_DELBA_RETRY) {
  4205. rx_tid->delba_tx_retry = 0;
  4206. rx_tid->delba_tx_status = 0;
  4207. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4208. } else {
  4209. rx_tid->delba_tx_retry++;
  4210. rx_tid->delba_tx_status = 1;
  4211. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4212. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  4213. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  4214. peer->vdev->pdev->soc->ctrl_psoc,
  4215. peer->vdev->vdev_id,
  4216. peer->mac_addr.raw, tid,
  4217. rx_tid->delba_rcode,
  4218. CDP_DELBA_REASON_NONE);
  4219. }
  4220. goto end;
  4221. } else {
  4222. rx_tid->delba_tx_success_cnt++;
  4223. rx_tid->delba_tx_retry = 0;
  4224. rx_tid->delba_tx_status = 0;
  4225. }
  4226. if (rx_tid->ba_status == DP_RX_BA_ACTIVE) {
  4227. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  4228. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  4229. peer->active_ba_session_cnt--;
  4230. }
  4231. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  4232. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  4233. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  4234. }
  4235. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4236. end:
  4237. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4238. return ret;
  4239. }
  4240. /**
  4241. * dp_set_pn_check_wifi3() - enable PN check in REO for security
  4242. * @soc: Datapath soc handle
  4243. * @peer_mac: Datapath peer mac address
  4244. * @vdev_id: id of atapath vdev
  4245. * @vdev: Datapath vdev
  4246. * @pdev - data path device instance
  4247. * @sec_type - security type
  4248. * @rx_pn - Receive pn starting number
  4249. *
  4250. */
  4251. QDF_STATUS
  4252. dp_set_pn_check_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  4253. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  4254. uint32_t *rx_pn)
  4255. {
  4256. struct dp_pdev *pdev;
  4257. int i;
  4258. uint8_t pn_size;
  4259. struct hal_reo_cmd_params params;
  4260. struct dp_peer *peer = NULL;
  4261. struct dp_vdev *vdev = NULL;
  4262. peer = dp_peer_find_hash_find((struct dp_soc *)soc,
  4263. peer_mac, 0, vdev_id,
  4264. DP_MOD_ID_CDP);
  4265. if (!peer) {
  4266. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  4267. return QDF_STATUS_E_FAILURE;
  4268. }
  4269. vdev = peer->vdev;
  4270. if (!vdev) {
  4271. dp_peer_debug("%pK: VDEV is NULL!\n", soc);
  4272. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4273. return QDF_STATUS_E_FAILURE;
  4274. }
  4275. pdev = vdev->pdev;
  4276. qdf_mem_zero(&params, sizeof(params));
  4277. params.std.need_status = 1;
  4278. params.u.upd_queue_params.update_pn_valid = 1;
  4279. params.u.upd_queue_params.update_pn_size = 1;
  4280. params.u.upd_queue_params.update_pn = 1;
  4281. params.u.upd_queue_params.update_pn_check_needed = 1;
  4282. params.u.upd_queue_params.update_svld = 1;
  4283. params.u.upd_queue_params.svld = 0;
  4284. switch (sec_type) {
  4285. case cdp_sec_type_tkip_nomic:
  4286. case cdp_sec_type_aes_ccmp:
  4287. case cdp_sec_type_aes_ccmp_256:
  4288. case cdp_sec_type_aes_gcmp:
  4289. case cdp_sec_type_aes_gcmp_256:
  4290. params.u.upd_queue_params.pn_check_needed = 1;
  4291. params.u.upd_queue_params.pn_size = PN_SIZE_48;
  4292. pn_size = 48;
  4293. break;
  4294. case cdp_sec_type_wapi:
  4295. params.u.upd_queue_params.pn_check_needed = 1;
  4296. params.u.upd_queue_params.pn_size = PN_SIZE_128;
  4297. pn_size = 128;
  4298. if (vdev->opmode == wlan_op_mode_ap) {
  4299. params.u.upd_queue_params.pn_even = 1;
  4300. params.u.upd_queue_params.update_pn_even = 1;
  4301. } else {
  4302. params.u.upd_queue_params.pn_uneven = 1;
  4303. params.u.upd_queue_params.update_pn_uneven = 1;
  4304. }
  4305. break;
  4306. default:
  4307. params.u.upd_queue_params.pn_check_needed = 0;
  4308. pn_size = 0;
  4309. break;
  4310. }
  4311. for (i = 0; i < DP_MAX_TIDS; i++) {
  4312. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  4313. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4314. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4315. params.std.addr_lo =
  4316. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4317. params.std.addr_hi =
  4318. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4319. if (pn_size) {
  4320. dp_peer_info("%pK: PN set for TID:%d pn:%x:%x:%x:%x",
  4321. soc, i, rx_pn[3], rx_pn[2],
  4322. rx_pn[1], rx_pn[0]);
  4323. params.u.upd_queue_params.update_pn_valid = 1;
  4324. params.u.upd_queue_params.pn_31_0 = rx_pn[0];
  4325. params.u.upd_queue_params.pn_63_32 = rx_pn[1];
  4326. params.u.upd_queue_params.pn_95_64 = rx_pn[2];
  4327. params.u.upd_queue_params.pn_127_96 = rx_pn[3];
  4328. }
  4329. rx_tid->pn_size = pn_size;
  4330. if (dp_reo_send_cmd(cdp_soc_t_to_dp_soc(soc),
  4331. CMD_UPDATE_RX_REO_QUEUE,
  4332. &params, dp_rx_tid_update_cb,
  4333. rx_tid)) {
  4334. dp_err_log("fail to send CMD_UPDATE_RX_REO_QUEUE"
  4335. "tid %d desc %pK", rx_tid->tid,
  4336. (void *)(rx_tid->hw_qdesc_paddr));
  4337. DP_STATS_INC(cdp_soc_t_to_dp_soc(soc),
  4338. rx.err.reo_cmd_send_fail, 1);
  4339. }
  4340. } else {
  4341. dp_peer_info("%pK: PN Check not setup for TID :%d ", soc, i);
  4342. }
  4343. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4344. }
  4345. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4346. return QDF_STATUS_SUCCESS;
  4347. }
  4348. /**
  4349. * dp_set_key_sec_type_wifi3() - set security mode of key
  4350. * @soc: Datapath soc handle
  4351. * @peer_mac: Datapath peer mac address
  4352. * @vdev_id: id of atapath vdev
  4353. * @vdev: Datapath vdev
  4354. * @pdev - data path device instance
  4355. * @sec_type - security type
  4356. * #is_unicast - key type
  4357. *
  4358. */
  4359. QDF_STATUS
  4360. dp_set_key_sec_type_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  4361. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  4362. bool is_unicast)
  4363. {
  4364. struct dp_peer *peer =
  4365. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  4366. peer_mac, 0, vdev_id,
  4367. DP_MOD_ID_CDP);
  4368. int sec_index;
  4369. if (!peer) {
  4370. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  4371. return QDF_STATUS_E_FAILURE;
  4372. }
  4373. if (!peer->txrx_peer) {
  4374. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4375. dp_peer_debug("%pK: txrx peer is NULL!\n", soc);
  4376. return QDF_STATUS_E_FAILURE;
  4377. }
  4378. dp_peer_info("%pK: key sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4379. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4380. is_unicast ? "ucast" : "mcast", sec_type);
  4381. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4382. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4383. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4384. return QDF_STATUS_SUCCESS;
  4385. }
  4386. void
  4387. dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  4388. enum cdp_sec_type sec_type, int is_unicast,
  4389. u_int32_t *michael_key,
  4390. u_int32_t *rx_pn)
  4391. {
  4392. struct dp_peer *peer;
  4393. struct dp_txrx_peer *txrx_peer;
  4394. int sec_index;
  4395. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4396. if (!peer) {
  4397. dp_peer_err("Couldn't find peer from ID %d - skipping security inits",
  4398. peer_id);
  4399. return;
  4400. }
  4401. txrx_peer = dp_get_txrx_peer(peer);
  4402. if (!txrx_peer) {
  4403. dp_peer_err("Couldn't find txrx peer from ID %d - skipping security inits",
  4404. peer_id);
  4405. return;
  4406. }
  4407. dp_peer_info("%pK: sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4408. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4409. is_unicast ? "ucast" : "mcast", sec_type);
  4410. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4411. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4412. #ifdef notyet /* TODO: See if this is required for defrag support */
  4413. /* michael key only valid for TKIP, but for simplicity,
  4414. * copy it anyway
  4415. */
  4416. qdf_mem_copy(
  4417. &peer->txrx_peer->security[sec_index].michael_key[0],
  4418. michael_key,
  4419. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4420. #ifdef BIG_ENDIAN_HOST
  4421. OL_IF_SWAPBO(peer->txrx_peer->security[sec_index].michael_key[0],
  4422. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4423. #endif /* BIG_ENDIAN_HOST */
  4424. #endif
  4425. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  4426. if (sec_type != cdp_sec_type_wapi) {
  4427. qdf_mem_zero(peer->tids_last_pn_valid, _EXT_TIDS);
  4428. } else {
  4429. for (i = 0; i < DP_MAX_TIDS; i++) {
  4430. /*
  4431. * Setting PN valid bit for WAPI sec_type,
  4432. * since WAPI PN has to be started with predefined value
  4433. */
  4434. peer->tids_last_pn_valid[i] = 1;
  4435. qdf_mem_copy(
  4436. (u_int8_t *) &peer->tids_last_pn[i],
  4437. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  4438. peer->tids_last_pn[i].pn128[1] =
  4439. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  4440. peer->tids_last_pn[i].pn128[0] =
  4441. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  4442. }
  4443. }
  4444. #endif
  4445. /* TODO: Update HW TID queue with PN check parameters (pn type for
  4446. * all security types and last pn for WAPI) once REO command API
  4447. * is available
  4448. */
  4449. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4450. }
  4451. #ifdef QCA_PEER_EXT_STATS
  4452. /*
  4453. * dp_peer_delay_stats_ctx_alloc() - Allocate peer delay
  4454. * stats content
  4455. * @soc: DP SoC context
  4456. * @txrx_peer: DP txrx peer context
  4457. *
  4458. * Allocate the peer delay stats context
  4459. *
  4460. * Return: QDF_STATUS_SUCCESS if allocation is
  4461. * successful
  4462. */
  4463. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  4464. struct dp_txrx_peer *txrx_peer)
  4465. {
  4466. uint8_t tid, ctx_id;
  4467. if (!soc || !txrx_peer) {
  4468. dp_warn("Null soc%pK or peer%pK", soc, txrx_peer);
  4469. return QDF_STATUS_E_INVAL;
  4470. }
  4471. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4472. return QDF_STATUS_SUCCESS;
  4473. /*
  4474. * Allocate memory for peer extended stats.
  4475. */
  4476. txrx_peer->delay_stats =
  4477. qdf_mem_malloc(sizeof(struct dp_peer_delay_stats));
  4478. if (!txrx_peer->delay_stats) {
  4479. dp_err("Peer extended stats obj alloc failed!!");
  4480. return QDF_STATUS_E_NOMEM;
  4481. }
  4482. for (tid = 0; tid < CDP_MAX_DATA_TIDS; tid++) {
  4483. for (ctx_id = 0; ctx_id < CDP_MAX_TXRX_CTX; ctx_id++) {
  4484. struct cdp_delay_tx_stats *tx_delay =
  4485. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].tx_delay;
  4486. struct cdp_delay_rx_stats *rx_delay =
  4487. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].rx_delay;
  4488. dp_hist_init(&tx_delay->tx_swq_delay,
  4489. CDP_HIST_TYPE_SW_ENQEUE_DELAY);
  4490. dp_hist_init(&tx_delay->hwtx_delay,
  4491. CDP_HIST_TYPE_HW_COMP_DELAY);
  4492. dp_hist_init(&rx_delay->to_stack_delay,
  4493. CDP_HIST_TYPE_REAP_STACK);
  4494. }
  4495. }
  4496. return QDF_STATUS_SUCCESS;
  4497. }
  4498. /*
  4499. * dp_peer_delay_stats_ctx_dealloc() - Dealloc the peer delay stats context
  4500. * @txrx_peer: txrx DP peer context
  4501. *
  4502. * Free the peer delay stats context
  4503. *
  4504. * Return: Void
  4505. */
  4506. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  4507. struct dp_txrx_peer *txrx_peer)
  4508. {
  4509. if (!txrx_peer) {
  4510. dp_warn("peer_ext dealloc failed due to NULL peer object");
  4511. return;
  4512. }
  4513. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4514. return;
  4515. if (!txrx_peer->delay_stats)
  4516. return;
  4517. qdf_mem_free(txrx_peer->delay_stats);
  4518. txrx_peer->delay_stats = NULL;
  4519. }
  4520. /**
  4521. * dp_peer_delay_stats_ctx_clr() - Clear delay stats context of peer
  4522. *
  4523. * @txrx_peer: dp_txrx_peer handle
  4524. *
  4525. * Return: void
  4526. */
  4527. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4528. {
  4529. if (txrx_peer->delay_stats)
  4530. qdf_mem_zero(txrx_peer->delay_stats,
  4531. sizeof(struct dp_peer_delay_stats));
  4532. }
  4533. #endif
  4534. #ifdef WLAN_PEER_JITTER
  4535. /**
  4536. * dp_peer_jitter_stats_ctx_alloc() - Allocate jitter stats context for peer
  4537. *
  4538. * @soc: Datapath pdev handle
  4539. * @txrx_peer: dp_txrx_peer handle
  4540. *
  4541. * Return: QDF_STATUS
  4542. */
  4543. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  4544. struct dp_txrx_peer *txrx_peer)
  4545. {
  4546. if (!pdev || !txrx_peer) {
  4547. dp_warn("Null pdev or peer");
  4548. return QDF_STATUS_E_INVAL;
  4549. }
  4550. /*
  4551. * Allocate memory for jitter stats only when
  4552. * operating in offload enabled mode.
  4553. */
  4554. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4555. return QDF_STATUS_SUCCESS;
  4556. txrx_peer->jitter_stats =
  4557. qdf_mem_malloc(sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4558. if (!txrx_peer->jitter_stats) {
  4559. dp_warn("Jitter stats obj alloc failed!!");
  4560. return QDF_STATUS_E_NOMEM;
  4561. }
  4562. return QDF_STATUS_SUCCESS;
  4563. }
  4564. /**
  4565. * dp_peer_jitter_stats_ctx_dealloc() - Deallocate jitter stats context
  4566. *
  4567. * @pdev: Datapath pdev handle
  4568. * @txrx_peer: dp_txrx_peer handle
  4569. *
  4570. * Return: void
  4571. */
  4572. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  4573. struct dp_txrx_peer *txrx_peer)
  4574. {
  4575. if (!pdev || !txrx_peer) {
  4576. dp_warn("Null pdev or peer");
  4577. return;
  4578. }
  4579. /* Check for offload mode */
  4580. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4581. return;
  4582. if (txrx_peer->jitter_stats) {
  4583. qdf_mem_free(txrx_peer->jitter_stats);
  4584. txrx_peer->jitter_stats = NULL;
  4585. }
  4586. }
  4587. /**
  4588. * dp_peer_jitter_stats_ctx_clr() - Clear jitter stats context of peer
  4589. *
  4590. * @txrx_peer: dp_txrx_peer handle
  4591. *
  4592. * Return: void
  4593. */
  4594. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4595. {
  4596. if (txrx_peer->jitter_stats)
  4597. qdf_mem_zero(txrx_peer->jitter_stats,
  4598. sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4599. }
  4600. #endif
  4601. QDF_STATUS
  4602. dp_rx_delba_ind_handler(void *soc_handle, uint16_t peer_id,
  4603. uint8_t tid, uint16_t win_sz)
  4604. {
  4605. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  4606. struct dp_peer *peer;
  4607. struct dp_rx_tid *rx_tid;
  4608. QDF_STATUS status = QDF_STATUS_SUCCESS;
  4609. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4610. if (!peer) {
  4611. dp_peer_err("%pK: Couldn't find peer from ID %d",
  4612. soc, peer_id);
  4613. return QDF_STATUS_E_FAILURE;
  4614. }
  4615. qdf_assert_always(tid < DP_MAX_TIDS);
  4616. rx_tid = &peer->rx_tid[tid];
  4617. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4618. if (!rx_tid->delba_tx_status) {
  4619. dp_peer_info("%pK: PEER_ID: %d TID: %d, BA win: %d ",
  4620. soc, peer_id, tid, win_sz);
  4621. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4622. rx_tid->delba_tx_status = 1;
  4623. rx_tid->rx_ba_win_size_override =
  4624. qdf_min((uint16_t)63, win_sz);
  4625. rx_tid->delba_rcode =
  4626. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  4627. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4628. if (soc->cdp_soc.ol_ops->send_delba)
  4629. soc->cdp_soc.ol_ops->send_delba(
  4630. peer->vdev->pdev->soc->ctrl_psoc,
  4631. peer->vdev->vdev_id,
  4632. peer->mac_addr.raw,
  4633. tid,
  4634. rx_tid->delba_rcode,
  4635. CDP_DELBA_REASON_NONE);
  4636. }
  4637. } else {
  4638. dp_peer_err("%pK: BA session is not setup for TID:%d ", soc, tid);
  4639. status = QDF_STATUS_E_FAILURE;
  4640. }
  4641. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4642. return status;
  4643. }
  4644. #ifdef DP_PEER_EXTENDED_API
  4645. /**
  4646. * dp_peer_set_bw() - Set bandwidth and mpdu retry count threshold for peer
  4647. * @soc: DP soc handle
  4648. * @txrx_peer: Core txrx_peer handle
  4649. * @set_bw: enum of bandwidth to be set for this peer connection
  4650. *
  4651. * Return: None
  4652. */
  4653. static void dp_peer_set_bw(struct dp_soc *soc, struct dp_txrx_peer *txrx_peer,
  4654. enum cdp_peer_bw set_bw)
  4655. {
  4656. if (!txrx_peer)
  4657. return;
  4658. txrx_peer->bw = set_bw;
  4659. switch (set_bw) {
  4660. case CDP_160_MHZ:
  4661. case CDP_320_MHZ:
  4662. txrx_peer->mpdu_retry_threshold =
  4663. soc->wlan_cfg_ctx->mpdu_retry_threshold_2;
  4664. break;
  4665. case CDP_20_MHZ:
  4666. case CDP_40_MHZ:
  4667. case CDP_80_MHZ:
  4668. default:
  4669. txrx_peer->mpdu_retry_threshold =
  4670. soc->wlan_cfg_ctx->mpdu_retry_threshold_1;
  4671. break;
  4672. }
  4673. dp_info("Peer id: %u: BW: %u, mpdu retry threshold: %u",
  4674. txrx_peer->peer_id, txrx_peer->bw,
  4675. txrx_peer->mpdu_retry_threshold);
  4676. }
  4677. #ifdef WLAN_FEATURE_11BE_MLO
  4678. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4679. struct ol_txrx_desc_type *sta_desc)
  4680. {
  4681. struct dp_peer *peer;
  4682. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4683. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4684. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4685. if (!peer)
  4686. return QDF_STATUS_E_FAULT;
  4687. qdf_spin_lock_bh(&peer->peer_info_lock);
  4688. peer->state = OL_TXRX_PEER_STATE_CONN;
  4689. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4690. dp_peer_set_bw(soc, peer->txrx_peer, sta_desc->bw);
  4691. dp_rx_flush_rx_cached(peer, false);
  4692. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4693. dp_peer_info("register for mld peer" QDF_MAC_ADDR_FMT,
  4694. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw));
  4695. qdf_spin_lock_bh(&peer->mld_peer->peer_info_lock);
  4696. peer->mld_peer->state = peer->state;
  4697. qdf_spin_unlock_bh(&peer->mld_peer->peer_info_lock);
  4698. dp_rx_flush_rx_cached(peer->mld_peer, false);
  4699. }
  4700. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4701. return QDF_STATUS_SUCCESS;
  4702. }
  4703. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4704. enum ol_txrx_peer_state state)
  4705. {
  4706. struct dp_peer *peer;
  4707. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4708. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4709. DP_MOD_ID_CDP);
  4710. if (!peer) {
  4711. dp_peer_err("%pK: Failed to find peer[" QDF_MAC_ADDR_FMT "]",
  4712. soc, QDF_MAC_ADDR_REF(peer_mac));
  4713. return QDF_STATUS_E_FAILURE;
  4714. }
  4715. peer->state = state;
  4716. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4717. if (peer->txrx_peer)
  4718. peer->txrx_peer->authorize = peer->authorize;
  4719. dp_peer_info("peer" QDF_MAC_ADDR_FMT "state %d",
  4720. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4721. peer->state);
  4722. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4723. peer->mld_peer->state = peer->state;
  4724. peer->mld_peer->txrx_peer->authorize = peer->authorize;
  4725. dp_peer_info("mld peer" QDF_MAC_ADDR_FMT "state %d",
  4726. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw),
  4727. peer->mld_peer->state);
  4728. }
  4729. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4730. * Decrement it here.
  4731. */
  4732. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4733. return QDF_STATUS_SUCCESS;
  4734. }
  4735. #else
  4736. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4737. struct ol_txrx_desc_type *sta_desc)
  4738. {
  4739. struct dp_peer *peer;
  4740. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4741. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4742. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4743. if (!peer)
  4744. return QDF_STATUS_E_FAULT;
  4745. qdf_spin_lock_bh(&peer->peer_info_lock);
  4746. peer->state = OL_TXRX_PEER_STATE_CONN;
  4747. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4748. dp_peer_set_bw(soc, peer->txrx_peer, sta_desc->bw);
  4749. dp_rx_flush_rx_cached(peer, false);
  4750. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4751. return QDF_STATUS_SUCCESS;
  4752. }
  4753. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4754. enum ol_txrx_peer_state state)
  4755. {
  4756. struct dp_peer *peer;
  4757. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4758. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4759. DP_MOD_ID_CDP);
  4760. if (!peer) {
  4761. dp_peer_err("%pK: Failed to find peer for: [" QDF_MAC_ADDR_FMT "]",
  4762. soc, QDF_MAC_ADDR_REF(peer_mac));
  4763. return QDF_STATUS_E_FAILURE;
  4764. }
  4765. peer->state = state;
  4766. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4767. if (peer->txrx_peer)
  4768. peer->txrx_peer->authorize = peer->authorize;
  4769. dp_info("peer %pK state %d", peer, peer->state);
  4770. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4771. * Decrement it here.
  4772. */
  4773. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4774. return QDF_STATUS_SUCCESS;
  4775. }
  4776. #endif
  4777. QDF_STATUS
  4778. dp_clear_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4779. struct qdf_mac_addr peer_addr)
  4780. {
  4781. struct dp_peer *peer;
  4782. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4783. peer = dp_peer_find_hash_find(soc, peer_addr.bytes,
  4784. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4785. if (!peer || !peer->valid)
  4786. return QDF_STATUS_E_FAULT;
  4787. dp_clear_peer_internal(soc, peer);
  4788. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4789. return QDF_STATUS_SUCCESS;
  4790. }
  4791. QDF_STATUS dp_get_vdevid(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4792. uint8_t *vdev_id)
  4793. {
  4794. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4795. struct dp_peer *peer =
  4796. dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4797. DP_MOD_ID_CDP);
  4798. if (!peer)
  4799. return QDF_STATUS_E_FAILURE;
  4800. dp_info("peer %pK vdev %pK vdev id %d",
  4801. peer, peer->vdev, peer->vdev->vdev_id);
  4802. *vdev_id = peer->vdev->vdev_id;
  4803. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4804. * Decrement it here.
  4805. */
  4806. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4807. return QDF_STATUS_SUCCESS;
  4808. }
  4809. struct cdp_vdev *
  4810. dp_get_vdev_by_peer_addr(struct cdp_pdev *pdev_handle,
  4811. struct qdf_mac_addr peer_addr)
  4812. {
  4813. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  4814. struct dp_peer *peer = NULL;
  4815. struct cdp_vdev *vdev = NULL;
  4816. if (!pdev) {
  4817. dp_peer_info("PDEV not found for peer_addr: " QDF_MAC_ADDR_FMT,
  4818. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4819. return NULL;
  4820. }
  4821. peer = dp_peer_find_hash_find(pdev->soc, peer_addr.bytes, 0,
  4822. DP_VDEV_ALL, DP_MOD_ID_CDP);
  4823. if (!peer) {
  4824. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  4825. "PDEV not found for peer_addr: "QDF_MAC_ADDR_FMT,
  4826. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4827. return NULL;
  4828. }
  4829. vdev = (struct cdp_vdev *)peer->vdev;
  4830. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4831. return vdev;
  4832. }
  4833. /**
  4834. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  4835. * @peer - peer instance
  4836. *
  4837. * Get virtual interface instance which peer belongs
  4838. *
  4839. * Return: virtual interface instance pointer
  4840. * NULL in case cannot find
  4841. */
  4842. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  4843. {
  4844. struct dp_peer *peer = peer_handle;
  4845. DP_TRACE(DEBUG, "peer %pK vdev %pK", peer, peer->vdev);
  4846. return (struct cdp_vdev *)peer->vdev;
  4847. }
  4848. /**
  4849. * dp_peer_get_peer_mac_addr() - Get peer mac address
  4850. * @peer - peer instance
  4851. *
  4852. * Get peer mac address
  4853. *
  4854. * Return: peer mac address pointer
  4855. * NULL in case cannot find
  4856. */
  4857. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  4858. {
  4859. struct dp_peer *peer = peer_handle;
  4860. uint8_t *mac;
  4861. mac = peer->mac_addr.raw;
  4862. dp_info("peer %pK mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  4863. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  4864. return peer->mac_addr.raw;
  4865. }
  4866. int dp_get_peer_state(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4867. uint8_t *peer_mac)
  4868. {
  4869. enum ol_txrx_peer_state peer_state;
  4870. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4871. struct cdp_peer_info peer_info = { 0 };
  4872. struct dp_peer *peer;
  4873. struct dp_peer *tgt_peer;
  4874. DP_PEER_INFO_PARAMS_INIT(&peer_info, vdev_id, peer_mac,
  4875. false, CDP_WILD_PEER_TYPE);
  4876. peer = dp_peer_hash_find_wrapper(soc, &peer_info, DP_MOD_ID_CDP);
  4877. if (!peer)
  4878. return OL_TXRX_PEER_STATE_INVALID;
  4879. DP_TRACE(DEBUG, "peer %pK stats %d", peer, peer->state);
  4880. tgt_peer = dp_get_tgt_peer_from_peer(peer);
  4881. peer_state = tgt_peer->state;
  4882. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4883. return peer_state;
  4884. }
  4885. /**
  4886. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  4887. * @pdev - data path device instance
  4888. *
  4889. * local peer id pool alloc for physical device
  4890. *
  4891. * Return: none
  4892. */
  4893. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  4894. {
  4895. int i;
  4896. /* point the freelist to the first ID */
  4897. pdev->local_peer_ids.freelist = 0;
  4898. /* link each ID to the next one */
  4899. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  4900. pdev->local_peer_ids.pool[i] = i + 1;
  4901. pdev->local_peer_ids.map[i] = NULL;
  4902. }
  4903. /* link the last ID to itself, to mark the end of the list */
  4904. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  4905. pdev->local_peer_ids.pool[i] = i;
  4906. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  4907. DP_TRACE(INFO, "Peer pool init");
  4908. }
  4909. /**
  4910. * dp_local_peer_id_alloc() - allocate local peer id
  4911. * @pdev - data path device instance
  4912. * @peer - new peer instance
  4913. *
  4914. * allocate local peer id
  4915. *
  4916. * Return: none
  4917. */
  4918. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  4919. {
  4920. int i;
  4921. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4922. i = pdev->local_peer_ids.freelist;
  4923. if (pdev->local_peer_ids.pool[i] == i) {
  4924. /* the list is empty, except for the list-end marker */
  4925. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  4926. } else {
  4927. /* take the head ID and advance the freelist */
  4928. peer->local_id = i;
  4929. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  4930. pdev->local_peer_ids.map[i] = peer;
  4931. }
  4932. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4933. dp_info("peer %pK, local id %d", peer, peer->local_id);
  4934. }
  4935. /**
  4936. * dp_local_peer_id_free() - remove local peer id
  4937. * @pdev - data path device instance
  4938. * @peer - peer instance should be removed
  4939. *
  4940. * remove local peer id
  4941. *
  4942. * Return: none
  4943. */
  4944. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  4945. {
  4946. int i = peer->local_id;
  4947. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  4948. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  4949. return;
  4950. }
  4951. /* put this ID on the head of the freelist */
  4952. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4953. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  4954. pdev->local_peer_ids.freelist = i;
  4955. pdev->local_peer_ids.map[i] = NULL;
  4956. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4957. }
  4958. bool dp_find_peer_exist_on_vdev(struct cdp_soc_t *soc_hdl,
  4959. uint8_t vdev_id, uint8_t *peer_addr)
  4960. {
  4961. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4962. struct dp_peer *peer = NULL;
  4963. peer = dp_peer_find_hash_find(soc, peer_addr, 0, vdev_id,
  4964. DP_MOD_ID_CDP);
  4965. if (!peer)
  4966. return false;
  4967. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4968. return true;
  4969. }
  4970. bool dp_find_peer_exist_on_other_vdev(struct cdp_soc_t *soc_hdl,
  4971. uint8_t vdev_id, uint8_t *peer_addr,
  4972. uint16_t max_bssid)
  4973. {
  4974. int i;
  4975. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4976. struct dp_peer *peer = NULL;
  4977. for (i = 0; i < max_bssid; i++) {
  4978. /* Need to check vdevs other than the vdev_id */
  4979. if (vdev_id == i)
  4980. continue;
  4981. peer = dp_peer_find_hash_find(soc, peer_addr, 0, i,
  4982. DP_MOD_ID_CDP);
  4983. if (peer) {
  4984. dp_err("Duplicate peer "QDF_MAC_ADDR_FMT" already exist on vdev %d",
  4985. QDF_MAC_ADDR_REF(peer_addr), i);
  4986. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4987. return true;
  4988. }
  4989. }
  4990. return false;
  4991. }
  4992. bool dp_find_peer_exist(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4993. uint8_t *peer_addr)
  4994. {
  4995. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4996. struct dp_peer *peer = NULL;
  4997. peer = dp_peer_find_hash_find(soc, peer_addr, 0, DP_VDEV_ALL,
  4998. DP_MOD_ID_CDP);
  4999. if (peer) {
  5000. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  5001. return true;
  5002. }
  5003. return false;
  5004. }
  5005. void dp_set_peer_as_tdls_peer(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  5006. uint8_t *peer_mac, bool val)
  5007. {
  5008. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  5009. struct dp_peer *peer = NULL;
  5010. peer = dp_peer_find_hash_find(soc, peer_mac, 0, vdev_id,
  5011. DP_MOD_ID_CDP);
  5012. if (!peer) {
  5013. dp_err("Failed to find peer for:" QDF_MAC_ADDR_FMT,
  5014. QDF_MAC_ADDR_REF(peer_mac));
  5015. return;
  5016. }
  5017. dp_info("Set tdls flag %d for peer:" QDF_MAC_ADDR_FMT,
  5018. val, QDF_MAC_ADDR_REF(peer_mac));
  5019. peer->is_tdls_peer = val;
  5020. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  5021. }
  5022. #endif
  5023. #ifdef IPA_OFFLOAD
  5024. int dp_peer_get_rxtid_stats_ipa(struct dp_peer *peer,
  5025. dp_rxtid_stats_cmd_cb dp_stats_cmd_cb)
  5026. {
  5027. struct dp_soc *soc = peer->vdev->pdev->soc;
  5028. struct hal_reo_cmd_params params;
  5029. int i;
  5030. int stats_cmd_sent_cnt = 0;
  5031. QDF_STATUS status;
  5032. uint16_t peer_id = peer->peer_id;
  5033. unsigned long comb_peer_id_tid;
  5034. if (!dp_stats_cmd_cb)
  5035. return stats_cmd_sent_cnt;
  5036. qdf_mem_zero(&params, sizeof(params));
  5037. for (i = 0; i < DP_MAX_TIDS; i++) {
  5038. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  5039. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  5040. params.std.need_status = 1;
  5041. params.std.addr_lo =
  5042. rx_tid->hw_qdesc_paddr & 0xffffffff;
  5043. params.std.addr_hi =
  5044. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  5045. params.u.stats_params.clear = 1;
  5046. comb_peer_id_tid = ((i << DP_PEER_REO_STATS_TID_SHIFT)
  5047. | peer_id);
  5048. status = dp_reo_send_cmd(soc, CMD_GET_QUEUE_STATS,
  5049. &params, dp_stats_cmd_cb,
  5050. (void *)comb_peer_id_tid);
  5051. if (QDF_IS_STATUS_SUCCESS(status))
  5052. stats_cmd_sent_cnt++;
  5053. /* Flush REO descriptor from HW cache to update stats
  5054. * in descriptor memory. This is to help debugging
  5055. */
  5056. qdf_mem_zero(&params, sizeof(params));
  5057. params.std.need_status = 0;
  5058. params.std.addr_lo =
  5059. rx_tid->hw_qdesc_paddr & 0xffffffff;
  5060. params.std.addr_hi =
  5061. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  5062. params.u.fl_cache_params.flush_no_inval = 1;
  5063. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  5064. NULL);
  5065. }
  5066. }
  5067. return stats_cmd_sent_cnt;
  5068. }
  5069. qdf_export_symbol(dp_peer_get_rxtid_stats_ipa);
  5070. #endif
  5071. /**
  5072. * dp_peer_rxtid_stats: Retried Rx TID (REO queue) stats from HW
  5073. * @peer: DP peer handle
  5074. * @dp_stats_cmd_cb: REO command callback function
  5075. * @cb_ctxt: Callback context
  5076. *
  5077. * Return: count of tid stats cmd send succeeded
  5078. */
  5079. int dp_peer_rxtid_stats(struct dp_peer *peer,
  5080. dp_rxtid_stats_cmd_cb dp_stats_cmd_cb,
  5081. void *cb_ctxt)
  5082. {
  5083. struct dp_soc *soc = peer->vdev->pdev->soc;
  5084. struct hal_reo_cmd_params params;
  5085. int i;
  5086. int stats_cmd_sent_cnt = 0;
  5087. QDF_STATUS status;
  5088. if (!dp_stats_cmd_cb)
  5089. return stats_cmd_sent_cnt;
  5090. qdf_mem_zero(&params, sizeof(params));
  5091. for (i = 0; i < DP_MAX_TIDS; i++) {
  5092. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  5093. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  5094. params.std.need_status = 1;
  5095. params.std.addr_lo =
  5096. rx_tid->hw_qdesc_paddr & 0xffffffff;
  5097. params.std.addr_hi =
  5098. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  5099. if (cb_ctxt) {
  5100. status = dp_reo_send_cmd(
  5101. soc, CMD_GET_QUEUE_STATS,
  5102. &params, dp_stats_cmd_cb,
  5103. cb_ctxt);
  5104. } else {
  5105. status = dp_reo_send_cmd(
  5106. soc, CMD_GET_QUEUE_STATS,
  5107. &params, dp_stats_cmd_cb,
  5108. rx_tid);
  5109. }
  5110. if (QDF_IS_STATUS_SUCCESS(status))
  5111. stats_cmd_sent_cnt++;
  5112. /* Flush REO descriptor from HW cache to update stats
  5113. * in descriptor memory. This is to help debugging */
  5114. qdf_mem_zero(&params, sizeof(params));
  5115. params.std.need_status = 0;
  5116. params.std.addr_lo =
  5117. rx_tid->hw_qdesc_paddr & 0xffffffff;
  5118. params.std.addr_hi =
  5119. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  5120. params.u.fl_cache_params.flush_no_inval = 1;
  5121. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  5122. NULL);
  5123. }
  5124. }
  5125. return stats_cmd_sent_cnt;
  5126. }
  5127. QDF_STATUS
  5128. dp_set_michael_key(struct cdp_soc_t *soc,
  5129. uint8_t vdev_id,
  5130. uint8_t *peer_mac,
  5131. bool is_unicast, uint32_t *key)
  5132. {
  5133. uint8_t sec_index = is_unicast ? 1 : 0;
  5134. struct dp_peer *peer =
  5135. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  5136. peer_mac, 0, vdev_id,
  5137. DP_MOD_ID_CDP);
  5138. if (!peer) {
  5139. dp_peer_err("%pK: peer not found ", soc);
  5140. return QDF_STATUS_E_FAILURE;
  5141. }
  5142. qdf_mem_copy(&peer->txrx_peer->security[sec_index].michael_key[0],
  5143. key, IEEE80211_WEP_MICLEN);
  5144. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  5145. return QDF_STATUS_SUCCESS;
  5146. }
  5147. /**
  5148. * dp_vdev_bss_peer_ref_n_get: Get bss peer of a vdev
  5149. * @soc: DP soc
  5150. * @vdev: vdev
  5151. * @mod_id: id of module requesting reference
  5152. *
  5153. * Return: VDEV BSS peer
  5154. */
  5155. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  5156. struct dp_vdev *vdev,
  5157. enum dp_mod_id mod_id)
  5158. {
  5159. struct dp_peer *peer = NULL;
  5160. qdf_spin_lock_bh(&vdev->peer_list_lock);
  5161. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  5162. if (peer->bss_peer)
  5163. break;
  5164. }
  5165. if (!peer) {
  5166. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5167. return NULL;
  5168. }
  5169. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  5170. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5171. return peer;
  5172. }
  5173. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5174. return peer;
  5175. }
  5176. /**
  5177. * dp_sta_vdev_self_peer_ref_n_get: Get self peer of sta vdev
  5178. * @soc: DP soc
  5179. * @vdev: vdev
  5180. * @mod_id: id of module requesting reference
  5181. *
  5182. * Return: VDEV self peer
  5183. */
  5184. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  5185. struct dp_vdev *vdev,
  5186. enum dp_mod_id mod_id)
  5187. {
  5188. struct dp_peer *peer;
  5189. if (vdev->opmode != wlan_op_mode_sta)
  5190. return NULL;
  5191. qdf_spin_lock_bh(&vdev->peer_list_lock);
  5192. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  5193. if (peer->sta_self_peer)
  5194. break;
  5195. }
  5196. if (!peer) {
  5197. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5198. return NULL;
  5199. }
  5200. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  5201. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5202. return peer;
  5203. }
  5204. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  5205. return peer;
  5206. }
  5207. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  5208. void dp_dump_rx_reo_queue_info(
  5209. struct dp_soc *soc, void *cb_ctxt, union hal_reo_status *reo_status)
  5210. {
  5211. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  5212. if (!rx_tid)
  5213. return;
  5214. if (reo_status->fl_cache_status.header.status !=
  5215. HAL_REO_CMD_SUCCESS) {
  5216. dp_err_rl("Rx tid REO HW desc flush failed(%d)",
  5217. reo_status->rx_queue_status.header.status);
  5218. return;
  5219. }
  5220. qdf_spin_lock_bh(&rx_tid->tid_lock);
  5221. hal_dump_rx_reo_queue_desc(rx_tid->hw_qdesc_vaddr_aligned);
  5222. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  5223. }
  5224. void dp_send_cache_flush_for_rx_tid(
  5225. struct dp_soc *soc, struct dp_peer *peer)
  5226. {
  5227. int i;
  5228. struct dp_rx_tid *rx_tid;
  5229. struct hal_reo_cmd_params params;
  5230. if (!peer) {
  5231. dp_err_rl("Peer is NULL");
  5232. return;
  5233. }
  5234. for (i = 0; i < DP_MAX_TIDS; i++) {
  5235. rx_tid = &peer->rx_tid[i];
  5236. if (!rx_tid)
  5237. continue;
  5238. qdf_spin_lock_bh(&rx_tid->tid_lock);
  5239. if (rx_tid->hw_qdesc_vaddr_aligned) {
  5240. qdf_mem_zero(&params, sizeof(params));
  5241. params.std.need_status = 1;
  5242. params.std.addr_lo =
  5243. rx_tid->hw_qdesc_paddr & 0xffffffff;
  5244. params.std.addr_hi =
  5245. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  5246. params.u.fl_cache_params.flush_no_inval = 0;
  5247. if (QDF_STATUS_SUCCESS !=
  5248. dp_reo_send_cmd(
  5249. soc, CMD_FLUSH_CACHE,
  5250. &params, dp_dump_rx_reo_queue_info,
  5251. (void *)rx_tid)) {
  5252. dp_err_rl("cache flush send failed tid %d",
  5253. rx_tid->tid);
  5254. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  5255. break;
  5256. }
  5257. }
  5258. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  5259. }
  5260. }
  5261. void dp_get_rx_reo_queue_info(
  5262. struct cdp_soc_t *soc_hdl, uint8_t vdev_id)
  5263. {
  5264. struct dp_soc *soc = (struct dp_soc *)soc_hdl;
  5265. struct dp_vdev *vdev = dp_vdev_get_ref_by_id(soc, vdev_id,
  5266. DP_MOD_ID_GENERIC_STATS);
  5267. struct dp_peer *peer = NULL;
  5268. if (!vdev) {
  5269. dp_err_rl("vdev is null for vdev_id: %u", vdev_id);
  5270. goto failed;
  5271. }
  5272. peer = dp_vdev_bss_peer_ref_n_get(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  5273. if (!peer) {
  5274. dp_err_rl("Peer is NULL");
  5275. goto failed;
  5276. }
  5277. dp_send_cache_flush_for_rx_tid(soc, peer);
  5278. failed:
  5279. if (peer)
  5280. dp_peer_unref_delete(peer, DP_MOD_ID_GENERIC_STATS);
  5281. if (vdev)
  5282. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  5283. }
  5284. #endif /* DUMP_REO_QUEUE_INFO_IN_DDR */
  5285. void dp_peer_flush_frags(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  5286. uint8_t *peer_mac)
  5287. {
  5288. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  5289. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(soc, peer_mac, 0,
  5290. vdev_id,
  5291. DP_MOD_ID_CDP);
  5292. struct dp_txrx_peer *txrx_peer;
  5293. uint8_t tid;
  5294. struct dp_rx_tid_defrag *defrag_rx_tid;
  5295. if (!peer)
  5296. return;
  5297. if (!peer->txrx_peer)
  5298. goto fail;
  5299. dp_info("Flushing fragments for peer " QDF_MAC_ADDR_FMT,
  5300. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  5301. txrx_peer = peer->txrx_peer;
  5302. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  5303. defrag_rx_tid = &txrx_peer->rx_tid[tid];
  5304. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  5305. dp_rx_defrag_waitlist_remove(txrx_peer, tid);
  5306. dp_rx_reorder_flush_frag(txrx_peer, tid);
  5307. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  5308. }
  5309. fail:
  5310. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  5311. }
  5312. /*
  5313. * dp_peer_find_by_id_valid - check if peer exists for given id
  5314. * @soc: core DP soc context
  5315. * @peer_id: peer id from peer object can be retrieved
  5316. *
  5317. * Return: true if peer exists of false otherwise
  5318. */
  5319. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id)
  5320. {
  5321. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id,
  5322. DP_MOD_ID_HTT);
  5323. if (peer) {
  5324. /*
  5325. * Decrement the peer ref which is taken as part of
  5326. * dp_peer_get_ref_by_id if PEER_LOCK_REF_PROTECT is enabled
  5327. */
  5328. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  5329. return true;
  5330. }
  5331. return false;
  5332. }
  5333. qdf_export_symbol(dp_peer_find_by_id_valid);