dp_peer.c 92 KB

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