dp_peer.c 145 KB

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