dp_peer.c 143 KB

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