dp_peer.c 116 KB

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