dp_peer.c 165 KB

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