dp_peer.c 148 KB

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