dp_peer.c 145 KB

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