dp_peer.c 106 KB

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