dp_peer.c 153 KB

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