dp_peer.c 123 KB

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