dp_peer.c 48 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738
  1. /*
  2. * Copyright (c) 2016-2017 The Linux Foundation. All rights reserved.
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for
  5. * any purpose with or without fee is hereby granted, provided that the
  6. * above copyright notice and this permission notice appear in all
  7. * copies.
  8. *
  9. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  10. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  11. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  12. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  13. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  14. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  15. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  16. * PERFORMANCE OF THIS SOFTWARE.
  17. */
  18. #include <qdf_types.h>
  19. #include <qdf_lock.h>
  20. #include "dp_htt.h"
  21. #include "dp_types.h"
  22. #include "dp_internal.h"
  23. #include "dp_peer.h"
  24. #include <hal_api.h>
  25. #include <hal_reo.h>
  26. #ifdef CONFIG_MCL
  27. #include <cds_ieee80211_common.h>
  28. #endif
  29. #include <cdp_txrx_handle.h>
  30. #include <wlan_cfg.h>
  31. #ifdef DP_LFR
  32. static inline void
  33. dp_set_ssn_valid_flag(struct hal_reo_cmd_params *params,
  34. uint8_t valid)
  35. {
  36. params->u.upd_queue_params.update_svld = 1;
  37. params->u.upd_queue_params.svld = valid;
  38. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  39. "%s: Setting SSN valid bit to %d\n",
  40. __func__, valid);
  41. }
  42. #else
  43. static inline void
  44. dp_set_ssn_valid_flag(struct hal_reo_cmd_params *params,
  45. uint8_t valid) {};
  46. #endif
  47. static inline int dp_peer_find_mac_addr_cmp(
  48. union dp_align_mac_addr *mac_addr1,
  49. union dp_align_mac_addr *mac_addr2)
  50. {
  51. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  52. /*
  53. * Intentionally use & rather than &&.
  54. * because the operands are binary rather than generic boolean,
  55. * the functionality is equivalent.
  56. * Using && has the advantage of short-circuited evaluation,
  57. * but using & has the advantage of no conditional branching,
  58. * which is a more significant benefit.
  59. */
  60. &
  61. (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  62. }
  63. static int dp_peer_find_map_attach(struct dp_soc *soc)
  64. {
  65. uint32_t max_peers, peer_map_size;
  66. /* allocate the peer ID -> peer object map */
  67. max_peers = wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1;
  68. soc->max_peers = max_peers;
  69. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO,
  70. "\n<=== cfg max peer id %d ====>\n", max_peers);
  71. peer_map_size = max_peers * sizeof(soc->peer_id_to_obj_map[0]);
  72. soc->peer_id_to_obj_map = qdf_mem_malloc(peer_map_size);
  73. if (!soc->peer_id_to_obj_map) {
  74. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  75. "%s: peer map memory allocation failed\n", __func__);
  76. return QDF_STATUS_E_NOMEM;
  77. }
  78. /*
  79. * The peer_id_to_obj_map doesn't really need to be initialized,
  80. * since elements are only used after they have been individually
  81. * initialized.
  82. * However, it is convenient for debugging to have all elements
  83. * that are not in use set to 0.
  84. */
  85. qdf_mem_zero(soc->peer_id_to_obj_map, peer_map_size);
  86. return 0; /* success */
  87. }
  88. static int dp_log2_ceil(unsigned value)
  89. {
  90. unsigned tmp = value;
  91. int log2 = -1;
  92. while (tmp) {
  93. log2++;
  94. tmp >>= 1;
  95. }
  96. if (1 << log2 != value)
  97. log2++;
  98. return log2;
  99. }
  100. static int dp_peer_find_add_id_to_obj(
  101. struct dp_peer *peer,
  102. uint16_t peer_id)
  103. {
  104. int i;
  105. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  106. if (peer->peer_ids[i] == HTT_INVALID_PEER) {
  107. peer->peer_ids[i] = peer_id;
  108. return 0; /* success */
  109. }
  110. }
  111. return QDF_STATUS_E_FAILURE; /* failure */
  112. }
  113. #define DP_PEER_HASH_LOAD_MULT 2
  114. #define DP_PEER_HASH_LOAD_SHIFT 0
  115. static int dp_peer_find_hash_attach(struct dp_soc *soc)
  116. {
  117. int i, hash_elems, log2;
  118. /* allocate the peer MAC address -> peer object hash table */
  119. hash_elems = wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1;
  120. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  121. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  122. log2 = dp_log2_ceil(hash_elems);
  123. hash_elems = 1 << log2;
  124. soc->peer_hash.mask = hash_elems - 1;
  125. soc->peer_hash.idx_bits = log2;
  126. /* allocate an array of TAILQ peer object lists */
  127. soc->peer_hash.bins = qdf_mem_malloc(
  128. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  129. if (!soc->peer_hash.bins)
  130. return QDF_STATUS_E_NOMEM;
  131. for (i = 0; i < hash_elems; i++)
  132. TAILQ_INIT(&soc->peer_hash.bins[i]);
  133. return 0;
  134. }
  135. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  136. {
  137. qdf_mem_free(soc->peer_hash.bins);
  138. }
  139. static inline unsigned dp_peer_find_hash_index(struct dp_soc *soc,
  140. union dp_align_mac_addr *mac_addr)
  141. {
  142. unsigned index;
  143. index =
  144. mac_addr->align2.bytes_ab ^
  145. mac_addr->align2.bytes_cd ^
  146. mac_addr->align2.bytes_ef;
  147. index ^= index >> soc->peer_hash.idx_bits;
  148. index &= soc->peer_hash.mask;
  149. return index;
  150. }
  151. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  152. {
  153. unsigned index;
  154. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  155. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  156. /*
  157. * It is important to add the new peer at the tail of the peer list
  158. * with the bin index. Together with having the hash_find function
  159. * search from head to tail, this ensures that if two entries with
  160. * the same MAC address are stored, the one added first will be
  161. * found first.
  162. */
  163. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer, hash_list_elem);
  164. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  165. }
  166. #if ATH_SUPPORT_WRAP
  167. static struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  168. uint8_t *peer_mac_addr, int mac_addr_is_aligned, uint8_t vdev_id)
  169. #else
  170. static struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  171. uint8_t *peer_mac_addr, int mac_addr_is_aligned)
  172. #endif
  173. {
  174. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  175. unsigned index;
  176. struct dp_peer *peer;
  177. if (mac_addr_is_aligned) {
  178. mac_addr = (union dp_align_mac_addr *) peer_mac_addr;
  179. } else {
  180. qdf_mem_copy(
  181. &local_mac_addr_aligned.raw[0],
  182. peer_mac_addr, DP_MAC_ADDR_LEN);
  183. mac_addr = &local_mac_addr_aligned;
  184. }
  185. index = dp_peer_find_hash_index(soc, mac_addr);
  186. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  187. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  188. #if ATH_SUPPORT_WRAP
  189. /* ProxySTA may have multiple BSS peer with same MAC address,
  190. * modified find will take care of finding the correct BSS peer.
  191. */
  192. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  193. (peer->vdev->vdev_id == vdev_id)) {
  194. #else
  195. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0) {
  196. #endif
  197. /* found it - increment the ref count before releasing
  198. * the lock
  199. */
  200. qdf_atomic_inc(&peer->ref_cnt);
  201. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  202. return peer;
  203. }
  204. }
  205. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  206. return NULL; /* failure */
  207. }
  208. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  209. {
  210. unsigned index;
  211. struct dp_peer *tmppeer = NULL;
  212. int found = 0;
  213. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  214. /* Check if tail is not empty before delete*/
  215. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  216. /*
  217. * DO NOT take the peer_ref_mutex lock here - it needs to be taken
  218. * by the caller.
  219. * The caller needs to hold the lock from the time the peer object's
  220. * reference count is decremented and tested up through the time the
  221. * reference to the peer object is removed from the hash table, by
  222. * this function.
  223. * Holding the lock only while removing the peer object reference
  224. * from the hash table keeps the hash table consistent, but does not
  225. * protect against a new HL tx context starting to use the peer object
  226. * if it looks up the peer object from its MAC address just after the
  227. * peer ref count is decremented to zero, but just before the peer
  228. * object reference is removed from the hash table.
  229. */
  230. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index], hash_list_elem) {
  231. if (tmppeer == peer) {
  232. found = 1;
  233. break;
  234. }
  235. }
  236. QDF_ASSERT(found);
  237. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer, hash_list_elem);
  238. }
  239. void dp_peer_find_hash_erase(struct dp_soc *soc)
  240. {
  241. int i;
  242. /*
  243. * Not really necessary to take peer_ref_mutex lock - by this point,
  244. * it's known that the soc is no longer in use.
  245. */
  246. for (i = 0; i <= soc->peer_hash.mask; i++) {
  247. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  248. struct dp_peer *peer, *peer_next;
  249. /*
  250. * TAILQ_FOREACH_SAFE must be used here to avoid any
  251. * memory access violation after peer is freed
  252. */
  253. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  254. hash_list_elem, peer_next) {
  255. /*
  256. * Don't remove the peer from the hash table -
  257. * that would modify the list we are currently
  258. * traversing, and it's not necessary anyway.
  259. */
  260. /*
  261. * Artificially adjust the peer's ref count to
  262. * 1, so it will get deleted by
  263. * dp_peer_unref_delete.
  264. */
  265. /* set to zero */
  266. qdf_atomic_init(&peer->ref_cnt);
  267. /* incr to one */
  268. qdf_atomic_inc(&peer->ref_cnt);
  269. dp_peer_unref_delete(peer);
  270. }
  271. }
  272. }
  273. }
  274. static void dp_peer_find_map_detach(struct dp_soc *soc)
  275. {
  276. qdf_mem_free(soc->peer_id_to_obj_map);
  277. }
  278. int dp_peer_find_attach(struct dp_soc *soc)
  279. {
  280. if (dp_peer_find_map_attach(soc))
  281. return 1;
  282. if (dp_peer_find_hash_attach(soc)) {
  283. dp_peer_find_map_detach(soc);
  284. return 1;
  285. }
  286. return 0; /* success */
  287. }
  288. static void dp_rx_tid_stats_cb(struct dp_soc *soc, void *cb_ctxt,
  289. union hal_reo_status *reo_status)
  290. {
  291. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  292. struct hal_reo_queue_status *queue_status = &(reo_status->queue_status);
  293. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  294. DP_TRACE_STATS(FATAL, "REO stats failure %d for TID %d\n",
  295. queue_status->header.status, rx_tid->tid);
  296. return;
  297. }
  298. DP_TRACE_STATS(FATAL, "REO queue stats (TID: %d): \n"
  299. "ssn: %d\n"
  300. "curr_idx : %d\n"
  301. "pn_31_0 : %08x\n"
  302. "pn_63_32 : %08x\n"
  303. "pn_95_64 : %08x\n"
  304. "pn_127_96 : %08x\n"
  305. "last_rx_enq_tstamp : %08x\n"
  306. "last_rx_deq_tstamp : %08x\n"
  307. "rx_bitmap_31_0 : %08x\n"
  308. "rx_bitmap_63_32 : %08x\n"
  309. "rx_bitmap_95_64 : %08x\n"
  310. "rx_bitmap_127_96 : %08x\n"
  311. "rx_bitmap_159_128 : %08x\n"
  312. "rx_bitmap_191_160 : %08x\n"
  313. "rx_bitmap_223_192 : %08x\n"
  314. "rx_bitmap_255_224 : %08x\n",
  315. rx_tid->tid,
  316. queue_status->ssn, queue_status->curr_idx,
  317. queue_status->pn_31_0, queue_status->pn_63_32,
  318. queue_status->pn_95_64, queue_status->pn_127_96,
  319. queue_status->last_rx_enq_tstamp,
  320. queue_status->last_rx_deq_tstamp,
  321. queue_status->rx_bitmap_31_0, queue_status->rx_bitmap_63_32,
  322. queue_status->rx_bitmap_95_64, queue_status->rx_bitmap_127_96,
  323. queue_status->rx_bitmap_159_128,
  324. queue_status->rx_bitmap_191_160,
  325. queue_status->rx_bitmap_223_192,
  326. queue_status->rx_bitmap_255_224);
  327. DP_TRACE_STATS(FATAL,
  328. "curr_mpdu_cnt : %d\n"
  329. "curr_msdu_cnt : %d\n"
  330. "fwd_timeout_cnt : %d\n"
  331. "fwd_bar_cnt : %d\n"
  332. "dup_cnt : %d\n"
  333. "frms_in_order_cnt : %d\n"
  334. "bar_rcvd_cnt : %d\n"
  335. "mpdu_frms_cnt : %d\n"
  336. "msdu_frms_cnt : %d\n"
  337. "total_byte_cnt : %d\n"
  338. "late_recv_mpdu_cnt : %d\n"
  339. "win_jump_2k : %d\n"
  340. "hole_cnt : %d\n",
  341. queue_status->curr_mpdu_cnt, queue_status->curr_msdu_cnt,
  342. queue_status->fwd_timeout_cnt, queue_status->fwd_bar_cnt,
  343. queue_status->dup_cnt, queue_status->frms_in_order_cnt,
  344. queue_status->bar_rcvd_cnt, queue_status->mpdu_frms_cnt,
  345. queue_status->msdu_frms_cnt, queue_status->total_cnt,
  346. queue_status->late_recv_mpdu_cnt, queue_status->win_jump_2k,
  347. queue_status->hole_cnt);
  348. }
  349. static inline void dp_peer_find_add_id(struct dp_soc *soc,
  350. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  351. uint8_t vdev_id)
  352. {
  353. struct dp_peer *peer;
  354. QDF_ASSERT(peer_id <= wlan_cfg_max_peer_id(soc->wlan_cfg_ctx) + 1);
  355. /* check if there's already a peer object with this MAC address */
  356. #if ATH_SUPPORT_WRAP
  357. peer = dp_peer_find_hash_find(soc, peer_mac_addr,
  358. 0 /* is aligned */, vdev_id);
  359. #else
  360. peer = dp_peer_find_hash_find(soc, peer_mac_addr, 0 /* is aligned */);
  361. #endif
  362. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  363. "%s: peer %p ID %d vid %d mac %02x:%02x:%02x:%02x:%02x:%02x\n",
  364. __func__, peer, peer_id, vdev_id, peer_mac_addr[0],
  365. peer_mac_addr[1], peer_mac_addr[2], peer_mac_addr[3],
  366. peer_mac_addr[4], peer_mac_addr[5]);
  367. if (peer) {
  368. /* peer's ref count was already incremented by
  369. * peer_find_hash_find
  370. */
  371. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  372. "%s: ref_cnt: %d", __func__,
  373. qdf_atomic_read(&peer->ref_cnt));
  374. soc->peer_id_to_obj_map[peer_id] = peer;
  375. peer->self_ast_entry.ast_idx = hw_peer_id;
  376. soc->ast_table[hw_peer_id] = &peer->self_ast_entry;
  377. if (dp_peer_find_add_id_to_obj(peer, peer_id)) {
  378. /* TBDXXX: assert for now */
  379. QDF_ASSERT(0);
  380. }
  381. return;
  382. }
  383. }
  384. static inline void dp_peer_add_ast(struct dp_soc *soc,
  385. struct dp_peer *peer, uint8_t *peer_mac_addr, uint16_t hw_peer_id,
  386. uint8_t vdev_id)
  387. {
  388. struct dp_ast_entry *ast_entry;
  389. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  390. "%s: peer %p ID %d vid %d mac %02x:%02x:%02x:%02x:%02x:%02x\n",
  391. __func__, peer, hw_peer_id, vdev_id, peer_mac_addr[0],
  392. peer_mac_addr[1], peer_mac_addr[2], peer_mac_addr[3],
  393. peer_mac_addr[4], peer_mac_addr[5]);
  394. TAILQ_FOREACH(ast_entry, &peer->ast_entry_list, ast_entry_elem) {
  395. if (!(qdf_mem_cmp(peer_mac_addr, ast_entry->mac_addr,
  396. DP_MAC_ADDR_LEN))) {
  397. soc->ast_table[ast_entry->ast_idx] = NULL;
  398. ast_entry->ast_idx = hw_peer_id;
  399. soc->ast_table[hw_peer_id] = ast_entry;
  400. return;
  401. }
  402. }
  403. ast_entry = (struct dp_ast_entry *)
  404. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  405. if (!ast_entry) {
  406. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  407. FL("fail to allocate ast_entry for: %d"), hw_peer_id);
  408. QDF_ASSERT(0);
  409. }
  410. qdf_mem_copy(&ast_entry->mac_addr, peer_mac_addr, DP_MAC_ADDR_LEN);
  411. ast_entry->peer = peer;
  412. ast_entry->next_hop = 1;
  413. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ast_entry_elem);
  414. soc->ast_table[hw_peer_id] = ast_entry;
  415. return;
  416. }
  417. /**
  418. * dp_rx_peer_map_handler() - handle peer map event from firmware
  419. * @soc_handle - genereic soc handle
  420. * @peeri_id - peer_id from firmware
  421. * @hw_peer_id - ast index for this peer
  422. * vdev_id - vdev ID
  423. * peer_mac_addr - macc assress of the peer
  424. *
  425. * associate the peer_id that firmware provided with peer entry
  426. * and update the ast table in the host with the hw_peer_id.
  427. *
  428. * Return: none
  429. */
  430. void
  431. dp_rx_peer_map_handler(void *soc_handle, uint16_t peer_id, uint16_t hw_peer_id,
  432. uint8_t vdev_id, uint8_t *peer_mac_addr)
  433. {
  434. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  435. struct dp_peer *peer = NULL;
  436. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  437. "peer_map_event (soc:%p): peer_id %di, hw_peer_id %d, peer_mac "
  438. "%02x:%02x:%02x:%02x:%02x:%02x, vdev_id %d\n", soc, peer_id,
  439. hw_peer_id, peer_mac_addr[0], peer_mac_addr[1],
  440. peer_mac_addr[2], peer_mac_addr[3], peer_mac_addr[4],
  441. peer_mac_addr[5], vdev_id);
  442. peer = soc->peer_id_to_obj_map[peer_id];
  443. if ((hw_peer_id < 0) || (hw_peer_id > WLAN_UMAC_PSOC_MAX_PEERS)) {
  444. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  445. "invalid hw_peer_id: %d", hw_peer_id);
  446. QDF_ASSERT(0);
  447. }
  448. /*
  449. * check if peer already exists for this peer_id, if so
  450. * this peer map event is in response for a wds peer add
  451. * wmi command sent during wds source port learning.
  452. * in this case just add the ast entry to the existing
  453. * peer ast_list.
  454. */
  455. if (!peer) {
  456. dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  457. hw_peer_id, vdev_id);
  458. if (soc->cdp_soc.ol_ops->peer_map_event) {
  459. soc->cdp_soc.ol_ops->peer_map_event(soc->osif_soc,
  460. peer_id, hw_peer_id, vdev_id, peer_mac_addr);
  461. }
  462. } else {
  463. dp_peer_add_ast(soc, peer, peer_mac_addr,
  464. hw_peer_id, vdev_id);
  465. }
  466. }
  467. void
  468. dp_rx_peer_unmap_handler(void *soc_handle, uint16_t peer_id)
  469. {
  470. struct dp_peer *peer;
  471. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  472. uint8_t i;
  473. peer = dp_peer_find_by_id(soc, peer_id);
  474. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  475. "peer_unmap_event (soc:%p) peer_id %d peer %p\n",
  476. soc, peer_id, peer);
  477. /*
  478. * Currently peer IDs are assigned for vdevs as well as peers.
  479. * If the peer ID is for a vdev, then the peer pointer stored
  480. * in peer_id_to_obj_map will be NULL.
  481. */
  482. if (!peer)
  483. return;
  484. soc->peer_id_to_obj_map[peer_id] = NULL;
  485. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  486. if (peer->peer_ids[i] == peer_id) {
  487. peer->peer_ids[i] = HTT_INVALID_PEER;
  488. break;
  489. }
  490. }
  491. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  492. soc->cdp_soc.ol_ops->peer_unmap_event(soc->osif_soc,
  493. peer_id);
  494. }
  495. /*
  496. * Remove a reference to the peer.
  497. * If there are no more references, delete the peer object.
  498. */
  499. dp_peer_unref_delete(peer);
  500. }
  501. void
  502. dp_peer_find_detach(struct dp_soc *soc)
  503. {
  504. dp_peer_find_map_detach(soc);
  505. dp_peer_find_hash_detach(soc);
  506. }
  507. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  508. union hal_reo_status *reo_status)
  509. {
  510. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  511. if (reo_status->queue_status.header.status) {
  512. /* Should not happen normally. Just print error for now */
  513. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  514. "%s: Rx tid HW desc update failed(%d): tid %d\n",
  515. __func__,
  516. reo_status->rx_queue_status.header.status,
  517. rx_tid->tid);
  518. }
  519. }
  520. /*
  521. * dp_find_peer_by_addr - find peer instance by mac address
  522. * @dev: physical device instance
  523. * @peer_mac_addr: peer mac address
  524. * @local_id: local id for the peer
  525. *
  526. * Return: peer instance pointer
  527. */
  528. void *dp_find_peer_by_addr(struct cdp_pdev *dev, uint8_t *peer_mac_addr,
  529. uint8_t *local_id)
  530. {
  531. struct dp_pdev *pdev = (struct dp_pdev *)dev;
  532. struct dp_peer *peer;
  533. #if ATH_SUPPORT_WRAP
  534. peer = dp_peer_find_hash_find(pdev->soc, peer_mac_addr, 0, 0);
  535. /* WAR, VDEV ID? TEMP 0 */
  536. #else
  537. peer = dp_peer_find_hash_find(pdev->soc, peer_mac_addr, 0);
  538. #endif
  539. if (!peer)
  540. return NULL;
  541. /* Multiple peer ids? How can know peer id? */
  542. *local_id = peer->local_id;
  543. DP_TRACE(INFO, "%s: peer %p id %d", __func__, peer, *local_id);
  544. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  545. * Decrement it here.
  546. */
  547. qdf_atomic_dec(&peer->ref_cnt);
  548. return peer;
  549. }
  550. /*
  551. * dp_rx_tid_update_wifi3() – Update receive TID state
  552. * @peer: Datapath peer handle
  553. * @tid: TID
  554. * @ba_window_size: BlockAck window size
  555. * @start_seq: Starting sequence number
  556. *
  557. * Return: 0 on success, error code on failure
  558. */
  559. static int dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  560. ba_window_size, uint32_t start_seq)
  561. {
  562. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  563. struct dp_soc *soc = peer->vdev->pdev->soc;
  564. struct hal_reo_cmd_params params;
  565. qdf_mem_zero(&params, sizeof(params));
  566. params.std.need_status = 1;
  567. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  568. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  569. params.u.upd_queue_params.update_ba_window_size = 1;
  570. params.u.upd_queue_params.ba_window_size = ba_window_size;
  571. if (start_seq < IEEE80211_SEQ_MAX) {
  572. params.u.upd_queue_params.update_ssn = 1;
  573. params.u.upd_queue_params.ssn = start_seq;
  574. }
  575. dp_set_ssn_valid_flag(&params, 0);
  576. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params, dp_rx_tid_update_cb, rx_tid);
  577. return 0;
  578. }
  579. /*
  580. * dp_reo_desc_free() - Add reo descriptor to deferred freelist and free any
  581. * aged out descriptors
  582. *
  583. * @soc: DP SOC handle
  584. * @freedesc: REO descriptor to be freed
  585. */
  586. static void dp_reo_desc_free(struct dp_soc *soc,
  587. struct reo_desc_list_node *freedesc)
  588. {
  589. uint32_t list_size;
  590. struct reo_desc_list_node *desc;
  591. unsigned long curr_ts = qdf_get_system_timestamp();
  592. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  593. freedesc->free_ts = curr_ts;
  594. qdf_list_insert_back_size(&soc->reo_desc_freelist,
  595. (qdf_list_node_t *)freedesc, &list_size);
  596. while ((qdf_list_peek_front(&soc->reo_desc_freelist,
  597. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  598. ((list_size >= REO_DESC_FREELIST_SIZE) ||
  599. ((curr_ts - desc->free_ts) > REO_DESC_FREE_DEFER_MS))) {
  600. struct dp_rx_tid *rx_tid;
  601. qdf_list_remove_front(&soc->reo_desc_freelist,
  602. (qdf_list_node_t **)&desc);
  603. list_size--;
  604. rx_tid = &desc->rx_tid;
  605. qdf_mem_unmap_nbytes_single(soc->osdev,
  606. rx_tid->hw_qdesc_paddr,
  607. QDF_DMA_BIDIRECTIONAL,
  608. rx_tid->hw_qdesc_alloc_size);
  609. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  610. qdf_mem_free(desc);
  611. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  612. "%s: Freed: %p\n",
  613. __func__, desc);
  614. }
  615. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  616. }
  617. #if defined(QCA_WIFI_QCA8074) && defined(BUILD_X86)
  618. /* Hawkeye emulation requires bus address to be >= 0x50000000 */
  619. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  620. {
  621. if (dma_addr < 0x50000000)
  622. return QDF_STATUS_E_FAILURE;
  623. else
  624. return QDF_STATUS_SUCCESS;
  625. }
  626. #else
  627. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  628. {
  629. return QDF_STATUS_SUCCESS;
  630. }
  631. #endif
  632. /*
  633. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  634. * @peer: Datapath peer handle
  635. * @tid: TID
  636. * @ba_window_size: BlockAck window size
  637. * @start_seq: Starting sequence number
  638. *
  639. * Return: 0 on success, error code on failure
  640. */
  641. int dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  642. uint32_t ba_window_size, uint32_t start_seq)
  643. {
  644. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  645. struct dp_vdev *vdev = peer->vdev;
  646. struct dp_soc *soc = vdev->pdev->soc;
  647. uint32_t hw_qdesc_size;
  648. uint32_t hw_qdesc_align;
  649. int hal_pn_type;
  650. void *hw_qdesc_vaddr;
  651. uint32_t alloc_tries = 0;
  652. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL)
  653. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  654. start_seq);
  655. #ifdef notyet
  656. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc, ba_window_size);
  657. #else
  658. /* TODO: Allocating HW queue descriptors based on max BA window size
  659. * for all QOS TIDs so that same descriptor can be used later when
  660. * ADDBA request is recevied. This should be changed to allocate HW
  661. * queue descriptors based on BA window size being negotiated (0 for
  662. * non BA cases), and reallocate when BA window size changes and also
  663. * send WMI message to FW to change the REO queue descriptor in Rx
  664. * peer entry as part of dp_rx_tid_update.
  665. */
  666. if (tid != DP_NON_QOS_TID)
  667. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  668. HAL_RX_MAX_BA_WINDOW);
  669. else
  670. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  671. ba_window_size);
  672. #endif
  673. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  674. /* To avoid unnecessary extra allocation for alignment, try allocating
  675. * exact size and see if we already have aligned address.
  676. */
  677. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  678. try_desc_alloc:
  679. rx_tid->hw_qdesc_vaddr_unaligned =
  680. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size);
  681. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  682. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  683. "%s: Rx tid HW desc alloc failed: tid %d\n",
  684. __func__, tid);
  685. return QDF_STATUS_E_NOMEM;
  686. }
  687. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  688. hw_qdesc_align) {
  689. /* Address allocated above is not alinged. Allocate extra
  690. * memory for alignment
  691. */
  692. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  693. rx_tid->hw_qdesc_vaddr_unaligned =
  694. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size +
  695. hw_qdesc_align - 1);
  696. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  697. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  698. "%s: Rx tid HW desc alloc failed: tid %d\n",
  699. __func__, tid);
  700. return QDF_STATUS_E_NOMEM;
  701. }
  702. hw_qdesc_vaddr = (void *)qdf_align((unsigned long)
  703. rx_tid->hw_qdesc_vaddr_unaligned,
  704. hw_qdesc_align);
  705. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  706. "%s: Total Size %d Aligned Addr %p\n",
  707. __func__, rx_tid->hw_qdesc_alloc_size,
  708. hw_qdesc_vaddr);
  709. } else {
  710. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  711. }
  712. /* TODO: Ensure that sec_type is set before ADDBA is received.
  713. * Currently this is set based on htt indication
  714. * HTT_T2H_MSG_TYPE_SEC_IND from target
  715. */
  716. switch (peer->security[dp_sec_ucast].sec_type) {
  717. case cdp_sec_type_tkip_nomic:
  718. case cdp_sec_type_aes_ccmp:
  719. case cdp_sec_type_aes_ccmp_256:
  720. case cdp_sec_type_aes_gcmp:
  721. case cdp_sec_type_aes_gcmp_256:
  722. hal_pn_type = HAL_PN_WPA;
  723. break;
  724. case cdp_sec_type_wapi:
  725. if (vdev->opmode == wlan_op_mode_ap)
  726. hal_pn_type = HAL_PN_WAPI_EVEN;
  727. else
  728. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  729. break;
  730. default:
  731. hal_pn_type = HAL_PN_NONE;
  732. break;
  733. }
  734. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  735. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type);
  736. qdf_mem_map_nbytes_single(soc->osdev, hw_qdesc_vaddr,
  737. QDF_DMA_BIDIRECTIONAL, rx_tid->hw_qdesc_alloc_size,
  738. &(rx_tid->hw_qdesc_paddr));
  739. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) !=
  740. QDF_STATUS_SUCCESS) {
  741. if (alloc_tries++ < 10)
  742. goto try_desc_alloc;
  743. else {
  744. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  745. "%s: Rx tid HW desc alloc failed (lowmem): tid %d\n",
  746. __func__, tid);
  747. return QDF_STATUS_E_NOMEM;
  748. }
  749. }
  750. if (soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup) {
  751. soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup(
  752. vdev->pdev->osif_pdev,
  753. peer->vdev->vdev_id, peer->mac_addr.raw,
  754. rx_tid->hw_qdesc_paddr, tid, tid);
  755. }
  756. return 0;
  757. }
  758. /*
  759. * Rx TID deletion callback to free memory allocated for HW queue descriptor
  760. */
  761. static void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  762. union hal_reo_status *reo_status)
  763. {
  764. struct reo_desc_list_node *freedesc =
  765. (struct reo_desc_list_node *)cb_ctxt;
  766. if (reo_status->rx_queue_status.header.status) {
  767. /* Should not happen normally. Just print error for now */
  768. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  769. "%s: Rx tid HW desc deletion failed(%d): tid %d\n",
  770. __func__,
  771. reo_status->rx_queue_status.header.status,
  772. freedesc->rx_tid.tid);
  773. }
  774. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_INFO,
  775. "%s: rx_tid: %d status: %d\n", __func__,
  776. freedesc->rx_tid.tid,
  777. reo_status->rx_queue_status.header.status);
  778. dp_reo_desc_free(soc, freedesc);
  779. }
  780. /*
  781. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  782. * @peer: Datapath peer handle
  783. * @tid: TID
  784. *
  785. * Return: 0 on success, error code on failure
  786. */
  787. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  788. {
  789. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  790. struct dp_soc *soc = peer->vdev->pdev->soc;
  791. struct hal_reo_cmd_params params;
  792. struct reo_desc_list_node *freedesc =
  793. qdf_mem_malloc(sizeof(*freedesc));
  794. if (!freedesc) {
  795. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  796. "%s: malloc failed for freedesc: tid %d\n",
  797. __func__, tid);
  798. return -ENOMEM;
  799. }
  800. freedesc->rx_tid = *rx_tid;
  801. qdf_mem_zero(&params, sizeof(params));
  802. params.std.need_status = 0;
  803. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  804. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  805. params.u.upd_queue_params.update_vld = 1;
  806. params.u.upd_queue_params.vld = 0;
  807. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params, NULL, NULL);
  808. /* Flush and invalidate the REO descriptor from HW cache */
  809. qdf_mem_zero(&params, sizeof(params));
  810. params.std.need_status = 1;
  811. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  812. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  813. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, dp_rx_tid_delete_cb,
  814. (void *)freedesc);
  815. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  816. rx_tid->hw_qdesc_alloc_size = 0;
  817. rx_tid->hw_qdesc_paddr = 0;
  818. return 0;
  819. }
  820. #ifdef DP_LFR
  821. static void dp_peer_setup_remaining_tids(struct dp_peer *peer)
  822. {
  823. int tid;
  824. for (tid = 1; tid < DP_MAX_TIDS-1; tid++) {
  825. dp_rx_tid_setup_wifi3(peer, tid, 1, 0);
  826. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  827. "Setting up TID %d for peer %p peer->local_id %d\n",
  828. tid, peer, peer->local_id);
  829. }
  830. }
  831. #else
  832. static void dp_peer_setup_remaining_tids(struct dp_peer *peer) {};
  833. #endif
  834. /*
  835. * dp_peer_rx_init() – Initialize receive TID state
  836. * @pdev: Datapath pdev
  837. * @peer: Datapath peer
  838. *
  839. */
  840. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  841. {
  842. int tid;
  843. struct dp_rx_tid *rx_tid;
  844. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  845. rx_tid = &peer->rx_tid[tid];
  846. rx_tid->array = &rx_tid->base;
  847. rx_tid->base.head = rx_tid->base.tail = NULL;
  848. rx_tid->tid = tid;
  849. rx_tid->defrag_timeout_ms = 0;
  850. rx_tid->ba_win_size = 0;
  851. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  852. rx_tid->defrag_waitlist_elem.tqe_next = NULL;
  853. rx_tid->defrag_waitlist_elem.tqe_prev = NULL;
  854. #ifdef notyet /* TODO: See if this is required for exception handling */
  855. /* invalid sequence number */
  856. peer->tids_last_seq[tid] = 0xffff;
  857. #endif
  858. }
  859. /* Setup default (non-qos) rx tid queue */
  860. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  861. /* Setup rx tid queue for TID 0.
  862. * Other queues will be setup on receiving first packet, which will cause
  863. * NULL REO queue error
  864. */
  865. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  866. /*
  867. * Setup the rest of TID's to handle LFR
  868. */
  869. dp_peer_setup_remaining_tids(peer);
  870. /*
  871. * Set security defaults: no PN check, no security. The target may
  872. * send a HTT SEC_IND message to overwrite these defaults.
  873. */
  874. peer->security[dp_sec_ucast].sec_type =
  875. peer->security[dp_sec_mcast].sec_type = cdp_sec_type_none;
  876. }
  877. /*
  878. * dp_peer_rx_cleanup() – Cleanup receive TID state
  879. * @vdev: Datapath vdev
  880. * @peer: Datapath peer
  881. *
  882. */
  883. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  884. {
  885. int tid;
  886. uint32_t tid_delete_mask = 0;
  887. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  888. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned != NULL) {
  889. dp_rx_tid_delete_wifi3(peer, tid);
  890. tid_delete_mask |= (1 << tid);
  891. }
  892. }
  893. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  894. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  895. soc->ol_ops->peer_rx_reorder_queue_remove(vdev->pdev->osif_pdev,
  896. peer->vdev->vdev_id, peer->mac_addr.raw,
  897. tid_delete_mask);
  898. }
  899. #endif
  900. }
  901. /*
  902. * dp_peer_cleanup() – Cleanup peer information
  903. * @vdev: Datapath vdev
  904. * @peer: Datapath peer
  905. *
  906. */
  907. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  908. {
  909. peer->last_assoc_rcvd = 0;
  910. peer->last_disassoc_rcvd = 0;
  911. peer->last_deauth_rcvd = 0;
  912. /* cleanup the Rx reorder queues for this peer */
  913. dp_peer_rx_cleanup(vdev, peer);
  914. }
  915. /*
  916. * dp_rx_addba_requestprocess_wifi3() – Process ADDBA request from peer
  917. *
  918. * @peer: Datapath peer handle
  919. * @dialogtoken: dialogtoken from ADDBA frame
  920. * @tid: TID number
  921. * @startseqnum: Start seq. number received in BA sequence control
  922. * in ADDBA frame
  923. *
  924. * Return: 0 on success, error code on failure
  925. */
  926. int dp_addba_requestprocess_wifi3(void *peer_handle,
  927. uint8_t dialogtoken, uint16_t tid, uint16_t batimeout,
  928. uint16_t buffersize, uint16_t startseqnum)
  929. {
  930. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  931. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  932. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE) &&
  933. (rx_tid->hw_qdesc_vaddr_unaligned != NULL))
  934. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  935. if (dp_rx_tid_setup_wifi3(peer, tid, buffersize,
  936. startseqnum)) {
  937. /* TODO: Should we send addba reject in this case */
  938. return QDF_STATUS_E_FAILURE;
  939. }
  940. rx_tid->ba_win_size = buffersize;
  941. rx_tid->dialogtoken = dialogtoken;
  942. rx_tid->statuscode = QDF_STATUS_SUCCESS;
  943. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  944. return 0;
  945. }
  946. /*
  947. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  948. *
  949. * @peer: Datapath peer handle
  950. * @tid: TID number
  951. * @dialogtoken: output dialogtoken
  952. * @statuscode: output dialogtoken
  953. * @buffersize: Ouput BA window sizze
  954. * @batimeout: Ouput BA timeout
  955. */
  956. void dp_addba_responsesetup_wifi3(void *peer_handle, uint8_t tid,
  957. uint8_t *dialogtoken, uint16_t *statuscode,
  958. uint16_t *buffersize, uint16_t *batimeout)
  959. {
  960. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  961. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  962. /* setup ADDBA response paramters */
  963. *dialogtoken = rx_tid->dialogtoken;
  964. *statuscode = rx_tid->statuscode;
  965. *buffersize = rx_tid->ba_win_size;
  966. *batimeout = 0;
  967. }
  968. /*
  969. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  970. * @peer: Datapath peer handle
  971. * @tid: TID number
  972. * @reasoncode: Reason code received in DELBA frame
  973. *
  974. * Return: 0 on success, error code on failure
  975. */
  976. int dp_delba_process_wifi3(void *peer_handle,
  977. int tid, uint16_t reasoncode)
  978. {
  979. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  980. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  981. if (rx_tid->ba_status != DP_RX_BA_ACTIVE)
  982. return QDF_STATUS_E_FAILURE;
  983. /* TODO: See if we can delete the existing REO queue descriptor and
  984. * replace with a new one without queue extenstion descript to save
  985. * memory
  986. */
  987. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  988. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  989. return 0;
  990. }
  991. void dp_rx_discard(struct dp_vdev *vdev, struct dp_peer *peer, unsigned tid,
  992. qdf_nbuf_t msdu_list)
  993. {
  994. while (msdu_list) {
  995. qdf_nbuf_t msdu = msdu_list;
  996. msdu_list = qdf_nbuf_next(msdu_list);
  997. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  998. "discard rx %p from partly-deleted peer %p "
  999. "(%02x:%02x:%02x:%02x:%02x:%02x)\n",
  1000. msdu, peer,
  1001. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  1002. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  1003. peer->mac_addr.raw[4], peer->mac_addr.raw[5]);
  1004. qdf_nbuf_free(msdu);
  1005. }
  1006. }
  1007. /**
  1008. * dp_set_pn_check_wifi3() - enable PN check in REO for security
  1009. * @peer: Datapath peer handle
  1010. * @vdev: Datapath vdev
  1011. * @pdev - data path device instance
  1012. * @sec_type - security type
  1013. * @rx_pn - Receive pn starting number
  1014. *
  1015. */
  1016. void
  1017. dp_set_pn_check_wifi3(struct cdp_vdev *vdev_handle, struct cdp_peer *peer_handle, enum cdp_sec_type sec_type, uint32_t *rx_pn)
  1018. {
  1019. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1020. struct dp_vdev *vdev = (struct dp_vdev *)vdev_handle;
  1021. struct dp_pdev *pdev;
  1022. struct dp_soc *soc;
  1023. int i;
  1024. struct hal_reo_cmd_params params;
  1025. /* preconditions */
  1026. qdf_assert(vdev);
  1027. pdev = vdev->pdev;
  1028. soc = pdev->soc;
  1029. qdf_mem_zero(&params, sizeof(params));
  1030. params.std.need_status = 1;
  1031. params.u.upd_queue_params.update_pn_valid = 1;
  1032. params.u.upd_queue_params.update_pn_size = 1;
  1033. params.u.upd_queue_params.update_pn = 1;
  1034. params.u.upd_queue_params.update_pn_check_needed = 1;
  1035. peer->security[dp_sec_ucast].sec_type = sec_type;
  1036. switch (sec_type) {
  1037. case cdp_sec_type_tkip_nomic:
  1038. case cdp_sec_type_aes_ccmp:
  1039. case cdp_sec_type_aes_ccmp_256:
  1040. case cdp_sec_type_aes_gcmp:
  1041. case cdp_sec_type_aes_gcmp_256:
  1042. params.u.upd_queue_params.pn_check_needed = 1;
  1043. params.u.upd_queue_params.pn_size = 48;
  1044. break;
  1045. case cdp_sec_type_wapi:
  1046. params.u.upd_queue_params.pn_check_needed = 1;
  1047. params.u.upd_queue_params.pn_size = 128;
  1048. if (vdev->opmode == wlan_op_mode_ap) {
  1049. params.u.upd_queue_params.pn_even = 1;
  1050. params.u.upd_queue_params.update_pn_even = 1;
  1051. } else {
  1052. params.u.upd_queue_params.pn_uneven = 1;
  1053. params.u.upd_queue_params.update_pn_uneven = 1;
  1054. }
  1055. break;
  1056. default:
  1057. params.u.upd_queue_params.pn_check_needed = 0;
  1058. break;
  1059. }
  1060. for (i = 0; i < DP_MAX_TIDS; i++) {
  1061. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  1062. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL) {
  1063. params.std.addr_lo =
  1064. rx_tid->hw_qdesc_paddr & 0xffffffff;
  1065. params.std.addr_hi =
  1066. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1067. if (sec_type != cdp_sec_type_wapi) {
  1068. params.u.upd_queue_params.update_pn_valid = 0;
  1069. } else {
  1070. /*
  1071. * Setting PN valid bit for WAPI sec_type,
  1072. * since WAPI PN has to be started with
  1073. * predefined value
  1074. */
  1075. params.u.upd_queue_params.update_pn_valid = 1;
  1076. params.u.upd_queue_params.pn_31_0 = rx_pn[0];
  1077. params.u.upd_queue_params.pn_63_32 = rx_pn[1];
  1078. params.u.upd_queue_params.pn_95_64 = rx_pn[2];
  1079. params.u.upd_queue_params.pn_127_96 = rx_pn[3];
  1080. }
  1081. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  1082. dp_rx_tid_update_cb, rx_tid);
  1083. } else {
  1084. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  1085. "PN Check not setup for TID :%d \n", i);
  1086. }
  1087. }
  1088. }
  1089. void
  1090. dp_rx_sec_ind_handler(void *soc_handle, uint16_t peer_id,
  1091. enum htt_sec_type sec_type, int is_unicast, u_int32_t *michael_key,
  1092. u_int32_t *rx_pn)
  1093. {
  1094. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  1095. struct dp_peer *peer;
  1096. int sec_index;
  1097. peer = dp_peer_find_by_id(soc, peer_id);
  1098. if (!peer) {
  1099. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1100. "Couldn't find peer from ID %d - skipping security inits\n",
  1101. peer_id);
  1102. return;
  1103. }
  1104. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  1105. "sec spec for peer %p (%02x:%02x:%02x:%02x:%02x:%02x): "
  1106. "%s key of type %d\n",
  1107. peer,
  1108. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  1109. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  1110. peer->mac_addr.raw[4], peer->mac_addr.raw[5],
  1111. is_unicast ? "ucast" : "mcast",
  1112. sec_type);
  1113. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  1114. peer->security[sec_index].sec_type = sec_type;
  1115. #ifdef notyet /* TODO: See if this is required for defrag support */
  1116. /* michael key only valid for TKIP, but for simplicity,
  1117. * copy it anyway
  1118. */
  1119. qdf_mem_copy(
  1120. &peer->security[sec_index].michael_key[0],
  1121. michael_key,
  1122. sizeof(peer->security[sec_index].michael_key));
  1123. #ifdef BIG_ENDIAN_HOST
  1124. OL_IF_SWAPBO(peer->security[sec_index].michael_key[0],
  1125. sizeof(peer->security[sec_index].michael_key));
  1126. #endif /* BIG_ENDIAN_HOST */
  1127. #endif
  1128. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  1129. if (sec_type != htt_sec_type_wapi) {
  1130. qdf_mem_set(peer->tids_last_pn_valid, _EXT_TIDS, 0x00);
  1131. } else {
  1132. for (i = 0; i < DP_MAX_TIDS; i++) {
  1133. /*
  1134. * Setting PN valid bit for WAPI sec_type,
  1135. * since WAPI PN has to be started with predefined value
  1136. */
  1137. peer->tids_last_pn_valid[i] = 1;
  1138. qdf_mem_copy(
  1139. (u_int8_t *) &peer->tids_last_pn[i],
  1140. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  1141. peer->tids_last_pn[i].pn128[1] =
  1142. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  1143. peer->tids_last_pn[i].pn128[0] =
  1144. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  1145. }
  1146. }
  1147. #endif
  1148. /* TODO: Update HW TID queue with PN check parameters (pn type for
  1149. * all security types and last pn for WAPI) once REO command API
  1150. * is available
  1151. */
  1152. }
  1153. #ifndef CONFIG_WIN
  1154. /**
  1155. * dp_register_peer() - Register peer into physical device
  1156. * @pdev - data path device instance
  1157. * @sta_desc - peer description
  1158. *
  1159. * Register peer into physical device
  1160. *
  1161. * Return: QDF_STATUS_SUCCESS registration success
  1162. * QDF_STATUS_E_FAULT peer not found
  1163. */
  1164. QDF_STATUS dp_register_peer(struct cdp_pdev *pdev_handle,
  1165. struct ol_txrx_desc_type *sta_desc)
  1166. {
  1167. struct dp_peer *peer;
  1168. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  1169. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev,
  1170. sta_desc->sta_id);
  1171. if (!peer)
  1172. return QDF_STATUS_E_FAULT;
  1173. qdf_spin_lock_bh(&peer->peer_info_lock);
  1174. peer->state = OL_TXRX_PEER_STATE_CONN;
  1175. qdf_spin_unlock_bh(&peer->peer_info_lock);
  1176. return QDF_STATUS_SUCCESS;
  1177. }
  1178. /**
  1179. * dp_clear_peer() - remove peer from physical device
  1180. * @pdev - data path device instance
  1181. * @sta_id - local peer id
  1182. *
  1183. * remove peer from physical device
  1184. *
  1185. * Return: QDF_STATUS_SUCCESS registration success
  1186. * QDF_STATUS_E_FAULT peer not found
  1187. */
  1188. QDF_STATUS dp_clear_peer(struct cdp_pdev *pdev_handle, uint8_t local_id)
  1189. {
  1190. struct dp_peer *peer;
  1191. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  1192. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev, local_id);
  1193. if (!peer)
  1194. return QDF_STATUS_E_FAULT;
  1195. qdf_spin_lock_bh(&peer->peer_info_lock);
  1196. peer->state = OL_TXRX_PEER_STATE_DISC;
  1197. qdf_spin_unlock_bh(&peer->peer_info_lock);
  1198. return QDF_STATUS_SUCCESS;
  1199. }
  1200. /**
  1201. * dp_find_peer_by_addr_and_vdev() - Find peer by peer mac address within vdev
  1202. * @pdev - data path device instance
  1203. * @vdev - virtual interface instance
  1204. * @peer_addr - peer mac address
  1205. * @peer_id - local peer id with target mac address
  1206. *
  1207. * Find peer by peer mac address within vdev
  1208. *
  1209. * Return: peer instance void pointer
  1210. * NULL cannot find target peer
  1211. */
  1212. void *dp_find_peer_by_addr_and_vdev(struct cdp_pdev *pdev_handle,
  1213. struct cdp_vdev *vdev_handle,
  1214. uint8_t *peer_addr, uint8_t *local_id)
  1215. {
  1216. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  1217. struct dp_vdev *vdev = (struct dp_vdev *)vdev_handle;
  1218. struct dp_peer *peer;
  1219. DP_TRACE(INFO, "vdev %p peer_addr %p", vdev, peer_addr);
  1220. peer = dp_peer_find_hash_find(pdev->soc, peer_addr, 0);
  1221. DP_TRACE(INFO, "peer %p vdev %p", peer, vdev);
  1222. if (!peer)
  1223. return NULL;
  1224. if (peer->vdev != vdev)
  1225. return NULL;
  1226. *local_id = peer->local_id;
  1227. DP_TRACE(INFO, "peer %p vdev %p lcoal id %d", peer, vdev, *local_id);
  1228. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  1229. * Decrement it here.
  1230. */
  1231. qdf_atomic_dec(&peer->ref_cnt);
  1232. return peer;
  1233. }
  1234. /**
  1235. * dp_local_peer_id() - Find local peer id within peer instance
  1236. * @peer - peer instance
  1237. *
  1238. * Find local peer id within peer instance
  1239. *
  1240. * Return: local peer id
  1241. */
  1242. uint16_t dp_local_peer_id(void *peer)
  1243. {
  1244. return ((struct dp_peer *)peer)->local_id;
  1245. }
  1246. /**
  1247. * dp_peer_find_by_local_id() - Find peer by local peer id
  1248. * @pdev - data path device instance
  1249. * @local_peer_id - local peer id want to find
  1250. *
  1251. * Find peer by local peer id within physical device
  1252. *
  1253. * Return: peer instance void pointer
  1254. * NULL cannot find target peer
  1255. */
  1256. void *dp_peer_find_by_local_id(struct cdp_pdev *pdev_handle, uint8_t local_id)
  1257. {
  1258. struct dp_peer *peer;
  1259. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  1260. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  1261. peer = pdev->local_peer_ids.map[local_id];
  1262. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  1263. DP_TRACE(INFO, "peer %p lcoal id %d",
  1264. peer, local_id);
  1265. return peer;
  1266. }
  1267. /**
  1268. * dp_peer_state_update() - update peer local state
  1269. * @pdev - data path device instance
  1270. * @peer_addr - peer mac address
  1271. * @state - new peer local state
  1272. *
  1273. * update peer local state
  1274. *
  1275. * Return: QDF_STATUS_SUCCESS registration success
  1276. */
  1277. QDF_STATUS dp_peer_state_update(struct cdp_pdev *pdev_handle, uint8_t *peer_mac,
  1278. enum ol_txrx_peer_state state)
  1279. {
  1280. struct dp_peer *peer;
  1281. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  1282. peer = dp_peer_find_hash_find(pdev->soc, peer_mac, 0);
  1283. if (NULL == peer) {
  1284. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1285. "Failed to find peer for: [%pM]", peer_mac);
  1286. return QDF_STATUS_E_FAILURE;
  1287. }
  1288. peer->state = state;
  1289. DP_TRACE(INFO, "peer %p state %d", peer, peer->state);
  1290. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  1291. * Decrement it here.
  1292. */
  1293. qdf_atomic_dec(&peer->ref_cnt);
  1294. return QDF_STATUS_SUCCESS;
  1295. }
  1296. /**
  1297. * dp_get_vdevid() - Get virtaul interface id which peer registered
  1298. * @peer - peer instance
  1299. * @vdev_id - virtaul interface id which peer registered
  1300. *
  1301. * Get virtaul interface id which peer registered
  1302. *
  1303. * Return: QDF_STATUS_SUCCESS registration success
  1304. */
  1305. QDF_STATUS dp_get_vdevid(void *peer_handle, uint8_t *vdev_id)
  1306. {
  1307. struct dp_peer *peer = peer_handle;
  1308. DP_TRACE(INFO, "peer %p vdev %p vdev id %d",
  1309. peer, peer->vdev, peer->vdev->vdev_id);
  1310. *vdev_id = peer->vdev->vdev_id;
  1311. return QDF_STATUS_SUCCESS;
  1312. }
  1313. /**
  1314. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  1315. * @peer - peer instance
  1316. *
  1317. * Get virtual interface instance which peer belongs
  1318. *
  1319. * Return: virtual interface instance pointer
  1320. * NULL in case cannot find
  1321. */
  1322. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  1323. {
  1324. struct dp_peer *peer = peer_handle;
  1325. DP_TRACE(INFO, "peer %p vdev %p", peer, peer->vdev);
  1326. return (struct cdp_vdev *)peer->vdev;
  1327. }
  1328. /**
  1329. * dp_peer_get_peer_mac_addr() - Get peer mac address
  1330. * @peer - peer instance
  1331. *
  1332. * Get peer mac address
  1333. *
  1334. * Return: peer mac address pointer
  1335. * NULL in case cannot find
  1336. */
  1337. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  1338. {
  1339. struct dp_peer *peer = peer_handle;
  1340. uint8_t *mac;
  1341. mac = peer->mac_addr.raw;
  1342. DP_TRACE(INFO, "peer %p mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  1343. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  1344. return peer->mac_addr.raw;
  1345. }
  1346. /**
  1347. * dp_get_peer_state() - Get local peer state
  1348. * @peer - peer instance
  1349. *
  1350. * Get local peer state
  1351. *
  1352. * Return: peer status
  1353. */
  1354. int dp_get_peer_state(void *peer_handle)
  1355. {
  1356. struct dp_peer *peer = peer_handle;
  1357. DP_TRACE(INFO, "peer %p stats %d", peer, peer->state);
  1358. return peer->state;
  1359. }
  1360. /**
  1361. * dp_get_last_assoc_received() - get time of last assoc received
  1362. * @peer_handle: peer handle
  1363. *
  1364. * Return: pointer for the time of last assoc received
  1365. */
  1366. qdf_time_t *dp_get_last_assoc_received(void *peer_handle)
  1367. {
  1368. struct dp_peer *peer = peer_handle;
  1369. DP_TRACE(INFO, "peer %p last_assoc_rcvd: %lu", peer,
  1370. peer->last_assoc_rcvd);
  1371. return &peer->last_assoc_rcvd;
  1372. }
  1373. /**
  1374. * dp_get_last_disassoc_received() - get time of last disassoc received
  1375. * @peer_handle: peer handle
  1376. *
  1377. * Return: pointer for the time of last disassoc received
  1378. */
  1379. qdf_time_t *dp_get_last_disassoc_received(void *peer_handle)
  1380. {
  1381. struct dp_peer *peer = peer_handle;
  1382. DP_TRACE(INFO, "peer %p last_disassoc_rcvd: %lu", peer,
  1383. peer->last_disassoc_rcvd);
  1384. return &peer->last_disassoc_rcvd;
  1385. }
  1386. /**
  1387. * dp_get_last_deauth_received() - get time of last deauth received
  1388. * @peer_handle: peer handle
  1389. *
  1390. * Return: pointer for the time of last deauth received
  1391. */
  1392. qdf_time_t *dp_get_last_deauth_received(void *peer_handle)
  1393. {
  1394. struct dp_peer *peer = peer_handle;
  1395. DP_TRACE(INFO, "peer %p last_deauth_rcvd: %lu", peer,
  1396. peer->last_deauth_rcvd);
  1397. return &peer->last_deauth_rcvd;
  1398. }
  1399. /**
  1400. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  1401. * @pdev - data path device instance
  1402. *
  1403. * local peer id pool alloc for physical device
  1404. *
  1405. * Return: none
  1406. */
  1407. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  1408. {
  1409. int i;
  1410. /* point the freelist to the first ID */
  1411. pdev->local_peer_ids.freelist = 0;
  1412. /* link each ID to the next one */
  1413. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  1414. pdev->local_peer_ids.pool[i] = i + 1;
  1415. pdev->local_peer_ids.map[i] = NULL;
  1416. }
  1417. /* link the last ID to itself, to mark the end of the list */
  1418. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  1419. pdev->local_peer_ids.pool[i] = i;
  1420. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  1421. DP_TRACE(INFO, "Peer pool init");
  1422. }
  1423. /**
  1424. * dp_local_peer_id_alloc() - allocate local peer id
  1425. * @pdev - data path device instance
  1426. * @peer - new peer instance
  1427. *
  1428. * allocate local peer id
  1429. *
  1430. * Return: none
  1431. */
  1432. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  1433. {
  1434. int i;
  1435. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  1436. i = pdev->local_peer_ids.freelist;
  1437. if (pdev->local_peer_ids.pool[i] == i) {
  1438. /* the list is empty, except for the list-end marker */
  1439. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  1440. } else {
  1441. /* take the head ID and advance the freelist */
  1442. peer->local_id = i;
  1443. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  1444. pdev->local_peer_ids.map[i] = peer;
  1445. }
  1446. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  1447. DP_TRACE(INFO, "peer %p, local id %d", peer, peer->local_id);
  1448. }
  1449. /**
  1450. * dp_local_peer_id_free() - remove local peer id
  1451. * @pdev - data path device instance
  1452. * @peer - peer instance should be removed
  1453. *
  1454. * remove local peer id
  1455. *
  1456. * Return: none
  1457. */
  1458. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  1459. {
  1460. int i = peer->local_id;
  1461. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  1462. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  1463. return;
  1464. }
  1465. /* put this ID on the head of the freelist */
  1466. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  1467. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  1468. pdev->local_peer_ids.freelist = i;
  1469. pdev->local_peer_ids.map[i] = NULL;
  1470. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  1471. }
  1472. #endif
  1473. /**
  1474. * dp_get_peer_mac_addr_frm_id(): get mac address of the peer
  1475. * @soc_handle: DP SOC handle
  1476. * @peer_id:peer_id of the peer
  1477. *
  1478. * return: vdev_id of the vap
  1479. */
  1480. uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle,
  1481. uint16_t peer_id, uint8_t *peer_mac)
  1482. {
  1483. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  1484. struct dp_peer *peer;
  1485. peer = dp_peer_find_by_id(soc, peer_id);
  1486. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1487. "soc %p peer_id %d", soc, peer_id);
  1488. if (!peer) {
  1489. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1490. "peer not found ");
  1491. return CDP_INVALID_VDEV_ID;
  1492. }
  1493. qdf_mem_copy(peer_mac, peer->mac_addr.raw, 6);
  1494. return peer->vdev->vdev_id;
  1495. }
  1496. /**
  1497. * dp_peer_rxtid_stats: Retried Rx TID (REO queue) stats from HW
  1498. * @peer: DP peer handle
  1499. *
  1500. * Return: 0 on success, error code on failure
  1501. */
  1502. int dp_peer_rxtid_stats(struct dp_peer *peer)
  1503. {
  1504. struct dp_soc *soc = peer->vdev->pdev->soc;
  1505. struct hal_reo_cmd_params params;
  1506. int i;
  1507. qdf_mem_zero(&params, sizeof(params));
  1508. for (i = 0; i < DP_MAX_TIDS; i++) {
  1509. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  1510. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL) {
  1511. params.std.need_status = 1;
  1512. params.std.addr_lo =
  1513. rx_tid->hw_qdesc_paddr & 0xffffffff;
  1514. params.std.addr_hi =
  1515. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1516. dp_reo_send_cmd(soc, CMD_GET_QUEUE_STATS, &params,
  1517. dp_rx_tid_stats_cb, rx_tid);
  1518. /* Flush REO descriptor from HW cache to update stats
  1519. * in descriptor memory. This is to help debugging */
  1520. qdf_mem_zero(&params, sizeof(params));
  1521. params.std.need_status = 0;
  1522. params.std.addr_lo =
  1523. rx_tid->hw_qdesc_paddr & 0xffffffff;
  1524. params.std.addr_hi =
  1525. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1526. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  1527. NULL);
  1528. }
  1529. }
  1530. return 0;
  1531. }