dp_peer.c 128 KB

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