dp_peer.c 115 KB

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