dp_peer.c 95 KB

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