dp_peer.c 104 KB

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