dp_peer.c 153 KB

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