dp_peer.c 154 KB

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