dp_peer.c 127 KB

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