dp_peer.c 161 KB

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