dp_peer.c 90 KB

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