dp_peer.h 61 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2023 Qualcomm Innovation Center, Inc. All rights reserved.
  4. *
  5. * Permission to use, copy, modify, and/or distribute this software for
  6. * any purpose with or without fee is hereby granted, provided that the
  7. * above copyright notice and this permission notice appear in all
  8. * copies.
  9. *
  10. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  11. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  12. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  13. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  14. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  15. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  16. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  17. * PERFORMANCE OF THIS SOFTWARE.
  18. */
  19. #ifndef _DP_PEER_H_
  20. #define _DP_PEER_H_
  21. #include <qdf_types.h>
  22. #include <qdf_lock.h>
  23. #include "dp_types.h"
  24. #include "dp_internal.h"
  25. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  26. #include "hal_reo.h"
  27. #endif
  28. #define DP_INVALID_PEER_ID 0xffff
  29. #define DP_PEER_MAX_MEC_IDX 1024 /* maximum index for MEC table */
  30. #define DP_PEER_MAX_MEC_ENTRY 4096 /* maximum MEC entries in MEC table */
  31. #define DP_FW_PEER_STATS_CMP_TIMEOUT_MSEC 5000
  32. #define DP_PEER_HASH_LOAD_MULT 2
  33. #define DP_PEER_HASH_LOAD_SHIFT 0
  34. /* Threshold for peer's cached buf queue beyond which frames are dropped */
  35. #define DP_RX_CACHED_BUFQ_THRESH 64
  36. #define dp_peer_alert(params...) QDF_TRACE_FATAL(QDF_MODULE_ID_DP_PEER, params)
  37. #define dp_peer_err(params...) QDF_TRACE_ERROR(QDF_MODULE_ID_DP_PEER, params)
  38. #define dp_peer_warn(params...) QDF_TRACE_WARN(QDF_MODULE_ID_DP_PEER, params)
  39. #define dp_peer_info(params...) \
  40. __QDF_TRACE_FL(QDF_TRACE_LEVEL_INFO_HIGH, QDF_MODULE_ID_DP_PEER, ## params)
  41. #define dp_peer_debug(params...) QDF_TRACE_DEBUG(QDF_MODULE_ID_DP_PEER, params)
  42. #ifdef REO_QDESC_HISTORY
  43. enum reo_qdesc_event_type {
  44. REO_QDESC_UPDATE_CB = 0,
  45. REO_QDESC_FREE,
  46. };
  47. struct reo_qdesc_event {
  48. qdf_dma_addr_t qdesc_addr;
  49. uint64_t ts;
  50. enum reo_qdesc_event_type type;
  51. uint8_t peer_mac[QDF_MAC_ADDR_SIZE];
  52. };
  53. #endif
  54. struct ast_del_ctxt {
  55. bool age;
  56. int del_count;
  57. };
  58. #ifdef QCA_SUPPORT_WDS_EXTENDED
  59. /**
  60. * dp_peer_is_wds_ext_peer() - peer is WDS_EXT peer
  61. *
  62. * @peer: DP peer context
  63. *
  64. * This API checks whether the peer is WDS_EXT peer or not
  65. *
  66. * Return: true in the wds_ext peer else flase
  67. */
  68. static inline bool dp_peer_is_wds_ext_peer(struct dp_txrx_peer *peer)
  69. {
  70. return qdf_atomic_test_bit(WDS_EXT_PEER_INIT_BIT, &peer->wds_ext.init);
  71. }
  72. #else
  73. static inline bool dp_peer_is_wds_ext_peer(struct dp_txrx_peer *peer)
  74. {
  75. return false;
  76. }
  77. #endif
  78. typedef void dp_peer_iter_func(struct dp_soc *soc, struct dp_peer *peer,
  79. void *arg);
  80. /**
  81. * dp_peer_unref_delete() - unref and delete peer
  82. * @peer: Datapath peer handle
  83. * @id: ID of module releasing reference
  84. *
  85. */
  86. void dp_peer_unref_delete(struct dp_peer *peer, enum dp_mod_id id);
  87. /**
  88. * dp_txrx_peer_unref_delete() - unref and delete peer
  89. * @handle: Datapath txrx ref handle
  90. * @id: Module ID of the caller
  91. *
  92. */
  93. void dp_txrx_peer_unref_delete(dp_txrx_ref_handle handle, enum dp_mod_id id);
  94. /**
  95. * dp_peer_find_hash_find() - returns legacy or mlo link peer from
  96. * peer_hash_table matching vdev_id and mac_address
  97. * @soc: soc handle
  98. * @peer_mac_addr: peer mac address
  99. * @mac_addr_is_aligned: is mac addr aligned
  100. * @vdev_id: vdev_id
  101. * @mod_id: id of module requesting reference
  102. *
  103. * return: peer in success
  104. * NULL in failure
  105. */
  106. struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  107. uint8_t *peer_mac_addr,
  108. int mac_addr_is_aligned,
  109. uint8_t vdev_id,
  110. enum dp_mod_id mod_id);
  111. /**
  112. * dp_peer_find_by_id_valid - check if peer exists for given id
  113. * @soc: core DP soc context
  114. * @peer_id: peer id from peer object can be retrieved
  115. *
  116. * Return: true if peer exists of false otherwise
  117. */
  118. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id);
  119. #ifdef DP_UMAC_HW_RESET_SUPPORT
  120. void dp_reset_tid_q_setup(struct dp_soc *soc);
  121. #endif
  122. /**
  123. * dp_peer_get_ref() - Returns peer object given the peer id
  124. *
  125. * @soc: core DP soc context
  126. * @peer: DP peer
  127. * @mod_id: id of module requesting the reference
  128. *
  129. * Return: QDF_STATUS_SUCCESS if reference held successfully
  130. * else QDF_STATUS_E_INVAL
  131. */
  132. static inline
  133. QDF_STATUS dp_peer_get_ref(struct dp_soc *soc,
  134. struct dp_peer *peer,
  135. enum dp_mod_id mod_id)
  136. {
  137. if (!qdf_atomic_inc_not_zero(&peer->ref_cnt))
  138. return QDF_STATUS_E_INVAL;
  139. if (mod_id > DP_MOD_ID_RX)
  140. qdf_atomic_inc(&peer->mod_refs[mod_id]);
  141. return QDF_STATUS_SUCCESS;
  142. }
  143. /**
  144. * __dp_peer_get_ref_by_id() - Returns peer object given the peer id
  145. *
  146. * @soc: core DP soc context
  147. * @peer_id: peer id from peer object can be retrieved
  148. * @mod_id: module id
  149. *
  150. * Return: struct dp_peer*: Pointer to DP peer object
  151. */
  152. static inline struct dp_peer *
  153. __dp_peer_get_ref_by_id(struct dp_soc *soc,
  154. uint16_t peer_id,
  155. enum dp_mod_id mod_id)
  156. {
  157. struct dp_peer *peer;
  158. qdf_spin_lock_bh(&soc->peer_map_lock);
  159. peer = (peer_id >= soc->max_peer_id) ? NULL :
  160. soc->peer_id_to_obj_map[peer_id];
  161. if (!peer ||
  162. (dp_peer_get_ref(soc, peer, mod_id) != QDF_STATUS_SUCCESS)) {
  163. qdf_spin_unlock_bh(&soc->peer_map_lock);
  164. return NULL;
  165. }
  166. qdf_spin_unlock_bh(&soc->peer_map_lock);
  167. return peer;
  168. }
  169. /**
  170. * dp_peer_get_ref_by_id() - Returns peer object given the peer id
  171. * if peer state is active
  172. *
  173. * @soc: core DP soc context
  174. * @peer_id: peer id from peer object can be retrieved
  175. * @mod_id: ID of module requesting reference
  176. *
  177. * Return: struct dp_peer*: Pointer to DP peer object
  178. */
  179. static inline
  180. struct dp_peer *dp_peer_get_ref_by_id(struct dp_soc *soc,
  181. uint16_t peer_id,
  182. enum dp_mod_id mod_id)
  183. {
  184. struct dp_peer *peer;
  185. qdf_spin_lock_bh(&soc->peer_map_lock);
  186. peer = (peer_id >= soc->max_peer_id) ? NULL :
  187. soc->peer_id_to_obj_map[peer_id];
  188. if (!peer || peer->peer_state >= DP_PEER_STATE_LOGICAL_DELETE ||
  189. (dp_peer_get_ref(soc, peer, mod_id) != QDF_STATUS_SUCCESS)) {
  190. qdf_spin_unlock_bh(&soc->peer_map_lock);
  191. return NULL;
  192. }
  193. qdf_spin_unlock_bh(&soc->peer_map_lock);
  194. return peer;
  195. }
  196. /**
  197. * dp_txrx_peer_get_ref_by_id() - Returns txrx peer object given the peer id
  198. *
  199. * @soc: core DP soc context
  200. * @peer_id: peer id from peer object can be retrieved
  201. * @handle: reference handle
  202. * @mod_id: ID of module requesting reference
  203. *
  204. * Return: struct dp_txrx_peer*: Pointer to txrx DP peer object
  205. */
  206. static inline struct dp_txrx_peer *
  207. dp_txrx_peer_get_ref_by_id(struct dp_soc *soc,
  208. uint16_t peer_id,
  209. dp_txrx_ref_handle *handle,
  210. enum dp_mod_id mod_id)
  211. {
  212. struct dp_peer *peer;
  213. peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  214. if (!peer)
  215. return NULL;
  216. if (!peer->txrx_peer) {
  217. dp_peer_unref_delete(peer, mod_id);
  218. return NULL;
  219. }
  220. *handle = (dp_txrx_ref_handle)peer;
  221. return peer->txrx_peer;
  222. }
  223. #ifdef PEER_CACHE_RX_PKTS
  224. /**
  225. * dp_rx_flush_rx_cached() - flush cached rx frames
  226. * @peer: peer
  227. * @drop: set flag to drop frames
  228. *
  229. * Return: None
  230. */
  231. void dp_rx_flush_rx_cached(struct dp_peer *peer, bool drop);
  232. #else
  233. static inline void dp_rx_flush_rx_cached(struct dp_peer *peer, bool drop)
  234. {
  235. }
  236. #endif
  237. static inline void
  238. dp_clear_peer_internal(struct dp_soc *soc, struct dp_peer *peer)
  239. {
  240. qdf_spin_lock_bh(&peer->peer_info_lock);
  241. peer->state = OL_TXRX_PEER_STATE_DISC;
  242. qdf_spin_unlock_bh(&peer->peer_info_lock);
  243. dp_rx_flush_rx_cached(peer, true);
  244. }
  245. /**
  246. * dp_vdev_iterate_peer() - API to iterate through vdev peer list
  247. *
  248. * @vdev: DP vdev context
  249. * @func: function to be called for each peer
  250. * @arg: argument need to be passed to func
  251. * @mod_id: module_id
  252. *
  253. * Return: void
  254. */
  255. static inline void
  256. dp_vdev_iterate_peer(struct dp_vdev *vdev, dp_peer_iter_func *func, void *arg,
  257. enum dp_mod_id mod_id)
  258. {
  259. struct dp_peer *peer;
  260. struct dp_peer *tmp_peer;
  261. struct dp_soc *soc = NULL;
  262. if (!vdev || !vdev->pdev || !vdev->pdev->soc)
  263. return;
  264. soc = vdev->pdev->soc;
  265. qdf_spin_lock_bh(&vdev->peer_list_lock);
  266. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  267. peer_list_elem,
  268. tmp_peer) {
  269. if (dp_peer_get_ref(soc, peer, mod_id) ==
  270. QDF_STATUS_SUCCESS) {
  271. (*func)(soc, peer, arg);
  272. dp_peer_unref_delete(peer, mod_id);
  273. }
  274. }
  275. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  276. }
  277. /**
  278. * dp_pdev_iterate_peer() - API to iterate through all peers of pdev
  279. *
  280. * @pdev: DP pdev context
  281. * @func: function to be called for each peer
  282. * @arg: argument need to be passed to func
  283. * @mod_id: module_id
  284. *
  285. * Return: void
  286. */
  287. static inline void
  288. dp_pdev_iterate_peer(struct dp_pdev *pdev, dp_peer_iter_func *func, void *arg,
  289. enum dp_mod_id mod_id)
  290. {
  291. struct dp_vdev *vdev;
  292. if (!pdev)
  293. return;
  294. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  295. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev)
  296. dp_vdev_iterate_peer(vdev, func, arg, mod_id);
  297. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  298. }
  299. /**
  300. * dp_soc_iterate_peer() - API to iterate through all peers of soc
  301. *
  302. * @soc: DP soc context
  303. * @func: function to be called for each peer
  304. * @arg: argument need to be passed to func
  305. * @mod_id: module_id
  306. *
  307. * Return: void
  308. */
  309. static inline void
  310. dp_soc_iterate_peer(struct dp_soc *soc, dp_peer_iter_func *func, void *arg,
  311. enum dp_mod_id mod_id)
  312. {
  313. struct dp_pdev *pdev;
  314. int i;
  315. if (!soc)
  316. return;
  317. for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) {
  318. pdev = soc->pdev_list[i];
  319. dp_pdev_iterate_peer(pdev, func, arg, mod_id);
  320. }
  321. }
  322. /**
  323. * dp_vdev_iterate_peer_lock_safe() - API to iterate through vdev list
  324. *
  325. * This API will cache the peers in local allocated memory and calls
  326. * iterate function outside the lock.
  327. *
  328. * As this API is allocating new memory it is suggested to use this
  329. * only when lock cannot be held
  330. *
  331. * @vdev: DP vdev context
  332. * @func: function to be called for each peer
  333. * @arg: argument need to be passed to func
  334. * @mod_id: module_id
  335. *
  336. * Return: void
  337. */
  338. static inline void
  339. dp_vdev_iterate_peer_lock_safe(struct dp_vdev *vdev,
  340. dp_peer_iter_func *func,
  341. void *arg,
  342. enum dp_mod_id mod_id)
  343. {
  344. struct dp_peer *peer;
  345. struct dp_peer *tmp_peer;
  346. struct dp_soc *soc = NULL;
  347. struct dp_peer **peer_array = NULL;
  348. int i = 0;
  349. uint32_t num_peers = 0;
  350. if (!vdev || !vdev->pdev || !vdev->pdev->soc)
  351. return;
  352. num_peers = vdev->num_peers;
  353. soc = vdev->pdev->soc;
  354. peer_array = qdf_mem_malloc(num_peers * sizeof(struct dp_peer *));
  355. if (!peer_array)
  356. return;
  357. qdf_spin_lock_bh(&vdev->peer_list_lock);
  358. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  359. peer_list_elem,
  360. tmp_peer) {
  361. if (i >= num_peers)
  362. break;
  363. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  364. peer_array[i] = peer;
  365. i = (i + 1);
  366. }
  367. }
  368. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  369. for (i = 0; i < num_peers; i++) {
  370. peer = peer_array[i];
  371. if (!peer)
  372. continue;
  373. (*func)(soc, peer, arg);
  374. dp_peer_unref_delete(peer, mod_id);
  375. }
  376. qdf_mem_free(peer_array);
  377. }
  378. /**
  379. * dp_pdev_iterate_peer_lock_safe() - API to iterate through all peers of pdev
  380. *
  381. * This API will cache the peers in local allocated memory and calls
  382. * iterate function outside the lock.
  383. *
  384. * As this API is allocating new memory it is suggested to use this
  385. * only when lock cannot be held
  386. *
  387. * @pdev: DP pdev context
  388. * @func: function to be called for each peer
  389. * @arg: argument need to be passed to func
  390. * @mod_id: module_id
  391. *
  392. * Return: void
  393. */
  394. static inline void
  395. dp_pdev_iterate_peer_lock_safe(struct dp_pdev *pdev,
  396. dp_peer_iter_func *func,
  397. void *arg,
  398. enum dp_mod_id mod_id)
  399. {
  400. struct dp_peer *peer;
  401. struct dp_peer *tmp_peer;
  402. struct dp_soc *soc = NULL;
  403. struct dp_vdev *vdev = NULL;
  404. struct dp_peer **peer_array[DP_PDEV_MAX_VDEVS] = {0};
  405. int i = 0;
  406. int j = 0;
  407. uint32_t num_peers[DP_PDEV_MAX_VDEVS] = {0};
  408. if (!pdev || !pdev->soc)
  409. return;
  410. soc = pdev->soc;
  411. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  412. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  413. num_peers[i] = vdev->num_peers;
  414. peer_array[i] = qdf_mem_malloc(num_peers[i] *
  415. sizeof(struct dp_peer *));
  416. if (!peer_array[i])
  417. break;
  418. qdf_spin_lock_bh(&vdev->peer_list_lock);
  419. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  420. peer_list_elem,
  421. tmp_peer) {
  422. if (j >= num_peers[i])
  423. break;
  424. if (dp_peer_get_ref(soc, peer, mod_id) ==
  425. QDF_STATUS_SUCCESS) {
  426. peer_array[i][j] = peer;
  427. j = (j + 1);
  428. }
  429. }
  430. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  431. i = (i + 1);
  432. }
  433. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  434. for (i = 0; i < DP_PDEV_MAX_VDEVS; i++) {
  435. if (!peer_array[i])
  436. break;
  437. for (j = 0; j < num_peers[i]; j++) {
  438. peer = peer_array[i][j];
  439. if (!peer)
  440. continue;
  441. (*func)(soc, peer, arg);
  442. dp_peer_unref_delete(peer, mod_id);
  443. }
  444. qdf_mem_free(peer_array[i]);
  445. }
  446. }
  447. /**
  448. * dp_soc_iterate_peer_lock_safe() - API to iterate through all peers of soc
  449. *
  450. * This API will cache the peers in local allocated memory and calls
  451. * iterate function outside the lock.
  452. *
  453. * As this API is allocating new memory it is suggested to use this
  454. * only when lock cannot be held
  455. *
  456. * @soc: DP soc context
  457. * @func: function to be called for each peer
  458. * @arg: argument need to be passed to func
  459. * @mod_id: module_id
  460. *
  461. * Return: void
  462. */
  463. static inline void
  464. dp_soc_iterate_peer_lock_safe(struct dp_soc *soc,
  465. dp_peer_iter_func *func,
  466. void *arg,
  467. enum dp_mod_id mod_id)
  468. {
  469. struct dp_pdev *pdev;
  470. int i;
  471. if (!soc)
  472. return;
  473. for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) {
  474. pdev = soc->pdev_list[i];
  475. dp_pdev_iterate_peer_lock_safe(pdev, func, arg, mod_id);
  476. }
  477. }
  478. #ifdef DP_PEER_STATE_DEBUG
  479. #define DP_PEER_STATE_ASSERT(_peer, _new_state, _condition) \
  480. do { \
  481. if (!(_condition)) { \
  482. dp_alert("Invalid state shift from %u to %u peer " \
  483. QDF_MAC_ADDR_FMT, \
  484. (_peer)->peer_state, (_new_state), \
  485. QDF_MAC_ADDR_REF((_peer)->mac_addr.raw)); \
  486. QDF_ASSERT(0); \
  487. } \
  488. } while (0)
  489. #else
  490. #define DP_PEER_STATE_ASSERT(_peer, _new_state, _condition) \
  491. do { \
  492. if (!(_condition)) { \
  493. dp_alert("Invalid state shift from %u to %u peer " \
  494. QDF_MAC_ADDR_FMT, \
  495. (_peer)->peer_state, (_new_state), \
  496. QDF_MAC_ADDR_REF((_peer)->mac_addr.raw)); \
  497. } \
  498. } while (0)
  499. #endif
  500. /**
  501. * dp_peer_state_cmp() - compare dp peer state
  502. *
  503. * @peer: DP peer
  504. * @state: state
  505. *
  506. * Return: true if state matches with peer state
  507. * false if it does not match
  508. */
  509. static inline bool
  510. dp_peer_state_cmp(struct dp_peer *peer,
  511. enum dp_peer_state state)
  512. {
  513. bool is_status_equal = false;
  514. qdf_spin_lock_bh(&peer->peer_state_lock);
  515. is_status_equal = (peer->peer_state == state);
  516. qdf_spin_unlock_bh(&peer->peer_state_lock);
  517. return is_status_equal;
  518. }
  519. /**
  520. * dp_print_ast_stats() - Dump AST table contents
  521. * @soc: Datapath soc handle
  522. *
  523. * Return: void
  524. */
  525. void dp_print_ast_stats(struct dp_soc *soc);
  526. /**
  527. * dp_rx_peer_map_handler() - handle peer map event from firmware
  528. * @soc: generic soc handle
  529. * @peer_id: peer_id from firmware
  530. * @hw_peer_id: ast index for this peer
  531. * @vdev_id: vdev ID
  532. * @peer_mac_addr: mac address of the peer
  533. * @ast_hash: ast hash value
  534. * @is_wds: flag to indicate peer map event for WDS ast entry
  535. *
  536. * associate the peer_id that firmware provided with peer entry
  537. * and update the ast table in the host with the hw_peer_id.
  538. *
  539. * Return: QDF_STATUS code
  540. */
  541. QDF_STATUS dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  542. uint16_t hw_peer_id, uint8_t vdev_id,
  543. uint8_t *peer_mac_addr, uint16_t ast_hash,
  544. uint8_t is_wds);
  545. /**
  546. * dp_rx_peer_unmap_handler() - handle peer unmap event from firmware
  547. * @soc: generic soc handle
  548. * @peer_id: peer_id from firmware
  549. * @vdev_id: vdev ID
  550. * @peer_mac_addr: mac address of the peer or wds entry
  551. * @is_wds: flag to indicate peer map event for WDS ast entry
  552. * @free_wds_count: number of wds entries freed by FW with peer delete
  553. *
  554. * Return: none
  555. */
  556. void dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  557. uint8_t vdev_id, uint8_t *peer_mac_addr,
  558. uint8_t is_wds, uint32_t free_wds_count);
  559. #ifdef DP_RX_UDP_OVER_PEER_ROAM
  560. /**
  561. * dp_rx_reset_roaming_peer() - Reset the roamed peer in vdev
  562. * @soc: dp soc pointer
  563. * @vdev_id: vdev id
  564. * @peer_mac_addr: mac address of the peer
  565. *
  566. * This function resets the roamed peer auth status and mac address
  567. * after peer map indication of same peer is received from firmware.
  568. *
  569. * Return: None
  570. */
  571. void dp_rx_reset_roaming_peer(struct dp_soc *soc, uint8_t vdev_id,
  572. uint8_t *peer_mac_addr);
  573. #else
  574. static inline void dp_rx_reset_roaming_peer(struct dp_soc *soc, uint8_t vdev_id,
  575. uint8_t *peer_mac_addr)
  576. {
  577. }
  578. #endif
  579. #ifdef WLAN_FEATURE_11BE_MLO
  580. /**
  581. * dp_rx_mlo_peer_map_handler() - handle MLO peer map event from firmware
  582. * @soc: generic soc handle
  583. * @peer_id: ML peer_id from firmware
  584. * @peer_mac_addr: mac address of the peer
  585. * @mlo_flow_info: MLO AST flow info
  586. * @mlo_link_info: MLO link info
  587. *
  588. * associate the ML peer_id that firmware provided with peer entry
  589. * and update the ast table in the host with the hw_peer_id.
  590. *
  591. * Return: QDF_STATUS code
  592. */
  593. QDF_STATUS
  594. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  595. uint8_t *peer_mac_addr,
  596. struct dp_mlo_flow_override_info *mlo_flow_info,
  597. struct dp_mlo_link_info *mlo_link_info);
  598. /**
  599. * dp_rx_mlo_peer_unmap_handler() - handle MLO peer unmap event from firmware
  600. * @soc: generic soc handle
  601. * @peer_id: peer_id from firmware
  602. *
  603. * Return: none
  604. */
  605. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id);
  606. #endif
  607. void dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  608. enum cdp_sec_type sec_type, int is_unicast,
  609. u_int32_t *michael_key, u_int32_t *rx_pn);
  610. QDF_STATUS dp_rx_delba_ind_handler(void *soc_handle, uint16_t peer_id,
  611. uint8_t tid, uint16_t win_sz);
  612. uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle,
  613. uint16_t peer_id, uint8_t *peer_mac);
  614. /**
  615. * dp_peer_add_ast() - Allocate and add AST entry into peer list
  616. * @soc: SoC handle
  617. * @peer: peer to which ast node belongs
  618. * @mac_addr: MAC address of ast node
  619. * @type: AST entry type
  620. * @flags: AST configuration flags
  621. *
  622. * This API is used by WDS source port learning function to
  623. * add a new AST entry into peer AST list
  624. *
  625. * Return: QDF_STATUS code
  626. */
  627. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc, struct dp_peer *peer,
  628. uint8_t *mac_addr, enum cdp_txrx_ast_entry_type type,
  629. uint32_t flags);
  630. /**
  631. * dp_peer_del_ast() - Delete and free AST entry
  632. * @soc: SoC handle
  633. * @ast_entry: AST entry of the node
  634. *
  635. * This function removes the AST entry from peer and soc tables
  636. * It assumes caller has taken the ast lock to protect the access to these
  637. * tables
  638. *
  639. * Return: None
  640. */
  641. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry);
  642. void dp_peer_ast_unmap_handler(struct dp_soc *soc,
  643. struct dp_ast_entry *ast_entry);
  644. /**
  645. * dp_peer_update_ast() - Delete and free AST entry
  646. * @soc: SoC handle
  647. * @peer: peer to which ast node belongs
  648. * @ast_entry: AST entry of the node
  649. * @flags: wds or hmwds
  650. *
  651. * This function update the AST entry to the roamed peer and soc tables
  652. * It assumes caller has taken the ast lock to protect the access to these
  653. * tables
  654. *
  655. * Return: 0 if ast entry is updated successfully
  656. * -1 failure
  657. */
  658. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  659. struct dp_ast_entry *ast_entry, uint32_t flags);
  660. /**
  661. * dp_peer_ast_hash_find_by_pdevid() - Find AST entry by MAC address
  662. * @soc: SoC handle
  663. * @ast_mac_addr: Mac address
  664. * @pdev_id: pdev Id
  665. *
  666. * It assumes caller has taken the ast lock to protect the access to
  667. * AST hash table
  668. *
  669. * Return: AST entry
  670. */
  671. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  672. uint8_t *ast_mac_addr,
  673. uint8_t pdev_id);
  674. /**
  675. * dp_peer_ast_hash_find_by_vdevid() - Find AST entry by MAC address
  676. * @soc: SoC handle
  677. * @ast_mac_addr: Mac address
  678. * @vdev_id: vdev Id
  679. *
  680. * It assumes caller has taken the ast lock to protect the access to
  681. * AST hash table
  682. *
  683. * Return: AST entry
  684. */
  685. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  686. uint8_t *ast_mac_addr,
  687. uint8_t vdev_id);
  688. /**
  689. * dp_peer_ast_hash_find_soc() - Find AST entry by MAC address
  690. * @soc: SoC handle
  691. * @ast_mac_addr: Mac address
  692. *
  693. * It assumes caller has taken the ast lock to protect the access to
  694. * AST hash table
  695. *
  696. * Return: AST entry
  697. */
  698. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  699. uint8_t *ast_mac_addr);
  700. /**
  701. * dp_peer_ast_get_pdev_id() - get pdev_id from the ast entry
  702. * @soc: SoC handle
  703. * @ast_entry: AST entry of the node
  704. *
  705. * This function gets the pdev_id from the ast entry.
  706. *
  707. * Return: (uint8_t) pdev_id
  708. */
  709. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  710. struct dp_ast_entry *ast_entry);
  711. /**
  712. * dp_peer_ast_get_next_hop() - get next_hop from the ast entry
  713. * @soc: SoC handle
  714. * @ast_entry: AST entry of the node
  715. *
  716. * This function gets the next hop from the ast entry.
  717. *
  718. * Return: (uint8_t) next_hop
  719. */
  720. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  721. struct dp_ast_entry *ast_entry);
  722. /**
  723. * dp_peer_ast_set_type() - set type from the ast entry
  724. * @soc: SoC handle
  725. * @ast_entry: AST entry of the node
  726. * @type: AST entry type
  727. *
  728. * This function sets the type in the ast entry.
  729. *
  730. * Return:
  731. */
  732. void dp_peer_ast_set_type(struct dp_soc *soc,
  733. struct dp_ast_entry *ast_entry,
  734. enum cdp_txrx_ast_entry_type type);
  735. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  736. struct dp_ast_entry *ast_entry,
  737. struct dp_peer *peer);
  738. #ifdef WLAN_FEATURE_MULTI_AST_DEL
  739. void dp_peer_ast_send_multi_wds_del(
  740. struct dp_soc *soc, uint8_t vdev_id,
  741. struct peer_del_multi_wds_entries *wds_list);
  742. #endif
  743. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  744. struct cdp_soc *dp_soc,
  745. void *cookie,
  746. enum cdp_ast_free_status status);
  747. /**
  748. * dp_peer_ast_hash_remove() - Look up and remove AST entry from hash table
  749. * @soc: SoC handle
  750. * @ase: Address search entry
  751. *
  752. * This function removes the AST entry from soc AST hash table
  753. * It assumes caller has taken the ast lock to protect the access to this table
  754. *
  755. * Return: None
  756. */
  757. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  758. struct dp_ast_entry *ase);
  759. /**
  760. * dp_peer_free_ast_entry() - Free up the ast entry memory
  761. * @soc: SoC handle
  762. * @ast_entry: Address search entry
  763. *
  764. * This API is used to free up the memory associated with
  765. * AST entry.
  766. *
  767. * Return: None
  768. */
  769. void dp_peer_free_ast_entry(struct dp_soc *soc,
  770. struct dp_ast_entry *ast_entry);
  771. /**
  772. * dp_peer_unlink_ast_entry() - Free up the ast entry memory
  773. * @soc: SoC handle
  774. * @ast_entry: Address search entry
  775. * @peer: peer
  776. *
  777. * This API is used to remove/unlink AST entry from the peer list
  778. * and hash list.
  779. *
  780. * Return: None
  781. */
  782. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  783. struct dp_ast_entry *ast_entry,
  784. struct dp_peer *peer);
  785. /**
  786. * dp_peer_mec_detach_entry() - Detach the MEC entry
  787. * @soc: SoC handle
  788. * @mecentry: MEC entry of the node
  789. * @ptr: pointer to free list
  790. *
  791. * The MEC entry is detached from MEC table and added to free_list
  792. * to free the object outside lock
  793. *
  794. * Return: None
  795. */
  796. void dp_peer_mec_detach_entry(struct dp_soc *soc, struct dp_mec_entry *mecentry,
  797. void *ptr);
  798. /**
  799. * dp_peer_mec_free_list() - free the MEC entry from free_list
  800. * @soc: SoC handle
  801. * @ptr: pointer to free list
  802. *
  803. * Return: None
  804. */
  805. void dp_peer_mec_free_list(struct dp_soc *soc, void *ptr);
  806. /**
  807. * dp_peer_mec_add_entry()
  808. * @soc: SoC handle
  809. * @vdev: vdev to which mec node belongs
  810. * @mac_addr: MAC address of mec node
  811. *
  812. * This function allocates and adds MEC entry to MEC table.
  813. * It assumes caller has taken the mec lock to protect the access to these
  814. * tables
  815. *
  816. * Return: QDF_STATUS
  817. */
  818. QDF_STATUS dp_peer_mec_add_entry(struct dp_soc *soc,
  819. struct dp_vdev *vdev,
  820. uint8_t *mac_addr);
  821. /**
  822. * dp_peer_mec_hash_find_by_pdevid() - Find MEC entry by PDEV Id
  823. * within pdev
  824. * @soc: SoC handle
  825. * @pdev_id: pdev Id
  826. * @mec_mac_addr: MAC address of mec node
  827. *
  828. * It assumes caller has taken the mec_lock to protect the access to
  829. * MEC hash table
  830. *
  831. * Return: MEC entry
  832. */
  833. struct dp_mec_entry *dp_peer_mec_hash_find_by_pdevid(struct dp_soc *soc,
  834. uint8_t pdev_id,
  835. uint8_t *mec_mac_addr);
  836. #define DP_AST_ASSERT(_condition) \
  837. do { \
  838. if (!(_condition)) { \
  839. dp_print_ast_stats(soc);\
  840. QDF_BUG(_condition); \
  841. } \
  842. } while (0)
  843. /**
  844. * dp_peer_update_inactive_time() - Update inactive time for peer
  845. * @pdev: pdev object
  846. * @tag_type: htt_tlv_tag type
  847. * @tag_buf: buf message
  848. */
  849. void
  850. dp_peer_update_inactive_time(struct dp_pdev *pdev, uint32_t tag_type,
  851. uint32_t *tag_buf);
  852. #ifndef QCA_MULTIPASS_SUPPORT
  853. static inline
  854. /**
  855. * dp_peer_set_vlan_id() - set vlan_id for this peer
  856. * @cdp_soc: soc handle
  857. * @vdev_id: id of vdev object
  858. * @peer_mac: mac address
  859. * @vlan_id: vlan id for peer
  860. *
  861. * Return: void
  862. */
  863. void dp_peer_set_vlan_id(struct cdp_soc_t *cdp_soc,
  864. uint8_t vdev_id, uint8_t *peer_mac,
  865. uint16_t vlan_id)
  866. {
  867. }
  868. /**
  869. * dp_set_vlan_groupkey() - set vlan map for vdev
  870. * @soc_hdl: pointer to soc
  871. * @vdev_id: id of vdev handle
  872. * @vlan_id: vlan_id
  873. * @group_key: group key for vlan
  874. *
  875. * Return: set success/failure
  876. */
  877. static inline
  878. QDF_STATUS dp_set_vlan_groupkey(struct cdp_soc_t *soc_hdl, uint8_t vdev_id,
  879. uint16_t vlan_id, uint16_t group_key)
  880. {
  881. return QDF_STATUS_SUCCESS;
  882. }
  883. /**
  884. * dp_peer_multipass_list_init() - initialize multipass peer list
  885. * @vdev: pointer to vdev
  886. *
  887. * Return: void
  888. */
  889. static inline
  890. void dp_peer_multipass_list_init(struct dp_vdev *vdev)
  891. {
  892. }
  893. /**
  894. * dp_peer_multipass_list_remove() - remove peer from special peer list
  895. * @peer: peer handle
  896. *
  897. * Return: void
  898. */
  899. static inline
  900. void dp_peer_multipass_list_remove(struct dp_peer *peer)
  901. {
  902. }
  903. #else
  904. void dp_peer_set_vlan_id(struct cdp_soc_t *cdp_soc,
  905. uint8_t vdev_id, uint8_t *peer_mac,
  906. uint16_t vlan_id);
  907. QDF_STATUS dp_set_vlan_groupkey(struct cdp_soc_t *soc, uint8_t vdev_id,
  908. uint16_t vlan_id, uint16_t group_key);
  909. void dp_peer_multipass_list_init(struct dp_vdev *vdev);
  910. void dp_peer_multipass_list_remove(struct dp_peer *peer);
  911. #endif
  912. #ifndef QCA_PEER_MULTIQ_SUPPORT
  913. /**
  914. * dp_peer_reset_flowq_map() - reset peer flowq map table
  915. * @peer: dp peer handle
  916. *
  917. * Return: none
  918. */
  919. static inline
  920. void dp_peer_reset_flowq_map(struct dp_peer *peer)
  921. {
  922. }
  923. /**
  924. * dp_peer_ast_index_flow_queue_map_create() - create ast index flow queue map
  925. * @soc_hdl: generic soc handle
  926. * @is_wds: flag to indicate if peer is wds
  927. * @peer_id: peer_id from htt peer map message
  928. * @peer_mac_addr: mac address of the peer
  929. * @ast_info: ast flow override information from peer map
  930. *
  931. * Return: none
  932. */
  933. static inline
  934. void dp_peer_ast_index_flow_queue_map_create(void *soc_hdl,
  935. bool is_wds, uint16_t peer_id, uint8_t *peer_mac_addr,
  936. struct dp_ast_flow_override_info *ast_info)
  937. {
  938. }
  939. #else
  940. void dp_peer_reset_flowq_map(struct dp_peer *peer);
  941. void dp_peer_ast_index_flow_queue_map_create(void *soc_hdl,
  942. bool is_wds, uint16_t peer_id, uint8_t *peer_mac_addr,
  943. struct dp_ast_flow_override_info *ast_info);
  944. #endif
  945. /**
  946. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  947. * after deleting the entries (ie., setting valid=0)
  948. *
  949. * @soc: DP SOC handle
  950. * @cb_ctxt: Callback context
  951. * @reo_status: REO command status
  952. */
  953. void dp_rx_tid_delete_cb(struct dp_soc *soc,
  954. void *cb_ctxt,
  955. union hal_reo_status *reo_status);
  956. #ifdef QCA_PEER_EXT_STATS
  957. /**
  958. * dp_peer_delay_stats_ctx_alloc() - Allocate peer delay stats content
  959. * @soc: DP SoC context
  960. * @txrx_peer: DP txrx peer context
  961. *
  962. * Allocate the peer delay stats context
  963. *
  964. * Return: QDF_STATUS_SUCCESS if allocation is
  965. * successful
  966. */
  967. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  968. struct dp_txrx_peer *txrx_peer);
  969. /**
  970. * dp_peer_delay_stats_ctx_dealloc() - Dealloc the peer delay stats context
  971. * @soc: DP SoC context
  972. * @txrx_peer: txrx DP peer context
  973. *
  974. * Free the peer delay stats context
  975. *
  976. * Return: Void
  977. */
  978. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  979. struct dp_txrx_peer *txrx_peer);
  980. /**
  981. * dp_peer_delay_stats_ctx_clr() - Clear delay stats context of peer
  982. * @txrx_peer: dp_txrx_peer handle
  983. *
  984. * Return: void
  985. */
  986. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer);
  987. #else
  988. static inline
  989. QDF_STATUS dp_peer_delay_stats_ctx_alloc(struct dp_soc *soc,
  990. struct dp_txrx_peer *txrx_peer)
  991. {
  992. return QDF_STATUS_SUCCESS;
  993. }
  994. static inline
  995. void dp_peer_delay_stats_ctx_dealloc(struct dp_soc *soc,
  996. struct dp_txrx_peer *txrx_peer)
  997. {
  998. }
  999. static inline
  1000. void dp_peer_delay_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  1001. {
  1002. }
  1003. #endif
  1004. #ifdef WLAN_PEER_JITTER
  1005. /**
  1006. * dp_peer_jitter_stats_ctx_alloc() - Allocate jitter stats context for peer
  1007. * @pdev: Datapath pdev handle
  1008. * @txrx_peer: dp_txrx_peer handle
  1009. *
  1010. * Return: QDF_STATUS
  1011. */
  1012. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  1013. struct dp_txrx_peer *txrx_peer);
  1014. /**
  1015. * dp_peer_jitter_stats_ctx_dealloc() - Deallocate jitter stats context
  1016. * @pdev: Datapath pdev handle
  1017. * @txrx_peer: dp_txrx_peer handle
  1018. *
  1019. * Return: void
  1020. */
  1021. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  1022. struct dp_txrx_peer *txrx_peer);
  1023. /**
  1024. * dp_peer_jitter_stats_ctx_clr() - Clear jitter stats context of peer
  1025. * @txrx_peer: dp_txrx_peer handle
  1026. *
  1027. * Return: void
  1028. */
  1029. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer);
  1030. #else
  1031. static inline
  1032. QDF_STATUS dp_peer_jitter_stats_ctx_alloc(struct dp_pdev *pdev,
  1033. struct dp_txrx_peer *txrx_peer)
  1034. {
  1035. return QDF_STATUS_SUCCESS;
  1036. }
  1037. static inline
  1038. void dp_peer_jitter_stats_ctx_dealloc(struct dp_pdev *pdev,
  1039. struct dp_txrx_peer *txrx_peer)
  1040. {
  1041. }
  1042. static inline
  1043. void dp_peer_jitter_stats_ctx_clr(struct dp_txrx_peer *txrx_peer)
  1044. {
  1045. }
  1046. #endif
  1047. #ifndef CONFIG_SAWF_DEF_QUEUES
  1048. static inline QDF_STATUS dp_peer_sawf_ctx_alloc(struct dp_soc *soc,
  1049. struct dp_peer *peer)
  1050. {
  1051. return QDF_STATUS_SUCCESS;
  1052. }
  1053. static inline QDF_STATUS dp_peer_sawf_ctx_free(struct dp_soc *soc,
  1054. struct dp_peer *peer)
  1055. {
  1056. return QDF_STATUS_SUCCESS;
  1057. }
  1058. #endif
  1059. #ifndef CONFIG_SAWF
  1060. static inline
  1061. QDF_STATUS dp_peer_sawf_stats_ctx_alloc(struct dp_soc *soc,
  1062. struct dp_txrx_peer *txrx_peer)
  1063. {
  1064. return QDF_STATUS_SUCCESS;
  1065. }
  1066. static inline
  1067. QDF_STATUS dp_peer_sawf_stats_ctx_free(struct dp_soc *soc,
  1068. struct dp_txrx_peer *txrx_peer)
  1069. {
  1070. return QDF_STATUS_SUCCESS;
  1071. }
  1072. #endif
  1073. /**
  1074. * dp_vdev_bss_peer_ref_n_get: Get bss peer of a vdev
  1075. * @soc: DP soc
  1076. * @vdev: vdev
  1077. * @mod_id: id of module requesting reference
  1078. *
  1079. * Return: VDEV BSS peer
  1080. */
  1081. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  1082. struct dp_vdev *vdev,
  1083. enum dp_mod_id mod_id);
  1084. /**
  1085. * dp_sta_vdev_self_peer_ref_n_get: Get self peer of sta vdev
  1086. * @soc: DP soc
  1087. * @vdev: vdev
  1088. * @mod_id: id of module requesting reference
  1089. *
  1090. * Return: VDEV self peer
  1091. */
  1092. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  1093. struct dp_vdev *vdev,
  1094. enum dp_mod_id mod_id);
  1095. void dp_peer_ast_table_detach(struct dp_soc *soc);
  1096. /**
  1097. * dp_peer_find_map_detach() - cleanup memory for peer_id_to_obj_map
  1098. * @soc: soc handle
  1099. *
  1100. * Return: none
  1101. */
  1102. void dp_peer_find_map_detach(struct dp_soc *soc);
  1103. void dp_soc_wds_detach(struct dp_soc *soc);
  1104. QDF_STATUS dp_peer_ast_table_attach(struct dp_soc *soc);
  1105. /**
  1106. * dp_peer_ast_hash_attach() - Allocate and initialize AST Hash Table
  1107. * @soc: SoC handle
  1108. *
  1109. * Return: QDF_STATUS
  1110. */
  1111. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc);
  1112. /**
  1113. * dp_peer_mec_hash_attach() - Allocate and initialize MEC Hash Table
  1114. * @soc: SoC handle
  1115. *
  1116. * Return: QDF_STATUS
  1117. */
  1118. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc);
  1119. void dp_soc_wds_attach(struct dp_soc *soc);
  1120. /**
  1121. * dp_peer_mec_hash_detach() - Free MEC Hash table
  1122. * @soc: SoC handle
  1123. *
  1124. * Return: None
  1125. */
  1126. void dp_peer_mec_hash_detach(struct dp_soc *soc);
  1127. /**
  1128. * dp_peer_ast_hash_detach() - Free AST Hash table
  1129. * @soc: SoC handle
  1130. *
  1131. * Return: None
  1132. */
  1133. void dp_peer_ast_hash_detach(struct dp_soc *soc);
  1134. #ifdef FEATURE_AST
  1135. /**
  1136. * dp_peer_delete_ast_entries(): Delete all AST entries for a peer
  1137. * @soc: datapath soc handle
  1138. * @peer: datapath peer handle
  1139. *
  1140. * Delete the AST entries belonging to a peer
  1141. */
  1142. static inline void dp_peer_delete_ast_entries(struct dp_soc *soc,
  1143. struct dp_peer *peer)
  1144. {
  1145. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  1146. dp_peer_debug("peer: %pK, self_ast: %pK", peer, peer->self_ast_entry);
  1147. /*
  1148. * Delete peer self ast entry. This is done to handle scenarios
  1149. * where peer is freed before peer map is received(for ex in case
  1150. * of auth disallow due to ACL) in such cases self ast is not added
  1151. * to peer->ast_list.
  1152. */
  1153. if (peer->self_ast_entry) {
  1154. dp_peer_del_ast(soc, peer->self_ast_entry);
  1155. peer->self_ast_entry = NULL;
  1156. }
  1157. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry)
  1158. dp_peer_del_ast(soc, ast_entry);
  1159. }
  1160. /**
  1161. * dp_print_peer_ast_entries() - Dump AST entries of peer
  1162. * @soc: Datapath soc handle
  1163. * @peer: Datapath peer
  1164. * @arg: argument to iterate function
  1165. *
  1166. * Return: void
  1167. */
  1168. void dp_print_peer_ast_entries(struct dp_soc *soc, struct dp_peer *peer,
  1169. void *arg);
  1170. #else
  1171. static inline void dp_print_peer_ast_entries(struct dp_soc *soc,
  1172. struct dp_peer *peer, void *arg)
  1173. {
  1174. }
  1175. static inline void dp_peer_delete_ast_entries(struct dp_soc *soc,
  1176. struct dp_peer *peer)
  1177. {
  1178. }
  1179. #endif
  1180. #ifdef FEATURE_MEC
  1181. /**
  1182. * dp_peer_mec_spinlock_create() - Create the MEC spinlock
  1183. * @soc: SoC handle
  1184. *
  1185. * Return: none
  1186. */
  1187. void dp_peer_mec_spinlock_create(struct dp_soc *soc);
  1188. /**
  1189. * dp_peer_mec_spinlock_destroy() - Destroy the MEC spinlock
  1190. * @soc: SoC handle
  1191. *
  1192. * Return: none
  1193. */
  1194. void dp_peer_mec_spinlock_destroy(struct dp_soc *soc);
  1195. /**
  1196. * dp_peer_mec_flush_entries() - Delete all mec entries in table
  1197. * @soc: Datapath SOC
  1198. *
  1199. * Return: None
  1200. */
  1201. void dp_peer_mec_flush_entries(struct dp_soc *soc);
  1202. #else
  1203. static inline void dp_peer_mec_spinlock_create(struct dp_soc *soc)
  1204. {
  1205. }
  1206. static inline void dp_peer_mec_spinlock_destroy(struct dp_soc *soc)
  1207. {
  1208. }
  1209. static inline void dp_peer_mec_flush_entries(struct dp_soc *soc)
  1210. {
  1211. }
  1212. #endif
  1213. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  1214. /**
  1215. * dp_send_cache_flush_for_rx_tid() - Send cache flush cmd to REO per tid
  1216. * @soc: dp_soc handle
  1217. * @peer: peer
  1218. *
  1219. * This function is used to send cache flush cmd to reo and
  1220. * to register the callback to handle the dumping of the reo
  1221. * queue stas from DDR
  1222. *
  1223. * Return: none
  1224. */
  1225. void dp_send_cache_flush_for_rx_tid(
  1226. struct dp_soc *soc, struct dp_peer *peer);
  1227. /**
  1228. * dp_get_rx_reo_queue_info() - Handler to get rx tid info
  1229. * @soc_hdl: cdp_soc_t handle
  1230. * @vdev_id: vdev id
  1231. *
  1232. * Handler to get rx tid info from DDR after h/w cache is
  1233. * invalidated first using the cache flush cmd.
  1234. *
  1235. * Return: none
  1236. */
  1237. void dp_get_rx_reo_queue_info(
  1238. struct cdp_soc_t *soc_hdl, uint8_t vdev_id);
  1239. /**
  1240. * dp_dump_rx_reo_queue_info() - Callback function to dump reo queue stats
  1241. * @soc: dp_soc handle
  1242. * @cb_ctxt: callback context
  1243. * @reo_status: vdev id
  1244. *
  1245. * This is the callback function registered after sending the reo cmd
  1246. * to flush the h/w cache and invalidate it. In the callback the reo
  1247. * queue desc info is dumped from DDR.
  1248. *
  1249. * Return: none
  1250. */
  1251. void dp_dump_rx_reo_queue_info(
  1252. struct dp_soc *soc, void *cb_ctxt, union hal_reo_status *reo_status);
  1253. #else /* DUMP_REO_QUEUE_INFO_IN_DDR */
  1254. static inline void dp_get_rx_reo_queue_info(
  1255. struct cdp_soc_t *soc_hdl, uint8_t vdev_id)
  1256. {
  1257. }
  1258. #endif /* DUMP_REO_QUEUE_INFO_IN_DDR */
  1259. static inline int dp_peer_find_mac_addr_cmp(
  1260. union dp_align_mac_addr *mac_addr1,
  1261. union dp_align_mac_addr *mac_addr2)
  1262. {
  1263. /*
  1264. * Intentionally use & rather than &&.
  1265. * because the operands are binary rather than generic boolean,
  1266. * the functionality is equivalent.
  1267. * Using && has the advantage of short-circuited evaluation,
  1268. * but using & has the advantage of no conditional branching,
  1269. * which is a more significant benefit.
  1270. */
  1271. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  1272. & (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  1273. }
  1274. /**
  1275. * dp_peer_delete() - delete DP peer
  1276. *
  1277. * @soc: Datatpath soc
  1278. * @peer: Datapath peer
  1279. * @arg: argument to iter function
  1280. *
  1281. * Return: void
  1282. */
  1283. void dp_peer_delete(struct dp_soc *soc,
  1284. struct dp_peer *peer,
  1285. void *arg);
  1286. /**
  1287. * dp_mlo_peer_delete() - delete MLO DP peer
  1288. *
  1289. * @soc: Datapath soc
  1290. * @peer: Datapath peer
  1291. * @arg: argument to iter function
  1292. *
  1293. * Return: void
  1294. */
  1295. void dp_mlo_peer_delete(struct dp_soc *soc, struct dp_peer *peer, void *arg);
  1296. #ifdef WLAN_FEATURE_11BE_MLO
  1297. /* is MLO connection mld peer */
  1298. #define IS_MLO_DP_MLD_TXRX_PEER(_peer) ((_peer)->mld_peer)
  1299. /* set peer type */
  1300. #define DP_PEER_SET_TYPE(_peer, _type_val) \
  1301. ((_peer)->peer_type = (_type_val))
  1302. /* is legacy peer */
  1303. #define IS_DP_LEGACY_PEER(_peer) \
  1304. ((_peer)->peer_type == CDP_LINK_PEER_TYPE && !((_peer)->mld_peer))
  1305. /* is MLO connection link peer */
  1306. #define IS_MLO_DP_LINK_PEER(_peer) \
  1307. ((_peer)->peer_type == CDP_LINK_PEER_TYPE && (_peer)->mld_peer)
  1308. /* is MLO connection mld peer */
  1309. #define IS_MLO_DP_MLD_PEER(_peer) \
  1310. ((_peer)->peer_type == CDP_MLD_PEER_TYPE)
  1311. /* Get Mld peer from link peer */
  1312. #define DP_GET_MLD_PEER_FROM_PEER(link_peer) \
  1313. ((link_peer)->mld_peer)
  1314. #ifdef WLAN_MLO_MULTI_CHIP
  1315. uint8_t dp_mlo_get_chip_id(struct dp_soc *soc);
  1316. struct dp_peer *
  1317. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  1318. uint8_t *peer_mac_addr,
  1319. int mac_addr_is_aligned,
  1320. uint8_t vdev_id,
  1321. uint8_t chip_id,
  1322. enum dp_mod_id mod_id);
  1323. #else
  1324. static inline uint8_t dp_mlo_get_chip_id(struct dp_soc *soc)
  1325. {
  1326. return 0;
  1327. }
  1328. static inline struct dp_peer *
  1329. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  1330. uint8_t *peer_mac_addr,
  1331. int mac_addr_is_aligned,
  1332. uint8_t vdev_id,
  1333. uint8_t chip_id,
  1334. enum dp_mod_id mod_id)
  1335. {
  1336. return dp_peer_find_hash_find(soc, peer_mac_addr,
  1337. mac_addr_is_aligned,
  1338. vdev_id, mod_id);
  1339. }
  1340. #endif
  1341. /**
  1342. * dp_mld_peer_find_hash_find() - returns mld peer from mld peer_hash_table
  1343. * matching mac_address
  1344. * @soc: soc handle
  1345. * @peer_mac_addr: mld peer mac address
  1346. * @mac_addr_is_aligned: is mac addr aligned
  1347. * @vdev_id: vdev_id
  1348. * @mod_id: id of module requesting reference
  1349. *
  1350. * Return: peer in sucsess
  1351. * NULL in failure
  1352. */
  1353. static inline
  1354. struct dp_peer *dp_mld_peer_find_hash_find(struct dp_soc *soc,
  1355. uint8_t *peer_mac_addr,
  1356. int mac_addr_is_aligned,
  1357. uint8_t vdev_id,
  1358. enum dp_mod_id mod_id)
  1359. {
  1360. if (soc->arch_ops.mlo_peer_find_hash_find)
  1361. return soc->arch_ops.mlo_peer_find_hash_find(soc,
  1362. peer_mac_addr,
  1363. mac_addr_is_aligned,
  1364. mod_id, vdev_id);
  1365. return NULL;
  1366. }
  1367. /**
  1368. * dp_peer_hash_find_wrapper() - find link peer or mld per according to
  1369. * peer_type
  1370. * @soc: DP SOC handle
  1371. * @peer_info: peer information for hash find
  1372. * @mod_id: ID of module requesting reference
  1373. *
  1374. * Return: peer handle
  1375. */
  1376. static inline
  1377. struct dp_peer *dp_peer_hash_find_wrapper(struct dp_soc *soc,
  1378. struct cdp_peer_info *peer_info,
  1379. enum dp_mod_id mod_id)
  1380. {
  1381. struct dp_peer *peer = NULL;
  1382. if (peer_info->peer_type == CDP_LINK_PEER_TYPE ||
  1383. peer_info->peer_type == CDP_WILD_PEER_TYPE) {
  1384. peer = dp_peer_find_hash_find(soc, peer_info->mac_addr,
  1385. peer_info->mac_addr_is_aligned,
  1386. peer_info->vdev_id,
  1387. mod_id);
  1388. if (peer)
  1389. return peer;
  1390. }
  1391. if (peer_info->peer_type == CDP_MLD_PEER_TYPE ||
  1392. peer_info->peer_type == CDP_WILD_PEER_TYPE)
  1393. peer = dp_mld_peer_find_hash_find(
  1394. soc, peer_info->mac_addr,
  1395. peer_info->mac_addr_is_aligned,
  1396. peer_info->vdev_id,
  1397. mod_id);
  1398. return peer;
  1399. }
  1400. /**
  1401. * dp_link_peer_add_mld_peer() - add mld peer pointer to link peer,
  1402. * increase mld peer ref_cnt
  1403. * @link_peer: link peer pointer
  1404. * @mld_peer: mld peer pointer
  1405. *
  1406. * Return: none
  1407. */
  1408. static inline
  1409. void dp_link_peer_add_mld_peer(struct dp_peer *link_peer,
  1410. struct dp_peer *mld_peer)
  1411. {
  1412. /* increase mld_peer ref_cnt */
  1413. dp_peer_get_ref(NULL, mld_peer, DP_MOD_ID_CDP);
  1414. link_peer->mld_peer = mld_peer;
  1415. }
  1416. /**
  1417. * dp_link_peer_del_mld_peer() - delete mld peer pointer from link peer,
  1418. * decrease mld peer ref_cnt
  1419. * @link_peer: link peer pointer
  1420. *
  1421. * Return: None
  1422. */
  1423. static inline
  1424. void dp_link_peer_del_mld_peer(struct dp_peer *link_peer)
  1425. {
  1426. dp_peer_unref_delete(link_peer->mld_peer, DP_MOD_ID_CDP);
  1427. link_peer->mld_peer = NULL;
  1428. }
  1429. /**
  1430. * dp_mld_peer_init_link_peers_info() - init link peers info in mld peer
  1431. * @mld_peer: mld peer pointer
  1432. *
  1433. * Return: None
  1434. */
  1435. static inline
  1436. void dp_mld_peer_init_link_peers_info(struct dp_peer *mld_peer)
  1437. {
  1438. int i;
  1439. qdf_spinlock_create(&mld_peer->link_peers_info_lock);
  1440. mld_peer->num_links = 0;
  1441. for (i = 0; i < DP_MAX_MLO_LINKS; i++)
  1442. mld_peer->link_peers[i].is_valid = false;
  1443. }
  1444. /**
  1445. * dp_mld_peer_deinit_link_peers_info() - Deinit link peers info in mld peer
  1446. * @mld_peer: mld peer pointer
  1447. *
  1448. * Return: None
  1449. */
  1450. static inline
  1451. void dp_mld_peer_deinit_link_peers_info(struct dp_peer *mld_peer)
  1452. {
  1453. qdf_spinlock_destroy(&mld_peer->link_peers_info_lock);
  1454. }
  1455. /**
  1456. * dp_mld_peer_add_link_peer() - add link peer info to mld peer
  1457. * @mld_peer: mld dp peer pointer
  1458. * @link_peer: link dp peer pointer
  1459. *
  1460. * Return: None
  1461. */
  1462. static inline
  1463. void dp_mld_peer_add_link_peer(struct dp_peer *mld_peer,
  1464. struct dp_peer *link_peer)
  1465. {
  1466. int i;
  1467. struct dp_peer_link_info *link_peer_info;
  1468. struct dp_soc *soc = mld_peer->vdev->pdev->soc;
  1469. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1470. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1471. link_peer_info = &mld_peer->link_peers[i];
  1472. if (!link_peer_info->is_valid) {
  1473. qdf_mem_copy(link_peer_info->mac_addr.raw,
  1474. link_peer->mac_addr.raw,
  1475. QDF_MAC_ADDR_SIZE);
  1476. link_peer_info->is_valid = true;
  1477. link_peer_info->vdev_id = link_peer->vdev->vdev_id;
  1478. link_peer_info->chip_id =
  1479. dp_mlo_get_chip_id(link_peer->vdev->pdev->soc);
  1480. mld_peer->num_links++;
  1481. break;
  1482. }
  1483. }
  1484. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1485. dp_peer_info("%s addition of link peer %pK (" QDF_MAC_ADDR_FMT ") "
  1486. "to MLD peer %pK (" QDF_MAC_ADDR_FMT "), "
  1487. "idx %u num_links %u",
  1488. (i != DP_MAX_MLO_LINKS) ? "Successful" : "Failed",
  1489. link_peer, QDF_MAC_ADDR_REF(link_peer->mac_addr.raw),
  1490. mld_peer, QDF_MAC_ADDR_REF(mld_peer->mac_addr.raw),
  1491. i, mld_peer->num_links);
  1492. dp_cfg_event_record_mlo_link_delink_evt(soc, DP_CFG_EVENT_MLO_ADD_LINK,
  1493. mld_peer, link_peer, i,
  1494. (i != DP_MAX_MLO_LINKS) ? 1 : 0);
  1495. }
  1496. /**
  1497. * dp_mld_peer_del_link_peer() - Delete link peer info from MLD peer
  1498. * @mld_peer: MLD dp peer pointer
  1499. * @link_peer: link dp peer pointer
  1500. *
  1501. * Return: number of links left after deletion
  1502. */
  1503. static inline
  1504. uint8_t dp_mld_peer_del_link_peer(struct dp_peer *mld_peer,
  1505. struct dp_peer *link_peer)
  1506. {
  1507. int i;
  1508. struct dp_peer_link_info *link_peer_info;
  1509. uint8_t num_links;
  1510. struct dp_soc *soc = mld_peer->vdev->pdev->soc;
  1511. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1512. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1513. link_peer_info = &mld_peer->link_peers[i];
  1514. if (link_peer_info->is_valid &&
  1515. !dp_peer_find_mac_addr_cmp(&link_peer->mac_addr,
  1516. &link_peer_info->mac_addr)) {
  1517. link_peer_info->is_valid = false;
  1518. mld_peer->num_links--;
  1519. break;
  1520. }
  1521. }
  1522. num_links = mld_peer->num_links;
  1523. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1524. dp_peer_info("%s deletion of link peer %pK (" QDF_MAC_ADDR_FMT ") "
  1525. "from MLD peer %pK (" QDF_MAC_ADDR_FMT "), "
  1526. "idx %u num_links %u",
  1527. (i != DP_MAX_MLO_LINKS) ? "Successful" : "Failed",
  1528. link_peer, QDF_MAC_ADDR_REF(link_peer->mac_addr.raw),
  1529. mld_peer, QDF_MAC_ADDR_REF(mld_peer->mac_addr.raw),
  1530. i, mld_peer->num_links);
  1531. dp_cfg_event_record_mlo_link_delink_evt(soc, DP_CFG_EVENT_MLO_DEL_LINK,
  1532. mld_peer, link_peer, i,
  1533. (i != DP_MAX_MLO_LINKS) ? 1 : 0);
  1534. return num_links;
  1535. }
  1536. /**
  1537. * dp_get_link_peers_ref_from_mld_peer() - get link peers pointer and
  1538. * increase link peers ref_cnt
  1539. * @soc: dp_soc handle
  1540. * @mld_peer: dp mld peer pointer
  1541. * @mld_link_peers: structure that hold links peers pointer array and number
  1542. * @mod_id: id of module requesting reference
  1543. *
  1544. * Return: None
  1545. */
  1546. static inline
  1547. void dp_get_link_peers_ref_from_mld_peer(
  1548. struct dp_soc *soc,
  1549. struct dp_peer *mld_peer,
  1550. struct dp_mld_link_peers *mld_link_peers,
  1551. enum dp_mod_id mod_id)
  1552. {
  1553. struct dp_peer *peer;
  1554. uint8_t i = 0, j = 0;
  1555. struct dp_peer_link_info *link_peer_info;
  1556. qdf_mem_zero(mld_link_peers, sizeof(*mld_link_peers));
  1557. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1558. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1559. link_peer_info = &mld_peer->link_peers[i];
  1560. if (link_peer_info->is_valid) {
  1561. peer = dp_link_peer_hash_find_by_chip_id(
  1562. soc,
  1563. link_peer_info->mac_addr.raw,
  1564. true,
  1565. link_peer_info->vdev_id,
  1566. link_peer_info->chip_id,
  1567. mod_id);
  1568. if (peer)
  1569. mld_link_peers->link_peers[j++] = peer;
  1570. }
  1571. }
  1572. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1573. mld_link_peers->num_links = j;
  1574. }
  1575. /**
  1576. * dp_release_link_peers_ref() - release all link peers reference
  1577. * @mld_link_peers: structure that hold links peers pointer array and number
  1578. * @mod_id: id of module requesting reference
  1579. *
  1580. * Return: None.
  1581. */
  1582. static inline
  1583. void dp_release_link_peers_ref(
  1584. struct dp_mld_link_peers *mld_link_peers,
  1585. enum dp_mod_id mod_id)
  1586. {
  1587. struct dp_peer *peer;
  1588. uint8_t i;
  1589. for (i = 0; i < mld_link_peers->num_links; i++) {
  1590. peer = mld_link_peers->link_peers[i];
  1591. if (peer)
  1592. dp_peer_unref_delete(peer, mod_id);
  1593. mld_link_peers->link_peers[i] = NULL;
  1594. }
  1595. mld_link_peers->num_links = 0;
  1596. }
  1597. /**
  1598. * dp_get_link_peer_id_by_lmac_id() - Get link peer id using peer id and lmac id
  1599. * @soc: Datapath soc handle
  1600. * @peer_id: peer id
  1601. * @lmac_id: lmac id to find the link peer on given lmac
  1602. *
  1603. * Return: peer_id of link peer if found
  1604. * else return HTT_INVALID_PEER
  1605. */
  1606. static inline
  1607. uint16_t dp_get_link_peer_id_by_lmac_id(struct dp_soc *soc, uint16_t peer_id,
  1608. uint8_t lmac_id)
  1609. {
  1610. uint8_t i;
  1611. struct dp_peer *peer;
  1612. struct dp_peer *link_peer;
  1613. struct dp_soc *link_peer_soc;
  1614. struct dp_mld_link_peers link_peers_info;
  1615. uint16_t link_peer_id = HTT_INVALID_PEER;
  1616. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_CDP);
  1617. if (!peer)
  1618. return HTT_INVALID_PEER;
  1619. if (IS_MLO_DP_MLD_PEER(peer)) {
  1620. /* get link peers with reference */
  1621. dp_get_link_peers_ref_from_mld_peer(soc, peer, &link_peers_info,
  1622. DP_MOD_ID_CDP);
  1623. for (i = 0; i < link_peers_info.num_links; i++) {
  1624. link_peer = link_peers_info.link_peers[i];
  1625. link_peer_soc = link_peer->vdev->pdev->soc;
  1626. if ((link_peer_soc == soc) &&
  1627. (link_peer->vdev->pdev->lmac_id == lmac_id)) {
  1628. link_peer_id = link_peer->peer_id;
  1629. break;
  1630. }
  1631. }
  1632. /* release link peers reference */
  1633. dp_release_link_peers_ref(&link_peers_info, DP_MOD_ID_CDP);
  1634. } else {
  1635. link_peer_id = peer_id;
  1636. }
  1637. dp_peer_unref_delete(peer, DP_MOD_ID_CDP);
  1638. return link_peer_id;
  1639. }
  1640. /**
  1641. * dp_peer_get_tgt_peer_hash_find() - get dp_peer handle
  1642. * @soc: soc handle
  1643. * @peer_mac: peer mac address
  1644. * @mac_addr_is_aligned: is mac addr aligned
  1645. * @vdev_id: vdev_id
  1646. * @mod_id: id of module requesting reference
  1647. *
  1648. * for MLO connection, get corresponding MLD peer,
  1649. * otherwise get link peer for non-MLO case.
  1650. *
  1651. * Return: peer in success
  1652. * NULL in failure
  1653. */
  1654. static inline
  1655. struct dp_peer *dp_peer_get_tgt_peer_hash_find(struct dp_soc *soc,
  1656. uint8_t *peer_mac,
  1657. int mac_addr_is_aligned,
  1658. uint8_t vdev_id,
  1659. enum dp_mod_id mod_id)
  1660. {
  1661. struct dp_peer *ta_peer = NULL;
  1662. struct dp_peer *peer = dp_peer_find_hash_find(soc,
  1663. peer_mac, 0, vdev_id,
  1664. mod_id);
  1665. if (peer) {
  1666. /* mlo connection link peer, get mld peer with reference */
  1667. if (IS_MLO_DP_LINK_PEER(peer)) {
  1668. /* increase mld peer ref_cnt */
  1669. if (QDF_STATUS_SUCCESS ==
  1670. dp_peer_get_ref(soc, peer->mld_peer, mod_id))
  1671. ta_peer = peer->mld_peer;
  1672. else
  1673. ta_peer = NULL;
  1674. /* release peer reference that added by hash find */
  1675. dp_peer_unref_delete(peer, mod_id);
  1676. } else {
  1677. /* mlo MLD peer or non-mlo link peer */
  1678. ta_peer = peer;
  1679. }
  1680. } else {
  1681. dp_peer_err("fail to find peer:" QDF_MAC_ADDR_FMT,
  1682. QDF_MAC_ADDR_REF(peer_mac));
  1683. }
  1684. return ta_peer;
  1685. }
  1686. /**
  1687. * dp_peer_get_tgt_peer_by_id() - Returns target peer object given the peer id
  1688. * @soc: core DP soc context
  1689. * @peer_id: peer id from peer object can be retrieved
  1690. * @mod_id: ID of module requesting reference
  1691. *
  1692. * for MLO connection, get corresponding MLD peer,
  1693. * otherwise get link peer for non-MLO case.
  1694. *
  1695. * Return: peer in success
  1696. * NULL in failure
  1697. */
  1698. static inline
  1699. struct dp_peer *dp_peer_get_tgt_peer_by_id(struct dp_soc *soc,
  1700. uint16_t peer_id,
  1701. enum dp_mod_id mod_id)
  1702. {
  1703. struct dp_peer *ta_peer = NULL;
  1704. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1705. if (peer) {
  1706. /* mlo connection link peer, get mld peer with reference */
  1707. if (IS_MLO_DP_LINK_PEER(peer)) {
  1708. /* increase mld peer ref_cnt */
  1709. if (QDF_STATUS_SUCCESS ==
  1710. dp_peer_get_ref(soc, peer->mld_peer, mod_id))
  1711. ta_peer = peer->mld_peer;
  1712. else
  1713. ta_peer = NULL;
  1714. /* release peer reference that added by hash find */
  1715. dp_peer_unref_delete(peer, mod_id);
  1716. } else {
  1717. /* mlo MLD peer or non-mlo link peer */
  1718. ta_peer = peer;
  1719. }
  1720. }
  1721. return ta_peer;
  1722. }
  1723. /**
  1724. * dp_peer_mlo_delete() - peer MLO related delete operation
  1725. * @peer: DP peer handle
  1726. * Return: None
  1727. */
  1728. static inline
  1729. void dp_peer_mlo_delete(struct dp_peer *peer)
  1730. {
  1731. struct dp_peer *ml_peer;
  1732. struct dp_soc *soc;
  1733. dp_info("peer " QDF_MAC_ADDR_FMT " type %d",
  1734. QDF_MAC_ADDR_REF(peer->mac_addr.raw), peer->peer_type);
  1735. /* MLO connection link peer */
  1736. if (IS_MLO_DP_LINK_PEER(peer)) {
  1737. ml_peer = peer->mld_peer;
  1738. soc = ml_peer->vdev->pdev->soc;
  1739. /* if last link peer deletion, delete MLD peer */
  1740. if (dp_mld_peer_del_link_peer(peer->mld_peer, peer) == 0)
  1741. dp_peer_delete(soc, peer->mld_peer, NULL);
  1742. }
  1743. }
  1744. /**
  1745. * dp_peer_mlo_setup() - create MLD peer and MLO related initialization
  1746. * @soc: Soc handle
  1747. * @peer: DP peer handle
  1748. * @vdev_id: Vdev ID
  1749. * @setup_info: peer setup information for MLO
  1750. */
  1751. QDF_STATUS dp_peer_mlo_setup(
  1752. struct dp_soc *soc,
  1753. struct dp_peer *peer,
  1754. uint8_t vdev_id,
  1755. struct cdp_peer_setup_info *setup_info);
  1756. /**
  1757. * dp_get_tgt_peer_from_peer() - Get target peer from the given peer
  1758. * @peer: datapath peer
  1759. *
  1760. * Return: MLD peer in case of MLO Link peer
  1761. * Peer itself in other cases
  1762. */
  1763. static inline
  1764. struct dp_peer *dp_get_tgt_peer_from_peer(struct dp_peer *peer)
  1765. {
  1766. return IS_MLO_DP_LINK_PEER(peer) ? peer->mld_peer : peer;
  1767. }
  1768. /**
  1769. * dp_get_primary_link_peer_by_id(): Get primary link peer from the given
  1770. * peer id
  1771. * @soc: core DP soc context
  1772. * @peer_id: peer id
  1773. * @mod_id: ID of module requesting reference
  1774. *
  1775. * Return: primary link peer for the MLO peer
  1776. * legacy peer itself in case of legacy peer
  1777. */
  1778. static inline
  1779. struct dp_peer *dp_get_primary_link_peer_by_id(struct dp_soc *soc,
  1780. uint16_t peer_id,
  1781. enum dp_mod_id mod_id)
  1782. {
  1783. uint8_t i;
  1784. struct dp_mld_link_peers link_peers_info;
  1785. struct dp_peer *peer;
  1786. struct dp_peer *link_peer;
  1787. struct dp_peer *primary_peer = NULL;
  1788. peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1789. if (!peer)
  1790. return NULL;
  1791. if (IS_MLO_DP_MLD_PEER(peer)) {
  1792. /* get link peers with reference */
  1793. dp_get_link_peers_ref_from_mld_peer(soc, peer, &link_peers_info,
  1794. mod_id);
  1795. for (i = 0; i < link_peers_info.num_links; i++) {
  1796. link_peer = link_peers_info.link_peers[i];
  1797. if (link_peer->primary_link) {
  1798. primary_peer = link_peer;
  1799. /*
  1800. * Take additional reference over
  1801. * primary link peer.
  1802. */
  1803. dp_peer_get_ref(NULL, primary_peer, mod_id);
  1804. break;
  1805. }
  1806. }
  1807. /* release link peers reference */
  1808. dp_release_link_peers_ref(&link_peers_info, mod_id);
  1809. dp_peer_unref_delete(peer, mod_id);
  1810. } else {
  1811. primary_peer = peer;
  1812. }
  1813. return primary_peer;
  1814. }
  1815. /**
  1816. * dp_get_txrx_peer() - Get dp_txrx_peer from passed dp_peer
  1817. * @peer: Datapath peer
  1818. *
  1819. * Return: dp_txrx_peer from MLD peer if peer type is link peer
  1820. * dp_txrx_peer from peer itself for other cases
  1821. */
  1822. static inline
  1823. struct dp_txrx_peer *dp_get_txrx_peer(struct dp_peer *peer)
  1824. {
  1825. return IS_MLO_DP_LINK_PEER(peer) ?
  1826. peer->mld_peer->txrx_peer : peer->txrx_peer;
  1827. }
  1828. /**
  1829. * dp_peer_is_primary_link_peer() - Check if peer is primary link peer
  1830. * @peer: Datapath peer
  1831. *
  1832. * Return: true if peer is primary link peer or legacy peer
  1833. * false otherwise
  1834. */
  1835. static inline
  1836. bool dp_peer_is_primary_link_peer(struct dp_peer *peer)
  1837. {
  1838. if (IS_MLO_DP_LINK_PEER(peer) && peer->primary_link)
  1839. return true;
  1840. else if (IS_DP_LEGACY_PEER(peer))
  1841. return true;
  1842. else
  1843. return false;
  1844. }
  1845. /**
  1846. * dp_tgt_txrx_peer_get_ref_by_id() - Gets tgt txrx peer for given the peer id
  1847. *
  1848. * @soc: core DP soc context
  1849. * @peer_id: peer id from peer object can be retrieved
  1850. * @handle: reference handle
  1851. * @mod_id: ID of module requesting reference
  1852. *
  1853. * Return: struct dp_txrx_peer*: Pointer to txrx DP peer object
  1854. */
  1855. static inline struct dp_txrx_peer *
  1856. dp_tgt_txrx_peer_get_ref_by_id(struct dp_soc *soc,
  1857. uint16_t peer_id,
  1858. dp_txrx_ref_handle *handle,
  1859. enum dp_mod_id mod_id)
  1860. {
  1861. struct dp_peer *peer;
  1862. struct dp_txrx_peer *txrx_peer;
  1863. peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1864. if (!peer)
  1865. return NULL;
  1866. txrx_peer = dp_get_txrx_peer(peer);
  1867. if (txrx_peer) {
  1868. *handle = (dp_txrx_ref_handle)peer;
  1869. return txrx_peer;
  1870. }
  1871. dp_peer_unref_delete(peer, mod_id);
  1872. return NULL;
  1873. }
  1874. /**
  1875. * dp_print_mlo_ast_stats_be() - Print AST stats for MLO peers
  1876. *
  1877. * @soc: core DP soc context
  1878. *
  1879. * Return: void
  1880. */
  1881. void dp_print_mlo_ast_stats_be(struct dp_soc *soc);
  1882. #else
  1883. #define IS_MLO_DP_MLD_TXRX_PEER(_peer) false
  1884. #define DP_PEER_SET_TYPE(_peer, _type_val) /* no op */
  1885. /* is legacy peer */
  1886. #define IS_DP_LEGACY_PEER(_peer) true
  1887. #define IS_MLO_DP_LINK_PEER(_peer) false
  1888. #define IS_MLO_DP_MLD_PEER(_peer) false
  1889. #define DP_GET_MLD_PEER_FROM_PEER(link_peer) NULL
  1890. static inline
  1891. struct dp_peer *dp_peer_hash_find_wrapper(struct dp_soc *soc,
  1892. struct cdp_peer_info *peer_info,
  1893. enum dp_mod_id mod_id)
  1894. {
  1895. return dp_peer_find_hash_find(soc, peer_info->mac_addr,
  1896. peer_info->mac_addr_is_aligned,
  1897. peer_info->vdev_id,
  1898. mod_id);
  1899. }
  1900. static inline
  1901. struct dp_peer *dp_peer_get_tgt_peer_hash_find(struct dp_soc *soc,
  1902. uint8_t *peer_mac,
  1903. int mac_addr_is_aligned,
  1904. uint8_t vdev_id,
  1905. enum dp_mod_id mod_id)
  1906. {
  1907. return dp_peer_find_hash_find(soc, peer_mac,
  1908. mac_addr_is_aligned, vdev_id,
  1909. mod_id);
  1910. }
  1911. static inline
  1912. struct dp_peer *dp_peer_get_tgt_peer_by_id(struct dp_soc *soc,
  1913. uint16_t peer_id,
  1914. enum dp_mod_id mod_id)
  1915. {
  1916. return dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1917. }
  1918. static inline
  1919. QDF_STATUS dp_peer_mlo_setup(
  1920. struct dp_soc *soc,
  1921. struct dp_peer *peer,
  1922. uint8_t vdev_id,
  1923. struct cdp_peer_setup_info *setup_info)
  1924. {
  1925. return QDF_STATUS_SUCCESS;
  1926. }
  1927. static inline
  1928. void dp_mld_peer_init_link_peers_info(struct dp_peer *mld_peer)
  1929. {
  1930. }
  1931. static inline
  1932. void dp_mld_peer_deinit_link_peers_info(struct dp_peer *mld_peer)
  1933. {
  1934. }
  1935. static inline
  1936. void dp_link_peer_del_mld_peer(struct dp_peer *link_peer)
  1937. {
  1938. }
  1939. static inline
  1940. void dp_peer_mlo_delete(struct dp_peer *peer)
  1941. {
  1942. }
  1943. static inline
  1944. void dp_mlo_peer_authorize(struct dp_soc *soc,
  1945. struct dp_peer *link_peer)
  1946. {
  1947. }
  1948. static inline uint8_t dp_mlo_get_chip_id(struct dp_soc *soc)
  1949. {
  1950. return 0;
  1951. }
  1952. static inline struct dp_peer *
  1953. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  1954. uint8_t *peer_mac_addr,
  1955. int mac_addr_is_aligned,
  1956. uint8_t vdev_id,
  1957. uint8_t chip_id,
  1958. enum dp_mod_id mod_id)
  1959. {
  1960. return dp_peer_find_hash_find(soc, peer_mac_addr,
  1961. mac_addr_is_aligned,
  1962. vdev_id, mod_id);
  1963. }
  1964. static inline
  1965. struct dp_peer *dp_get_tgt_peer_from_peer(struct dp_peer *peer)
  1966. {
  1967. return peer;
  1968. }
  1969. static inline
  1970. struct dp_peer *dp_get_primary_link_peer_by_id(struct dp_soc *soc,
  1971. uint16_t peer_id,
  1972. enum dp_mod_id mod_id)
  1973. {
  1974. return dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1975. }
  1976. static inline
  1977. struct dp_txrx_peer *dp_get_txrx_peer(struct dp_peer *peer)
  1978. {
  1979. return peer->txrx_peer;
  1980. }
  1981. static inline
  1982. bool dp_peer_is_primary_link_peer(struct dp_peer *peer)
  1983. {
  1984. return true;
  1985. }
  1986. /**
  1987. * dp_tgt_txrx_peer_get_ref_by_id() - Gets tgt txrx peer for given the peer id
  1988. *
  1989. * @soc: core DP soc context
  1990. * @peer_id: peer id from peer object can be retrieved
  1991. * @handle: reference handle
  1992. * @mod_id: ID of module requesting reference
  1993. *
  1994. * Return: struct dp_txrx_peer*: Pointer to txrx DP peer object
  1995. */
  1996. static inline struct dp_txrx_peer *
  1997. dp_tgt_txrx_peer_get_ref_by_id(struct dp_soc *soc,
  1998. uint16_t peer_id,
  1999. dp_txrx_ref_handle *handle,
  2000. enum dp_mod_id mod_id)
  2001. {
  2002. return dp_txrx_peer_get_ref_by_id(soc, peer_id, handle, mod_id);
  2003. }
  2004. static inline
  2005. uint16_t dp_get_link_peer_id_by_lmac_id(struct dp_soc *soc, uint16_t peer_id,
  2006. uint8_t lmac_id)
  2007. {
  2008. return peer_id;
  2009. }
  2010. static inline void dp_print_mlo_ast_stats_be(struct dp_soc *soc)
  2011. {
  2012. }
  2013. #endif /* WLAN_FEATURE_11BE_MLO */
  2014. static inline
  2015. QDF_STATUS dp_peer_rx_tids_create(struct dp_peer *peer)
  2016. {
  2017. uint8_t i;
  2018. if (IS_MLO_DP_MLD_PEER(peer)) {
  2019. dp_peer_info("skip for mld peer");
  2020. return QDF_STATUS_SUCCESS;
  2021. }
  2022. if (peer->rx_tid) {
  2023. QDF_BUG(0);
  2024. dp_peer_err("peer rx_tid mem already exist");
  2025. return QDF_STATUS_E_FAILURE;
  2026. }
  2027. peer->rx_tid = qdf_mem_malloc(DP_MAX_TIDS *
  2028. sizeof(struct dp_rx_tid));
  2029. if (!peer->rx_tid) {
  2030. dp_err("fail to alloc tid for peer" QDF_MAC_ADDR_FMT,
  2031. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2032. return QDF_STATUS_E_NOMEM;
  2033. }
  2034. qdf_mem_zero(peer->rx_tid, DP_MAX_TIDS * sizeof(struct dp_rx_tid));
  2035. for (i = 0; i < DP_MAX_TIDS; i++)
  2036. qdf_spinlock_create(&peer->rx_tid[i].tid_lock);
  2037. return QDF_STATUS_SUCCESS;
  2038. }
  2039. static inline
  2040. void dp_peer_rx_tids_destroy(struct dp_peer *peer)
  2041. {
  2042. uint8_t i;
  2043. if (!IS_MLO_DP_LINK_PEER(peer)) {
  2044. for (i = 0; i < DP_MAX_TIDS; i++)
  2045. qdf_spinlock_destroy(&peer->rx_tid[i].tid_lock);
  2046. qdf_mem_free(peer->rx_tid);
  2047. }
  2048. peer->rx_tid = NULL;
  2049. }
  2050. static inline
  2051. void dp_peer_defrag_rx_tids_init(struct dp_txrx_peer *txrx_peer)
  2052. {
  2053. uint8_t i;
  2054. qdf_mem_zero(&txrx_peer->rx_tid, DP_MAX_TIDS *
  2055. sizeof(struct dp_rx_tid_defrag));
  2056. for (i = 0; i < DP_MAX_TIDS; i++)
  2057. qdf_spinlock_create(&txrx_peer->rx_tid[i].defrag_tid_lock);
  2058. }
  2059. static inline
  2060. void dp_peer_defrag_rx_tids_deinit(struct dp_txrx_peer *txrx_peer)
  2061. {
  2062. uint8_t i;
  2063. for (i = 0; i < DP_MAX_TIDS; i++)
  2064. qdf_spinlock_destroy(&txrx_peer->rx_tid[i].defrag_tid_lock);
  2065. }
  2066. #ifdef PEER_CACHE_RX_PKTS
  2067. static inline
  2068. void dp_peer_rx_bufq_resources_init(struct dp_txrx_peer *txrx_peer)
  2069. {
  2070. qdf_spinlock_create(&txrx_peer->bufq_info.bufq_lock);
  2071. txrx_peer->bufq_info.thresh = DP_RX_CACHED_BUFQ_THRESH;
  2072. qdf_list_create(&txrx_peer->bufq_info.cached_bufq,
  2073. DP_RX_CACHED_BUFQ_THRESH);
  2074. }
  2075. static inline
  2076. void dp_peer_rx_bufq_resources_deinit(struct dp_txrx_peer *txrx_peer)
  2077. {
  2078. qdf_list_destroy(&txrx_peer->bufq_info.cached_bufq);
  2079. qdf_spinlock_destroy(&txrx_peer->bufq_info.bufq_lock);
  2080. }
  2081. #else
  2082. static inline
  2083. void dp_peer_rx_bufq_resources_init(struct dp_txrx_peer *txrx_peer)
  2084. {
  2085. }
  2086. static inline
  2087. void dp_peer_rx_bufq_resources_deinit(struct dp_txrx_peer *txrx_peer)
  2088. {
  2089. }
  2090. #endif
  2091. /**
  2092. * dp_peer_update_state() - update dp peer state
  2093. *
  2094. * @soc: core DP soc context
  2095. * @peer: DP peer
  2096. * @state: new state
  2097. *
  2098. * Return: None
  2099. */
  2100. static inline void
  2101. dp_peer_update_state(struct dp_soc *soc,
  2102. struct dp_peer *peer,
  2103. enum dp_peer_state state)
  2104. {
  2105. uint8_t peer_state;
  2106. qdf_spin_lock_bh(&peer->peer_state_lock);
  2107. peer_state = peer->peer_state;
  2108. switch (state) {
  2109. case DP_PEER_STATE_INIT:
  2110. DP_PEER_STATE_ASSERT
  2111. (peer, state, (peer_state != DP_PEER_STATE_ACTIVE) ||
  2112. (peer_state != DP_PEER_STATE_LOGICAL_DELETE));
  2113. break;
  2114. case DP_PEER_STATE_ACTIVE:
  2115. DP_PEER_STATE_ASSERT(peer, state,
  2116. (peer_state == DP_PEER_STATE_INIT));
  2117. break;
  2118. case DP_PEER_STATE_LOGICAL_DELETE:
  2119. DP_PEER_STATE_ASSERT(peer, state,
  2120. (peer_state == DP_PEER_STATE_ACTIVE) ||
  2121. (peer_state == DP_PEER_STATE_INIT));
  2122. break;
  2123. case DP_PEER_STATE_INACTIVE:
  2124. if (IS_MLO_DP_MLD_PEER(peer))
  2125. DP_PEER_STATE_ASSERT
  2126. (peer, state,
  2127. (peer_state == DP_PEER_STATE_ACTIVE));
  2128. else
  2129. DP_PEER_STATE_ASSERT
  2130. (peer, state,
  2131. (peer_state == DP_PEER_STATE_LOGICAL_DELETE));
  2132. break;
  2133. case DP_PEER_STATE_FREED:
  2134. if (peer->sta_self_peer)
  2135. DP_PEER_STATE_ASSERT
  2136. (peer, state, (peer_state == DP_PEER_STATE_INIT));
  2137. else
  2138. DP_PEER_STATE_ASSERT
  2139. (peer, state,
  2140. (peer_state == DP_PEER_STATE_INACTIVE) ||
  2141. (peer_state == DP_PEER_STATE_LOGICAL_DELETE));
  2142. break;
  2143. default:
  2144. qdf_spin_unlock_bh(&peer->peer_state_lock);
  2145. dp_alert("Invalid peer state %u for peer " QDF_MAC_ADDR_FMT,
  2146. state, QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2147. return;
  2148. }
  2149. peer->peer_state = state;
  2150. qdf_spin_unlock_bh(&peer->peer_state_lock);
  2151. dp_info("Updating peer state from %u to %u mac " QDF_MAC_ADDR_FMT "\n",
  2152. peer_state, state,
  2153. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  2154. }
  2155. #ifdef REO_SHARED_QREF_TABLE_EN
  2156. void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2157. struct dp_peer *peer);
  2158. #else
  2159. static inline void dp_peer_rx_reo_shared_qaddr_delete(struct dp_soc *soc,
  2160. struct dp_peer *peer) {}
  2161. #endif
  2162. /**
  2163. * dp_peer_check_wds_ext_peer() - Check WDS ext peer
  2164. *
  2165. * @peer: DP peer
  2166. *
  2167. * Return: True for WDS ext peer, false otherwise
  2168. */
  2169. bool dp_peer_check_wds_ext_peer(struct dp_peer *peer);
  2170. #endif /* _DP_PEER_H_ */