dp_peer.c 102 KB

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