dp_peer.c 127 KB

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