dp_peer.c 96 KB

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