dp_peer.c 104 KB

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