dp_peer.c 42 KB

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