dp_peer.c 108 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2023 Qualcomm Innovation Center, Inc. All rights reserved.
  4. *
  5. * Permission to use, copy, modify, and/or distribute this software for
  6. * any purpose with or without fee is hereby granted, provided that the
  7. * above copyright notice and this permission notice appear in all
  8. * copies.
  9. *
  10. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  11. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  12. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  13. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  14. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  15. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  16. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  17. * PERFORMANCE OF THIS SOFTWARE.
  18. */
  19. #include <qdf_types.h>
  20. #include <qdf_lock.h>
  21. #include <hal_hw_headers.h>
  22. #include "dp_htt.h"
  23. #include "dp_types.h"
  24. #include "dp_internal.h"
  25. #include "dp_peer.h"
  26. #include "dp_rx_defrag.h"
  27. #include "dp_rx.h"
  28. #include <hal_api.h>
  29. #include <hal_reo.h>
  30. #include <cdp_txrx_handle.h>
  31. #include <wlan_cfg.h>
  32. #ifdef WIFI_MONITOR_SUPPORT
  33. #include <dp_mon.h>
  34. #endif
  35. #ifdef FEATURE_WDS
  36. #include "dp_txrx_wds.h"
  37. #endif
  38. #include <qdf_module.h>
  39. #ifdef QCA_PEER_EXT_STATS
  40. #include "dp_hist.h"
  41. #endif
  42. #ifdef BYPASS_OL_OPS
  43. #include <target_if_dp.h>
  44. #endif
  45. #if defined(WLAN_FEATURE_11BE_MLO) && defined(DP_MLO_LINK_STATS_SUPPORT)
  46. #include "reg_services_common.h"
  47. #endif
  48. #ifdef FEATURE_AST
  49. #ifdef BYPASS_OL_OPS
  50. /**
  51. * dp_add_wds_entry_wrapper() - Add new AST entry for the wds station
  52. * @soc: DP soc structure pointer
  53. * @peer: dp peer structure
  54. * @dest_macaddr: MAC address of ast node
  55. * @flags: wds or hmwds
  56. * @type: type from enum cdp_txrx_ast_entry_type
  57. *
  58. * This API is used by WDS source port learning function to
  59. * add a new AST entry in the fw.
  60. *
  61. * Return: 0 on success, error code otherwise.
  62. */
  63. static int dp_add_wds_entry_wrapper(struct dp_soc *soc,
  64. struct dp_peer *peer,
  65. const uint8_t *dest_macaddr,
  66. uint32_t flags,
  67. uint8_t type)
  68. {
  69. QDF_STATUS status;
  70. status = target_if_add_wds_entry(soc->ctrl_psoc,
  71. peer->vdev->vdev_id,
  72. peer->mac_addr.raw,
  73. dest_macaddr,
  74. WMI_HOST_WDS_FLAG_STATIC,
  75. type);
  76. return qdf_status_to_os_return(status);
  77. }
  78. /**
  79. * dp_update_wds_entry_wrapper() - update an existing wds entry with new peer
  80. * @soc: DP soc structure pointer
  81. * @peer: dp peer structure
  82. * @dest_macaddr: MAC address of ast node
  83. * @flags: wds or hmwds
  84. *
  85. * This API is used by update the peer mac address for the ast
  86. * in the fw.
  87. *
  88. * Return: 0 on success, error code otherwise.
  89. */
  90. static int dp_update_wds_entry_wrapper(struct dp_soc *soc,
  91. struct dp_peer *peer,
  92. uint8_t *dest_macaddr,
  93. uint32_t flags)
  94. {
  95. QDF_STATUS status;
  96. status = target_if_update_wds_entry(soc->ctrl_psoc,
  97. peer->vdev->vdev_id,
  98. dest_macaddr,
  99. peer->mac_addr.raw,
  100. WMI_HOST_WDS_FLAG_STATIC);
  101. return qdf_status_to_os_return(status);
  102. }
  103. /**
  104. * dp_del_wds_entry_wrapper() - delete a WSD AST entry
  105. * @soc: DP soc structure pointer
  106. * @vdev_id: vdev_id
  107. * @wds_macaddr: MAC address of ast node
  108. * @type: type from enum cdp_txrx_ast_entry_type
  109. * @delete_in_fw: Flag to indicate if entry needs to be deleted in fw
  110. *
  111. * This API is used to delete an AST entry from fw
  112. *
  113. * Return: None
  114. */
  115. void dp_del_wds_entry_wrapper(struct dp_soc *soc,
  116. uint8_t vdev_id,
  117. uint8_t *wds_macaddr,
  118. uint8_t type,
  119. uint8_t delete_in_fw)
  120. {
  121. target_if_del_wds_entry(soc->ctrl_psoc, vdev_id,
  122. wds_macaddr, type, delete_in_fw);
  123. }
  124. #else
  125. static int dp_add_wds_entry_wrapper(struct dp_soc *soc,
  126. struct dp_peer *peer,
  127. const uint8_t *dest_macaddr,
  128. uint32_t flags,
  129. uint8_t type)
  130. {
  131. int status;
  132. status = soc->cdp_soc.ol_ops->peer_add_wds_entry(
  133. soc->ctrl_psoc,
  134. peer->vdev->vdev_id,
  135. peer->mac_addr.raw,
  136. peer->peer_id,
  137. dest_macaddr,
  138. peer->mac_addr.raw,
  139. flags,
  140. type);
  141. return status;
  142. }
  143. static int dp_update_wds_entry_wrapper(struct dp_soc *soc,
  144. struct dp_peer *peer,
  145. uint8_t *dest_macaddr,
  146. uint32_t flags)
  147. {
  148. int status;
  149. status = soc->cdp_soc.ol_ops->peer_update_wds_entry(
  150. soc->ctrl_psoc,
  151. peer->vdev->vdev_id,
  152. dest_macaddr,
  153. peer->mac_addr.raw,
  154. flags);
  155. return status;
  156. }
  157. void dp_del_wds_entry_wrapper(struct dp_soc *soc,
  158. uint8_t vdev_id,
  159. uint8_t *wds_macaddr,
  160. uint8_t type,
  161. uint8_t delete_in_fw)
  162. {
  163. soc->cdp_soc.ol_ops->peer_del_wds_entry(soc->ctrl_psoc,
  164. vdev_id,
  165. wds_macaddr,
  166. type,
  167. delete_in_fw);
  168. }
  169. #endif /* BYPASS_OL_OPS */
  170. #else
  171. void dp_del_wds_entry_wrapper(struct dp_soc *soc,
  172. uint8_t vdev_id,
  173. uint8_t *wds_macaddr,
  174. uint8_t type,
  175. uint8_t delete_in_fw)
  176. {
  177. }
  178. #endif /* FEATURE_AST */
  179. #ifdef FEATURE_WDS
  180. static inline bool
  181. dp_peer_ast_free_in_unmap_supported(struct dp_soc *soc,
  182. struct dp_ast_entry *ast_entry)
  183. {
  184. /* if peer map v2 is enabled we are not freeing ast entry
  185. * here and it is supposed to be freed in unmap event (after
  186. * we receive delete confirmation from target)
  187. *
  188. * if peer_id is invalid we did not get the peer map event
  189. * for the peer free ast entry from here only in this case
  190. */
  191. if ((ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC) &&
  192. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF))
  193. return true;
  194. return false;
  195. }
  196. #else
  197. static inline bool
  198. dp_peer_ast_free_in_unmap_supported(struct dp_soc *soc,
  199. struct dp_ast_entry *ast_entry)
  200. {
  201. return false;
  202. }
  203. void dp_soc_wds_attach(struct dp_soc *soc)
  204. {
  205. }
  206. void dp_soc_wds_detach(struct dp_soc *soc)
  207. {
  208. }
  209. #endif
  210. #ifdef QCA_SUPPORT_WDS_EXTENDED
  211. bool dp_peer_check_wds_ext_peer(struct dp_peer *peer)
  212. {
  213. struct dp_vdev *vdev = peer->vdev;
  214. struct dp_txrx_peer *txrx_peer;
  215. if (!vdev->wds_ext_enabled)
  216. return false;
  217. txrx_peer = dp_get_txrx_peer(peer);
  218. if (!txrx_peer)
  219. return false;
  220. if (qdf_atomic_test_bit(WDS_EXT_PEER_INIT_BIT,
  221. &txrx_peer->wds_ext.init))
  222. return true;
  223. return false;
  224. }
  225. #else
  226. bool dp_peer_check_wds_ext_peer(struct dp_peer *peer)
  227. {
  228. return false;
  229. }
  230. #endif
  231. QDF_STATUS dp_peer_ast_table_attach(struct dp_soc *soc)
  232. {
  233. uint32_t max_ast_index;
  234. max_ast_index = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  235. /* allocate ast_table for ast entry to ast_index map */
  236. dp_peer_info("\n%pK:<=== cfg max ast idx %d ====>", soc, max_ast_index);
  237. soc->ast_table = qdf_mem_malloc(max_ast_index *
  238. sizeof(struct dp_ast_entry *));
  239. if (!soc->ast_table) {
  240. dp_peer_err("%pK: ast_table memory allocation failed", soc);
  241. return QDF_STATUS_E_NOMEM;
  242. }
  243. return QDF_STATUS_SUCCESS; /* success */
  244. }
  245. /**
  246. * dp_find_peer_by_macaddr() - Finding the peer from mac address provided.
  247. * @soc: soc handle
  248. * @mac_addr: MAC address to be used to find peer
  249. * @vdev_id: VDEV id
  250. * @mod_id: MODULE ID
  251. *
  252. * Return: struct dp_peer
  253. */
  254. struct dp_peer *dp_find_peer_by_macaddr(struct dp_soc *soc, uint8_t *mac_addr,
  255. uint8_t vdev_id, enum dp_mod_id mod_id)
  256. {
  257. bool ast_ind_disable = wlan_cfg_get_ast_indication_disable(
  258. soc->wlan_cfg_ctx);
  259. struct cdp_peer_info peer_info = {0};
  260. if ((!soc->ast_offload_support) || (!ast_ind_disable)) {
  261. struct dp_ast_entry *ast_entry = NULL;
  262. uint16_t peer_id;
  263. qdf_spin_lock_bh(&soc->ast_lock);
  264. if (vdev_id == DP_VDEV_ALL)
  265. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  266. else
  267. ast_entry = dp_peer_ast_hash_find_by_vdevid
  268. (soc, mac_addr, vdev_id);
  269. if (!ast_entry) {
  270. qdf_spin_unlock_bh(&soc->ast_lock);
  271. dp_err("NULL ast entry");
  272. return NULL;
  273. }
  274. peer_id = ast_entry->peer_id;
  275. qdf_spin_unlock_bh(&soc->ast_lock);
  276. if (peer_id == HTT_INVALID_PEER)
  277. return NULL;
  278. return dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  279. }
  280. DP_PEER_INFO_PARAMS_INIT(&peer_info, vdev_id, mac_addr, false,
  281. CDP_WILD_PEER_TYPE);
  282. return dp_peer_hash_find_wrapper(soc, &peer_info, mod_id);
  283. }
  284. /**
  285. * dp_peer_find_map_attach() - allocate memory for peer_id_to_obj_map
  286. * @soc: soc handle
  287. *
  288. * return: QDF_STATUS
  289. */
  290. static QDF_STATUS dp_peer_find_map_attach(struct dp_soc *soc)
  291. {
  292. uint32_t max_peers, peer_map_size;
  293. max_peers = soc->max_peer_id;
  294. /* allocate the peer ID -> peer object map */
  295. dp_peer_info("\n%pK:<=== cfg max peer id %d ====>", soc, max_peers);
  296. peer_map_size = max_peers * sizeof(soc->peer_id_to_obj_map[0]);
  297. soc->peer_id_to_obj_map = qdf_mem_malloc(peer_map_size);
  298. if (!soc->peer_id_to_obj_map) {
  299. dp_peer_err("%pK: peer map memory allocation failed", soc);
  300. return QDF_STATUS_E_NOMEM;
  301. }
  302. /*
  303. * The peer_id_to_obj_map doesn't really need to be initialized,
  304. * since elements are only used after they have been individually
  305. * initialized.
  306. * However, it is convenient for debugging to have all elements
  307. * that are not in use set to 0.
  308. */
  309. qdf_mem_zero(soc->peer_id_to_obj_map, peer_map_size);
  310. qdf_spinlock_create(&soc->peer_map_lock);
  311. return QDF_STATUS_SUCCESS; /* success */
  312. }
  313. #define DP_AST_HASH_LOAD_MULT 2
  314. #define DP_AST_HASH_LOAD_SHIFT 0
  315. static inline uint32_t
  316. dp_peer_find_hash_index(struct dp_soc *soc,
  317. union dp_align_mac_addr *mac_addr)
  318. {
  319. uint32_t index;
  320. index =
  321. mac_addr->align2.bytes_ab ^
  322. mac_addr->align2.bytes_cd ^
  323. mac_addr->align2.bytes_ef;
  324. index ^= index >> soc->peer_hash.idx_bits;
  325. index &= soc->peer_hash.mask;
  326. return index;
  327. }
  328. struct dp_peer *dp_peer_find_hash_find(
  329. struct dp_soc *soc, uint8_t *peer_mac_addr,
  330. int mac_addr_is_aligned, uint8_t vdev_id,
  331. enum dp_mod_id mod_id)
  332. {
  333. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  334. uint32_t index;
  335. struct dp_peer *peer;
  336. if (!soc->peer_hash.bins)
  337. return NULL;
  338. if (mac_addr_is_aligned) {
  339. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  340. } else {
  341. qdf_mem_copy(
  342. &local_mac_addr_aligned.raw[0],
  343. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  344. mac_addr = &local_mac_addr_aligned;
  345. }
  346. index = dp_peer_find_hash_index(soc, mac_addr);
  347. qdf_spin_lock_bh(&soc->peer_hash_lock);
  348. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  349. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  350. ((peer->vdev->vdev_id == vdev_id) ||
  351. (vdev_id == DP_VDEV_ALL))) {
  352. /* take peer reference before returning */
  353. if (dp_peer_get_ref(soc, peer, mod_id) !=
  354. QDF_STATUS_SUCCESS)
  355. peer = NULL;
  356. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  357. return peer;
  358. }
  359. }
  360. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  361. return NULL; /* failure */
  362. }
  363. qdf_export_symbol(dp_peer_find_hash_find);
  364. #ifdef WLAN_FEATURE_11BE_MLO
  365. /**
  366. * dp_peer_find_hash_detach() - cleanup memory for peer_hash table
  367. * @soc: soc handle
  368. *
  369. * return: none
  370. */
  371. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  372. {
  373. if (soc->peer_hash.bins) {
  374. qdf_mem_free(soc->peer_hash.bins);
  375. soc->peer_hash.bins = NULL;
  376. qdf_spinlock_destroy(&soc->peer_hash_lock);
  377. }
  378. if (soc->arch_ops.mlo_peer_find_hash_detach)
  379. soc->arch_ops.mlo_peer_find_hash_detach(soc);
  380. }
  381. /**
  382. * dp_peer_find_hash_attach() - allocate memory for peer_hash table
  383. * @soc: soc handle
  384. *
  385. * return: QDF_STATUS
  386. */
  387. static QDF_STATUS dp_peer_find_hash_attach(struct dp_soc *soc)
  388. {
  389. int i, hash_elems, log2;
  390. /* allocate the peer MAC address -> peer object hash table */
  391. hash_elems = soc->max_peers;
  392. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  393. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  394. log2 = dp_log2_ceil(hash_elems);
  395. hash_elems = 1 << log2;
  396. soc->peer_hash.mask = hash_elems - 1;
  397. soc->peer_hash.idx_bits = log2;
  398. /* allocate an array of TAILQ peer object lists */
  399. soc->peer_hash.bins = qdf_mem_malloc(
  400. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  401. if (!soc->peer_hash.bins)
  402. return QDF_STATUS_E_NOMEM;
  403. for (i = 0; i < hash_elems; i++)
  404. TAILQ_INIT(&soc->peer_hash.bins[i]);
  405. qdf_spinlock_create(&soc->peer_hash_lock);
  406. if (soc->arch_ops.mlo_peer_find_hash_attach &&
  407. (soc->arch_ops.mlo_peer_find_hash_attach(soc) !=
  408. QDF_STATUS_SUCCESS)) {
  409. dp_peer_find_hash_detach(soc);
  410. return QDF_STATUS_E_NOMEM;
  411. }
  412. return QDF_STATUS_SUCCESS;
  413. }
  414. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  415. {
  416. unsigned index;
  417. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  418. if (peer->peer_type == CDP_LINK_PEER_TYPE) {
  419. qdf_spin_lock_bh(&soc->peer_hash_lock);
  420. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer,
  421. DP_MOD_ID_CONFIG))) {
  422. dp_err("fail to get peer ref:" QDF_MAC_ADDR_FMT,
  423. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  424. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  425. return;
  426. }
  427. /*
  428. * It is important to add the new peer at the tail of
  429. * peer list with the bin index. Together with having
  430. * the hash_find function search from head to tail,
  431. * this ensures that if two entries with the same MAC address
  432. * are stored, the one added first will be found first.
  433. */
  434. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer,
  435. hash_list_elem);
  436. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  437. } else if (peer->peer_type == CDP_MLD_PEER_TYPE) {
  438. if (soc->arch_ops.mlo_peer_find_hash_add)
  439. soc->arch_ops.mlo_peer_find_hash_add(soc, peer);
  440. } else {
  441. dp_err("unknown peer type %d", peer->peer_type);
  442. }
  443. }
  444. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  445. {
  446. unsigned index;
  447. struct dp_peer *tmppeer = NULL;
  448. int found = 0;
  449. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  450. if (peer->peer_type == CDP_LINK_PEER_TYPE) {
  451. /* Check if tail is not empty before delete*/
  452. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  453. qdf_spin_lock_bh(&soc->peer_hash_lock);
  454. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index],
  455. hash_list_elem) {
  456. if (tmppeer == peer) {
  457. found = 1;
  458. break;
  459. }
  460. }
  461. QDF_ASSERT(found);
  462. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer,
  463. hash_list_elem);
  464. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  465. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  466. } else if (peer->peer_type == CDP_MLD_PEER_TYPE) {
  467. if (soc->arch_ops.mlo_peer_find_hash_remove)
  468. soc->arch_ops.mlo_peer_find_hash_remove(soc, peer);
  469. } else {
  470. dp_err("unknown peer type %d", peer->peer_type);
  471. }
  472. }
  473. uint8_t dp_get_peer_link_id(struct dp_peer *peer)
  474. {
  475. uint8_t link_id;
  476. link_id = IS_MLO_DP_LINK_PEER(peer) ? peer->link_id + 1 : 0;
  477. if (link_id < 1 || link_id > DP_MAX_MLO_LINKS)
  478. link_id = 0;
  479. return link_id;
  480. }
  481. #else
  482. static QDF_STATUS dp_peer_find_hash_attach(struct dp_soc *soc)
  483. {
  484. int i, hash_elems, log2;
  485. /* allocate the peer MAC address -> peer object hash table */
  486. hash_elems = soc->max_peers;
  487. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  488. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  489. log2 = dp_log2_ceil(hash_elems);
  490. hash_elems = 1 << log2;
  491. soc->peer_hash.mask = hash_elems - 1;
  492. soc->peer_hash.idx_bits = log2;
  493. /* allocate an array of TAILQ peer object lists */
  494. soc->peer_hash.bins = qdf_mem_malloc(
  495. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  496. if (!soc->peer_hash.bins)
  497. return QDF_STATUS_E_NOMEM;
  498. for (i = 0; i < hash_elems; i++)
  499. TAILQ_INIT(&soc->peer_hash.bins[i]);
  500. qdf_spinlock_create(&soc->peer_hash_lock);
  501. return QDF_STATUS_SUCCESS;
  502. }
  503. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  504. {
  505. if (soc->peer_hash.bins) {
  506. qdf_mem_free(soc->peer_hash.bins);
  507. soc->peer_hash.bins = NULL;
  508. qdf_spinlock_destroy(&soc->peer_hash_lock);
  509. }
  510. }
  511. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  512. {
  513. unsigned index;
  514. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  515. qdf_spin_lock_bh(&soc->peer_hash_lock);
  516. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  517. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT,
  518. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  519. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  520. return;
  521. }
  522. /*
  523. * It is important to add the new peer at the tail of the peer list
  524. * with the bin index. Together with having the hash_find function
  525. * search from head to tail, this ensures that if two entries with
  526. * the same MAC address are stored, the one added first will be
  527. * found first.
  528. */
  529. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer, hash_list_elem);
  530. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  531. }
  532. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  533. {
  534. unsigned index;
  535. struct dp_peer *tmppeer = NULL;
  536. int found = 0;
  537. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  538. /* Check if tail is not empty before delete*/
  539. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  540. qdf_spin_lock_bh(&soc->peer_hash_lock);
  541. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index], hash_list_elem) {
  542. if (tmppeer == peer) {
  543. found = 1;
  544. break;
  545. }
  546. }
  547. QDF_ASSERT(found);
  548. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer, hash_list_elem);
  549. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  550. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  551. }
  552. #endif/* WLAN_FEATURE_11BE_MLO */
  553. void dp_peer_vdev_list_add(struct dp_soc *soc, struct dp_vdev *vdev,
  554. struct dp_peer *peer)
  555. {
  556. /* only link peer will be added to vdev peer list */
  557. if (IS_MLO_DP_MLD_PEER(peer))
  558. return;
  559. qdf_spin_lock_bh(&vdev->peer_list_lock);
  560. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  561. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT,
  562. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  563. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  564. return;
  565. }
  566. /* add this peer into the vdev's list */
  567. if (wlan_op_mode_sta == vdev->opmode)
  568. TAILQ_INSERT_HEAD(&vdev->peer_list, peer, peer_list_elem);
  569. else
  570. TAILQ_INSERT_TAIL(&vdev->peer_list, peer, peer_list_elem);
  571. vdev->num_peers++;
  572. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  573. }
  574. void dp_peer_vdev_list_remove(struct dp_soc *soc, struct dp_vdev *vdev,
  575. struct dp_peer *peer)
  576. {
  577. uint8_t found = 0;
  578. struct dp_peer *tmppeer = NULL;
  579. /* only link peer will be added to vdev peer list */
  580. if (IS_MLO_DP_MLD_PEER(peer))
  581. return;
  582. qdf_spin_lock_bh(&vdev->peer_list_lock);
  583. TAILQ_FOREACH(tmppeer, &peer->vdev->peer_list, peer_list_elem) {
  584. if (tmppeer == peer) {
  585. found = 1;
  586. break;
  587. }
  588. }
  589. if (found) {
  590. TAILQ_REMOVE(&peer->vdev->peer_list, peer,
  591. peer_list_elem);
  592. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  593. vdev->num_peers--;
  594. } else {
  595. /*Ignoring the remove operation as peer not found*/
  596. dp_peer_debug("%pK: peer:%pK not found in vdev:%pK peerlist:%pK"
  597. , soc, peer, vdev, &peer->vdev->peer_list);
  598. }
  599. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  600. }
  601. void dp_txrx_peer_attach_add(struct dp_soc *soc,
  602. struct dp_peer *peer,
  603. struct dp_txrx_peer *txrx_peer)
  604. {
  605. qdf_spin_lock_bh(&soc->peer_map_lock);
  606. peer->txrx_peer = txrx_peer;
  607. txrx_peer->bss_peer = peer->bss_peer;
  608. if (peer->peer_id == HTT_INVALID_PEER) {
  609. qdf_spin_unlock_bh(&soc->peer_map_lock);
  610. return;
  611. }
  612. txrx_peer->peer_id = peer->peer_id;
  613. QDF_ASSERT(soc->peer_id_to_obj_map[peer->peer_id]);
  614. qdf_spin_unlock_bh(&soc->peer_map_lock);
  615. }
  616. void dp_peer_find_id_to_obj_add(struct dp_soc *soc,
  617. struct dp_peer *peer,
  618. uint16_t peer_id)
  619. {
  620. QDF_ASSERT(peer_id <= soc->max_peer_id);
  621. qdf_spin_lock_bh(&soc->peer_map_lock);
  622. peer->peer_id = peer_id;
  623. if (QDF_IS_STATUS_ERROR(dp_peer_get_ref(soc, peer, DP_MOD_ID_CONFIG))) {
  624. dp_err("unable to get peer ref at MAP mac: "QDF_MAC_ADDR_FMT" peer_id %u",
  625. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer_id);
  626. qdf_spin_unlock_bh(&soc->peer_map_lock);
  627. return;
  628. }
  629. if (!soc->peer_id_to_obj_map[peer_id]) {
  630. soc->peer_id_to_obj_map[peer_id] = peer;
  631. if (peer->txrx_peer)
  632. peer->txrx_peer->peer_id = peer_id;
  633. } else {
  634. /* Peer map event came for peer_id which
  635. * is already mapped, this is not expected
  636. */
  637. dp_err("peer %pK(" QDF_MAC_ADDR_FMT ")map failed, id %d mapped to peer %pK",
  638. peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer_id,
  639. soc->peer_id_to_obj_map[peer_id]);
  640. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  641. qdf_assert_always(0);
  642. }
  643. qdf_spin_unlock_bh(&soc->peer_map_lock);
  644. }
  645. void dp_peer_find_id_to_obj_remove(struct dp_soc *soc,
  646. uint16_t peer_id)
  647. {
  648. struct dp_peer *peer = NULL;
  649. QDF_ASSERT(peer_id <= soc->max_peer_id);
  650. qdf_spin_lock_bh(&soc->peer_map_lock);
  651. peer = soc->peer_id_to_obj_map[peer_id];
  652. if (!peer) {
  653. dp_err("unable to get peer during peer id obj map remove");
  654. qdf_spin_unlock_bh(&soc->peer_map_lock);
  655. return;
  656. }
  657. peer->peer_id = HTT_INVALID_PEER;
  658. if (peer->txrx_peer)
  659. peer->txrx_peer->peer_id = HTT_INVALID_PEER;
  660. soc->peer_id_to_obj_map[peer_id] = NULL;
  661. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  662. qdf_spin_unlock_bh(&soc->peer_map_lock);
  663. }
  664. #ifdef FEATURE_MEC
  665. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc)
  666. {
  667. int log2, hash_elems, i;
  668. log2 = dp_log2_ceil(DP_PEER_MAX_MEC_IDX);
  669. hash_elems = 1 << log2;
  670. soc->mec_hash.mask = hash_elems - 1;
  671. soc->mec_hash.idx_bits = log2;
  672. dp_peer_info("%pK: max mec index: %d",
  673. soc, DP_PEER_MAX_MEC_IDX);
  674. /* allocate an array of TAILQ mec object lists */
  675. soc->mec_hash.bins = qdf_mem_malloc(hash_elems *
  676. sizeof(TAILQ_HEAD(anonymous_tail_q,
  677. dp_mec_entry)));
  678. if (!soc->mec_hash.bins)
  679. return QDF_STATUS_E_NOMEM;
  680. for (i = 0; i < hash_elems; i++)
  681. TAILQ_INIT(&soc->mec_hash.bins[i]);
  682. return QDF_STATUS_SUCCESS;
  683. }
  684. /**
  685. * dp_peer_mec_hash_index() - Compute the MEC hash from MAC address
  686. * @soc: SoC handle
  687. * @mac_addr: MAC address
  688. *
  689. * Return: MEC hash
  690. */
  691. static inline uint32_t dp_peer_mec_hash_index(struct dp_soc *soc,
  692. union dp_align_mac_addr *mac_addr)
  693. {
  694. uint32_t index;
  695. index =
  696. mac_addr->align2.bytes_ab ^
  697. mac_addr->align2.bytes_cd ^
  698. mac_addr->align2.bytes_ef;
  699. index ^= index >> soc->mec_hash.idx_bits;
  700. index &= soc->mec_hash.mask;
  701. return index;
  702. }
  703. struct dp_mec_entry *dp_peer_mec_hash_find_by_pdevid(struct dp_soc *soc,
  704. uint8_t pdev_id,
  705. uint8_t *mec_mac_addr)
  706. {
  707. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  708. uint32_t index;
  709. struct dp_mec_entry *mecentry;
  710. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  711. mec_mac_addr, QDF_MAC_ADDR_SIZE);
  712. mac_addr = &local_mac_addr_aligned;
  713. index = dp_peer_mec_hash_index(soc, mac_addr);
  714. TAILQ_FOREACH(mecentry, &soc->mec_hash.bins[index], hash_list_elem) {
  715. if ((pdev_id == mecentry->pdev_id) &&
  716. !dp_peer_find_mac_addr_cmp(mac_addr, &mecentry->mac_addr))
  717. return mecentry;
  718. }
  719. return NULL;
  720. }
  721. /**
  722. * dp_peer_mec_hash_add() - Add MEC entry into hash table
  723. * @soc: SoC handle
  724. * @mecentry: MEC entry
  725. *
  726. * This function adds the MEC entry into SoC MEC hash table
  727. *
  728. * Return: None
  729. */
  730. static inline void dp_peer_mec_hash_add(struct dp_soc *soc,
  731. struct dp_mec_entry *mecentry)
  732. {
  733. uint32_t index;
  734. index = dp_peer_mec_hash_index(soc, &mecentry->mac_addr);
  735. qdf_spin_lock_bh(&soc->mec_lock);
  736. TAILQ_INSERT_TAIL(&soc->mec_hash.bins[index], mecentry, hash_list_elem);
  737. qdf_spin_unlock_bh(&soc->mec_lock);
  738. }
  739. QDF_STATUS dp_peer_mec_add_entry(struct dp_soc *soc,
  740. struct dp_vdev *vdev,
  741. uint8_t *mac_addr)
  742. {
  743. struct dp_mec_entry *mecentry = NULL;
  744. struct dp_pdev *pdev = NULL;
  745. if (!vdev) {
  746. dp_peer_err("%pK: Peers vdev is NULL", soc);
  747. return QDF_STATUS_E_INVAL;
  748. }
  749. pdev = vdev->pdev;
  750. if (qdf_unlikely(qdf_atomic_read(&soc->mec_cnt) >=
  751. DP_PEER_MAX_MEC_ENTRY)) {
  752. dp_peer_warn("%pK: max MEC entry limit reached mac_addr: "
  753. QDF_MAC_ADDR_FMT, soc, QDF_MAC_ADDR_REF(mac_addr));
  754. return QDF_STATUS_E_NOMEM;
  755. }
  756. qdf_spin_lock_bh(&soc->mec_lock);
  757. mecentry = dp_peer_mec_hash_find_by_pdevid(soc, pdev->pdev_id,
  758. mac_addr);
  759. if (qdf_likely(mecentry)) {
  760. mecentry->is_active = TRUE;
  761. qdf_spin_unlock_bh(&soc->mec_lock);
  762. return QDF_STATUS_E_ALREADY;
  763. }
  764. qdf_spin_unlock_bh(&soc->mec_lock);
  765. dp_peer_debug("%pK: pdevid: %u vdev: %u type: MEC mac_addr: "
  766. QDF_MAC_ADDR_FMT,
  767. soc, pdev->pdev_id, vdev->vdev_id,
  768. QDF_MAC_ADDR_REF(mac_addr));
  769. mecentry = (struct dp_mec_entry *)
  770. qdf_mem_malloc(sizeof(struct dp_mec_entry));
  771. if (qdf_unlikely(!mecentry)) {
  772. dp_peer_err("%pK: fail to allocate mecentry", soc);
  773. return QDF_STATUS_E_NOMEM;
  774. }
  775. qdf_copy_macaddr((struct qdf_mac_addr *)&mecentry->mac_addr.raw[0],
  776. (struct qdf_mac_addr *)mac_addr);
  777. mecentry->pdev_id = pdev->pdev_id;
  778. mecentry->vdev_id = vdev->vdev_id;
  779. mecentry->is_active = TRUE;
  780. dp_peer_mec_hash_add(soc, mecentry);
  781. qdf_atomic_inc(&soc->mec_cnt);
  782. DP_STATS_INC(soc, mec.added, 1);
  783. return QDF_STATUS_SUCCESS;
  784. }
  785. void dp_peer_mec_detach_entry(struct dp_soc *soc, struct dp_mec_entry *mecentry,
  786. void *ptr)
  787. {
  788. uint32_t index = dp_peer_mec_hash_index(soc, &mecentry->mac_addr);
  789. TAILQ_HEAD(, dp_mec_entry) * free_list = ptr;
  790. TAILQ_REMOVE(&soc->mec_hash.bins[index], mecentry,
  791. hash_list_elem);
  792. TAILQ_INSERT_TAIL(free_list, mecentry, hash_list_elem);
  793. }
  794. void dp_peer_mec_free_list(struct dp_soc *soc, void *ptr)
  795. {
  796. struct dp_mec_entry *mecentry, *mecentry_next;
  797. TAILQ_HEAD(, dp_mec_entry) * free_list = ptr;
  798. TAILQ_FOREACH_SAFE(mecentry, free_list, hash_list_elem,
  799. mecentry_next) {
  800. dp_peer_debug("%pK: MEC delete for mac_addr " QDF_MAC_ADDR_FMT,
  801. soc, QDF_MAC_ADDR_REF(&mecentry->mac_addr));
  802. qdf_mem_free(mecentry);
  803. qdf_atomic_dec(&soc->mec_cnt);
  804. DP_STATS_INC(soc, mec.deleted, 1);
  805. }
  806. }
  807. void dp_peer_mec_hash_detach(struct dp_soc *soc)
  808. {
  809. dp_peer_mec_flush_entries(soc);
  810. qdf_mem_free(soc->mec_hash.bins);
  811. soc->mec_hash.bins = NULL;
  812. }
  813. void dp_peer_mec_spinlock_destroy(struct dp_soc *soc)
  814. {
  815. qdf_spinlock_destroy(&soc->mec_lock);
  816. }
  817. void dp_peer_mec_spinlock_create(struct dp_soc *soc)
  818. {
  819. qdf_spinlock_create(&soc->mec_lock);
  820. }
  821. #else
  822. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc)
  823. {
  824. return QDF_STATUS_SUCCESS;
  825. }
  826. void dp_peer_mec_hash_detach(struct dp_soc *soc)
  827. {
  828. }
  829. #endif
  830. #ifdef FEATURE_AST
  831. #ifdef WLAN_FEATURE_11BE_MLO
  832. /**
  833. * dp_peer_exist_on_pdev() - check if peer with mac address exist on pdev
  834. *
  835. * @soc: Datapath SOC handle
  836. * @peer_mac_addr: peer mac address
  837. * @mac_addr_is_aligned: is mac address aligned
  838. * @pdev: Datapath PDEV handle
  839. *
  840. * Return: true if peer found else return false
  841. */
  842. static bool dp_peer_exist_on_pdev(struct dp_soc *soc,
  843. uint8_t *peer_mac_addr,
  844. int mac_addr_is_aligned,
  845. struct dp_pdev *pdev)
  846. {
  847. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  848. unsigned int index;
  849. struct dp_peer *peer;
  850. bool found = false;
  851. if (mac_addr_is_aligned) {
  852. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  853. } else {
  854. qdf_mem_copy(
  855. &local_mac_addr_aligned.raw[0],
  856. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  857. mac_addr = &local_mac_addr_aligned;
  858. }
  859. index = dp_peer_find_hash_index(soc, mac_addr);
  860. qdf_spin_lock_bh(&soc->peer_hash_lock);
  861. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  862. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  863. (peer->vdev->pdev == pdev)) {
  864. found = true;
  865. break;
  866. }
  867. }
  868. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  869. if (found)
  870. return found;
  871. peer = dp_mld_peer_find_hash_find(soc, peer_mac_addr,
  872. mac_addr_is_aligned, DP_VDEV_ALL,
  873. DP_MOD_ID_CDP);
  874. if (peer) {
  875. if (peer->vdev->pdev == pdev)
  876. found = true;
  877. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  878. }
  879. return found;
  880. }
  881. #else
  882. static bool dp_peer_exist_on_pdev(struct dp_soc *soc,
  883. uint8_t *peer_mac_addr,
  884. int mac_addr_is_aligned,
  885. struct dp_pdev *pdev)
  886. {
  887. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  888. unsigned int index;
  889. struct dp_peer *peer;
  890. bool found = false;
  891. if (mac_addr_is_aligned) {
  892. mac_addr = (union dp_align_mac_addr *)peer_mac_addr;
  893. } else {
  894. qdf_mem_copy(
  895. &local_mac_addr_aligned.raw[0],
  896. peer_mac_addr, QDF_MAC_ADDR_SIZE);
  897. mac_addr = &local_mac_addr_aligned;
  898. }
  899. index = dp_peer_find_hash_index(soc, mac_addr);
  900. qdf_spin_lock_bh(&soc->peer_hash_lock);
  901. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  902. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  903. (peer->vdev->pdev == pdev)) {
  904. found = true;
  905. break;
  906. }
  907. }
  908. qdf_spin_unlock_bh(&soc->peer_hash_lock);
  909. return found;
  910. }
  911. #endif /* WLAN_FEATURE_11BE_MLO */
  912. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  913. {
  914. int i, hash_elems, log2;
  915. unsigned int max_ast_idx = wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx);
  916. hash_elems = ((max_ast_idx * DP_AST_HASH_LOAD_MULT) >>
  917. DP_AST_HASH_LOAD_SHIFT);
  918. log2 = dp_log2_ceil(hash_elems);
  919. hash_elems = 1 << log2;
  920. soc->ast_hash.mask = hash_elems - 1;
  921. soc->ast_hash.idx_bits = log2;
  922. dp_peer_info("%pK: ast hash_elems: %d, max_ast_idx: %d",
  923. soc, hash_elems, max_ast_idx);
  924. /* allocate an array of TAILQ peer object lists */
  925. soc->ast_hash.bins = qdf_mem_malloc(
  926. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q,
  927. dp_ast_entry)));
  928. if (!soc->ast_hash.bins)
  929. return QDF_STATUS_E_NOMEM;
  930. for (i = 0; i < hash_elems; i++)
  931. TAILQ_INIT(&soc->ast_hash.bins[i]);
  932. return QDF_STATUS_SUCCESS;
  933. }
  934. /**
  935. * dp_peer_ast_cleanup() - cleanup the references
  936. * @soc: SoC handle
  937. * @ast: ast entry
  938. *
  939. * Return: None
  940. */
  941. static inline void dp_peer_ast_cleanup(struct dp_soc *soc,
  942. struct dp_ast_entry *ast)
  943. {
  944. txrx_ast_free_cb cb = ast->callback;
  945. void *cookie = ast->cookie;
  946. dp_peer_debug("mac_addr: " QDF_MAC_ADDR_FMT ", cb: %pK, cookie: %pK",
  947. QDF_MAC_ADDR_REF(ast->mac_addr.raw), cb, cookie);
  948. /* Call the callbacks to free up the cookie */
  949. if (cb) {
  950. ast->callback = NULL;
  951. ast->cookie = NULL;
  952. cb(soc->ctrl_psoc,
  953. dp_soc_to_cdp_soc(soc),
  954. cookie,
  955. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  956. }
  957. }
  958. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  959. {
  960. unsigned int index;
  961. struct dp_ast_entry *ast, *ast_next;
  962. if (!soc->ast_hash.mask)
  963. return;
  964. if (!soc->ast_hash.bins)
  965. return;
  966. dp_peer_debug("%pK: num_ast_entries: %u", soc, soc->num_ast_entries);
  967. qdf_spin_lock_bh(&soc->ast_lock);
  968. for (index = 0; index <= soc->ast_hash.mask; index++) {
  969. if (!TAILQ_EMPTY(&soc->ast_hash.bins[index])) {
  970. TAILQ_FOREACH_SAFE(ast, &soc->ast_hash.bins[index],
  971. hash_list_elem, ast_next) {
  972. TAILQ_REMOVE(&soc->ast_hash.bins[index], ast,
  973. hash_list_elem);
  974. dp_peer_ast_cleanup(soc, ast);
  975. soc->num_ast_entries--;
  976. qdf_mem_free(ast);
  977. }
  978. }
  979. }
  980. qdf_spin_unlock_bh(&soc->ast_lock);
  981. qdf_mem_free(soc->ast_hash.bins);
  982. soc->ast_hash.bins = NULL;
  983. }
  984. /**
  985. * dp_peer_ast_hash_index() - Compute the AST hash from MAC address
  986. * @soc: SoC handle
  987. * @mac_addr: MAC address
  988. *
  989. * Return: AST hash
  990. */
  991. static inline uint32_t dp_peer_ast_hash_index(struct dp_soc *soc,
  992. union dp_align_mac_addr *mac_addr)
  993. {
  994. uint32_t index;
  995. index =
  996. mac_addr->align2.bytes_ab ^
  997. mac_addr->align2.bytes_cd ^
  998. mac_addr->align2.bytes_ef;
  999. index ^= index >> soc->ast_hash.idx_bits;
  1000. index &= soc->ast_hash.mask;
  1001. return index;
  1002. }
  1003. /**
  1004. * dp_peer_ast_hash_add() - Add AST entry into hash table
  1005. * @soc: SoC handle
  1006. * @ase: AST entry
  1007. *
  1008. * This function adds the AST entry into SoC AST hash table
  1009. * It assumes caller has taken the ast lock to protect the access to this table
  1010. *
  1011. * Return: None
  1012. */
  1013. static inline void dp_peer_ast_hash_add(struct dp_soc *soc,
  1014. struct dp_ast_entry *ase)
  1015. {
  1016. uint32_t index;
  1017. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  1018. TAILQ_INSERT_TAIL(&soc->ast_hash.bins[index], ase, hash_list_elem);
  1019. }
  1020. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  1021. struct dp_ast_entry *ase)
  1022. {
  1023. unsigned index;
  1024. struct dp_ast_entry *tmpase;
  1025. int found = 0;
  1026. if (soc->ast_offload_support && !soc->host_ast_db_enable)
  1027. return;
  1028. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  1029. /* Check if tail is not empty before delete*/
  1030. QDF_ASSERT(!TAILQ_EMPTY(&soc->ast_hash.bins[index]));
  1031. dp_peer_debug("ID: %u idx: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1032. ase->peer_id, index, QDF_MAC_ADDR_REF(ase->mac_addr.raw));
  1033. TAILQ_FOREACH(tmpase, &soc->ast_hash.bins[index], hash_list_elem) {
  1034. if (tmpase == ase) {
  1035. found = 1;
  1036. break;
  1037. }
  1038. }
  1039. QDF_ASSERT(found);
  1040. if (found)
  1041. TAILQ_REMOVE(&soc->ast_hash.bins[index], ase, hash_list_elem);
  1042. }
  1043. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  1044. uint8_t *ast_mac_addr,
  1045. uint8_t vdev_id)
  1046. {
  1047. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1048. uint32_t index;
  1049. struct dp_ast_entry *ase;
  1050. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1051. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1052. mac_addr = &local_mac_addr_aligned;
  1053. index = dp_peer_ast_hash_index(soc, mac_addr);
  1054. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1055. if ((vdev_id == ase->vdev_id) &&
  1056. !dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr)) {
  1057. return ase;
  1058. }
  1059. }
  1060. return NULL;
  1061. }
  1062. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1063. uint8_t *ast_mac_addr,
  1064. uint8_t pdev_id)
  1065. {
  1066. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1067. uint32_t index;
  1068. struct dp_ast_entry *ase;
  1069. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1070. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1071. mac_addr = &local_mac_addr_aligned;
  1072. index = dp_peer_ast_hash_index(soc, mac_addr);
  1073. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1074. if ((pdev_id == ase->pdev_id) &&
  1075. !dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr)) {
  1076. return ase;
  1077. }
  1078. }
  1079. return NULL;
  1080. }
  1081. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1082. uint8_t *ast_mac_addr)
  1083. {
  1084. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  1085. unsigned index;
  1086. struct dp_ast_entry *ase;
  1087. if (!soc->ast_hash.bins)
  1088. return NULL;
  1089. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  1090. ast_mac_addr, QDF_MAC_ADDR_SIZE);
  1091. mac_addr = &local_mac_addr_aligned;
  1092. index = dp_peer_ast_hash_index(soc, mac_addr);
  1093. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  1094. if (dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr) == 0) {
  1095. return ase;
  1096. }
  1097. }
  1098. return NULL;
  1099. }
  1100. /**
  1101. * dp_peer_map_ipa_evt() - Send peer map event to IPA
  1102. * @soc: SoC handle
  1103. * @peer: peer to which ast node belongs
  1104. * @ast_entry: AST entry
  1105. * @mac_addr: MAC address of ast node
  1106. *
  1107. * Return: None
  1108. */
  1109. #if defined(IPA_OFFLOAD) && defined(QCA_IPA_LL_TX_FLOW_CONTROL)
  1110. static inline
  1111. void dp_peer_map_ipa_evt(struct dp_soc *soc, struct dp_peer *peer,
  1112. struct dp_ast_entry *ast_entry, uint8_t *mac_addr)
  1113. {
  1114. if (ast_entry || (peer->vdev && peer->vdev->proxysta_vdev)) {
  1115. if (soc->cdp_soc.ol_ops->peer_map_event) {
  1116. soc->cdp_soc.ol_ops->peer_map_event(
  1117. soc->ctrl_psoc, ast_entry->peer_id,
  1118. ast_entry->ast_idx, ast_entry->vdev_id,
  1119. mac_addr, ast_entry->type, ast_entry->ast_hash_value);
  1120. }
  1121. } else {
  1122. dp_peer_info("%pK: AST entry not found", soc);
  1123. }
  1124. }
  1125. /**
  1126. * dp_peer_unmap_ipa_evt() - Send peer unmap event to IPA
  1127. * @soc: SoC handle
  1128. * @peer_id: Peerid
  1129. * @vdev_id: Vdev id
  1130. * @mac_addr: Peer mac address
  1131. *
  1132. * Return: None
  1133. */
  1134. static inline
  1135. void dp_peer_unmap_ipa_evt(struct dp_soc *soc, uint16_t peer_id,
  1136. uint8_t vdev_id, uint8_t *mac_addr)
  1137. {
  1138. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  1139. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  1140. peer_id, vdev_id,
  1141. mac_addr);
  1142. }
  1143. }
  1144. #else
  1145. static inline
  1146. void dp_peer_unmap_ipa_evt(struct dp_soc *soc, uint16_t peer_id,
  1147. uint8_t vdev_id, uint8_t *mac_addr)
  1148. {
  1149. }
  1150. static inline
  1151. void dp_peer_map_ipa_evt(struct dp_soc *soc, struct dp_peer *peer,
  1152. struct dp_ast_entry *ast_entry, uint8_t *mac_addr)
  1153. {
  1154. }
  1155. #endif
  1156. QDF_STATUS dp_peer_host_add_map_ast(struct dp_soc *soc, uint16_t peer_id,
  1157. uint8_t *mac_addr, uint16_t hw_peer_id,
  1158. uint8_t vdev_id, uint16_t ast_hash,
  1159. uint8_t is_wds)
  1160. {
  1161. struct dp_vdev *vdev;
  1162. struct dp_ast_entry *ast_entry;
  1163. enum cdp_txrx_ast_entry_type type;
  1164. struct dp_peer *peer;
  1165. struct dp_peer *old_peer;
  1166. QDF_STATUS status = QDF_STATUS_SUCCESS;
  1167. if (is_wds)
  1168. type = CDP_TXRX_AST_TYPE_WDS;
  1169. else
  1170. type = CDP_TXRX_AST_TYPE_STATIC;
  1171. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  1172. if (!peer) {
  1173. dp_peer_info("Peer not found soc:%pK: peer_id %d, peer_mac " QDF_MAC_ADDR_FMT ", vdev_id %d",
  1174. soc, peer_id,
  1175. QDF_MAC_ADDR_REF(mac_addr), vdev_id);
  1176. return QDF_STATUS_E_INVAL;
  1177. }
  1178. if (!is_wds && IS_MLO_DP_MLD_PEER(peer))
  1179. type = CDP_TXRX_AST_TYPE_MLD;
  1180. vdev = peer->vdev;
  1181. if (!vdev) {
  1182. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1183. status = QDF_STATUS_E_INVAL;
  1184. goto fail;
  1185. }
  1186. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1187. if (type != CDP_TXRX_AST_TYPE_STATIC &&
  1188. type != CDP_TXRX_AST_TYPE_MLD &&
  1189. type != CDP_TXRX_AST_TYPE_SELF) {
  1190. status = QDF_STATUS_E_BUSY;
  1191. goto fail;
  1192. }
  1193. }
  1194. dp_peer_debug("%pK: vdev: %u ast_entry->type: %d peer_mac: " QDF_MAC_ADDR_FMT " peer: %pK mac " QDF_MAC_ADDR_FMT,
  1195. soc, vdev->vdev_id, type,
  1196. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1197. QDF_MAC_ADDR_REF(mac_addr));
  1198. /*
  1199. * In MLO scenario, there is possibility for same mac address
  1200. * on both link mac address and MLD mac address.
  1201. * Duplicate AST map needs to be handled for non-mld type.
  1202. */
  1203. qdf_spin_lock_bh(&soc->ast_lock);
  1204. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1205. if (ast_entry && type != CDP_TXRX_AST_TYPE_MLD) {
  1206. dp_peer_debug("AST present ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1207. hw_peer_id, vdev_id,
  1208. QDF_MAC_ADDR_REF(mac_addr));
  1209. old_peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1210. DP_MOD_ID_AST);
  1211. if (!old_peer) {
  1212. dp_peer_info("Peer not found soc:%pK: peer_id %d, peer_mac " QDF_MAC_ADDR_FMT ", vdev_id %d",
  1213. soc, ast_entry->peer_id,
  1214. QDF_MAC_ADDR_REF(mac_addr), vdev_id);
  1215. qdf_spin_unlock_bh(&soc->ast_lock);
  1216. status = QDF_STATUS_E_INVAL;
  1217. goto fail;
  1218. }
  1219. dp_peer_unlink_ast_entry(soc, ast_entry, old_peer);
  1220. dp_peer_free_ast_entry(soc, ast_entry);
  1221. if (old_peer)
  1222. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1223. }
  1224. ast_entry = (struct dp_ast_entry *)
  1225. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1226. if (!ast_entry) {
  1227. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1228. qdf_spin_unlock_bh(&soc->ast_lock);
  1229. QDF_ASSERT(0);
  1230. status = QDF_STATUS_E_NOMEM;
  1231. goto fail;
  1232. }
  1233. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1234. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1235. ast_entry->is_mapped = false;
  1236. ast_entry->delete_in_progress = false;
  1237. ast_entry->next_hop = 0;
  1238. ast_entry->vdev_id = vdev->vdev_id;
  1239. ast_entry->type = type;
  1240. switch (type) {
  1241. case CDP_TXRX_AST_TYPE_STATIC:
  1242. if (peer->vdev->opmode == wlan_op_mode_sta)
  1243. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1244. break;
  1245. case CDP_TXRX_AST_TYPE_WDS:
  1246. ast_entry->next_hop = 1;
  1247. break;
  1248. case CDP_TXRX_AST_TYPE_MLD:
  1249. break;
  1250. default:
  1251. dp_peer_alert("%pK: Incorrect AST entry type", soc);
  1252. }
  1253. ast_entry->is_active = TRUE;
  1254. DP_STATS_INC(soc, ast.added, 1);
  1255. soc->num_ast_entries++;
  1256. dp_peer_ast_hash_add(soc, ast_entry);
  1257. ast_entry->ast_idx = hw_peer_id;
  1258. ast_entry->ast_hash_value = ast_hash;
  1259. ast_entry->peer_id = peer_id;
  1260. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1261. ase_list_elem);
  1262. dp_peer_map_ipa_evt(soc, peer, ast_entry, mac_addr);
  1263. qdf_spin_unlock_bh(&soc->ast_lock);
  1264. fail:
  1265. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  1266. return status;
  1267. }
  1268. /**
  1269. * dp_peer_map_ast() - Map the ast entry with HW AST Index
  1270. * @soc: SoC handle
  1271. * @peer: peer to which ast node belongs
  1272. * @mac_addr: MAC address of ast node
  1273. * @hw_peer_id: HW AST Index returned by target in peer map event
  1274. * @vdev_id: vdev id for VAP to which the peer belongs to
  1275. * @ast_hash: ast hash value in HW
  1276. * @is_wds: flag to indicate peer map event for WDS ast entry
  1277. *
  1278. * Return: QDF_STATUS code
  1279. */
  1280. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1281. struct dp_peer *peer,
  1282. uint8_t *mac_addr,
  1283. uint16_t hw_peer_id,
  1284. uint8_t vdev_id,
  1285. uint16_t ast_hash,
  1286. uint8_t is_wds)
  1287. {
  1288. struct dp_ast_entry *ast_entry = NULL;
  1289. enum cdp_txrx_ast_entry_type peer_type = CDP_TXRX_AST_TYPE_STATIC;
  1290. void *cookie = NULL;
  1291. txrx_ast_free_cb cb = NULL;
  1292. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1293. if (soc->ast_offload_support)
  1294. return QDF_STATUS_SUCCESS;
  1295. if (!peer) {
  1296. return QDF_STATUS_E_INVAL;
  1297. }
  1298. dp_peer_err("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  1299. soc, peer, hw_peer_id, vdev_id,
  1300. QDF_MAC_ADDR_REF(mac_addr));
  1301. qdf_spin_lock_bh(&soc->ast_lock);
  1302. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  1303. if (is_wds) {
  1304. /*
  1305. * In certain cases like Auth attack on a repeater
  1306. * can result in the number of ast_entries falling
  1307. * in the same hash bucket to exceed the max_skid
  1308. * length supported by HW in root AP. In these cases
  1309. * the FW will return the hw_peer_id (ast_index) as
  1310. * 0xffff indicating HW could not add the entry in
  1311. * its table. Host has to delete the entry from its
  1312. * table in these cases.
  1313. */
  1314. if (hw_peer_id == HTT_INVALID_PEER) {
  1315. DP_STATS_INC(soc, ast.map_err, 1);
  1316. if (ast_entry) {
  1317. if (ast_entry->is_mapped) {
  1318. soc->ast_table[ast_entry->ast_idx] =
  1319. NULL;
  1320. }
  1321. cb = ast_entry->callback;
  1322. cookie = ast_entry->cookie;
  1323. peer_type = ast_entry->type;
  1324. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1325. dp_peer_free_ast_entry(soc, ast_entry);
  1326. qdf_spin_unlock_bh(&soc->ast_lock);
  1327. if (cb) {
  1328. cb(soc->ctrl_psoc,
  1329. dp_soc_to_cdp_soc(soc),
  1330. cookie,
  1331. CDP_TXRX_AST_DELETED);
  1332. }
  1333. } else {
  1334. qdf_spin_unlock_bh(&soc->ast_lock);
  1335. 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",
  1336. peer, peer->peer_id,
  1337. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  1338. QDF_MAC_ADDR_REF(mac_addr),
  1339. vdev_id, is_wds);
  1340. }
  1341. err = QDF_STATUS_E_INVAL;
  1342. dp_hmwds_ast_add_notify(peer, mac_addr,
  1343. peer_type, err, true);
  1344. return err;
  1345. }
  1346. }
  1347. if (ast_entry) {
  1348. ast_entry->ast_idx = hw_peer_id;
  1349. soc->ast_table[hw_peer_id] = ast_entry;
  1350. ast_entry->is_active = TRUE;
  1351. peer_type = ast_entry->type;
  1352. ast_entry->ast_hash_value = ast_hash;
  1353. ast_entry->is_mapped = TRUE;
  1354. qdf_assert_always(ast_entry->peer_id == HTT_INVALID_PEER);
  1355. ast_entry->peer_id = peer->peer_id;
  1356. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1357. ase_list_elem);
  1358. }
  1359. if (ast_entry || (peer->vdev && peer->vdev->proxysta_vdev)) {
  1360. if (soc->cdp_soc.ol_ops->peer_map_event) {
  1361. soc->cdp_soc.ol_ops->peer_map_event(
  1362. soc->ctrl_psoc, peer->peer_id,
  1363. hw_peer_id, vdev_id,
  1364. mac_addr, peer_type, ast_hash);
  1365. }
  1366. } else {
  1367. dp_peer_err("%pK: AST entry not found", soc);
  1368. err = QDF_STATUS_E_NOENT;
  1369. }
  1370. qdf_spin_unlock_bh(&soc->ast_lock);
  1371. dp_hmwds_ast_add_notify(peer, mac_addr,
  1372. peer_type, err, true);
  1373. return err;
  1374. }
  1375. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  1376. struct cdp_soc *dp_soc,
  1377. void *cookie,
  1378. enum cdp_ast_free_status status)
  1379. {
  1380. struct dp_ast_free_cb_params *param =
  1381. (struct dp_ast_free_cb_params *)cookie;
  1382. struct dp_soc *soc = (struct dp_soc *)dp_soc;
  1383. struct dp_peer *peer = NULL;
  1384. QDF_STATUS err = QDF_STATUS_SUCCESS;
  1385. if (status != CDP_TXRX_AST_DELETED) {
  1386. qdf_mem_free(cookie);
  1387. return;
  1388. }
  1389. peer = dp_peer_find_hash_find(soc, &param->peer_mac_addr.raw[0],
  1390. 0, param->vdev_id, DP_MOD_ID_AST);
  1391. if (peer) {
  1392. err = dp_peer_add_ast(soc, peer,
  1393. &param->mac_addr.raw[0],
  1394. param->type,
  1395. param->flags);
  1396. dp_hmwds_ast_add_notify(peer, &param->mac_addr.raw[0],
  1397. param->type, err, false);
  1398. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1399. }
  1400. qdf_mem_free(cookie);
  1401. }
  1402. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1403. struct dp_peer *peer,
  1404. uint8_t *mac_addr,
  1405. enum cdp_txrx_ast_entry_type type,
  1406. uint32_t flags)
  1407. {
  1408. struct dp_ast_entry *ast_entry = NULL;
  1409. struct dp_vdev *vdev = NULL;
  1410. struct dp_pdev *pdev = NULL;
  1411. txrx_ast_free_cb cb = NULL;
  1412. void *cookie = NULL;
  1413. struct dp_peer *vap_bss_peer = NULL;
  1414. bool is_peer_found = false;
  1415. int status = 0;
  1416. if (soc->ast_offload_support)
  1417. return QDF_STATUS_E_INVAL;
  1418. vdev = peer->vdev;
  1419. if (!vdev) {
  1420. dp_peer_err("%pK: Peers vdev is NULL", soc);
  1421. QDF_ASSERT(0);
  1422. return QDF_STATUS_E_INVAL;
  1423. }
  1424. pdev = vdev->pdev;
  1425. is_peer_found = dp_peer_exist_on_pdev(soc, mac_addr, 0, pdev);
  1426. qdf_spin_lock_bh(&soc->ast_lock);
  1427. if (!dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE)) {
  1428. if ((type != CDP_TXRX_AST_TYPE_STATIC) &&
  1429. (type != CDP_TXRX_AST_TYPE_SELF)) {
  1430. qdf_spin_unlock_bh(&soc->ast_lock);
  1431. return QDF_STATUS_E_BUSY;
  1432. }
  1433. }
  1434. 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,
  1435. soc, pdev->pdev_id, vdev->vdev_id, type, flags,
  1436. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer,
  1437. QDF_MAC_ADDR_REF(mac_addr));
  1438. /* fw supports only 2 times the max_peers ast entries */
  1439. if (soc->num_ast_entries >=
  1440. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)) {
  1441. qdf_spin_unlock_bh(&soc->ast_lock);
  1442. dp_peer_err("%pK: Max ast entries reached", soc);
  1443. return QDF_STATUS_E_RESOURCES;
  1444. }
  1445. /* If AST entry already exists , just return from here
  1446. * ast entry with same mac address can exist on different radios
  1447. * if ast_override support is enabled use search by pdev in this
  1448. * case
  1449. */
  1450. if (soc->ast_override_support) {
  1451. ast_entry = dp_peer_ast_hash_find_by_pdevid(soc, mac_addr,
  1452. pdev->pdev_id);
  1453. if (ast_entry) {
  1454. qdf_spin_unlock_bh(&soc->ast_lock);
  1455. return QDF_STATUS_E_ALREADY;
  1456. }
  1457. if (is_peer_found) {
  1458. /* During WDS to static roaming, peer is added
  1459. * to the list before static AST entry create.
  1460. * So, allow AST entry for STATIC type
  1461. * even if peer is present
  1462. */
  1463. if (type != CDP_TXRX_AST_TYPE_STATIC) {
  1464. qdf_spin_unlock_bh(&soc->ast_lock);
  1465. return QDF_STATUS_E_ALREADY;
  1466. }
  1467. }
  1468. } else {
  1469. /* For HWMWDS_SEC entries can be added for same mac address
  1470. * do not check for existing entry
  1471. */
  1472. if (type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1473. goto add_ast_entry;
  1474. ast_entry = dp_peer_ast_hash_find_soc(soc, mac_addr);
  1475. if (ast_entry) {
  1476. if ((ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM) &&
  1477. !ast_entry->delete_in_progress) {
  1478. qdf_spin_unlock_bh(&soc->ast_lock);
  1479. return QDF_STATUS_E_ALREADY;
  1480. }
  1481. /* Add for HMWDS entry we cannot be ignored if there
  1482. * is AST entry with same mac address
  1483. *
  1484. * if ast entry exists with the requested mac address
  1485. * send a delete command and register callback which
  1486. * can take care of adding HMWDS ast entry on delete
  1487. * confirmation from target
  1488. */
  1489. if (type == CDP_TXRX_AST_TYPE_WDS_HM) {
  1490. struct dp_ast_free_cb_params *param = NULL;
  1491. if (ast_entry->type ==
  1492. CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1493. goto add_ast_entry;
  1494. /* save existing callback */
  1495. if (ast_entry->callback) {
  1496. cb = ast_entry->callback;
  1497. cookie = ast_entry->cookie;
  1498. }
  1499. param = qdf_mem_malloc(sizeof(*param));
  1500. if (!param) {
  1501. QDF_TRACE(QDF_MODULE_ID_TXRX,
  1502. QDF_TRACE_LEVEL_ERROR,
  1503. "Allocation failed");
  1504. qdf_spin_unlock_bh(&soc->ast_lock);
  1505. return QDF_STATUS_E_NOMEM;
  1506. }
  1507. qdf_mem_copy(&param->mac_addr.raw[0], mac_addr,
  1508. QDF_MAC_ADDR_SIZE);
  1509. qdf_mem_copy(&param->peer_mac_addr.raw[0],
  1510. &peer->mac_addr.raw[0],
  1511. QDF_MAC_ADDR_SIZE);
  1512. param->type = type;
  1513. param->flags = flags;
  1514. param->vdev_id = vdev->vdev_id;
  1515. ast_entry->callback = dp_peer_free_hmwds_cb;
  1516. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1517. ast_entry->type = type;
  1518. ast_entry->cookie = (void *)param;
  1519. if (!ast_entry->delete_in_progress)
  1520. dp_peer_del_ast(soc, ast_entry);
  1521. qdf_spin_unlock_bh(&soc->ast_lock);
  1522. /* Call the saved callback*/
  1523. if (cb) {
  1524. cb(soc->ctrl_psoc,
  1525. dp_soc_to_cdp_soc(soc),
  1526. cookie,
  1527. CDP_TXRX_AST_DELETE_IN_PROGRESS);
  1528. }
  1529. return QDF_STATUS_E_AGAIN;
  1530. }
  1531. qdf_spin_unlock_bh(&soc->ast_lock);
  1532. return QDF_STATUS_E_ALREADY;
  1533. }
  1534. }
  1535. add_ast_entry:
  1536. ast_entry = (struct dp_ast_entry *)
  1537. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  1538. if (!ast_entry) {
  1539. qdf_spin_unlock_bh(&soc->ast_lock);
  1540. dp_peer_err("%pK: fail to allocate ast_entry", soc);
  1541. QDF_ASSERT(0);
  1542. return QDF_STATUS_E_NOMEM;
  1543. }
  1544. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, QDF_MAC_ADDR_SIZE);
  1545. ast_entry->pdev_id = vdev->pdev->pdev_id;
  1546. ast_entry->is_mapped = false;
  1547. ast_entry->delete_in_progress = false;
  1548. ast_entry->peer_id = HTT_INVALID_PEER;
  1549. ast_entry->next_hop = 0;
  1550. ast_entry->vdev_id = vdev->vdev_id;
  1551. switch (type) {
  1552. case CDP_TXRX_AST_TYPE_STATIC:
  1553. peer->self_ast_entry = ast_entry;
  1554. ast_entry->type = CDP_TXRX_AST_TYPE_STATIC;
  1555. if (peer->vdev->opmode == wlan_op_mode_sta)
  1556. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  1557. break;
  1558. case CDP_TXRX_AST_TYPE_SELF:
  1559. peer->self_ast_entry = ast_entry;
  1560. ast_entry->type = CDP_TXRX_AST_TYPE_SELF;
  1561. break;
  1562. case CDP_TXRX_AST_TYPE_WDS:
  1563. ast_entry->next_hop = 1;
  1564. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1565. break;
  1566. case CDP_TXRX_AST_TYPE_WDS_HM:
  1567. ast_entry->next_hop = 1;
  1568. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM;
  1569. break;
  1570. case CDP_TXRX_AST_TYPE_WDS_HM_SEC:
  1571. ast_entry->next_hop = 1;
  1572. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM_SEC;
  1573. ast_entry->peer_id = peer->peer_id;
  1574. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry,
  1575. ase_list_elem);
  1576. break;
  1577. case CDP_TXRX_AST_TYPE_DA:
  1578. vap_bss_peer = dp_vdev_bss_peer_ref_n_get(soc, vdev,
  1579. DP_MOD_ID_AST);
  1580. if (!vap_bss_peer) {
  1581. qdf_spin_unlock_bh(&soc->ast_lock);
  1582. qdf_mem_free(ast_entry);
  1583. return QDF_STATUS_E_FAILURE;
  1584. }
  1585. peer = vap_bss_peer;
  1586. ast_entry->next_hop = 1;
  1587. ast_entry->type = CDP_TXRX_AST_TYPE_DA;
  1588. break;
  1589. default:
  1590. dp_peer_err("%pK: Incorrect AST entry type", soc);
  1591. }
  1592. ast_entry->is_active = TRUE;
  1593. DP_STATS_INC(soc, ast.added, 1);
  1594. soc->num_ast_entries++;
  1595. dp_peer_ast_hash_add(soc, ast_entry);
  1596. if ((ast_entry->type != CDP_TXRX_AST_TYPE_STATIC) &&
  1597. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF) &&
  1598. (ast_entry->type != CDP_TXRX_AST_TYPE_STA_BSS) &&
  1599. (ast_entry->type != CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1600. status = dp_add_wds_entry_wrapper(soc,
  1601. peer,
  1602. mac_addr,
  1603. flags,
  1604. ast_entry->type);
  1605. if (vap_bss_peer)
  1606. dp_peer_unref_delete(vap_bss_peer, DP_MOD_ID_AST);
  1607. qdf_spin_unlock_bh(&soc->ast_lock);
  1608. return qdf_status_from_os_return(status);
  1609. }
  1610. qdf_export_symbol(dp_peer_add_ast);
  1611. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1612. struct dp_ast_entry *ast_entry)
  1613. {
  1614. /*
  1615. * NOTE: Ensure that call to this API is done
  1616. * after soc->ast_lock is taken
  1617. */
  1618. dp_peer_debug("type: %d ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1619. ast_entry->type, ast_entry->peer_id, ast_entry->vdev_id,
  1620. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1621. ast_entry->callback = NULL;
  1622. ast_entry->cookie = NULL;
  1623. DP_STATS_INC(soc, ast.deleted, 1);
  1624. dp_peer_ast_hash_remove(soc, ast_entry);
  1625. dp_peer_ast_cleanup(soc, ast_entry);
  1626. qdf_mem_free(ast_entry);
  1627. soc->num_ast_entries--;
  1628. }
  1629. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1630. struct dp_ast_entry *ast_entry,
  1631. struct dp_peer *peer)
  1632. {
  1633. if (!peer) {
  1634. dp_info_rl("NULL peer");
  1635. return;
  1636. }
  1637. if (ast_entry->peer_id == HTT_INVALID_PEER) {
  1638. dp_info_rl("Invalid peer id in AST entry mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1639. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1640. ast_entry->type);
  1641. return;
  1642. }
  1643. /*
  1644. * NOTE: Ensure that call to this API is done
  1645. * after soc->ast_lock is taken
  1646. */
  1647. qdf_assert_always(ast_entry->peer_id == peer->peer_id);
  1648. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1649. if (ast_entry == peer->self_ast_entry)
  1650. peer->self_ast_entry = NULL;
  1651. /*
  1652. * release the reference only if it is mapped
  1653. * to ast_table
  1654. */
  1655. if (ast_entry->is_mapped)
  1656. soc->ast_table[ast_entry->ast_idx] = NULL;
  1657. ast_entry->peer_id = HTT_INVALID_PEER;
  1658. }
  1659. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1660. {
  1661. struct dp_peer *peer = NULL;
  1662. if (soc->ast_offload_support)
  1663. return;
  1664. if (!ast_entry) {
  1665. dp_info_rl("NULL AST entry");
  1666. return;
  1667. }
  1668. if (ast_entry->delete_in_progress) {
  1669. dp_info_rl("AST entry deletion in progress mac addr:"QDF_MAC_ADDR_FMT" type:%d",
  1670. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1671. ast_entry->type);
  1672. return;
  1673. }
  1674. dp_peer_debug("call by %ps: ID: %u vid: %u mac_addr: " QDF_MAC_ADDR_FMT,
  1675. (void *)_RET_IP_, ast_entry->peer_id, ast_entry->vdev_id,
  1676. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw));
  1677. ast_entry->delete_in_progress = true;
  1678. /* In teardown del ast is called after setting logical delete state
  1679. * use __dp_peer_get_ref_by_id to get the reference irrespective of
  1680. * state
  1681. */
  1682. peer = __dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1683. DP_MOD_ID_AST);
  1684. dp_peer_ast_send_wds_del(soc, ast_entry, peer);
  1685. /* Remove SELF and STATIC entries in teardown itself */
  1686. if (!ast_entry->next_hop)
  1687. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1688. if (ast_entry->is_mapped)
  1689. soc->ast_table[ast_entry->ast_idx] = NULL;
  1690. /* if peer map v2 is enabled we are not freeing ast entry
  1691. * here and it is supposed to be freed in unmap event (after
  1692. * we receive delete confirmation from target)
  1693. *
  1694. * if peer_id is invalid we did not get the peer map event
  1695. * for the peer free ast entry from here only in this case
  1696. */
  1697. if (dp_peer_ast_free_in_unmap_supported(soc, ast_entry))
  1698. goto end;
  1699. /* for WDS secondary entry ast_entry->next_hop would be set so
  1700. * unlinking has to be done explicitly here.
  1701. * As this entry is not a mapped entry unmap notification from
  1702. * FW will not come. Hence unlinkling is done right here.
  1703. */
  1704. if (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC)
  1705. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1706. dp_peer_free_ast_entry(soc, ast_entry);
  1707. end:
  1708. if (peer)
  1709. dp_peer_unref_delete(peer, DP_MOD_ID_AST);
  1710. }
  1711. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1712. struct dp_ast_entry *ast_entry, uint32_t flags)
  1713. {
  1714. int ret = -1;
  1715. struct dp_peer *old_peer;
  1716. if (soc->ast_offload_support)
  1717. return QDF_STATUS_E_INVAL;
  1718. 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",
  1719. soc, ast_entry->type, peer->vdev->pdev->pdev_id,
  1720. peer->vdev->vdev_id, flags,
  1721. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1722. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  1723. /* Do not send AST update in below cases
  1724. * 1) Ast entry delete has already triggered
  1725. * 2) Peer delete is already triggered
  1726. * 3) We did not get the HTT map for create event
  1727. */
  1728. if (ast_entry->delete_in_progress ||
  1729. !dp_peer_state_cmp(peer, DP_PEER_STATE_ACTIVE) ||
  1730. !ast_entry->is_mapped)
  1731. return ret;
  1732. if ((ast_entry->type == CDP_TXRX_AST_TYPE_STATIC) ||
  1733. (ast_entry->type == CDP_TXRX_AST_TYPE_SELF) ||
  1734. (ast_entry->type == CDP_TXRX_AST_TYPE_STA_BSS) ||
  1735. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS_HM_SEC))
  1736. return 0;
  1737. /*
  1738. * Avoids flood of WMI update messages sent to FW for same peer.
  1739. */
  1740. if (qdf_unlikely(ast_entry->peer_id == peer->peer_id) &&
  1741. (ast_entry->type == CDP_TXRX_AST_TYPE_WDS) &&
  1742. (ast_entry->vdev_id == peer->vdev->vdev_id) &&
  1743. (ast_entry->is_active))
  1744. return 0;
  1745. old_peer = dp_peer_get_ref_by_id(soc, ast_entry->peer_id,
  1746. DP_MOD_ID_AST);
  1747. if (!old_peer)
  1748. return 0;
  1749. TAILQ_REMOVE(&old_peer->ast_entry_list, ast_entry, ase_list_elem);
  1750. dp_peer_unref_delete(old_peer, DP_MOD_ID_AST);
  1751. ast_entry->peer_id = peer->peer_id;
  1752. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  1753. ast_entry->pdev_id = peer->vdev->pdev->pdev_id;
  1754. ast_entry->vdev_id = peer->vdev->vdev_id;
  1755. ast_entry->is_active = TRUE;
  1756. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  1757. ret = dp_update_wds_entry_wrapper(soc,
  1758. peer,
  1759. ast_entry->mac_addr.raw,
  1760. flags);
  1761. return ret;
  1762. }
  1763. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1764. struct dp_ast_entry *ast_entry)
  1765. {
  1766. return ast_entry->pdev_id;
  1767. }
  1768. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1769. struct dp_ast_entry *ast_entry)
  1770. {
  1771. return ast_entry->next_hop;
  1772. }
  1773. void dp_peer_ast_set_type(struct dp_soc *soc,
  1774. struct dp_ast_entry *ast_entry,
  1775. enum cdp_txrx_ast_entry_type type)
  1776. {
  1777. ast_entry->type = type;
  1778. }
  1779. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  1780. struct dp_ast_entry *ast_entry,
  1781. struct dp_peer *peer)
  1782. {
  1783. bool delete_in_fw = false;
  1784. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_TRACE,
  1785. "%s: ast_entry->type: %d pdevid: %u vdev: %u mac_addr: "QDF_MAC_ADDR_FMT" next_hop: %u peer_id: %uM\n",
  1786. __func__, ast_entry->type, ast_entry->pdev_id,
  1787. ast_entry->vdev_id,
  1788. QDF_MAC_ADDR_REF(ast_entry->mac_addr.raw),
  1789. ast_entry->next_hop, ast_entry->peer_id);
  1790. /*
  1791. * If peer state is logical delete, the peer is about to get
  1792. * teared down with a peer delete command to firmware,
  1793. * which will cleanup all the wds ast entries.
  1794. * So, no need to send explicit wds ast delete to firmware.
  1795. */
  1796. if (ast_entry->next_hop) {
  1797. if (peer && dp_peer_state_cmp(peer,
  1798. DP_PEER_STATE_LOGICAL_DELETE))
  1799. delete_in_fw = false;
  1800. else
  1801. delete_in_fw = true;
  1802. dp_del_wds_entry_wrapper(soc,
  1803. ast_entry->vdev_id,
  1804. ast_entry->mac_addr.raw,
  1805. ast_entry->type,
  1806. delete_in_fw);
  1807. }
  1808. }
  1809. #else
  1810. void dp_peer_free_ast_entry(struct dp_soc *soc,
  1811. struct dp_ast_entry *ast_entry)
  1812. {
  1813. }
  1814. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  1815. struct dp_ast_entry *ast_entry,
  1816. struct dp_peer *peer)
  1817. {
  1818. }
  1819. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  1820. struct dp_ast_entry *ase)
  1821. {
  1822. }
  1823. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  1824. uint8_t *ast_mac_addr,
  1825. uint8_t vdev_id)
  1826. {
  1827. return NULL;
  1828. }
  1829. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc,
  1830. struct dp_peer *peer,
  1831. uint8_t *mac_addr,
  1832. enum cdp_txrx_ast_entry_type type,
  1833. uint32_t flags)
  1834. {
  1835. return QDF_STATUS_E_FAILURE;
  1836. }
  1837. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  1838. {
  1839. }
  1840. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  1841. struct dp_ast_entry *ast_entry, uint32_t flags)
  1842. {
  1843. return 1;
  1844. }
  1845. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  1846. uint8_t *ast_mac_addr)
  1847. {
  1848. return NULL;
  1849. }
  1850. static inline
  1851. QDF_STATUS dp_peer_host_add_map_ast(struct dp_soc *soc, uint16_t peer_id,
  1852. uint8_t *mac_addr, uint16_t hw_peer_id,
  1853. uint8_t vdev_id, uint16_t ast_hash,
  1854. uint8_t is_wds)
  1855. {
  1856. return QDF_STATUS_SUCCESS;
  1857. }
  1858. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  1859. uint8_t *ast_mac_addr,
  1860. uint8_t pdev_id)
  1861. {
  1862. return NULL;
  1863. }
  1864. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc)
  1865. {
  1866. return QDF_STATUS_SUCCESS;
  1867. }
  1868. static inline QDF_STATUS dp_peer_map_ast(struct dp_soc *soc,
  1869. struct dp_peer *peer,
  1870. uint8_t *mac_addr,
  1871. uint16_t hw_peer_id,
  1872. uint8_t vdev_id,
  1873. uint16_t ast_hash,
  1874. uint8_t is_wds)
  1875. {
  1876. return QDF_STATUS_SUCCESS;
  1877. }
  1878. void dp_peer_ast_hash_detach(struct dp_soc *soc)
  1879. {
  1880. }
  1881. void dp_peer_ast_set_type(struct dp_soc *soc,
  1882. struct dp_ast_entry *ast_entry,
  1883. enum cdp_txrx_ast_entry_type type)
  1884. {
  1885. }
  1886. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  1887. struct dp_ast_entry *ast_entry)
  1888. {
  1889. return 0xff;
  1890. }
  1891. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  1892. struct dp_ast_entry *ast_entry)
  1893. {
  1894. return 0xff;
  1895. }
  1896. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  1897. struct dp_ast_entry *ast_entry,
  1898. struct dp_peer *peer)
  1899. {
  1900. }
  1901. static inline
  1902. void dp_peer_unmap_ipa_evt(struct dp_soc *soc, uint16_t peer_id,
  1903. uint8_t vdev_id, uint8_t *mac_addr)
  1904. {
  1905. }
  1906. #endif
  1907. #ifdef WLAN_FEATURE_MULTI_AST_DEL
  1908. void dp_peer_ast_send_multi_wds_del(
  1909. struct dp_soc *soc, uint8_t vdev_id,
  1910. struct peer_del_multi_wds_entries *wds_list)
  1911. {
  1912. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  1913. if (cdp_soc && cdp_soc->ol_ops &&
  1914. cdp_soc->ol_ops->peer_del_multi_wds_entry)
  1915. cdp_soc->ol_ops->peer_del_multi_wds_entry(soc->ctrl_psoc,
  1916. vdev_id, wds_list);
  1917. }
  1918. #endif
  1919. #ifdef FEATURE_WDS
  1920. /**
  1921. * dp_peer_ast_free_wds_entries() - Free wds ast entries associated with peer
  1922. * @soc: soc handle
  1923. * @peer: peer handle
  1924. *
  1925. * Free all the wds ast entries associated with peer
  1926. *
  1927. * Return: Number of wds ast entries freed
  1928. */
  1929. static uint32_t dp_peer_ast_free_wds_entries(struct dp_soc *soc,
  1930. struct dp_peer *peer)
  1931. {
  1932. TAILQ_HEAD(, dp_ast_entry) ast_local_list = {0};
  1933. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  1934. uint32_t num_ast = 0;
  1935. TAILQ_INIT(&ast_local_list);
  1936. qdf_spin_lock_bh(&soc->ast_lock);
  1937. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  1938. if (ast_entry->next_hop)
  1939. num_ast++;
  1940. if (ast_entry->is_mapped)
  1941. soc->ast_table[ast_entry->ast_idx] = NULL;
  1942. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1943. DP_STATS_INC(soc, ast.deleted, 1);
  1944. dp_peer_ast_hash_remove(soc, ast_entry);
  1945. TAILQ_INSERT_TAIL(&ast_local_list, ast_entry,
  1946. ase_list_elem);
  1947. soc->num_ast_entries--;
  1948. }
  1949. qdf_spin_unlock_bh(&soc->ast_lock);
  1950. TAILQ_FOREACH_SAFE(ast_entry, &ast_local_list, ase_list_elem,
  1951. temp_ast_entry) {
  1952. if (ast_entry->callback)
  1953. ast_entry->callback(soc->ctrl_psoc,
  1954. dp_soc_to_cdp_soc(soc),
  1955. ast_entry->cookie,
  1956. CDP_TXRX_AST_DELETED);
  1957. qdf_mem_free(ast_entry);
  1958. }
  1959. return num_ast;
  1960. }
  1961. /**
  1962. * dp_peer_clean_wds_entries() - Clean wds ast entries and compare
  1963. * @soc: soc handle
  1964. * @peer: peer handle
  1965. * @free_wds_count: number of wds entries freed by FW with peer delete
  1966. *
  1967. * Free all the wds ast entries associated with peer and compare with
  1968. * the value received from firmware
  1969. *
  1970. * Return: Number of wds ast entries freed
  1971. */
  1972. static void
  1973. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  1974. uint32_t free_wds_count)
  1975. {
  1976. uint32_t wds_deleted = 0;
  1977. if (soc->ast_offload_support && !soc->host_ast_db_enable)
  1978. return;
  1979. wds_deleted = dp_peer_ast_free_wds_entries(soc, peer);
  1980. if ((DP_PEER_WDS_COUNT_INVALID != free_wds_count) &&
  1981. (free_wds_count != wds_deleted)) {
  1982. DP_STATS_INC(soc, ast.ast_mismatch, 1);
  1983. 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",
  1984. peer, peer->mac_addr.raw, free_wds_count,
  1985. wds_deleted);
  1986. }
  1987. }
  1988. #else
  1989. static void
  1990. dp_peer_clean_wds_entries(struct dp_soc *soc, struct dp_peer *peer,
  1991. uint32_t free_wds_count)
  1992. {
  1993. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  1994. qdf_spin_lock_bh(&soc->ast_lock);
  1995. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry) {
  1996. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  1997. if (ast_entry->is_mapped)
  1998. soc->ast_table[ast_entry->ast_idx] = NULL;
  1999. dp_peer_free_ast_entry(soc, ast_entry);
  2000. }
  2001. peer->self_ast_entry = NULL;
  2002. qdf_spin_unlock_bh(&soc->ast_lock);
  2003. }
  2004. #endif
  2005. /**
  2006. * dp_peer_ast_free_entry_by_mac() - find ast entry by MAC address and delete
  2007. * @soc: soc handle
  2008. * @peer: peer handle
  2009. * @vdev_id: vdev_id
  2010. * @mac_addr: mac address of the AST entry to searc and delete
  2011. *
  2012. * find the ast entry from the peer list using the mac address and free
  2013. * the entry.
  2014. *
  2015. * Return: SUCCESS or NOENT
  2016. */
  2017. static int dp_peer_ast_free_entry_by_mac(struct dp_soc *soc,
  2018. struct dp_peer *peer,
  2019. uint8_t vdev_id,
  2020. uint8_t *mac_addr)
  2021. {
  2022. struct dp_ast_entry *ast_entry;
  2023. void *cookie = NULL;
  2024. txrx_ast_free_cb cb = NULL;
  2025. /*
  2026. * release the reference only if it is mapped
  2027. * to ast_table
  2028. */
  2029. qdf_spin_lock_bh(&soc->ast_lock);
  2030. ast_entry = dp_peer_ast_hash_find_by_vdevid(soc, mac_addr, vdev_id);
  2031. if (!ast_entry) {
  2032. qdf_spin_unlock_bh(&soc->ast_lock);
  2033. return QDF_STATUS_E_NOENT;
  2034. } else if (ast_entry->is_mapped) {
  2035. soc->ast_table[ast_entry->ast_idx] = NULL;
  2036. }
  2037. cb = ast_entry->callback;
  2038. cookie = ast_entry->cookie;
  2039. dp_peer_unlink_ast_entry(soc, ast_entry, peer);
  2040. dp_peer_free_ast_entry(soc, ast_entry);
  2041. qdf_spin_unlock_bh(&soc->ast_lock);
  2042. if (cb) {
  2043. cb(soc->ctrl_psoc,
  2044. dp_soc_to_cdp_soc(soc),
  2045. cookie,
  2046. CDP_TXRX_AST_DELETED);
  2047. }
  2048. return QDF_STATUS_SUCCESS;
  2049. }
  2050. void dp_peer_find_hash_erase(struct dp_soc *soc)
  2051. {
  2052. int i;
  2053. /*
  2054. * Not really necessary to take peer_ref_mutex lock - by this point,
  2055. * it's known that the soc is no longer in use.
  2056. */
  2057. for (i = 0; i <= soc->peer_hash.mask; i++) {
  2058. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  2059. struct dp_peer *peer, *peer_next;
  2060. /*
  2061. * TAILQ_FOREACH_SAFE must be used here to avoid any
  2062. * memory access violation after peer is freed
  2063. */
  2064. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  2065. hash_list_elem, peer_next) {
  2066. /*
  2067. * Don't remove the peer from the hash table -
  2068. * that would modify the list we are currently
  2069. * traversing, and it's not necessary anyway.
  2070. */
  2071. /*
  2072. * Artificially adjust the peer's ref count to
  2073. * 1, so it will get deleted by
  2074. * dp_peer_unref_delete.
  2075. */
  2076. /* set to zero */
  2077. qdf_atomic_init(&peer->ref_cnt);
  2078. for (i = 0; i < DP_MOD_ID_MAX; i++)
  2079. qdf_atomic_init(&peer->mod_refs[i]);
  2080. /* incr to one */
  2081. qdf_atomic_inc(&peer->ref_cnt);
  2082. qdf_atomic_inc(&peer->mod_refs
  2083. [DP_MOD_ID_CONFIG]);
  2084. dp_peer_unref_delete(peer,
  2085. DP_MOD_ID_CONFIG);
  2086. }
  2087. }
  2088. }
  2089. }
  2090. void dp_peer_ast_table_detach(struct dp_soc *soc)
  2091. {
  2092. if (soc->ast_table) {
  2093. qdf_mem_free(soc->ast_table);
  2094. soc->ast_table = NULL;
  2095. }
  2096. }
  2097. void dp_peer_find_map_detach(struct dp_soc *soc)
  2098. {
  2099. struct dp_peer *peer = NULL;
  2100. uint32_t i = 0;
  2101. if (soc->peer_id_to_obj_map) {
  2102. for (i = 0; i < soc->max_peer_id; i++) {
  2103. peer = soc->peer_id_to_obj_map[i];
  2104. if (peer)
  2105. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2106. }
  2107. qdf_mem_free(soc->peer_id_to_obj_map);
  2108. soc->peer_id_to_obj_map = NULL;
  2109. qdf_spinlock_destroy(&soc->peer_map_lock);
  2110. }
  2111. }
  2112. #ifndef AST_OFFLOAD_ENABLE
  2113. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2114. {
  2115. QDF_STATUS status;
  2116. status = dp_peer_find_map_attach(soc);
  2117. if (!QDF_IS_STATUS_SUCCESS(status))
  2118. return status;
  2119. status = dp_peer_find_hash_attach(soc);
  2120. if (!QDF_IS_STATUS_SUCCESS(status))
  2121. goto map_detach;
  2122. status = dp_peer_ast_table_attach(soc);
  2123. if (!QDF_IS_STATUS_SUCCESS(status))
  2124. goto hash_detach;
  2125. status = dp_peer_ast_hash_attach(soc);
  2126. if (!QDF_IS_STATUS_SUCCESS(status))
  2127. goto ast_table_detach;
  2128. status = dp_peer_mec_hash_attach(soc);
  2129. if (QDF_IS_STATUS_SUCCESS(status)) {
  2130. dp_soc_wds_attach(soc);
  2131. return status;
  2132. }
  2133. dp_peer_ast_hash_detach(soc);
  2134. ast_table_detach:
  2135. dp_peer_ast_table_detach(soc);
  2136. hash_detach:
  2137. dp_peer_find_hash_detach(soc);
  2138. map_detach:
  2139. dp_peer_find_map_detach(soc);
  2140. return status;
  2141. }
  2142. #else
  2143. QDF_STATUS dp_peer_find_attach(struct dp_soc *soc)
  2144. {
  2145. QDF_STATUS status;
  2146. status = dp_peer_find_map_attach(soc);
  2147. if (!QDF_IS_STATUS_SUCCESS(status))
  2148. return status;
  2149. status = dp_peer_find_hash_attach(soc);
  2150. if (!QDF_IS_STATUS_SUCCESS(status))
  2151. goto map_detach;
  2152. return status;
  2153. map_detach:
  2154. dp_peer_find_map_detach(soc);
  2155. return status;
  2156. }
  2157. #endif
  2158. #ifdef REO_SHARED_QREF_TABLE_EN
  2159. void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2160. struct dp_peer *peer)
  2161. {
  2162. uint8_t tid;
  2163. uint16_t peer_id;
  2164. uint32_t max_list_size;
  2165. max_list_size = soc->wlan_cfg_ctx->qref_control_size;
  2166. peer_id = peer->peer_id;
  2167. if (peer_id > soc->max_peer_id)
  2168. return;
  2169. if (IS_MLO_DP_LINK_PEER(peer))
  2170. return;
  2171. if (max_list_size) {
  2172. unsigned long curr_ts = qdf_get_system_timestamp();
  2173. struct dp_peer *primary_peer = peer;
  2174. uint16_t chip_id = 0xFFFF;
  2175. uint32_t qref_index;
  2176. qref_index = soc->shared_qaddr_del_idx;
  2177. soc->list_shared_qaddr_del[qref_index].peer_id =
  2178. primary_peer->peer_id;
  2179. soc->list_shared_qaddr_del[qref_index].ts_qaddr_del = curr_ts;
  2180. soc->list_shared_qaddr_del[qref_index].chip_id = chip_id;
  2181. soc->shared_qaddr_del_idx++;
  2182. if (soc->shared_qaddr_del_idx == max_list_size)
  2183. soc->shared_qaddr_del_idx = 0;
  2184. }
  2185. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc)) {
  2186. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  2187. hal_reo_shared_qaddr_write(soc->hal_soc,
  2188. peer_id, tid, 0);
  2189. }
  2190. }
  2191. }
  2192. #endif
  2193. /**
  2194. * dp_peer_find_add_id() - map peer_id with peer
  2195. * @soc: soc handle
  2196. * @peer_mac_addr: peer mac address
  2197. * @peer_id: peer id to be mapped
  2198. * @hw_peer_id: HW ast index
  2199. * @vdev_id: vdev_id
  2200. * @peer_type: peer type (link or MLD)
  2201. *
  2202. * return: peer in success
  2203. * NULL in failure
  2204. */
  2205. static inline struct dp_peer *dp_peer_find_add_id(struct dp_soc *soc,
  2206. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  2207. uint8_t vdev_id, enum cdp_peer_type peer_type)
  2208. {
  2209. struct dp_peer *peer;
  2210. struct cdp_peer_info peer_info = { 0 };
  2211. QDF_ASSERT(peer_id <= soc->max_peer_id);
  2212. /* check if there's already a peer object with this MAC address */
  2213. DP_PEER_INFO_PARAMS_INIT(&peer_info, vdev_id, peer_mac_addr,
  2214. false, peer_type);
  2215. peer = dp_peer_hash_find_wrapper(soc, &peer_info, DP_MOD_ID_CONFIG);
  2216. dp_peer_debug("%pK: peer %pK ID %d vid %d mac " QDF_MAC_ADDR_FMT,
  2217. soc, peer, peer_id, vdev_id,
  2218. QDF_MAC_ADDR_REF(peer_mac_addr));
  2219. if (peer) {
  2220. /* peer's ref count was already incremented by
  2221. * peer_find_hash_find
  2222. */
  2223. dp_peer_info("%pK: ref_cnt: %d", soc,
  2224. qdf_atomic_read(&peer->ref_cnt));
  2225. /*
  2226. * if peer is in logical delete CP triggered delete before map
  2227. * is received ignore this event
  2228. */
  2229. if (dp_peer_state_cmp(peer, DP_PEER_STATE_LOGICAL_DELETE)) {
  2230. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2231. dp_alert("Peer %pK["QDF_MAC_ADDR_FMT"] logical delete state vid %d",
  2232. peer, QDF_MAC_ADDR_REF(peer_mac_addr),
  2233. vdev_id);
  2234. return NULL;
  2235. }
  2236. if (peer->peer_id == HTT_INVALID_PEER) {
  2237. if (!IS_MLO_DP_MLD_PEER(peer))
  2238. dp_monitor_peer_tid_peer_id_update(soc, peer,
  2239. peer_id);
  2240. } else {
  2241. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2242. QDF_ASSERT(0);
  2243. return NULL;
  2244. }
  2245. dp_peer_find_id_to_obj_add(soc, peer, peer_id);
  2246. if (soc->arch_ops.dp_partner_chips_map)
  2247. soc->arch_ops.dp_partner_chips_map(soc, peer, peer_id);
  2248. dp_peer_update_state(soc, peer, DP_PEER_STATE_ACTIVE);
  2249. return peer;
  2250. }
  2251. return NULL;
  2252. }
  2253. #ifdef WLAN_FEATURE_11BE_MLO
  2254. #ifdef DP_USE_REDUCED_PEER_ID_FIELD_WIDTH
  2255. uint16_t dp_gen_ml_peer_id(struct dp_soc *soc, uint16_t peer_id)
  2256. {
  2257. return ((peer_id & soc->peer_id_mask) | (1 << soc->peer_id_shift));
  2258. }
  2259. #else
  2260. uint16_t dp_gen_ml_peer_id(struct dp_soc *soc, uint16_t peer_id)
  2261. {
  2262. return (peer_id | (1 << HTT_RX_PEER_META_DATA_V1_ML_PEER_VALID_S));
  2263. }
  2264. #endif
  2265. QDF_STATUS
  2266. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2267. uint8_t *peer_mac_addr,
  2268. struct dp_mlo_flow_override_info *mlo_flow_info,
  2269. struct dp_mlo_link_info *mlo_link_info)
  2270. {
  2271. struct dp_peer *peer = NULL;
  2272. uint16_t hw_peer_id = mlo_flow_info[0].ast_idx;
  2273. uint16_t ast_hash = mlo_flow_info[0].cache_set_num;
  2274. uint8_t vdev_id = 0;
  2275. uint8_t is_wds = 0;
  2276. int i;
  2277. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2278. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2279. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2280. struct dp_soc *primary_soc = NULL;
  2281. dp_cfg_event_record_peer_map_unmap_evt(soc, DP_CFG_EVENT_MLO_PEER_MAP,
  2282. NULL, peer_mac_addr,
  2283. 1, peer_id, ml_peer_id, 0,
  2284. vdev_id);
  2285. dp_info("mlo_peer_map_event (soc:%pK): peer_id %d ml_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT,
  2286. soc, peer_id, ml_peer_id,
  2287. QDF_MAC_ADDR_REF(peer_mac_addr));
  2288. /* Get corresponding vdev ID for the peer based
  2289. * on chip ID obtained from mlo peer_map event
  2290. */
  2291. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  2292. if (mlo_link_info[i].peer_chip_id == dp_get_chip_id(soc)) {
  2293. vdev_id = mlo_link_info[i].vdev_id;
  2294. break;
  2295. }
  2296. }
  2297. peer = dp_peer_find_add_id(soc, peer_mac_addr, ml_peer_id,
  2298. hw_peer_id, vdev_id, CDP_MLD_PEER_TYPE);
  2299. if (peer) {
  2300. if (wlan_op_mode_sta == peer->vdev->opmode &&
  2301. qdf_mem_cmp(peer->mac_addr.raw,
  2302. peer->vdev->mld_mac_addr.raw,
  2303. QDF_MAC_ADDR_SIZE) != 0) {
  2304. dp_peer_info("%pK: STA vdev bss_peer!!!!", soc);
  2305. peer->bss_peer = 1;
  2306. if (peer->txrx_peer)
  2307. peer->txrx_peer->bss_peer = 1;
  2308. }
  2309. if (peer->vdev->opmode == wlan_op_mode_sta) {
  2310. peer->vdev->bss_ast_hash = ast_hash;
  2311. peer->vdev->bss_ast_idx = hw_peer_id;
  2312. }
  2313. /* Add ast entry incase self ast entry is
  2314. * deleted due to DP CP sync issue
  2315. *
  2316. * self_ast_entry is modified in peer create
  2317. * and peer unmap path which cannot run in
  2318. * parllel with peer map, no lock need before
  2319. * referring it
  2320. */
  2321. if (!peer->self_ast_entry) {
  2322. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2323. QDF_MAC_ADDR_REF(peer_mac_addr));
  2324. dp_peer_add_ast(soc, peer,
  2325. peer_mac_addr,
  2326. type, 0);
  2327. }
  2328. /* If peer setup and hence rx_tid setup got called
  2329. * before htt peer map then Qref write to LUT did not
  2330. * happen in rx_tid setup as peer_id was invalid.
  2331. * So defer Qref write to peer map handler. Check if
  2332. * rx_tid qdesc for tid 0 is already setup and perform
  2333. * qref write to LUT for Tid 0 and 16.
  2334. *
  2335. * Peer map could be obtained on assoc link, hence
  2336. * change to primary link's soc.
  2337. */
  2338. primary_soc = peer->vdev->pdev->soc;
  2339. if (hal_reo_shared_qaddr_is_enable(primary_soc->hal_soc) &&
  2340. peer->rx_tid[0].hw_qdesc_vaddr_unaligned) {
  2341. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2342. ml_peer_id,
  2343. 0,
  2344. peer->rx_tid[0].hw_qdesc_paddr);
  2345. hal_reo_shared_qaddr_write(primary_soc->hal_soc,
  2346. ml_peer_id,
  2347. DP_NON_QOS_TID,
  2348. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2349. }
  2350. }
  2351. if (!primary_soc)
  2352. primary_soc = soc;
  2353. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2354. vdev_id, ast_hash, is_wds);
  2355. /*
  2356. * If AST offload and host AST DB is enabled, populate AST entries on
  2357. * host based on mlo peer map event from FW
  2358. */
  2359. if (peer && soc->ast_offload_support && soc->host_ast_db_enable) {
  2360. dp_peer_host_add_map_ast(primary_soc, ml_peer_id, peer_mac_addr,
  2361. hw_peer_id, vdev_id,
  2362. ast_hash, is_wds);
  2363. }
  2364. return err;
  2365. }
  2366. #endif
  2367. #ifdef DP_RX_UDP_OVER_PEER_ROAM
  2368. void dp_rx_reset_roaming_peer(struct dp_soc *soc, uint8_t vdev_id,
  2369. uint8_t *peer_mac_addr)
  2370. {
  2371. struct dp_vdev *vdev = NULL;
  2372. vdev = dp_vdev_get_ref_by_id(soc, vdev_id, DP_MOD_ID_HTT);
  2373. if (vdev) {
  2374. if (qdf_mem_cmp(vdev->roaming_peer_mac.raw, peer_mac_addr,
  2375. QDF_MAC_ADDR_SIZE) == 0) {
  2376. vdev->roaming_peer_status =
  2377. WLAN_ROAM_PEER_AUTH_STATUS_NONE;
  2378. qdf_mem_zero(vdev->roaming_peer_mac.raw,
  2379. QDF_MAC_ADDR_SIZE);
  2380. }
  2381. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_HTT);
  2382. }
  2383. }
  2384. #endif
  2385. #ifdef WLAN_SUPPORT_PPEDS
  2386. static void
  2387. dp_tx_ppeds_cfg_astidx_cache_mapping(struct dp_soc *soc, struct dp_vdev *vdev,
  2388. bool peer_map)
  2389. {
  2390. if (soc->arch_ops.dp_tx_ppeds_cfg_astidx_cache_mapping)
  2391. soc->arch_ops.dp_tx_ppeds_cfg_astidx_cache_mapping(soc, vdev,
  2392. peer_map);
  2393. }
  2394. #else
  2395. static void
  2396. dp_tx_ppeds_cfg_astidx_cache_mapping(struct dp_soc *soc, struct dp_vdev *vdev,
  2397. bool peer_map)
  2398. {
  2399. }
  2400. #endif
  2401. QDF_STATUS
  2402. dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  2403. uint16_t hw_peer_id, uint8_t vdev_id,
  2404. uint8_t *peer_mac_addr, uint16_t ast_hash,
  2405. uint8_t is_wds)
  2406. {
  2407. struct dp_peer *peer = NULL;
  2408. struct dp_vdev *vdev = NULL;
  2409. enum cdp_txrx_ast_entry_type type = CDP_TXRX_AST_TYPE_STATIC;
  2410. QDF_STATUS err = QDF_STATUS_SUCCESS;
  2411. dp_cfg_event_record_peer_map_unmap_evt(soc, DP_CFG_EVENT_PEER_MAP,
  2412. NULL, peer_mac_addr, 1, peer_id,
  2413. 0, 0, vdev_id);
  2414. dp_info("peer_map_event (soc:%pK): peer_id %d, hw_peer_id %d, peer_mac "QDF_MAC_ADDR_FMT", vdev_id %d",
  2415. soc, peer_id, hw_peer_id,
  2416. QDF_MAC_ADDR_REF(peer_mac_addr), vdev_id);
  2417. /* Peer map event for WDS ast entry get the peer from
  2418. * obj map
  2419. */
  2420. if (is_wds) {
  2421. if (!soc->ast_offload_support) {
  2422. peer = dp_peer_get_ref_by_id(soc, peer_id,
  2423. DP_MOD_ID_HTT);
  2424. err = dp_peer_map_ast(soc, peer, peer_mac_addr,
  2425. hw_peer_id,
  2426. vdev_id, ast_hash, is_wds);
  2427. if (peer)
  2428. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2429. }
  2430. } else {
  2431. /*
  2432. * It's the responsibility of the CP and FW to ensure
  2433. * that peer is created successfully. Ideally DP should
  2434. * not hit the below condition for directly associated
  2435. * peers.
  2436. */
  2437. if ((!soc->ast_offload_support) && ((hw_peer_id < 0) ||
  2438. (hw_peer_id >=
  2439. wlan_cfg_get_max_ast_idx(soc->wlan_cfg_ctx)))) {
  2440. dp_peer_err("%pK: invalid hw_peer_id: %d", soc, hw_peer_id);
  2441. qdf_assert_always(0);
  2442. }
  2443. peer = dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  2444. hw_peer_id, vdev_id,
  2445. CDP_LINK_PEER_TYPE);
  2446. if (peer) {
  2447. bool peer_map = true;
  2448. /* Updating ast_hash and ast_idx in peer level */
  2449. peer->ast_hash = ast_hash;
  2450. peer->ast_idx = hw_peer_id;
  2451. vdev = peer->vdev;
  2452. /* Only check for STA Vdev and peer is not for TDLS */
  2453. if (wlan_op_mode_sta == vdev->opmode &&
  2454. !peer->is_tdls_peer) {
  2455. if (qdf_mem_cmp(peer->mac_addr.raw,
  2456. vdev->mac_addr.raw,
  2457. QDF_MAC_ADDR_SIZE) != 0) {
  2458. dp_info("%pK: STA vdev bss_peer", soc);
  2459. peer->bss_peer = 1;
  2460. if (peer->txrx_peer)
  2461. peer->txrx_peer->bss_peer = 1;
  2462. }
  2463. dp_info("bss ast_hash 0x%x, ast_index 0x%x",
  2464. ast_hash, hw_peer_id);
  2465. vdev->bss_ast_hash = ast_hash;
  2466. vdev->bss_ast_idx = hw_peer_id;
  2467. dp_tx_ppeds_cfg_astidx_cache_mapping(soc, vdev,
  2468. peer_map);
  2469. }
  2470. /* Add ast entry incase self ast entry is
  2471. * deleted due to DP CP sync issue
  2472. *
  2473. * self_ast_entry is modified in peer create
  2474. * and peer unmap path which cannot run in
  2475. * parllel with peer map, no lock need before
  2476. * referring it
  2477. */
  2478. if (!soc->ast_offload_support &&
  2479. !peer->self_ast_entry) {
  2480. dp_info("Add self ast from map "QDF_MAC_ADDR_FMT,
  2481. QDF_MAC_ADDR_REF(peer_mac_addr));
  2482. dp_peer_add_ast(soc, peer,
  2483. peer_mac_addr,
  2484. type, 0);
  2485. }
  2486. /* If peer setup and hence rx_tid setup got called
  2487. * before htt peer map then Qref write to LUT did
  2488. * not happen in rx_tid setup as peer_id was invalid.
  2489. * So defer Qref write to peer map handler. Check if
  2490. * rx_tid qdesc for tid 0 is already setup perform qref
  2491. * write to LUT for Tid 0 and 16.
  2492. */
  2493. if (hal_reo_shared_qaddr_is_enable(soc->hal_soc) &&
  2494. peer->rx_tid[0].hw_qdesc_vaddr_unaligned &&
  2495. !IS_MLO_DP_LINK_PEER(peer)) {
  2496. add_entry_write_list(soc, peer, 0);
  2497. hal_reo_shared_qaddr_write(soc->hal_soc,
  2498. peer_id,
  2499. 0,
  2500. peer->rx_tid[0].hw_qdesc_paddr);
  2501. add_entry_write_list(soc, peer, DP_NON_QOS_TID);
  2502. hal_reo_shared_qaddr_write(soc->hal_soc,
  2503. peer_id,
  2504. DP_NON_QOS_TID,
  2505. peer->rx_tid[DP_NON_QOS_TID].hw_qdesc_paddr);
  2506. }
  2507. }
  2508. err = dp_peer_map_ast(soc, peer, peer_mac_addr, hw_peer_id,
  2509. vdev_id, ast_hash, is_wds);
  2510. }
  2511. dp_rx_reset_roaming_peer(soc, vdev_id, peer_mac_addr);
  2512. /*
  2513. * If AST offload and host AST DB is enabled, populate AST entries on
  2514. * host based on peer map event from FW
  2515. */
  2516. if (soc->ast_offload_support && soc->host_ast_db_enable) {
  2517. dp_peer_host_add_map_ast(soc, peer_id, peer_mac_addr,
  2518. hw_peer_id, vdev_id,
  2519. ast_hash, is_wds);
  2520. }
  2521. return err;
  2522. }
  2523. void
  2524. dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  2525. uint8_t vdev_id, uint8_t *mac_addr,
  2526. uint8_t is_wds, uint32_t free_wds_count)
  2527. {
  2528. struct dp_peer *peer;
  2529. struct dp_vdev *vdev = NULL;
  2530. /*
  2531. * If FW AST offload is enabled and host AST DB is enabled,
  2532. * the AST entries are created during peer map from FW.
  2533. */
  2534. if (soc->ast_offload_support && is_wds) {
  2535. if (!soc->host_ast_db_enable)
  2536. return;
  2537. }
  2538. peer = __dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  2539. /*
  2540. * Currently peer IDs are assigned for vdevs as well as peers.
  2541. * If the peer ID is for a vdev, then the peer pointer stored
  2542. * in peer_id_to_obj_map will be NULL.
  2543. */
  2544. if (!peer) {
  2545. dp_err("Received unmap event for invalid peer_id %u",
  2546. peer_id);
  2547. return;
  2548. }
  2549. vdev = peer->vdev;
  2550. if (peer->txrx_peer) {
  2551. struct cdp_txrx_peer_params_update params = {0};
  2552. params.vdev_id = vdev->vdev_id;
  2553. params.peer_mac = peer->mac_addr.raw;
  2554. params.chip_id = dp_get_chip_id(soc);
  2555. params.pdev_id = vdev->pdev->pdev_id;
  2556. dp_wdi_event_handler(WDI_EVENT_PEER_UNMAP, soc,
  2557. (void *)&params, peer_id,
  2558. WDI_NO_VAL, vdev->pdev->pdev_id);
  2559. }
  2560. /*
  2561. * In scenario where assoc peer soc id is different from
  2562. * primary soc id, reset the soc to point to primary psoc.
  2563. * Since map is received on primary soc, the unmap should
  2564. * also delete ast on primary soc.
  2565. */
  2566. soc = peer->vdev->pdev->soc;
  2567. /* If V2 Peer map messages are enabled AST entry has to be
  2568. * freed here
  2569. */
  2570. if (is_wds) {
  2571. if (!dp_peer_ast_free_entry_by_mac(soc, peer, vdev_id,
  2572. mac_addr)) {
  2573. dp_peer_unmap_ipa_evt(soc, peer_id, vdev_id, mac_addr);
  2574. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2575. return;
  2576. }
  2577. dp_alert("AST entry not found with peer %pK peer_id %u peer_mac "QDF_MAC_ADDR_FMT" mac_addr "QDF_MAC_ADDR_FMT" vdev_id %u next_hop %u",
  2578. peer, peer->peer_id,
  2579. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2580. QDF_MAC_ADDR_REF(mac_addr), vdev_id,
  2581. is_wds);
  2582. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2583. return;
  2584. }
  2585. dp_peer_clean_wds_entries(soc, peer, free_wds_count);
  2586. dp_cfg_event_record_peer_map_unmap_evt(soc, DP_CFG_EVENT_PEER_UNMAP,
  2587. peer, mac_addr, 0, peer_id,
  2588. 0, 0, vdev_id);
  2589. dp_info("peer_unmap_event (soc:%pK) peer_id %d peer %pK",
  2590. soc, peer_id, peer);
  2591. /* Clear entries in Qref LUT */
  2592. /* TODO: Check if this is to be called from
  2593. * dp_peer_delete for MLO case if there is race between
  2594. * new peer id assignment and still not having received
  2595. * peer unmap for MLD peer with same peer id.
  2596. */
  2597. dp_peer_rx_reo_shared_qaddr_delete(soc, peer);
  2598. vdev = peer->vdev;
  2599. /* only if peer is in STA mode and not tdls peer */
  2600. if (wlan_op_mode_sta == vdev->opmode && !peer->is_tdls_peer) {
  2601. bool peer_map = false;
  2602. dp_tx_ppeds_cfg_astidx_cache_mapping(soc, vdev, peer_map);
  2603. }
  2604. dp_peer_find_id_to_obj_remove(soc, peer_id);
  2605. if (soc->arch_ops.dp_partner_chips_unmap)
  2606. soc->arch_ops.dp_partner_chips_unmap(soc, peer_id);
  2607. peer->peer_id = HTT_INVALID_PEER;
  2608. /*
  2609. * Reset ast flow mapping table
  2610. */
  2611. if (!soc->ast_offload_support)
  2612. dp_peer_reset_flowq_map(peer);
  2613. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  2614. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  2615. peer_id, vdev_id, mac_addr);
  2616. }
  2617. dp_update_vdev_stats_on_peer_unmap(vdev, peer);
  2618. dp_peer_update_state(soc, peer, DP_PEER_STATE_INACTIVE);
  2619. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2620. /*
  2621. * Remove a reference to the peer.
  2622. * If there are no more references, delete the peer object.
  2623. */
  2624. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2625. }
  2626. #if defined(WLAN_FEATURE_11BE_MLO) && defined(DP_MLO_LINK_STATS_SUPPORT)
  2627. /**
  2628. * dp_freq_to_band() - Convert frequency to band
  2629. * @freq: peer frequency
  2630. *
  2631. * Return: band for input frequency
  2632. */
  2633. static inline
  2634. enum dp_bands dp_freq_to_band(qdf_freq_t freq)
  2635. {
  2636. if (REG_IS_24GHZ_CH_FREQ(freq))
  2637. return DP_BAND_2GHZ;
  2638. else if (REG_IS_5GHZ_FREQ(freq) || REG_IS_49GHZ_FREQ(freq))
  2639. return DP_BAND_5GHZ;
  2640. else if (REG_IS_6GHZ_FREQ(freq))
  2641. return DP_BAND_6GHZ;
  2642. return DP_BAND_INVALID;
  2643. }
  2644. void dp_map_link_id_band(struct dp_peer *peer)
  2645. {
  2646. struct dp_txrx_peer *txrx_peer = NULL;
  2647. enum dp_bands band;
  2648. txrx_peer = dp_get_txrx_peer(peer);
  2649. if (txrx_peer) {
  2650. band = dp_freq_to_band(peer->freq);
  2651. txrx_peer->band[peer->link_id + 1] = band;
  2652. dp_info("Band(Freq: %u): %u mapped to Link ID: %u",
  2653. peer->freq, band, peer->link_id);
  2654. } else {
  2655. dp_info("txrx_peer NULL for peer: " QDF_MAC_ADDR_FMT,
  2656. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2657. }
  2658. }
  2659. QDF_STATUS
  2660. dp_rx_peer_ext_evt(struct dp_soc *soc, struct dp_peer_ext_evt_info *info)
  2661. {
  2662. struct dp_peer *peer = NULL;
  2663. struct cdp_peer_info peer_info = { 0 };
  2664. QDF_ASSERT(info->peer_id <= soc->max_peer_id);
  2665. DP_PEER_INFO_PARAMS_INIT(&peer_info, info->vdev_id, info->peer_mac_addr,
  2666. false, CDP_LINK_PEER_TYPE);
  2667. peer = dp_peer_hash_find_wrapper(soc, &peer_info, DP_MOD_ID_CONFIG);
  2668. if (!peer) {
  2669. dp_err("peer NULL, id %u, MAC " QDF_MAC_ADDR_FMT ", vdev_id %u",
  2670. info->peer_id, QDF_MAC_ADDR_REF(info->peer_mac_addr),
  2671. info->vdev_id);
  2672. return QDF_STATUS_E_FAILURE;
  2673. }
  2674. peer->link_id = info->link_id;
  2675. peer->link_id_valid = info->link_id_valid;
  2676. if (peer->freq)
  2677. dp_map_link_id_band(peer);
  2678. dp_peer_unref_delete(peer, DP_MOD_ID_CONFIG);
  2679. return QDF_STATUS_SUCCESS;
  2680. }
  2681. #endif
  2682. #ifdef WLAN_FEATURE_11BE_MLO
  2683. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id)
  2684. {
  2685. uint16_t ml_peer_id = dp_gen_ml_peer_id(soc, peer_id);
  2686. uint8_t mac_addr[QDF_MAC_ADDR_SIZE] = {0};
  2687. uint8_t vdev_id = DP_VDEV_ALL;
  2688. uint8_t is_wds = 0;
  2689. dp_cfg_event_record_peer_map_unmap_evt(soc, DP_CFG_EVENT_MLO_PEER_UNMAP,
  2690. NULL, mac_addr, 0, peer_id,
  2691. 0, 0, vdev_id);
  2692. dp_info("MLO peer_unmap_event (soc:%pK) peer_id %d",
  2693. soc, peer_id);
  2694. dp_rx_peer_unmap_handler(soc, ml_peer_id, vdev_id,
  2695. mac_addr, is_wds,
  2696. DP_PEER_WDS_COUNT_INVALID);
  2697. }
  2698. #endif
  2699. #ifndef AST_OFFLOAD_ENABLE
  2700. void
  2701. dp_peer_find_detach(struct dp_soc *soc)
  2702. {
  2703. dp_soc_wds_detach(soc);
  2704. dp_peer_find_map_detach(soc);
  2705. dp_peer_find_hash_detach(soc);
  2706. dp_peer_ast_hash_detach(soc);
  2707. dp_peer_ast_table_detach(soc);
  2708. dp_peer_mec_hash_detach(soc);
  2709. }
  2710. #else
  2711. void
  2712. dp_peer_find_detach(struct dp_soc *soc)
  2713. {
  2714. dp_peer_find_map_detach(soc);
  2715. dp_peer_find_hash_detach(soc);
  2716. }
  2717. #endif
  2718. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  2719. {
  2720. dp_peer_rx_tid_setup(peer);
  2721. peer->active_ba_session_cnt = 0;
  2722. peer->hw_buffer_size = 0;
  2723. peer->kill_256_sessions = 0;
  2724. /*
  2725. * Set security defaults: no PN check, no security. The target may
  2726. * send a HTT SEC_IND message to overwrite these defaults.
  2727. */
  2728. if (peer->txrx_peer)
  2729. peer->txrx_peer->security[dp_sec_ucast].sec_type =
  2730. peer->txrx_peer->security[dp_sec_mcast].sec_type =
  2731. cdp_sec_type_none;
  2732. }
  2733. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  2734. {
  2735. enum wlan_op_mode vdev_opmode;
  2736. uint8_t vdev_mac_addr[QDF_MAC_ADDR_SIZE];
  2737. struct dp_pdev *pdev = vdev->pdev;
  2738. struct dp_soc *soc = pdev->soc;
  2739. /* save vdev related member in case vdev freed */
  2740. vdev_opmode = vdev->opmode;
  2741. if (!IS_MLO_DP_MLD_PEER(peer))
  2742. dp_monitor_peer_tx_cleanup(vdev, peer);
  2743. if (vdev_opmode != wlan_op_mode_monitor)
  2744. /* cleanup the Rx reorder queues for this peer */
  2745. dp_peer_rx_cleanup(vdev, peer);
  2746. dp_peer_rx_tids_destroy(peer);
  2747. if (IS_MLO_DP_LINK_PEER(peer))
  2748. dp_link_peer_del_mld_peer(peer);
  2749. if (IS_MLO_DP_MLD_PEER(peer))
  2750. dp_mld_peer_deinit_link_peers_info(peer);
  2751. qdf_mem_copy(vdev_mac_addr, vdev->mac_addr.raw,
  2752. QDF_MAC_ADDR_SIZE);
  2753. if (soc->cdp_soc.ol_ops->peer_unref_delete)
  2754. soc->cdp_soc.ol_ops->peer_unref_delete(
  2755. soc->ctrl_psoc,
  2756. vdev->pdev->pdev_id,
  2757. peer->mac_addr.raw, vdev_mac_addr,
  2758. vdev_opmode);
  2759. }
  2760. QDF_STATUS
  2761. dp_set_key_sec_type_wifi3(struct cdp_soc_t *soc, uint8_t vdev_id,
  2762. uint8_t *peer_mac, enum cdp_sec_type sec_type,
  2763. bool is_unicast)
  2764. {
  2765. struct dp_peer *peer =
  2766. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  2767. peer_mac, 0, vdev_id,
  2768. DP_MOD_ID_CDP);
  2769. int sec_index;
  2770. if (!peer) {
  2771. dp_peer_debug("%pK: Peer is NULL!\n", soc);
  2772. return QDF_STATUS_E_FAILURE;
  2773. }
  2774. if (!peer->txrx_peer) {
  2775. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  2776. dp_peer_debug("%pK: txrx peer is NULL!\n", soc);
  2777. return QDF_STATUS_E_FAILURE;
  2778. }
  2779. dp_peer_info("%pK: key sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  2780. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2781. is_unicast ? "ucast" : "mcast", sec_type);
  2782. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  2783. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  2784. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  2785. return QDF_STATUS_SUCCESS;
  2786. }
  2787. void
  2788. dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  2789. enum cdp_sec_type sec_type, int is_unicast,
  2790. u_int32_t *michael_key,
  2791. u_int32_t *rx_pn)
  2792. {
  2793. struct dp_peer *peer;
  2794. struct dp_txrx_peer *txrx_peer;
  2795. int sec_index;
  2796. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_HTT);
  2797. if (!peer) {
  2798. dp_peer_err("Couldn't find peer from ID %d - skipping security inits",
  2799. peer_id);
  2800. return;
  2801. }
  2802. txrx_peer = dp_get_txrx_peer(peer);
  2803. if (!txrx_peer) {
  2804. dp_peer_err("Couldn't find txrx peer from ID %d - skipping security inits",
  2805. peer_id);
  2806. return;
  2807. }
  2808. dp_peer_info("%pK: sec spec for peer %pK " QDF_MAC_ADDR_FMT ": %s key of type %d",
  2809. soc, peer, QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  2810. is_unicast ? "ucast" : "mcast", sec_type);
  2811. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  2812. peer->txrx_peer->security[sec_index].sec_type = sec_type;
  2813. #ifdef notyet /* TODO: See if this is required for defrag support */
  2814. /* michael key only valid for TKIP, but for simplicity,
  2815. * copy it anyway
  2816. */
  2817. qdf_mem_copy(
  2818. &peer->txrx_peer->security[sec_index].michael_key[0],
  2819. michael_key,
  2820. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  2821. #ifdef BIG_ENDIAN_HOST
  2822. OL_IF_SWAPBO(peer->txrx_peer->security[sec_index].michael_key[0],
  2823. sizeof(peer->txrx_peer->security[sec_index].michael_key));
  2824. #endif /* BIG_ENDIAN_HOST */
  2825. #endif
  2826. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  2827. if (sec_type != cdp_sec_type_wapi) {
  2828. qdf_mem_zero(peer->tids_last_pn_valid, _EXT_TIDS);
  2829. } else {
  2830. for (i = 0; i < DP_MAX_TIDS; i++) {
  2831. /*
  2832. * Setting PN valid bit for WAPI sec_type,
  2833. * since WAPI PN has to be started with predefined value
  2834. */
  2835. peer->tids_last_pn_valid[i] = 1;
  2836. qdf_mem_copy(
  2837. (u_int8_t *) &peer->tids_last_pn[i],
  2838. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  2839. peer->tids_last_pn[i].pn128[1] =
  2840. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  2841. peer->tids_last_pn[i].pn128[0] =
  2842. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  2843. }
  2844. }
  2845. #endif
  2846. /* TODO: Update HW TID queue with PN check parameters (pn type for
  2847. * all security types and last pn for WAPI) once REO command API
  2848. * is available
  2849. */
  2850. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  2851. }
  2852. #ifdef QCA_PEER_EXT_STATS
  2853. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  2854. struct dp_txrx_peer *txrx_peer)
  2855. {
  2856. uint8_t tid, ctx_id;
  2857. if (!soc || !txrx_peer) {
  2858. dp_warn("Null soc%pK or peer%pK", soc, txrx_peer);
  2859. return QDF_STATUS_E_INVAL;
  2860. }
  2861. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  2862. return QDF_STATUS_SUCCESS;
  2863. /*
  2864. * Allocate memory for peer extended stats.
  2865. */
  2866. txrx_peer->delay_stats =
  2867. qdf_mem_malloc(sizeof(struct dp_peer_delay_stats));
  2868. if (!txrx_peer->delay_stats) {
  2869. dp_err("Peer extended stats obj alloc failed!!");
  2870. return QDF_STATUS_E_NOMEM;
  2871. }
  2872. for (tid = 0; tid < CDP_MAX_DATA_TIDS; tid++) {
  2873. for (ctx_id = 0; ctx_id < CDP_MAX_TXRX_CTX; ctx_id++) {
  2874. struct cdp_delay_tx_stats *tx_delay =
  2875. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].tx_delay;
  2876. struct cdp_delay_rx_stats *rx_delay =
  2877. &txrx_peer->delay_stats->delay_tid_stats[tid][ctx_id].rx_delay;
  2878. dp_hist_init(&tx_delay->tx_swq_delay,
  2879. CDP_HIST_TYPE_SW_ENQEUE_DELAY);
  2880. dp_hist_init(&tx_delay->hwtx_delay,
  2881. CDP_HIST_TYPE_HW_COMP_DELAY);
  2882. dp_hist_init(&rx_delay->to_stack_delay,
  2883. CDP_HIST_TYPE_REAP_STACK);
  2884. }
  2885. }
  2886. return QDF_STATUS_SUCCESS;
  2887. }
  2888. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  2889. struct dp_txrx_peer *txrx_peer)
  2890. {
  2891. if (!txrx_peer) {
  2892. dp_warn("peer_ext dealloc failed due to NULL peer object");
  2893. return;
  2894. }
  2895. if (!wlan_cfg_is_peer_ext_stats_enabled(soc->wlan_cfg_ctx))
  2896. return;
  2897. if (!txrx_peer->delay_stats)
  2898. return;
  2899. qdf_mem_free(txrx_peer->delay_stats);
  2900. txrx_peer->delay_stats = NULL;
  2901. }
  2902. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  2903. {
  2904. if (txrx_peer->delay_stats)
  2905. qdf_mem_zero(txrx_peer->delay_stats,
  2906. sizeof(struct dp_peer_delay_stats));
  2907. }
  2908. #endif
  2909. #ifdef WLAN_PEER_JITTER
  2910. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  2911. struct dp_txrx_peer *txrx_peer)
  2912. {
  2913. if (!pdev || !txrx_peer) {
  2914. dp_warn("Null pdev or peer");
  2915. return QDF_STATUS_E_INVAL;
  2916. }
  2917. if (!wlan_cfg_is_peer_jitter_stats_enabled(pdev->soc->wlan_cfg_ctx))
  2918. return QDF_STATUS_SUCCESS;
  2919. if (wlan_cfg_get_dp_pdev_nss_enabled(pdev->wlan_cfg_ctx)) {
  2920. /*
  2921. * Allocate memory on per tid basis when nss is enabled
  2922. */
  2923. txrx_peer->jitter_stats =
  2924. qdf_mem_malloc(sizeof(struct cdp_peer_tid_stats)
  2925. * DP_MAX_TIDS);
  2926. } else {
  2927. /*
  2928. * Allocate memory on per tid per ring basis
  2929. */
  2930. txrx_peer->jitter_stats =
  2931. qdf_mem_malloc(sizeof(struct cdp_peer_tid_stats)
  2932. * DP_MAX_TIDS * CDP_MAX_TXRX_CTX);
  2933. }
  2934. if (!txrx_peer->jitter_stats) {
  2935. dp_warn("Jitter stats obj alloc failed!!");
  2936. return QDF_STATUS_E_NOMEM;
  2937. }
  2938. return QDF_STATUS_SUCCESS;
  2939. }
  2940. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  2941. struct dp_txrx_peer *txrx_peer)
  2942. {
  2943. if (!pdev || !txrx_peer) {
  2944. dp_warn("Null pdev or peer");
  2945. return;
  2946. }
  2947. if (!wlan_cfg_is_peer_jitter_stats_enabled(pdev->soc->wlan_cfg_ctx))
  2948. return;
  2949. if (txrx_peer->jitter_stats) {
  2950. qdf_mem_free(txrx_peer->jitter_stats);
  2951. txrx_peer->jitter_stats = NULL;
  2952. }
  2953. }
  2954. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  2955. {
  2956. struct cdp_peer_tid_stats *jitter_stats = NULL;
  2957. if (!txrx_peer) {
  2958. dp_warn("Null peer");
  2959. return;
  2960. }
  2961. if (!wlan_cfg_is_peer_jitter_stats_enabled(txrx_peer->
  2962. vdev->
  2963. pdev->soc->wlan_cfg_ctx))
  2964. return;
  2965. jitter_stats = txrx_peer->jitter_stats;
  2966. if (!jitter_stats)
  2967. return;
  2968. if (wlan_cfg_get_dp_pdev_nss_enabled(txrx_peer->
  2969. vdev->pdev->wlan_cfg_ctx))
  2970. qdf_mem_zero(jitter_stats,
  2971. sizeof(struct cdp_peer_tid_stats) *
  2972. DP_MAX_TIDS);
  2973. else
  2974. qdf_mem_zero(jitter_stats,
  2975. sizeof(struct cdp_peer_tid_stats) *
  2976. DP_MAX_TIDS * CDP_MAX_TXRX_CTX);
  2977. }
  2978. #endif
  2979. #ifdef DP_PEER_EXTENDED_API
  2980. /**
  2981. * dp_peer_set_bw() - Set bandwidth and mpdu retry count threshold for peer
  2982. * @soc: DP soc handle
  2983. * @txrx_peer: Core txrx_peer handle
  2984. * @set_bw: enum of bandwidth to be set for this peer connection
  2985. *
  2986. * Return: None
  2987. */
  2988. static void dp_peer_set_bw(struct dp_soc *soc, struct dp_txrx_peer *txrx_peer,
  2989. enum cdp_peer_bw set_bw)
  2990. {
  2991. if (!txrx_peer)
  2992. return;
  2993. txrx_peer->bw = set_bw;
  2994. switch (set_bw) {
  2995. case CDP_160_MHZ:
  2996. case CDP_320_MHZ:
  2997. txrx_peer->mpdu_retry_threshold =
  2998. soc->wlan_cfg_ctx->mpdu_retry_threshold_2;
  2999. break;
  3000. case CDP_20_MHZ:
  3001. case CDP_40_MHZ:
  3002. case CDP_80_MHZ:
  3003. default:
  3004. txrx_peer->mpdu_retry_threshold =
  3005. soc->wlan_cfg_ctx->mpdu_retry_threshold_1;
  3006. break;
  3007. }
  3008. dp_info("Peer id: %u: BW: %u, mpdu retry threshold: %u",
  3009. txrx_peer->peer_id, txrx_peer->bw,
  3010. txrx_peer->mpdu_retry_threshold);
  3011. }
  3012. #ifdef WLAN_FEATURE_11BE_MLO
  3013. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  3014. struct ol_txrx_desc_type *sta_desc)
  3015. {
  3016. struct dp_peer *peer;
  3017. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3018. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  3019. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  3020. if (!peer)
  3021. return QDF_STATUS_E_FAULT;
  3022. qdf_spin_lock_bh(&peer->peer_info_lock);
  3023. peer->state = OL_TXRX_PEER_STATE_CONN;
  3024. qdf_spin_unlock_bh(&peer->peer_info_lock);
  3025. dp_peer_set_bw(soc, peer->txrx_peer, sta_desc->bw);
  3026. dp_rx_flush_rx_cached(peer, false);
  3027. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  3028. dp_peer_info("register for mld peer" QDF_MAC_ADDR_FMT,
  3029. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw));
  3030. qdf_spin_lock_bh(&peer->mld_peer->peer_info_lock);
  3031. peer->mld_peer->state = peer->state;
  3032. qdf_spin_unlock_bh(&peer->mld_peer->peer_info_lock);
  3033. dp_rx_flush_rx_cached(peer->mld_peer, false);
  3034. }
  3035. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3036. return QDF_STATUS_SUCCESS;
  3037. }
  3038. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  3039. enum ol_txrx_peer_state state)
  3040. {
  3041. struct dp_peer *peer;
  3042. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3043. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  3044. DP_MOD_ID_CDP);
  3045. if (!peer) {
  3046. dp_peer_err("%pK: Failed to find peer[" QDF_MAC_ADDR_FMT "]",
  3047. soc, QDF_MAC_ADDR_REF(peer_mac));
  3048. return QDF_STATUS_E_FAILURE;
  3049. }
  3050. peer->state = state;
  3051. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  3052. if (peer->txrx_peer)
  3053. peer->txrx_peer->authorize = peer->authorize;
  3054. dp_peer_info("peer" QDF_MAC_ADDR_FMT "state %d",
  3055. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  3056. peer->state);
  3057. if (IS_MLO_DP_LINK_PEER(peer) && peer->first_link) {
  3058. peer->mld_peer->state = peer->state;
  3059. peer->mld_peer->txrx_peer->authorize = peer->authorize;
  3060. dp_peer_info("mld peer" QDF_MAC_ADDR_FMT "state %d",
  3061. QDF_MAC_ADDR_REF(peer->mld_peer->mac_addr.raw),
  3062. peer->mld_peer->state);
  3063. }
  3064. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  3065. * Decrement it here.
  3066. */
  3067. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3068. return QDF_STATUS_SUCCESS;
  3069. }
  3070. #else
  3071. QDF_STATUS dp_register_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  3072. struct ol_txrx_desc_type *sta_desc)
  3073. {
  3074. struct dp_peer *peer;
  3075. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3076. peer = dp_peer_find_hash_find(soc, sta_desc->peer_addr.bytes,
  3077. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  3078. if (!peer)
  3079. return QDF_STATUS_E_FAULT;
  3080. qdf_spin_lock_bh(&peer->peer_info_lock);
  3081. peer->state = OL_TXRX_PEER_STATE_CONN;
  3082. qdf_spin_unlock_bh(&peer->peer_info_lock);
  3083. dp_peer_set_bw(soc, peer->txrx_peer, sta_desc->bw);
  3084. dp_rx_flush_rx_cached(peer, false);
  3085. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3086. return QDF_STATUS_SUCCESS;
  3087. }
  3088. QDF_STATUS dp_peer_state_update(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  3089. enum ol_txrx_peer_state state)
  3090. {
  3091. struct dp_peer *peer;
  3092. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3093. peer = dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  3094. DP_MOD_ID_CDP);
  3095. if (!peer) {
  3096. dp_peer_err("%pK: Failed to find peer for: [" QDF_MAC_ADDR_FMT "]",
  3097. soc, QDF_MAC_ADDR_REF(peer_mac));
  3098. return QDF_STATUS_E_FAILURE;
  3099. }
  3100. peer->state = state;
  3101. peer->authorize = (state == OL_TXRX_PEER_STATE_AUTH) ? 1 : 0;
  3102. if (peer->txrx_peer)
  3103. peer->txrx_peer->authorize = peer->authorize;
  3104. dp_info("peer %pK state %d", peer, peer->state);
  3105. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  3106. * Decrement it here.
  3107. */
  3108. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3109. return QDF_STATUS_SUCCESS;
  3110. }
  3111. #endif
  3112. QDF_STATUS
  3113. dp_clear_peer(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  3114. struct qdf_mac_addr peer_addr)
  3115. {
  3116. struct dp_peer *peer;
  3117. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3118. peer = dp_peer_find_hash_find(soc, peer_addr.bytes,
  3119. 0, DP_VDEV_ALL, DP_MOD_ID_CDP);
  3120. if (!peer)
  3121. return QDF_STATUS_E_FAULT;
  3122. if (!peer->valid) {
  3123. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3124. return QDF_STATUS_E_FAULT;
  3125. }
  3126. dp_clear_peer_internal(soc, peer);
  3127. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3128. return QDF_STATUS_SUCCESS;
  3129. }
  3130. QDF_STATUS dp_get_vdevid(struct cdp_soc_t *soc_hdl, uint8_t *peer_mac,
  3131. uint8_t *vdev_id)
  3132. {
  3133. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3134. struct dp_peer *peer =
  3135. dp_peer_find_hash_find(soc, peer_mac, 0, DP_VDEV_ALL,
  3136. DP_MOD_ID_CDP);
  3137. if (!peer)
  3138. return QDF_STATUS_E_FAILURE;
  3139. dp_info("peer %pK vdev %pK vdev id %d",
  3140. peer, peer->vdev, peer->vdev->vdev_id);
  3141. *vdev_id = peer->vdev->vdev_id;
  3142. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  3143. * Decrement it here.
  3144. */
  3145. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3146. return QDF_STATUS_SUCCESS;
  3147. }
  3148. struct cdp_vdev *
  3149. dp_get_vdev_by_peer_addr(struct cdp_pdev *pdev_handle,
  3150. struct qdf_mac_addr peer_addr)
  3151. {
  3152. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  3153. struct dp_peer *peer = NULL;
  3154. struct cdp_vdev *vdev = NULL;
  3155. if (!pdev) {
  3156. dp_peer_info("PDEV not found for peer_addr: " QDF_MAC_ADDR_FMT,
  3157. QDF_MAC_ADDR_REF(peer_addr.bytes));
  3158. return NULL;
  3159. }
  3160. peer = dp_peer_find_hash_find(pdev->soc, peer_addr.bytes, 0,
  3161. DP_VDEV_ALL, DP_MOD_ID_CDP);
  3162. if (!peer) {
  3163. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  3164. "PDEV not found for peer_addr: "QDF_MAC_ADDR_FMT,
  3165. QDF_MAC_ADDR_REF(peer_addr.bytes));
  3166. return NULL;
  3167. }
  3168. vdev = (struct cdp_vdev *)peer->vdev;
  3169. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3170. return vdev;
  3171. }
  3172. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  3173. {
  3174. struct dp_peer *peer = peer_handle;
  3175. DP_TRACE(DEBUG, "peer %pK vdev %pK", peer, peer->vdev);
  3176. return (struct cdp_vdev *)peer->vdev;
  3177. }
  3178. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  3179. {
  3180. struct dp_peer *peer = peer_handle;
  3181. uint8_t *mac;
  3182. mac = peer->mac_addr.raw;
  3183. dp_info("peer %pK mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  3184. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  3185. return peer->mac_addr.raw;
  3186. }
  3187. int dp_get_peer_state(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  3188. uint8_t *peer_mac)
  3189. {
  3190. enum ol_txrx_peer_state peer_state;
  3191. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3192. struct cdp_peer_info peer_info = { 0 };
  3193. struct dp_peer *peer;
  3194. struct dp_peer *tgt_peer;
  3195. DP_PEER_INFO_PARAMS_INIT(&peer_info, vdev_id, peer_mac,
  3196. false, CDP_WILD_PEER_TYPE);
  3197. peer = dp_peer_hash_find_wrapper(soc, &peer_info, DP_MOD_ID_CDP);
  3198. if (!peer)
  3199. return OL_TXRX_PEER_STATE_INVALID;
  3200. DP_TRACE(DEBUG, "peer %pK stats %d", peer, peer->state);
  3201. tgt_peer = dp_get_tgt_peer_from_peer(peer);
  3202. peer_state = tgt_peer->state;
  3203. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3204. return peer_state;
  3205. }
  3206. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  3207. {
  3208. int i;
  3209. /* point the freelist to the first ID */
  3210. pdev->local_peer_ids.freelist = 0;
  3211. /* link each ID to the next one */
  3212. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  3213. pdev->local_peer_ids.pool[i] = i + 1;
  3214. pdev->local_peer_ids.map[i] = NULL;
  3215. }
  3216. /* link the last ID to itself, to mark the end of the list */
  3217. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  3218. pdev->local_peer_ids.pool[i] = i;
  3219. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  3220. dp_info("Peer pool init");
  3221. }
  3222. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  3223. {
  3224. int i;
  3225. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  3226. i = pdev->local_peer_ids.freelist;
  3227. if (pdev->local_peer_ids.pool[i] == i) {
  3228. /* the list is empty, except for the list-end marker */
  3229. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  3230. } else {
  3231. /* take the head ID and advance the freelist */
  3232. peer->local_id = i;
  3233. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  3234. pdev->local_peer_ids.map[i] = peer;
  3235. }
  3236. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  3237. dp_info("peer %pK, local id %d", peer, peer->local_id);
  3238. }
  3239. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  3240. {
  3241. int i = peer->local_id;
  3242. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  3243. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  3244. return;
  3245. }
  3246. /* put this ID on the head of the freelist */
  3247. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  3248. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  3249. pdev->local_peer_ids.freelist = i;
  3250. pdev->local_peer_ids.map[i] = NULL;
  3251. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  3252. }
  3253. bool dp_find_peer_exist_on_vdev(struct cdp_soc_t *soc_hdl,
  3254. uint8_t vdev_id, uint8_t *peer_addr)
  3255. {
  3256. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3257. struct dp_peer *peer = NULL;
  3258. peer = dp_peer_find_hash_find(soc, peer_addr, 0, vdev_id,
  3259. DP_MOD_ID_CDP);
  3260. if (!peer)
  3261. return false;
  3262. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3263. return true;
  3264. }
  3265. bool dp_find_peer_exist_on_other_vdev(struct cdp_soc_t *soc_hdl,
  3266. uint8_t vdev_id, uint8_t *peer_addr,
  3267. uint16_t max_bssid)
  3268. {
  3269. int i;
  3270. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3271. struct dp_peer *peer = NULL;
  3272. for (i = 0; i < max_bssid; i++) {
  3273. /* Need to check vdevs other than the vdev_id */
  3274. if (vdev_id == i)
  3275. continue;
  3276. peer = dp_peer_find_hash_find(soc, peer_addr, 0, i,
  3277. DP_MOD_ID_CDP);
  3278. if (peer) {
  3279. dp_err("Duplicate peer "QDF_MAC_ADDR_FMT" already exist on vdev %d",
  3280. QDF_MAC_ADDR_REF(peer_addr), i);
  3281. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3282. return true;
  3283. }
  3284. }
  3285. return false;
  3286. }
  3287. void dp_set_peer_as_tdls_peer(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  3288. uint8_t *peer_mac, bool val)
  3289. {
  3290. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3291. struct dp_peer *peer = NULL;
  3292. peer = dp_peer_find_hash_find(soc, peer_mac, 0, vdev_id,
  3293. DP_MOD_ID_CDP);
  3294. if (!peer) {
  3295. dp_err("Failed to find peer for:" QDF_MAC_ADDR_FMT,
  3296. QDF_MAC_ADDR_REF(peer_mac));
  3297. return;
  3298. }
  3299. dp_info("Set tdls flag %d for peer:" QDF_MAC_ADDR_FMT,
  3300. val, QDF_MAC_ADDR_REF(peer_mac));
  3301. peer->is_tdls_peer = val;
  3302. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3303. }
  3304. #endif
  3305. bool dp_find_peer_exist(struct cdp_soc_t *soc_hdl, uint8_t pdev_id,
  3306. uint8_t *peer_addr)
  3307. {
  3308. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3309. struct dp_peer *peer = NULL;
  3310. peer = dp_peer_find_hash_find(soc, peer_addr, 0, DP_VDEV_ALL,
  3311. DP_MOD_ID_CDP);
  3312. if (peer) {
  3313. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3314. return true;
  3315. }
  3316. return false;
  3317. }
  3318. QDF_STATUS
  3319. dp_set_michael_key(struct cdp_soc_t *soc,
  3320. uint8_t vdev_id,
  3321. uint8_t *peer_mac,
  3322. bool is_unicast, uint32_t *key)
  3323. {
  3324. uint8_t sec_index = is_unicast ? 1 : 0;
  3325. struct dp_peer *peer =
  3326. dp_peer_get_tgt_peer_hash_find((struct dp_soc *)soc,
  3327. peer_mac, 0, vdev_id,
  3328. DP_MOD_ID_CDP);
  3329. if (!peer) {
  3330. dp_peer_err("%pK: peer not found ", soc);
  3331. return QDF_STATUS_E_FAILURE;
  3332. }
  3333. qdf_mem_copy(&peer->txrx_peer->security[sec_index].michael_key[0],
  3334. key, IEEE80211_WEP_MICLEN);
  3335. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3336. return QDF_STATUS_SUCCESS;
  3337. }
  3338. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  3339. struct dp_vdev *vdev,
  3340. enum dp_mod_id mod_id)
  3341. {
  3342. struct dp_peer *peer = NULL;
  3343. qdf_spin_lock_bh(&vdev->peer_list_lock);
  3344. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  3345. if (peer->bss_peer)
  3346. break;
  3347. }
  3348. if (!peer) {
  3349. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3350. return NULL;
  3351. }
  3352. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  3353. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3354. return peer;
  3355. }
  3356. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3357. return peer;
  3358. }
  3359. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  3360. struct dp_vdev *vdev,
  3361. enum dp_mod_id mod_id)
  3362. {
  3363. struct dp_peer *peer;
  3364. if (vdev->opmode != wlan_op_mode_sta)
  3365. return NULL;
  3366. qdf_spin_lock_bh(&vdev->peer_list_lock);
  3367. TAILQ_FOREACH(peer, &vdev->peer_list, peer_list_elem) {
  3368. if (peer->sta_self_peer)
  3369. break;
  3370. }
  3371. if (!peer) {
  3372. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3373. return NULL;
  3374. }
  3375. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  3376. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3377. return peer;
  3378. }
  3379. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  3380. return peer;
  3381. }
  3382. void dp_peer_flush_frags(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  3383. uint8_t *peer_mac)
  3384. {
  3385. struct dp_soc *soc = cdp_soc_t_to_dp_soc(soc_hdl);
  3386. struct dp_peer *peer = dp_peer_get_tgt_peer_hash_find(soc, peer_mac, 0,
  3387. vdev_id,
  3388. DP_MOD_ID_CDP);
  3389. struct dp_txrx_peer *txrx_peer;
  3390. uint8_t tid;
  3391. struct dp_rx_tid_defrag *defrag_rx_tid;
  3392. if (!peer)
  3393. return;
  3394. if (!peer->txrx_peer)
  3395. goto fail;
  3396. dp_info("Flushing fragments for peer " QDF_MAC_ADDR_FMT,
  3397. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  3398. txrx_peer = peer->txrx_peer;
  3399. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  3400. defrag_rx_tid = &txrx_peer->rx_tid[tid];
  3401. qdf_spin_lock_bh(&defrag_rx_tid->defrag_tid_lock);
  3402. dp_rx_defrag_waitlist_remove(txrx_peer, tid);
  3403. dp_rx_reorder_flush_frag(txrx_peer, tid);
  3404. qdf_spin_unlock_bh(&defrag_rx_tid->defrag_tid_lock);
  3405. }
  3406. fail:
  3407. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  3408. }
  3409. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id)
  3410. {
  3411. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id,
  3412. DP_MOD_ID_HTT);
  3413. if (peer) {
  3414. /*
  3415. * Decrement the peer ref which is taken as part of
  3416. * dp_peer_get_ref_by_id if PEER_LOCK_REF_PROTECT is enabled
  3417. */
  3418. dp_peer_unref_delete(peer, DP_MOD_ID_HTT);
  3419. return true;
  3420. }
  3421. return false;
  3422. }
  3423. qdf_export_symbol(dp_peer_find_by_id_valid);
  3424. #ifdef QCA_MULTIPASS_SUPPORT
  3425. void dp_peer_multipass_list_remove(struct dp_peer *peer)
  3426. {
  3427. struct dp_vdev *vdev = peer->vdev;
  3428. struct dp_txrx_peer *tpeer = NULL;
  3429. bool found = 0;
  3430. qdf_spin_lock_bh(&vdev->mpass_peer_mutex);
  3431. TAILQ_FOREACH(tpeer, &vdev->mpass_peer_list, mpass_peer_list_elem) {
  3432. if (tpeer == peer->txrx_peer) {
  3433. found = 1;
  3434. TAILQ_REMOVE(&vdev->mpass_peer_list, peer->txrx_peer,
  3435. mpass_peer_list_elem);
  3436. break;
  3437. }
  3438. }
  3439. qdf_spin_unlock_bh(&vdev->mpass_peer_mutex);
  3440. if (found)
  3441. dp_peer_unref_delete(peer, DP_MOD_ID_TX_MULTIPASS);
  3442. }
  3443. /**
  3444. * dp_peer_multipass_list_add() - add to new multipass list
  3445. * @soc: soc handle
  3446. * @peer_mac: mac address
  3447. * @vdev_id: vdev id for peer
  3448. * @vlan_id: vlan_id
  3449. *
  3450. * return: void
  3451. */
  3452. static void dp_peer_multipass_list_add(struct dp_soc *soc, uint8_t *peer_mac,
  3453. uint8_t vdev_id, uint16_t vlan_id)
  3454. {
  3455. struct dp_peer *peer =
  3456. dp_peer_get_tgt_peer_hash_find(soc, peer_mac, 0,
  3457. vdev_id,
  3458. DP_MOD_ID_TX_MULTIPASS);
  3459. if (qdf_unlikely(!peer)) {
  3460. qdf_err("NULL peer");
  3461. return;
  3462. }
  3463. if (qdf_unlikely(!peer->txrx_peer))
  3464. goto fail;
  3465. /* If peer already exists in vdev multipass list, do not add it.
  3466. * This may happen if key install comes twice or re-key
  3467. * happens for a peer.
  3468. */
  3469. if (peer->txrx_peer->vlan_id) {
  3470. dp_debug("peer already added to vdev multipass list"
  3471. "MAC: "QDF_MAC_ADDR_FMT" vlan: %d ",
  3472. QDF_MAC_ADDR_REF(peer->mac_addr.raw),
  3473. peer->txrx_peer->vlan_id);
  3474. goto fail;
  3475. }
  3476. /*
  3477. * Ref_cnt is incremented inside dp_peer_find_hash_find().
  3478. * Decrement it when element is deleted from the list.
  3479. */
  3480. peer->txrx_peer->vlan_id = vlan_id;
  3481. qdf_spin_lock_bh(&peer->txrx_peer->vdev->mpass_peer_mutex);
  3482. TAILQ_INSERT_HEAD(&peer->txrx_peer->vdev->mpass_peer_list,
  3483. peer->txrx_peer,
  3484. mpass_peer_list_elem);
  3485. qdf_spin_unlock_bh(&peer->txrx_peer->vdev->mpass_peer_mutex);
  3486. return;
  3487. fail:
  3488. dp_peer_unref_delete(peer, DP_MOD_ID_TX_MULTIPASS);
  3489. }
  3490. void dp_peer_set_vlan_id(struct cdp_soc_t *cdp_soc,
  3491. uint8_t vdev_id, uint8_t *peer_mac,
  3492. uint16_t vlan_id)
  3493. {
  3494. struct dp_soc *soc = (struct dp_soc *)cdp_soc;
  3495. struct dp_vdev *vdev =
  3496. dp_vdev_get_ref_by_id((struct dp_soc *)soc, vdev_id,
  3497. DP_MOD_ID_TX_MULTIPASS);
  3498. dp_info("vdev_id %d, vdev %pK, multipass_en %d, peer_mac " QDF_MAC_ADDR_FMT " vlan %d",
  3499. vdev_id, vdev, vdev ? vdev->multipass_en : 0,
  3500. QDF_MAC_ADDR_REF(peer_mac), vlan_id);
  3501. if (vdev && vdev->multipass_en) {
  3502. dp_peer_multipass_list_add(soc, peer_mac, vdev_id, vlan_id);
  3503. dp_vdev_unref_delete(soc, vdev, DP_MOD_ID_TX_MULTIPASS);
  3504. }
  3505. }
  3506. #endif /* QCA_MULTIPASS_SUPPORT */