dp_peer.c 144 KB

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