dp_peer.c 153 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787
  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)
  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_map_ast() - Map the ast entry with HW AST Index
  1227. * @soc: SoC handle
  1228. * @peer: peer to which ast node belongs
  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 QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1238. struct dp_peer *peer,
  1239. uint8_t *mac_addr,
  1240. uint16_t hw_peer_id,
  1241. uint8_t vdev_id,
  1242. uint16_t ast_hash,
  1243. uint8_t is_wds)
  1244. {
  1245. struct dp_ast_entry *ast_entry = NULL;
  1246. enum cdp_txrx_ast_entry_type peer_type = CDP_TXRX_AST_TYPE_STATIC;
  1247. void *cookie = NULL;
  1248. txrx_ast_free_cb cb = NULL;
  1249. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1250. if (soc->ast_offload_support)
  1251. return QDF_STATUS_SUCCESS;
  1252. if (!peer) {
  1253. return QDF_STATUS_E_INVAL;
  1254. }
  1255. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1256. soc, peer, hw_peer_id, vdev_id,
  1257. QDF_MAC_ADDR_REF(mac_addr));
  1258. qdf_spin_lock_bh(&soc->ast_lock);
  1259. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  1260. if (is_wds) {
  1261. /*
  1262. * In certain cases like Auth attack on a repeater
  1263. * can result in the number of ast_entries falling
  1264. * in the same hash bucket to exceed the max_skid
  1265. * length supported by HW in root AP. In these cases
  1266. * the FW will return the hw_peer_id (ast_index) as
  1267. * 0xffff indicating HW could not add the entry in
  1268. * its table. Host has to delete the entry from its
  1269. * table in these cases.
  1270. */
  1271. if (hw_peer_id == HTT_INVALID_PEER) {
  1272. DP_STATS_INC(soc, ast.map_err, 1);
  1273. if (ast_entry) {
  1274. if (ast_entry->is_mapped) {
  1275. soc->ast_table[ast_entry->ast_idx] =
  1276. NULL;
  1277. }
  1278. cb = ast_entry->callback;
  1279. cookie = ast_entry->cookie;
  1280. peer_type = ast_entry->type;
  1281. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1282. dp_peer_free_ast_entry(soc, ast_entry);
  1283. qdf_spin_unlock_bh(&soc->ast_lock);
  1284. if (cb) {
  1285. cb(soc->ctrl_psoc,
  1286. dp_soc_to_cdp_soc(soc),
  1287. cookie,
  1288. CDP_TXRX_AST_DELETED);
  1289. }
  1290. } else {
  1291. qdf_spin_unlock_bh(&soc->ast_lock);
  1292. 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",
  1293. peer, peer->peer_id,
  1294. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  1295. QDF_MAC_ADDR_REF(mac_addr),
  1296. vdev_id, is_wds);
  1297. }
  1298. err = QDF_STATUS_E_INVAL;
  1299. dp_hmwds_ast_add_notify(peer, mac_addr,
  1300. peer_type, err, true);
  1301. return err;
  1302. }
  1303. }
  1304. if (ast_entry) {
  1305. ast_entry->ast_idx = hw_peer_id;
  1306. soc->ast_table[hw_peer_id] = ast_entry;
  1307. ast_entry->is_active = TRUE;
  1308. peer_type = ast_entry->type;
  1309. ast_entry->ast_hash_value = ast_hash;
  1310. ast_entry->is_mapped = TRUE;
  1311. qdf_assert_always(ast_entry->peer_id == HTT_INVALID_PEER);
  1312. ast_entry->peer_id = peer->peer_id;
  1313. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1314. ase_list_elem);
  1315. }
  1316. if (ast_entry || (peer->vdev && peer->vdev->proxysta_vdev)) {
  1317. if (soc->cdp_soc.ol_ops->peer_map_event) {
  1318. soc->cdp_soc.ol_ops->peer_map_event(
  1319. soc->ctrl_psoc, peer->peer_id,
  1320. hw_peer_id, vdev_id,
  1321. mac_addr, peer_type, ast_hash);
  1322. }
  1323. } else {
  1324. dp_peer_err("%pK: AST entry not found", soc);
  1325. err = QDF_STATUS_E_NOENT;
  1326. }
  1327. qdf_spin_unlock_bh(&soc->ast_lock);
  1328. dp_hmwds_ast_add_notify(peer, mac_addr,
  1329. peer_type, err, true);
  1330. return err;
  1331. }
  1332. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  1333. struct cdp_soc *dp_soc,
  1334. void *cookie,
  1335. enum cdp_ast_free_status status)
  1336. {
  1337. struct dp_ast_free_cb_params *param =
  1338. (struct dp_ast_free_cb_params *)cookie;
  1339. struct dp_soc *soc = (struct dp_soc *)dp_soc;
  1340. struct dp_peer *peer = NULL;
  1341. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1342. if (status != CDP_TXRX_AST_DELETED) {
  1343. qdf_mem_free(cookie);
  1344. return;
  1345. }
  1346. peer = dp_peer_find_hash_find(soc, &param->peer_mac_addr.raw[0],
  1347. 0, param->vdev_id, DP_MOD_ID_AST);
  1348. if (peer) {
  1349. err = dp_peer_add_ast(soc, peer,
  1350. &param->mac_addr.raw[0],
  1351. param->type,
  1352. param->flags);
  1353. dp_hmwds_ast_add_notify(peer, &param->mac_addr.raw[0],
  1354. param->type, err, false);
  1355. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1356. }
  1357. qdf_mem_free(cookie);
  1358. }
  1359. /*
  1360. * dp_peer_add_ast() - Allocate and add AST entry into peer list
  1361. * @soc: SoC handle
  1362. * @peer: peer to which ast node belongs
  1363. * @mac_addr: MAC address of ast node
  1364. * @is_self: Is this base AST entry with peer mac address
  1365. *
  1366. * This API is used by WDS source port learning function to
  1367. * add a new AST entry into peer AST list
  1368. *
  1369. * Return: QDF_STATUS code
  1370. */
  1371. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1372. struct dp_peer *peer,
  1373. uint8_t *mac_addr,
  1374. enum cdp_txrx_ast_entry_type type,
  1375. uint32_t flags)
  1376. {
  1377. struct dp_ast_entry *ast_entry = NULL;
  1378. struct dp_vdev *vdev = NULL;
  1379. struct dp_pdev *pdev = NULL;
  1380. txrx_ast_free_cb cb = NULL;
  1381. void *cookie = NULL;
  1382. struct dp_peer *vap_bss_peer = NULL;
  1383. bool is_peer_found = false;
  1384. int status = 0;
  1385. if (soc->ast_offload_support)
  1386. return QDF_STATUS_E_INVAL;
  1387. vdev = peer->vdev;
  1388. if (!vdev) {
  1389. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1390. QDF_ASSERT(0);
  1391. return QDF_STATUS_E_INVAL;
  1392. }
  1393. pdev = vdev->pdev;
  1394. is_peer_found = dp_peer_exist_on_pdev(soc, mac_addr, 0, pdev);
  1395. qdf_spin_lock_bh(&soc->ast_lock);
  1396. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1397. if ((type != CDP_TXRX_AST_TYPE_STATIC) &&
  1398. (type != CDP_TXRX_AST_TYPE_SELF)) {
  1399. qdf_spin_unlock_bh(&soc->ast_lock);
  1400. return QDF_STATUS_E_BUSY;
  1401. }
  1402. }
  1403. 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,
  1404. soc, pdev->pdev_id, vdev->vdev_id, type, flags,
  1405. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1406. QDF_MAC_ADDR_REF(mac_addr));
  1407. /* fw supports only 2 times the max_peers ast entries */
  1408. if (soc->num_ast_entries >=
  1409. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  1410. qdf_spin_unlock_bh(&soc->ast_lock);
  1411. dp_peer_err("%pK: Max ast entries reached", soc);
  1412. return QDF_STATUS_E_RESOURCES;
  1413. }
  1414. /* If AST entry already exists , just return from here
  1415. * ast entry with same mac address can exist on different radios
  1416. * if ast_override support is enabled use search by pdev in this
  1417. * case
  1418. */
  1419. if (soc->ast_override_support) {
  1420. ast_entry = dp_peer_ast_hash_find_by_pdevid(soc, mac_addr,
  1421. pdev->pdev_id);
  1422. if (ast_entry) {
  1423. qdf_spin_unlock_bh(&soc->ast_lock);
  1424. return QDF_STATUS_E_ALREADY;
  1425. }
  1426. if (is_peer_found) {
  1427. /* During WDS to static roaming, peer is added
  1428. * to the list before static AST entry create.
  1429. * So, allow AST entry for STATIC type
  1430. * even if peer is present
  1431. */
  1432. if (type != CDP_TXRX_AST_TYPE_STATIC) {
  1433. qdf_spin_unlock_bh(&soc->ast_lock);
  1434. return QDF_STATUS_E_ALREADY;
  1435. }
  1436. }
  1437. } else {
  1438. /* For HWMWDS_SEC entries can be added for same mac address
  1439. * do not check for existing entry
  1440. */
  1441. if (type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1442. goto add_ast_entry;
  1443. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1444. if (ast_entry) {
  1445. if ((ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM) &&
  1446. !ast_entry->delete_in_progress) {
  1447. qdf_spin_unlock_bh(&soc->ast_lock);
  1448. return QDF_STATUS_E_ALREADY;
  1449. }
  1450. /* Add for HMWDS entry we cannot be ignored if there
  1451. * is AST entry with same mac address
  1452. *
  1453. * if ast entry exists with the requested mac address
  1454. * send a delete command and register callback which
  1455. * can take care of adding HMWDS ast enty on delete
  1456. * confirmation from target
  1457. */
  1458. if (type == CDP_TXRX_AST_TYPE_WDS_HM) {
  1459. struct dp_ast_free_cb_params *param = NULL;
  1460. if (ast_entry->type ==
  1461. CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1462. goto add_ast_entry;
  1463. /* save existing callback */
  1464. if (ast_entry->callback) {
  1465. cb = ast_entry->callback;
  1466. cookie = ast_entry->cookie;
  1467. }
  1468. param = qdf_mem_malloc(sizeof(*param));
  1469. if (!param) {
  1470. QDF_TRACE(QDF_MODULE_ID_TXRX,
  1471. QDF_TRACE_LEVEL_ERROR,
  1472. "Allocation failed");
  1473. qdf_spin_unlock_bh(&soc->ast_lock);
  1474. return QDF_STATUS_E_NOMEM;
  1475. }
  1476. qdf_mem_copy(&param->mac_addr.raw[0], mac_addr,
  1477. QDF_MAC_ADDR_SIZE);
  1478. qdf_mem_copy(&param->peer_mac_addr.raw[0],
  1479. &peer->mac_addr.raw[0],
  1480. QDF_MAC_ADDR_SIZE);
  1481. param->type = type;
  1482. param->flags = flags;
  1483. param->vdev_id = vdev->vdev_id;
  1484. ast_entry->callback = dp_peer_free_hmwds_cb;
  1485. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1486. ast_entry->type = type;
  1487. ast_entry->cookie = (void *)param;
  1488. if (!ast_entry->delete_in_progress)
  1489. dp_peer_del_ast(soc, ast_entry);
  1490. qdf_spin_unlock_bh(&soc->ast_lock);
  1491. /* Call the saved callback*/
  1492. if (cb) {
  1493. cb(soc->ctrl_psoc,
  1494. dp_soc_to_cdp_soc(soc),
  1495. cookie,
  1496. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  1497. }
  1498. return QDF_STATUS_E_AGAIN;
  1499. }
  1500. qdf_spin_unlock_bh(&soc->ast_lock);
  1501. return QDF_STATUS_E_ALREADY;
  1502. }
  1503. }
  1504. add_ast_entry:
  1505. ast_entry = (struct dp_ast_entry *)
  1506. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1507. if (!ast_entry) {
  1508. qdf_spin_unlock_bh(&soc->ast_lock);
  1509. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1510. QDF_ASSERT(0);
  1511. return QDF_STATUS_E_NOMEM;
  1512. }
  1513. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1514. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1515. ast_entry->is_mapped = false;
  1516. ast_entry->delete_in_progress = false;
  1517. ast_entry->peer_id = HTT_INVALID_PEER;
  1518. ast_entry->next_hop = 0;
  1519. ast_entry->vdev_id = vdev->vdev_id;
  1520. switch (type) {
  1521. case CDP_TXRX_AST_TYPE_STATIC:
  1522. peer->self_ast_entry = ast_entry;
  1523. ast_entry->type = CDP_TXRX_AST_TYPE_STATIC;
  1524. if (peer->vdev->opmode == wlan_op_mode_sta)
  1525. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1526. break;
  1527. case CDP_TXRX_AST_TYPE_SELF:
  1528. peer->self_ast_entry = ast_entry;
  1529. ast_entry->type = CDP_TXRX_AST_TYPE_SELF;
  1530. break;
  1531. case CDP_TXRX_AST_TYPE_WDS:
  1532. ast_entry->next_hop = 1;
  1533. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1534. break;
  1535. case CDP_TXRX_AST_TYPE_WDS_HM:
  1536. ast_entry->next_hop = 1;
  1537. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM;
  1538. break;
  1539. case CDP_TXRX_AST_TYPE_WDS_HM_SEC:
  1540. ast_entry->next_hop = 1;
  1541. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM_SEC;
  1542. ast_entry->peer_id = peer->peer_id;
  1543. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1544. ase_list_elem);
  1545. break;
  1546. case CDP_TXRX_AST_TYPE_DA:
  1547. vap_bss_peer = dp_vdev_bss_peer_ref_n_get(soc, vdev,
  1548. DP_MOD_ID_AST);
  1549. if (!vap_bss_peer) {
  1550. qdf_spin_unlock_bh(&soc->ast_lock);
  1551. qdf_mem_free(ast_entry);
  1552. return QDF_STATUS_E_FAILURE;
  1553. }
  1554. peer = vap_bss_peer;
  1555. ast_entry->next_hop = 1;
  1556. ast_entry->type = CDP_TXRX_AST_TYPE_DA;
  1557. break;
  1558. default:
  1559. dp_peer_err("%pK: Incorrect AST entry type", soc);
  1560. }
  1561. ast_entry->is_active = TRUE;
  1562. DP_STATS_INC(soc, ast.added, 1);
  1563. soc->num_ast_entries++;
  1564. dp_peer_ast_hash_add(soc, ast_entry);
  1565. if ((ast_entry->type != CDP_TXRX_AST_TYPE_STATIC) &&
  1566. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF) &&
  1567. (ast_entry->type != CDP_TXRX_AST_TYPE_STA_BSS) &&
  1568. (ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1569. status = dp_add_wds_entry_wrapper(soc,
  1570. peer,
  1571. mac_addr,
  1572. flags,
  1573. ast_entry->type);
  1574. if (vap_bss_peer)
  1575. dp_peer_unref_delete(vap_bss_peer, DP_MOD_ID_AST);
  1576. qdf_spin_unlock_bh(&soc->ast_lock);
  1577. return qdf_status_from_os_return(status);
  1578. }
  1579. qdf_export_symbol(dp_peer_add_ast);
  1580. /*
  1581. * dp_peer_free_ast_entry() - Free up the ast entry memory
  1582. * @soc: SoC handle
  1583. * @ast_entry: Address search entry
  1584. *
  1585. * This API is used to free up the memory associated with
  1586. * AST entry.
  1587. *
  1588. * Return: None
  1589. */
  1590. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1591. struct dp_ast_entry *ast_entry)
  1592. {
  1593. /*
  1594. * NOTE: Ensure that call to this API is done
  1595. * after soc->ast_lock is taken
  1596. */
  1597. dp_peer_debug("type: %d ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1598. ast_entry->type, ast_entry->peer_id, ast_entry->vdev_id,
  1599. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1600. ast_entry->callback = NULL;
  1601. ast_entry->cookie = NULL;
  1602. DP_STATS_INC(soc, ast.deleted, 1);
  1603. dp_peer_ast_hash_remove(soc, ast_entry);
  1604. dp_peer_ast_cleanup(soc, ast_entry);
  1605. qdf_mem_free(ast_entry);
  1606. soc->num_ast_entries--;
  1607. }
  1608. /*
  1609. * dp_peer_unlink_ast_entry() - Free up the ast entry memory
  1610. * @soc: SoC handle
  1611. * @ast_entry: Address search entry
  1612. * @peer: peer
  1613. *
  1614. * This API is used to remove/unlink AST entry from the peer list
  1615. * and hash list.
  1616. *
  1617. * Return: None
  1618. */
  1619. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1620. struct dp_ast_entry *ast_entry,
  1621. struct dp_peer *peer)
  1622. {
  1623. if (!peer) {
  1624. dp_info_rl("NULL peer");
  1625. return;
  1626. }
  1627. if (ast_entry->peer_id == HTT_INVALID_PEER) {
  1628. dp_info_rl("Invalid peer id in AST entry mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1629. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1630. ast_entry->type);
  1631. return;
  1632. }
  1633. /*
  1634. * NOTE: Ensure that call to this API is done
  1635. * after soc->ast_lock is taken
  1636. */
  1637. qdf_assert_always(ast_entry->peer_id == peer->peer_id);
  1638. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1639. if (ast_entry == peer->self_ast_entry)
  1640. peer->self_ast_entry = NULL;
  1641. /*
  1642. * release the reference only if it is mapped
  1643. * to ast_table
  1644. */
  1645. if (ast_entry->is_mapped)
  1646. soc->ast_table[ast_entry->ast_idx] = NULL;
  1647. ast_entry->peer_id = HTT_INVALID_PEER;
  1648. }
  1649. /*
  1650. * dp_peer_del_ast() - Delete and free AST entry
  1651. * @soc: SoC handle
  1652. * @ast_entry: AST entry of the node
  1653. *
  1654. * This function removes the AST entry from peer and soc tables
  1655. * It assumes caller has taken the ast lock to protect the access to these
  1656. * tables
  1657. *
  1658. * Return: None
  1659. */
  1660. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1661. {
  1662. struct dp_peer *peer = NULL;
  1663. if (soc->ast_offload_support)
  1664. return;
  1665. if (!ast_entry) {
  1666. dp_info_rl("NULL AST entry");
  1667. return;
  1668. }
  1669. if (ast_entry->delete_in_progress) {
  1670. dp_info_rl("AST entry deletion in progress mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1671. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1672. ast_entry->type);
  1673. return;
  1674. }
  1675. dp_peer_debug("call by %ps: ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1676. (void *)_RET_IP_, ast_entry->peer_id, ast_entry->vdev_id,
  1677. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1678. ast_entry->delete_in_progress = true;
  1679. /* In teardown del ast is called after setting logical delete state
  1680. * use __dp_peer_get_ref_by_id to get the reference irrespective of
  1681. * state
  1682. */
  1683. peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1684. DP_MOD_ID_AST);
  1685. dp_peer_ast_send_wds_del(soc, ast_entry, peer);
  1686. /* Remove SELF and STATIC entries in teardown itself */
  1687. if (!ast_entry->next_hop)
  1688. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1689. if (ast_entry->is_mapped)
  1690. soc->ast_table[ast_entry->ast_idx] = NULL;
  1691. /* if peer map v2 is enabled we are not freeing ast entry
  1692. * here and it is supposed to be freed in unmap event (after
  1693. * we receive delete confirmation from target)
  1694. *
  1695. * if peer_id is invalid we did not get the peer map event
  1696. * for the peer free ast entry from here only in this case
  1697. */
  1698. if (dp_peer_ast_free_in_unmap_supported(soc, ast_entry))
  1699. goto end;
  1700. /* for WDS secondary entry ast_entry->next_hop would be set so
  1701. * unlinking has to be done explicitly here.
  1702. * As this entry is not a mapped entry unmap notification from
  1703. * FW wil not come. Hence unlinkling is done right here.
  1704. */
  1705. if (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1706. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1707. dp_peer_free_ast_entry(soc, ast_entry);
  1708. end:
  1709. if (peer)
  1710. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1711. }
  1712. /*
  1713. * dp_peer_update_ast() - Delete and free AST entry
  1714. * @soc: SoC handle
  1715. * @peer: peer to which ast node belongs
  1716. * @ast_entry: AST entry of the node
  1717. * @flags: wds or hmwds
  1718. *
  1719. * This function update the AST entry to the roamed peer and soc tables
  1720. * It assumes caller has taken the ast lock to protect the access to these
  1721. * tables
  1722. *
  1723. * Return: 0 if ast entry is updated successfully
  1724. * -1 failure
  1725. */
  1726. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1727. struct dp_ast_entry *ast_entry, uint32_t flags)
  1728. {
  1729. int ret = -1;
  1730. struct dp_peer *old_peer;
  1731. if (soc->ast_offload_support)
  1732. return QDF_STATUS_E_INVAL;
  1733. 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",
  1734. soc, ast_entry->type, peer->vdev->pdev->pdev_id,
  1735. peer->vdev->vdev_id, flags,
  1736. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1737. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  1738. /* Do not send AST update in below cases
  1739. * 1) Ast entry delete has already triggered
  1740. * 2) Peer delete is already triggered
  1741. * 3) We did not get the HTT map for create event
  1742. */
  1743. if (ast_entry->delete_in_progress ||
  1744. !dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE) ||
  1745. !ast_entry->is_mapped)
  1746. return ret;
  1747. if ((ast_entry->type == CDP_TXRX_AST_TYPE_STATIC) ||
  1748. (ast_entry->type == CDP_TXRX_AST_TYPE_SELF) ||
  1749. (ast_entry->type == CDP_TXRX_AST_TYPE_STA_BSS) ||
  1750. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1751. return 0;
  1752. /*
  1753. * Avoids flood of WMI update messages sent to FW for same peer.
  1754. */
  1755. if (qdf_unlikely(ast_entry->peer_id == peer->peer_id) &&
  1756. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS) &&
  1757. (ast_entry->vdev_id == peer->vdev->vdev_id) &&
  1758. (ast_entry->is_active))
  1759. return 0;
  1760. old_peer = dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1761. DP_MOD_ID_AST);
  1762. if (!old_peer)
  1763. return 0;
  1764. TAILQ_REMOVE(&old_peer->ast_entry_list, ast_entry, ase_list_elem);
  1765. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1766. ast_entry->peer_id = peer->peer_id;
  1767. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1768. ast_entry->pdev_id = peer->vdev->pdev->pdev_id;
  1769. ast_entry->vdev_id = peer->vdev->vdev_id;
  1770. ast_entry->is_active = TRUE;
  1771. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1772. ret = dp_update_wds_entry_wrapper(soc,
  1773. peer,
  1774. ast_entry->mac_addr.raw,
  1775. flags);
  1776. return ret;
  1777. }
  1778. /*
  1779. * dp_peer_ast_get_pdev_id() - get pdev_id from the ast entry
  1780. * @soc: SoC handle
  1781. * @ast_entry: AST entry of the node
  1782. *
  1783. * This function gets the pdev_id from the ast entry.
  1784. *
  1785. * Return: (uint8_t) pdev_id
  1786. */
  1787. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1788. struct dp_ast_entry *ast_entry)
  1789. {
  1790. return ast_entry->pdev_id;
  1791. }
  1792. /*
  1793. * dp_peer_ast_get_next_hop() - get next_hop from the ast entry
  1794. * @soc: SoC handle
  1795. * @ast_entry: AST entry of the node
  1796. *
  1797. * This function gets the next hop from the ast entry.
  1798. *
  1799. * Return: (uint8_t) next_hop
  1800. */
  1801. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1802. struct dp_ast_entry *ast_entry)
  1803. {
  1804. return ast_entry->next_hop;
  1805. }
  1806. /*
  1807. * dp_peer_ast_set_type() - set type from the ast entry
  1808. * @soc: SoC handle
  1809. * @ast_entry: AST entry of the node
  1810. *
  1811. * This function sets the type in the ast entry.
  1812. *
  1813. * Return:
  1814. */
  1815. void dp_peer_ast_set_type(struct dp_soc *soc,
  1816. struct dp_ast_entry *ast_entry,
  1817. enum cdp_txrx_ast_entry_type type)
  1818. {
  1819. ast_entry->type = type;
  1820. }
  1821. #else
  1822. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1823. struct dp_peer *peer,
  1824. uint8_t *mac_addr,
  1825. enum cdp_txrx_ast_entry_type type,
  1826. uint32_t flags)
  1827. {
  1828. return QDF_STATUS_E_FAILURE;
  1829. }
  1830. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1831. {
  1832. }
  1833. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1834. struct dp_ast_entry *ast_entry, uint32_t flags)
  1835. {
  1836. return 1;
  1837. }
  1838. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1839. uint8_t *ast_mac_addr)
  1840. {
  1841. return NULL;
  1842. }
  1843. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1844. uint8_t *ast_mac_addr,
  1845. uint8_t pdev_id)
  1846. {
  1847. return NULL;
  1848. }
  1849. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  1850. {
  1851. return QDF_STATUS_SUCCESS;
  1852. }
  1853. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1854. struct dp_peer *peer,
  1855. uint8_t *mac_addr,
  1856. uint16_t hw_peer_id,
  1857. uint8_t vdev_id,
  1858. uint16_t ast_hash,
  1859. uint8_t is_wds)
  1860. {
  1861. return QDF_STATUS_SUCCESS;
  1862. }
  1863. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  1864. {
  1865. }
  1866. void dp_peer_ast_set_type(struct dp_soc *soc,
  1867. struct dp_ast_entry *ast_entry,
  1868. enum cdp_txrx_ast_entry_type type)
  1869. {
  1870. }
  1871. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1872. struct dp_ast_entry *ast_entry)
  1873. {
  1874. return 0xff;
  1875. }
  1876. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1877. struct dp_ast_entry *ast_entry)
  1878. {
  1879. return 0xff;
  1880. }
  1881. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1882. struct dp_ast_entry *ast_entry, uint32_t flags)
  1883. {
  1884. return 1;
  1885. }
  1886. #endif
  1887. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  1888. struct dp_ast_entry *ast_entry,
  1889. struct dp_peer *peer)
  1890. {
  1891. bool delete_in_fw = false;
  1892. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_TRACE,
  1893. "%s: ast_entry->type: %d pdevid: %u vdev: %u mac_addr: "QDF_MAC_ADDR_FMT" next_hop: %u peer_id: %uM\n",
  1894. __func__, ast_entry->type, ast_entry->pdev_id,
  1895. ast_entry->vdev_id,
  1896. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1897. ast_entry->next_hop, ast_entry->peer_id);
  1898. /*
  1899. * If peer state is logical delete, the peer is about to get
  1900. * teared down with a peer delete command to firmware,
  1901. * which will cleanup all the wds ast entries.
  1902. * So, no need to send explicit wds ast delete to firmware.
  1903. */
  1904. if (ast_entry->next_hop) {
  1905. if (peer && dp_peer_state_cmp(peer,
  1906. DP_PEER_STATE_LOGICAL_DELETE))
  1907. delete_in_fw = false;
  1908. else
  1909. delete_in_fw = true;
  1910. dp_del_wds_entry_wrapper(soc,
  1911. ast_entry->vdev_id,
  1912. ast_entry->mac_addr.raw,
  1913. ast_entry->type,
  1914. delete_in_fw);
  1915. }
  1916. }
  1917. #ifdef WLAN_FEATURE_MULTI_AST_DEL
  1918. void dp_peer_ast_send_multi_wds_del(
  1919. struct dp_soc *soc, uint8_t vdev_id,
  1920. struct peer_del_multi_wds_entries *wds_list)
  1921. {
  1922. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  1923. if (cdp_soc && cdp_soc->ol_ops &&
  1924. cdp_soc->ol_ops->peer_del_multi_wds_entry)
  1925. cdp_soc->ol_ops->peer_del_multi_wds_entry(soc->ctrl_psoc,
  1926. vdev_id, wds_list);
  1927. }
  1928. #endif
  1929. #ifdef FEATURE_WDS
  1930. /**
  1931. * dp_peer_ast_free_wds_entries() - Free wds ast entries associated with peer
  1932. * @soc: soc handle
  1933. * @peer: peer handle
  1934. *
  1935. * Free all the wds ast entries associated with peer
  1936. *
  1937. * Return: Number of wds ast entries freed
  1938. */
  1939. static uint32_t dp_peer_ast_free_wds_entries(struct dp_soc *soc,
  1940. struct dp_peer *peer)
  1941. {
  1942. TAILQ_HEAD(, dp_ast_entry) ast_local_list = {0};
  1943. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  1944. uint32_t num_ast = 0;
  1945. TAILQ_INIT(&ast_local_list);
  1946. qdf_spin_lock_bh(&soc->ast_lock);
  1947. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  1948. if (ast_entry->next_hop)
  1949. num_ast++;
  1950. if (ast_entry->is_mapped)
  1951. soc->ast_table[ast_entry->ast_idx] = NULL;
  1952. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1953. DP_STATS_INC(soc, ast.deleted, 1);
  1954. dp_peer_ast_hash_remove(soc, ast_entry);
  1955. TAILQ_INSERT_TAIL(&ast_local_list, ast_entry,
  1956. ase_list_elem);
  1957. soc->num_ast_entries--;
  1958. }
  1959. qdf_spin_unlock_bh(&soc->ast_lock);
  1960. TAILQ_FOREACH_SAFE(ast_entry, &ast_local_list, ase_list_elem,
  1961. temp_ast_entry) {
  1962. if (ast_entry->callback)
  1963. ast_entry->callback(soc->ctrl_psoc,
  1964. dp_soc_to_cdp_soc(soc),
  1965. ast_entry->cookie,
  1966. CDP_TXRX_AST_DELETED);
  1967. qdf_mem_free(ast_entry);
  1968. }
  1969. return num_ast;
  1970. }
  1971. /**
  1972. * dp_peer_clean_wds_entries() - Clean wds ast entries and compare
  1973. * @soc: soc handle
  1974. * @peer: peer handle
  1975. * @free_wds_count - number of wds entries freed by FW with peer delete
  1976. *
  1977. * Free all the wds ast entries associated with peer and compare with
  1978. * the value received from firmware
  1979. *
  1980. * Return: Number of wds ast entries freed
  1981. */
  1982. static void
  1983. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  1984. uint32_t free_wds_count)
  1985. {
  1986. uint32_t wds_deleted = 0;
  1987. if (soc->ast_offload_support)
  1988. return;
  1989. wds_deleted = dp_peer_ast_free_wds_entries(soc, peer);
  1990. if ((DP_PEER_WDS_COUNT_INVALID != free_wds_count) &&
  1991. (free_wds_count != wds_deleted)) {
  1992. DP_STATS_INC(soc, ast.ast_mismatch, 1);
  1993. 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",
  1994. peer, peer->mac_addr.raw, free_wds_count,
  1995. wds_deleted);
  1996. }
  1997. }
  1998. #else
  1999. static void
  2000. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  2001. uint32_t free_wds_count)
  2002. {
  2003. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  2004. qdf_spin_lock_bh(&soc->ast_lock);
  2005. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  2006. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2007. if (ast_entry->is_mapped)
  2008. soc->ast_table[ast_entry->ast_idx] = NULL;
  2009. dp_peer_free_ast_entry(soc, ast_entry);
  2010. }
  2011. peer->self_ast_entry = NULL;
  2012. qdf_spin_unlock_bh(&soc->ast_lock);
  2013. }
  2014. #endif
  2015. /**
  2016. * dp_peer_ast_free_entry_by_mac() - find ast entry by MAC address and delete
  2017. * @soc: soc handle
  2018. * @peer: peer handle
  2019. * @vdev_id: vdev_id
  2020. * @mac_addr: mac address of the AST entry to searc and delete
  2021. *
  2022. * find the ast entry from the peer list using the mac address and free
  2023. * the entry.
  2024. *
  2025. * Return: SUCCESS or NOENT
  2026. */
  2027. static int dp_peer_ast_free_entry_by_mac(struct dp_soc *soc,
  2028. struct dp_peer *peer,
  2029. uint8_t vdev_id,
  2030. uint8_t *mac_addr)
  2031. {
  2032. struct dp_ast_entry *ast_entry;
  2033. void *cookie = NULL;
  2034. txrx_ast_free_cb cb = NULL;
  2035. /*
  2036. * release the reference only if it is mapped
  2037. * to ast_table
  2038. */
  2039. qdf_spin_lock_bh(&soc->ast_lock);
  2040. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  2041. if (!ast_entry) {
  2042. qdf_spin_unlock_bh(&soc->ast_lock);
  2043. return QDF_STATUS_E_NOENT;
  2044. } else if (ast_entry->is_mapped) {
  2045. soc->ast_table[ast_entry->ast_idx] = NULL;
  2046. }
  2047. cb = ast_entry->callback;
  2048. cookie = ast_entry->cookie;
  2049. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2050. dp_peer_free_ast_entry(soc, ast_entry);
  2051. qdf_spin_unlock_bh(&soc->ast_lock);
  2052. if (cb) {
  2053. cb(soc->ctrl_psoc,
  2054. dp_soc_to_cdp_soc(soc),
  2055. cookie,
  2056. CDP_TXRX_AST_DELETED);
  2057. }
  2058. return QDF_STATUS_SUCCESS;
  2059. }
  2060. void dp_peer_find_hash_erase(struct dp_soc *soc)
  2061. {
  2062. int i;
  2063. /*
  2064. * Not really necessary to take peer_ref_mutex lock - by this point,
  2065. * it's known that the soc is no longer in use.
  2066. */
  2067. for (i = 0; i <= soc->peer_hash.mask; i++) {
  2068. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  2069. struct dp_peer *peer, *peer_next;
  2070. /*
  2071. * TAILQ_FOREACH_SAFE must be used here to avoid any
  2072. * memory access violation after peer is freed
  2073. */
  2074. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  2075. hash_list_elem, peer_next) {
  2076. /*
  2077. * Don't remove the peer from the hash table -
  2078. * that would modify the list we are currently
  2079. * traversing, and it's not necessary anyway.
  2080. */
  2081. /*
  2082. * Artificially adjust the peer's ref count to
  2083. * 1, so it will get deleted by
  2084. * dp_peer_unref_delete.
  2085. */
  2086. /* set to zero */
  2087. qdf_atomic_init(&peer->ref_cnt);
  2088. for (i = 0; i < DP_MOD_ID_MAX; i++)
  2089. qdf_atomic_init(&peer->mod_refs[i]);
  2090. /* incr to one */
  2091. qdf_atomic_inc(&peer->ref_cnt);
  2092. qdf_atomic_inc(&peer->mod_refs
  2093. [DP_MOD_ID_CONFIG]);
  2094. dp_peer_unref_delete(peer,
  2095. DP_MOD_ID_CONFIG);
  2096. }
  2097. }
  2098. }
  2099. }
  2100. void dp_peer_ast_table_detach(struct dp_soc *soc)
  2101. {
  2102. if (soc->ast_table) {
  2103. qdf_mem_free(soc->ast_table);
  2104. soc->ast_table = NULL;
  2105. }
  2106. }
  2107. /*
  2108. * dp_peer_find_map_detach() - cleanup memory for peer_id_to_obj_map
  2109. * @soc: soc handle
  2110. *
  2111. * return: none
  2112. */
  2113. void dp_peer_find_map_detach(struct dp_soc *soc)
  2114. {
  2115. if (soc->peer_id_to_obj_map) {
  2116. qdf_mem_free(soc->peer_id_to_obj_map);
  2117. soc->peer_id_to_obj_map = NULL;
  2118. qdf_spinlock_destroy(&soc->peer_map_lock);
  2119. }
  2120. }
  2121. #ifndef AST_OFFLOAD_ENABLE
  2122. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2123. {
  2124. QDF_STATUS status;
  2125. status = dp_peer_find_map_attach(soc);
  2126. if (!QDF_IS_STATUS_SUCCESS(status))
  2127. return status;
  2128. status = dp_peer_find_hash_attach(soc);
  2129. if (!QDF_IS_STATUS_SUCCESS(status))
  2130. goto map_detach;
  2131. status = dp_peer_ast_table_attach(soc);
  2132. if (!QDF_IS_STATUS_SUCCESS(status))
  2133. goto hash_detach;
  2134. status = dp_peer_ast_hash_attach(soc);
  2135. if (!QDF_IS_STATUS_SUCCESS(status))
  2136. goto ast_table_detach;
  2137. status = dp_peer_mec_hash_attach(soc);
  2138. if (QDF_IS_STATUS_SUCCESS(status)) {
  2139. dp_soc_wds_attach(soc);
  2140. return status;
  2141. }
  2142. dp_peer_ast_hash_detach(soc);
  2143. ast_table_detach:
  2144. dp_peer_ast_table_detach(soc);
  2145. hash_detach:
  2146. dp_peer_find_hash_detach(soc);
  2147. map_detach:
  2148. dp_peer_find_map_detach(soc);
  2149. return status;
  2150. }
  2151. #else
  2152. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2153. {
  2154. QDF_STATUS status;
  2155. status = dp_peer_find_map_attach(soc);
  2156. if (!QDF_IS_STATUS_SUCCESS(status))
  2157. return status;
  2158. status = dp_peer_find_hash_attach(soc);
  2159. if (!QDF_IS_STATUS_SUCCESS(status))
  2160. goto map_detach;
  2161. return status;
  2162. map_detach:
  2163. dp_peer_find_map_detach(soc);
  2164. return status;
  2165. }
  2166. #endif
  2167. void dp_rx_tid_stats_cb(struct dp_soc *soc, void *cb_ctxt,
  2168. union hal_reo_status *reo_status)
  2169. {
  2170. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2171. struct hal_reo_queue_status *queue_status = &(reo_status->queue_status);
  2172. if (queue_status->header.status == HAL_REO_CMD_DRAIN)
  2173. return;
  2174. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  2175. DP_PRINT_STATS("REO stats failure %d for TID %d\n",
  2176. queue_status->header.status, rx_tid->tid);
  2177. return;
  2178. }
  2179. DP_PRINT_STATS("REO queue stats (TID: %d):\n"
  2180. "ssn: %d\n"
  2181. "curr_idx : %d\n"
  2182. "pn_31_0 : %08x\n"
  2183. "pn_63_32 : %08x\n"
  2184. "pn_95_64 : %08x\n"
  2185. "pn_127_96 : %08x\n"
  2186. "last_rx_enq_tstamp : %08x\n"
  2187. "last_rx_deq_tstamp : %08x\n"
  2188. "rx_bitmap_31_0 : %08x\n"
  2189. "rx_bitmap_63_32 : %08x\n"
  2190. "rx_bitmap_95_64 : %08x\n"
  2191. "rx_bitmap_127_96 : %08x\n"
  2192. "rx_bitmap_159_128 : %08x\n"
  2193. "rx_bitmap_191_160 : %08x\n"
  2194. "rx_bitmap_223_192 : %08x\n"
  2195. "rx_bitmap_255_224 : %08x\n",
  2196. rx_tid->tid,
  2197. queue_status->ssn, queue_status->curr_idx,
  2198. queue_status->pn_31_0, queue_status->pn_63_32,
  2199. queue_status->pn_95_64, queue_status->pn_127_96,
  2200. queue_status->last_rx_enq_tstamp,
  2201. queue_status->last_rx_deq_tstamp,
  2202. queue_status->rx_bitmap_31_0,
  2203. queue_status->rx_bitmap_63_32,
  2204. queue_status->rx_bitmap_95_64,
  2205. queue_status->rx_bitmap_127_96,
  2206. queue_status->rx_bitmap_159_128,
  2207. queue_status->rx_bitmap_191_160,
  2208. queue_status->rx_bitmap_223_192,
  2209. queue_status->rx_bitmap_255_224);
  2210. DP_PRINT_STATS(
  2211. "curr_mpdu_cnt : %d\n"
  2212. "curr_msdu_cnt : %d\n"
  2213. "fwd_timeout_cnt : %d\n"
  2214. "fwd_bar_cnt : %d\n"
  2215. "dup_cnt : %d\n"
  2216. "frms_in_order_cnt : %d\n"
  2217. "bar_rcvd_cnt : %d\n"
  2218. "mpdu_frms_cnt : %d\n"
  2219. "msdu_frms_cnt : %d\n"
  2220. "total_byte_cnt : %d\n"
  2221. "late_recv_mpdu_cnt : %d\n"
  2222. "win_jump_2k : %d\n"
  2223. "hole_cnt : %d\n",
  2224. queue_status->curr_mpdu_cnt,
  2225. queue_status->curr_msdu_cnt,
  2226. queue_status->fwd_timeout_cnt,
  2227. queue_status->fwd_bar_cnt,
  2228. queue_status->dup_cnt,
  2229. queue_status->frms_in_order_cnt,
  2230. queue_status->bar_rcvd_cnt,
  2231. queue_status->mpdu_frms_cnt,
  2232. queue_status->msdu_frms_cnt,
  2233. queue_status->total_cnt,
  2234. queue_status->late_recv_mpdu_cnt,
  2235. queue_status->win_jump_2k,
  2236. queue_status->hole_cnt);
  2237. DP_PRINT_STATS("Addba Req : %d\n"
  2238. "Addba Resp : %d\n"
  2239. "Addba Resp success : %d\n"
  2240. "Addba Resp failed : %d\n"
  2241. "Delba Req received : %d\n"
  2242. "Delba Tx success : %d\n"
  2243. "Delba Tx Fail : %d\n"
  2244. "BA window size : %d\n"
  2245. "Pn size : %d\n",
  2246. rx_tid->num_of_addba_req,
  2247. rx_tid->num_of_addba_resp,
  2248. rx_tid->num_addba_rsp_success,
  2249. rx_tid->num_addba_rsp_failed,
  2250. rx_tid->num_of_delba_req,
  2251. rx_tid->delba_tx_success_cnt,
  2252. rx_tid->delba_tx_fail_cnt,
  2253. rx_tid->ba_win_size,
  2254. rx_tid->pn_size);
  2255. }
  2256. #ifdef REO_SHARED_QREF_TABLE_EN
  2257. void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2258. struct dp_peer *peer)
  2259. {
  2260. uint8_t tid;
  2261. if (IS_MLO_DP_LINK_PEER(peer))
  2262. return;
  2263. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc)) {
  2264. for (tid = 0; tid < DP_MAX_TIDS; tid++)
  2265. hal_reo_shared_qaddr_write(soc->hal_soc,
  2266. peer->peer_id, tid, 0);
  2267. }
  2268. }
  2269. #endif
  2270. /*
  2271. * dp_peer_find_add_id() - map peer_id with peer
  2272. * @soc: soc handle
  2273. * @peer_mac_addr: peer mac address
  2274. * @peer_id: peer id to be mapped
  2275. * @hw_peer_id: HW ast index
  2276. * @vdev_id: vdev_id
  2277. *
  2278. * return: peer in success
  2279. * NULL in failure
  2280. */
  2281. static inline struct dp_peer *dp_peer_find_add_id(struct dp_soc *soc,
  2282. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  2283. uint8_t vdev_id)
  2284. {
  2285. struct dp_peer *peer;
  2286. QDF_ASSERT(peer_id <= soc->max_peer_id);
  2287. /* check if there's already a peer object with this MAC address */
  2288. peer = dp_peer_find_hash_find(soc, peer_mac_addr,
  2289. 0 /* is aligned */, vdev_id, DP_MOD_ID_CONFIG);
  2290. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  2291. soc, peer, peer_id, vdev_id,
  2292. QDF_MAC_ADDR_REF(peer_mac_addr));
  2293. if (peer) {
  2294. /* peer's ref count was already incremented by
  2295. * peer_find_hash_find
  2296. */
  2297. dp_peer_info("%pK: ref_cnt: %d", soc,
  2298. qdf_atomic_read(&peer->ref_cnt));
  2299. /*
  2300. * if peer is in logical delete CP triggered delete before map
  2301. * is received ignore this event
  2302. */
  2303. if (dp_peer_state_cmp(peer, DP_PEER_STATE_LOGICAL_DELETE)) {
  2304. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2305. dp_alert("Peer %pK["QDF_MAC_ADDR_FMT"] logical delete state vid %d",
  2306. peer, QDF_MAC_ADDR_REF(peer_mac_addr),
  2307. vdev_id);
  2308. return NULL;
  2309. }
  2310. if (peer->peer_id == HTT_INVALID_PEER) {
  2311. if (!IS_MLO_DP_MLD_PEER(peer))
  2312. dp_monitor_peer_tid_peer_id_update(soc, peer,
  2313. peer_id);
  2314. } else {
  2315. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2316. QDF_ASSERT(0);
  2317. return NULL;
  2318. }
  2319. dp_peer_find_id_to_obj_add(soc, peer, peer_id);
  2320. dp_mlo_partner_chips_map(soc, peer, peer_id);
  2321. dp_peer_update_state(soc, peer, DP_PEER_STATE_ACTIVE);
  2322. return peer;
  2323. }
  2324. return NULL;
  2325. }
  2326. #ifdef WLAN_FEATURE_11BE_MLO
  2327. #ifdef DP_USE_REDUCED_PEER_ID_FIELD_WIDTH
  2328. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2329. uint16_t peer_id)
  2330. {
  2331. return ((peer_id & soc->peer_id_mask) | (1 << soc->peer_id_shift));
  2332. }
  2333. #else
  2334. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2335. uint16_t peer_id)
  2336. {
  2337. return (peer_id | (1 << HTT_RX_PEER_META_DATA_V1_ML_PEER_VALID_S));
  2338. }
  2339. #endif
  2340. QDF_STATUS
  2341. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2342. uint8_t *peer_mac_addr,
  2343. struct dp_mlo_flow_override_info *mlo_flow_info,
  2344. struct dp_mlo_link_info *mlo_link_info)
  2345. {
  2346. struct dp_peer *peer = NULL;
  2347. uint16_t hw_peer_id = mlo_flow_info[0].ast_idx;
  2348. uint16_t ast_hash = mlo_flow_info[0].cache_set_num;
  2349. uint8_t vdev_id = 0;
  2350. uint8_t is_wds = 0;
  2351. int i;
  2352. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2353. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2354. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2355. struct dp_soc *primary_soc;
  2356. dp_info("mlo_peer_map_event (soc:%pK): peer_id %d ml_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT,
  2357. soc, peer_id, ml_peer_id,
  2358. QDF_MAC_ADDR_REF(peer_mac_addr));
  2359. /* Get corresponding vdev ID for the peer based
  2360. * on chip ID obtained from mlo peer_map event
  2361. */
  2362. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  2363. if (mlo_link_info[i].peer_chip_id == dp_mlo_get_chip_id(soc)) {
  2364. vdev_id = mlo_link_info[i].vdev_id;
  2365. break;
  2366. }
  2367. }
  2368. peer = dp_peer_find_add_id(soc, peer_mac_addr, ml_peer_id,
  2369. hw_peer_id, vdev_id);
  2370. if (peer) {
  2371. if (wlan_op_mode_sta == peer->vdev->opmode &&
  2372. qdf_mem_cmp(peer->mac_addr.raw,
  2373. peer->vdev->mld_mac_addr.raw,
  2374. QDF_MAC_ADDR_SIZE) != 0) {
  2375. dp_peer_info("%pK: STA vdev bss_peer!!!!", soc);
  2376. peer->bss_peer = 1;
  2377. if (peer->txrx_peer)
  2378. peer->txrx_peer->bss_peer = 1;
  2379. }
  2380. if (peer->vdev->opmode == wlan_op_mode_sta) {
  2381. peer->vdev->bss_ast_hash = ast_hash;
  2382. peer->vdev->bss_ast_idx = hw_peer_id;
  2383. }
  2384. /* Add ast entry incase self ast entry is
  2385. * deleted due to DP CP sync issue
  2386. *
  2387. * self_ast_entry is modified in peer create
  2388. * and peer unmap path which cannot run in
  2389. * parllel with peer map, no lock need before
  2390. * referring it
  2391. */
  2392. if (!peer->self_ast_entry) {
  2393. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2394. QDF_MAC_ADDR_REF(peer_mac_addr));
  2395. dp_peer_add_ast(soc, peer,
  2396. peer_mac_addr,
  2397. type, 0);
  2398. }
  2399. /* If peer setup and hence rx_tid setup got called
  2400. * before htt peer map then Qref write to LUT did not
  2401. * happen in rx_tid setup as peer_id was invalid.
  2402. * So defer Qref write to peer map handler. Check if
  2403. * rx_tid qdesc for tid 0 is already setup and perform
  2404. * qref write to LUT for Tid 0 and 16.
  2405. *
  2406. * Peer map could be obtained on assoc link, hence
  2407. * change to primary link's soc.
  2408. */
  2409. primary_soc = peer->vdev->pdev->soc;
  2410. if (hal_reo_shared_qaddr_is_enable(primary_soc->hal_soc) &&
  2411. peer->rx_tid[0].hw_qdesc_vaddr_unaligned) {
  2412. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2413. ml_peer_id,
  2414. 0,
  2415. peer->rx_tid[0].hw_qdesc_paddr);
  2416. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2417. ml_peer_id,
  2418. DP_NON_QOS_TID,
  2419. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2420. }
  2421. }
  2422. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2423. vdev_id, ast_hash, is_wds);
  2424. return err;
  2425. }
  2426. #endif
  2427. #ifdef DP_RX_UDP_OVER_PEER_ROAM
  2428. void dp_rx_reset_roaming_peer(struct dp_soc *soc, uint8_t vdev_id,
  2429. uint8_t *peer_mac_addr)
  2430. {
  2431. struct dp_vdev *vdev = NULL;
  2432. vdev = dp_vdev_get_ref_by_id(soc, vdev_id, DP_MOD_ID_HTT);
  2433. if (vdev) {
  2434. if (qdf_mem_cmp(vdev->roaming_peer_mac.raw, peer_mac_addr,
  2435. QDF_MAC_ADDR_SIZE) == 0) {
  2436. vdev->roaming_peer_status =
  2437. WLAN_ROAM_PEER_AUTH_STATUS_NONE;
  2438. qdf_mem_zero(vdev->roaming_peer_mac.raw,
  2439. QDF_MAC_ADDR_SIZE);
  2440. }
  2441. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_HTT);
  2442. }
  2443. }
  2444. #endif
  2445. /**
  2446. * dp_rx_peer_map_handler() - handle peer map event from firmware
  2447. * @soc_handle - genereic soc handle
  2448. * @peeri_id - peer_id from firmware
  2449. * @hw_peer_id - ast index for this peer
  2450. * @vdev_id - vdev ID
  2451. * @peer_mac_addr - mac address of the peer
  2452. * @ast_hash - ast hash value
  2453. * @is_wds - flag to indicate peer map event for WDS ast entry
  2454. *
  2455. * associate the peer_id that firmware provided with peer entry
  2456. * and update the ast table in the host with the hw_peer_id.
  2457. *
  2458. * Return: QDF_STATUS code
  2459. */
  2460. QDF_STATUS
  2461. dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2462. uint16_t hw_peer_id, uint8_t vdev_id,
  2463. uint8_t *peer_mac_addr, uint16_t ast_hash,
  2464. uint8_t is_wds)
  2465. {
  2466. struct dp_peer *peer = NULL;
  2467. struct dp_vdev *vdev = NULL;
  2468. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2469. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2470. dp_info("peer_map_event (soc:%pK): peer_id %d, hw_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT", vdev_id %d",
  2471. soc, peer_id, hw_peer_id,
  2472. QDF_MAC_ADDR_REF(peer_mac_addr), vdev_id);
  2473. /* Peer map event for WDS ast entry get the peer from
  2474. * obj map
  2475. */
  2476. if (is_wds) {
  2477. if (!soc->ast_offload_support) {
  2478. peer = dp_peer_get_ref_by_id(soc, peer_id,
  2479. DP_MOD_ID_HTT);
  2480. err = dp_peer_map_ast(soc, peer, peer_mac_addr,
  2481. hw_peer_id,
  2482. vdev_id, ast_hash, is_wds);
  2483. if (peer)
  2484. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2485. }
  2486. } else {
  2487. /*
  2488. * It's the responsibility of the CP and FW to ensure
  2489. * that peer is created successfully. Ideally DP should
  2490. * not hit the below condition for directly assocaited
  2491. * peers.
  2492. */
  2493. if ((!soc->ast_offload_support) && ((hw_peer_id < 0) ||
  2494. (hw_peer_id >=
  2495. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)))) {
  2496. dp_peer_err("%pK: invalid hw_peer_id: %d", soc, hw_peer_id);
  2497. qdf_assert_always(0);
  2498. }
  2499. peer = dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  2500. hw_peer_id, vdev_id);
  2501. if (peer) {
  2502. vdev = peer->vdev;
  2503. /* Only check for STA Vdev and peer is not for TDLS */
  2504. if (wlan_op_mode_sta == vdev->opmode &&
  2505. !peer->is_tdls_peer) {
  2506. if (qdf_mem_cmp(peer->mac_addr.raw,
  2507. vdev->mac_addr.raw,
  2508. QDF_MAC_ADDR_SIZE) != 0) {
  2509. dp_info("%pK: STA vdev bss_peer", soc);
  2510. peer->bss_peer = 1;
  2511. if (peer->txrx_peer)
  2512. peer->txrx_peer->bss_peer = 1;
  2513. }
  2514. dp_info("bss ast_hash 0x%x, ast_index 0x%x",
  2515. ast_hash, hw_peer_id);
  2516. vdev->bss_ast_hash = ast_hash;
  2517. vdev->bss_ast_idx = hw_peer_id;
  2518. }
  2519. /* Add ast entry incase self ast entry is
  2520. * deleted due to DP CP sync issue
  2521. *
  2522. * self_ast_entry is modified in peer create
  2523. * and peer unmap path which cannot run in
  2524. * parllel with peer map, no lock need before
  2525. * referring it
  2526. */
  2527. if (!soc->ast_offload_support &&
  2528. !peer->self_ast_entry) {
  2529. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2530. QDF_MAC_ADDR_REF(peer_mac_addr));
  2531. dp_peer_add_ast(soc, peer,
  2532. peer_mac_addr,
  2533. type, 0);
  2534. }
  2535. /* If peer setup and hence rx_tid setup got called
  2536. * before htt peer map then Qref write to LUT did
  2537. * not happen in rx_tid setup as peer_id was invalid.
  2538. * So defer Qref write to peer map handler. Check if
  2539. * rx_tid qdesc for tid 0 is already setup perform qref
  2540. * write to LUT for Tid 0 and 16.
  2541. */
  2542. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc) &&
  2543. peer->rx_tid[0].hw_qdesc_vaddr_unaligned &&
  2544. !IS_MLO_DP_LINK_PEER(peer)) {
  2545. hal_reo_shared_qaddr_write(soc->hal_soc,
  2546. peer_id,
  2547. 0,
  2548. peer->rx_tid[0].hw_qdesc_paddr);
  2549. hal_reo_shared_qaddr_write(soc->hal_soc,
  2550. peer_id,
  2551. DP_NON_QOS_TID,
  2552. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2553. }
  2554. }
  2555. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2556. vdev_id, ast_hash, is_wds);
  2557. }
  2558. dp_rx_reset_roaming_peer(soc, vdev_id, peer_mac_addr);
  2559. return err;
  2560. }
  2561. /**
  2562. * dp_rx_peer_unmap_handler() - handle peer unmap event from firmware
  2563. * @soc_handle - genereic soc handle
  2564. * @peeri_id - peer_id from firmware
  2565. * @vdev_id - vdev ID
  2566. * @mac_addr - mac address of the peer or wds entry
  2567. * @is_wds - flag to indicate peer map event for WDS ast entry
  2568. * @free_wds_count - number of wds entries freed by FW with peer delete
  2569. *
  2570. * Return: none
  2571. */
  2572. void
  2573. dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  2574. uint8_t vdev_id, uint8_t *mac_addr,
  2575. uint8_t is_wds, uint32_t free_wds_count)
  2576. {
  2577. struct dp_peer *peer;
  2578. struct dp_vdev *vdev = NULL;
  2579. if (soc->ast_offload_support && is_wds)
  2580. return;
  2581. peer = __dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  2582. /*
  2583. * Currently peer IDs are assigned for vdevs as well as peers.
  2584. * If the peer ID is for a vdev, then the peer pointer stored
  2585. * in peer_id_to_obj_map will be NULL.
  2586. */
  2587. if (!peer) {
  2588. dp_err("Received unmap event for invalid peer_id %u",
  2589. peer_id);
  2590. return;
  2591. }
  2592. /* If V2 Peer map messages are enabled AST entry has to be
  2593. * freed here
  2594. */
  2595. if (is_wds) {
  2596. if (!dp_peer_ast_free_entry_by_mac(soc, peer, vdev_id,
  2597. mac_addr)) {
  2598. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2599. return;
  2600. }
  2601. 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",
  2602. peer, peer->peer_id,
  2603. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2604. QDF_MAC_ADDR_REF(mac_addr), vdev_id,
  2605. is_wds);
  2606. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2607. return;
  2608. }
  2609. dp_peer_clean_wds_entries(soc, peer, free_wds_count);
  2610. dp_info("peer_unmap_event (soc:%pK) peer_id %d peer %pK",
  2611. soc, peer_id, peer);
  2612. /* Clear entries in Qref LUT */
  2613. /* TODO: Check if this is to be called from
  2614. * dp_peer_delete for MLO case if there is race between
  2615. * new peer id assignment and still not having received
  2616. * peer unmap for MLD peer with same peer id.
  2617. */
  2618. dp_peer_rx_reo_shared_qaddr_delete(soc, peer);
  2619. dp_peer_find_id_to_obj_remove(soc, peer_id);
  2620. dp_mlo_partner_chips_unmap(soc, peer_id);
  2621. peer->peer_id = HTT_INVALID_PEER;
  2622. /*
  2623. * Reset ast flow mapping table
  2624. */
  2625. if (!soc->ast_offload_support)
  2626. dp_peer_reset_flowq_map(peer);
  2627. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  2628. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  2629. peer_id, vdev_id);
  2630. }
  2631. vdev = peer->vdev;
  2632. dp_update_vdev_stats_on_peer_unmap(vdev, peer);
  2633. dp_peer_update_state(soc, peer, DP_PEER_STATE_INACTIVE);
  2634. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2635. /*
  2636. * Remove a reference to the peer.
  2637. * If there are no more references, delete the peer object.
  2638. */
  2639. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2640. }
  2641. #ifdef WLAN_FEATURE_11BE_MLO
  2642. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id)
  2643. {
  2644. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2645. uint8_t mac_addr[QDF_MAC_ADDR_SIZE] = {0};
  2646. uint8_t vdev_id = DP_VDEV_ALL;
  2647. uint8_t is_wds = 0;
  2648. dp_info("MLO peer_unmap_event (soc:%pK) peer_id %d",
  2649. soc, peer_id);
  2650. dp_rx_peer_unmap_handler(soc, ml_peer_id, vdev_id,
  2651. mac_addr, is_wds,
  2652. DP_PEER_WDS_COUNT_INVALID);
  2653. }
  2654. #endif
  2655. #ifndef AST_OFFLOAD_ENABLE
  2656. void
  2657. dp_peer_find_detach(struct dp_soc *soc)
  2658. {
  2659. dp_soc_wds_detach(soc);
  2660. dp_peer_find_map_detach(soc);
  2661. dp_peer_find_hash_detach(soc);
  2662. dp_peer_ast_hash_detach(soc);
  2663. dp_peer_ast_table_detach(soc);
  2664. dp_peer_mec_hash_detach(soc);
  2665. }
  2666. #else
  2667. void
  2668. dp_peer_find_detach(struct dp_soc *soc)
  2669. {
  2670. dp_peer_find_map_detach(soc);
  2671. dp_peer_find_hash_detach(soc);
  2672. }
  2673. #endif
  2674. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  2675. union hal_reo_status *reo_status)
  2676. {
  2677. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2678. if ((reo_status->rx_queue_status.header.status !=
  2679. HAL_REO_CMD_SUCCESS) &&
  2680. (reo_status->rx_queue_status.header.status !=
  2681. HAL_REO_CMD_DRAIN)) {
  2682. /* Should not happen normally. Just print error for now */
  2683. dp_peer_err("%pK: Rx tid HW desc update failed(%d): tid %d",
  2684. soc, reo_status->rx_queue_status.header.status,
  2685. rx_tid->tid);
  2686. }
  2687. }
  2688. static bool dp_get_peer_vdev_roaming_in_progress(struct dp_peer *peer)
  2689. {
  2690. struct ol_if_ops *ol_ops = NULL;
  2691. bool is_roaming = false;
  2692. uint8_t vdev_id = -1;
  2693. struct cdp_soc_t *soc;
  2694. if (!peer) {
  2695. dp_peer_info("Peer is NULL. No roaming possible");
  2696. return false;
  2697. }
  2698. soc = dp_soc_to_cdp_soc_t(peer->vdev->pdev->soc);
  2699. ol_ops = peer->vdev->pdev->soc->cdp_soc.ol_ops;
  2700. if (ol_ops && ol_ops->is_roam_inprogress) {
  2701. dp_get_vdevid(soc, peer->mac_addr.raw, &vdev_id);
  2702. is_roaming = ol_ops->is_roam_inprogress(vdev_id);
  2703. }
  2704. dp_peer_info("peer: " QDF_MAC_ADDR_FMT ", vdev_id: %d, is_roaming: %d",
  2705. QDF_MAC_ADDR_REF(peer->mac_addr.raw), vdev_id, is_roaming);
  2706. return is_roaming;
  2707. }
  2708. #ifdef WLAN_FEATURE_11BE_MLO
  2709. /**
  2710. * dp_rx_tid_setup_allow() - check if rx_tid and reo queue desc
  2711. setup is necessary
  2712. * @peer: DP peer handle
  2713. *
  2714. * Return: true - allow, false - disallow
  2715. */
  2716. static inline
  2717. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2718. {
  2719. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  2720. return false;
  2721. return true;
  2722. }
  2723. /**
  2724. * dp_rx_tid_update_allow() - check if rx_tid update needed
  2725. * @peer: DP peer handle
  2726. *
  2727. * Return: true - allow, false - disallow
  2728. */
  2729. static inline
  2730. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2731. {
  2732. /* not as expected for MLO connection link peer */
  2733. if (IS_MLO_DP_LINK_PEER(peer)) {
  2734. QDF_BUG(0);
  2735. return false;
  2736. }
  2737. return true;
  2738. }
  2739. #else
  2740. static inline
  2741. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2742. {
  2743. return true;
  2744. }
  2745. static inline
  2746. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2747. {
  2748. return true;
  2749. }
  2750. #endif
  2751. QDF_STATUS dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  2752. ba_window_size, uint32_t start_seq,
  2753. bool bar_update)
  2754. {
  2755. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  2756. struct dp_soc *soc = peer->vdev->pdev->soc;
  2757. struct hal_reo_cmd_params params;
  2758. if (!dp_rx_tid_update_allow(peer)) {
  2759. dp_peer_err("skip tid update for peer:" QDF_MAC_ADDR_FMT,
  2760. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2761. return QDF_STATUS_E_FAILURE;
  2762. }
  2763. qdf_mem_zero(&params, sizeof(params));
  2764. params.std.need_status = 1;
  2765. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  2766. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2767. params.u.upd_queue_params.update_ba_window_size = 1;
  2768. params.u.upd_queue_params.ba_window_size = ba_window_size;
  2769. if (start_seq < IEEE80211_SEQ_MAX) {
  2770. params.u.upd_queue_params.update_ssn = 1;
  2771. params.u.upd_queue_params.ssn = start_seq;
  2772. } else {
  2773. dp_set_ssn_valid_flag(&params, 0);
  2774. }
  2775. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  2776. dp_rx_tid_update_cb, rx_tid)) {
  2777. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  2778. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  2779. }
  2780. rx_tid->ba_win_size = ba_window_size;
  2781. if (dp_get_peer_vdev_roaming_in_progress(peer))
  2782. return QDF_STATUS_E_PERM;
  2783. if (!bar_update)
  2784. dp_peer_rx_reorder_queue_setup(soc, peer,
  2785. tid, ba_window_size);
  2786. return QDF_STATUS_SUCCESS;
  2787. }
  2788. #ifdef WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY
  2789. /*
  2790. * dp_reo_desc_defer_free_enqueue() - enqueue REO QDESC to be freed into
  2791. * the deferred list
  2792. * @soc: Datapath soc handle
  2793. * @free_desc: REO DESC reference that needs to be freed
  2794. *
  2795. * Return: true if enqueued, else false
  2796. */
  2797. static bool dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  2798. struct reo_desc_list_node *freedesc)
  2799. {
  2800. struct reo_desc_deferred_freelist_node *desc;
  2801. if (!qdf_atomic_read(&soc->cmn_init_done))
  2802. return false;
  2803. desc = qdf_mem_malloc(sizeof(*desc));
  2804. if (!desc)
  2805. return false;
  2806. desc->hw_qdesc_paddr = freedesc->rx_tid.hw_qdesc_paddr;
  2807. desc->hw_qdesc_alloc_size = freedesc->rx_tid.hw_qdesc_alloc_size;
  2808. desc->hw_qdesc_vaddr_unaligned =
  2809. freedesc->rx_tid.hw_qdesc_vaddr_unaligned;
  2810. desc->free_ts = qdf_get_system_timestamp();
  2811. DP_RX_REO_QDESC_DEFERRED_GET_MAC(desc, freedesc);
  2812. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  2813. if (!soc->reo_desc_deferred_freelist_init) {
  2814. qdf_mem_free(desc);
  2815. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2816. return false;
  2817. }
  2818. qdf_list_insert_back(&soc->reo_desc_deferred_freelist,
  2819. (qdf_list_node_t *)desc);
  2820. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2821. return true;
  2822. }
  2823. /*
  2824. * dp_reo_desc_defer_free() - free the REO QDESC in the deferred list
  2825. * based on time threshold
  2826. * @soc: Datapath soc handle
  2827. * @free_desc: REO DESC reference that needs to be freed
  2828. *
  2829. * Return: true if enqueued, else false
  2830. */
  2831. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  2832. {
  2833. struct reo_desc_deferred_freelist_node *desc;
  2834. unsigned long curr_ts = qdf_get_system_timestamp();
  2835. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  2836. while ((qdf_list_peek_front(&soc->reo_desc_deferred_freelist,
  2837. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  2838. (curr_ts > (desc->free_ts + REO_DESC_DEFERRED_FREE_MS))) {
  2839. qdf_list_remove_front(&soc->reo_desc_deferred_freelist,
  2840. (qdf_list_node_t **)&desc);
  2841. DP_RX_REO_QDESC_DEFERRED_FREE_EVT(desc);
  2842. qdf_mem_unmap_nbytes_single(soc->osdev,
  2843. desc->hw_qdesc_paddr,
  2844. QDF_DMA_BIDIRECTIONAL,
  2845. desc->hw_qdesc_alloc_size);
  2846. qdf_mem_free(desc->hw_qdesc_vaddr_unaligned);
  2847. qdf_mem_free(desc);
  2848. curr_ts = qdf_get_system_timestamp();
  2849. }
  2850. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2851. }
  2852. #else
  2853. static inline bool
  2854. dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  2855. struct reo_desc_list_node *freedesc)
  2856. {
  2857. return false;
  2858. }
  2859. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  2860. {
  2861. }
  2862. #endif /* !WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY */
  2863. /*
  2864. * dp_reo_desc_free() - Callback free reo descriptor memory after
  2865. * HW cache flush
  2866. *
  2867. * @soc: DP SOC handle
  2868. * @cb_ctxt: Callback context
  2869. * @reo_status: REO command status
  2870. */
  2871. static void dp_reo_desc_free(struct dp_soc *soc, void *cb_ctxt,
  2872. union hal_reo_status *reo_status)
  2873. {
  2874. struct reo_desc_list_node *freedesc =
  2875. (struct reo_desc_list_node *)cb_ctxt;
  2876. struct dp_rx_tid *rx_tid = &freedesc->rx_tid;
  2877. unsigned long curr_ts = qdf_get_system_timestamp();
  2878. if ((reo_status->fl_cache_status.header.status !=
  2879. HAL_REO_CMD_SUCCESS) &&
  2880. (reo_status->fl_cache_status.header.status !=
  2881. HAL_REO_CMD_DRAIN)) {
  2882. dp_peer_err("%pK: Rx tid HW desc flush failed(%d): tid %d",
  2883. soc, reo_status->rx_queue_status.header.status,
  2884. freedesc->rx_tid.tid);
  2885. }
  2886. dp_peer_info("%pK: %lu hw_qdesc_paddr: %pK, tid:%d", soc,
  2887. curr_ts, (void *)(rx_tid->hw_qdesc_paddr),
  2888. rx_tid->tid);
  2889. /* REO desc is enqueued to be freed at a later point
  2890. * in time, just free the freedesc alone and return
  2891. */
  2892. if (dp_reo_desc_defer_free_enqueue(soc, freedesc))
  2893. goto out;
  2894. DP_RX_REO_QDESC_FREE_EVT(freedesc);
  2895. qdf_mem_unmap_nbytes_single(soc->osdev,
  2896. rx_tid->hw_qdesc_paddr,
  2897. QDF_DMA_BIDIRECTIONAL,
  2898. rx_tid->hw_qdesc_alloc_size);
  2899. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  2900. out:
  2901. qdf_mem_free(freedesc);
  2902. }
  2903. #if defined(CONFIG_WIFI_EMULATION_WIFI_3_0) && defined(BUILD_X86)
  2904. /* Hawkeye emulation requires bus address to be >= 0x50000000 */
  2905. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  2906. {
  2907. if (dma_addr < 0x50000000)
  2908. return QDF_STATUS_E_FAILURE;
  2909. else
  2910. return QDF_STATUS_SUCCESS;
  2911. }
  2912. #else
  2913. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  2914. {
  2915. return QDF_STATUS_SUCCESS;
  2916. }
  2917. #endif
  2918. /*
  2919. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  2920. * @peer: Datapath peer handle
  2921. * @tid: TID
  2922. * @ba_window_size: BlockAck window size
  2923. * @start_seq: Starting sequence number
  2924. *
  2925. * Return: QDF_STATUS code
  2926. */
  2927. QDF_STATUS dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  2928. uint32_t ba_window_size, uint32_t start_seq)
  2929. {
  2930. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  2931. struct dp_vdev *vdev = peer->vdev;
  2932. struct dp_soc *soc = vdev->pdev->soc;
  2933. uint32_t hw_qdesc_size;
  2934. uint32_t hw_qdesc_align;
  2935. int hal_pn_type;
  2936. void *hw_qdesc_vaddr;
  2937. uint32_t alloc_tries = 0;
  2938. QDF_STATUS status = QDF_STATUS_SUCCESS;
  2939. struct dp_txrx_peer *txrx_peer;
  2940. if (!qdf_atomic_read(&peer->is_default_route_set))
  2941. return QDF_STATUS_E_FAILURE;
  2942. if (!dp_rx_tid_setup_allow(peer)) {
  2943. dp_peer_info("skip rx tid setup for peer" QDF_MAC_ADDR_FMT,
  2944. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2945. goto send_wmi_reo_cmd;
  2946. }
  2947. rx_tid->ba_win_size = ba_window_size;
  2948. if (rx_tid->hw_qdesc_vaddr_unaligned)
  2949. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  2950. start_seq, false);
  2951. rx_tid->delba_tx_status = 0;
  2952. rx_tid->ppdu_id_2k = 0;
  2953. rx_tid->num_of_addba_req = 0;
  2954. rx_tid->num_of_delba_req = 0;
  2955. rx_tid->num_of_addba_resp = 0;
  2956. rx_tid->num_addba_rsp_failed = 0;
  2957. rx_tid->num_addba_rsp_success = 0;
  2958. rx_tid->delba_tx_success_cnt = 0;
  2959. rx_tid->delba_tx_fail_cnt = 0;
  2960. rx_tid->statuscode = 0;
  2961. /* TODO: Allocating HW queue descriptors based on max BA window size
  2962. * for all QOS TIDs so that same descriptor can be used later when
  2963. * ADDBA request is recevied. This should be changed to allocate HW
  2964. * queue descriptors based on BA window size being negotiated (0 for
  2965. * non BA cases), and reallocate when BA window size changes and also
  2966. * send WMI message to FW to change the REO queue descriptor in Rx
  2967. * peer entry as part of dp_rx_tid_update.
  2968. */
  2969. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  2970. ba_window_size, tid);
  2971. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  2972. /* To avoid unnecessary extra allocation for alignment, try allocating
  2973. * exact size and see if we already have aligned address.
  2974. */
  2975. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  2976. try_desc_alloc:
  2977. rx_tid->hw_qdesc_vaddr_unaligned =
  2978. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size);
  2979. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  2980. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  2981. soc, tid);
  2982. return QDF_STATUS_E_NOMEM;
  2983. }
  2984. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  2985. hw_qdesc_align) {
  2986. /* Address allocated above is not alinged. Allocate extra
  2987. * memory for alignment
  2988. */
  2989. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  2990. rx_tid->hw_qdesc_vaddr_unaligned =
  2991. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size +
  2992. hw_qdesc_align - 1);
  2993. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  2994. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  2995. soc, tid);
  2996. return QDF_STATUS_E_NOMEM;
  2997. }
  2998. hw_qdesc_vaddr = (void *)qdf_align((unsigned long)
  2999. rx_tid->hw_qdesc_vaddr_unaligned,
  3000. hw_qdesc_align);
  3001. dp_peer_debug("%pK: Total Size %d Aligned Addr %pK",
  3002. soc, rx_tid->hw_qdesc_alloc_size,
  3003. hw_qdesc_vaddr);
  3004. } else {
  3005. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  3006. }
  3007. rx_tid->hw_qdesc_vaddr_aligned = hw_qdesc_vaddr;
  3008. txrx_peer = dp_get_txrx_peer(peer);
  3009. /* TODO: Ensure that sec_type is set before ADDBA is received.
  3010. * Currently this is set based on htt indication
  3011. * HTT_T2H_MSG_TYPE_SEC_IND from target
  3012. */
  3013. switch (txrx_peer->security[dp_sec_ucast].sec_type) {
  3014. case cdp_sec_type_tkip_nomic:
  3015. case cdp_sec_type_aes_ccmp:
  3016. case cdp_sec_type_aes_ccmp_256:
  3017. case cdp_sec_type_aes_gcmp:
  3018. case cdp_sec_type_aes_gcmp_256:
  3019. hal_pn_type = HAL_PN_WPA;
  3020. break;
  3021. case cdp_sec_type_wapi:
  3022. if (vdev->opmode == wlan_op_mode_ap)
  3023. hal_pn_type = HAL_PN_WAPI_EVEN;
  3024. else
  3025. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  3026. break;
  3027. default:
  3028. hal_pn_type = HAL_PN_NONE;
  3029. break;
  3030. }
  3031. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  3032. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type,
  3033. vdev->vdev_stats_id);
  3034. qdf_mem_map_nbytes_single(soc->osdev, hw_qdesc_vaddr,
  3035. QDF_DMA_BIDIRECTIONAL, rx_tid->hw_qdesc_alloc_size,
  3036. &(rx_tid->hw_qdesc_paddr));
  3037. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) !=
  3038. QDF_STATUS_SUCCESS) {
  3039. if (alloc_tries++ < 10) {
  3040. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3041. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3042. goto try_desc_alloc;
  3043. } else {
  3044. dp_peer_err("%pK: Rx tid HW desc alloc failed (lowmem): tid %d",
  3045. soc, tid);
  3046. status = QDF_STATUS_E_NOMEM;
  3047. goto error;
  3048. }
  3049. }
  3050. send_wmi_reo_cmd:
  3051. if (dp_get_peer_vdev_roaming_in_progress(peer)) {
  3052. status = QDF_STATUS_E_PERM;
  3053. goto error;
  3054. }
  3055. status = dp_peer_rx_reorder_queue_setup(soc, peer,
  3056. tid, ba_window_size);
  3057. if (QDF_IS_STATUS_SUCCESS(status))
  3058. return status;
  3059. error:
  3060. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  3061. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) ==
  3062. QDF_STATUS_SUCCESS)
  3063. qdf_mem_unmap_nbytes_single(
  3064. 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. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3070. rx_tid->hw_qdesc_paddr = 0;
  3071. }
  3072. return status;
  3073. }
  3074. #ifdef REO_DESC_DEFER_FREE
  3075. /*
  3076. * dp_reo_desc_clean_up() - If cmd to flush base desc fails add
  3077. * desc back to freelist and defer the deletion
  3078. *
  3079. * @soc: DP SOC handle
  3080. * @desc: Base descriptor to be freed
  3081. * @reo_status: REO command status
  3082. */
  3083. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3084. struct reo_desc_list_node *desc,
  3085. union hal_reo_status *reo_status)
  3086. {
  3087. desc->free_ts = qdf_get_system_timestamp();
  3088. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3089. qdf_list_insert_back(&soc->reo_desc_freelist,
  3090. (qdf_list_node_t *)desc);
  3091. }
  3092. /*
  3093. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3094. * ring in aviod of REO hang
  3095. *
  3096. * @list_size: REO desc list size to be cleaned
  3097. */
  3098. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3099. {
  3100. unsigned long curr_ts = qdf_get_system_timestamp();
  3101. if ((*list_size) > REO_DESC_FREELIST_SIZE) {
  3102. dp_err_log("%lu:freedesc number %d in freelist",
  3103. curr_ts, *list_size);
  3104. /* limit the batch queue size */
  3105. *list_size = REO_DESC_FREELIST_SIZE;
  3106. }
  3107. }
  3108. #else
  3109. /*
  3110. * dp_reo_desc_clean_up() - If send cmd to REO inorder to flush
  3111. * cache fails free the base REO desc anyway
  3112. *
  3113. * @soc: DP SOC handle
  3114. * @desc: Base descriptor to be freed
  3115. * @reo_status: REO command status
  3116. */
  3117. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3118. struct reo_desc_list_node *desc,
  3119. union hal_reo_status *reo_status)
  3120. {
  3121. if (reo_status) {
  3122. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3123. reo_status->fl_cache_status.header.status = 0;
  3124. dp_reo_desc_free(soc, (void *)desc, reo_status);
  3125. }
  3126. }
  3127. /*
  3128. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3129. * ring in aviod of REO hang
  3130. *
  3131. * @list_size: REO desc list size to be cleaned
  3132. */
  3133. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3134. {
  3135. }
  3136. #endif
  3137. /*
  3138. * dp_resend_update_reo_cmd() - Resend the UPDATE_REO_QUEUE
  3139. * cmd and re-insert desc into free list if send fails.
  3140. *
  3141. * @soc: DP SOC handle
  3142. * @desc: desc with resend update cmd flag set
  3143. * @rx_tid: Desc RX tid associated with update cmd for resetting
  3144. * valid field to 0 in h/w
  3145. *
  3146. * Return: QDF status
  3147. */
  3148. static QDF_STATUS
  3149. dp_resend_update_reo_cmd(struct dp_soc *soc,
  3150. struct reo_desc_list_node *desc,
  3151. struct dp_rx_tid *rx_tid)
  3152. {
  3153. struct hal_reo_cmd_params params;
  3154. qdf_mem_zero(&params, sizeof(params));
  3155. params.std.need_status = 1;
  3156. params.std.addr_lo =
  3157. rx_tid->hw_qdesc_paddr & 0xffffffff;
  3158. params.std.addr_hi =
  3159. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3160. params.u.upd_queue_params.update_vld = 1;
  3161. params.u.upd_queue_params.vld = 0;
  3162. desc->resend_update_reo_cmd = false;
  3163. /*
  3164. * If the cmd send fails then set resend_update_reo_cmd flag
  3165. * and insert the desc at the end of the free list to retry.
  3166. */
  3167. if (dp_reo_send_cmd(soc,
  3168. CMD_UPDATE_RX_REO_QUEUE,
  3169. &params,
  3170. dp_rx_tid_delete_cb,
  3171. (void *)desc)
  3172. != QDF_STATUS_SUCCESS) {
  3173. desc->resend_update_reo_cmd = true;
  3174. desc->free_ts = qdf_get_system_timestamp();
  3175. qdf_list_insert_back(&soc->reo_desc_freelist,
  3176. (qdf_list_node_t *)desc);
  3177. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  3178. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3179. return QDF_STATUS_E_FAILURE;
  3180. }
  3181. return QDF_STATUS_SUCCESS;
  3182. }
  3183. /*
  3184. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  3185. * after deleting the entries (ie., setting valid=0)
  3186. *
  3187. * @soc: DP SOC handle
  3188. * @cb_ctxt: Callback context
  3189. * @reo_status: REO command status
  3190. */
  3191. void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  3192. union hal_reo_status *reo_status)
  3193. {
  3194. struct reo_desc_list_node *freedesc =
  3195. (struct reo_desc_list_node *)cb_ctxt;
  3196. uint32_t list_size;
  3197. struct reo_desc_list_node *desc;
  3198. unsigned long curr_ts = qdf_get_system_timestamp();
  3199. uint32_t desc_size, tot_desc_size;
  3200. struct hal_reo_cmd_params params;
  3201. bool flush_failure = false;
  3202. DP_RX_REO_QDESC_UPDATE_EVT(freedesc);
  3203. if (reo_status->rx_queue_status.header.status == HAL_REO_CMD_DRAIN) {
  3204. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3205. reo_status->fl_cache_status.header.status = HAL_REO_CMD_DRAIN;
  3206. dp_reo_desc_free(soc, (void *)freedesc, reo_status);
  3207. DP_STATS_INC(soc, rx.err.reo_cmd_send_drain, 1);
  3208. return;
  3209. } else if (reo_status->rx_queue_status.header.status !=
  3210. HAL_REO_CMD_SUCCESS) {
  3211. /* Should not happen normally. Just print error for now */
  3212. dp_info_rl("Rx tid HW desc deletion failed(%d): tid %d",
  3213. reo_status->rx_queue_status.header.status,
  3214. freedesc->rx_tid.tid);
  3215. }
  3216. dp_peer_info("%pK: rx_tid: %d status: %d",
  3217. soc, freedesc->rx_tid.tid,
  3218. reo_status->rx_queue_status.header.status);
  3219. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3220. freedesc->free_ts = curr_ts;
  3221. qdf_list_insert_back_size(&soc->reo_desc_freelist,
  3222. (qdf_list_node_t *)freedesc, &list_size);
  3223. /* MCL path add the desc back to reo_desc_freelist when REO FLUSH
  3224. * failed. it may cause the number of REO queue pending in free
  3225. * list is even larger than REO_CMD_RING max size and lead REO CMD
  3226. * flood then cause REO HW in an unexpected condition. So it's
  3227. * needed to limit the number REO cmds in a batch operation.
  3228. */
  3229. dp_reo_limit_clean_batch_sz(&list_size);
  3230. while ((qdf_list_peek_front(&soc->reo_desc_freelist,
  3231. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  3232. ((list_size >= REO_DESC_FREELIST_SIZE) ||
  3233. (curr_ts > (desc->free_ts + REO_DESC_FREE_DEFER_MS)) ||
  3234. (desc->resend_update_reo_cmd && list_size))) {
  3235. struct dp_rx_tid *rx_tid;
  3236. qdf_list_remove_front(&soc->reo_desc_freelist,
  3237. (qdf_list_node_t **)&desc);
  3238. list_size--;
  3239. rx_tid = &desc->rx_tid;
  3240. /* First process descs with resend_update_reo_cmd set */
  3241. if (desc->resend_update_reo_cmd) {
  3242. if (dp_resend_update_reo_cmd(soc, desc, rx_tid) !=
  3243. QDF_STATUS_SUCCESS)
  3244. break;
  3245. else
  3246. continue;
  3247. }
  3248. /* Flush and invalidate REO descriptor from HW cache: Base and
  3249. * extension descriptors should be flushed separately */
  3250. if (desc->pending_ext_desc_size)
  3251. tot_desc_size = desc->pending_ext_desc_size;
  3252. else
  3253. tot_desc_size = rx_tid->hw_qdesc_alloc_size;
  3254. /* Get base descriptor size by passing non-qos TID */
  3255. desc_size = hal_get_reo_qdesc_size(soc->hal_soc, 0,
  3256. DP_NON_QOS_TID);
  3257. /* Flush reo extension descriptors */
  3258. while ((tot_desc_size -= desc_size) > 0) {
  3259. qdf_mem_zero(&params, sizeof(params));
  3260. params.std.addr_lo =
  3261. ((uint64_t)(rx_tid->hw_qdesc_paddr) +
  3262. tot_desc_size) & 0xffffffff;
  3263. params.std.addr_hi =
  3264. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3265. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3266. CMD_FLUSH_CACHE,
  3267. &params,
  3268. NULL,
  3269. NULL)) {
  3270. dp_info_rl("fail to send CMD_CACHE_FLUSH:"
  3271. "tid %d desc %pK", rx_tid->tid,
  3272. (void *)(rx_tid->hw_qdesc_paddr));
  3273. desc->pending_ext_desc_size = tot_desc_size +
  3274. desc_size;
  3275. dp_reo_desc_clean_up(soc, desc, reo_status);
  3276. flush_failure = true;
  3277. break;
  3278. }
  3279. }
  3280. if (flush_failure)
  3281. break;
  3282. else
  3283. desc->pending_ext_desc_size = desc_size;
  3284. /* Flush base descriptor */
  3285. qdf_mem_zero(&params, sizeof(params));
  3286. params.std.need_status = 1;
  3287. params.std.addr_lo =
  3288. (uint64_t)(rx_tid->hw_qdesc_paddr) & 0xffffffff;
  3289. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3290. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3291. CMD_FLUSH_CACHE,
  3292. &params,
  3293. dp_reo_desc_free,
  3294. (void *)desc)) {
  3295. union hal_reo_status reo_status;
  3296. /*
  3297. * If dp_reo_send_cmd return failure, related TID queue desc
  3298. * should be unmapped. Also locally reo_desc, together with
  3299. * TID queue desc also need to be freed accordingly.
  3300. *
  3301. * Here invoke desc_free function directly to do clean up.
  3302. *
  3303. * In case of MCL path add the desc back to the free
  3304. * desc list and defer deletion.
  3305. */
  3306. dp_info_rl("fail to send REO cmd to flush cache: tid %d",
  3307. rx_tid->tid);
  3308. dp_reo_desc_clean_up(soc, desc, &reo_status);
  3309. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3310. break;
  3311. }
  3312. }
  3313. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3314. dp_reo_desc_defer_free(soc);
  3315. }
  3316. /*
  3317. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  3318. * @peer: Datapath peer handle
  3319. * @tid: TID
  3320. *
  3321. * Return: 0 on success, error code on failure
  3322. */
  3323. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  3324. {
  3325. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  3326. struct dp_soc *soc = peer->vdev->pdev->soc;
  3327. struct hal_reo_cmd_params params;
  3328. struct reo_desc_list_node *freedesc =
  3329. qdf_mem_malloc(sizeof(*freedesc));
  3330. if (!freedesc) {
  3331. dp_peer_err("%pK: malloc failed for freedesc: tid %d",
  3332. soc, tid);
  3333. return -ENOMEM;
  3334. }
  3335. freedesc->rx_tid = *rx_tid;
  3336. freedesc->resend_update_reo_cmd = false;
  3337. qdf_mem_zero(&params, sizeof(params));
  3338. DP_RX_REO_QDESC_GET_MAC(freedesc, peer);
  3339. params.std.need_status = 1;
  3340. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  3341. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3342. params.u.upd_queue_params.update_vld = 1;
  3343. params.u.upd_queue_params.vld = 0;
  3344. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  3345. dp_rx_tid_delete_cb, (void *)freedesc)
  3346. != QDF_STATUS_SUCCESS) {
  3347. /* Defer the clean up to the call back context */
  3348. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3349. freedesc->free_ts = qdf_get_system_timestamp();
  3350. freedesc->resend_update_reo_cmd = true;
  3351. qdf_list_insert_front(&soc->reo_desc_freelist,
  3352. (qdf_list_node_t *)freedesc);
  3353. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3354. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3355. dp_info("Failed to send CMD_UPDATE_RX_REO_QUEUE");
  3356. }
  3357. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3358. rx_tid->hw_qdesc_alloc_size = 0;
  3359. rx_tid->hw_qdesc_paddr = 0;
  3360. return 0;
  3361. }
  3362. #ifdef DP_LFR
  3363. static void dp_peer_setup_remaining_tids(struct dp_peer *peer)
  3364. {
  3365. int tid;
  3366. for (tid = 1; tid < DP_MAX_TIDS-1; tid++) {
  3367. dp_rx_tid_setup_wifi3(peer, tid, 1, 0);
  3368. dp_peer_debug("Setting up TID %d for peer %pK peer->local_id %d",
  3369. tid, peer, peer->local_id);
  3370. }
  3371. }
  3372. #else
  3373. static void dp_peer_setup_remaining_tids(struct dp_peer *peer) {};
  3374. #endif
  3375. #ifdef WLAN_FEATURE_11BE_MLO
  3376. /**
  3377. * dp_peer_rx_tids_init() - initialize each tids in peer
  3378. * @peer: peer pointer
  3379. *
  3380. * Return: None
  3381. */
  3382. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3383. {
  3384. int tid;
  3385. struct dp_rx_tid *rx_tid;
  3386. struct dp_rx_tid_defrag *rx_tid_defrag;
  3387. if (!IS_MLO_DP_LINK_PEER(peer)) {
  3388. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3389. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3390. rx_tid_defrag->array = &rx_tid_defrag->base;
  3391. rx_tid_defrag->defrag_timeout_ms = 0;
  3392. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3393. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3394. rx_tid_defrag->base.head = NULL;
  3395. rx_tid_defrag->base.tail = NULL;
  3396. rx_tid_defrag->tid = tid;
  3397. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3398. }
  3399. }
  3400. /* if not first assoc link peer,
  3401. * not to initialize rx_tids again.
  3402. */
  3403. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  3404. return;
  3405. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3406. rx_tid = &peer->rx_tid[tid];
  3407. rx_tid->tid = tid;
  3408. rx_tid->ba_win_size = 0;
  3409. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3410. }
  3411. }
  3412. #else
  3413. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3414. {
  3415. int tid;
  3416. struct dp_rx_tid *rx_tid;
  3417. struct dp_rx_tid_defrag *rx_tid_defrag;
  3418. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3419. rx_tid = &peer->rx_tid[tid];
  3420. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3421. rx_tid->tid = tid;
  3422. rx_tid->ba_win_size = 0;
  3423. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3424. rx_tid_defrag->base.head = NULL;
  3425. rx_tid_defrag->base.tail = NULL;
  3426. rx_tid_defrag->tid = tid;
  3427. rx_tid_defrag->array = &rx_tid_defrag->base;
  3428. rx_tid_defrag->defrag_timeout_ms = 0;
  3429. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3430. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3431. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3432. }
  3433. }
  3434. #endif
  3435. /*
  3436. * dp_peer_rx_init() – Initialize receive TID state
  3437. * @pdev: Datapath pdev
  3438. * @peer: Datapath peer
  3439. *
  3440. */
  3441. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  3442. {
  3443. dp_peer_rx_tids_init(peer);
  3444. peer->active_ba_session_cnt = 0;
  3445. peer->hw_buffer_size = 0;
  3446. peer->kill_256_sessions = 0;
  3447. /* Setup default (non-qos) rx tid queue */
  3448. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  3449. /* Setup rx tid queue for TID 0.
  3450. * Other queues will be setup on receiving first packet, which will cause
  3451. * NULL REO queue error
  3452. */
  3453. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  3454. /*
  3455. * Setup the rest of TID's to handle LFR
  3456. */
  3457. dp_peer_setup_remaining_tids(peer);
  3458. /*
  3459. * Set security defaults: no PN check, no security. The target may
  3460. * send a HTT SEC_IND message to overwrite these defaults.
  3461. */
  3462. if (peer->txrx_peer)
  3463. peer->txrx_peer->security[dp_sec_ucast].sec_type =
  3464. peer->txrx_peer->security[dp_sec_mcast].sec_type =
  3465. cdp_sec_type_none;
  3466. }
  3467. /*
  3468. * dp_peer_rx_cleanup() – Cleanup receive TID state
  3469. * @vdev: Datapath vdev
  3470. * @peer: Datapath peer
  3471. *
  3472. */
  3473. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3474. {
  3475. int tid;
  3476. uint32_t tid_delete_mask = 0;
  3477. if (!peer->txrx_peer)
  3478. return;
  3479. dp_info("Remove tids for peer: %pK", peer);
  3480. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3481. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  3482. struct dp_rx_tid_defrag *defrag_rx_tid =
  3483. &peer->txrx_peer->rx_tid[tid];
  3484. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  3485. if (!peer->bss_peer || peer->vdev->opmode == wlan_op_mode_sta) {
  3486. /* Cleanup defrag related resource */
  3487. dp_rx_defrag_waitlist_remove(peer->txrx_peer, tid);
  3488. dp_rx_reorder_flush_frag(peer->txrx_peer, tid);
  3489. }
  3490. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  3491. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3492. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned) {
  3493. dp_rx_tid_delete_wifi3(peer, tid);
  3494. tid_delete_mask |= (1 << tid);
  3495. }
  3496. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3497. }
  3498. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  3499. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  3500. soc->ol_ops->peer_rx_reorder_queue_remove(soc->ctrl_psoc,
  3501. peer->vdev->pdev->pdev_id,
  3502. peer->vdev->vdev_id, peer->mac_addr.raw,
  3503. tid_delete_mask);
  3504. }
  3505. #endif
  3506. }
  3507. /*
  3508. * dp_peer_cleanup() – Cleanup peer information
  3509. * @vdev: Datapath vdev
  3510. * @peer: Datapath peer
  3511. *
  3512. */
  3513. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3514. {
  3515. enum wlan_op_mode vdev_opmode;
  3516. uint8_t vdev_mac_addr[QDF_MAC_ADDR_SIZE];
  3517. struct dp_pdev *pdev = vdev->pdev;
  3518. struct dp_soc *soc = pdev->soc;
  3519. /* save vdev related member in case vdev freed */
  3520. vdev_opmode = vdev->opmode;
  3521. if (!IS_MLO_DP_MLD_PEER(peer))
  3522. dp_monitor_peer_tx_cleanup(vdev, peer);
  3523. if (vdev_opmode != wlan_op_mode_monitor)
  3524. /* cleanup the Rx reorder queues for this peer */
  3525. dp_peer_rx_cleanup(vdev, peer);
  3526. dp_peer_rx_tids_destroy(peer);
  3527. if (IS_MLO_DP_LINK_PEER(peer))
  3528. dp_link_peer_del_mld_peer(peer);
  3529. if (IS_MLO_DP_MLD_PEER(peer))
  3530. dp_mld_peer_deinit_link_peers_info(peer);
  3531. qdf_mem_copy(vdev_mac_addr, vdev->mac_addr.raw,
  3532. QDF_MAC_ADDR_SIZE);
  3533. if (soc->cdp_soc.ol_ops->peer_unref_delete)
  3534. soc->cdp_soc.ol_ops->peer_unref_delete(
  3535. soc->ctrl_psoc,
  3536. vdev->pdev->pdev_id,
  3537. peer->mac_addr.raw, vdev_mac_addr,
  3538. vdev_opmode);
  3539. }
  3540. /* dp_teardown_256_ba_session() - Teardown sessions using 256
  3541. * window size when a request with
  3542. * 64 window size is received.
  3543. * This is done as a WAR since HW can
  3544. * have only one setting per peer (64 or 256).
  3545. * For HKv2, we use per tid buffersize setting
  3546. * for 0 to per_tid_basize_max_tid. For tid
  3547. * more than per_tid_basize_max_tid we use HKv1
  3548. * method.
  3549. * @peer: Datapath peer
  3550. *
  3551. * Return: void
  3552. */
  3553. static void dp_teardown_256_ba_sessions(struct dp_peer *peer)
  3554. {
  3555. uint8_t delba_rcode = 0;
  3556. int tid;
  3557. struct dp_rx_tid *rx_tid = NULL;
  3558. tid = peer->vdev->pdev->soc->per_tid_basize_max_tid;
  3559. for (; tid < DP_MAX_TIDS; tid++) {
  3560. rx_tid = &peer->rx_tid[tid];
  3561. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3562. if (rx_tid->ba_win_size <= 64) {
  3563. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3564. continue;
  3565. } else {
  3566. if (rx_tid->ba_status == DP_RX_BA_ACTIVE ||
  3567. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3568. /* send delba */
  3569. if (!rx_tid->delba_tx_status) {
  3570. rx_tid->delba_tx_retry++;
  3571. rx_tid->delba_tx_status = 1;
  3572. rx_tid->delba_rcode =
  3573. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  3574. delba_rcode = rx_tid->delba_rcode;
  3575. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3576. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  3577. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  3578. peer->vdev->pdev->soc->ctrl_psoc,
  3579. peer->vdev->vdev_id,
  3580. peer->mac_addr.raw,
  3581. tid, delba_rcode,
  3582. CDP_DELBA_REASON_NONE);
  3583. } else {
  3584. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3585. }
  3586. } else {
  3587. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3588. }
  3589. }
  3590. }
  3591. }
  3592. /*
  3593. * dp_rx_addba_resp_tx_completion_wifi3() – Update Rx Tid State
  3594. *
  3595. * @soc: Datapath soc handle
  3596. * @peer_mac: Datapath peer mac address
  3597. * @vdev_id: id of atapath vdev
  3598. * @tid: TID number
  3599. * @status: tx completion status
  3600. * Return: 0 on success, error code on failure
  3601. */
  3602. int dp_addba_resp_tx_completion_wifi3(struct cdp_soc_t *cdp_soc,
  3603. uint8_t *peer_mac,
  3604. uint16_t vdev_id,
  3605. uint8_t tid, int status)
  3606. {
  3607. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3608. (struct dp_soc *)cdp_soc,
  3609. peer_mac, 0, vdev_id,
  3610. DP_MOD_ID_CDP);
  3611. struct dp_rx_tid *rx_tid = NULL;
  3612. if (!peer) {
  3613. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3614. goto fail;
  3615. }
  3616. rx_tid = &peer->rx_tid[tid];
  3617. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3618. if (status) {
  3619. rx_tid->num_addba_rsp_failed++;
  3620. dp_rx_tid_update_wifi3(peer, tid, 1,
  3621. IEEE80211_SEQ_MAX, false);
  3622. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3623. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3624. dp_err("RxTid- %d addba rsp tx completion failed", tid);
  3625. goto success;
  3626. }
  3627. rx_tid->num_addba_rsp_success++;
  3628. if (rx_tid->ba_status == DP_RX_BA_INACTIVE) {
  3629. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3630. dp_peer_err("%pK: Rx Tid- %d hw qdesc is not in IN_PROGRESS",
  3631. cdp_soc, tid);
  3632. goto fail;
  3633. }
  3634. if (!qdf_atomic_read(&peer->is_default_route_set)) {
  3635. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3636. dp_peer_debug("%pK: default route is not set for peer: " QDF_MAC_ADDR_FMT,
  3637. cdp_soc, QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  3638. goto fail;
  3639. }
  3640. if (dp_rx_tid_update_wifi3(peer, tid,
  3641. rx_tid->ba_win_size,
  3642. rx_tid->startseqnum,
  3643. false)) {
  3644. dp_err("Failed update REO SSN");
  3645. }
  3646. dp_info("tid %u window_size %u start_seq_num %u",
  3647. tid, rx_tid->ba_win_size,
  3648. rx_tid->startseqnum);
  3649. /* First Session */
  3650. if (peer->active_ba_session_cnt == 0) {
  3651. if (rx_tid->ba_win_size > 64 && rx_tid->ba_win_size <= 256)
  3652. peer->hw_buffer_size = 256;
  3653. else if (rx_tid->ba_win_size <= 1024 &&
  3654. rx_tid->ba_win_size > 256)
  3655. peer->hw_buffer_size = 1024;
  3656. else
  3657. peer->hw_buffer_size = 64;
  3658. }
  3659. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  3660. peer->active_ba_session_cnt++;
  3661. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3662. /* Kill any session having 256 buffer size
  3663. * when 64 buffer size request is received.
  3664. * Also, latch on to 64 as new buffer size.
  3665. */
  3666. if (peer->kill_256_sessions) {
  3667. dp_teardown_256_ba_sessions(peer);
  3668. peer->kill_256_sessions = 0;
  3669. }
  3670. success:
  3671. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3672. return QDF_STATUS_SUCCESS;
  3673. fail:
  3674. if (peer)
  3675. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3676. return QDF_STATUS_E_FAILURE;
  3677. }
  3678. /*
  3679. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  3680. *
  3681. * @soc: Datapath soc handle
  3682. * @peer_mac: Datapath peer mac address
  3683. * @vdev_id: id of atapath vdev
  3684. * @tid: TID number
  3685. * @dialogtoken: output dialogtoken
  3686. * @statuscode: output dialogtoken
  3687. * @buffersize: Output BA window size
  3688. * @batimeout: Output BA timeout
  3689. */
  3690. QDF_STATUS
  3691. dp_addba_responsesetup_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3692. uint16_t vdev_id, uint8_t tid,
  3693. uint8_t *dialogtoken, uint16_t *statuscode,
  3694. uint16_t *buffersize, uint16_t *batimeout)
  3695. {
  3696. struct dp_rx_tid *rx_tid = NULL;
  3697. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3698. struct dp_peer *peer = dp_peer_find_hash_find((struct dp_soc *)cdp_soc,
  3699. peer_mac, 0, vdev_id,
  3700. DP_MOD_ID_CDP);
  3701. if (!peer) {
  3702. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3703. return QDF_STATUS_E_FAILURE;
  3704. }
  3705. rx_tid = &peer->rx_tid[tid];
  3706. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3707. rx_tid->num_of_addba_resp++;
  3708. /* setup ADDBA response parameters */
  3709. *dialogtoken = rx_tid->dialogtoken;
  3710. *statuscode = rx_tid->statuscode;
  3711. *buffersize = rx_tid->ba_win_size;
  3712. *batimeout = 0;
  3713. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3714. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3715. return status;
  3716. }
  3717. /* dp_check_ba_buffersize() - Check buffer size in request
  3718. * and latch onto this size based on
  3719. * size used in first active session.
  3720. * @peer: Datapath peer
  3721. * @tid: Tid
  3722. * @buffersize: Block ack window size
  3723. *
  3724. * Return: void
  3725. */
  3726. static void dp_check_ba_buffersize(struct dp_peer *peer,
  3727. uint16_t tid,
  3728. uint16_t buffersize)
  3729. {
  3730. struct dp_rx_tid *rx_tid = NULL;
  3731. rx_tid = &peer->rx_tid[tid];
  3732. if (peer->vdev->pdev->soc->per_tid_basize_max_tid &&
  3733. tid < peer->vdev->pdev->soc->per_tid_basize_max_tid) {
  3734. rx_tid->ba_win_size = buffersize;
  3735. return;
  3736. } else {
  3737. if (peer->active_ba_session_cnt == 0) {
  3738. rx_tid->ba_win_size = buffersize;
  3739. } else {
  3740. if (peer->hw_buffer_size == 64) {
  3741. if (buffersize <= 64)
  3742. rx_tid->ba_win_size = buffersize;
  3743. else
  3744. rx_tid->ba_win_size = peer->hw_buffer_size;
  3745. } else if (peer->hw_buffer_size == 256) {
  3746. if (buffersize > 64) {
  3747. rx_tid->ba_win_size = buffersize;
  3748. } else {
  3749. rx_tid->ba_win_size = buffersize;
  3750. peer->hw_buffer_size = 64;
  3751. peer->kill_256_sessions = 1;
  3752. }
  3753. }
  3754. }
  3755. }
  3756. }
  3757. QDF_STATUS dp_rx_tid_update_ba_win_size(struct cdp_soc_t *cdp_soc,
  3758. uint8_t *peer_mac, uint16_t vdev_id,
  3759. uint8_t tid, uint16_t buffersize)
  3760. {
  3761. struct dp_rx_tid *rx_tid = NULL;
  3762. struct dp_peer *peer;
  3763. peer = dp_peer_get_tgt_peer_hash_find((struct dp_soc *)cdp_soc,
  3764. peer_mac, 0, vdev_id,
  3765. DP_MOD_ID_CDP);
  3766. if (!peer) {
  3767. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3768. return QDF_STATUS_E_FAILURE;
  3769. }
  3770. rx_tid = &peer->rx_tid[tid];
  3771. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3772. rx_tid->ba_win_size = buffersize;
  3773. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3774. dp_info("peer "QDF_MAC_ADDR_FMT", tid %d, update BA win size to %d",
  3775. QDF_MAC_ADDR_REF(peer->mac_addr.raw), tid, buffersize);
  3776. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3777. return QDF_STATUS_SUCCESS;
  3778. }
  3779. #define DP_RX_BA_SESSION_DISABLE 1
  3780. /*
  3781. * dp_addba_requestprocess_wifi3() - Process ADDBA request from peer
  3782. *
  3783. * @soc: Datapath soc handle
  3784. * @peer_mac: Datapath peer mac address
  3785. * @vdev_id: id of atapath vdev
  3786. * @dialogtoken: dialogtoken from ADDBA frame
  3787. * @tid: TID number
  3788. * @batimeout: BA timeout
  3789. * @buffersize: BA window size
  3790. * @startseqnum: Start seq. number received in BA sequence control
  3791. *
  3792. * Return: 0 on success, error code on failure
  3793. */
  3794. int dp_addba_requestprocess_wifi3(struct cdp_soc_t *cdp_soc,
  3795. uint8_t *peer_mac,
  3796. uint16_t vdev_id,
  3797. uint8_t dialogtoken,
  3798. uint16_t tid, uint16_t batimeout,
  3799. uint16_t buffersize,
  3800. uint16_t startseqnum)
  3801. {
  3802. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3803. struct dp_rx_tid *rx_tid = NULL;
  3804. struct dp_peer *peer;
  3805. peer = dp_peer_get_tgt_peer_hash_find((struct dp_soc *)cdp_soc,
  3806. peer_mac,
  3807. 0, vdev_id,
  3808. DP_MOD_ID_CDP);
  3809. if (!peer) {
  3810. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3811. return QDF_STATUS_E_FAILURE;
  3812. }
  3813. rx_tid = &peer->rx_tid[tid];
  3814. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3815. rx_tid->num_of_addba_req++;
  3816. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE &&
  3817. rx_tid->hw_qdesc_vaddr_unaligned)) {
  3818. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3819. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3820. peer->active_ba_session_cnt--;
  3821. dp_peer_debug("%pK: Rx Tid- %d hw qdesc is already setup",
  3822. cdp_soc, tid);
  3823. }
  3824. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3825. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3826. status = QDF_STATUS_E_FAILURE;
  3827. goto fail;
  3828. }
  3829. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE) {
  3830. dp_peer_info("%pK: disable BA session",
  3831. cdp_soc);
  3832. buffersize = 1;
  3833. } else if (rx_tid->rx_ba_win_size_override) {
  3834. dp_peer_info("%pK: override BA win to %d", cdp_soc,
  3835. rx_tid->rx_ba_win_size_override);
  3836. buffersize = rx_tid->rx_ba_win_size_override;
  3837. } else {
  3838. dp_peer_info("%pK: restore BA win %d based on addba req", cdp_soc,
  3839. buffersize);
  3840. }
  3841. dp_check_ba_buffersize(peer, tid, buffersize);
  3842. if (dp_rx_tid_setup_wifi3(peer, tid,
  3843. rx_tid->ba_win_size, startseqnum)) {
  3844. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3845. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3846. status = QDF_STATUS_E_FAILURE;
  3847. goto fail;
  3848. }
  3849. rx_tid->ba_status = DP_RX_BA_IN_PROGRESS;
  3850. rx_tid->dialogtoken = dialogtoken;
  3851. rx_tid->startseqnum = startseqnum;
  3852. if (rx_tid->userstatuscode != IEEE80211_STATUS_SUCCESS)
  3853. rx_tid->statuscode = rx_tid->userstatuscode;
  3854. else
  3855. rx_tid->statuscode = IEEE80211_STATUS_SUCCESS;
  3856. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE)
  3857. rx_tid->statuscode = IEEE80211_STATUS_REFUSED;
  3858. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3859. fail:
  3860. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3861. return status;
  3862. }
  3863. /*
  3864. * dp_set_addba_response() – Set a user defined ADDBA response status code
  3865. *
  3866. * @soc: Datapath soc handle
  3867. * @peer_mac: Datapath peer mac address
  3868. * @vdev_id: id of atapath vdev
  3869. * @tid: TID number
  3870. * @statuscode: response status code to be set
  3871. */
  3872. QDF_STATUS
  3873. dp_set_addba_response(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3874. uint16_t vdev_id, uint8_t tid, uint16_t statuscode)
  3875. {
  3876. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3877. (struct dp_soc *)cdp_soc,
  3878. peer_mac, 0, vdev_id,
  3879. DP_MOD_ID_CDP);
  3880. struct dp_rx_tid *rx_tid;
  3881. if (!peer) {
  3882. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3883. return QDF_STATUS_E_FAILURE;
  3884. }
  3885. rx_tid = &peer->rx_tid[tid];
  3886. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3887. rx_tid->userstatuscode = statuscode;
  3888. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3889. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3890. return QDF_STATUS_SUCCESS;
  3891. }
  3892. /*
  3893. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  3894. * @soc: Datapath soc handle
  3895. * @peer_mac: Datapath peer mac address
  3896. * @vdev_id: id of atapath vdev
  3897. * @tid: TID number
  3898. * @reasoncode: Reason code received in DELBA frame
  3899. *
  3900. * Return: 0 on success, error code on failure
  3901. */
  3902. int dp_delba_process_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3903. uint16_t vdev_id, int tid, uint16_t reasoncode)
  3904. {
  3905. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3906. struct dp_rx_tid *rx_tid;
  3907. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3908. (struct dp_soc *)cdp_soc,
  3909. peer_mac, 0, vdev_id,
  3910. DP_MOD_ID_CDP);
  3911. if (!peer) {
  3912. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3913. return QDF_STATUS_E_FAILURE;
  3914. }
  3915. rx_tid = &peer->rx_tid[tid];
  3916. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3917. if (rx_tid->ba_status == DP_RX_BA_INACTIVE ||
  3918. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3919. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3920. status = QDF_STATUS_E_FAILURE;
  3921. goto fail;
  3922. }
  3923. /* TODO: See if we can delete the existing REO queue descriptor and
  3924. * replace with a new one without queue extenstion descript to save
  3925. * memory
  3926. */
  3927. rx_tid->delba_rcode = reasoncode;
  3928. rx_tid->num_of_delba_req++;
  3929. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3930. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3931. peer->active_ba_session_cnt--;
  3932. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3933. fail:
  3934. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3935. return status;
  3936. }
  3937. /*
  3938. * dp_rx_delba_tx_completion_wifi3() – Send Delba Request
  3939. *
  3940. * @soc: Datapath soc handle
  3941. * @peer_mac: Datapath peer mac address
  3942. * @vdev_id: id of atapath vdev
  3943. * @tid: TID number
  3944. * @status: tx completion status
  3945. * Return: 0 on success, error code on failure
  3946. */
  3947. int dp_delba_tx_completion_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3948. uint16_t vdev_id,
  3949. uint8_t tid, int status)
  3950. {
  3951. QDF_STATUS ret = QDF_STATUS_SUCCESS;
  3952. struct dp_rx_tid *rx_tid = NULL;
  3953. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3954. (struct dp_soc *)cdp_soc,
  3955. peer_mac, 0, vdev_id,
  3956. DP_MOD_ID_CDP);
  3957. if (!peer) {
  3958. dp_peer_debug("%pK: Peer is NULL!", cdp_soc);
  3959. return QDF_STATUS_E_FAILURE;
  3960. }
  3961. rx_tid = &peer->rx_tid[tid];
  3962. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3963. if (status) {
  3964. rx_tid->delba_tx_fail_cnt++;
  3965. if (rx_tid->delba_tx_retry >= DP_MAX_DELBA_RETRY) {
  3966. rx_tid->delba_tx_retry = 0;
  3967. rx_tid->delba_tx_status = 0;
  3968. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3969. } else {
  3970. rx_tid->delba_tx_retry++;
  3971. rx_tid->delba_tx_status = 1;
  3972. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3973. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  3974. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  3975. peer->vdev->pdev->soc->ctrl_psoc,
  3976. peer->vdev->vdev_id,
  3977. peer->mac_addr.raw, tid,
  3978. rx_tid->delba_rcode,
  3979. CDP_DELBA_REASON_NONE);
  3980. }
  3981. goto end;
  3982. } else {
  3983. rx_tid->delba_tx_success_cnt++;
  3984. rx_tid->delba_tx_retry = 0;
  3985. rx_tid->delba_tx_status = 0;
  3986. }
  3987. if (rx_tid->ba_status == DP_RX_BA_ACTIVE) {
  3988. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3989. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3990. peer->active_ba_session_cnt--;
  3991. }
  3992. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3993. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3994. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3995. }
  3996. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3997. end:
  3998. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3999. return ret;
  4000. }
  4001. /**
  4002. * dp_set_pn_check_wifi3() - enable PN check in REO for security
  4003. * @soc: Datapath soc handle
  4004. * @peer_mac: Datapath peer mac address
  4005. * @vdev_id: id of atapath vdev
  4006. * @vdev: Datapath vdev
  4007. * @pdev - data path device instance
  4008. * @sec_type - security type
  4009. * @rx_pn - Receive pn starting number
  4010. *
  4011. */
  4012. QDF_STATUS
  4013. dp_set_pn_check_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  4014. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  4015. uint32_t *rx_pn)
  4016. {
  4017. struct dp_pdev *pdev;
  4018. int i;
  4019. uint8_t pn_size;
  4020. struct hal_reo_cmd_params params;
  4021. struct dp_peer *peer = NULL;
  4022. struct dp_vdev *vdev = NULL;
  4023. peer = dp_peer_find_hash_find((struct dp_soc *)soc,
  4024. peer_mac, 0, vdev_id,
  4025. DP_MOD_ID_CDP);
  4026. if (!peer) {
  4027. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  4028. return QDF_STATUS_E_FAILURE;
  4029. }
  4030. vdev = peer->vdev;
  4031. if (!vdev) {
  4032. dp_peer_debug("%pK: VDEV is NULL!\n", soc);
  4033. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4034. return QDF_STATUS_E_FAILURE;
  4035. }
  4036. pdev = vdev->pdev;
  4037. qdf_mem_zero(&params, sizeof(params));
  4038. params.std.need_status = 1;
  4039. params.u.upd_queue_params.update_pn_valid = 1;
  4040. params.u.upd_queue_params.update_pn_size = 1;
  4041. params.u.upd_queue_params.update_pn = 1;
  4042. params.u.upd_queue_params.update_pn_check_needed = 1;
  4043. params.u.upd_queue_params.update_svld = 1;
  4044. params.u.upd_queue_params.svld = 0;
  4045. switch (sec_type) {
  4046. case cdp_sec_type_tkip_nomic:
  4047. case cdp_sec_type_aes_ccmp:
  4048. case cdp_sec_type_aes_ccmp_256:
  4049. case cdp_sec_type_aes_gcmp:
  4050. case cdp_sec_type_aes_gcmp_256:
  4051. params.u.upd_queue_params.pn_check_needed = 1;
  4052. params.u.upd_queue_params.pn_size = PN_SIZE_48;
  4053. pn_size = 48;
  4054. break;
  4055. case cdp_sec_type_wapi:
  4056. params.u.upd_queue_params.pn_check_needed = 1;
  4057. params.u.upd_queue_params.pn_size = PN_SIZE_128;
  4058. pn_size = 128;
  4059. if (vdev->opmode == wlan_op_mode_ap) {
  4060. params.u.upd_queue_params.pn_even = 1;
  4061. params.u.upd_queue_params.update_pn_even = 1;
  4062. } else {
  4063. params.u.upd_queue_params.pn_uneven = 1;
  4064. params.u.upd_queue_params.update_pn_uneven = 1;
  4065. }
  4066. break;
  4067. default:
  4068. params.u.upd_queue_params.pn_check_needed = 0;
  4069. pn_size = 0;
  4070. break;
  4071. }
  4072. for (i = 0; i < DP_MAX_TIDS; i++) {
  4073. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  4074. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4075. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4076. params.std.addr_lo =
  4077. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4078. params.std.addr_hi =
  4079. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4080. if (pn_size) {
  4081. dp_peer_info("%pK: PN set for TID:%d pn:%x:%x:%x:%x",
  4082. soc, i, rx_pn[3], rx_pn[2],
  4083. rx_pn[1], rx_pn[0]);
  4084. params.u.upd_queue_params.update_pn_valid = 1;
  4085. params.u.upd_queue_params.pn_31_0 = rx_pn[0];
  4086. params.u.upd_queue_params.pn_63_32 = rx_pn[1];
  4087. params.u.upd_queue_params.pn_95_64 = rx_pn[2];
  4088. params.u.upd_queue_params.pn_127_96 = rx_pn[3];
  4089. }
  4090. rx_tid->pn_size = pn_size;
  4091. if (dp_reo_send_cmd(cdp_soc_t_to_dp_soc(soc),
  4092. CMD_UPDATE_RX_REO_QUEUE,
  4093. &params, dp_rx_tid_update_cb,
  4094. rx_tid)) {
  4095. dp_err_log("fail to send CMD_UPDATE_RX_REO_QUEUE"
  4096. "tid %d desc %pK", rx_tid->tid,
  4097. (void *)(rx_tid->hw_qdesc_paddr));
  4098. DP_STATS_INC(cdp_soc_t_to_dp_soc(soc),
  4099. rx.err.reo_cmd_send_fail, 1);
  4100. }
  4101. } else {
  4102. dp_peer_info("%pK: PN Check not setup for TID :%d ", soc, i);
  4103. }
  4104. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4105. }
  4106. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4107. return QDF_STATUS_SUCCESS;
  4108. }
  4109. /**
  4110. * dp_set_key_sec_type_wifi3() - set security mode of key
  4111. * @soc: Datapath soc handle
  4112. * @peer_mac: Datapath peer mac address
  4113. * @vdev_id: id of atapath vdev
  4114. * @vdev: Datapath vdev
  4115. * @pdev - data path device instance
  4116. * @sec_type - security type
  4117. * #is_unicast - key type
  4118. *
  4119. */
  4120. QDF_STATUS
  4121. dp_set_key_sec_type_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  4122. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  4123. bool is_unicast)
  4124. {
  4125. struct dp_peer *peer =
  4126. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  4127. peer_mac, 0, vdev_id,
  4128. DP_MOD_ID_CDP);
  4129. int sec_index;
  4130. if (!peer) {
  4131. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  4132. return QDF_STATUS_E_FAILURE;
  4133. }
  4134. if (!peer->txrx_peer) {
  4135. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4136. dp_peer_debug("%pK: txrx peer is NULL!\n", soc);
  4137. return QDF_STATUS_E_FAILURE;
  4138. }
  4139. dp_peer_info("%pK: key sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4140. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4141. is_unicast ? "ucast" : "mcast", sec_type);
  4142. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4143. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4144. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4145. return QDF_STATUS_SUCCESS;
  4146. }
  4147. void
  4148. dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  4149. enum cdp_sec_type sec_type, int is_unicast,
  4150. u_int32_t *michael_key,
  4151. u_int32_t *rx_pn)
  4152. {
  4153. struct dp_peer *peer;
  4154. struct dp_txrx_peer *txrx_peer;
  4155. int sec_index;
  4156. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4157. if (!peer) {
  4158. dp_peer_err("Couldn't find peer from ID %d - skipping security inits",
  4159. peer_id);
  4160. return;
  4161. }
  4162. txrx_peer = dp_get_txrx_peer(peer);
  4163. if (!txrx_peer) {
  4164. dp_peer_err("Couldn't find txrx peer from ID %d - skipping security inits",
  4165. peer_id);
  4166. return;
  4167. }
  4168. dp_peer_info("%pK: sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4169. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4170. is_unicast ? "ucast" : "mcast", sec_type);
  4171. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4172. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4173. #ifdef notyet /* TODO: See if this is required for defrag support */
  4174. /* michael key only valid for TKIP, but for simplicity,
  4175. * copy it anyway
  4176. */
  4177. qdf_mem_copy(
  4178. &peer->txrx_peer->security[sec_index].michael_key[0],
  4179. michael_key,
  4180. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4181. #ifdef BIG_ENDIAN_HOST
  4182. OL_IF_SWAPBO(peer->txrx_peer->security[sec_index].michael_key[0],
  4183. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4184. #endif /* BIG_ENDIAN_HOST */
  4185. #endif
  4186. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  4187. if (sec_type != cdp_sec_type_wapi) {
  4188. qdf_mem_zero(peer->tids_last_pn_valid, _EXT_TIDS);
  4189. } else {
  4190. for (i = 0; i < DP_MAX_TIDS; i++) {
  4191. /*
  4192. * Setting PN valid bit for WAPI sec_type,
  4193. * since WAPI PN has to be started with predefined value
  4194. */
  4195. peer->tids_last_pn_valid[i] = 1;
  4196. qdf_mem_copy(
  4197. (u_int8_t *) &peer->tids_last_pn[i],
  4198. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  4199. peer->tids_last_pn[i].pn128[1] =
  4200. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  4201. peer->tids_last_pn[i].pn128[0] =
  4202. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  4203. }
  4204. }
  4205. #endif
  4206. /* TODO: Update HW TID queue with PN check parameters (pn type for
  4207. * all security types and last pn for WAPI) once REO command API
  4208. * is available
  4209. */
  4210. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4211. }
  4212. #ifdef QCA_PEER_EXT_STATS
  4213. /*
  4214. * dp_peer_delay_stats_ctx_alloc() - Allocate peer delay
  4215. * stats content
  4216. * @soc: DP SoC context
  4217. * @txrx_peer: DP txrx peer context
  4218. *
  4219. * Allocate the peer delay stats context
  4220. *
  4221. * Return: QDF_STATUS_SUCCESS if allocation is
  4222. * successful
  4223. */
  4224. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  4225. struct dp_txrx_peer *txrx_peer)
  4226. {
  4227. uint8_t tid, ctx_id;
  4228. if (!soc || !txrx_peer) {
  4229. dp_warn("Null soc%pK or peer%pK", soc, txrx_peer);
  4230. return QDF_STATUS_E_INVAL;
  4231. }
  4232. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4233. return QDF_STATUS_SUCCESS;
  4234. /*
  4235. * Allocate memory for peer extended stats.
  4236. */
  4237. txrx_peer->delay_stats =
  4238. qdf_mem_malloc(sizeof(struct dp_peer_delay_stats));
  4239. if (!txrx_peer->delay_stats) {
  4240. dp_err("Peer extended stats obj alloc failed!!");
  4241. return QDF_STATUS_E_NOMEM;
  4242. }
  4243. for (tid = 0; tid < CDP_MAX_DATA_TIDS; tid++) {
  4244. for (ctx_id = 0; ctx_id < CDP_MAX_TXRX_CTX; ctx_id++) {
  4245. struct cdp_delay_tx_stats *tx_delay =
  4246. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].tx_delay;
  4247. struct cdp_delay_rx_stats *rx_delay =
  4248. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].rx_delay;
  4249. dp_hist_init(&tx_delay->tx_swq_delay,
  4250. CDP_HIST_TYPE_SW_ENQEUE_DELAY);
  4251. dp_hist_init(&tx_delay->hwtx_delay,
  4252. CDP_HIST_TYPE_HW_COMP_DELAY);
  4253. dp_hist_init(&rx_delay->to_stack_delay,
  4254. CDP_HIST_TYPE_REAP_STACK);
  4255. }
  4256. }
  4257. return QDF_STATUS_SUCCESS;
  4258. }
  4259. /*
  4260. * dp_peer_delay_stats_ctx_dealloc() - Dealloc the peer delay stats context
  4261. * @txrx_peer: txrx DP peer context
  4262. *
  4263. * Free the peer delay stats context
  4264. *
  4265. * Return: Void
  4266. */
  4267. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  4268. struct dp_txrx_peer *txrx_peer)
  4269. {
  4270. if (!txrx_peer) {
  4271. dp_warn("peer_ext dealloc failed due to NULL peer object");
  4272. return;
  4273. }
  4274. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4275. return;
  4276. if (!txrx_peer->delay_stats)
  4277. return;
  4278. qdf_mem_free(txrx_peer->delay_stats);
  4279. txrx_peer->delay_stats = NULL;
  4280. }
  4281. /**
  4282. * dp_peer_delay_stats_ctx_clr() - Clear delay stats context of peer
  4283. *
  4284. * @txrx_peer: dp_txrx_peer handle
  4285. *
  4286. * Return: void
  4287. */
  4288. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4289. {
  4290. if (txrx_peer->delay_stats)
  4291. qdf_mem_zero(txrx_peer->delay_stats,
  4292. sizeof(struct dp_peer_delay_stats));
  4293. }
  4294. #endif
  4295. #ifdef WLAN_PEER_JITTER
  4296. /**
  4297. * dp_peer_jitter_stats_ctx_alloc() - Allocate jitter stats context for peer
  4298. *
  4299. * @soc: Datapath pdev handle
  4300. * @txrx_peer: dp_txrx_peer handle
  4301. *
  4302. * Return: QDF_STATUS
  4303. */
  4304. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  4305. struct dp_txrx_peer *txrx_peer)
  4306. {
  4307. if (!pdev || !txrx_peer) {
  4308. dp_warn("Null pdev or peer");
  4309. return QDF_STATUS_E_INVAL;
  4310. }
  4311. /*
  4312. * Allocate memory for jitter stats only when
  4313. * operating in offload enabled mode.
  4314. */
  4315. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4316. return QDF_STATUS_SUCCESS;
  4317. txrx_peer->jitter_stats =
  4318. qdf_mem_malloc(sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4319. if (!txrx_peer->jitter_stats) {
  4320. dp_warn("Jitter stats obj alloc failed!!");
  4321. return QDF_STATUS_E_NOMEM;
  4322. }
  4323. return QDF_STATUS_SUCCESS;
  4324. }
  4325. /**
  4326. * dp_peer_jitter_stats_ctx_dealloc() - Deallocate jitter stats context
  4327. *
  4328. * @pdev: Datapath pdev handle
  4329. * @txrx_peer: dp_txrx_peer handle
  4330. *
  4331. * Return: void
  4332. */
  4333. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  4334. struct dp_txrx_peer *txrx_peer)
  4335. {
  4336. if (!pdev || !txrx_peer) {
  4337. dp_warn("Null pdev or peer");
  4338. return;
  4339. }
  4340. /* Check for offload mode */
  4341. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4342. return;
  4343. if (txrx_peer->jitter_stats) {
  4344. qdf_mem_free(txrx_peer->jitter_stats);
  4345. txrx_peer->jitter_stats = NULL;
  4346. }
  4347. }
  4348. /**
  4349. * dp_peer_jitter_stats_ctx_clr() - Clear jitter stats context of peer
  4350. *
  4351. * @txrx_peer: dp_txrx_peer handle
  4352. *
  4353. * Return: void
  4354. */
  4355. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4356. {
  4357. if (txrx_peer->jitter_stats)
  4358. qdf_mem_zero(txrx_peer->jitter_stats,
  4359. sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4360. }
  4361. #endif
  4362. QDF_STATUS
  4363. dp_rx_delba_ind_handler(void *soc_handle, uint16_t peer_id,
  4364. uint8_t tid, uint16_t win_sz)
  4365. {
  4366. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  4367. struct dp_peer *peer;
  4368. struct dp_rx_tid *rx_tid;
  4369. QDF_STATUS status = QDF_STATUS_SUCCESS;
  4370. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4371. if (!peer) {
  4372. dp_peer_err("%pK: Couldn't find peer from ID %d",
  4373. soc, peer_id);
  4374. return QDF_STATUS_E_FAILURE;
  4375. }
  4376. qdf_assert_always(tid < DP_MAX_TIDS);
  4377. rx_tid = &peer->rx_tid[tid];
  4378. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4379. if (!rx_tid->delba_tx_status) {
  4380. dp_peer_info("%pK: PEER_ID: %d TID: %d, BA win: %d ",
  4381. soc, peer_id, tid, win_sz);
  4382. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4383. rx_tid->delba_tx_status = 1;
  4384. rx_tid->rx_ba_win_size_override =
  4385. qdf_min((uint16_t)63, win_sz);
  4386. rx_tid->delba_rcode =
  4387. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  4388. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4389. if (soc->cdp_soc.ol_ops->send_delba)
  4390. soc->cdp_soc.ol_ops->send_delba(
  4391. peer->vdev->pdev->soc->ctrl_psoc,
  4392. peer->vdev->vdev_id,
  4393. peer->mac_addr.raw,
  4394. tid,
  4395. rx_tid->delba_rcode,
  4396. CDP_DELBA_REASON_NONE);
  4397. }
  4398. } else {
  4399. dp_peer_err("%pK: BA session is not setup for TID:%d ", soc, tid);
  4400. status = QDF_STATUS_E_FAILURE;
  4401. }
  4402. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4403. return status;
  4404. }
  4405. #ifdef DP_PEER_EXTENDED_API
  4406. #ifdef WLAN_FEATURE_11BE_MLO
  4407. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4408. struct ol_txrx_desc_type *sta_desc)
  4409. {
  4410. struct dp_peer *peer;
  4411. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4412. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4413. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4414. if (!peer)
  4415. return QDF_STATUS_E_FAULT;
  4416. qdf_spin_lock_bh(&peer->peer_info_lock);
  4417. peer->state = OL_TXRX_PEER_STATE_CONN;
  4418. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4419. dp_rx_flush_rx_cached(peer, false);
  4420. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4421. dp_peer_info("register for mld peer" QDF_MAC_ADDR_FMT,
  4422. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw));
  4423. qdf_spin_lock_bh(&peer->mld_peer->peer_info_lock);
  4424. peer->mld_peer->state = peer->state;
  4425. qdf_spin_unlock_bh(&peer->mld_peer->peer_info_lock);
  4426. dp_rx_flush_rx_cached(peer->mld_peer, false);
  4427. }
  4428. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4429. return QDF_STATUS_SUCCESS;
  4430. }
  4431. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4432. enum ol_txrx_peer_state state)
  4433. {
  4434. struct dp_peer *peer;
  4435. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4436. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4437. DP_MOD_ID_CDP);
  4438. if (!peer) {
  4439. dp_peer_err("%pK: Failed to find peer[" QDF_MAC_ADDR_FMT "]",
  4440. soc, QDF_MAC_ADDR_REF(peer_mac));
  4441. return QDF_STATUS_E_FAILURE;
  4442. }
  4443. peer->state = state;
  4444. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4445. if (peer->txrx_peer)
  4446. peer->txrx_peer->authorize = peer->authorize;
  4447. dp_peer_info("peer" QDF_MAC_ADDR_FMT "state %d",
  4448. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4449. peer->state);
  4450. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4451. peer->mld_peer->state = peer->state;
  4452. peer->mld_peer->txrx_peer->authorize = peer->authorize;
  4453. dp_peer_info("mld peer" QDF_MAC_ADDR_FMT "state %d",
  4454. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw),
  4455. peer->mld_peer->state);
  4456. }
  4457. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4458. * Decrement it here.
  4459. */
  4460. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4461. return QDF_STATUS_SUCCESS;
  4462. }
  4463. #else
  4464. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4465. struct ol_txrx_desc_type *sta_desc)
  4466. {
  4467. struct dp_peer *peer;
  4468. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4469. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4470. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4471. if (!peer)
  4472. return QDF_STATUS_E_FAULT;
  4473. qdf_spin_lock_bh(&peer->peer_info_lock);
  4474. peer->state = OL_TXRX_PEER_STATE_CONN;
  4475. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4476. dp_rx_flush_rx_cached(peer, false);
  4477. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4478. return QDF_STATUS_SUCCESS;
  4479. }
  4480. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4481. enum ol_txrx_peer_state state)
  4482. {
  4483. struct dp_peer *peer;
  4484. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4485. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4486. DP_MOD_ID_CDP);
  4487. if (!peer) {
  4488. dp_peer_err("%pK: Failed to find peer for: [" QDF_MAC_ADDR_FMT "]",
  4489. soc, QDF_MAC_ADDR_REF(peer_mac));
  4490. return QDF_STATUS_E_FAILURE;
  4491. }
  4492. peer->state = state;
  4493. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4494. if (peer->txrx_peer)
  4495. peer->txrx_peer->authorize = peer->authorize;
  4496. dp_info("peer %pK state %d", peer, peer->state);
  4497. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4498. * Decrement it here.
  4499. */
  4500. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4501. return QDF_STATUS_SUCCESS;
  4502. }
  4503. #endif
  4504. QDF_STATUS
  4505. dp_clear_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4506. struct qdf_mac_addr peer_addr)
  4507. {
  4508. struct dp_peer *peer;
  4509. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4510. peer = dp_peer_find_hash_find(soc, peer_addr.bytes,
  4511. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4512. if (!peer || !peer->valid)
  4513. return QDF_STATUS_E_FAULT;
  4514. dp_clear_peer_internal(soc, peer);
  4515. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4516. return QDF_STATUS_SUCCESS;
  4517. }
  4518. QDF_STATUS dp_get_vdevid(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4519. uint8_t *vdev_id)
  4520. {
  4521. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4522. struct dp_peer *peer =
  4523. dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4524. DP_MOD_ID_CDP);
  4525. if (!peer)
  4526. return QDF_STATUS_E_FAILURE;
  4527. dp_info("peer %pK vdev %pK vdev id %d",
  4528. peer, peer->vdev, peer->vdev->vdev_id);
  4529. *vdev_id = peer->vdev->vdev_id;
  4530. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4531. * Decrement it here.
  4532. */
  4533. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4534. return QDF_STATUS_SUCCESS;
  4535. }
  4536. struct cdp_vdev *
  4537. dp_get_vdev_by_peer_addr(struct cdp_pdev *pdev_handle,
  4538. struct qdf_mac_addr peer_addr)
  4539. {
  4540. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  4541. struct dp_peer *peer = NULL;
  4542. struct cdp_vdev *vdev = NULL;
  4543. if (!pdev) {
  4544. dp_peer_info("PDEV not found for peer_addr: " QDF_MAC_ADDR_FMT,
  4545. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4546. return NULL;
  4547. }
  4548. peer = dp_peer_find_hash_find(pdev->soc, peer_addr.bytes, 0,
  4549. DP_VDEV_ALL, DP_MOD_ID_CDP);
  4550. if (!peer) {
  4551. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  4552. "PDEV not found for peer_addr: "QDF_MAC_ADDR_FMT,
  4553. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4554. return NULL;
  4555. }
  4556. vdev = (struct cdp_vdev *)peer->vdev;
  4557. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4558. return vdev;
  4559. }
  4560. /**
  4561. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  4562. * @peer - peer instance
  4563. *
  4564. * Get virtual interface instance which peer belongs
  4565. *
  4566. * Return: virtual interface instance pointer
  4567. * NULL in case cannot find
  4568. */
  4569. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  4570. {
  4571. struct dp_peer *peer = peer_handle;
  4572. DP_TRACE(DEBUG, "peer %pK vdev %pK", peer, peer->vdev);
  4573. return (struct cdp_vdev *)peer->vdev;
  4574. }
  4575. /**
  4576. * dp_peer_get_peer_mac_addr() - Get peer mac address
  4577. * @peer - peer instance
  4578. *
  4579. * Get peer mac address
  4580. *
  4581. * Return: peer mac address pointer
  4582. * NULL in case cannot find
  4583. */
  4584. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  4585. {
  4586. struct dp_peer *peer = peer_handle;
  4587. uint8_t *mac;
  4588. mac = peer->mac_addr.raw;
  4589. dp_info("peer %pK mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  4590. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  4591. return peer->mac_addr.raw;
  4592. }
  4593. int dp_get_peer_state(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4594. uint8_t *peer_mac)
  4595. {
  4596. enum ol_txrx_peer_state peer_state;
  4597. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4598. struct dp_peer *peer = dp_peer_find_hash_find(soc, peer_mac, 0,
  4599. vdev_id, DP_MOD_ID_CDP);
  4600. if (!peer)
  4601. return OL_TXRX_PEER_STATE_INVALID;
  4602. DP_TRACE(DEBUG, "peer %pK stats %d", peer, peer->state);
  4603. peer_state = peer->state;
  4604. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4605. return peer_state;
  4606. }
  4607. /**
  4608. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  4609. * @pdev - data path device instance
  4610. *
  4611. * local peer id pool alloc for physical device
  4612. *
  4613. * Return: none
  4614. */
  4615. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  4616. {
  4617. int i;
  4618. /* point the freelist to the first ID */
  4619. pdev->local_peer_ids.freelist = 0;
  4620. /* link each ID to the next one */
  4621. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  4622. pdev->local_peer_ids.pool[i] = i + 1;
  4623. pdev->local_peer_ids.map[i] = NULL;
  4624. }
  4625. /* link the last ID to itself, to mark the end of the list */
  4626. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  4627. pdev->local_peer_ids.pool[i] = i;
  4628. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  4629. DP_TRACE(INFO, "Peer pool init");
  4630. }
  4631. /**
  4632. * dp_local_peer_id_alloc() - allocate local peer id
  4633. * @pdev - data path device instance
  4634. * @peer - new peer instance
  4635. *
  4636. * allocate local peer id
  4637. *
  4638. * Return: none
  4639. */
  4640. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  4641. {
  4642. int i;
  4643. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4644. i = pdev->local_peer_ids.freelist;
  4645. if (pdev->local_peer_ids.pool[i] == i) {
  4646. /* the list is empty, except for the list-end marker */
  4647. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  4648. } else {
  4649. /* take the head ID and advance the freelist */
  4650. peer->local_id = i;
  4651. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  4652. pdev->local_peer_ids.map[i] = peer;
  4653. }
  4654. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4655. dp_info("peer %pK, local id %d", peer, peer->local_id);
  4656. }
  4657. /**
  4658. * dp_local_peer_id_free() - remove local peer id
  4659. * @pdev - data path device instance
  4660. * @peer - peer instance should be removed
  4661. *
  4662. * remove local peer id
  4663. *
  4664. * Return: none
  4665. */
  4666. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  4667. {
  4668. int i = peer->local_id;
  4669. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  4670. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  4671. return;
  4672. }
  4673. /* put this ID on the head of the freelist */
  4674. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4675. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  4676. pdev->local_peer_ids.freelist = i;
  4677. pdev->local_peer_ids.map[i] = NULL;
  4678. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4679. }
  4680. bool dp_find_peer_exist_on_vdev(struct cdp_soc_t *soc_hdl,
  4681. uint8_t vdev_id, uint8_t *peer_addr)
  4682. {
  4683. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4684. struct dp_peer *peer = NULL;
  4685. peer = dp_peer_find_hash_find(soc, peer_addr, 0, vdev_id,
  4686. DP_MOD_ID_CDP);
  4687. if (!peer)
  4688. return false;
  4689. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4690. return true;
  4691. }
  4692. bool dp_find_peer_exist_on_other_vdev(struct cdp_soc_t *soc_hdl,
  4693. uint8_t vdev_id, uint8_t *peer_addr,
  4694. uint16_t max_bssid)
  4695. {
  4696. int i;
  4697. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4698. struct dp_peer *peer = NULL;
  4699. for (i = 0; i < max_bssid; i++) {
  4700. /* Need to check vdevs other than the vdev_id */
  4701. if (vdev_id == i)
  4702. continue;
  4703. peer = dp_peer_find_hash_find(soc, peer_addr, 0, i,
  4704. DP_MOD_ID_CDP);
  4705. if (peer) {
  4706. dp_err("Duplicate peer "QDF_MAC_ADDR_FMT" already exist on vdev %d",
  4707. QDF_MAC_ADDR_REF(peer_addr), i);
  4708. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4709. return true;
  4710. }
  4711. }
  4712. return false;
  4713. }
  4714. bool dp_find_peer_exist(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4715. uint8_t *peer_addr)
  4716. {
  4717. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4718. struct dp_peer *peer = NULL;
  4719. peer = dp_peer_find_hash_find(soc, peer_addr, 0, DP_VDEV_ALL,
  4720. DP_MOD_ID_CDP);
  4721. if (peer) {
  4722. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4723. return true;
  4724. }
  4725. return false;
  4726. }
  4727. void dp_set_peer_as_tdls_peer(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4728. uint8_t *peer_mac, bool val)
  4729. {
  4730. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4731. struct dp_peer *peer = NULL;
  4732. peer = dp_peer_find_hash_find(soc, peer_mac, 0, vdev_id,
  4733. DP_MOD_ID_CDP);
  4734. if (!peer) {
  4735. dp_err("Failed to find peer for:" QDF_MAC_ADDR_FMT,
  4736. QDF_MAC_ADDR_REF(peer_mac));
  4737. return;
  4738. }
  4739. dp_info("Set tdls flag %d for peer:" QDF_MAC_ADDR_FMT,
  4740. val, QDF_MAC_ADDR_REF(peer_mac));
  4741. peer->is_tdls_peer = val;
  4742. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4743. }
  4744. #endif
  4745. /**
  4746. * dp_peer_rxtid_stats: Retried Rx TID (REO queue) stats from HW
  4747. * @peer: DP peer handle
  4748. * @dp_stats_cmd_cb: REO command callback function
  4749. * @cb_ctxt: Callback context
  4750. *
  4751. * Return: count of tid stats cmd send succeeded
  4752. */
  4753. int dp_peer_rxtid_stats(struct dp_peer *peer,
  4754. dp_rxtid_stats_cmd_cb dp_stats_cmd_cb,
  4755. void *cb_ctxt)
  4756. {
  4757. struct dp_soc *soc = peer->vdev->pdev->soc;
  4758. struct hal_reo_cmd_params params;
  4759. int i;
  4760. int stats_cmd_sent_cnt = 0;
  4761. QDF_STATUS status;
  4762. if (!dp_stats_cmd_cb)
  4763. return stats_cmd_sent_cnt;
  4764. qdf_mem_zero(&params, sizeof(params));
  4765. for (i = 0; i < DP_MAX_TIDS; i++) {
  4766. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  4767. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4768. params.std.need_status = 1;
  4769. params.std.addr_lo =
  4770. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4771. params.std.addr_hi =
  4772. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4773. if (cb_ctxt) {
  4774. status = dp_reo_send_cmd(
  4775. soc, CMD_GET_QUEUE_STATS,
  4776. &params, dp_stats_cmd_cb,
  4777. cb_ctxt);
  4778. } else {
  4779. status = dp_reo_send_cmd(
  4780. soc, CMD_GET_QUEUE_STATS,
  4781. &params, dp_stats_cmd_cb,
  4782. rx_tid);
  4783. }
  4784. if (QDF_IS_STATUS_SUCCESS(status))
  4785. stats_cmd_sent_cnt++;
  4786. /* Flush REO descriptor from HW cache to update stats
  4787. * in descriptor memory. This is to help debugging */
  4788. qdf_mem_zero(&params, sizeof(params));
  4789. params.std.need_status = 0;
  4790. params.std.addr_lo =
  4791. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4792. params.std.addr_hi =
  4793. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4794. params.u.fl_cache_params.flush_no_inval = 1;
  4795. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  4796. NULL);
  4797. }
  4798. }
  4799. return stats_cmd_sent_cnt;
  4800. }
  4801. QDF_STATUS
  4802. dp_set_michael_key(struct cdp_soc_t *soc,
  4803. uint8_t vdev_id,
  4804. uint8_t *peer_mac,
  4805. bool is_unicast, uint32_t *key)
  4806. {
  4807. uint8_t sec_index = is_unicast ? 1 : 0;
  4808. struct dp_peer *peer =
  4809. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  4810. peer_mac, 0, vdev_id,
  4811. DP_MOD_ID_CDP);
  4812. if (!peer) {
  4813. dp_peer_err("%pK: peer not found ", soc);
  4814. return QDF_STATUS_E_FAILURE;
  4815. }
  4816. qdf_mem_copy(&peer->txrx_peer->security[sec_index].michael_key[0],
  4817. key, IEEE80211_WEP_MICLEN);
  4818. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4819. return QDF_STATUS_SUCCESS;
  4820. }
  4821. /**
  4822. * dp_vdev_bss_peer_ref_n_get: Get bss peer of a vdev
  4823. * @soc: DP soc
  4824. * @vdev: vdev
  4825. * @mod_id: id of module requesting reference
  4826. *
  4827. * Return: VDEV BSS peer
  4828. */
  4829. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  4830. struct dp_vdev *vdev,
  4831. enum dp_mod_id mod_id)
  4832. {
  4833. struct dp_peer *peer = NULL;
  4834. qdf_spin_lock_bh(&vdev->peer_list_lock);
  4835. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  4836. if (peer->bss_peer)
  4837. break;
  4838. }
  4839. if (!peer) {
  4840. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4841. return NULL;
  4842. }
  4843. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  4844. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4845. return peer;
  4846. }
  4847. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4848. return peer;
  4849. }
  4850. /**
  4851. * dp_sta_vdev_self_peer_ref_n_get: Get self peer of sta vdev
  4852. * @soc: DP soc
  4853. * @vdev: vdev
  4854. * @mod_id: id of module requesting reference
  4855. *
  4856. * Return: VDEV self peer
  4857. */
  4858. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  4859. struct dp_vdev *vdev,
  4860. enum dp_mod_id mod_id)
  4861. {
  4862. struct dp_peer *peer;
  4863. if (vdev->opmode != wlan_op_mode_sta)
  4864. return NULL;
  4865. qdf_spin_lock_bh(&vdev->peer_list_lock);
  4866. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  4867. if (peer->sta_self_peer)
  4868. break;
  4869. }
  4870. if (!peer) {
  4871. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4872. return NULL;
  4873. }
  4874. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  4875. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4876. return peer;
  4877. }
  4878. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4879. return peer;
  4880. }
  4881. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  4882. void dp_dump_rx_reo_queue_info(
  4883. struct dp_soc *soc, void *cb_ctxt, union hal_reo_status *reo_status)
  4884. {
  4885. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  4886. if (!rx_tid)
  4887. return;
  4888. if (reo_status->fl_cache_status.header.status !=
  4889. HAL_REO_CMD_SUCCESS) {
  4890. dp_err_rl("Rx tid REO HW desc flush failed(%d)",
  4891. reo_status->rx_queue_status.header.status);
  4892. return;
  4893. }
  4894. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4895. hal_dump_rx_reo_queue_desc(rx_tid->hw_qdesc_vaddr_aligned);
  4896. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4897. }
  4898. void dp_send_cache_flush_for_rx_tid(
  4899. struct dp_soc *soc, struct dp_peer *peer)
  4900. {
  4901. int i;
  4902. struct dp_rx_tid *rx_tid;
  4903. struct hal_reo_cmd_params params;
  4904. if (!peer) {
  4905. dp_err_rl("Peer is NULL");
  4906. return;
  4907. }
  4908. for (i = 0; i < DP_MAX_TIDS; i++) {
  4909. rx_tid = &peer->rx_tid[i];
  4910. if (!rx_tid)
  4911. continue;
  4912. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4913. if (rx_tid->hw_qdesc_vaddr_aligned) {
  4914. qdf_mem_zero(&params, sizeof(params));
  4915. params.std.need_status = 1;
  4916. params.std.addr_lo =
  4917. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4918. params.std.addr_hi =
  4919. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4920. params.u.fl_cache_params.flush_no_inval = 0;
  4921. if (QDF_STATUS_SUCCESS !=
  4922. dp_reo_send_cmd(
  4923. soc, CMD_FLUSH_CACHE,
  4924. &params, dp_dump_rx_reo_queue_info,
  4925. (void *)rx_tid)) {
  4926. dp_err_rl("cache flush send failed tid %d",
  4927. rx_tid->tid);
  4928. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4929. break;
  4930. }
  4931. }
  4932. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4933. }
  4934. }
  4935. void dp_get_rx_reo_queue_info(
  4936. struct cdp_soc_t *soc_hdl, uint8_t vdev_id)
  4937. {
  4938. struct dp_soc *soc = (struct dp_soc *)soc_hdl;
  4939. struct dp_vdev *vdev = dp_vdev_get_ref_by_id(soc, vdev_id,
  4940. DP_MOD_ID_GENERIC_STATS);
  4941. struct dp_peer *peer = NULL;
  4942. if (!vdev) {
  4943. dp_err_rl("vdev is null for vdev_id: %u", vdev_id);
  4944. goto failed;
  4945. }
  4946. peer = dp_vdev_bss_peer_ref_n_get(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  4947. if (!peer) {
  4948. dp_err_rl("Peer is NULL");
  4949. goto failed;
  4950. }
  4951. dp_send_cache_flush_for_rx_tid(soc, peer);
  4952. failed:
  4953. if (peer)
  4954. dp_peer_unref_delete(peer, DP_MOD_ID_GENERIC_STATS);
  4955. if (vdev)
  4956. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  4957. }
  4958. #endif /* DUMP_REO_QUEUE_INFO_IN_DDR */
  4959. void dp_peer_flush_frags(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4960. uint8_t *peer_mac)
  4961. {
  4962. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4963. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(soc, peer_mac, 0,
  4964. vdev_id,
  4965. DP_MOD_ID_CDP);
  4966. struct dp_txrx_peer *txrx_peer;
  4967. uint8_t tid;
  4968. struct dp_rx_tid_defrag *defrag_rx_tid;
  4969. if (!peer)
  4970. return;
  4971. if (!peer->txrx_peer)
  4972. goto fail;
  4973. dp_info("Flushing fragments for peer " QDF_MAC_ADDR_FMT,
  4974. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  4975. txrx_peer = peer->txrx_peer;
  4976. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  4977. defrag_rx_tid = &txrx_peer->rx_tid[tid];
  4978. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  4979. dp_rx_defrag_waitlist_remove(txrx_peer, tid);
  4980. dp_rx_reorder_flush_frag(txrx_peer, tid);
  4981. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  4982. }
  4983. fail:
  4984. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4985. }
  4986. /*
  4987. * dp_peer_find_by_id_valid - check if peer exists for given id
  4988. * @soc: core DP soc context
  4989. * @peer_id: peer id from peer object can be retrieved
  4990. *
  4991. * Return: true if peer exists of false otherwise
  4992. */
  4993. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id)
  4994. {
  4995. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id,
  4996. DP_MOD_ID_HTT);
  4997. if (peer) {
  4998. /*
  4999. * Decrement the peer ref which is taken as part of
  5000. * dp_peer_get_ref_by_id if PEER_LOCK_REF_PROTECT is enabled
  5001. */
  5002. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  5003. return true;
  5004. }
  5005. return false;
  5006. }
  5007. qdf_export_symbol(dp_peer_find_by_id_valid);