dp_peer.c 153 KB

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