dp_peer.c 89 KB

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