dp_peer.c 151 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713
  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, vdev_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. if (!soc->ast_hash.bins)
  1213. return NULL;
  1214. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1215. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1216. mac_addr = &local_mac_addr_aligned;
  1217. index = dp_peer_ast_hash_index(soc, mac_addr);
  1218. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1219. if (dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr) == 0) {
  1220. return ase;
  1221. }
  1222. }
  1223. return NULL;
  1224. }
  1225. /*
  1226. * dp_peer_map_ast() - Map the ast entry with HW AST Index
  1227. * @soc: SoC handle
  1228. * @peer: peer to which ast node belongs
  1229. * @mac_addr: MAC address of ast node
  1230. * @hw_peer_id: HW AST Index returned by target in peer map event
  1231. * @vdev_id: vdev id for VAP to which the peer belongs to
  1232. * @ast_hash: ast hash value in HW
  1233. * @is_wds: flag to indicate peer map event for WDS ast entry
  1234. *
  1235. * Return: QDF_STATUS code
  1236. */
  1237. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1238. struct dp_peer *peer,
  1239. uint8_t *mac_addr,
  1240. uint16_t hw_peer_id,
  1241. uint8_t vdev_id,
  1242. uint16_t ast_hash,
  1243. uint8_t is_wds)
  1244. {
  1245. struct dp_ast_entry *ast_entry = NULL;
  1246. enum cdp_txrx_ast_entry_type peer_type = CDP_TXRX_AST_TYPE_STATIC;
  1247. void *cookie = NULL;
  1248. txrx_ast_free_cb cb = NULL;
  1249. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1250. if (soc->ast_offload_support)
  1251. return QDF_STATUS_SUCCESS;
  1252. if (!peer) {
  1253. return QDF_STATUS_E_INVAL;
  1254. }
  1255. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1256. soc, peer, hw_peer_id, vdev_id,
  1257. QDF_MAC_ADDR_REF(mac_addr));
  1258. qdf_spin_lock_bh(&soc->ast_lock);
  1259. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  1260. if (is_wds) {
  1261. /*
  1262. * In certain cases like Auth attack on a repeater
  1263. * can result in the number of ast_entries falling
  1264. * in the same hash bucket to exceed the max_skid
  1265. * length supported by HW in root AP. In these cases
  1266. * the FW will return the hw_peer_id (ast_index) as
  1267. * 0xffff indicating HW could not add the entry in
  1268. * its table. Host has to delete the entry from its
  1269. * table in these cases.
  1270. */
  1271. if (hw_peer_id == HTT_INVALID_PEER) {
  1272. DP_STATS_INC(soc, ast.map_err, 1);
  1273. if (ast_entry) {
  1274. if (ast_entry->is_mapped) {
  1275. soc->ast_table[ast_entry->ast_idx] =
  1276. NULL;
  1277. }
  1278. cb = ast_entry->callback;
  1279. cookie = ast_entry->cookie;
  1280. peer_type = ast_entry->type;
  1281. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1282. dp_peer_free_ast_entry(soc, ast_entry);
  1283. qdf_spin_unlock_bh(&soc->ast_lock);
  1284. if (cb) {
  1285. cb(soc->ctrl_psoc,
  1286. dp_soc_to_cdp_soc(soc),
  1287. cookie,
  1288. CDP_TXRX_AST_DELETED);
  1289. }
  1290. } else {
  1291. qdf_spin_unlock_bh(&soc->ast_lock);
  1292. 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",
  1293. peer, peer->peer_id,
  1294. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  1295. QDF_MAC_ADDR_REF(mac_addr),
  1296. vdev_id, is_wds);
  1297. }
  1298. err = QDF_STATUS_E_INVAL;
  1299. dp_hmwds_ast_add_notify(peer, mac_addr,
  1300. peer_type, err, true);
  1301. return err;
  1302. }
  1303. }
  1304. if (ast_entry) {
  1305. ast_entry->ast_idx = hw_peer_id;
  1306. soc->ast_table[hw_peer_id] = ast_entry;
  1307. ast_entry->is_active = TRUE;
  1308. peer_type = ast_entry->type;
  1309. ast_entry->ast_hash_value = ast_hash;
  1310. ast_entry->is_mapped = TRUE;
  1311. qdf_assert_always(ast_entry->peer_id == HTT_INVALID_PEER);
  1312. ast_entry->peer_id = peer->peer_id;
  1313. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1314. ase_list_elem);
  1315. }
  1316. if (ast_entry || (peer->vdev && peer->vdev->proxysta_vdev)) {
  1317. if (soc->cdp_soc.ol_ops->peer_map_event) {
  1318. soc->cdp_soc.ol_ops->peer_map_event(
  1319. soc->ctrl_psoc, peer->peer_id,
  1320. hw_peer_id, vdev_id,
  1321. mac_addr, peer_type, ast_hash);
  1322. }
  1323. } else {
  1324. dp_peer_err("%pK: AST entry not found", soc);
  1325. err = QDF_STATUS_E_NOENT;
  1326. }
  1327. qdf_spin_unlock_bh(&soc->ast_lock);
  1328. dp_hmwds_ast_add_notify(peer, mac_addr,
  1329. peer_type, err, true);
  1330. return err;
  1331. }
  1332. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  1333. struct cdp_soc *dp_soc,
  1334. void *cookie,
  1335. enum cdp_ast_free_status status)
  1336. {
  1337. struct dp_ast_free_cb_params *param =
  1338. (struct dp_ast_free_cb_params *)cookie;
  1339. struct dp_soc *soc = (struct dp_soc *)dp_soc;
  1340. struct dp_peer *peer = NULL;
  1341. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1342. if (status != CDP_TXRX_AST_DELETED) {
  1343. qdf_mem_free(cookie);
  1344. return;
  1345. }
  1346. peer = dp_peer_find_hash_find(soc, &param->peer_mac_addr.raw[0],
  1347. 0, param->vdev_id, DP_MOD_ID_AST);
  1348. if (peer) {
  1349. err = dp_peer_add_ast(soc, peer,
  1350. &param->mac_addr.raw[0],
  1351. param->type,
  1352. param->flags);
  1353. dp_hmwds_ast_add_notify(peer, &param->mac_addr.raw[0],
  1354. param->type, err, false);
  1355. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1356. }
  1357. qdf_mem_free(cookie);
  1358. }
  1359. /*
  1360. * dp_peer_add_ast() - Allocate and add AST entry into peer list
  1361. * @soc: SoC handle
  1362. * @peer: peer to which ast node belongs
  1363. * @mac_addr: MAC address of ast node
  1364. * @is_self: Is this base AST entry with peer mac address
  1365. *
  1366. * This API is used by WDS source port learning function to
  1367. * add a new AST entry into peer AST list
  1368. *
  1369. * Return: QDF_STATUS code
  1370. */
  1371. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1372. struct dp_peer *peer,
  1373. uint8_t *mac_addr,
  1374. enum cdp_txrx_ast_entry_type type,
  1375. uint32_t flags)
  1376. {
  1377. struct dp_ast_entry *ast_entry = NULL;
  1378. struct dp_vdev *vdev = NULL;
  1379. struct dp_pdev *pdev = NULL;
  1380. txrx_ast_free_cb cb = NULL;
  1381. void *cookie = NULL;
  1382. struct dp_peer *vap_bss_peer = NULL;
  1383. bool is_peer_found = false;
  1384. int status = 0;
  1385. if (soc->ast_offload_support)
  1386. return QDF_STATUS_E_INVAL;
  1387. vdev = peer->vdev;
  1388. if (!vdev) {
  1389. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1390. QDF_ASSERT(0);
  1391. return QDF_STATUS_E_INVAL;
  1392. }
  1393. pdev = vdev->pdev;
  1394. is_peer_found = dp_peer_exist_on_pdev(soc, mac_addr, 0, pdev);
  1395. qdf_spin_lock_bh(&soc->ast_lock);
  1396. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1397. if ((type != CDP_TXRX_AST_TYPE_STATIC) &&
  1398. (type != CDP_TXRX_AST_TYPE_SELF)) {
  1399. qdf_spin_unlock_bh(&soc->ast_lock);
  1400. return QDF_STATUS_E_BUSY;
  1401. }
  1402. }
  1403. 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,
  1404. soc, pdev->pdev_id, vdev->vdev_id, type, flags,
  1405. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1406. QDF_MAC_ADDR_REF(mac_addr));
  1407. /* fw supports only 2 times the max_peers ast entries */
  1408. if (soc->num_ast_entries >=
  1409. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  1410. qdf_spin_unlock_bh(&soc->ast_lock);
  1411. dp_peer_err("%pK: Max ast entries reached", soc);
  1412. return QDF_STATUS_E_RESOURCES;
  1413. }
  1414. /* If AST entry already exists , just return from here
  1415. * ast entry with same mac address can exist on different radios
  1416. * if ast_override support is enabled use search by pdev in this
  1417. * case
  1418. */
  1419. if (soc->ast_override_support) {
  1420. ast_entry = dp_peer_ast_hash_find_by_pdevid(soc, mac_addr,
  1421. pdev->pdev_id);
  1422. if (ast_entry) {
  1423. qdf_spin_unlock_bh(&soc->ast_lock);
  1424. return QDF_STATUS_E_ALREADY;
  1425. }
  1426. if (is_peer_found) {
  1427. /* During WDS to static roaming, peer is added
  1428. * to the list before static AST entry create.
  1429. * So, allow AST entry for STATIC type
  1430. * even if peer is present
  1431. */
  1432. if (type != CDP_TXRX_AST_TYPE_STATIC) {
  1433. qdf_spin_unlock_bh(&soc->ast_lock);
  1434. return QDF_STATUS_E_ALREADY;
  1435. }
  1436. }
  1437. } else {
  1438. /* For HWMWDS_SEC entries can be added for same mac address
  1439. * do not check for existing entry
  1440. */
  1441. if (type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1442. goto add_ast_entry;
  1443. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1444. if (ast_entry) {
  1445. if ((ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM) &&
  1446. !ast_entry->delete_in_progress) {
  1447. qdf_spin_unlock_bh(&soc->ast_lock);
  1448. return QDF_STATUS_E_ALREADY;
  1449. }
  1450. /* Add for HMWDS entry we cannot be ignored if there
  1451. * is AST entry with same mac address
  1452. *
  1453. * if ast entry exists with the requested mac address
  1454. * send a delete command and register callback which
  1455. * can take care of adding HMWDS ast enty on delete
  1456. * confirmation from target
  1457. */
  1458. if (type == CDP_TXRX_AST_TYPE_WDS_HM) {
  1459. struct dp_ast_free_cb_params *param = NULL;
  1460. if (ast_entry->type ==
  1461. CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1462. goto add_ast_entry;
  1463. /* save existing callback */
  1464. if (ast_entry->callback) {
  1465. cb = ast_entry->callback;
  1466. cookie = ast_entry->cookie;
  1467. }
  1468. param = qdf_mem_malloc(sizeof(*param));
  1469. if (!param) {
  1470. QDF_TRACE(QDF_MODULE_ID_TXRX,
  1471. QDF_TRACE_LEVEL_ERROR,
  1472. "Allocation failed");
  1473. qdf_spin_unlock_bh(&soc->ast_lock);
  1474. return QDF_STATUS_E_NOMEM;
  1475. }
  1476. qdf_mem_copy(&param->mac_addr.raw[0], mac_addr,
  1477. QDF_MAC_ADDR_SIZE);
  1478. qdf_mem_copy(&param->peer_mac_addr.raw[0],
  1479. &peer->mac_addr.raw[0],
  1480. QDF_MAC_ADDR_SIZE);
  1481. param->type = type;
  1482. param->flags = flags;
  1483. param->vdev_id = vdev->vdev_id;
  1484. ast_entry->callback = dp_peer_free_hmwds_cb;
  1485. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1486. ast_entry->type = type;
  1487. ast_entry->cookie = (void *)param;
  1488. if (!ast_entry->delete_in_progress)
  1489. dp_peer_del_ast(soc, ast_entry);
  1490. qdf_spin_unlock_bh(&soc->ast_lock);
  1491. /* Call the saved callback*/
  1492. if (cb) {
  1493. cb(soc->ctrl_psoc,
  1494. dp_soc_to_cdp_soc(soc),
  1495. cookie,
  1496. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  1497. }
  1498. return QDF_STATUS_E_AGAIN;
  1499. }
  1500. qdf_spin_unlock_bh(&soc->ast_lock);
  1501. return QDF_STATUS_E_ALREADY;
  1502. }
  1503. }
  1504. add_ast_entry:
  1505. ast_entry = (struct dp_ast_entry *)
  1506. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1507. if (!ast_entry) {
  1508. qdf_spin_unlock_bh(&soc->ast_lock);
  1509. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1510. QDF_ASSERT(0);
  1511. return QDF_STATUS_E_NOMEM;
  1512. }
  1513. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1514. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1515. ast_entry->is_mapped = false;
  1516. ast_entry->delete_in_progress = false;
  1517. ast_entry->peer_id = HTT_INVALID_PEER;
  1518. ast_entry->next_hop = 0;
  1519. ast_entry->vdev_id = vdev->vdev_id;
  1520. switch (type) {
  1521. case CDP_TXRX_AST_TYPE_STATIC:
  1522. peer->self_ast_entry = ast_entry;
  1523. ast_entry->type = CDP_TXRX_AST_TYPE_STATIC;
  1524. if (peer->vdev->opmode == wlan_op_mode_sta)
  1525. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1526. break;
  1527. case CDP_TXRX_AST_TYPE_SELF:
  1528. peer->self_ast_entry = ast_entry;
  1529. ast_entry->type = CDP_TXRX_AST_TYPE_SELF;
  1530. break;
  1531. case CDP_TXRX_AST_TYPE_WDS:
  1532. ast_entry->next_hop = 1;
  1533. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1534. break;
  1535. case CDP_TXRX_AST_TYPE_WDS_HM:
  1536. ast_entry->next_hop = 1;
  1537. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM;
  1538. break;
  1539. case CDP_TXRX_AST_TYPE_WDS_HM_SEC:
  1540. ast_entry->next_hop = 1;
  1541. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM_SEC;
  1542. ast_entry->peer_id = peer->peer_id;
  1543. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1544. ase_list_elem);
  1545. break;
  1546. case CDP_TXRX_AST_TYPE_DA:
  1547. vap_bss_peer = dp_vdev_bss_peer_ref_n_get(soc, vdev,
  1548. DP_MOD_ID_AST);
  1549. if (!vap_bss_peer) {
  1550. qdf_spin_unlock_bh(&soc->ast_lock);
  1551. qdf_mem_free(ast_entry);
  1552. return QDF_STATUS_E_FAILURE;
  1553. }
  1554. peer = vap_bss_peer;
  1555. ast_entry->next_hop = 1;
  1556. ast_entry->type = CDP_TXRX_AST_TYPE_DA;
  1557. break;
  1558. default:
  1559. dp_peer_err("%pK: Incorrect AST entry type", soc);
  1560. }
  1561. ast_entry->is_active = TRUE;
  1562. DP_STATS_INC(soc, ast.added, 1);
  1563. soc->num_ast_entries++;
  1564. dp_peer_ast_hash_add(soc, ast_entry);
  1565. if ((ast_entry->type != CDP_TXRX_AST_TYPE_STATIC) &&
  1566. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF) &&
  1567. (ast_entry->type != CDP_TXRX_AST_TYPE_STA_BSS) &&
  1568. (ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1569. status = dp_add_wds_entry_wrapper(soc,
  1570. peer,
  1571. mac_addr,
  1572. flags,
  1573. ast_entry->type);
  1574. if (vap_bss_peer)
  1575. dp_peer_unref_delete(vap_bss_peer, DP_MOD_ID_AST);
  1576. qdf_spin_unlock_bh(&soc->ast_lock);
  1577. return qdf_status_from_os_return(status);
  1578. }
  1579. qdf_export_symbol(dp_peer_add_ast);
  1580. /*
  1581. * dp_peer_free_ast_entry() - Free up the ast entry memory
  1582. * @soc: SoC handle
  1583. * @ast_entry: Address search entry
  1584. *
  1585. * This API is used to free up the memory associated with
  1586. * AST entry.
  1587. *
  1588. * Return: None
  1589. */
  1590. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1591. struct dp_ast_entry *ast_entry)
  1592. {
  1593. /*
  1594. * NOTE: Ensure that call to this API is done
  1595. * after soc->ast_lock is taken
  1596. */
  1597. dp_peer_debug("type: %d ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1598. ast_entry->type, ast_entry->peer_id, ast_entry->vdev_id,
  1599. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1600. ast_entry->callback = NULL;
  1601. ast_entry->cookie = NULL;
  1602. DP_STATS_INC(soc, ast.deleted, 1);
  1603. dp_peer_ast_hash_remove(soc, ast_entry);
  1604. dp_peer_ast_cleanup(soc, ast_entry);
  1605. qdf_mem_free(ast_entry);
  1606. soc->num_ast_entries--;
  1607. }
  1608. /*
  1609. * dp_peer_unlink_ast_entry() - Free up the ast entry memory
  1610. * @soc: SoC handle
  1611. * @ast_entry: Address search entry
  1612. * @peer: peer
  1613. *
  1614. * This API is used to remove/unlink AST entry from the peer list
  1615. * and hash list.
  1616. *
  1617. * Return: None
  1618. */
  1619. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1620. struct dp_ast_entry *ast_entry,
  1621. struct dp_peer *peer)
  1622. {
  1623. if (!peer) {
  1624. dp_info_rl("NULL peer");
  1625. return;
  1626. }
  1627. if (ast_entry->peer_id == HTT_INVALID_PEER) {
  1628. dp_info_rl("Invalid peer id in AST entry mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1629. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1630. ast_entry->type);
  1631. return;
  1632. }
  1633. /*
  1634. * NOTE: Ensure that call to this API is done
  1635. * after soc->ast_lock is taken
  1636. */
  1637. qdf_assert_always(ast_entry->peer_id == peer->peer_id);
  1638. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1639. if (ast_entry == peer->self_ast_entry)
  1640. peer->self_ast_entry = NULL;
  1641. /*
  1642. * release the reference only if it is mapped
  1643. * to ast_table
  1644. */
  1645. if (ast_entry->is_mapped)
  1646. soc->ast_table[ast_entry->ast_idx] = NULL;
  1647. ast_entry->peer_id = HTT_INVALID_PEER;
  1648. }
  1649. /*
  1650. * dp_peer_del_ast() - Delete and free AST entry
  1651. * @soc: SoC handle
  1652. * @ast_entry: AST entry of the node
  1653. *
  1654. * This function removes the AST entry from peer and soc tables
  1655. * It assumes caller has taken the ast lock to protect the access to these
  1656. * tables
  1657. *
  1658. * Return: None
  1659. */
  1660. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1661. {
  1662. struct dp_peer *peer = NULL;
  1663. if (soc->ast_offload_support)
  1664. return;
  1665. if (!ast_entry) {
  1666. dp_info_rl("NULL AST entry");
  1667. return;
  1668. }
  1669. if (ast_entry->delete_in_progress) {
  1670. dp_info_rl("AST entry deletion in progress mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1671. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1672. ast_entry->type);
  1673. return;
  1674. }
  1675. dp_peer_debug("call by %ps: ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1676. (void *)_RET_IP_, ast_entry->peer_id, ast_entry->vdev_id,
  1677. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1678. ast_entry->delete_in_progress = true;
  1679. /* In teardown del ast is called after setting logical delete state
  1680. * use __dp_peer_get_ref_by_id to get the reference irrespective of
  1681. * state
  1682. */
  1683. peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1684. DP_MOD_ID_AST);
  1685. dp_peer_ast_send_wds_del(soc, ast_entry, peer);
  1686. /* Remove SELF and STATIC entries in teardown itself */
  1687. if (!ast_entry->next_hop)
  1688. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1689. if (ast_entry->is_mapped)
  1690. soc->ast_table[ast_entry->ast_idx] = NULL;
  1691. /* if peer map v2 is enabled we are not freeing ast entry
  1692. * here and it is supposed to be freed in unmap event (after
  1693. * we receive delete confirmation from target)
  1694. *
  1695. * if peer_id is invalid we did not get the peer map event
  1696. * for the peer free ast entry from here only in this case
  1697. */
  1698. if (dp_peer_ast_free_in_unmap_supported(soc, ast_entry))
  1699. goto end;
  1700. /* for WDS secondary entry ast_entry->next_hop would be set so
  1701. * unlinking has to be done explicitly here.
  1702. * As this entry is not a mapped entry unmap notification from
  1703. * FW wil not come. Hence unlinkling is done right here.
  1704. */
  1705. if (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1706. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1707. dp_peer_free_ast_entry(soc, ast_entry);
  1708. end:
  1709. if (peer)
  1710. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1711. }
  1712. /*
  1713. * dp_peer_update_ast() - Delete and free AST entry
  1714. * @soc: SoC handle
  1715. * @peer: peer to which ast node belongs
  1716. * @ast_entry: AST entry of the node
  1717. * @flags: wds or hmwds
  1718. *
  1719. * This function update the AST entry to the roamed peer and soc tables
  1720. * It assumes caller has taken the ast lock to protect the access to these
  1721. * tables
  1722. *
  1723. * Return: 0 if ast entry is updated successfully
  1724. * -1 failure
  1725. */
  1726. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1727. struct dp_ast_entry *ast_entry, uint32_t flags)
  1728. {
  1729. int ret = -1;
  1730. struct dp_peer *old_peer;
  1731. if (soc->ast_offload_support)
  1732. return QDF_STATUS_E_INVAL;
  1733. 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",
  1734. soc, ast_entry->type, peer->vdev->pdev->pdev_id,
  1735. peer->vdev->vdev_id, flags,
  1736. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1737. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  1738. /* Do not send AST update in below cases
  1739. * 1) Ast entry delete has already triggered
  1740. * 2) Peer delete is already triggered
  1741. * 3) We did not get the HTT map for create event
  1742. */
  1743. if (ast_entry->delete_in_progress ||
  1744. !dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE) ||
  1745. !ast_entry->is_mapped)
  1746. return ret;
  1747. if ((ast_entry->type == CDP_TXRX_AST_TYPE_STATIC) ||
  1748. (ast_entry->type == CDP_TXRX_AST_TYPE_SELF) ||
  1749. (ast_entry->type == CDP_TXRX_AST_TYPE_STA_BSS) ||
  1750. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1751. return 0;
  1752. /*
  1753. * Avoids flood of WMI update messages sent to FW for same peer.
  1754. */
  1755. if (qdf_unlikely(ast_entry->peer_id == peer->peer_id) &&
  1756. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS) &&
  1757. (ast_entry->vdev_id == peer->vdev->vdev_id) &&
  1758. (ast_entry->is_active))
  1759. return 0;
  1760. old_peer = dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1761. DP_MOD_ID_AST);
  1762. if (!old_peer)
  1763. return 0;
  1764. TAILQ_REMOVE(&old_peer->ast_entry_list, ast_entry, ase_list_elem);
  1765. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1766. ast_entry->peer_id = peer->peer_id;
  1767. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1768. ast_entry->pdev_id = peer->vdev->pdev->pdev_id;
  1769. ast_entry->vdev_id = peer->vdev->vdev_id;
  1770. ast_entry->is_active = TRUE;
  1771. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1772. ret = dp_update_wds_entry_wrapper(soc,
  1773. peer,
  1774. ast_entry->mac_addr.raw,
  1775. flags);
  1776. return ret;
  1777. }
  1778. /*
  1779. * dp_peer_ast_get_pdev_id() - get pdev_id from the ast entry
  1780. * @soc: SoC handle
  1781. * @ast_entry: AST entry of the node
  1782. *
  1783. * This function gets the pdev_id from the ast entry.
  1784. *
  1785. * Return: (uint8_t) pdev_id
  1786. */
  1787. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1788. struct dp_ast_entry *ast_entry)
  1789. {
  1790. return ast_entry->pdev_id;
  1791. }
  1792. /*
  1793. * dp_peer_ast_get_next_hop() - get next_hop from the ast entry
  1794. * @soc: SoC handle
  1795. * @ast_entry: AST entry of the node
  1796. *
  1797. * This function gets the next hop from the ast entry.
  1798. *
  1799. * Return: (uint8_t) next_hop
  1800. */
  1801. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1802. struct dp_ast_entry *ast_entry)
  1803. {
  1804. return ast_entry->next_hop;
  1805. }
  1806. /*
  1807. * dp_peer_ast_set_type() - set type from the ast entry
  1808. * @soc: SoC handle
  1809. * @ast_entry: AST entry of the node
  1810. *
  1811. * This function sets the type in the ast entry.
  1812. *
  1813. * Return:
  1814. */
  1815. void dp_peer_ast_set_type(struct dp_soc *soc,
  1816. struct dp_ast_entry *ast_entry,
  1817. enum cdp_txrx_ast_entry_type type)
  1818. {
  1819. ast_entry->type = type;
  1820. }
  1821. #else
  1822. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1823. struct dp_peer *peer,
  1824. uint8_t *mac_addr,
  1825. enum cdp_txrx_ast_entry_type type,
  1826. uint32_t flags)
  1827. {
  1828. return QDF_STATUS_E_FAILURE;
  1829. }
  1830. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1831. {
  1832. }
  1833. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1834. struct dp_ast_entry *ast_entry, uint32_t flags)
  1835. {
  1836. return 1;
  1837. }
  1838. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1839. uint8_t *ast_mac_addr)
  1840. {
  1841. return NULL;
  1842. }
  1843. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1844. uint8_t *ast_mac_addr,
  1845. uint8_t pdev_id)
  1846. {
  1847. return NULL;
  1848. }
  1849. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  1850. {
  1851. return QDF_STATUS_SUCCESS;
  1852. }
  1853. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1854. struct dp_peer *peer,
  1855. uint8_t *mac_addr,
  1856. uint16_t hw_peer_id,
  1857. uint8_t vdev_id,
  1858. uint16_t ast_hash,
  1859. uint8_t is_wds)
  1860. {
  1861. return QDF_STATUS_SUCCESS;
  1862. }
  1863. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  1864. {
  1865. }
  1866. void dp_peer_ast_set_type(struct dp_soc *soc,
  1867. struct dp_ast_entry *ast_entry,
  1868. enum cdp_txrx_ast_entry_type type)
  1869. {
  1870. }
  1871. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1872. struct dp_ast_entry *ast_entry)
  1873. {
  1874. return 0xff;
  1875. }
  1876. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1877. struct dp_ast_entry *ast_entry)
  1878. {
  1879. return 0xff;
  1880. }
  1881. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1882. struct dp_ast_entry *ast_entry, uint32_t flags)
  1883. {
  1884. return 1;
  1885. }
  1886. #endif
  1887. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  1888. struct dp_ast_entry *ast_entry,
  1889. struct dp_peer *peer)
  1890. {
  1891. bool delete_in_fw = false;
  1892. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_TRACE,
  1893. "%s: ast_entry->type: %d pdevid: %u vdev: %u mac_addr: "QDF_MAC_ADDR_FMT" next_hop: %u peer_id: %uM\n",
  1894. __func__, ast_entry->type, ast_entry->pdev_id,
  1895. ast_entry->vdev_id,
  1896. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1897. ast_entry->next_hop, ast_entry->peer_id);
  1898. /*
  1899. * If peer state is logical delete, the peer is about to get
  1900. * teared down with a peer delete command to firmware,
  1901. * which will cleanup all the wds ast entries.
  1902. * So, no need to send explicit wds ast delete to firmware.
  1903. */
  1904. if (ast_entry->next_hop) {
  1905. if (peer && dp_peer_state_cmp(peer,
  1906. DP_PEER_STATE_LOGICAL_DELETE))
  1907. delete_in_fw = false;
  1908. else
  1909. delete_in_fw = true;
  1910. dp_del_wds_entry_wrapper(soc,
  1911. ast_entry->vdev_id,
  1912. ast_entry->mac_addr.raw,
  1913. ast_entry->type,
  1914. delete_in_fw);
  1915. }
  1916. }
  1917. #ifdef WLAN_FEATURE_MULTI_AST_DEL
  1918. void dp_peer_ast_send_multi_wds_del(
  1919. struct dp_soc *soc, uint8_t vdev_id,
  1920. struct peer_del_multi_wds_entries *wds_list)
  1921. {
  1922. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  1923. if (cdp_soc && cdp_soc->ol_ops &&
  1924. cdp_soc->ol_ops->peer_del_multi_wds_entry)
  1925. cdp_soc->ol_ops->peer_del_multi_wds_entry(soc->ctrl_psoc,
  1926. vdev_id, wds_list);
  1927. }
  1928. #endif
  1929. #ifdef FEATURE_WDS
  1930. /**
  1931. * dp_peer_ast_free_wds_entries() - Free wds ast entries associated with peer
  1932. * @soc: soc handle
  1933. * @peer: peer handle
  1934. *
  1935. * Free all the wds ast entries associated with peer
  1936. *
  1937. * Return: Number of wds ast entries freed
  1938. */
  1939. static uint32_t dp_peer_ast_free_wds_entries(struct dp_soc *soc,
  1940. struct dp_peer *peer)
  1941. {
  1942. TAILQ_HEAD(, dp_ast_entry) ast_local_list = {0};
  1943. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  1944. uint32_t num_ast = 0;
  1945. TAILQ_INIT(&ast_local_list);
  1946. qdf_spin_lock_bh(&soc->ast_lock);
  1947. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  1948. if (ast_entry->next_hop)
  1949. num_ast++;
  1950. if (ast_entry->is_mapped)
  1951. soc->ast_table[ast_entry->ast_idx] = NULL;
  1952. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1953. DP_STATS_INC(soc, ast.deleted, 1);
  1954. dp_peer_ast_hash_remove(soc, ast_entry);
  1955. TAILQ_INSERT_TAIL(&ast_local_list, ast_entry,
  1956. ase_list_elem);
  1957. soc->num_ast_entries--;
  1958. }
  1959. qdf_spin_unlock_bh(&soc->ast_lock);
  1960. TAILQ_FOREACH_SAFE(ast_entry, &ast_local_list, ase_list_elem,
  1961. temp_ast_entry) {
  1962. if (ast_entry->callback)
  1963. ast_entry->callback(soc->ctrl_psoc,
  1964. dp_soc_to_cdp_soc(soc),
  1965. ast_entry->cookie,
  1966. CDP_TXRX_AST_DELETED);
  1967. qdf_mem_free(ast_entry);
  1968. }
  1969. return num_ast;
  1970. }
  1971. /**
  1972. * dp_peer_clean_wds_entries() - Clean wds ast entries and compare
  1973. * @soc: soc handle
  1974. * @peer: peer handle
  1975. * @free_wds_count - number of wds entries freed by FW with peer delete
  1976. *
  1977. * Free all the wds ast entries associated with peer and compare with
  1978. * the value received from firmware
  1979. *
  1980. * Return: Number of wds ast entries freed
  1981. */
  1982. static void
  1983. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  1984. uint32_t free_wds_count)
  1985. {
  1986. uint32_t wds_deleted = 0;
  1987. if (soc->ast_offload_support)
  1988. return;
  1989. wds_deleted = dp_peer_ast_free_wds_entries(soc, peer);
  1990. if ((DP_PEER_WDS_COUNT_INVALID != free_wds_count) &&
  1991. (free_wds_count != wds_deleted)) {
  1992. DP_STATS_INC(soc, ast.ast_mismatch, 1);
  1993. 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",
  1994. peer, peer->mac_addr.raw, free_wds_count,
  1995. wds_deleted);
  1996. }
  1997. }
  1998. #else
  1999. static void
  2000. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  2001. uint32_t free_wds_count)
  2002. {
  2003. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  2004. qdf_spin_lock_bh(&soc->ast_lock);
  2005. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  2006. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2007. if (ast_entry->is_mapped)
  2008. soc->ast_table[ast_entry->ast_idx] = NULL;
  2009. dp_peer_free_ast_entry(soc, ast_entry);
  2010. }
  2011. peer->self_ast_entry = NULL;
  2012. qdf_spin_unlock_bh(&soc->ast_lock);
  2013. }
  2014. #endif
  2015. /**
  2016. * dp_peer_ast_free_entry_by_mac() - find ast entry by MAC address and delete
  2017. * @soc: soc handle
  2018. * @peer: peer handle
  2019. * @vdev_id: vdev_id
  2020. * @mac_addr: mac address of the AST entry to searc and delete
  2021. *
  2022. * find the ast entry from the peer list using the mac address and free
  2023. * the entry.
  2024. *
  2025. * Return: SUCCESS or NOENT
  2026. */
  2027. static int dp_peer_ast_free_entry_by_mac(struct dp_soc *soc,
  2028. struct dp_peer *peer,
  2029. uint8_t vdev_id,
  2030. uint8_t *mac_addr)
  2031. {
  2032. struct dp_ast_entry *ast_entry;
  2033. void *cookie = NULL;
  2034. txrx_ast_free_cb cb = NULL;
  2035. /*
  2036. * release the reference only if it is mapped
  2037. * to ast_table
  2038. */
  2039. qdf_spin_lock_bh(&soc->ast_lock);
  2040. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  2041. if (!ast_entry) {
  2042. qdf_spin_unlock_bh(&soc->ast_lock);
  2043. return QDF_STATUS_E_NOENT;
  2044. } else if (ast_entry->is_mapped) {
  2045. soc->ast_table[ast_entry->ast_idx] = NULL;
  2046. }
  2047. cb = ast_entry->callback;
  2048. cookie = ast_entry->cookie;
  2049. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2050. dp_peer_free_ast_entry(soc, ast_entry);
  2051. qdf_spin_unlock_bh(&soc->ast_lock);
  2052. if (cb) {
  2053. cb(soc->ctrl_psoc,
  2054. dp_soc_to_cdp_soc(soc),
  2055. cookie,
  2056. CDP_TXRX_AST_DELETED);
  2057. }
  2058. return QDF_STATUS_SUCCESS;
  2059. }
  2060. void dp_peer_find_hash_erase(struct dp_soc *soc)
  2061. {
  2062. int i;
  2063. /*
  2064. * Not really necessary to take peer_ref_mutex lock - by this point,
  2065. * it's known that the soc is no longer in use.
  2066. */
  2067. for (i = 0; i <= soc->peer_hash.mask; i++) {
  2068. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  2069. struct dp_peer *peer, *peer_next;
  2070. /*
  2071. * TAILQ_FOREACH_SAFE must be used here to avoid any
  2072. * memory access violation after peer is freed
  2073. */
  2074. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  2075. hash_list_elem, peer_next) {
  2076. /*
  2077. * Don't remove the peer from the hash table -
  2078. * that would modify the list we are currently
  2079. * traversing, and it's not necessary anyway.
  2080. */
  2081. /*
  2082. * Artificially adjust the peer's ref count to
  2083. * 1, so it will get deleted by
  2084. * dp_peer_unref_delete.
  2085. */
  2086. /* set to zero */
  2087. qdf_atomic_init(&peer->ref_cnt);
  2088. for (i = 0; i < DP_MOD_ID_MAX; i++)
  2089. qdf_atomic_init(&peer->mod_refs[i]);
  2090. /* incr to one */
  2091. qdf_atomic_inc(&peer->ref_cnt);
  2092. qdf_atomic_inc(&peer->mod_refs
  2093. [DP_MOD_ID_CONFIG]);
  2094. dp_peer_unref_delete(peer,
  2095. DP_MOD_ID_CONFIG);
  2096. }
  2097. }
  2098. }
  2099. }
  2100. void dp_peer_ast_table_detach(struct dp_soc *soc)
  2101. {
  2102. if (soc->ast_table) {
  2103. qdf_mem_free(soc->ast_table);
  2104. soc->ast_table = NULL;
  2105. }
  2106. }
  2107. /*
  2108. * dp_peer_find_map_detach() - cleanup memory for peer_id_to_obj_map
  2109. * @soc: soc handle
  2110. *
  2111. * return: none
  2112. */
  2113. void dp_peer_find_map_detach(struct dp_soc *soc)
  2114. {
  2115. if (soc->peer_id_to_obj_map) {
  2116. qdf_mem_free(soc->peer_id_to_obj_map);
  2117. soc->peer_id_to_obj_map = NULL;
  2118. qdf_spinlock_destroy(&soc->peer_map_lock);
  2119. }
  2120. }
  2121. #ifndef AST_OFFLOAD_ENABLE
  2122. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2123. {
  2124. QDF_STATUS status;
  2125. status = dp_peer_find_map_attach(soc);
  2126. if (!QDF_IS_STATUS_SUCCESS(status))
  2127. return status;
  2128. status = dp_peer_find_hash_attach(soc);
  2129. if (!QDF_IS_STATUS_SUCCESS(status))
  2130. goto map_detach;
  2131. status = dp_peer_ast_table_attach(soc);
  2132. if (!QDF_IS_STATUS_SUCCESS(status))
  2133. goto hash_detach;
  2134. status = dp_peer_ast_hash_attach(soc);
  2135. if (!QDF_IS_STATUS_SUCCESS(status))
  2136. goto ast_table_detach;
  2137. status = dp_peer_mec_hash_attach(soc);
  2138. if (QDF_IS_STATUS_SUCCESS(status)) {
  2139. dp_soc_wds_attach(soc);
  2140. return status;
  2141. }
  2142. dp_peer_ast_hash_detach(soc);
  2143. ast_table_detach:
  2144. dp_peer_ast_table_detach(soc);
  2145. hash_detach:
  2146. dp_peer_find_hash_detach(soc);
  2147. map_detach:
  2148. dp_peer_find_map_detach(soc);
  2149. return status;
  2150. }
  2151. #else
  2152. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2153. {
  2154. QDF_STATUS status;
  2155. status = dp_peer_find_map_attach(soc);
  2156. if (!QDF_IS_STATUS_SUCCESS(status))
  2157. return status;
  2158. status = dp_peer_find_hash_attach(soc);
  2159. if (!QDF_IS_STATUS_SUCCESS(status))
  2160. goto map_detach;
  2161. return status;
  2162. map_detach:
  2163. dp_peer_find_map_detach(soc);
  2164. return status;
  2165. }
  2166. #endif
  2167. void dp_rx_tid_stats_cb(struct dp_soc *soc, void *cb_ctxt,
  2168. union hal_reo_status *reo_status)
  2169. {
  2170. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2171. struct hal_reo_queue_status *queue_status = &(reo_status->queue_status);
  2172. if (queue_status->header.status == HAL_REO_CMD_DRAIN)
  2173. return;
  2174. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  2175. DP_PRINT_STATS("REO stats failure %d for TID %d\n",
  2176. queue_status->header.status, rx_tid->tid);
  2177. return;
  2178. }
  2179. DP_PRINT_STATS("REO queue stats (TID: %d):\n"
  2180. "ssn: %d\n"
  2181. "curr_idx : %d\n"
  2182. "pn_31_0 : %08x\n"
  2183. "pn_63_32 : %08x\n"
  2184. "pn_95_64 : %08x\n"
  2185. "pn_127_96 : %08x\n"
  2186. "last_rx_enq_tstamp : %08x\n"
  2187. "last_rx_deq_tstamp : %08x\n"
  2188. "rx_bitmap_31_0 : %08x\n"
  2189. "rx_bitmap_63_32 : %08x\n"
  2190. "rx_bitmap_95_64 : %08x\n"
  2191. "rx_bitmap_127_96 : %08x\n"
  2192. "rx_bitmap_159_128 : %08x\n"
  2193. "rx_bitmap_191_160 : %08x\n"
  2194. "rx_bitmap_223_192 : %08x\n"
  2195. "rx_bitmap_255_224 : %08x\n",
  2196. rx_tid->tid,
  2197. queue_status->ssn, queue_status->curr_idx,
  2198. queue_status->pn_31_0, queue_status->pn_63_32,
  2199. queue_status->pn_95_64, queue_status->pn_127_96,
  2200. queue_status->last_rx_enq_tstamp,
  2201. queue_status->last_rx_deq_tstamp,
  2202. queue_status->rx_bitmap_31_0,
  2203. queue_status->rx_bitmap_63_32,
  2204. queue_status->rx_bitmap_95_64,
  2205. queue_status->rx_bitmap_127_96,
  2206. queue_status->rx_bitmap_159_128,
  2207. queue_status->rx_bitmap_191_160,
  2208. queue_status->rx_bitmap_223_192,
  2209. queue_status->rx_bitmap_255_224);
  2210. DP_PRINT_STATS(
  2211. "curr_mpdu_cnt : %d\n"
  2212. "curr_msdu_cnt : %d\n"
  2213. "fwd_timeout_cnt : %d\n"
  2214. "fwd_bar_cnt : %d\n"
  2215. "dup_cnt : %d\n"
  2216. "frms_in_order_cnt : %d\n"
  2217. "bar_rcvd_cnt : %d\n"
  2218. "mpdu_frms_cnt : %d\n"
  2219. "msdu_frms_cnt : %d\n"
  2220. "total_byte_cnt : %d\n"
  2221. "late_recv_mpdu_cnt : %d\n"
  2222. "win_jump_2k : %d\n"
  2223. "hole_cnt : %d\n",
  2224. queue_status->curr_mpdu_cnt,
  2225. queue_status->curr_msdu_cnt,
  2226. queue_status->fwd_timeout_cnt,
  2227. queue_status->fwd_bar_cnt,
  2228. queue_status->dup_cnt,
  2229. queue_status->frms_in_order_cnt,
  2230. queue_status->bar_rcvd_cnt,
  2231. queue_status->mpdu_frms_cnt,
  2232. queue_status->msdu_frms_cnt,
  2233. queue_status->total_cnt,
  2234. queue_status->late_recv_mpdu_cnt,
  2235. queue_status->win_jump_2k,
  2236. queue_status->hole_cnt);
  2237. DP_PRINT_STATS("Addba Req : %d\n"
  2238. "Addba Resp : %d\n"
  2239. "Addba Resp success : %d\n"
  2240. "Addba Resp failed : %d\n"
  2241. "Delba Req received : %d\n"
  2242. "Delba Tx success : %d\n"
  2243. "Delba Tx Fail : %d\n"
  2244. "BA window size : %d\n"
  2245. "Pn size : %d\n",
  2246. rx_tid->num_of_addba_req,
  2247. rx_tid->num_of_addba_resp,
  2248. rx_tid->num_addba_rsp_success,
  2249. rx_tid->num_addba_rsp_failed,
  2250. rx_tid->num_of_delba_req,
  2251. rx_tid->delba_tx_success_cnt,
  2252. rx_tid->delba_tx_fail_cnt,
  2253. rx_tid->ba_win_size,
  2254. rx_tid->pn_size);
  2255. }
  2256. #ifdef REO_SHARED_QREF_TABLE_EN
  2257. void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2258. struct dp_peer *peer)
  2259. {
  2260. uint8_t tid;
  2261. if (IS_MLO_DP_LINK_PEER(peer))
  2262. return;
  2263. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc)) {
  2264. for (tid = 0; tid < DP_MAX_TIDS; tid++)
  2265. hal_reo_shared_qaddr_write(soc->hal_soc,
  2266. peer->peer_id, tid, 0);
  2267. }
  2268. }
  2269. #endif
  2270. /*
  2271. * dp_peer_find_add_id() - map peer_id with peer
  2272. * @soc: soc handle
  2273. * @peer_mac_addr: peer mac address
  2274. * @peer_id: peer id to be mapped
  2275. * @hw_peer_id: HW ast index
  2276. * @vdev_id: vdev_id
  2277. *
  2278. * return: peer in success
  2279. * NULL in failure
  2280. */
  2281. static inline struct dp_peer *dp_peer_find_add_id(struct dp_soc *soc,
  2282. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  2283. uint8_t vdev_id)
  2284. {
  2285. struct dp_peer *peer;
  2286. QDF_ASSERT(peer_id <= soc->max_peer_id);
  2287. /* check if there's already a peer object with this MAC address */
  2288. peer = dp_peer_find_hash_find(soc, peer_mac_addr,
  2289. 0 /* is aligned */, vdev_id, DP_MOD_ID_CONFIG);
  2290. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  2291. soc, peer, peer_id, vdev_id,
  2292. QDF_MAC_ADDR_REF(peer_mac_addr));
  2293. if (peer) {
  2294. /* peer's ref count was already incremented by
  2295. * peer_find_hash_find
  2296. */
  2297. dp_peer_info("%pK: ref_cnt: %d", soc,
  2298. qdf_atomic_read(&peer->ref_cnt));
  2299. /*
  2300. * if peer is in logical delete CP triggered delete before map
  2301. * is received ignore this event
  2302. */
  2303. if (dp_peer_state_cmp(peer, DP_PEER_STATE_LOGICAL_DELETE)) {
  2304. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2305. dp_alert("Peer %pK["QDF_MAC_ADDR_FMT"] logical delete state vid %d",
  2306. peer, QDF_MAC_ADDR_REF(peer_mac_addr),
  2307. vdev_id);
  2308. return NULL;
  2309. }
  2310. if (peer->peer_id == HTT_INVALID_PEER) {
  2311. if (!IS_MLO_DP_MLD_PEER(peer))
  2312. dp_monitor_peer_tid_peer_id_update(soc, peer,
  2313. peer_id);
  2314. } else {
  2315. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2316. QDF_ASSERT(0);
  2317. return NULL;
  2318. }
  2319. dp_peer_find_id_to_obj_add(soc, peer, peer_id);
  2320. dp_mlo_partner_chips_map(soc, peer, peer_id);
  2321. dp_peer_update_state(soc, peer, DP_PEER_STATE_ACTIVE);
  2322. return peer;
  2323. }
  2324. return NULL;
  2325. }
  2326. #ifdef WLAN_FEATURE_11BE_MLO
  2327. #ifdef DP_USE_REDUCED_PEER_ID_FIELD_WIDTH
  2328. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2329. uint16_t peer_id)
  2330. {
  2331. return ((peer_id & soc->peer_id_mask) | (1 << soc->peer_id_shift));
  2332. }
  2333. #else
  2334. static inline uint16_t dp_gen_ml_peer_id(struct dp_soc *soc,
  2335. uint16_t peer_id)
  2336. {
  2337. return (peer_id | (1 << HTT_RX_PEER_META_DATA_V1_ML_PEER_VALID_S));
  2338. }
  2339. #endif
  2340. QDF_STATUS
  2341. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2342. uint8_t *peer_mac_addr,
  2343. struct dp_mlo_flow_override_info *mlo_flow_info,
  2344. struct dp_mlo_link_info *mlo_link_info)
  2345. {
  2346. struct dp_peer *peer = NULL;
  2347. uint16_t hw_peer_id = mlo_flow_info[0].ast_idx;
  2348. uint16_t ast_hash = mlo_flow_info[0].cache_set_num;
  2349. uint8_t vdev_id = 0;
  2350. uint8_t is_wds = 0;
  2351. int i;
  2352. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2353. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2354. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2355. struct dp_soc *primary_soc;
  2356. dp_info("mlo_peer_map_event (soc:%pK): peer_id %d ml_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT,
  2357. soc, peer_id, ml_peer_id,
  2358. QDF_MAC_ADDR_REF(peer_mac_addr));
  2359. /* Get corresponding vdev ID for the peer based
  2360. * on chip ID obtained from mlo peer_map event
  2361. */
  2362. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  2363. if (mlo_link_info[i].peer_chip_id == dp_mlo_get_chip_id(soc)) {
  2364. vdev_id = mlo_link_info[i].vdev_id;
  2365. break;
  2366. }
  2367. }
  2368. peer = dp_peer_find_add_id(soc, peer_mac_addr, ml_peer_id,
  2369. hw_peer_id, vdev_id);
  2370. if (peer) {
  2371. if (wlan_op_mode_sta == peer->vdev->opmode &&
  2372. qdf_mem_cmp(peer->mac_addr.raw,
  2373. peer->vdev->mld_mac_addr.raw,
  2374. QDF_MAC_ADDR_SIZE) != 0) {
  2375. dp_peer_info("%pK: STA vdev bss_peer!!!!", soc);
  2376. peer->bss_peer = 1;
  2377. if (peer->txrx_peer)
  2378. peer->txrx_peer->bss_peer = 1;
  2379. }
  2380. if (peer->vdev->opmode == wlan_op_mode_sta) {
  2381. peer->vdev->bss_ast_hash = ast_hash;
  2382. peer->vdev->bss_ast_idx = hw_peer_id;
  2383. }
  2384. /* Add ast entry incase self ast entry is
  2385. * deleted due to DP CP sync issue
  2386. *
  2387. * self_ast_entry is modified in peer create
  2388. * and peer unmap path which cannot run in
  2389. * parllel with peer map, no lock need before
  2390. * referring it
  2391. */
  2392. if (!peer->self_ast_entry) {
  2393. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2394. QDF_MAC_ADDR_REF(peer_mac_addr));
  2395. dp_peer_add_ast(soc, peer,
  2396. peer_mac_addr,
  2397. type, 0);
  2398. }
  2399. /* If peer setup and hence rx_tid setup got called
  2400. * before htt peer map then Qref write to LUT did not
  2401. * happen in rx_tid setup as peer_id was invalid.
  2402. * So defer Qref write to peer map handler. Check if
  2403. * rx_tid qdesc for tid 0 is already setup and perform
  2404. * qref write to LUT for Tid 0 and 16.
  2405. *
  2406. * Peer map could be obtained on assoc link, hence
  2407. * change to primary link's soc.
  2408. */
  2409. primary_soc = peer->vdev->pdev->soc;
  2410. if (hal_reo_shared_qaddr_is_enable(primary_soc->hal_soc) &&
  2411. peer->rx_tid[0].hw_qdesc_vaddr_unaligned) {
  2412. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2413. ml_peer_id,
  2414. 0,
  2415. peer->rx_tid[0].hw_qdesc_paddr);
  2416. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2417. ml_peer_id,
  2418. DP_NON_QOS_TID,
  2419. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2420. }
  2421. }
  2422. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2423. vdev_id, ast_hash, is_wds);
  2424. return err;
  2425. }
  2426. #endif
  2427. /**
  2428. * dp_rx_peer_map_handler() - handle peer map event from firmware
  2429. * @soc_handle - genereic soc handle
  2430. * @peeri_id - peer_id from firmware
  2431. * @hw_peer_id - ast index for this peer
  2432. * @vdev_id - vdev ID
  2433. * @peer_mac_addr - mac address of the peer
  2434. * @ast_hash - ast hash value
  2435. * @is_wds - flag to indicate peer map event for WDS ast entry
  2436. *
  2437. * associate the peer_id that firmware provided with peer entry
  2438. * and update the ast table in the host with the hw_peer_id.
  2439. *
  2440. * Return: QDF_STATUS code
  2441. */
  2442. QDF_STATUS
  2443. dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2444. uint16_t hw_peer_id, uint8_t vdev_id,
  2445. uint8_t *peer_mac_addr, uint16_t ast_hash,
  2446. uint8_t is_wds)
  2447. {
  2448. struct dp_peer *peer = NULL;
  2449. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2450. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2451. dp_info("peer_map_event (soc:%pK): peer_id %d, hw_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT", vdev_id %d",
  2452. soc, peer_id, hw_peer_id,
  2453. QDF_MAC_ADDR_REF(peer_mac_addr), vdev_id);
  2454. /* Peer map event for WDS ast entry get the peer from
  2455. * obj map
  2456. */
  2457. if (is_wds) {
  2458. if (!soc->ast_offload_support) {
  2459. peer = dp_peer_get_ref_by_id(soc, peer_id,
  2460. DP_MOD_ID_HTT);
  2461. err = dp_peer_map_ast(soc, peer, peer_mac_addr,
  2462. hw_peer_id,
  2463. vdev_id, ast_hash, is_wds);
  2464. if (peer)
  2465. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2466. }
  2467. } else {
  2468. /*
  2469. * It's the responsibility of the CP and FW to ensure
  2470. * that peer is created successfully. Ideally DP should
  2471. * not hit the below condition for directly assocaited
  2472. * peers.
  2473. */
  2474. if ((!soc->ast_offload_support) && ((hw_peer_id < 0) ||
  2475. (hw_peer_id >=
  2476. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)))) {
  2477. dp_peer_err("%pK: invalid hw_peer_id: %d", soc, hw_peer_id);
  2478. qdf_assert_always(0);
  2479. }
  2480. peer = dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  2481. hw_peer_id, vdev_id);
  2482. if (peer) {
  2483. if (wlan_op_mode_sta == peer->vdev->opmode &&
  2484. qdf_mem_cmp(peer->mac_addr.raw,
  2485. peer->vdev->mac_addr.raw,
  2486. QDF_MAC_ADDR_SIZE) != 0) {
  2487. dp_peer_info("%pK: STA vdev bss_peer!!!!", soc);
  2488. peer->bss_peer = 1;
  2489. if (peer->txrx_peer)
  2490. peer->txrx_peer->bss_peer = 1;
  2491. }
  2492. if (peer->vdev->opmode == wlan_op_mode_sta) {
  2493. peer->vdev->bss_ast_hash = ast_hash;
  2494. peer->vdev->bss_ast_idx = hw_peer_id;
  2495. }
  2496. /* Add ast entry incase self ast entry is
  2497. * deleted due to DP CP sync issue
  2498. *
  2499. * self_ast_entry is modified in peer create
  2500. * and peer unmap path which cannot run in
  2501. * parllel with peer map, no lock need before
  2502. * referring it
  2503. */
  2504. if (!soc->ast_offload_support &&
  2505. !peer->self_ast_entry) {
  2506. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2507. QDF_MAC_ADDR_REF(peer_mac_addr));
  2508. dp_peer_add_ast(soc, peer,
  2509. peer_mac_addr,
  2510. type, 0);
  2511. }
  2512. /* If peer setup and hence rx_tid setup got called
  2513. * before htt peer map then Qref write to LUT did
  2514. * not happen in rx_tid setup as peer_id was invalid.
  2515. * So defer Qref write to peer map handler. Check if
  2516. * rx_tid qdesc for tid 0 is already setup perform qref
  2517. * write to LUT for Tid 0 and 16.
  2518. */
  2519. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc) &&
  2520. peer->rx_tid[0].hw_qdesc_vaddr_unaligned &&
  2521. !IS_MLO_DP_LINK_PEER(peer)) {
  2522. hal_reo_shared_qaddr_write(soc->hal_soc,
  2523. peer_id,
  2524. 0,
  2525. peer->rx_tid[0].hw_qdesc_paddr);
  2526. hal_reo_shared_qaddr_write(soc->hal_soc,
  2527. peer_id,
  2528. DP_NON_QOS_TID,
  2529. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2530. }
  2531. }
  2532. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2533. vdev_id, ast_hash, is_wds);
  2534. }
  2535. return err;
  2536. }
  2537. /**
  2538. * dp_rx_peer_unmap_handler() - handle peer unmap event from firmware
  2539. * @soc_handle - genereic soc handle
  2540. * @peeri_id - peer_id from firmware
  2541. * @vdev_id - vdev ID
  2542. * @mac_addr - mac address of the peer or wds entry
  2543. * @is_wds - flag to indicate peer map event for WDS ast entry
  2544. * @free_wds_count - number of wds entries freed by FW with peer delete
  2545. *
  2546. * Return: none
  2547. */
  2548. void
  2549. dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  2550. uint8_t vdev_id, uint8_t *mac_addr,
  2551. uint8_t is_wds, uint32_t free_wds_count)
  2552. {
  2553. struct dp_peer *peer;
  2554. struct dp_vdev *vdev = NULL;
  2555. if (soc->ast_offload_support && is_wds)
  2556. return;
  2557. peer = __dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  2558. /*
  2559. * Currently peer IDs are assigned for vdevs as well as peers.
  2560. * If the peer ID is for a vdev, then the peer pointer stored
  2561. * in peer_id_to_obj_map will be NULL.
  2562. */
  2563. if (!peer) {
  2564. dp_err("Received unmap event for invalid peer_id %u",
  2565. peer_id);
  2566. return;
  2567. }
  2568. /* If V2 Peer map messages are enabled AST entry has to be
  2569. * freed here
  2570. */
  2571. if (is_wds) {
  2572. if (!dp_peer_ast_free_entry_by_mac(soc, peer, vdev_id,
  2573. mac_addr)) {
  2574. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2575. return;
  2576. }
  2577. 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",
  2578. peer, peer->peer_id,
  2579. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2580. QDF_MAC_ADDR_REF(mac_addr), vdev_id,
  2581. is_wds);
  2582. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2583. return;
  2584. }
  2585. dp_peer_clean_wds_entries(soc, peer, free_wds_count);
  2586. dp_info("peer_unmap_event (soc:%pK) peer_id %d peer %pK",
  2587. soc, peer_id, peer);
  2588. /* Clear entries in Qref LUT */
  2589. /* TODO: Check if this is to be called from
  2590. * dp_peer_delete for MLO case if there is race between
  2591. * new peer id assignment and still not having received
  2592. * peer unmap for MLD peer with same peer id.
  2593. */
  2594. dp_peer_rx_reo_shared_qaddr_delete(soc, peer);
  2595. dp_peer_find_id_to_obj_remove(soc, peer_id);
  2596. dp_mlo_partner_chips_unmap(soc, peer_id);
  2597. peer->peer_id = HTT_INVALID_PEER;
  2598. /*
  2599. * Reset ast flow mapping table
  2600. */
  2601. if (!soc->ast_offload_support)
  2602. dp_peer_reset_flowq_map(peer);
  2603. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  2604. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  2605. peer_id, vdev_id);
  2606. }
  2607. vdev = peer->vdev;
  2608. dp_update_vdev_stats_on_peer_unmap(vdev, peer);
  2609. dp_peer_update_state(soc, peer, DP_PEER_STATE_INACTIVE);
  2610. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2611. /*
  2612. * Remove a reference to the peer.
  2613. * If there are no more references, delete the peer object.
  2614. */
  2615. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2616. }
  2617. #ifdef WLAN_FEATURE_11BE_MLO
  2618. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id)
  2619. {
  2620. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2621. uint8_t mac_addr[QDF_MAC_ADDR_SIZE] = {0};
  2622. uint8_t vdev_id = DP_VDEV_ALL;
  2623. uint8_t is_wds = 0;
  2624. dp_info("MLO peer_unmap_event (soc:%pK) peer_id %d",
  2625. soc, peer_id);
  2626. dp_rx_peer_unmap_handler(soc, ml_peer_id, vdev_id,
  2627. mac_addr, is_wds,
  2628. DP_PEER_WDS_COUNT_INVALID);
  2629. }
  2630. #endif
  2631. #ifndef AST_OFFLOAD_ENABLE
  2632. void
  2633. dp_peer_find_detach(struct dp_soc *soc)
  2634. {
  2635. dp_soc_wds_detach(soc);
  2636. dp_peer_find_map_detach(soc);
  2637. dp_peer_find_hash_detach(soc);
  2638. dp_peer_ast_hash_detach(soc);
  2639. dp_peer_ast_table_detach(soc);
  2640. dp_peer_mec_hash_detach(soc);
  2641. }
  2642. #else
  2643. void
  2644. dp_peer_find_detach(struct dp_soc *soc)
  2645. {
  2646. dp_peer_find_map_detach(soc);
  2647. dp_peer_find_hash_detach(soc);
  2648. }
  2649. #endif
  2650. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  2651. union hal_reo_status *reo_status)
  2652. {
  2653. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  2654. if ((reo_status->rx_queue_status.header.status !=
  2655. HAL_REO_CMD_SUCCESS) &&
  2656. (reo_status->rx_queue_status.header.status !=
  2657. HAL_REO_CMD_DRAIN)) {
  2658. /* Should not happen normally. Just print error for now */
  2659. dp_peer_err("%pK: Rx tid HW desc update failed(%d): tid %d",
  2660. soc, reo_status->rx_queue_status.header.status,
  2661. rx_tid->tid);
  2662. }
  2663. }
  2664. static bool dp_get_peer_vdev_roaming_in_progress(struct dp_peer *peer)
  2665. {
  2666. struct ol_if_ops *ol_ops = NULL;
  2667. bool is_roaming = false;
  2668. uint8_t vdev_id = -1;
  2669. struct cdp_soc_t *soc;
  2670. if (!peer) {
  2671. dp_peer_info("Peer is NULL. No roaming possible");
  2672. return false;
  2673. }
  2674. soc = dp_soc_to_cdp_soc_t(peer->vdev->pdev->soc);
  2675. ol_ops = peer->vdev->pdev->soc->cdp_soc.ol_ops;
  2676. if (ol_ops && ol_ops->is_roam_inprogress) {
  2677. dp_get_vdevid(soc, peer->mac_addr.raw, &vdev_id);
  2678. is_roaming = ol_ops->is_roam_inprogress(vdev_id);
  2679. }
  2680. dp_peer_info("peer: " QDF_MAC_ADDR_FMT ", vdev_id: %d, is_roaming: %d",
  2681. QDF_MAC_ADDR_REF(peer->mac_addr.raw), vdev_id, is_roaming);
  2682. return is_roaming;
  2683. }
  2684. #ifdef WLAN_FEATURE_11BE_MLO
  2685. /**
  2686. * dp_rx_tid_setup_allow() - check if rx_tid and reo queue desc
  2687. setup is necessary
  2688. * @peer: DP peer handle
  2689. *
  2690. * Return: true - allow, false - disallow
  2691. */
  2692. static inline
  2693. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2694. {
  2695. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  2696. return false;
  2697. return true;
  2698. }
  2699. /**
  2700. * dp_rx_tid_update_allow() - check if rx_tid update needed
  2701. * @peer: DP peer handle
  2702. *
  2703. * Return: true - allow, false - disallow
  2704. */
  2705. static inline
  2706. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2707. {
  2708. /* not as expected for MLO connection link peer */
  2709. if (IS_MLO_DP_LINK_PEER(peer)) {
  2710. QDF_BUG(0);
  2711. return false;
  2712. }
  2713. return true;
  2714. }
  2715. #else
  2716. static inline
  2717. bool dp_rx_tid_setup_allow(struct dp_peer *peer)
  2718. {
  2719. return true;
  2720. }
  2721. static inline
  2722. bool dp_rx_tid_update_allow(struct dp_peer *peer)
  2723. {
  2724. return true;
  2725. }
  2726. #endif
  2727. QDF_STATUS dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  2728. ba_window_size, uint32_t start_seq,
  2729. bool bar_update)
  2730. {
  2731. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  2732. struct dp_soc *soc = peer->vdev->pdev->soc;
  2733. struct hal_reo_cmd_params params;
  2734. if (!dp_rx_tid_update_allow(peer)) {
  2735. dp_peer_err("skip tid update for peer:" QDF_MAC_ADDR_FMT,
  2736. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2737. return QDF_STATUS_E_FAILURE;
  2738. }
  2739. qdf_mem_zero(&params, sizeof(params));
  2740. params.std.need_status = 1;
  2741. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  2742. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2743. params.u.upd_queue_params.update_ba_window_size = 1;
  2744. params.u.upd_queue_params.ba_window_size = ba_window_size;
  2745. if (start_seq < IEEE80211_SEQ_MAX) {
  2746. params.u.upd_queue_params.update_ssn = 1;
  2747. params.u.upd_queue_params.ssn = start_seq;
  2748. } else {
  2749. dp_set_ssn_valid_flag(&params, 0);
  2750. }
  2751. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  2752. dp_rx_tid_update_cb, rx_tid)) {
  2753. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  2754. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  2755. }
  2756. rx_tid->ba_win_size = ba_window_size;
  2757. if (dp_get_peer_vdev_roaming_in_progress(peer))
  2758. return QDF_STATUS_E_PERM;
  2759. if (!bar_update)
  2760. dp_peer_rx_reorder_queue_setup(soc, peer,
  2761. tid, ba_window_size);
  2762. return QDF_STATUS_SUCCESS;
  2763. }
  2764. #ifdef WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY
  2765. /*
  2766. * dp_reo_desc_defer_free_enqueue() - enqueue REO QDESC to be freed into
  2767. * the deferred list
  2768. * @soc: Datapath soc handle
  2769. * @free_desc: REO DESC reference that needs to be freed
  2770. *
  2771. * Return: true if enqueued, else false
  2772. */
  2773. static bool dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  2774. struct reo_desc_list_node *freedesc)
  2775. {
  2776. struct reo_desc_deferred_freelist_node *desc;
  2777. if (!qdf_atomic_read(&soc->cmn_init_done))
  2778. return false;
  2779. desc = qdf_mem_malloc(sizeof(*desc));
  2780. if (!desc)
  2781. return false;
  2782. desc->hw_qdesc_paddr = freedesc->rx_tid.hw_qdesc_paddr;
  2783. desc->hw_qdesc_alloc_size = freedesc->rx_tid.hw_qdesc_alloc_size;
  2784. desc->hw_qdesc_vaddr_unaligned =
  2785. freedesc->rx_tid.hw_qdesc_vaddr_unaligned;
  2786. desc->free_ts = qdf_get_system_timestamp();
  2787. DP_RX_REO_QDESC_DEFERRED_GET_MAC(desc, freedesc);
  2788. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  2789. if (!soc->reo_desc_deferred_freelist_init) {
  2790. qdf_mem_free(desc);
  2791. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2792. return false;
  2793. }
  2794. qdf_list_insert_back(&soc->reo_desc_deferred_freelist,
  2795. (qdf_list_node_t *)desc);
  2796. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2797. return true;
  2798. }
  2799. /*
  2800. * dp_reo_desc_defer_free() - free the REO QDESC in the deferred list
  2801. * based on time threshold
  2802. * @soc: Datapath soc handle
  2803. * @free_desc: REO DESC reference that needs to be freed
  2804. *
  2805. * Return: true if enqueued, else false
  2806. */
  2807. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  2808. {
  2809. struct reo_desc_deferred_freelist_node *desc;
  2810. unsigned long curr_ts = qdf_get_system_timestamp();
  2811. qdf_spin_lock_bh(&soc->reo_desc_deferred_freelist_lock);
  2812. while ((qdf_list_peek_front(&soc->reo_desc_deferred_freelist,
  2813. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  2814. (curr_ts > (desc->free_ts + REO_DESC_DEFERRED_FREE_MS))) {
  2815. qdf_list_remove_front(&soc->reo_desc_deferred_freelist,
  2816. (qdf_list_node_t **)&desc);
  2817. DP_RX_REO_QDESC_DEFERRED_FREE_EVT(desc);
  2818. qdf_mem_unmap_nbytes_single(soc->osdev,
  2819. desc->hw_qdesc_paddr,
  2820. QDF_DMA_BIDIRECTIONAL,
  2821. desc->hw_qdesc_alloc_size);
  2822. qdf_mem_free(desc->hw_qdesc_vaddr_unaligned);
  2823. qdf_mem_free(desc);
  2824. curr_ts = qdf_get_system_timestamp();
  2825. }
  2826. qdf_spin_unlock_bh(&soc->reo_desc_deferred_freelist_lock);
  2827. }
  2828. #else
  2829. static inline bool
  2830. dp_reo_desc_defer_free_enqueue(struct dp_soc *soc,
  2831. struct reo_desc_list_node *freedesc)
  2832. {
  2833. return false;
  2834. }
  2835. static void dp_reo_desc_defer_free(struct dp_soc *soc)
  2836. {
  2837. }
  2838. #endif /* !WLAN_DP_FEATURE_DEFERRED_REO_QDESC_DESTROY */
  2839. /*
  2840. * dp_reo_desc_free() - Callback free reo descriptor memory after
  2841. * HW cache flush
  2842. *
  2843. * @soc: DP SOC handle
  2844. * @cb_ctxt: Callback context
  2845. * @reo_status: REO command status
  2846. */
  2847. static void dp_reo_desc_free(struct dp_soc *soc, void *cb_ctxt,
  2848. union hal_reo_status *reo_status)
  2849. {
  2850. struct reo_desc_list_node *freedesc =
  2851. (struct reo_desc_list_node *)cb_ctxt;
  2852. struct dp_rx_tid *rx_tid = &freedesc->rx_tid;
  2853. unsigned long curr_ts = qdf_get_system_timestamp();
  2854. if ((reo_status->fl_cache_status.header.status !=
  2855. HAL_REO_CMD_SUCCESS) &&
  2856. (reo_status->fl_cache_status.header.status !=
  2857. HAL_REO_CMD_DRAIN)) {
  2858. dp_peer_err("%pK: Rx tid HW desc flush failed(%d): tid %d",
  2859. soc, reo_status->rx_queue_status.header.status,
  2860. freedesc->rx_tid.tid);
  2861. }
  2862. dp_peer_info("%pK: %lu hw_qdesc_paddr: %pK, tid:%d", soc,
  2863. curr_ts, (void *)(rx_tid->hw_qdesc_paddr),
  2864. rx_tid->tid);
  2865. /* REO desc is enqueued to be freed at a later point
  2866. * in time, just free the freedesc alone and return
  2867. */
  2868. if (dp_reo_desc_defer_free_enqueue(soc, freedesc))
  2869. goto out;
  2870. DP_RX_REO_QDESC_FREE_EVT(freedesc);
  2871. qdf_mem_unmap_nbytes_single(soc->osdev,
  2872. rx_tid->hw_qdesc_paddr,
  2873. QDF_DMA_BIDIRECTIONAL,
  2874. rx_tid->hw_qdesc_alloc_size);
  2875. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  2876. out:
  2877. qdf_mem_free(freedesc);
  2878. }
  2879. #if defined(CONFIG_WIFI_EMULATION_WIFI_3_0) && defined(BUILD_X86)
  2880. /* Hawkeye emulation requires bus address to be >= 0x50000000 */
  2881. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  2882. {
  2883. if (dma_addr < 0x50000000)
  2884. return QDF_STATUS_E_FAILURE;
  2885. else
  2886. return QDF_STATUS_SUCCESS;
  2887. }
  2888. #else
  2889. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  2890. {
  2891. return QDF_STATUS_SUCCESS;
  2892. }
  2893. #endif
  2894. /*
  2895. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  2896. * @peer: Datapath peer handle
  2897. * @tid: TID
  2898. * @ba_window_size: BlockAck window size
  2899. * @start_seq: Starting sequence number
  2900. *
  2901. * Return: QDF_STATUS code
  2902. */
  2903. QDF_STATUS dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  2904. uint32_t ba_window_size, uint32_t start_seq)
  2905. {
  2906. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  2907. struct dp_vdev *vdev = peer->vdev;
  2908. struct dp_soc *soc = vdev->pdev->soc;
  2909. uint32_t hw_qdesc_size;
  2910. uint32_t hw_qdesc_align;
  2911. int hal_pn_type;
  2912. void *hw_qdesc_vaddr;
  2913. uint32_t alloc_tries = 0;
  2914. QDF_STATUS status = QDF_STATUS_SUCCESS;
  2915. struct dp_txrx_peer *txrx_peer;
  2916. if (!qdf_atomic_read(&peer->is_default_route_set))
  2917. return QDF_STATUS_E_FAILURE;
  2918. if (!dp_rx_tid_setup_allow(peer)) {
  2919. dp_peer_info("skip rx tid setup for peer" QDF_MAC_ADDR_FMT,
  2920. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2921. goto send_wmi_reo_cmd;
  2922. }
  2923. rx_tid->ba_win_size = ba_window_size;
  2924. if (rx_tid->hw_qdesc_vaddr_unaligned)
  2925. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  2926. start_seq, false);
  2927. rx_tid->delba_tx_status = 0;
  2928. rx_tid->ppdu_id_2k = 0;
  2929. rx_tid->num_of_addba_req = 0;
  2930. rx_tid->num_of_delba_req = 0;
  2931. rx_tid->num_of_addba_resp = 0;
  2932. rx_tid->num_addba_rsp_failed = 0;
  2933. rx_tid->num_addba_rsp_success = 0;
  2934. rx_tid->delba_tx_success_cnt = 0;
  2935. rx_tid->delba_tx_fail_cnt = 0;
  2936. rx_tid->statuscode = 0;
  2937. /* TODO: Allocating HW queue descriptors based on max BA window size
  2938. * for all QOS TIDs so that same descriptor can be used later when
  2939. * ADDBA request is recevied. This should be changed to allocate HW
  2940. * queue descriptors based on BA window size being negotiated (0 for
  2941. * non BA cases), and reallocate when BA window size changes and also
  2942. * send WMI message to FW to change the REO queue descriptor in Rx
  2943. * peer entry as part of dp_rx_tid_update.
  2944. */
  2945. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  2946. ba_window_size, tid);
  2947. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  2948. /* To avoid unnecessary extra allocation for alignment, try allocating
  2949. * exact size and see if we already have aligned address.
  2950. */
  2951. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  2952. try_desc_alloc:
  2953. rx_tid->hw_qdesc_vaddr_unaligned =
  2954. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size);
  2955. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  2956. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  2957. soc, tid);
  2958. return QDF_STATUS_E_NOMEM;
  2959. }
  2960. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  2961. hw_qdesc_align) {
  2962. /* Address allocated above is not alinged. Allocate extra
  2963. * memory for alignment
  2964. */
  2965. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  2966. rx_tid->hw_qdesc_vaddr_unaligned =
  2967. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size +
  2968. hw_qdesc_align - 1);
  2969. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  2970. dp_peer_err("%pK: Rx tid HW desc alloc failed: tid %d",
  2971. soc, tid);
  2972. return QDF_STATUS_E_NOMEM;
  2973. }
  2974. hw_qdesc_vaddr = (void *)qdf_align((unsigned long)
  2975. rx_tid->hw_qdesc_vaddr_unaligned,
  2976. hw_qdesc_align);
  2977. dp_peer_debug("%pK: Total Size %d Aligned Addr %pK",
  2978. soc, rx_tid->hw_qdesc_alloc_size,
  2979. hw_qdesc_vaddr);
  2980. } else {
  2981. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  2982. }
  2983. rx_tid->hw_qdesc_vaddr_aligned = hw_qdesc_vaddr;
  2984. txrx_peer = dp_get_txrx_peer(peer);
  2985. /* TODO: Ensure that sec_type is set before ADDBA is received.
  2986. * Currently this is set based on htt indication
  2987. * HTT_T2H_MSG_TYPE_SEC_IND from target
  2988. */
  2989. switch (txrx_peer->security[dp_sec_ucast].sec_type) {
  2990. case cdp_sec_type_tkip_nomic:
  2991. case cdp_sec_type_aes_ccmp:
  2992. case cdp_sec_type_aes_ccmp_256:
  2993. case cdp_sec_type_aes_gcmp:
  2994. case cdp_sec_type_aes_gcmp_256:
  2995. hal_pn_type = HAL_PN_WPA;
  2996. break;
  2997. case cdp_sec_type_wapi:
  2998. if (vdev->opmode == wlan_op_mode_ap)
  2999. hal_pn_type = HAL_PN_WAPI_EVEN;
  3000. else
  3001. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  3002. break;
  3003. default:
  3004. hal_pn_type = HAL_PN_NONE;
  3005. break;
  3006. }
  3007. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  3008. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type,
  3009. vdev->vdev_stats_id);
  3010. qdf_mem_map_nbytes_single(soc->osdev, hw_qdesc_vaddr,
  3011. QDF_DMA_BIDIRECTIONAL, rx_tid->hw_qdesc_alloc_size,
  3012. &(rx_tid->hw_qdesc_paddr));
  3013. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) !=
  3014. QDF_STATUS_SUCCESS) {
  3015. if (alloc_tries++ < 10) {
  3016. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3017. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3018. goto try_desc_alloc;
  3019. } else {
  3020. dp_peer_err("%pK: Rx tid HW desc alloc failed (lowmem): tid %d",
  3021. soc, tid);
  3022. status = QDF_STATUS_E_NOMEM;
  3023. goto error;
  3024. }
  3025. }
  3026. send_wmi_reo_cmd:
  3027. if (dp_get_peer_vdev_roaming_in_progress(peer)) {
  3028. status = QDF_STATUS_E_PERM;
  3029. goto error;
  3030. }
  3031. status = dp_peer_rx_reorder_queue_setup(soc, peer,
  3032. tid, ba_window_size);
  3033. if (QDF_IS_STATUS_SUCCESS(status))
  3034. return status;
  3035. error:
  3036. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  3037. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) ==
  3038. QDF_STATUS_SUCCESS)
  3039. qdf_mem_unmap_nbytes_single(
  3040. soc->osdev,
  3041. rx_tid->hw_qdesc_paddr,
  3042. QDF_DMA_BIDIRECTIONAL,
  3043. rx_tid->hw_qdesc_alloc_size);
  3044. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  3045. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3046. rx_tid->hw_qdesc_paddr = 0;
  3047. }
  3048. return status;
  3049. }
  3050. #ifdef REO_DESC_DEFER_FREE
  3051. /*
  3052. * dp_reo_desc_clean_up() - If cmd to flush base desc fails add
  3053. * desc back to freelist and defer the deletion
  3054. *
  3055. * @soc: DP SOC handle
  3056. * @desc: Base descriptor to be freed
  3057. * @reo_status: REO command status
  3058. */
  3059. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3060. struct reo_desc_list_node *desc,
  3061. union hal_reo_status *reo_status)
  3062. {
  3063. desc->free_ts = qdf_get_system_timestamp();
  3064. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3065. qdf_list_insert_back(&soc->reo_desc_freelist,
  3066. (qdf_list_node_t *)desc);
  3067. }
  3068. /*
  3069. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3070. * ring in aviod of REO hang
  3071. *
  3072. * @list_size: REO desc list size to be cleaned
  3073. */
  3074. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3075. {
  3076. unsigned long curr_ts = qdf_get_system_timestamp();
  3077. if ((*list_size) > REO_DESC_FREELIST_SIZE) {
  3078. dp_err_log("%lu:freedesc number %d in freelist",
  3079. curr_ts, *list_size);
  3080. /* limit the batch queue size */
  3081. *list_size = REO_DESC_FREELIST_SIZE;
  3082. }
  3083. }
  3084. #else
  3085. /*
  3086. * dp_reo_desc_clean_up() - If send cmd to REO inorder to flush
  3087. * cache fails free the base REO desc anyway
  3088. *
  3089. * @soc: DP SOC handle
  3090. * @desc: Base descriptor to be freed
  3091. * @reo_status: REO command status
  3092. */
  3093. static void dp_reo_desc_clean_up(struct dp_soc *soc,
  3094. struct reo_desc_list_node *desc,
  3095. union hal_reo_status *reo_status)
  3096. {
  3097. if (reo_status) {
  3098. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3099. reo_status->fl_cache_status.header.status = 0;
  3100. dp_reo_desc_free(soc, (void *)desc, reo_status);
  3101. }
  3102. }
  3103. /*
  3104. * dp_reo_limit_clean_batch_sz() - Limit number REO CMD queued to cmd
  3105. * ring in aviod of REO hang
  3106. *
  3107. * @list_size: REO desc list size to be cleaned
  3108. */
  3109. static inline void dp_reo_limit_clean_batch_sz(uint32_t *list_size)
  3110. {
  3111. }
  3112. #endif
  3113. /*
  3114. * dp_resend_update_reo_cmd() - Resend the UPDATE_REO_QUEUE
  3115. * cmd and re-insert desc into free list if send fails.
  3116. *
  3117. * @soc: DP SOC handle
  3118. * @desc: desc with resend update cmd flag set
  3119. * @rx_tid: Desc RX tid associated with update cmd for resetting
  3120. * valid field to 0 in h/w
  3121. *
  3122. * Return: QDF status
  3123. */
  3124. static QDF_STATUS
  3125. dp_resend_update_reo_cmd(struct dp_soc *soc,
  3126. struct reo_desc_list_node *desc,
  3127. struct dp_rx_tid *rx_tid)
  3128. {
  3129. struct hal_reo_cmd_params params;
  3130. qdf_mem_zero(&params, sizeof(params));
  3131. params.std.need_status = 1;
  3132. params.std.addr_lo =
  3133. rx_tid->hw_qdesc_paddr & 0xffffffff;
  3134. params.std.addr_hi =
  3135. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3136. params.u.upd_queue_params.update_vld = 1;
  3137. params.u.upd_queue_params.vld = 0;
  3138. desc->resend_update_reo_cmd = false;
  3139. /*
  3140. * If the cmd send fails then set resend_update_reo_cmd flag
  3141. * and insert the desc at the end of the free list to retry.
  3142. */
  3143. if (dp_reo_send_cmd(soc,
  3144. CMD_UPDATE_RX_REO_QUEUE,
  3145. &params,
  3146. dp_rx_tid_delete_cb,
  3147. (void *)desc)
  3148. != QDF_STATUS_SUCCESS) {
  3149. desc->resend_update_reo_cmd = true;
  3150. desc->free_ts = qdf_get_system_timestamp();
  3151. qdf_list_insert_back(&soc->reo_desc_freelist,
  3152. (qdf_list_node_t *)desc);
  3153. dp_err_log("failed to send reo cmd CMD_UPDATE_RX_REO_QUEUE");
  3154. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3155. return QDF_STATUS_E_FAILURE;
  3156. }
  3157. return QDF_STATUS_SUCCESS;
  3158. }
  3159. /*
  3160. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  3161. * after deleting the entries (ie., setting valid=0)
  3162. *
  3163. * @soc: DP SOC handle
  3164. * @cb_ctxt: Callback context
  3165. * @reo_status: REO command status
  3166. */
  3167. void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  3168. union hal_reo_status *reo_status)
  3169. {
  3170. struct reo_desc_list_node *freedesc =
  3171. (struct reo_desc_list_node *)cb_ctxt;
  3172. uint32_t list_size;
  3173. struct reo_desc_list_node *desc;
  3174. unsigned long curr_ts = qdf_get_system_timestamp();
  3175. uint32_t desc_size, tot_desc_size;
  3176. struct hal_reo_cmd_params params;
  3177. bool flush_failure = false;
  3178. DP_RX_REO_QDESC_UPDATE_EVT(freedesc);
  3179. if (reo_status->rx_queue_status.header.status == HAL_REO_CMD_DRAIN) {
  3180. qdf_mem_zero(reo_status, sizeof(*reo_status));
  3181. reo_status->fl_cache_status.header.status = HAL_REO_CMD_DRAIN;
  3182. dp_reo_desc_free(soc, (void *)freedesc, reo_status);
  3183. DP_STATS_INC(soc, rx.err.reo_cmd_send_drain, 1);
  3184. return;
  3185. } else if (reo_status->rx_queue_status.header.status !=
  3186. HAL_REO_CMD_SUCCESS) {
  3187. /* Should not happen normally. Just print error for now */
  3188. dp_info_rl("Rx tid HW desc deletion failed(%d): tid %d",
  3189. reo_status->rx_queue_status.header.status,
  3190. freedesc->rx_tid.tid);
  3191. }
  3192. dp_peer_info("%pK: rx_tid: %d status: %d",
  3193. soc, freedesc->rx_tid.tid,
  3194. reo_status->rx_queue_status.header.status);
  3195. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3196. freedesc->free_ts = curr_ts;
  3197. qdf_list_insert_back_size(&soc->reo_desc_freelist,
  3198. (qdf_list_node_t *)freedesc, &list_size);
  3199. /* MCL path add the desc back to reo_desc_freelist when REO FLUSH
  3200. * failed. it may cause the number of REO queue pending in free
  3201. * list is even larger than REO_CMD_RING max size and lead REO CMD
  3202. * flood then cause REO HW in an unexpected condition. So it's
  3203. * needed to limit the number REO cmds in a batch operation.
  3204. */
  3205. dp_reo_limit_clean_batch_sz(&list_size);
  3206. while ((qdf_list_peek_front(&soc->reo_desc_freelist,
  3207. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  3208. ((list_size >= REO_DESC_FREELIST_SIZE) ||
  3209. (curr_ts > (desc->free_ts + REO_DESC_FREE_DEFER_MS)) ||
  3210. (desc->resend_update_reo_cmd && list_size))) {
  3211. struct dp_rx_tid *rx_tid;
  3212. qdf_list_remove_front(&soc->reo_desc_freelist,
  3213. (qdf_list_node_t **)&desc);
  3214. list_size--;
  3215. rx_tid = &desc->rx_tid;
  3216. /* First process descs with resend_update_reo_cmd set */
  3217. if (desc->resend_update_reo_cmd) {
  3218. if (dp_resend_update_reo_cmd(soc, desc, rx_tid) !=
  3219. QDF_STATUS_SUCCESS)
  3220. break;
  3221. else
  3222. continue;
  3223. }
  3224. /* Flush and invalidate REO descriptor from HW cache: Base and
  3225. * extension descriptors should be flushed separately */
  3226. if (desc->pending_ext_desc_size)
  3227. tot_desc_size = desc->pending_ext_desc_size;
  3228. else
  3229. tot_desc_size = rx_tid->hw_qdesc_alloc_size;
  3230. /* Get base descriptor size by passing non-qos TID */
  3231. desc_size = hal_get_reo_qdesc_size(soc->hal_soc, 0,
  3232. DP_NON_QOS_TID);
  3233. /* Flush reo extension descriptors */
  3234. while ((tot_desc_size -= desc_size) > 0) {
  3235. qdf_mem_zero(&params, sizeof(params));
  3236. params.std.addr_lo =
  3237. ((uint64_t)(rx_tid->hw_qdesc_paddr) +
  3238. tot_desc_size) & 0xffffffff;
  3239. params.std.addr_hi =
  3240. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3241. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3242. CMD_FLUSH_CACHE,
  3243. &params,
  3244. NULL,
  3245. NULL)) {
  3246. dp_info_rl("fail to send CMD_CACHE_FLUSH:"
  3247. "tid %d desc %pK", rx_tid->tid,
  3248. (void *)(rx_tid->hw_qdesc_paddr));
  3249. desc->pending_ext_desc_size = tot_desc_size +
  3250. desc_size;
  3251. dp_reo_desc_clean_up(soc, desc, reo_status);
  3252. flush_failure = true;
  3253. break;
  3254. }
  3255. }
  3256. if (flush_failure)
  3257. break;
  3258. else
  3259. desc->pending_ext_desc_size = desc_size;
  3260. /* Flush base descriptor */
  3261. qdf_mem_zero(&params, sizeof(params));
  3262. params.std.need_status = 1;
  3263. params.std.addr_lo =
  3264. (uint64_t)(rx_tid->hw_qdesc_paddr) & 0xffffffff;
  3265. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3266. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  3267. CMD_FLUSH_CACHE,
  3268. &params,
  3269. dp_reo_desc_free,
  3270. (void *)desc)) {
  3271. union hal_reo_status reo_status;
  3272. /*
  3273. * If dp_reo_send_cmd return failure, related TID queue desc
  3274. * should be unmapped. Also locally reo_desc, together with
  3275. * TID queue desc also need to be freed accordingly.
  3276. *
  3277. * Here invoke desc_free function directly to do clean up.
  3278. *
  3279. * In case of MCL path add the desc back to the free
  3280. * desc list and defer deletion.
  3281. */
  3282. dp_info_rl("fail to send REO cmd to flush cache: tid %d",
  3283. rx_tid->tid);
  3284. dp_reo_desc_clean_up(soc, desc, &reo_status);
  3285. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3286. break;
  3287. }
  3288. }
  3289. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3290. dp_reo_desc_defer_free(soc);
  3291. }
  3292. /*
  3293. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  3294. * @peer: Datapath peer handle
  3295. * @tid: TID
  3296. *
  3297. * Return: 0 on success, error code on failure
  3298. */
  3299. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  3300. {
  3301. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  3302. struct dp_soc *soc = peer->vdev->pdev->soc;
  3303. struct hal_reo_cmd_params params;
  3304. struct reo_desc_list_node *freedesc =
  3305. qdf_mem_malloc(sizeof(*freedesc));
  3306. if (!freedesc) {
  3307. dp_peer_err("%pK: malloc failed for freedesc: tid %d",
  3308. soc, tid);
  3309. return -ENOMEM;
  3310. }
  3311. freedesc->rx_tid = *rx_tid;
  3312. freedesc->resend_update_reo_cmd = false;
  3313. qdf_mem_zero(&params, sizeof(params));
  3314. DP_RX_REO_QDESC_GET_MAC(freedesc, peer);
  3315. params.std.need_status = 1;
  3316. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  3317. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  3318. params.u.upd_queue_params.update_vld = 1;
  3319. params.u.upd_queue_params.vld = 0;
  3320. if (dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  3321. dp_rx_tid_delete_cb, (void *)freedesc)
  3322. != QDF_STATUS_SUCCESS) {
  3323. /* Defer the clean up to the call back context */
  3324. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  3325. freedesc->free_ts = qdf_get_system_timestamp();
  3326. freedesc->resend_update_reo_cmd = true;
  3327. qdf_list_insert_front(&soc->reo_desc_freelist,
  3328. (qdf_list_node_t *)freedesc);
  3329. DP_STATS_INC(soc, rx.err.reo_cmd_send_fail, 1);
  3330. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  3331. dp_info("Failed to send CMD_UPDATE_RX_REO_QUEUE");
  3332. }
  3333. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  3334. rx_tid->hw_qdesc_alloc_size = 0;
  3335. rx_tid->hw_qdesc_paddr = 0;
  3336. return 0;
  3337. }
  3338. #ifdef DP_LFR
  3339. static void dp_peer_setup_remaining_tids(struct dp_peer *peer)
  3340. {
  3341. int tid;
  3342. for (tid = 1; tid < DP_MAX_TIDS-1; tid++) {
  3343. dp_rx_tid_setup_wifi3(peer, tid, 1, 0);
  3344. dp_peer_debug("Setting up TID %d for peer %pK peer->local_id %d",
  3345. tid, peer, peer->local_id);
  3346. }
  3347. }
  3348. #else
  3349. static void dp_peer_setup_remaining_tids(struct dp_peer *peer) {};
  3350. #endif
  3351. #ifdef WLAN_FEATURE_11BE_MLO
  3352. /**
  3353. * dp_peer_rx_tids_init() - initialize each tids in peer
  3354. * @peer: peer pointer
  3355. *
  3356. * Return: None
  3357. */
  3358. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3359. {
  3360. int tid;
  3361. struct dp_rx_tid *rx_tid;
  3362. struct dp_rx_tid_defrag *rx_tid_defrag;
  3363. if (!IS_MLO_DP_LINK_PEER(peer)) {
  3364. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3365. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3366. rx_tid_defrag->array = &rx_tid_defrag->base;
  3367. rx_tid_defrag->defrag_timeout_ms = 0;
  3368. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3369. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3370. rx_tid_defrag->base.head = NULL;
  3371. rx_tid_defrag->base.tail = NULL;
  3372. rx_tid_defrag->tid = tid;
  3373. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3374. }
  3375. }
  3376. /* if not first assoc link peer,
  3377. * not to initialize rx_tids again.
  3378. */
  3379. if (IS_MLO_DP_LINK_PEER(peer) && !peer->first_link)
  3380. return;
  3381. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3382. rx_tid = &peer->rx_tid[tid];
  3383. rx_tid->tid = tid;
  3384. rx_tid->ba_win_size = 0;
  3385. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3386. }
  3387. }
  3388. #else
  3389. static void dp_peer_rx_tids_init(struct dp_peer *peer)
  3390. {
  3391. int tid;
  3392. struct dp_rx_tid *rx_tid;
  3393. struct dp_rx_tid_defrag *rx_tid_defrag;
  3394. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3395. rx_tid = &peer->rx_tid[tid];
  3396. rx_tid_defrag = &peer->txrx_peer->rx_tid[tid];
  3397. rx_tid->tid = tid;
  3398. rx_tid->ba_win_size = 0;
  3399. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3400. rx_tid_defrag->base.head = NULL;
  3401. rx_tid_defrag->base.tail = NULL;
  3402. rx_tid_defrag->tid = tid;
  3403. rx_tid_defrag->array = &rx_tid_defrag->base;
  3404. rx_tid_defrag->defrag_timeout_ms = 0;
  3405. rx_tid_defrag->defrag_waitlist_elem.tqe_next = NULL;
  3406. rx_tid_defrag->defrag_waitlist_elem.tqe_prev = NULL;
  3407. rx_tid_defrag->defrag_peer = peer->txrx_peer;
  3408. }
  3409. }
  3410. #endif
  3411. /*
  3412. * dp_peer_rx_init() – Initialize receive TID state
  3413. * @pdev: Datapath pdev
  3414. * @peer: Datapath peer
  3415. *
  3416. */
  3417. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  3418. {
  3419. dp_peer_rx_tids_init(peer);
  3420. peer->active_ba_session_cnt = 0;
  3421. peer->hw_buffer_size = 0;
  3422. peer->kill_256_sessions = 0;
  3423. if (hal_reo_shared_qaddr_is_enable(pdev->soc->hal_soc))
  3424. hal_reo_shared_qaddr_cache_clear(pdev->soc->hal_soc);
  3425. /* Setup default (non-qos) rx tid queue */
  3426. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  3427. /* Setup rx tid queue for TID 0.
  3428. * Other queues will be setup on receiving first packet, which will cause
  3429. * NULL REO queue error
  3430. */
  3431. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  3432. /*
  3433. * Setup the rest of TID's to handle LFR
  3434. */
  3435. dp_peer_setup_remaining_tids(peer);
  3436. /*
  3437. * Set security defaults: no PN check, no security. The target may
  3438. * send a HTT SEC_IND message to overwrite these defaults.
  3439. */
  3440. if (peer->txrx_peer)
  3441. peer->txrx_peer->security[dp_sec_ucast].sec_type =
  3442. peer->txrx_peer->security[dp_sec_mcast].sec_type =
  3443. cdp_sec_type_none;
  3444. }
  3445. /*
  3446. * dp_peer_rx_cleanup() – Cleanup receive TID state
  3447. * @vdev: Datapath vdev
  3448. * @peer: Datapath peer
  3449. *
  3450. */
  3451. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3452. {
  3453. int tid;
  3454. uint32_t tid_delete_mask = 0;
  3455. if (!peer->txrx_peer)
  3456. return;
  3457. dp_info("Remove tids for peer: %pK", peer);
  3458. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3459. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  3460. struct dp_rx_tid_defrag *defrag_rx_tid =
  3461. &peer->txrx_peer->rx_tid[tid];
  3462. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  3463. if (!peer->bss_peer || peer->vdev->opmode == wlan_op_mode_sta) {
  3464. /* Cleanup defrag related resource */
  3465. dp_rx_defrag_waitlist_remove(peer->txrx_peer, tid);
  3466. dp_rx_reorder_flush_frag(peer->txrx_peer, tid);
  3467. }
  3468. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  3469. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3470. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned) {
  3471. dp_rx_tid_delete_wifi3(peer, tid);
  3472. tid_delete_mask |= (1 << tid);
  3473. }
  3474. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3475. }
  3476. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  3477. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  3478. soc->ol_ops->peer_rx_reorder_queue_remove(soc->ctrl_psoc,
  3479. peer->vdev->pdev->pdev_id,
  3480. peer->vdev->vdev_id, peer->mac_addr.raw,
  3481. tid_delete_mask);
  3482. }
  3483. #endif
  3484. }
  3485. /*
  3486. * dp_peer_cleanup() – Cleanup peer information
  3487. * @vdev: Datapath vdev
  3488. * @peer: Datapath peer
  3489. *
  3490. */
  3491. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  3492. {
  3493. enum wlan_op_mode vdev_opmode;
  3494. uint8_t vdev_mac_addr[QDF_MAC_ADDR_SIZE];
  3495. struct dp_pdev *pdev = vdev->pdev;
  3496. struct dp_soc *soc = pdev->soc;
  3497. /* save vdev related member in case vdev freed */
  3498. vdev_opmode = vdev->opmode;
  3499. if (!IS_MLO_DP_MLD_PEER(peer))
  3500. dp_monitor_peer_tx_cleanup(vdev, peer);
  3501. if (vdev_opmode != wlan_op_mode_monitor)
  3502. /* cleanup the Rx reorder queues for this peer */
  3503. dp_peer_rx_cleanup(vdev, peer);
  3504. dp_peer_rx_tids_destroy(peer);
  3505. if (IS_MLO_DP_LINK_PEER(peer))
  3506. dp_link_peer_del_mld_peer(peer);
  3507. if (IS_MLO_DP_MLD_PEER(peer))
  3508. dp_mld_peer_deinit_link_peers_info(peer);
  3509. qdf_mem_copy(vdev_mac_addr, vdev->mac_addr.raw,
  3510. QDF_MAC_ADDR_SIZE);
  3511. if (soc->cdp_soc.ol_ops->peer_unref_delete)
  3512. soc->cdp_soc.ol_ops->peer_unref_delete(
  3513. soc->ctrl_psoc,
  3514. vdev->pdev->pdev_id,
  3515. peer->mac_addr.raw, vdev_mac_addr,
  3516. vdev_opmode);
  3517. }
  3518. /* dp_teardown_256_ba_session() - Teardown sessions using 256
  3519. * window size when a request with
  3520. * 64 window size is received.
  3521. * This is done as a WAR since HW can
  3522. * have only one setting per peer (64 or 256).
  3523. * For HKv2, we use per tid buffersize setting
  3524. * for 0 to per_tid_basize_max_tid. For tid
  3525. * more than per_tid_basize_max_tid we use HKv1
  3526. * method.
  3527. * @peer: Datapath peer
  3528. *
  3529. * Return: void
  3530. */
  3531. static void dp_teardown_256_ba_sessions(struct dp_peer *peer)
  3532. {
  3533. uint8_t delba_rcode = 0;
  3534. int tid;
  3535. struct dp_rx_tid *rx_tid = NULL;
  3536. tid = peer->vdev->pdev->soc->per_tid_basize_max_tid;
  3537. for (; tid < DP_MAX_TIDS; tid++) {
  3538. rx_tid = &peer->rx_tid[tid];
  3539. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3540. if (rx_tid->ba_win_size <= 64) {
  3541. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3542. continue;
  3543. } else {
  3544. if (rx_tid->ba_status == DP_RX_BA_ACTIVE ||
  3545. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3546. /* send delba */
  3547. if (!rx_tid->delba_tx_status) {
  3548. rx_tid->delba_tx_retry++;
  3549. rx_tid->delba_tx_status = 1;
  3550. rx_tid->delba_rcode =
  3551. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  3552. delba_rcode = rx_tid->delba_rcode;
  3553. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3554. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  3555. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  3556. peer->vdev->pdev->soc->ctrl_psoc,
  3557. peer->vdev->vdev_id,
  3558. peer->mac_addr.raw,
  3559. tid, delba_rcode,
  3560. CDP_DELBA_REASON_NONE);
  3561. } else {
  3562. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3563. }
  3564. } else {
  3565. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3566. }
  3567. }
  3568. }
  3569. }
  3570. /*
  3571. * dp_rx_addba_resp_tx_completion_wifi3() – Update Rx Tid State
  3572. *
  3573. * @soc: Datapath soc handle
  3574. * @peer_mac: Datapath peer mac address
  3575. * @vdev_id: id of atapath vdev
  3576. * @tid: TID number
  3577. * @status: tx completion status
  3578. * Return: 0 on success, error code on failure
  3579. */
  3580. int dp_addba_resp_tx_completion_wifi3(struct cdp_soc_t *cdp_soc,
  3581. uint8_t *peer_mac,
  3582. uint16_t vdev_id,
  3583. uint8_t tid, int status)
  3584. {
  3585. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3586. (struct dp_soc *)cdp_soc,
  3587. peer_mac, 0, vdev_id,
  3588. DP_MOD_ID_CDP);
  3589. struct dp_rx_tid *rx_tid = NULL;
  3590. if (!peer) {
  3591. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3592. goto fail;
  3593. }
  3594. rx_tid = &peer->rx_tid[tid];
  3595. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3596. if (status) {
  3597. rx_tid->num_addba_rsp_failed++;
  3598. dp_rx_tid_update_wifi3(peer, tid, 1,
  3599. IEEE80211_SEQ_MAX, false);
  3600. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3601. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3602. dp_err("RxTid- %d addba rsp tx completion failed", tid);
  3603. goto success;
  3604. }
  3605. rx_tid->num_addba_rsp_success++;
  3606. if (rx_tid->ba_status == DP_RX_BA_INACTIVE) {
  3607. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3608. dp_peer_err("%pK: Rx Tid- %d hw qdesc is not in IN_PROGRESS",
  3609. cdp_soc, tid);
  3610. goto fail;
  3611. }
  3612. if (!qdf_atomic_read(&peer->is_default_route_set)) {
  3613. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3614. dp_peer_debug("%pK: default route is not set for peer: " QDF_MAC_ADDR_FMT,
  3615. cdp_soc, QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  3616. goto fail;
  3617. }
  3618. if (dp_rx_tid_update_wifi3(peer, tid,
  3619. rx_tid->ba_win_size,
  3620. rx_tid->startseqnum,
  3621. false)) {
  3622. dp_err("Failed update REO SSN");
  3623. }
  3624. dp_info("tid %u window_size %u start_seq_num %u",
  3625. tid, rx_tid->ba_win_size,
  3626. rx_tid->startseqnum);
  3627. /* First Session */
  3628. if (peer->active_ba_session_cnt == 0) {
  3629. if (rx_tid->ba_win_size > 64 && rx_tid->ba_win_size <= 256)
  3630. peer->hw_buffer_size = 256;
  3631. else if (rx_tid->ba_win_size <= 1024 &&
  3632. rx_tid->ba_win_size > 256)
  3633. peer->hw_buffer_size = 1024;
  3634. else
  3635. peer->hw_buffer_size = 64;
  3636. }
  3637. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  3638. peer->active_ba_session_cnt++;
  3639. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3640. /* Kill any session having 256 buffer size
  3641. * when 64 buffer size request is received.
  3642. * Also, latch on to 64 as new buffer size.
  3643. */
  3644. if (peer->kill_256_sessions) {
  3645. dp_teardown_256_ba_sessions(peer);
  3646. peer->kill_256_sessions = 0;
  3647. }
  3648. success:
  3649. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3650. return QDF_STATUS_SUCCESS;
  3651. fail:
  3652. if (peer)
  3653. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3654. return QDF_STATUS_E_FAILURE;
  3655. }
  3656. /*
  3657. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  3658. *
  3659. * @soc: Datapath soc handle
  3660. * @peer_mac: Datapath peer mac address
  3661. * @vdev_id: id of atapath vdev
  3662. * @tid: TID number
  3663. * @dialogtoken: output dialogtoken
  3664. * @statuscode: output dialogtoken
  3665. * @buffersize: Output BA window size
  3666. * @batimeout: Output BA timeout
  3667. */
  3668. QDF_STATUS
  3669. dp_addba_responsesetup_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3670. uint16_t vdev_id, uint8_t tid,
  3671. uint8_t *dialogtoken, uint16_t *statuscode,
  3672. uint16_t *buffersize, uint16_t *batimeout)
  3673. {
  3674. struct dp_rx_tid *rx_tid = NULL;
  3675. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3676. struct dp_peer *peer = dp_peer_find_hash_find((struct dp_soc *)cdp_soc,
  3677. peer_mac, 0, vdev_id,
  3678. DP_MOD_ID_CDP);
  3679. if (!peer) {
  3680. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3681. return QDF_STATUS_E_FAILURE;
  3682. }
  3683. rx_tid = &peer->rx_tid[tid];
  3684. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3685. rx_tid->num_of_addba_resp++;
  3686. /* setup ADDBA response parameters */
  3687. *dialogtoken = rx_tid->dialogtoken;
  3688. *statuscode = rx_tid->statuscode;
  3689. *buffersize = rx_tid->ba_win_size;
  3690. *batimeout = 0;
  3691. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3692. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3693. return status;
  3694. }
  3695. /* dp_check_ba_buffersize() - Check buffer size in request
  3696. * and latch onto this size based on
  3697. * size used in first active session.
  3698. * @peer: Datapath peer
  3699. * @tid: Tid
  3700. * @buffersize: Block ack window size
  3701. *
  3702. * Return: void
  3703. */
  3704. static void dp_check_ba_buffersize(struct dp_peer *peer,
  3705. uint16_t tid,
  3706. uint16_t buffersize)
  3707. {
  3708. struct dp_rx_tid *rx_tid = NULL;
  3709. rx_tid = &peer->rx_tid[tid];
  3710. if (peer->vdev->pdev->soc->per_tid_basize_max_tid &&
  3711. tid < peer->vdev->pdev->soc->per_tid_basize_max_tid) {
  3712. rx_tid->ba_win_size = buffersize;
  3713. return;
  3714. } else {
  3715. if (peer->active_ba_session_cnt == 0) {
  3716. rx_tid->ba_win_size = buffersize;
  3717. } else {
  3718. if (peer->hw_buffer_size == 64) {
  3719. if (buffersize <= 64)
  3720. rx_tid->ba_win_size = buffersize;
  3721. else
  3722. rx_tid->ba_win_size = peer->hw_buffer_size;
  3723. } else if (peer->hw_buffer_size == 256) {
  3724. if (buffersize > 64) {
  3725. rx_tid->ba_win_size = buffersize;
  3726. } else {
  3727. rx_tid->ba_win_size = buffersize;
  3728. peer->hw_buffer_size = 64;
  3729. peer->kill_256_sessions = 1;
  3730. }
  3731. }
  3732. }
  3733. }
  3734. }
  3735. #define DP_RX_BA_SESSION_DISABLE 1
  3736. /*
  3737. * dp_addba_requestprocess_wifi3() - Process ADDBA request from peer
  3738. *
  3739. * @soc: Datapath soc handle
  3740. * @peer_mac: Datapath peer mac address
  3741. * @vdev_id: id of atapath vdev
  3742. * @dialogtoken: dialogtoken from ADDBA frame
  3743. * @tid: TID number
  3744. * @batimeout: BA timeout
  3745. * @buffersize: BA window size
  3746. * @startseqnum: Start seq. number received in BA sequence control
  3747. *
  3748. * Return: 0 on success, error code on failure
  3749. */
  3750. int dp_addba_requestprocess_wifi3(struct cdp_soc_t *cdp_soc,
  3751. uint8_t *peer_mac,
  3752. uint16_t vdev_id,
  3753. uint8_t dialogtoken,
  3754. uint16_t tid, uint16_t batimeout,
  3755. uint16_t buffersize,
  3756. uint16_t startseqnum)
  3757. {
  3758. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3759. struct dp_rx_tid *rx_tid = NULL;
  3760. struct dp_peer *peer;
  3761. peer = dp_peer_get_tgt_peer_hash_find((struct dp_soc *)cdp_soc,
  3762. peer_mac,
  3763. 0, vdev_id,
  3764. DP_MOD_ID_CDP);
  3765. if (!peer) {
  3766. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3767. return QDF_STATUS_E_FAILURE;
  3768. }
  3769. rx_tid = &peer->rx_tid[tid];
  3770. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3771. rx_tid->num_of_addba_req++;
  3772. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE &&
  3773. rx_tid->hw_qdesc_vaddr_unaligned)) {
  3774. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3775. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3776. peer->active_ba_session_cnt--;
  3777. dp_peer_debug("%pK: Rx Tid- %d hw qdesc is already setup",
  3778. cdp_soc, tid);
  3779. }
  3780. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3781. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3782. status = QDF_STATUS_E_FAILURE;
  3783. goto fail;
  3784. }
  3785. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE) {
  3786. dp_peer_info("%pK: disable BA session",
  3787. cdp_soc);
  3788. buffersize = 1;
  3789. } else if (rx_tid->rx_ba_win_size_override) {
  3790. dp_peer_info("%pK: override BA win to %d", cdp_soc,
  3791. rx_tid->rx_ba_win_size_override);
  3792. buffersize = rx_tid->rx_ba_win_size_override;
  3793. } else {
  3794. dp_peer_info("%pK: restore BA win %d based on addba req", cdp_soc,
  3795. buffersize);
  3796. }
  3797. dp_check_ba_buffersize(peer, tid, buffersize);
  3798. if (dp_rx_tid_setup_wifi3(peer, tid,
  3799. rx_tid->ba_win_size, startseqnum)) {
  3800. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3801. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3802. status = QDF_STATUS_E_FAILURE;
  3803. goto fail;
  3804. }
  3805. rx_tid->ba_status = DP_RX_BA_IN_PROGRESS;
  3806. rx_tid->dialogtoken = dialogtoken;
  3807. rx_tid->startseqnum = startseqnum;
  3808. if (rx_tid->userstatuscode != IEEE80211_STATUS_SUCCESS)
  3809. rx_tid->statuscode = rx_tid->userstatuscode;
  3810. else
  3811. rx_tid->statuscode = IEEE80211_STATUS_SUCCESS;
  3812. if (rx_tid->rx_ba_win_size_override == DP_RX_BA_SESSION_DISABLE)
  3813. rx_tid->statuscode = IEEE80211_STATUS_REFUSED;
  3814. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3815. fail:
  3816. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3817. return status;
  3818. }
  3819. /*
  3820. * dp_set_addba_response() – Set a user defined ADDBA response status code
  3821. *
  3822. * @soc: Datapath soc handle
  3823. * @peer_mac: Datapath peer mac address
  3824. * @vdev_id: id of atapath vdev
  3825. * @tid: TID number
  3826. * @statuscode: response status code to be set
  3827. */
  3828. QDF_STATUS
  3829. dp_set_addba_response(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3830. uint16_t vdev_id, uint8_t tid, uint16_t statuscode)
  3831. {
  3832. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3833. (struct dp_soc *)cdp_soc,
  3834. peer_mac, 0, vdev_id,
  3835. DP_MOD_ID_CDP);
  3836. struct dp_rx_tid *rx_tid;
  3837. if (!peer) {
  3838. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3839. return QDF_STATUS_E_FAILURE;
  3840. }
  3841. rx_tid = &peer->rx_tid[tid];
  3842. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3843. rx_tid->userstatuscode = statuscode;
  3844. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3845. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3846. return QDF_STATUS_SUCCESS;
  3847. }
  3848. /*
  3849. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  3850. * @soc: Datapath soc handle
  3851. * @peer_mac: Datapath peer mac address
  3852. * @vdev_id: id of atapath vdev
  3853. * @tid: TID number
  3854. * @reasoncode: Reason code received in DELBA frame
  3855. *
  3856. * Return: 0 on success, error code on failure
  3857. */
  3858. int dp_delba_process_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3859. uint16_t vdev_id, int tid, uint16_t reasoncode)
  3860. {
  3861. QDF_STATUS status = QDF_STATUS_SUCCESS;
  3862. struct dp_rx_tid *rx_tid;
  3863. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3864. (struct dp_soc *)cdp_soc,
  3865. peer_mac, 0, vdev_id,
  3866. DP_MOD_ID_CDP);
  3867. if (!peer) {
  3868. dp_peer_debug("%pK: Peer is NULL!\n", cdp_soc);
  3869. return QDF_STATUS_E_FAILURE;
  3870. }
  3871. rx_tid = &peer->rx_tid[tid];
  3872. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3873. if (rx_tid->ba_status == DP_RX_BA_INACTIVE ||
  3874. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3875. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3876. status = QDF_STATUS_E_FAILURE;
  3877. goto fail;
  3878. }
  3879. /* TODO: See if we can delete the existing REO queue descriptor and
  3880. * replace with a new one without queue extenstion descript to save
  3881. * memory
  3882. */
  3883. rx_tid->delba_rcode = reasoncode;
  3884. rx_tid->num_of_delba_req++;
  3885. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3886. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3887. peer->active_ba_session_cnt--;
  3888. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3889. fail:
  3890. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3891. return status;
  3892. }
  3893. /*
  3894. * dp_rx_delba_tx_completion_wifi3() – Send Delba Request
  3895. *
  3896. * @soc: Datapath soc handle
  3897. * @peer_mac: Datapath peer mac address
  3898. * @vdev_id: id of atapath vdev
  3899. * @tid: TID number
  3900. * @status: tx completion status
  3901. * Return: 0 on success, error code on failure
  3902. */
  3903. int dp_delba_tx_completion_wifi3(struct cdp_soc_t *cdp_soc, uint8_t *peer_mac,
  3904. uint16_t vdev_id,
  3905. uint8_t tid, int status)
  3906. {
  3907. QDF_STATUS ret = QDF_STATUS_SUCCESS;
  3908. struct dp_rx_tid *rx_tid = NULL;
  3909. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(
  3910. (struct dp_soc *)cdp_soc,
  3911. peer_mac, 0, vdev_id,
  3912. DP_MOD_ID_CDP);
  3913. if (!peer) {
  3914. dp_peer_debug("%pK: Peer is NULL!", cdp_soc);
  3915. return QDF_STATUS_E_FAILURE;
  3916. }
  3917. rx_tid = &peer->rx_tid[tid];
  3918. qdf_spin_lock_bh(&rx_tid->tid_lock);
  3919. if (status) {
  3920. rx_tid->delba_tx_fail_cnt++;
  3921. if (rx_tid->delba_tx_retry >= DP_MAX_DELBA_RETRY) {
  3922. rx_tid->delba_tx_retry = 0;
  3923. rx_tid->delba_tx_status = 0;
  3924. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3925. } else {
  3926. rx_tid->delba_tx_retry++;
  3927. rx_tid->delba_tx_status = 1;
  3928. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3929. if (peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba)
  3930. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  3931. peer->vdev->pdev->soc->ctrl_psoc,
  3932. peer->vdev->vdev_id,
  3933. peer->mac_addr.raw, tid,
  3934. rx_tid->delba_rcode,
  3935. CDP_DELBA_REASON_NONE);
  3936. }
  3937. goto end;
  3938. } else {
  3939. rx_tid->delba_tx_success_cnt++;
  3940. rx_tid->delba_tx_retry = 0;
  3941. rx_tid->delba_tx_status = 0;
  3942. }
  3943. if (rx_tid->ba_status == DP_RX_BA_ACTIVE) {
  3944. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3945. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3946. peer->active_ba_session_cnt--;
  3947. }
  3948. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  3949. dp_rx_tid_update_wifi3(peer, tid, 1, IEEE80211_SEQ_MAX, false);
  3950. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  3951. }
  3952. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  3953. end:
  3954. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3955. return ret;
  3956. }
  3957. /**
  3958. * dp_set_pn_check_wifi3() - enable PN check in REO for security
  3959. * @soc: Datapath soc handle
  3960. * @peer_mac: Datapath peer mac address
  3961. * @vdev_id: id of atapath vdev
  3962. * @vdev: Datapath vdev
  3963. * @pdev - data path device instance
  3964. * @sec_type - security type
  3965. * @rx_pn - Receive pn starting number
  3966. *
  3967. */
  3968. QDF_STATUS
  3969. dp_set_pn_check_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  3970. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  3971. uint32_t *rx_pn)
  3972. {
  3973. struct dp_pdev *pdev;
  3974. int i;
  3975. uint8_t pn_size;
  3976. struct hal_reo_cmd_params params;
  3977. struct dp_peer *peer = NULL;
  3978. struct dp_vdev *vdev = NULL;
  3979. peer = dp_peer_find_hash_find((struct dp_soc *)soc,
  3980. peer_mac, 0, vdev_id,
  3981. DP_MOD_ID_CDP);
  3982. if (!peer) {
  3983. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  3984. return QDF_STATUS_E_FAILURE;
  3985. }
  3986. vdev = peer->vdev;
  3987. if (!vdev) {
  3988. dp_peer_debug("%pK: VDEV is NULL!\n", soc);
  3989. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3990. return QDF_STATUS_E_FAILURE;
  3991. }
  3992. pdev = vdev->pdev;
  3993. qdf_mem_zero(&params, sizeof(params));
  3994. params.std.need_status = 1;
  3995. params.u.upd_queue_params.update_pn_valid = 1;
  3996. params.u.upd_queue_params.update_pn_size = 1;
  3997. params.u.upd_queue_params.update_pn = 1;
  3998. params.u.upd_queue_params.update_pn_check_needed = 1;
  3999. params.u.upd_queue_params.update_svld = 1;
  4000. params.u.upd_queue_params.svld = 0;
  4001. switch (sec_type) {
  4002. case cdp_sec_type_tkip_nomic:
  4003. case cdp_sec_type_aes_ccmp:
  4004. case cdp_sec_type_aes_ccmp_256:
  4005. case cdp_sec_type_aes_gcmp:
  4006. case cdp_sec_type_aes_gcmp_256:
  4007. params.u.upd_queue_params.pn_check_needed = 1;
  4008. params.u.upd_queue_params.pn_size = PN_SIZE_48;
  4009. pn_size = 48;
  4010. break;
  4011. case cdp_sec_type_wapi:
  4012. params.u.upd_queue_params.pn_check_needed = 1;
  4013. params.u.upd_queue_params.pn_size = PN_SIZE_128;
  4014. pn_size = 128;
  4015. if (vdev->opmode == wlan_op_mode_ap) {
  4016. params.u.upd_queue_params.pn_even = 1;
  4017. params.u.upd_queue_params.update_pn_even = 1;
  4018. } else {
  4019. params.u.upd_queue_params.pn_uneven = 1;
  4020. params.u.upd_queue_params.update_pn_uneven = 1;
  4021. }
  4022. break;
  4023. default:
  4024. params.u.upd_queue_params.pn_check_needed = 0;
  4025. pn_size = 0;
  4026. break;
  4027. }
  4028. for (i = 0; i < DP_MAX_TIDS; i++) {
  4029. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  4030. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4031. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4032. params.std.addr_lo =
  4033. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4034. params.std.addr_hi =
  4035. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4036. if (pn_size) {
  4037. dp_peer_info("%pK: PN set for TID:%d pn:%x:%x:%x:%x",
  4038. soc, i, rx_pn[3], rx_pn[2],
  4039. rx_pn[1], rx_pn[0]);
  4040. params.u.upd_queue_params.update_pn_valid = 1;
  4041. params.u.upd_queue_params.pn_31_0 = rx_pn[0];
  4042. params.u.upd_queue_params.pn_63_32 = rx_pn[1];
  4043. params.u.upd_queue_params.pn_95_64 = rx_pn[2];
  4044. params.u.upd_queue_params.pn_127_96 = rx_pn[3];
  4045. }
  4046. rx_tid->pn_size = pn_size;
  4047. if (dp_reo_send_cmd(cdp_soc_t_to_dp_soc(soc),
  4048. CMD_UPDATE_RX_REO_QUEUE,
  4049. &params, dp_rx_tid_update_cb,
  4050. rx_tid)) {
  4051. dp_err_log("fail to send CMD_UPDATE_RX_REO_QUEUE"
  4052. "tid %d desc %pK", rx_tid->tid,
  4053. (void *)(rx_tid->hw_qdesc_paddr));
  4054. DP_STATS_INC(cdp_soc_t_to_dp_soc(soc),
  4055. rx.err.reo_cmd_send_fail, 1);
  4056. }
  4057. } else {
  4058. dp_peer_info("%pK: PN Check not setup for TID :%d ", soc, i);
  4059. }
  4060. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4061. }
  4062. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4063. return QDF_STATUS_SUCCESS;
  4064. }
  4065. /**
  4066. * dp_set_key_sec_type_wifi3() - set security mode of key
  4067. * @soc: Datapath soc handle
  4068. * @peer_mac: Datapath peer mac address
  4069. * @vdev_id: id of atapath vdev
  4070. * @vdev: Datapath vdev
  4071. * @pdev - data path device instance
  4072. * @sec_type - security type
  4073. * #is_unicast - key type
  4074. *
  4075. */
  4076. QDF_STATUS
  4077. dp_set_key_sec_type_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  4078. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  4079. bool is_unicast)
  4080. {
  4081. struct dp_peer *peer =
  4082. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  4083. peer_mac, 0, vdev_id,
  4084. DP_MOD_ID_CDP);
  4085. int sec_index;
  4086. if (!peer) {
  4087. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  4088. return QDF_STATUS_E_FAILURE;
  4089. }
  4090. if (!peer->txrx_peer) {
  4091. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4092. dp_peer_debug("%pK: txrx peer is NULL!\n", soc);
  4093. return QDF_STATUS_E_FAILURE;
  4094. }
  4095. dp_peer_info("%pK: key sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4096. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4097. is_unicast ? "ucast" : "mcast", sec_type);
  4098. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4099. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4100. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4101. return QDF_STATUS_SUCCESS;
  4102. }
  4103. void
  4104. dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  4105. enum cdp_sec_type sec_type, int is_unicast,
  4106. u_int32_t *michael_key,
  4107. u_int32_t *rx_pn)
  4108. {
  4109. struct dp_peer *peer;
  4110. struct dp_txrx_peer *txrx_peer;
  4111. int sec_index;
  4112. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4113. if (!peer) {
  4114. dp_peer_err("Couldn't find peer from ID %d - skipping security inits",
  4115. peer_id);
  4116. return;
  4117. }
  4118. txrx_peer = dp_get_txrx_peer(peer);
  4119. if (!txrx_peer) {
  4120. dp_peer_err("Couldn't find txrx peer from ID %d - skipping security inits",
  4121. peer_id);
  4122. return;
  4123. }
  4124. dp_peer_info("%pK: sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  4125. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4126. is_unicast ? "ucast" : "mcast", sec_type);
  4127. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  4128. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  4129. #ifdef notyet /* TODO: See if this is required for defrag support */
  4130. /* michael key only valid for TKIP, but for simplicity,
  4131. * copy it anyway
  4132. */
  4133. qdf_mem_copy(
  4134. &peer->txrx_peer->security[sec_index].michael_key[0],
  4135. michael_key,
  4136. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4137. #ifdef BIG_ENDIAN_HOST
  4138. OL_IF_SWAPBO(peer->txrx_peer->security[sec_index].michael_key[0],
  4139. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  4140. #endif /* BIG_ENDIAN_HOST */
  4141. #endif
  4142. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  4143. if (sec_type != cdp_sec_type_wapi) {
  4144. qdf_mem_zero(peer->tids_last_pn_valid, _EXT_TIDS);
  4145. } else {
  4146. for (i = 0; i < DP_MAX_TIDS; i++) {
  4147. /*
  4148. * Setting PN valid bit for WAPI sec_type,
  4149. * since WAPI PN has to be started with predefined value
  4150. */
  4151. peer->tids_last_pn_valid[i] = 1;
  4152. qdf_mem_copy(
  4153. (u_int8_t *) &peer->tids_last_pn[i],
  4154. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  4155. peer->tids_last_pn[i].pn128[1] =
  4156. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  4157. peer->tids_last_pn[i].pn128[0] =
  4158. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  4159. }
  4160. }
  4161. #endif
  4162. /* TODO: Update HW TID queue with PN check parameters (pn type for
  4163. * all security types and last pn for WAPI) once REO command API
  4164. * is available
  4165. */
  4166. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4167. }
  4168. #ifdef QCA_PEER_EXT_STATS
  4169. /*
  4170. * dp_peer_delay_stats_ctx_alloc() - Allocate peer delay
  4171. * stats content
  4172. * @soc: DP SoC context
  4173. * @txrx_peer: DP txrx peer context
  4174. *
  4175. * Allocate the peer delay stats context
  4176. *
  4177. * Return: QDF_STATUS_SUCCESS if allocation is
  4178. * successful
  4179. */
  4180. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  4181. struct dp_txrx_peer *txrx_peer)
  4182. {
  4183. uint8_t tid, ctx_id;
  4184. if (!soc || !txrx_peer) {
  4185. dp_warn("Null soc%pK or peer%pK", soc, txrx_peer);
  4186. return QDF_STATUS_E_INVAL;
  4187. }
  4188. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4189. return QDF_STATUS_SUCCESS;
  4190. /*
  4191. * Allocate memory for peer extended stats.
  4192. */
  4193. txrx_peer->delay_stats =
  4194. qdf_mem_malloc(sizeof(struct dp_peer_delay_stats));
  4195. if (!txrx_peer->delay_stats) {
  4196. dp_err("Peer extended stats obj alloc failed!!");
  4197. return QDF_STATUS_E_NOMEM;
  4198. }
  4199. for (tid = 0; tid < CDP_MAX_DATA_TIDS; tid++) {
  4200. for (ctx_id = 0; ctx_id < CDP_MAX_TXRX_CTX; ctx_id++) {
  4201. struct cdp_delay_tx_stats *tx_delay =
  4202. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].tx_delay;
  4203. struct cdp_delay_rx_stats *rx_delay =
  4204. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].rx_delay;
  4205. dp_hist_init(&tx_delay->tx_swq_delay,
  4206. CDP_HIST_TYPE_SW_ENQEUE_DELAY);
  4207. dp_hist_init(&tx_delay->hwtx_delay,
  4208. CDP_HIST_TYPE_HW_COMP_DELAY);
  4209. dp_hist_init(&rx_delay->to_stack_delay,
  4210. CDP_HIST_TYPE_REAP_STACK);
  4211. }
  4212. }
  4213. return QDF_STATUS_SUCCESS;
  4214. }
  4215. /*
  4216. * dp_peer_delay_stats_ctx_dealloc() - Dealloc the peer delay stats context
  4217. * @txrx_peer: txrx DP peer context
  4218. *
  4219. * Free the peer delay stats context
  4220. *
  4221. * Return: Void
  4222. */
  4223. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  4224. struct dp_txrx_peer *txrx_peer)
  4225. {
  4226. if (!txrx_peer) {
  4227. dp_warn("peer_ext dealloc failed due to NULL peer object");
  4228. return;
  4229. }
  4230. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  4231. return;
  4232. if (!txrx_peer->delay_stats)
  4233. return;
  4234. qdf_mem_free(txrx_peer->delay_stats);
  4235. txrx_peer->delay_stats = NULL;
  4236. }
  4237. /**
  4238. * dp_peer_delay_stats_ctx_clr() - Clear delay stats context of peer
  4239. *
  4240. * @txrx_peer: dp_txrx_peer handle
  4241. *
  4242. * Return: void
  4243. */
  4244. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4245. {
  4246. if (txrx_peer->delay_stats)
  4247. qdf_mem_zero(txrx_peer->delay_stats,
  4248. sizeof(struct dp_peer_delay_stats));
  4249. }
  4250. #endif
  4251. #ifdef WLAN_PEER_JITTER
  4252. /**
  4253. * dp_peer_jitter_stats_ctx_alloc() - Allocate jitter stats context for peer
  4254. *
  4255. * @soc: Datapath pdev handle
  4256. * @txrx_peer: dp_txrx_peer handle
  4257. *
  4258. * Return: QDF_STATUS
  4259. */
  4260. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  4261. struct dp_txrx_peer *txrx_peer)
  4262. {
  4263. if (!pdev || !txrx_peer) {
  4264. dp_warn("Null pdev or peer");
  4265. return QDF_STATUS_E_INVAL;
  4266. }
  4267. /*
  4268. * Allocate memory for jitter stats only when
  4269. * operating in offload enabled mode.
  4270. */
  4271. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4272. return QDF_STATUS_SUCCESS;
  4273. txrx_peer->jitter_stats =
  4274. qdf_mem_malloc(sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4275. if (!txrx_peer->jitter_stats) {
  4276. dp_warn("Jitter stats obj alloc failed!!");
  4277. return QDF_STATUS_E_NOMEM;
  4278. }
  4279. return QDF_STATUS_SUCCESS;
  4280. }
  4281. /**
  4282. * dp_peer_jitter_stats_ctx_dealloc() - Deallocate jitter stats context
  4283. *
  4284. * @pdev: Datapath pdev handle
  4285. * @txrx_peer: dp_txrx_peer handle
  4286. *
  4287. * Return: void
  4288. */
  4289. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  4290. struct dp_txrx_peer *txrx_peer)
  4291. {
  4292. if (!pdev || !txrx_peer) {
  4293. dp_warn("Null pdev or peer");
  4294. return;
  4295. }
  4296. /* Check for offload mode */
  4297. if (!wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx))
  4298. return;
  4299. if (txrx_peer->jitter_stats) {
  4300. qdf_mem_free(txrx_peer->jitter_stats);
  4301. txrx_peer->jitter_stats = NULL;
  4302. }
  4303. }
  4304. /**
  4305. * dp_peer_jitter_stats_ctx_clr() - Clear jitter stats context of peer
  4306. *
  4307. * @txrx_peer: dp_txrx_peer handle
  4308. *
  4309. * Return: void
  4310. */
  4311. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  4312. {
  4313. if (txrx_peer->jitter_stats)
  4314. qdf_mem_zero(txrx_peer->jitter_stats,
  4315. sizeof(struct cdp_peer_tid_stats) * DP_MAX_TIDS);
  4316. }
  4317. #endif
  4318. QDF_STATUS
  4319. dp_rx_delba_ind_handler(void *soc_handle, uint16_t peer_id,
  4320. uint8_t tid, uint16_t win_sz)
  4321. {
  4322. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  4323. struct dp_peer *peer;
  4324. struct dp_rx_tid *rx_tid;
  4325. QDF_STATUS status = QDF_STATUS_SUCCESS;
  4326. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  4327. if (!peer) {
  4328. dp_peer_err("%pK: Couldn't find peer from ID %d",
  4329. soc, peer_id);
  4330. return QDF_STATUS_E_FAILURE;
  4331. }
  4332. qdf_assert_always(tid < DP_MAX_TIDS);
  4333. rx_tid = &peer->rx_tid[tid];
  4334. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4335. if (!rx_tid->delba_tx_status) {
  4336. dp_peer_info("%pK: PEER_ID: %d TID: %d, BA win: %d ",
  4337. soc, peer_id, tid, win_sz);
  4338. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4339. rx_tid->delba_tx_status = 1;
  4340. rx_tid->rx_ba_win_size_override =
  4341. qdf_min((uint16_t)63, win_sz);
  4342. rx_tid->delba_rcode =
  4343. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  4344. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4345. if (soc->cdp_soc.ol_ops->send_delba)
  4346. soc->cdp_soc.ol_ops->send_delba(
  4347. peer->vdev->pdev->soc->ctrl_psoc,
  4348. peer->vdev->vdev_id,
  4349. peer->mac_addr.raw,
  4350. tid,
  4351. rx_tid->delba_rcode,
  4352. CDP_DELBA_REASON_NONE);
  4353. }
  4354. } else {
  4355. dp_peer_err("%pK: BA session is not setup for TID:%d ", soc, tid);
  4356. status = QDF_STATUS_E_FAILURE;
  4357. }
  4358. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4359. return status;
  4360. }
  4361. #ifdef DP_PEER_EXTENDED_API
  4362. #ifdef WLAN_FEATURE_11BE_MLO
  4363. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4364. struct ol_txrx_desc_type *sta_desc)
  4365. {
  4366. struct dp_peer *peer;
  4367. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4368. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4369. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4370. if (!peer)
  4371. return QDF_STATUS_E_FAULT;
  4372. qdf_spin_lock_bh(&peer->peer_info_lock);
  4373. peer->state = OL_TXRX_PEER_STATE_CONN;
  4374. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4375. dp_rx_flush_rx_cached(peer, false);
  4376. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4377. dp_peer_info("register for mld peer" QDF_MAC_ADDR_FMT,
  4378. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw));
  4379. qdf_spin_lock_bh(&peer->mld_peer->peer_info_lock);
  4380. peer->mld_peer->state = peer->state;
  4381. qdf_spin_unlock_bh(&peer->mld_peer->peer_info_lock);
  4382. dp_rx_flush_rx_cached(peer->mld_peer, false);
  4383. }
  4384. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4385. return QDF_STATUS_SUCCESS;
  4386. }
  4387. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4388. enum ol_txrx_peer_state state)
  4389. {
  4390. struct dp_peer *peer;
  4391. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4392. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4393. DP_MOD_ID_CDP);
  4394. if (!peer) {
  4395. dp_peer_err("%pK: Failed to find peer[" QDF_MAC_ADDR_FMT "]",
  4396. soc, QDF_MAC_ADDR_REF(peer_mac));
  4397. return QDF_STATUS_E_FAILURE;
  4398. }
  4399. peer->state = state;
  4400. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4401. if (peer->txrx_peer)
  4402. peer->txrx_peer->authorize = peer->authorize;
  4403. dp_peer_info("peer" QDF_MAC_ADDR_FMT "state %d",
  4404. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  4405. peer->state);
  4406. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  4407. peer->mld_peer->state = peer->state;
  4408. peer->mld_peer->txrx_peer->authorize = peer->authorize;
  4409. dp_peer_info("mld peer" QDF_MAC_ADDR_FMT "state %d",
  4410. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw),
  4411. peer->mld_peer->state);
  4412. }
  4413. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4414. * Decrement it here.
  4415. */
  4416. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4417. return QDF_STATUS_SUCCESS;
  4418. }
  4419. #else
  4420. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4421. struct ol_txrx_desc_type *sta_desc)
  4422. {
  4423. struct dp_peer *peer;
  4424. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4425. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  4426. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4427. if (!peer)
  4428. return QDF_STATUS_E_FAULT;
  4429. qdf_spin_lock_bh(&peer->peer_info_lock);
  4430. peer->state = OL_TXRX_PEER_STATE_CONN;
  4431. qdf_spin_unlock_bh(&peer->peer_info_lock);
  4432. dp_rx_flush_rx_cached(peer, false);
  4433. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4434. return QDF_STATUS_SUCCESS;
  4435. }
  4436. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4437. enum ol_txrx_peer_state state)
  4438. {
  4439. struct dp_peer *peer;
  4440. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4441. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4442. DP_MOD_ID_CDP);
  4443. if (!peer) {
  4444. dp_peer_err("%pK: Failed to find peer for: [" QDF_MAC_ADDR_FMT "]",
  4445. soc, QDF_MAC_ADDR_REF(peer_mac));
  4446. return QDF_STATUS_E_FAILURE;
  4447. }
  4448. peer->state = state;
  4449. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  4450. if (peer->txrx_peer)
  4451. peer->txrx_peer->authorize = peer->authorize;
  4452. dp_info("peer %pK state %d", peer, peer->state);
  4453. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4454. * Decrement it here.
  4455. */
  4456. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4457. return QDF_STATUS_SUCCESS;
  4458. }
  4459. #endif
  4460. QDF_STATUS
  4461. dp_clear_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4462. struct qdf_mac_addr peer_addr)
  4463. {
  4464. struct dp_peer *peer;
  4465. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4466. peer = dp_peer_find_hash_find(soc, peer_addr.bytes,
  4467. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  4468. if (!peer || !peer->valid)
  4469. return QDF_STATUS_E_FAULT;
  4470. dp_clear_peer_internal(soc, peer);
  4471. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4472. return QDF_STATUS_SUCCESS;
  4473. }
  4474. QDF_STATUS dp_get_vdevid(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  4475. uint8_t *vdev_id)
  4476. {
  4477. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4478. struct dp_peer *peer =
  4479. dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  4480. DP_MOD_ID_CDP);
  4481. if (!peer)
  4482. return QDF_STATUS_E_FAILURE;
  4483. dp_info("peer %pK vdev %pK vdev id %d",
  4484. peer, peer->vdev, peer->vdev->vdev_id);
  4485. *vdev_id = peer->vdev->vdev_id;
  4486. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  4487. * Decrement it here.
  4488. */
  4489. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4490. return QDF_STATUS_SUCCESS;
  4491. }
  4492. struct cdp_vdev *
  4493. dp_get_vdev_by_peer_addr(struct cdp_pdev *pdev_handle,
  4494. struct qdf_mac_addr peer_addr)
  4495. {
  4496. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  4497. struct dp_peer *peer = NULL;
  4498. struct cdp_vdev *vdev = NULL;
  4499. if (!pdev) {
  4500. dp_peer_info("PDEV not found for peer_addr: " QDF_MAC_ADDR_FMT,
  4501. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4502. return NULL;
  4503. }
  4504. peer = dp_peer_find_hash_find(pdev->soc, peer_addr.bytes, 0,
  4505. DP_VDEV_ALL, DP_MOD_ID_CDP);
  4506. if (!peer) {
  4507. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  4508. "PDEV not found for peer_addr: "QDF_MAC_ADDR_FMT,
  4509. QDF_MAC_ADDR_REF(peer_addr.bytes));
  4510. return NULL;
  4511. }
  4512. vdev = (struct cdp_vdev *)peer->vdev;
  4513. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4514. return vdev;
  4515. }
  4516. /**
  4517. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  4518. * @peer - peer instance
  4519. *
  4520. * Get virtual interface instance which peer belongs
  4521. *
  4522. * Return: virtual interface instance pointer
  4523. * NULL in case cannot find
  4524. */
  4525. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  4526. {
  4527. struct dp_peer *peer = peer_handle;
  4528. DP_TRACE(DEBUG, "peer %pK vdev %pK", peer, peer->vdev);
  4529. return (struct cdp_vdev *)peer->vdev;
  4530. }
  4531. /**
  4532. * dp_peer_get_peer_mac_addr() - Get peer mac address
  4533. * @peer - peer instance
  4534. *
  4535. * Get peer mac address
  4536. *
  4537. * Return: peer mac address pointer
  4538. * NULL in case cannot find
  4539. */
  4540. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  4541. {
  4542. struct dp_peer *peer = peer_handle;
  4543. uint8_t *mac;
  4544. mac = peer->mac_addr.raw;
  4545. dp_info("peer %pK mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  4546. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  4547. return peer->mac_addr.raw;
  4548. }
  4549. int dp_get_peer_state(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4550. uint8_t *peer_mac)
  4551. {
  4552. enum ol_txrx_peer_state peer_state;
  4553. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4554. struct dp_peer *peer = dp_peer_find_hash_find(soc, peer_mac, 0,
  4555. vdev_id, DP_MOD_ID_CDP);
  4556. if (!peer)
  4557. return OL_TXRX_PEER_STATE_INVALID;
  4558. DP_TRACE(DEBUG, "peer %pK stats %d", peer, peer->state);
  4559. peer_state = peer->state;
  4560. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4561. return peer_state;
  4562. }
  4563. /**
  4564. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  4565. * @pdev - data path device instance
  4566. *
  4567. * local peer id pool alloc for physical device
  4568. *
  4569. * Return: none
  4570. */
  4571. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  4572. {
  4573. int i;
  4574. /* point the freelist to the first ID */
  4575. pdev->local_peer_ids.freelist = 0;
  4576. /* link each ID to the next one */
  4577. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  4578. pdev->local_peer_ids.pool[i] = i + 1;
  4579. pdev->local_peer_ids.map[i] = NULL;
  4580. }
  4581. /* link the last ID to itself, to mark the end of the list */
  4582. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  4583. pdev->local_peer_ids.pool[i] = i;
  4584. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  4585. DP_TRACE(INFO, "Peer pool init");
  4586. }
  4587. /**
  4588. * dp_local_peer_id_alloc() - allocate local peer id
  4589. * @pdev - data path device instance
  4590. * @peer - new peer instance
  4591. *
  4592. * allocate local peer id
  4593. *
  4594. * Return: none
  4595. */
  4596. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  4597. {
  4598. int i;
  4599. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4600. i = pdev->local_peer_ids.freelist;
  4601. if (pdev->local_peer_ids.pool[i] == i) {
  4602. /* the list is empty, except for the list-end marker */
  4603. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  4604. } else {
  4605. /* take the head ID and advance the freelist */
  4606. peer->local_id = i;
  4607. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  4608. pdev->local_peer_ids.map[i] = peer;
  4609. }
  4610. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4611. dp_info("peer %pK, local id %d", peer, peer->local_id);
  4612. }
  4613. /**
  4614. * dp_local_peer_id_free() - remove local peer id
  4615. * @pdev - data path device instance
  4616. * @peer - peer instance should be removed
  4617. *
  4618. * remove local peer id
  4619. *
  4620. * Return: none
  4621. */
  4622. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  4623. {
  4624. int i = peer->local_id;
  4625. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  4626. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  4627. return;
  4628. }
  4629. /* put this ID on the head of the freelist */
  4630. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  4631. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  4632. pdev->local_peer_ids.freelist = i;
  4633. pdev->local_peer_ids.map[i] = NULL;
  4634. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  4635. }
  4636. bool dp_find_peer_exist_on_vdev(struct cdp_soc_t *soc_hdl,
  4637. uint8_t vdev_id, uint8_t *peer_addr)
  4638. {
  4639. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4640. struct dp_peer *peer = NULL;
  4641. peer = dp_peer_find_hash_find(soc, peer_addr, 0, vdev_id,
  4642. DP_MOD_ID_CDP);
  4643. if (!peer)
  4644. return false;
  4645. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4646. return true;
  4647. }
  4648. bool dp_find_peer_exist_on_other_vdev(struct cdp_soc_t *soc_hdl,
  4649. uint8_t vdev_id, uint8_t *peer_addr,
  4650. uint16_t max_bssid)
  4651. {
  4652. int i;
  4653. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4654. struct dp_peer *peer = NULL;
  4655. for (i = 0; i < max_bssid; i++) {
  4656. /* Need to check vdevs other than the vdev_id */
  4657. if (vdev_id == i)
  4658. continue;
  4659. peer = dp_peer_find_hash_find(soc, peer_addr, 0, i,
  4660. DP_MOD_ID_CDP);
  4661. if (peer) {
  4662. dp_err("Duplicate peer "QDF_MAC_ADDR_FMT" already exist on vdev %d",
  4663. QDF_MAC_ADDR_REF(peer_addr), i);
  4664. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4665. return true;
  4666. }
  4667. }
  4668. return false;
  4669. }
  4670. bool dp_find_peer_exist(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  4671. uint8_t *peer_addr)
  4672. {
  4673. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4674. struct dp_peer *peer = NULL;
  4675. peer = dp_peer_find_hash_find(soc, peer_addr, 0, DP_VDEV_ALL,
  4676. DP_MOD_ID_CDP);
  4677. if (peer) {
  4678. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4679. return true;
  4680. }
  4681. return false;
  4682. }
  4683. #endif
  4684. /**
  4685. * dp_peer_rxtid_stats: Retried Rx TID (REO queue) stats from HW
  4686. * @peer: DP peer handle
  4687. * @dp_stats_cmd_cb: REO command callback function
  4688. * @cb_ctxt: Callback context
  4689. *
  4690. * Return: count of tid stats cmd send succeeded
  4691. */
  4692. int dp_peer_rxtid_stats(struct dp_peer *peer,
  4693. dp_rxtid_stats_cmd_cb dp_stats_cmd_cb,
  4694. void *cb_ctxt)
  4695. {
  4696. struct dp_soc *soc = peer->vdev->pdev->soc;
  4697. struct hal_reo_cmd_params params;
  4698. int i;
  4699. int stats_cmd_sent_cnt = 0;
  4700. QDF_STATUS status;
  4701. if (!dp_stats_cmd_cb)
  4702. return stats_cmd_sent_cnt;
  4703. qdf_mem_zero(&params, sizeof(params));
  4704. for (i = 0; i < DP_MAX_TIDS; i++) {
  4705. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  4706. if (rx_tid->hw_qdesc_vaddr_unaligned) {
  4707. params.std.need_status = 1;
  4708. params.std.addr_lo =
  4709. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4710. params.std.addr_hi =
  4711. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4712. if (cb_ctxt) {
  4713. status = dp_reo_send_cmd(
  4714. soc, CMD_GET_QUEUE_STATS,
  4715. &params, dp_stats_cmd_cb,
  4716. cb_ctxt);
  4717. } else {
  4718. status = dp_reo_send_cmd(
  4719. soc, CMD_GET_QUEUE_STATS,
  4720. &params, dp_stats_cmd_cb,
  4721. rx_tid);
  4722. }
  4723. if (QDF_IS_STATUS_SUCCESS(status))
  4724. stats_cmd_sent_cnt++;
  4725. /* Flush REO descriptor from HW cache to update stats
  4726. * in descriptor memory. This is to help debugging */
  4727. qdf_mem_zero(&params, sizeof(params));
  4728. params.std.need_status = 0;
  4729. params.std.addr_lo =
  4730. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4731. params.std.addr_hi =
  4732. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4733. params.u.fl_cache_params.flush_no_inval = 1;
  4734. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  4735. NULL);
  4736. }
  4737. }
  4738. return stats_cmd_sent_cnt;
  4739. }
  4740. QDF_STATUS
  4741. dp_set_michael_key(struct cdp_soc_t *soc,
  4742. uint8_t vdev_id,
  4743. uint8_t *peer_mac,
  4744. bool is_unicast, uint32_t *key)
  4745. {
  4746. uint8_t sec_index = is_unicast ? 1 : 0;
  4747. struct dp_peer *peer =
  4748. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  4749. peer_mac, 0, vdev_id,
  4750. DP_MOD_ID_CDP);
  4751. if (!peer) {
  4752. dp_peer_err("%pK: peer not found ", soc);
  4753. return QDF_STATUS_E_FAILURE;
  4754. }
  4755. qdf_mem_copy(&peer->txrx_peer->security[sec_index].michael_key[0],
  4756. key, IEEE80211_WEP_MICLEN);
  4757. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4758. return QDF_STATUS_SUCCESS;
  4759. }
  4760. /**
  4761. * dp_vdev_bss_peer_ref_n_get: Get bss peer of a vdev
  4762. * @soc: DP soc
  4763. * @vdev: vdev
  4764. * @mod_id: id of module requesting reference
  4765. *
  4766. * Return: VDEV BSS peer
  4767. */
  4768. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  4769. struct dp_vdev *vdev,
  4770. enum dp_mod_id mod_id)
  4771. {
  4772. struct dp_peer *peer = NULL;
  4773. qdf_spin_lock_bh(&vdev->peer_list_lock);
  4774. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  4775. if (peer->bss_peer)
  4776. break;
  4777. }
  4778. if (!peer) {
  4779. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4780. return NULL;
  4781. }
  4782. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  4783. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4784. return peer;
  4785. }
  4786. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4787. return peer;
  4788. }
  4789. /**
  4790. * dp_sta_vdev_self_peer_ref_n_get: Get self peer of sta vdev
  4791. * @soc: DP soc
  4792. * @vdev: vdev
  4793. * @mod_id: id of module requesting reference
  4794. *
  4795. * Return: VDEV self peer
  4796. */
  4797. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  4798. struct dp_vdev *vdev,
  4799. enum dp_mod_id mod_id)
  4800. {
  4801. struct dp_peer *peer;
  4802. if (vdev->opmode != wlan_op_mode_sta)
  4803. return NULL;
  4804. qdf_spin_lock_bh(&vdev->peer_list_lock);
  4805. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  4806. if (peer->sta_self_peer)
  4807. break;
  4808. }
  4809. if (!peer) {
  4810. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4811. return NULL;
  4812. }
  4813. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  4814. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4815. return peer;
  4816. }
  4817. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  4818. return peer;
  4819. }
  4820. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  4821. void dp_dump_rx_reo_queue_info(
  4822. struct dp_soc *soc, void *cb_ctxt, union hal_reo_status *reo_status)
  4823. {
  4824. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  4825. if (!rx_tid)
  4826. return;
  4827. if (reo_status->fl_cache_status.header.status !=
  4828. HAL_REO_CMD_SUCCESS) {
  4829. dp_err_rl("Rx tid REO HW desc flush failed(%d)",
  4830. reo_status->rx_queue_status.header.status);
  4831. return;
  4832. }
  4833. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4834. hal_dump_rx_reo_queue_desc(rx_tid->hw_qdesc_vaddr_aligned);
  4835. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4836. }
  4837. void dp_send_cache_flush_for_rx_tid(
  4838. struct dp_soc *soc, struct dp_peer *peer)
  4839. {
  4840. int i;
  4841. struct dp_rx_tid *rx_tid;
  4842. struct hal_reo_cmd_params params;
  4843. if (!peer) {
  4844. dp_err_rl("Peer is NULL");
  4845. return;
  4846. }
  4847. for (i = 0; i < DP_MAX_TIDS; i++) {
  4848. rx_tid = &peer->rx_tid[i];
  4849. if (!rx_tid)
  4850. continue;
  4851. qdf_spin_lock_bh(&rx_tid->tid_lock);
  4852. if (rx_tid->hw_qdesc_vaddr_aligned) {
  4853. qdf_mem_zero(&params, sizeof(params));
  4854. params.std.need_status = 1;
  4855. params.std.addr_lo =
  4856. rx_tid->hw_qdesc_paddr & 0xffffffff;
  4857. params.std.addr_hi =
  4858. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  4859. params.u.fl_cache_params.flush_no_inval = 0;
  4860. if (QDF_STATUS_SUCCESS !=
  4861. dp_reo_send_cmd(
  4862. soc, CMD_FLUSH_CACHE,
  4863. &params, dp_dump_rx_reo_queue_info,
  4864. (void *)rx_tid)) {
  4865. dp_err_rl("cache flush send failed tid %d",
  4866. rx_tid->tid);
  4867. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4868. break;
  4869. }
  4870. }
  4871. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  4872. }
  4873. }
  4874. void dp_get_rx_reo_queue_info(
  4875. struct cdp_soc_t *soc_hdl, uint8_t vdev_id)
  4876. {
  4877. struct dp_soc *soc = (struct dp_soc *)soc_hdl;
  4878. struct dp_vdev *vdev = dp_vdev_get_ref_by_id(soc, vdev_id,
  4879. DP_MOD_ID_GENERIC_STATS);
  4880. struct dp_peer *peer = NULL;
  4881. if (!vdev) {
  4882. dp_err_rl("vdev is null for vdev_id: %u", vdev_id);
  4883. goto failed;
  4884. }
  4885. peer = dp_vdev_bss_peer_ref_n_get(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  4886. if (!peer) {
  4887. dp_err_rl("Peer is NULL");
  4888. goto failed;
  4889. }
  4890. dp_send_cache_flush_for_rx_tid(soc, peer);
  4891. failed:
  4892. if (peer)
  4893. dp_peer_unref_delete(peer, DP_MOD_ID_GENERIC_STATS);
  4894. if (vdev)
  4895. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_GENERIC_STATS);
  4896. }
  4897. #endif /* DUMP_REO_QUEUE_INFO_IN_DDR */
  4898. void dp_peer_flush_frags(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  4899. uint8_t *peer_mac)
  4900. {
  4901. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  4902. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(soc, peer_mac, 0,
  4903. vdev_id,
  4904. DP_MOD_ID_CDP);
  4905. struct dp_txrx_peer *txrx_peer;
  4906. uint8_t tid;
  4907. struct dp_rx_tid_defrag *defrag_rx_tid;
  4908. if (!peer)
  4909. return;
  4910. if (!peer->txrx_peer)
  4911. goto fail;
  4912. dp_info("Flushing fragments for peer " QDF_MAC_ADDR_FMT,
  4913. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  4914. txrx_peer = peer->txrx_peer;
  4915. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  4916. defrag_rx_tid = &txrx_peer->rx_tid[tid];
  4917. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  4918. dp_rx_defrag_waitlist_remove(txrx_peer, tid);
  4919. dp_rx_reorder_flush_frag(txrx_peer, tid);
  4920. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  4921. }
  4922. fail:
  4923. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  4924. }
  4925. /*
  4926. * dp_peer_find_by_id_valid - check if peer exists for given id
  4927. * @soc: core DP soc context
  4928. * @peer_id: peer id from peer object can be retrieved
  4929. *
  4930. * Return: true if peer exists of false otherwise
  4931. */
  4932. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id)
  4933. {
  4934. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id,
  4935. DP_MOD_ID_HTT);
  4936. if (peer) {
  4937. /*
  4938. * Decrement the peer ref which is taken as part of
  4939. * dp_peer_get_ref_by_id if PEER_LOCK_REF_PROTECT is enabled
  4940. */
  4941. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  4942. return true;
  4943. }
  4944. return false;
  4945. }
  4946. qdf_export_symbol(dp_peer_find_by_id_valid);