dp_peer.c 115 KB

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