dp_peer.c 115 KB

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