dp_peer.c 92 KB

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