dp_peer.c 106 KB

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