dp_peer.c 89 KB

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