dp_peer.c 142 KB

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