dp_peer.c 150 KB

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