dp_peer.c 88 KB

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