dp_peer.h 43 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717
  1. /*
  2. * Copyright (c) 2016-2021 The Linux Foundation. All rights reserved.
  3. * Copyright (c) 2021-2022 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. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  25. #include "hal_reo.h"
  26. #endif
  27. #define DP_INVALID_PEER_ID 0xffff
  28. #define DP_PEER_MAX_MEC_IDX 1024 /* maximum index for MEC table */
  29. #define DP_PEER_MAX_MEC_ENTRY 4096 /* maximum MEC entries in MEC table */
  30. #define DP_FW_PEER_STATS_CMP_TIMEOUT_MSEC 5000
  31. #define DP_PEER_HASH_LOAD_MULT 2
  32. #define DP_PEER_HASH_LOAD_SHIFT 0
  33. #define dp_peer_alert(params...) QDF_TRACE_FATAL(QDF_MODULE_ID_DP_PEER, params)
  34. #define dp_peer_err(params...) QDF_TRACE_ERROR(QDF_MODULE_ID_DP_PEER, params)
  35. #define dp_peer_warn(params...) QDF_TRACE_WARN(QDF_MODULE_ID_DP_PEER, params)
  36. #define dp_peer_info(params...) \
  37. __QDF_TRACE_FL(QDF_TRACE_LEVEL_INFO_HIGH, QDF_MODULE_ID_DP_PEER, ## params)
  38. #define dp_peer_debug(params...) QDF_TRACE_DEBUG(QDF_MODULE_ID_DP_PEER, params)
  39. #ifdef REO_QDESC_HISTORY
  40. enum reo_qdesc_event_type {
  41. REO_QDESC_UPDATE_CB = 0,
  42. REO_QDESC_FREE,
  43. };
  44. struct reo_qdesc_event {
  45. qdf_dma_addr_t qdesc_addr;
  46. uint64_t ts;
  47. enum reo_qdesc_event_type type;
  48. uint8_t peer_mac[QDF_MAC_ADDR_SIZE];
  49. };
  50. #endif
  51. struct ast_del_ctxt {
  52. bool age;
  53. int del_count;
  54. };
  55. typedef void dp_peer_iter_func(struct dp_soc *soc, struct dp_peer *peer,
  56. void *arg);
  57. void dp_peer_unref_delete(struct dp_peer *peer, enum dp_mod_id id);
  58. void dp_txrx_peer_unref_delete(dp_txrx_ref_handle *handle);
  59. struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  60. uint8_t *peer_mac_addr,
  61. int mac_addr_is_aligned,
  62. uint8_t vdev_id,
  63. enum dp_mod_id id);
  64. bool dp_peer_find_by_id_valid(struct dp_soc *soc, uint16_t peer_id);
  65. /**
  66. * dp_peer_get_ref() - Returns peer object given the peer id
  67. *
  68. * @soc : core DP soc context
  69. * @peer : DP peer
  70. * @mod_id : id of module requesting the reference
  71. *
  72. * Return: QDF_STATUS_SUCCESS if reference held successfully
  73. * else QDF_STATUS_E_INVAL
  74. */
  75. static inline
  76. QDF_STATUS dp_peer_get_ref(struct dp_soc *soc,
  77. struct dp_peer *peer,
  78. enum dp_mod_id mod_id)
  79. {
  80. if (!qdf_atomic_inc_not_zero(&peer->ref_cnt))
  81. return QDF_STATUS_E_INVAL;
  82. if (mod_id > DP_MOD_ID_RX)
  83. qdf_atomic_inc(&peer->mod_refs[mod_id]);
  84. return QDF_STATUS_SUCCESS;
  85. }
  86. /**
  87. * __dp_peer_get_ref_by_id() - Returns peer object given the peer id
  88. *
  89. * @soc : core DP soc context
  90. * @peer_id : peer id from peer object can be retrieved
  91. * @mod_id : module id
  92. *
  93. * Return: struct dp_peer*: Pointer to DP peer object
  94. */
  95. static inline struct dp_peer *
  96. __dp_peer_get_ref_by_id(struct dp_soc *soc,
  97. uint16_t peer_id,
  98. enum dp_mod_id mod_id)
  99. {
  100. struct dp_peer *peer;
  101. qdf_spin_lock_bh(&soc->peer_map_lock);
  102. peer = (peer_id >= soc->max_peer_id) ? NULL :
  103. soc->peer_id_to_obj_map[peer_id];
  104. if (!peer ||
  105. (dp_peer_get_ref(soc, peer, mod_id) != QDF_STATUS_SUCCESS)) {
  106. qdf_spin_unlock_bh(&soc->peer_map_lock);
  107. return NULL;
  108. }
  109. qdf_spin_unlock_bh(&soc->peer_map_lock);
  110. return peer;
  111. }
  112. /**
  113. * dp_peer_get_ref_by_id() - Returns peer object given the peer id
  114. * if peer state is active
  115. *
  116. * @soc : core DP soc context
  117. * @peer_id : peer id from peer object can be retrieved
  118. * @mod_id : ID ot module requesting reference
  119. *
  120. * Return: struct dp_peer*: Pointer to DP peer object
  121. */
  122. static inline
  123. struct dp_peer *dp_peer_get_ref_by_id(struct dp_soc *soc,
  124. uint16_t peer_id,
  125. enum dp_mod_id mod_id)
  126. {
  127. struct dp_peer *peer;
  128. qdf_spin_lock_bh(&soc->peer_map_lock);
  129. peer = (peer_id >= soc->max_peer_id) ? NULL :
  130. soc->peer_id_to_obj_map[peer_id];
  131. if (!peer || peer->peer_state >= DP_PEER_STATE_LOGICAL_DELETE ||
  132. (dp_peer_get_ref(soc, peer, mod_id) != QDF_STATUS_SUCCESS)) {
  133. qdf_spin_unlock_bh(&soc->peer_map_lock);
  134. return NULL;
  135. }
  136. qdf_spin_unlock_bh(&soc->peer_map_lock);
  137. return peer;
  138. }
  139. /**
  140. * dp_txrx_peer_get_ref_by_id() - Returns txrx peer object given the peer id
  141. *
  142. * @soc : core DP soc context
  143. * @peer_id : peer id from peer object can be retrieved
  144. * @handle : reference handle
  145. *
  146. * Return: struct dp_txrx_peer*: Pointer to txrx DP peer object
  147. */
  148. static inline struct dp_txrx_peer *
  149. dp_txrx_peer_get_ref_by_id(struct dp_soc *soc,
  150. uint16_t peer_id,
  151. dp_txrx_ref_handle *handle)
  152. {
  153. struct dp_peer *peer;
  154. peer = dp_peer_get_ref_by_id(soc, peer_id, DP_MOD_ID_TX_RX);
  155. if (!peer)
  156. return NULL;
  157. *handle = (dp_txrx_ref_handle)peer;
  158. return peer->txrx_peer;
  159. }
  160. #ifdef PEER_CACHE_RX_PKTS
  161. /**
  162. * dp_rx_flush_rx_cached() - flush cached rx frames
  163. * @peer: peer
  164. * @drop: set flag to drop frames
  165. *
  166. * Return: None
  167. */
  168. void dp_rx_flush_rx_cached(struct dp_peer *peer, bool drop);
  169. #else
  170. static inline void dp_rx_flush_rx_cached(struct dp_peer *peer, bool drop)
  171. {
  172. }
  173. #endif
  174. static inline void
  175. dp_clear_peer_internal(struct dp_soc *soc, struct dp_peer *peer)
  176. {
  177. qdf_spin_lock_bh(&peer->peer_info_lock);
  178. peer->state = OL_TXRX_PEER_STATE_DISC;
  179. qdf_spin_unlock_bh(&peer->peer_info_lock);
  180. dp_rx_flush_rx_cached(peer, true);
  181. }
  182. /**
  183. * dp_vdev_iterate_peer() - API to iterate through vdev peer list
  184. *
  185. * @vdev : DP vdev context
  186. * @func : function to be called for each peer
  187. * @arg : argument need to be passed to func
  188. * @mod_id : module_id
  189. *
  190. * Return: void
  191. */
  192. static inline void
  193. dp_vdev_iterate_peer(struct dp_vdev *vdev, dp_peer_iter_func *func, void *arg,
  194. enum dp_mod_id mod_id)
  195. {
  196. struct dp_peer *peer;
  197. struct dp_peer *tmp_peer;
  198. struct dp_soc *soc = NULL;
  199. if (!vdev || !vdev->pdev || !vdev->pdev->soc)
  200. return;
  201. soc = vdev->pdev->soc;
  202. qdf_spin_lock_bh(&vdev->peer_list_lock);
  203. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  204. peer_list_elem,
  205. tmp_peer) {
  206. if (dp_peer_get_ref(soc, peer, mod_id) ==
  207. QDF_STATUS_SUCCESS) {
  208. (*func)(soc, peer, arg);
  209. dp_peer_unref_delete(peer, mod_id);
  210. }
  211. }
  212. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  213. }
  214. /**
  215. * dp_pdev_iterate_peer() - API to iterate through all peers of pdev
  216. *
  217. * @pdev : DP pdev context
  218. * @func : function to be called for each peer
  219. * @arg : argument need to be passed to func
  220. * @mod_id : module_id
  221. *
  222. * Return: void
  223. */
  224. static inline void
  225. dp_pdev_iterate_peer(struct dp_pdev *pdev, dp_peer_iter_func *func, void *arg,
  226. enum dp_mod_id mod_id)
  227. {
  228. struct dp_vdev *vdev;
  229. if (!pdev)
  230. return;
  231. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  232. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev)
  233. dp_vdev_iterate_peer(vdev, func, arg, mod_id);
  234. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  235. }
  236. /**
  237. * dp_soc_iterate_peer() - API to iterate through all peers of soc
  238. *
  239. * @soc : DP soc context
  240. * @func : function to be called for each peer
  241. * @arg : argument need to be passed to func
  242. * @mod_id : module_id
  243. *
  244. * Return: void
  245. */
  246. static inline void
  247. dp_soc_iterate_peer(struct dp_soc *soc, dp_peer_iter_func *func, void *arg,
  248. enum dp_mod_id mod_id)
  249. {
  250. struct dp_pdev *pdev;
  251. int i;
  252. if (!soc)
  253. return;
  254. for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) {
  255. pdev = soc->pdev_list[i];
  256. dp_pdev_iterate_peer(pdev, func, arg, mod_id);
  257. }
  258. }
  259. /**
  260. * dp_vdev_iterate_peer_lock_safe() - API to iterate through vdev list
  261. *
  262. * This API will cache the peers in local allocated memory and calls
  263. * iterate function outside the lock.
  264. *
  265. * As this API is allocating new memory it is suggested to use this
  266. * only when lock cannot be held
  267. *
  268. * @vdev : DP vdev context
  269. * @func : function to be called for each peer
  270. * @arg : argument need to be passed to func
  271. * @mod_id : module_id
  272. *
  273. * Return: void
  274. */
  275. static inline void
  276. dp_vdev_iterate_peer_lock_safe(struct dp_vdev *vdev,
  277. dp_peer_iter_func *func,
  278. void *arg,
  279. enum dp_mod_id mod_id)
  280. {
  281. struct dp_peer *peer;
  282. struct dp_peer *tmp_peer;
  283. struct dp_soc *soc = NULL;
  284. struct dp_peer **peer_array = NULL;
  285. int i = 0;
  286. uint32_t num_peers = 0;
  287. if (!vdev || !vdev->pdev || !vdev->pdev->soc)
  288. return;
  289. num_peers = vdev->num_peers;
  290. soc = vdev->pdev->soc;
  291. peer_array = qdf_mem_malloc(num_peers * sizeof(struct dp_peer *));
  292. if (!peer_array)
  293. return;
  294. qdf_spin_lock_bh(&vdev->peer_list_lock);
  295. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  296. peer_list_elem,
  297. tmp_peer) {
  298. if (i >= num_peers)
  299. break;
  300. if (dp_peer_get_ref(soc, peer, mod_id) == QDF_STATUS_SUCCESS) {
  301. peer_array[i] = peer;
  302. i = (i + 1);
  303. }
  304. }
  305. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  306. for (i = 0; i < num_peers; i++) {
  307. peer = peer_array[i];
  308. if (!peer)
  309. continue;
  310. (*func)(soc, peer, arg);
  311. dp_peer_unref_delete(peer, mod_id);
  312. }
  313. qdf_mem_free(peer_array);
  314. }
  315. /**
  316. * dp_pdev_iterate_peer_lock_safe() - API to iterate through all peers of pdev
  317. *
  318. * This API will cache the peers in local allocated memory and calls
  319. * iterate function outside the lock.
  320. *
  321. * As this API is allocating new memory it is suggested to use this
  322. * only when lock cannot be held
  323. *
  324. * @pdev : DP pdev context
  325. * @func : function to be called for each peer
  326. * @arg : argument need to be passed to func
  327. * @mod_id : module_id
  328. *
  329. * Return: void
  330. */
  331. static inline void
  332. dp_pdev_iterate_peer_lock_safe(struct dp_pdev *pdev,
  333. dp_peer_iter_func *func,
  334. void *arg,
  335. enum dp_mod_id mod_id)
  336. {
  337. struct dp_peer *peer;
  338. struct dp_peer *tmp_peer;
  339. struct dp_soc *soc = NULL;
  340. struct dp_vdev *vdev = NULL;
  341. struct dp_peer **peer_array[DP_PDEV_MAX_VDEVS] = {0};
  342. int i = 0;
  343. int j = 0;
  344. uint32_t num_peers[DP_PDEV_MAX_VDEVS] = {0};
  345. if (!pdev || !pdev->soc)
  346. return;
  347. soc = pdev->soc;
  348. qdf_spin_lock_bh(&pdev->vdev_list_lock);
  349. DP_PDEV_ITERATE_VDEV_LIST(pdev, vdev) {
  350. num_peers[i] = vdev->num_peers;
  351. peer_array[i] = qdf_mem_malloc(num_peers[i] *
  352. sizeof(struct dp_peer *));
  353. if (!peer_array[i])
  354. break;
  355. qdf_spin_lock_bh(&vdev->peer_list_lock);
  356. TAILQ_FOREACH_SAFE(peer, &vdev->peer_list,
  357. peer_list_elem,
  358. tmp_peer) {
  359. if (j >= num_peers[i])
  360. break;
  361. if (dp_peer_get_ref(soc, peer, mod_id) ==
  362. QDF_STATUS_SUCCESS) {
  363. peer_array[i][j] = peer;
  364. j = (j + 1);
  365. }
  366. }
  367. qdf_spin_unlock_bh(&vdev->peer_list_lock);
  368. i = (i + 1);
  369. }
  370. qdf_spin_unlock_bh(&pdev->vdev_list_lock);
  371. for (i = 0; i < DP_PDEV_MAX_VDEVS; i++) {
  372. if (!peer_array[i])
  373. break;
  374. for (j = 0; j < num_peers[i]; j++) {
  375. peer = peer_array[i][j];
  376. if (!peer)
  377. continue;
  378. (*func)(soc, peer, arg);
  379. dp_peer_unref_delete(peer, mod_id);
  380. }
  381. qdf_mem_free(peer_array[i]);
  382. }
  383. }
  384. /**
  385. * dp_soc_iterate_peer_lock_safe() - API to iterate through all peers of soc
  386. *
  387. * This API will cache the peers in local allocated memory and calls
  388. * iterate function outside the lock.
  389. *
  390. * As this API is allocating new memory it is suggested to use this
  391. * only when lock cannot be held
  392. *
  393. * @soc : DP soc context
  394. * @func : function to be called for each peer
  395. * @arg : argument need to be passed to func
  396. * @mod_id : module_id
  397. *
  398. * Return: void
  399. */
  400. static inline void
  401. dp_soc_iterate_peer_lock_safe(struct dp_soc *soc,
  402. dp_peer_iter_func *func,
  403. void *arg,
  404. enum dp_mod_id mod_id)
  405. {
  406. struct dp_pdev *pdev;
  407. int i;
  408. if (!soc)
  409. return;
  410. for (i = 0; i < MAX_PDEV_CNT && soc->pdev_list[i]; i++) {
  411. pdev = soc->pdev_list[i];
  412. dp_pdev_iterate_peer_lock_safe(pdev, func, arg, mod_id);
  413. }
  414. }
  415. #ifdef DP_PEER_STATE_DEBUG
  416. #define DP_PEER_STATE_ASSERT(_peer, _new_state, _condition) \
  417. do { \
  418. if (!(_condition)) { \
  419. dp_alert("Invalid state shift from %u to %u peer " \
  420. QDF_MAC_ADDR_FMT, \
  421. (_peer)->peer_state, (_new_state), \
  422. QDF_MAC_ADDR_REF((_peer)->mac_addr.raw)); \
  423. QDF_ASSERT(0); \
  424. } \
  425. } while (0)
  426. #else
  427. #define DP_PEER_STATE_ASSERT(_peer, _new_state, _condition) \
  428. do { \
  429. if (!(_condition)) { \
  430. dp_alert("Invalid state shift from %u to %u peer " \
  431. QDF_MAC_ADDR_FMT, \
  432. (_peer)->peer_state, (_new_state), \
  433. QDF_MAC_ADDR_REF((_peer)->mac_addr.raw)); \
  434. } \
  435. } while (0)
  436. #endif
  437. /**
  438. * dp_peer_state_cmp() - compare dp peer state
  439. *
  440. * @peer : DP peer
  441. * @state : state
  442. *
  443. * Return: true if state matches with peer state
  444. * false if it does not match
  445. */
  446. static inline bool
  447. dp_peer_state_cmp(struct dp_peer *peer,
  448. enum dp_peer_state state)
  449. {
  450. bool is_status_equal = false;
  451. qdf_spin_lock_bh(&peer->peer_state_lock);
  452. is_status_equal = (peer->peer_state == state);
  453. qdf_spin_unlock_bh(&peer->peer_state_lock);
  454. return is_status_equal;
  455. }
  456. /**
  457. * dp_peer_update_state() - update dp peer state
  458. *
  459. * @soc : core DP soc context
  460. * @peer : DP peer
  461. * @state : new state
  462. *
  463. * Return: None
  464. */
  465. static inline void
  466. dp_peer_update_state(struct dp_soc *soc,
  467. struct dp_peer *peer,
  468. enum dp_peer_state state)
  469. {
  470. uint8_t peer_state;
  471. qdf_spin_lock_bh(&peer->peer_state_lock);
  472. peer_state = peer->peer_state;
  473. switch (state) {
  474. case DP_PEER_STATE_INIT:
  475. DP_PEER_STATE_ASSERT
  476. (peer, state, (peer_state != DP_PEER_STATE_ACTIVE) ||
  477. (peer_state != DP_PEER_STATE_LOGICAL_DELETE));
  478. break;
  479. case DP_PEER_STATE_ACTIVE:
  480. DP_PEER_STATE_ASSERT(peer, state,
  481. (peer_state == DP_PEER_STATE_INIT));
  482. break;
  483. case DP_PEER_STATE_LOGICAL_DELETE:
  484. DP_PEER_STATE_ASSERT(peer, state,
  485. (peer_state == DP_PEER_STATE_ACTIVE) ||
  486. (peer_state == DP_PEER_STATE_INIT));
  487. break;
  488. case DP_PEER_STATE_INACTIVE:
  489. DP_PEER_STATE_ASSERT
  490. (peer, state,
  491. (peer_state == DP_PEER_STATE_LOGICAL_DELETE));
  492. break;
  493. case DP_PEER_STATE_FREED:
  494. if (peer->sta_self_peer)
  495. DP_PEER_STATE_ASSERT
  496. (peer, state, (peer_state == DP_PEER_STATE_INIT));
  497. else
  498. DP_PEER_STATE_ASSERT
  499. (peer, state,
  500. (peer_state == DP_PEER_STATE_INACTIVE) ||
  501. (peer_state == DP_PEER_STATE_LOGICAL_DELETE));
  502. break;
  503. default:
  504. qdf_spin_unlock_bh(&peer->peer_state_lock);
  505. dp_alert("Invalid peer state %u for peer "QDF_MAC_ADDR_FMT,
  506. state, QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  507. return;
  508. }
  509. peer->peer_state = state;
  510. qdf_spin_unlock_bh(&peer->peer_state_lock);
  511. dp_info("Updating peer state from %u to %u mac "QDF_MAC_ADDR_FMT"\n",
  512. peer_state, state,
  513. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  514. }
  515. void dp_print_ast_stats(struct dp_soc *soc);
  516. QDF_STATUS dp_rx_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  517. uint16_t hw_peer_id, uint8_t vdev_id,
  518. uint8_t *peer_mac_addr, uint16_t ast_hash,
  519. uint8_t is_wds);
  520. void dp_rx_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id,
  521. uint8_t vdev_id, uint8_t *peer_mac_addr,
  522. uint8_t is_wds, uint32_t free_wds_count);
  523. #ifdef WLAN_FEATURE_11BE_MLO
  524. /**
  525. * dp_rx_mlo_peer_map_handler() - handle MLO peer map event from firmware
  526. * @soc_handle - genereic soc handle
  527. * @peer_id - ML peer_id from firmware
  528. * @peer_mac_addr - mac address of the peer
  529. * @mlo_ast_flow_info: MLO AST flow info
  530. *
  531. * associate the ML peer_id that firmware provided with peer entry
  532. * and update the ast table in the host with the hw_peer_id.
  533. *
  534. * Return: QDF_STATUS code
  535. */
  536. QDF_STATUS
  537. dp_rx_mlo_peer_map_handler(struct dp_soc *soc, uint16_t peer_id,
  538. uint8_t *peer_mac_addr,
  539. struct dp_mlo_flow_override_info *mlo_flow_info);
  540. /**
  541. * dp_rx_mlo_peer_unmap_handler() - handle MLO peer unmap event from firmware
  542. * @soc_handle - genereic soc handle
  543. * @peeri_id - peer_id from firmware
  544. *
  545. * Return: none
  546. */
  547. void dp_rx_mlo_peer_unmap_handler(struct dp_soc *soc, uint16_t peer_id);
  548. #endif
  549. void dp_rx_sec_ind_handler(struct dp_soc *soc, uint16_t peer_id,
  550. enum cdp_sec_type sec_type, int is_unicast,
  551. u_int32_t *michael_key, u_int32_t *rx_pn);
  552. QDF_STATUS dp_rx_delba_ind_handler(void *soc_handle, uint16_t peer_id,
  553. uint8_t tid, uint16_t win_sz);
  554. uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle,
  555. uint16_t peer_id, uint8_t *peer_mac);
  556. QDF_STATUS dp_peer_add_ast(struct dp_soc *soc, struct dp_peer *peer,
  557. uint8_t *mac_addr, enum cdp_txrx_ast_entry_type type,
  558. uint32_t flags);
  559. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry);
  560. void dp_peer_ast_unmap_handler(struct dp_soc *soc,
  561. struct dp_ast_entry *ast_entry);
  562. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  563. struct dp_ast_entry *ast_entry, uint32_t flags);
  564. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  565. uint8_t *ast_mac_addr,
  566. uint8_t pdev_id);
  567. struct dp_ast_entry *dp_peer_ast_hash_find_by_vdevid(struct dp_soc *soc,
  568. uint8_t *ast_mac_addr,
  569. uint8_t vdev_id);
  570. struct dp_ast_entry *dp_peer_ast_hash_find_soc(struct dp_soc *soc,
  571. uint8_t *ast_mac_addr);
  572. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  573. struct dp_ast_entry *ast_entry);
  574. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  575. struct dp_ast_entry *ast_entry);
  576. void dp_peer_ast_set_type(struct dp_soc *soc,
  577. struct dp_ast_entry *ast_entry,
  578. enum cdp_txrx_ast_entry_type type);
  579. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  580. struct dp_ast_entry *ast_entry,
  581. struct dp_peer *peer);
  582. void dp_peer_free_hmwds_cb(struct cdp_ctrl_objmgr_psoc *ctrl_psoc,
  583. struct cdp_soc *dp_soc,
  584. void *cookie,
  585. enum cdp_ast_free_status status);
  586. void dp_peer_ast_hash_remove(struct dp_soc *soc,
  587. struct dp_ast_entry *ase);
  588. void dp_peer_free_ast_entry(struct dp_soc *soc,
  589. struct dp_ast_entry *ast_entry);
  590. void dp_peer_unlink_ast_entry(struct dp_soc *soc,
  591. struct dp_ast_entry *ast_entry,
  592. struct dp_peer *peer);
  593. /**
  594. * dp_peer_mec_detach_entry() - Detach the MEC entry
  595. * @soc: SoC handle
  596. * @mecentry: MEC entry of the node
  597. * @ptr: pointer to free list
  598. *
  599. * The MEC entry is detached from MEC table and added to free_list
  600. * to free the object outside lock
  601. *
  602. * Return: None
  603. */
  604. void dp_peer_mec_detach_entry(struct dp_soc *soc, struct dp_mec_entry *mecentry,
  605. void *ptr);
  606. /**
  607. * dp_peer_mec_free_list() - free the MEC entry from free_list
  608. * @soc: SoC handle
  609. * @ptr: pointer to free list
  610. *
  611. * Return: None
  612. */
  613. void dp_peer_mec_free_list(struct dp_soc *soc, void *ptr);
  614. /**
  615. * dp_peer_mec_add_entry()
  616. * @soc: SoC handle
  617. * @vdev: vdev to which mec node belongs
  618. * @mac_addr: MAC address of mec node
  619. *
  620. * This function allocates and adds MEC entry to MEC table.
  621. * It assumes caller has taken the mec lock to protect the access to these
  622. * tables
  623. *
  624. * Return: QDF_STATUS
  625. */
  626. QDF_STATUS dp_peer_mec_add_entry(struct dp_soc *soc,
  627. struct dp_vdev *vdev,
  628. uint8_t *mac_addr);
  629. /**
  630. * dp_peer_mec_hash_find_by_pdevid() - Find MEC entry by MAC address
  631. * within pdev
  632. * @soc: SoC handle
  633. *
  634. * It assumes caller has taken the mec_lock to protect the access to
  635. * MEC hash table
  636. *
  637. * Return: MEC entry
  638. */
  639. struct dp_mec_entry *dp_peer_mec_hash_find_by_pdevid(struct dp_soc *soc,
  640. uint8_t pdev_id,
  641. uint8_t *mec_mac_addr);
  642. #define DP_AST_ASSERT(_condition) \
  643. do { \
  644. if (!(_condition)) { \
  645. dp_print_ast_stats(soc);\
  646. QDF_BUG(_condition); \
  647. } \
  648. } while (0)
  649. /**
  650. * dp_peer_update_inactive_time - Update inactive time for peer
  651. * @pdev: pdev object
  652. * @tag_type: htt_tlv_tag type
  653. * #tag_buf: buf message
  654. */
  655. void
  656. dp_peer_update_inactive_time(struct dp_pdev *pdev, uint32_t tag_type,
  657. uint32_t *tag_buf);
  658. #ifndef QCA_MULTIPASS_SUPPORT
  659. /**
  660. * dp_peer_set_vlan_id: set vlan_id for this peer
  661. * @cdp_soc: soc handle
  662. * @vdev_id: id of vdev object
  663. * @peer_mac: mac address
  664. * @vlan_id: vlan id for peer
  665. *
  666. * return: void
  667. */
  668. static inline
  669. void dp_peer_set_vlan_id(struct cdp_soc_t *cdp_soc,
  670. uint8_t vdev_id, uint8_t *peer_mac,
  671. uint16_t vlan_id)
  672. {
  673. }
  674. /**
  675. * dp_set_vlan_groupkey: set vlan map for vdev
  676. * @soc: pointer to soc
  677. * @vdev_id: id of vdev handle
  678. * @vlan_id: vlan_id
  679. * @group_key: group key for vlan
  680. *
  681. * return: set success/failure
  682. */
  683. static inline
  684. QDF_STATUS dp_set_vlan_groupkey(struct cdp_soc_t *soc, uint8_t vdev_id,
  685. uint16_t vlan_id, uint16_t group_key)
  686. {
  687. return QDF_STATUS_SUCCESS;
  688. }
  689. /**
  690. * dp_peer_multipass_list_init: initialize multipass peer list
  691. * @vdev: pointer to vdev
  692. *
  693. * return: void
  694. */
  695. static inline
  696. void dp_peer_multipass_list_init(struct dp_vdev *vdev)
  697. {
  698. }
  699. /**
  700. * dp_peer_multipass_list_remove: remove peer from special peer list
  701. * @peer: peer handle
  702. *
  703. * return: void
  704. */
  705. static inline
  706. void dp_peer_multipass_list_remove(struct dp_peer *peer)
  707. {
  708. }
  709. #else
  710. void dp_peer_set_vlan_id(struct cdp_soc_t *cdp_soc,
  711. uint8_t vdev_id, uint8_t *peer_mac,
  712. uint16_t vlan_id);
  713. QDF_STATUS dp_set_vlan_groupkey(struct cdp_soc_t *soc, uint8_t vdev_id,
  714. uint16_t vlan_id, uint16_t group_key);
  715. void dp_peer_multipass_list_init(struct dp_vdev *vdev);
  716. void dp_peer_multipass_list_remove(struct dp_peer *peer);
  717. #endif
  718. #ifndef QCA_PEER_MULTIQ_SUPPORT
  719. /**
  720. * dp_peer_reset_flowq_map() - reset peer flowq map table
  721. * @peer - dp peer handle
  722. *
  723. * Return: none
  724. */
  725. static inline
  726. void dp_peer_reset_flowq_map(struct dp_peer *peer)
  727. {
  728. }
  729. /**
  730. * dp_peer_ast_index_flow_queue_map_create() - create ast index flow queue map
  731. * @soc - genereic soc handle
  732. * @is_wds - flag to indicate if peer is wds
  733. * @peer_id - peer_id from htt peer map message
  734. * @peer_mac_addr - mac address of the peer
  735. * @ast_info - ast flow override information from peer map
  736. *
  737. * Return: none
  738. */
  739. static inline
  740. void dp_peer_ast_index_flow_queue_map_create(void *soc_hdl,
  741. bool is_wds, uint16_t peer_id, uint8_t *peer_mac_addr,
  742. struct dp_ast_flow_override_info *ast_info)
  743. {
  744. }
  745. #else
  746. void dp_peer_reset_flowq_map(struct dp_peer *peer);
  747. void dp_peer_ast_index_flow_queue_map_create(void *soc_hdl,
  748. bool is_wds, uint16_t peer_id, uint8_t *peer_mac_addr,
  749. struct dp_ast_flow_override_info *ast_info);
  750. #endif
  751. /*
  752. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  753. * after deleting the entries (ie., setting valid=0)
  754. *
  755. * @soc: DP SOC handle
  756. * @cb_ctxt: Callback context
  757. * @reo_status: REO command status
  758. */
  759. void dp_rx_tid_delete_cb(struct dp_soc *soc,
  760. void *cb_ctxt,
  761. union hal_reo_status *reo_status);
  762. #ifdef QCA_PEER_EXT_STATS
  763. QDF_STATUS dp_peer_ext_stats_ctx_alloc(struct dp_soc *soc,
  764. struct dp_peer *peer);
  765. void dp_peer_ext_stats_ctx_dealloc(struct dp_soc *soc,
  766. struct dp_peer *peer);
  767. #else
  768. static inline QDF_STATUS dp_peer_ext_stats_ctx_alloc(struct dp_soc *soc,
  769. struct dp_peer *peer)
  770. {
  771. return QDF_STATUS_SUCCESS;
  772. }
  773. static inline void dp_peer_ext_stats_ctx_dealloc(struct dp_soc *soc,
  774. struct dp_peer *peer)
  775. {
  776. }
  777. #endif
  778. struct dp_peer *dp_vdev_bss_peer_ref_n_get(struct dp_soc *soc,
  779. struct dp_vdev *vdev,
  780. enum dp_mod_id mod_id);
  781. struct dp_peer *dp_sta_vdev_self_peer_ref_n_get(struct dp_soc *soc,
  782. struct dp_vdev *vdev,
  783. enum dp_mod_id mod_id);
  784. void dp_peer_ast_table_detach(struct dp_soc *soc);
  785. void dp_peer_find_map_detach(struct dp_soc *soc);
  786. void dp_soc_wds_detach(struct dp_soc *soc);
  787. QDF_STATUS dp_peer_ast_table_attach(struct dp_soc *soc);
  788. QDF_STATUS dp_peer_ast_hash_attach(struct dp_soc *soc);
  789. QDF_STATUS dp_peer_mec_hash_attach(struct dp_soc *soc);
  790. void dp_soc_wds_attach(struct dp_soc *soc);
  791. void dp_peer_mec_hash_detach(struct dp_soc *soc);
  792. void dp_peer_ast_hash_detach(struct dp_soc *soc);
  793. #ifdef FEATURE_AST
  794. /*
  795. * dp_peer_delete_ast_entries(): Delete all AST entries for a peer
  796. * @soc - datapath soc handle
  797. * @peer - datapath peer handle
  798. *
  799. * Delete the AST entries belonging to a peer
  800. */
  801. static inline void dp_peer_delete_ast_entries(struct dp_soc *soc,
  802. struct dp_peer *peer)
  803. {
  804. struct dp_ast_entry *ast_entry, *temp_ast_entry;
  805. dp_peer_debug("peer: %pK, self_ast: %pK", peer, peer->self_ast_entry);
  806. /*
  807. * Delete peer self ast entry. This is done to handle scenarios
  808. * where peer is freed before peer map is received(for ex in case
  809. * of auth disallow due to ACL) in such cases self ast is not added
  810. * to peer->ast_list.
  811. */
  812. if (peer->self_ast_entry) {
  813. dp_peer_del_ast(soc, peer->self_ast_entry);
  814. peer->self_ast_entry = NULL;
  815. }
  816. DP_PEER_ITERATE_ASE_LIST(peer, ast_entry, temp_ast_entry)
  817. dp_peer_del_ast(soc, ast_entry);
  818. }
  819. #else
  820. static inline void dp_peer_delete_ast_entries(struct dp_soc *soc,
  821. struct dp_peer *peer)
  822. {
  823. }
  824. #endif
  825. #ifdef FEATURE_MEC
  826. /**
  827. * dp_peer_mec_spinlock_create() - Create the MEC spinlock
  828. * @soc: SoC handle
  829. *
  830. * Return: none
  831. */
  832. void dp_peer_mec_spinlock_create(struct dp_soc *soc);
  833. /**
  834. * dp_peer_mec_spinlock_destroy() - Destroy the MEC spinlock
  835. * @soc: SoC handle
  836. *
  837. * Return: none
  838. */
  839. void dp_peer_mec_spinlock_destroy(struct dp_soc *soc);
  840. /**
  841. * dp_peer_mec_flush_entries() - Delete all mec entries in table
  842. * @soc: Datapath SOC
  843. *
  844. * Return: None
  845. */
  846. void dp_peer_mec_flush_entries(struct dp_soc *soc);
  847. #else
  848. static inline void dp_peer_mec_spinlock_create(struct dp_soc *soc)
  849. {
  850. }
  851. static inline void dp_peer_mec_spinlock_destroy(struct dp_soc *soc)
  852. {
  853. }
  854. static inline void dp_peer_mec_flush_entries(struct dp_soc *soc)
  855. {
  856. }
  857. #endif
  858. #ifdef DUMP_REO_QUEUE_INFO_IN_DDR
  859. /**
  860. * dp_send_cache_flush_for_rx_tid() - Send cache flush cmd to REO per tid
  861. * @soc : dp_soc handle
  862. * @peer: peer
  863. *
  864. * This function is used to send cache flush cmd to reo and
  865. * to register the callback to handle the dumping of the reo
  866. * queue stas from DDR
  867. *
  868. * Return: none
  869. */
  870. void dp_send_cache_flush_for_rx_tid(
  871. struct dp_soc *soc, struct dp_peer *peer);
  872. /**
  873. * dp_get_rx_reo_queue_info() - Handler to get rx tid info
  874. * @soc : cdp_soc_t handle
  875. * @vdev_id: vdev id
  876. *
  877. * Handler to get rx tid info from DDR after h/w cache is
  878. * invalidated first using the cache flush cmd.
  879. *
  880. * Return: none
  881. */
  882. void dp_get_rx_reo_queue_info(
  883. struct cdp_soc_t *soc_hdl, uint8_t vdev_id);
  884. /**
  885. * dp_dump_rx_reo_queue_info() - Callback function to dump reo queue stats
  886. * @soc : dp_soc handle
  887. * @cb_ctxt - callback context
  888. * @reo_status: vdev id
  889. *
  890. * This is the callback function registered after sending the reo cmd
  891. * to flush the h/w cache and invalidate it. In the callback the reo
  892. * queue desc info is dumped from DDR.
  893. *
  894. * Return: none
  895. */
  896. void dp_dump_rx_reo_queue_info(
  897. struct dp_soc *soc, void *cb_ctxt, union hal_reo_status *reo_status);
  898. #else /* DUMP_REO_QUEUE_INFO_IN_DDR */
  899. static inline void dp_get_rx_reo_queue_info(
  900. struct cdp_soc_t *soc_hdl, uint8_t vdev_id)
  901. {
  902. }
  903. #endif /* DUMP_REO_QUEUE_INFO_IN_DDR */
  904. static inline int dp_peer_find_mac_addr_cmp(
  905. union dp_align_mac_addr *mac_addr1,
  906. union dp_align_mac_addr *mac_addr2)
  907. {
  908. /*
  909. * Intentionally use & rather than &&.
  910. * because the operands are binary rather than generic boolean,
  911. * the functionality is equivalent.
  912. * Using && has the advantage of short-circuited evaluation,
  913. * but using & has the advantage of no conditional branching,
  914. * which is a more significant benefit.
  915. */
  916. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  917. & (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  918. }
  919. /**
  920. * dp_peer_delete() - delete DP peer
  921. *
  922. * @soc: Datatpath soc
  923. * @peer: Datapath peer
  924. * @arg: argument to iter function
  925. *
  926. * Return: void
  927. */
  928. void dp_peer_delete(struct dp_soc *soc,
  929. struct dp_peer *peer,
  930. void *arg);
  931. #ifdef WLAN_FEATURE_11BE_MLO
  932. /* set peer type */
  933. #define DP_PEER_SET_TYPE(_peer, _type_val) \
  934. ((_peer)->peer_type = (_type_val))
  935. /* is legacy peer */
  936. #define IS_DP_LEGACY_PEER(_peer) \
  937. ((_peer)->peer_type == CDP_LINK_PEER_TYPE && !((_peer)->mld_peer))
  938. /* is MLO connection link peer */
  939. #define IS_MLO_DP_LINK_PEER(_peer) \
  940. ((_peer)->peer_type == CDP_LINK_PEER_TYPE && (_peer)->mld_peer)
  941. /* is MLO connection mld peer */
  942. #define IS_MLO_DP_MLD_PEER(_peer) \
  943. ((_peer)->peer_type == CDP_MLD_PEER_TYPE)
  944. #ifdef WLAN_MLO_MULTI_CHIP
  945. uint8_t dp_mlo_get_chip_id(struct dp_soc *soc);
  946. struct dp_peer *
  947. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  948. uint8_t *peer_mac_addr,
  949. int mac_addr_is_aligned,
  950. uint8_t vdev_id,
  951. uint8_t chip_id,
  952. enum dp_mod_id mod_id);
  953. #else
  954. static inline uint8_t dp_mlo_get_chip_id(struct dp_soc *soc)
  955. {
  956. return 0;
  957. }
  958. static inline struct dp_peer *
  959. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  960. uint8_t *peer_mac_addr,
  961. int mac_addr_is_aligned,
  962. uint8_t vdev_id,
  963. uint8_t chip_id,
  964. enum dp_mod_id mod_id)
  965. {
  966. return dp_peer_find_hash_find(soc, peer_mac_addr,
  967. mac_addr_is_aligned,
  968. vdev_id, mod_id);
  969. }
  970. #endif
  971. /**
  972. * dp_link_peer_add_mld_peer() - add mld peer pointer to link peer,
  973. increase mld peer ref_cnt
  974. * @link_peer: link peer pointer
  975. * @mld_peer: mld peer pointer
  976. *
  977. * Return: none
  978. */
  979. static inline
  980. void dp_link_peer_add_mld_peer(struct dp_peer *link_peer,
  981. struct dp_peer *mld_peer)
  982. {
  983. /* increase mld_peer ref_cnt */
  984. dp_peer_get_ref(NULL, mld_peer, DP_MOD_ID_CDP);
  985. link_peer->mld_peer = mld_peer;
  986. }
  987. /**
  988. * dp_link_peer_del_mld_peer() - delete mld peer pointer from link peer,
  989. decrease mld peer ref_cnt
  990. * @link_peer: link peer pointer
  991. *
  992. * Return: None
  993. */
  994. static inline
  995. void dp_link_peer_del_mld_peer(struct dp_peer *link_peer)
  996. {
  997. dp_peer_unref_delete(link_peer->mld_peer, DP_MOD_ID_CDP);
  998. link_peer->mld_peer = NULL;
  999. }
  1000. /**
  1001. * dp_mld_peer_init_link_peers_info() - init link peers info in mld peer
  1002. * @mld_peer: mld peer pointer
  1003. *
  1004. * Return: None
  1005. */
  1006. static inline
  1007. void dp_mld_peer_init_link_peers_info(struct dp_peer *mld_peer)
  1008. {
  1009. int i;
  1010. qdf_spinlock_create(&mld_peer->link_peers_info_lock);
  1011. mld_peer->num_links = 0;
  1012. for (i = 0; i < DP_MAX_MLO_LINKS; i++)
  1013. mld_peer->link_peers[i].is_valid = false;
  1014. }
  1015. /**
  1016. * dp_mld_peer_deinit_link_peers_info() - Deinit link peers info in mld peer
  1017. * @mld_peer: mld peer pointer
  1018. *
  1019. * Return: None
  1020. */
  1021. static inline
  1022. void dp_mld_peer_deinit_link_peers_info(struct dp_peer *mld_peer)
  1023. {
  1024. qdf_spinlock_destroy(&mld_peer->link_peers_info_lock);
  1025. }
  1026. /**
  1027. * dp_mld_peer_add_link_peer() - add link peer info to mld peer
  1028. * @mld_peer: mld dp peer pointer
  1029. * @link_peer: link dp peer pointer
  1030. *
  1031. * Return: None
  1032. */
  1033. static inline
  1034. void dp_mld_peer_add_link_peer(struct dp_peer *mld_peer,
  1035. struct dp_peer *link_peer)
  1036. {
  1037. int i;
  1038. struct dp_peer_link_info *link_peer_info;
  1039. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1040. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1041. link_peer_info = &mld_peer->link_peers[i];
  1042. if (!link_peer_info->is_valid) {
  1043. qdf_mem_copy(link_peer_info->mac_addr.raw,
  1044. link_peer->mac_addr.raw,
  1045. QDF_MAC_ADDR_SIZE);
  1046. link_peer_info->is_valid = true;
  1047. link_peer_info->vdev_id = link_peer->vdev->vdev_id;
  1048. link_peer_info->chip_id =
  1049. dp_mlo_get_chip_id(link_peer->vdev->pdev->soc);
  1050. mld_peer->num_links++;
  1051. break;
  1052. }
  1053. }
  1054. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1055. if (i == DP_MAX_MLO_LINKS)
  1056. dp_err("fail to add link peer" QDF_MAC_ADDR_FMT "to mld peer",
  1057. QDF_MAC_ADDR_REF(link_peer->mac_addr.raw));
  1058. }
  1059. /**
  1060. * dp_mld_peer_del_link_peer() - Delete link peer info from MLD peer
  1061. * @mld_peer: MLD dp peer pointer
  1062. * @link_peer: link dp peer pointer
  1063. *
  1064. * Return: number of links left after deletion
  1065. */
  1066. static inline
  1067. uint8_t dp_mld_peer_del_link_peer(struct dp_peer *mld_peer,
  1068. struct dp_peer *link_peer)
  1069. {
  1070. int i;
  1071. struct dp_peer_link_info *link_peer_info;
  1072. uint8_t num_links;
  1073. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1074. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1075. link_peer_info = &mld_peer->link_peers[i];
  1076. if (link_peer_info->is_valid &&
  1077. !dp_peer_find_mac_addr_cmp(&link_peer->mac_addr,
  1078. &link_peer_info->mac_addr)) {
  1079. link_peer_info->is_valid = false;
  1080. mld_peer->num_links--;
  1081. break;
  1082. }
  1083. }
  1084. num_links = mld_peer->num_links;
  1085. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1086. if (i == DP_MAX_MLO_LINKS)
  1087. dp_err("fail to del link peer" QDF_MAC_ADDR_FMT "to mld peer",
  1088. QDF_MAC_ADDR_REF(link_peer->mac_addr.raw));
  1089. return num_links;
  1090. }
  1091. /**
  1092. * dp_get_link_peers_ref_from_mld_peer() - get link peers pointer and
  1093. increase link peers ref_cnt
  1094. * @soc: dp_soc handle
  1095. * @mld_peer: dp mld peer pointer
  1096. * @mld_link_peers: structure that hold links peers ponter array and number
  1097. * @mod_id: id of module requesting reference
  1098. *
  1099. * Return: None
  1100. */
  1101. static inline
  1102. void dp_get_link_peers_ref_from_mld_peer(
  1103. struct dp_soc *soc,
  1104. struct dp_peer *mld_peer,
  1105. struct dp_mld_link_peers *mld_link_peers,
  1106. enum dp_mod_id mod_id)
  1107. {
  1108. struct dp_peer *peer;
  1109. uint8_t i = 0, j = 0;
  1110. struct dp_peer_link_info *link_peer_info;
  1111. qdf_mem_zero(mld_link_peers, sizeof(*mld_link_peers));
  1112. qdf_spin_lock_bh(&mld_peer->link_peers_info_lock);
  1113. for (i = 0; i < DP_MAX_MLO_LINKS; i++) {
  1114. link_peer_info = &mld_peer->link_peers[i];
  1115. if (link_peer_info->is_valid) {
  1116. peer = dp_link_peer_hash_find_by_chip_id(
  1117. soc,
  1118. link_peer_info->mac_addr.raw,
  1119. true,
  1120. link_peer_info->vdev_id,
  1121. link_peer_info->chip_id,
  1122. mod_id);
  1123. if (peer)
  1124. mld_link_peers->link_peers[j++] = peer;
  1125. }
  1126. }
  1127. qdf_spin_unlock_bh(&mld_peer->link_peers_info_lock);
  1128. mld_link_peers->num_links = j;
  1129. }
  1130. /**
  1131. * dp_release_link_peers_ref() - release all link peers reference
  1132. * @mld_link_peers: structure that hold links peers ponter array and number
  1133. * @mod_id: id of module requesting reference
  1134. *
  1135. * Return: None.
  1136. */
  1137. static inline
  1138. void dp_release_link_peers_ref(
  1139. struct dp_mld_link_peers *mld_link_peers,
  1140. enum dp_mod_id mod_id)
  1141. {
  1142. struct dp_peer *peer;
  1143. uint8_t i;
  1144. for (i = 0; i < mld_link_peers->num_links; i++) {
  1145. peer = mld_link_peers->link_peers[i];
  1146. if (peer)
  1147. dp_peer_unref_delete(peer, mod_id);
  1148. mld_link_peers->link_peers[i] = NULL;
  1149. }
  1150. mld_link_peers->num_links = 0;
  1151. }
  1152. /**
  1153. * dp_peer_get_tgt_peer_hash_find() - get MLD dp_peer handle
  1154. for processing
  1155. * @soc: soc handle
  1156. * @peer_mac_addr: peer mac address
  1157. * @mac_addr_is_aligned: is mac addr alligned
  1158. * @vdev_id: vdev_id
  1159. * @mod_id: id of module requesting reference
  1160. *
  1161. * for MLO connection, get corresponding MLD peer,
  1162. * otherwise get link peer for non-MLO case.
  1163. *
  1164. * return: peer in success
  1165. * NULL in failure
  1166. */
  1167. static inline
  1168. struct dp_peer *dp_peer_get_tgt_peer_hash_find(struct dp_soc *soc,
  1169. uint8_t *peer_mac,
  1170. int mac_addr_is_aligned,
  1171. uint8_t vdev_id,
  1172. enum dp_mod_id mod_id)
  1173. {
  1174. struct dp_peer *ta_peer = NULL;
  1175. struct dp_peer *peer = dp_peer_find_hash_find(soc,
  1176. peer_mac, 0, vdev_id,
  1177. mod_id);
  1178. if (peer) {
  1179. /* mlo connection link peer, get mld peer with reference */
  1180. if (IS_MLO_DP_LINK_PEER(peer)) {
  1181. /* increase mld peer ref_cnt */
  1182. if (QDF_STATUS_SUCCESS ==
  1183. dp_peer_get_ref(soc, peer->mld_peer, mod_id))
  1184. ta_peer = peer->mld_peer;
  1185. else
  1186. ta_peer = NULL;
  1187. /* relese peer reference that added by hash find */
  1188. dp_peer_unref_delete(peer, mod_id);
  1189. } else {
  1190. /* mlo MLD peer or non-mlo link peer */
  1191. ta_peer = peer;
  1192. }
  1193. }
  1194. return ta_peer;
  1195. }
  1196. /**
  1197. * dp_peer_get_tgt_peer_by_id() - Returns target peer object given the peer id
  1198. * @soc : core DP soc context
  1199. * @peer_id : peer id from peer object can be retrieved
  1200. * @mod_id : ID ot module requesting reference
  1201. *
  1202. * for MLO connection, get corresponding MLD peer,
  1203. * otherwise get link peer for non-MLO case.
  1204. *
  1205. * return: peer in success
  1206. * NULL in failure
  1207. */
  1208. static inline
  1209. struct dp_peer *dp_peer_get_tgt_peer_by_id(struct dp_soc *soc,
  1210. uint16_t peer_id,
  1211. enum dp_mod_id mod_id)
  1212. {
  1213. struct dp_peer *ta_peer = NULL;
  1214. struct dp_peer *peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1215. if (peer) {
  1216. /* mlo connection link peer, get mld peer with reference */
  1217. if (IS_MLO_DP_LINK_PEER(peer)) {
  1218. /* increase mld peer ref_cnt */
  1219. if (QDF_STATUS_SUCCESS ==
  1220. dp_peer_get_ref(soc, peer->mld_peer, mod_id))
  1221. ta_peer = peer->mld_peer;
  1222. else
  1223. ta_peer = NULL;
  1224. /* relese peer reference that added by hash find */
  1225. dp_peer_unref_delete(peer, mod_id);
  1226. } else {
  1227. /* mlo MLD peer or non-mlo link peer */
  1228. ta_peer = peer;
  1229. }
  1230. }
  1231. return ta_peer;
  1232. }
  1233. /**
  1234. * dp_peer_mlo_delete() - peer MLO related delete operation
  1235. * @peer: DP peer handle
  1236. * Return: None
  1237. */
  1238. static inline
  1239. void dp_peer_mlo_delete(struct dp_peer *peer)
  1240. {
  1241. struct dp_peer *ml_peer;
  1242. struct dp_soc *soc;
  1243. /* MLO connection link peer */
  1244. if (IS_MLO_DP_LINK_PEER(peer)) {
  1245. ml_peer = peer->mld_peer;
  1246. soc = ml_peer->vdev->pdev->soc;
  1247. /* if last link peer deletion, delete MLD peer */
  1248. if (dp_mld_peer_del_link_peer(peer->mld_peer, peer) == 0)
  1249. dp_peer_delete(soc, peer->mld_peer, NULL);
  1250. }
  1251. }
  1252. /**
  1253. * dp_peer_mlo_setup() - create MLD peer and MLO related initialization
  1254. * @soc: Soc handle
  1255. * @vdev_id: Vdev ID
  1256. * @peer_setup_info: peer setup information for MLO
  1257. */
  1258. QDF_STATUS dp_peer_mlo_setup(
  1259. struct dp_soc *soc,
  1260. struct dp_peer *peer,
  1261. uint8_t vdev_id,
  1262. struct cdp_peer_setup_info *setup_info);
  1263. /**
  1264. * dp_get_tgt_peer_from_peer() - Get target peer from the given peer
  1265. * @peer: datapath peer
  1266. *
  1267. * Return: MLD peer in case of MLO Link peer
  1268. * Peer itself in other cases
  1269. */
  1270. static inline
  1271. struct dp_peer *dp_get_tgt_peer_from_peer(struct dp_peer *peer)
  1272. {
  1273. return IS_MLO_DP_LINK_PEER(peer) ? peer->mld_peer : peer;
  1274. }
  1275. /**
  1276. * dp_get_primary_link_peer_by_id(): Get primary link peer from the given
  1277. * peer id
  1278. * @soc: core DP soc context
  1279. * @peer_id: peer id
  1280. * @mod_id: ID of module requesting reference
  1281. *
  1282. * Return: primary link peer for the MLO peer
  1283. * legacy peer itself in case of legacy peer
  1284. */
  1285. static inline
  1286. struct dp_peer *dp_get_primary_link_peer_by_id(struct dp_soc *soc,
  1287. uint16_t peer_id,
  1288. enum dp_mod_id mod_id)
  1289. {
  1290. uint8_t i;
  1291. struct dp_mld_link_peers link_peers_info;
  1292. struct dp_peer *peer;
  1293. struct dp_peer *link_peer;
  1294. struct dp_peer *primary_peer = NULL;
  1295. peer = dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1296. if (!peer)
  1297. return NULL;
  1298. if (IS_MLO_DP_MLD_PEER(peer)) {
  1299. /* get link peers with reference */
  1300. dp_get_link_peers_ref_from_mld_peer(soc, peer, &link_peers_info,
  1301. mod_id);
  1302. for (i = 0; i < link_peers_info.num_links; i++) {
  1303. link_peer = link_peers_info.link_peers[i];
  1304. if (link_peer->primary_link) {
  1305. primary_peer = link_peer;
  1306. /*
  1307. * Take additional reference over
  1308. * primary link peer.
  1309. */
  1310. dp_peer_get_ref(NULL, primary_peer, mod_id);
  1311. break;
  1312. }
  1313. }
  1314. /* release link peers reference */
  1315. dp_release_link_peers_ref(&link_peers_info, mod_id);
  1316. dp_peer_unref_delete(peer, mod_id);
  1317. } else {
  1318. primary_peer = peer;
  1319. }
  1320. return primary_peer;
  1321. }
  1322. /**
  1323. * dp_get_txrx_peer() - Get dp_txrx_peer from passed dp_peer
  1324. * @peer: Datapath peer
  1325. *
  1326. * Return: dp_txrx_peer from MLD peer if peer type is link peer
  1327. * dp_txrx_peer from peer itself for other cases
  1328. */
  1329. static inline
  1330. struct dp_txrx_peer *dp_get_txrx_peer(struct dp_peer *peer)
  1331. {
  1332. return IS_MLO_DP_LINK_PEER(peer) ?
  1333. peer->mld_peer->txrx_peer : peer->txrx_peer;
  1334. }
  1335. /**
  1336. * dp_peer_is_primary_link_peer() - Check if peer is primary link peer
  1337. * @peer: Datapath peer
  1338. *
  1339. * Return: true if peer is primary link peer or legacy peer
  1340. * false otherwise
  1341. */
  1342. static inline
  1343. bool dp_peer_is_primary_link_peer(struct dp_peer *peer)
  1344. {
  1345. if (IS_MLO_DP_LINK_PEER(peer) && peer->primary_link)
  1346. return true;
  1347. else if (IS_DP_LEGACY_PEER(peer))
  1348. return true;
  1349. else
  1350. return false;
  1351. }
  1352. #else
  1353. #define DP_PEER_SET_TYPE(_peer, _type_val) /* no op */
  1354. /* is legacy peer */
  1355. #define IS_DP_LEGACY_PEER(_peer) true
  1356. #define IS_MLO_DP_LINK_PEER(_peer) false
  1357. #define IS_MLO_DP_MLD_PEER(_peer) false
  1358. static inline
  1359. struct dp_peer *dp_peer_get_tgt_peer_hash_find(struct dp_soc *soc,
  1360. uint8_t *peer_mac,
  1361. int mac_addr_is_aligned,
  1362. uint8_t vdev_id,
  1363. enum dp_mod_id mod_id)
  1364. {
  1365. return dp_peer_find_hash_find(soc, peer_mac,
  1366. mac_addr_is_aligned, vdev_id,
  1367. mod_id);
  1368. }
  1369. static inline
  1370. struct dp_peer *dp_peer_get_tgt_peer_by_id(struct dp_soc *soc,
  1371. uint16_t peer_id,
  1372. enum dp_mod_id mod_id)
  1373. {
  1374. return dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1375. }
  1376. static inline
  1377. QDF_STATUS dp_peer_mlo_setup(
  1378. struct dp_soc *soc,
  1379. struct dp_peer *peer,
  1380. uint8_t vdev_id,
  1381. struct cdp_peer_setup_info *setup_info)
  1382. {
  1383. return QDF_STATUS_SUCCESS;
  1384. }
  1385. static inline
  1386. void dp_mld_peer_init_link_peers_info(struct dp_peer *mld_peer)
  1387. {
  1388. }
  1389. static inline
  1390. void dp_mld_peer_deinit_link_peers_info(struct dp_peer *mld_peer)
  1391. {
  1392. }
  1393. static inline
  1394. void dp_link_peer_del_mld_peer(struct dp_peer *link_peer)
  1395. {
  1396. }
  1397. static inline
  1398. void dp_peer_mlo_delete(struct dp_peer *peer)
  1399. {
  1400. }
  1401. static inline
  1402. void dp_mlo_peer_authorize(struct dp_soc *soc,
  1403. struct dp_peer *link_peer)
  1404. {
  1405. }
  1406. static inline uint8_t dp_mlo_get_chip_id(struct dp_soc *soc)
  1407. {
  1408. return 0;
  1409. }
  1410. static inline struct dp_peer *
  1411. dp_link_peer_hash_find_by_chip_id(struct dp_soc *soc,
  1412. uint8_t *peer_mac_addr,
  1413. int mac_addr_is_aligned,
  1414. uint8_t vdev_id,
  1415. uint8_t chip_id,
  1416. enum dp_mod_id mod_id)
  1417. {
  1418. return dp_peer_find_hash_find(soc, peer_mac_addr,
  1419. mac_addr_is_aligned,
  1420. vdev_id, mod_id);
  1421. }
  1422. static inline
  1423. struct dp_peer *dp_get_tgt_peer_from_peer(struct dp_peer *peer)
  1424. {
  1425. return peer;
  1426. }
  1427. static inline
  1428. struct dp_peer *dp_get_primary_link_peer_by_id(struct dp_soc *soc,
  1429. uint16_t peer_id,
  1430. enum dp_mod_id mod_id)
  1431. {
  1432. return dp_peer_get_ref_by_id(soc, peer_id, mod_id);
  1433. }
  1434. static inline
  1435. struct dp_txrx_peer *dp_get_txrx_peer(struct dp_peer *peer)
  1436. {
  1437. return peer->txrx_peer;
  1438. }
  1439. static inline
  1440. bool dp_peer_is_primary_link_peer(struct dp_peer *peer)
  1441. {
  1442. return true;
  1443. }
  1444. #endif /* WLAN_FEATURE_11BE_MLO */
  1445. #if defined(WLAN_FEATURE_11BE_MLO) && defined(WLAN_MLO_MULTI_CHIP)
  1446. /**
  1447. * dp_mlo_partner_chips_map() - Map MLO peers to partner SOCs
  1448. * @soc: Soc handle
  1449. * @peer: DP peer handle for ML peer
  1450. * @peer_id: peer_id
  1451. * Return: None
  1452. */
  1453. void dp_mlo_partner_chips_map(struct dp_soc *soc,
  1454. struct dp_peer *peer,
  1455. uint16_t peer_id);
  1456. /**
  1457. * dp_mlo_partner_chips_unmap() - Unmap MLO peers to partner SOCs
  1458. * @soc: Soc handle
  1459. * @peer_id: peer_id
  1460. * Return: None
  1461. */
  1462. void dp_mlo_partner_chips_unmap(struct dp_soc *soc,
  1463. uint16_t peer_id);
  1464. #else
  1465. static inline void dp_mlo_partner_chips_map(struct dp_soc *soc,
  1466. struct dp_peer *peer,
  1467. uint16_t peer_id)
  1468. {
  1469. }
  1470. static inline void dp_mlo_partner_chips_unmap(struct dp_soc *soc,
  1471. uint16_t peer_id)
  1472. {
  1473. }
  1474. #endif
  1475. static inline
  1476. QDF_STATUS dp_peer_rx_tids_create(struct dp_peer *peer)
  1477. {
  1478. uint8_t i;
  1479. if (IS_MLO_DP_MLD_PEER(peer)) {
  1480. dp_peer_info("skip for mld peer");
  1481. return QDF_STATUS_SUCCESS;
  1482. }
  1483. if (peer->rx_tid) {
  1484. QDF_BUG(0);
  1485. dp_peer_err("peer rx_tid mem already exist");
  1486. return QDF_STATUS_E_FAILURE;
  1487. }
  1488. peer->rx_tid = qdf_mem_malloc(DP_MAX_TIDS *
  1489. sizeof(struct dp_rx_tid));
  1490. if (!peer->rx_tid) {
  1491. dp_err("fail to alloc tid for peer" QDF_MAC_ADDR_FMT,
  1492. QDF_MAC_ADDR_REF(peer->mac_addr.raw));
  1493. return QDF_STATUS_E_NOMEM;
  1494. }
  1495. qdf_mem_zero(peer->rx_tid, DP_MAX_TIDS * sizeof(struct dp_rx_tid));
  1496. for (i = 0; i < DP_MAX_TIDS; i++)
  1497. qdf_spinlock_create(&peer->rx_tid[i].tid_lock);
  1498. return QDF_STATUS_SUCCESS;
  1499. }
  1500. static inline
  1501. void dp_peer_rx_tids_destroy(struct dp_peer *peer)
  1502. {
  1503. uint8_t i;
  1504. if (!IS_MLO_DP_LINK_PEER(peer)) {
  1505. for (i = 0; i < DP_MAX_TIDS; i++)
  1506. qdf_spinlock_destroy(&peer->rx_tid[i].tid_lock);
  1507. qdf_mem_free(peer->rx_tid);
  1508. }
  1509. peer->rx_tid = NULL;
  1510. }
  1511. #endif /* _DP_PEER_H_ */