dp_peer.c 164 KB

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