dp_peer.c 148 KB

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