dp_peer.c 162 KB

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