dp_peer.c 117 KB

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