dp_peer.c 107 KB

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