dp_peer.c 119 KB

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