dp_peer.c 119 KB

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