dp_peer.c 77 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852
  1. /*
  2. * Copyright (c) 2016-2018 The Linux Foundation. All rights reserved.
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for
  5. * any purpose with or without fee is hereby granted, provided that the
  6. * above copyright notice and this permission notice appear in all
  7. * copies.
  8. *
  9. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
  10. * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
  11. * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
  12. * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  13. * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  14. * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
  15. * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  16. * PERFORMANCE OF THIS SOFTWARE.
  17. */
  18. #include <qdf_types.h>
  19. #include <qdf_lock.h>
  20. #include <hal_hw_headers.h>
  21. #include "dp_htt.h"
  22. #include "dp_types.h"
  23. #include "dp_internal.h"
  24. #include "dp_peer.h"
  25. #include "dp_rx_defrag.h"
  26. #include <hal_api.h>
  27. #include <hal_reo.h>
  28. #ifdef CONFIG_MCL
  29. #include <cds_ieee80211_common.h>
  30. #include <cds_api.h>
  31. #endif
  32. #include <cdp_txrx_handle.h>
  33. #include <wlan_cfg.h>
  34. #ifdef DP_LFR
  35. static inline void
  36. dp_set_ssn_valid_flag(struct hal_reo_cmd_params *params,
  37. uint8_t valid)
  38. {
  39. params->u.upd_queue_params.update_svld = 1;
  40. params->u.upd_queue_params.svld = valid;
  41. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  42. "%s: Setting SSN valid bit to %d",
  43. __func__, valid);
  44. }
  45. #else
  46. static inline void
  47. dp_set_ssn_valid_flag(struct hal_reo_cmd_params *params,
  48. uint8_t valid) {};
  49. #endif
  50. static inline int dp_peer_find_mac_addr_cmp(
  51. union dp_align_mac_addr *mac_addr1,
  52. union dp_align_mac_addr *mac_addr2)
  53. {
  54. return !((mac_addr1->align4.bytes_abcd == mac_addr2->align4.bytes_abcd)
  55. /*
  56. * Intentionally use & rather than &&.
  57. * because the operands are binary rather than generic boolean,
  58. * the functionality is equivalent.
  59. * Using && has the advantage of short-circuited evaluation,
  60. * but using & has the advantage of no conditional branching,
  61. * which is a more significant benefit.
  62. */
  63. &
  64. (mac_addr1->align4.bytes_ef == mac_addr2->align4.bytes_ef));
  65. }
  66. static int dp_peer_find_map_attach(struct dp_soc *soc)
  67. {
  68. uint32_t max_peers, peer_map_size;
  69. max_peers = soc->max_peers;
  70. /* allocate the peer ID -> peer object map */
  71. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO,
  72. "\n<=== cfg max peer id %d ====>", max_peers);
  73. peer_map_size = max_peers * sizeof(soc->peer_id_to_obj_map[0]);
  74. soc->peer_id_to_obj_map = qdf_mem_malloc(peer_map_size);
  75. if (!soc->peer_id_to_obj_map) {
  76. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  77. "%s: peer map memory allocation failed", __func__);
  78. return QDF_STATUS_E_NOMEM;
  79. }
  80. /*
  81. * The peer_id_to_obj_map doesn't really need to be initialized,
  82. * since elements are only used after they have been individually
  83. * initialized.
  84. * However, it is convenient for debugging to have all elements
  85. * that are not in use set to 0.
  86. */
  87. qdf_mem_zero(soc->peer_id_to_obj_map, peer_map_size);
  88. return 0; /* success */
  89. }
  90. static int dp_log2_ceil(unsigned value)
  91. {
  92. unsigned tmp = value;
  93. int log2 = -1;
  94. while (tmp) {
  95. log2++;
  96. tmp >>= 1;
  97. }
  98. if (1 << log2 != value)
  99. log2++;
  100. return log2;
  101. }
  102. static int dp_peer_find_add_id_to_obj(
  103. struct dp_peer *peer,
  104. uint16_t peer_id)
  105. {
  106. int i;
  107. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  108. if (peer->peer_ids[i] == HTT_INVALID_PEER) {
  109. peer->peer_ids[i] = peer_id;
  110. return 0; /* success */
  111. }
  112. }
  113. return QDF_STATUS_E_FAILURE; /* failure */
  114. }
  115. #define DP_PEER_HASH_LOAD_MULT 2
  116. #define DP_PEER_HASH_LOAD_SHIFT 0
  117. #define DP_AST_HASH_LOAD_MULT 2
  118. #define DP_AST_HASH_LOAD_SHIFT 0
  119. static int dp_peer_find_hash_attach(struct dp_soc *soc)
  120. {
  121. int i, hash_elems, log2;
  122. /* allocate the peer MAC address -> peer object hash table */
  123. hash_elems = soc->max_peers;
  124. hash_elems *= DP_PEER_HASH_LOAD_MULT;
  125. hash_elems >>= DP_PEER_HASH_LOAD_SHIFT;
  126. log2 = dp_log2_ceil(hash_elems);
  127. hash_elems = 1 << log2;
  128. soc->peer_hash.mask = hash_elems - 1;
  129. soc->peer_hash.idx_bits = log2;
  130. /* allocate an array of TAILQ peer object lists */
  131. soc->peer_hash.bins = qdf_mem_malloc(
  132. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q, dp_peer)));
  133. if (!soc->peer_hash.bins)
  134. return QDF_STATUS_E_NOMEM;
  135. for (i = 0; i < hash_elems; i++)
  136. TAILQ_INIT(&soc->peer_hash.bins[i]);
  137. return 0;
  138. }
  139. static void dp_peer_find_hash_detach(struct dp_soc *soc)
  140. {
  141. qdf_mem_free(soc->peer_hash.bins);
  142. }
  143. static inline unsigned dp_peer_find_hash_index(struct dp_soc *soc,
  144. union dp_align_mac_addr *mac_addr)
  145. {
  146. unsigned index;
  147. index =
  148. mac_addr->align2.bytes_ab ^
  149. mac_addr->align2.bytes_cd ^
  150. mac_addr->align2.bytes_ef;
  151. index ^= index >> soc->peer_hash.idx_bits;
  152. index &= soc->peer_hash.mask;
  153. return index;
  154. }
  155. void dp_peer_find_hash_add(struct dp_soc *soc, struct dp_peer *peer)
  156. {
  157. unsigned index;
  158. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  159. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  160. /*
  161. * It is important to add the new peer at the tail of the peer list
  162. * with the bin index. Together with having the hash_find function
  163. * search from head to tail, this ensures that if two entries with
  164. * the same MAC address are stored, the one added first will be
  165. * found first.
  166. */
  167. TAILQ_INSERT_TAIL(&soc->peer_hash.bins[index], peer, hash_list_elem);
  168. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  169. }
  170. #ifdef FEATURE_AST
  171. /*
  172. * dp_peer_ast_hash_attach() - Allocate and initialize AST Hash Table
  173. * @soc: SoC handle
  174. *
  175. * Return: None
  176. */
  177. static int dp_peer_ast_hash_attach(struct dp_soc *soc)
  178. {
  179. int i, hash_elems, log2;
  180. hash_elems = ((soc->max_peers * DP_AST_HASH_LOAD_MULT) >>
  181. DP_AST_HASH_LOAD_SHIFT);
  182. log2 = dp_log2_ceil(hash_elems);
  183. hash_elems = 1 << log2;
  184. soc->ast_hash.mask = hash_elems - 1;
  185. soc->ast_hash.idx_bits = log2;
  186. /* allocate an array of TAILQ peer object lists */
  187. soc->ast_hash.bins = qdf_mem_malloc(
  188. hash_elems * sizeof(TAILQ_HEAD(anonymous_tail_q,
  189. dp_ast_entry)));
  190. if (!soc->ast_hash.bins)
  191. return QDF_STATUS_E_NOMEM;
  192. for (i = 0; i < hash_elems; i++)
  193. TAILQ_INIT(&soc->ast_hash.bins[i]);
  194. return 0;
  195. }
  196. #if defined(FEATURE_AST) && defined(AST_HKV1_WORKAROUND)
  197. static inline void dp_peer_ast_cleanup(struct dp_soc *soc,
  198. struct dp_ast_entry *ast)
  199. {
  200. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  201. if (ast->cp_ctx && cdp_soc->ol_ops->peer_del_wds_cp_ctx)
  202. cdp_soc->ol_ops->peer_del_wds_cp_ctx(ast->cp_ctx);
  203. }
  204. #else
  205. static inline void dp_peer_ast_cleanup(struct dp_soc *soc,
  206. struct dp_ast_entry *ast)
  207. {
  208. }
  209. #endif
  210. /*
  211. * dp_peer_ast_hash_detach() - Free AST Hash table
  212. * @soc: SoC handle
  213. *
  214. * Return: None
  215. */
  216. static void dp_peer_ast_hash_detach(struct dp_soc *soc)
  217. {
  218. unsigned int index;
  219. struct dp_ast_entry *ast, *ast_next;
  220. if (!soc->ast_hash.mask)
  221. return;
  222. for (index = 0; index <= soc->ast_hash.mask; index++) {
  223. if (!TAILQ_EMPTY(&soc->ast_hash.bins[index])) {
  224. TAILQ_FOREACH_SAFE(ast, &soc->ast_hash.bins[index],
  225. hash_list_elem, ast_next) {
  226. TAILQ_REMOVE(&soc->ast_hash.bins[index], ast,
  227. hash_list_elem);
  228. dp_peer_ast_cleanup(soc, ast);
  229. qdf_mem_free(ast);
  230. }
  231. }
  232. }
  233. qdf_mem_free(soc->ast_hash.bins);
  234. }
  235. /*
  236. * dp_peer_ast_hash_index() - Compute the AST hash from MAC address
  237. * @soc: SoC handle
  238. *
  239. * Return: AST hash
  240. */
  241. static inline uint32_t dp_peer_ast_hash_index(struct dp_soc *soc,
  242. union dp_align_mac_addr *mac_addr)
  243. {
  244. uint32_t index;
  245. index =
  246. mac_addr->align2.bytes_ab ^
  247. mac_addr->align2.bytes_cd ^
  248. mac_addr->align2.bytes_ef;
  249. index ^= index >> soc->ast_hash.idx_bits;
  250. index &= soc->ast_hash.mask;
  251. return index;
  252. }
  253. /*
  254. * dp_peer_ast_hash_add() - Add AST entry into hash table
  255. * @soc: SoC handle
  256. *
  257. * This function adds the AST entry into SoC AST hash table
  258. * It assumes caller has taken the ast lock to protect the access to this table
  259. *
  260. * Return: None
  261. */
  262. static inline void dp_peer_ast_hash_add(struct dp_soc *soc,
  263. struct dp_ast_entry *ase)
  264. {
  265. uint32_t index;
  266. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  267. TAILQ_INSERT_TAIL(&soc->ast_hash.bins[index], ase, hash_list_elem);
  268. }
  269. /*
  270. * dp_peer_ast_hash_remove() - Look up and remove AST entry from hash table
  271. * @soc: SoC handle
  272. *
  273. * This function removes the AST entry from soc AST hash table
  274. * It assumes caller has taken the ast lock to protect the access to this table
  275. *
  276. * Return: None
  277. */
  278. static inline void dp_peer_ast_hash_remove(struct dp_soc *soc,
  279. struct dp_ast_entry *ase)
  280. {
  281. unsigned index;
  282. struct dp_ast_entry *tmpase;
  283. int found = 0;
  284. index = dp_peer_ast_hash_index(soc, &ase->mac_addr);
  285. /* Check if tail is not empty before delete*/
  286. QDF_ASSERT(!TAILQ_EMPTY(&soc->ast_hash.bins[index]));
  287. TAILQ_FOREACH(tmpase, &soc->ast_hash.bins[index], hash_list_elem) {
  288. if (tmpase == ase) {
  289. found = 1;
  290. break;
  291. }
  292. }
  293. QDF_ASSERT(found);
  294. TAILQ_REMOVE(&soc->ast_hash.bins[index], ase, hash_list_elem);
  295. }
  296. /*
  297. * dp_peer_ast_hash_find_by_pdevid() - Find AST entry by MAC address
  298. * and pdev id
  299. * @soc: SoC handle
  300. * @ast_mac_addr: mac address
  301. * @pdev_id: pdev_id
  302. *
  303. * It assumes caller has taken the ast lock to protect the access to
  304. * AST hash table
  305. *
  306. * Return: AST entry
  307. */
  308. struct dp_ast_entry *dp_peer_ast_hash_find_by_pdevid(struct dp_soc *soc,
  309. uint8_t *ast_mac_addr,
  310. uint8_t pdev_id)
  311. {
  312. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  313. uint32_t index;
  314. struct dp_ast_entry *ase;
  315. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  316. ast_mac_addr, DP_MAC_ADDR_LEN);
  317. mac_addr = &local_mac_addr_aligned;
  318. index = dp_peer_ast_hash_index(soc, mac_addr);
  319. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  320. if ((pdev_id == ase->pdev_id) &&
  321. !dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr)) {
  322. return ase;
  323. }
  324. }
  325. return NULL;
  326. }
  327. /*
  328. * dp_peer_ast_hash_find() - Find AST entry by MAC address
  329. * @soc: SoC handle
  330. *
  331. * It assumes caller has taken the ast lock to protect the access to
  332. * AST hash table
  333. *
  334. * Return: AST entry
  335. */
  336. struct dp_ast_entry *dp_peer_ast_hash_find(struct dp_soc *soc,
  337. uint8_t *ast_mac_addr)
  338. {
  339. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  340. unsigned index;
  341. struct dp_ast_entry *ase;
  342. qdf_mem_copy(&local_mac_addr_aligned.raw[0],
  343. ast_mac_addr, DP_MAC_ADDR_LEN);
  344. mac_addr = &local_mac_addr_aligned;
  345. index = dp_peer_ast_hash_index(soc, mac_addr);
  346. TAILQ_FOREACH(ase, &soc->ast_hash.bins[index], hash_list_elem) {
  347. if (dp_peer_find_mac_addr_cmp(mac_addr, &ase->mac_addr) == 0) {
  348. return ase;
  349. }
  350. }
  351. return NULL;
  352. }
  353. /*
  354. * dp_peer_map_ast() - Map the ast entry with HW AST Index
  355. * @soc: SoC handle
  356. * @peer: peer to which ast node belongs
  357. * @mac_addr: MAC address of ast node
  358. * @hw_peer_id: HW AST Index returned by target in peer map event
  359. * @vdev_id: vdev id for VAP to which the peer belongs to
  360. * @ast_hash: ast hash value in HW
  361. *
  362. * Return: None
  363. */
  364. static inline void dp_peer_map_ast(struct dp_soc *soc,
  365. struct dp_peer *peer, uint8_t *mac_addr, uint16_t hw_peer_id,
  366. uint8_t vdev_id, uint16_t ast_hash)
  367. {
  368. struct dp_ast_entry *ast_entry;
  369. enum cdp_txrx_ast_entry_type peer_type = CDP_TXRX_AST_TYPE_STATIC;
  370. bool ast_entry_found = FALSE;
  371. if (!peer) {
  372. return;
  373. }
  374. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  375. "%s: peer %pK ID %d vid %d mac %02x:%02x:%02x:%02x:%02x:%02x",
  376. __func__, peer, hw_peer_id, vdev_id, mac_addr[0],
  377. mac_addr[1], mac_addr[2], mac_addr[3],
  378. mac_addr[4], mac_addr[5]);
  379. qdf_spin_lock_bh(&soc->ast_lock);
  380. TAILQ_FOREACH(ast_entry, &peer->ast_entry_list, ase_list_elem) {
  381. if (!(qdf_mem_cmp(mac_addr, ast_entry->mac_addr.raw,
  382. DP_MAC_ADDR_LEN))) {
  383. ast_entry->ast_idx = hw_peer_id;
  384. soc->ast_table[hw_peer_id] = ast_entry;
  385. ast_entry->is_active = TRUE;
  386. peer_type = ast_entry->type;
  387. ast_entry_found = TRUE;
  388. ast_entry->ast_hash_value = ast_hash;
  389. }
  390. }
  391. if (ast_entry_found || (peer->vdev && peer->vdev->proxysta_vdev)) {
  392. if (soc->cdp_soc.ol_ops->peer_map_event) {
  393. soc->cdp_soc.ol_ops->peer_map_event(
  394. soc->ctrl_psoc, peer->peer_ids[0],
  395. hw_peer_id, vdev_id,
  396. mac_addr, peer_type, ast_hash);
  397. }
  398. } else {
  399. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  400. "AST entry not found");
  401. }
  402. qdf_spin_unlock_bh(&soc->ast_lock);
  403. return;
  404. }
  405. /*
  406. * dp_peer_add_ast() - Allocate and add AST entry into peer list
  407. * @soc: SoC handle
  408. * @peer: peer to which ast node belongs
  409. * @mac_addr: MAC address of ast node
  410. * @is_self: Is this base AST entry with peer mac address
  411. *
  412. * This API is used by WDS source port learning function to
  413. * add a new AST entry into peer AST list
  414. *
  415. * Return: 0 if new entry is allocated,
  416. * -1 if entry add failed
  417. */
  418. int dp_peer_add_ast(struct dp_soc *soc,
  419. struct dp_peer *peer,
  420. uint8_t *mac_addr,
  421. enum cdp_txrx_ast_entry_type type,
  422. uint32_t flags)
  423. {
  424. struct dp_ast_entry *ast_entry;
  425. struct dp_vdev *vdev = peer->vdev;
  426. struct dp_pdev *pdev = NULL;
  427. uint8_t next_node_mac[6];
  428. int ret = -1;
  429. if (!vdev) {
  430. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  431. FL("Peers vdev is NULL"));
  432. QDF_ASSERT(0);
  433. return ret;
  434. }
  435. pdev = vdev->pdev;
  436. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  437. "%s: peer %pK mac %02x:%02x:%02x:%02x:%02x:%02x",
  438. __func__, peer, mac_addr[0], mac_addr[1], mac_addr[2],
  439. mac_addr[3], mac_addr[4], mac_addr[5]);
  440. qdf_spin_lock_bh(&soc->ast_lock);
  441. /* If AST entry already exists , just return from here
  442. * ast entry with same mac address can exist on different radios
  443. * if ast_override support is enabled use search by pdev in this
  444. * case
  445. */
  446. if (soc->ast_override_support) {
  447. ast_entry = dp_peer_ast_hash_find_by_pdevid(soc, mac_addr,
  448. pdev->pdev_id);
  449. if (ast_entry) {
  450. qdf_spin_unlock_bh(&soc->ast_lock);
  451. return 0;
  452. }
  453. } else {
  454. ast_entry = dp_peer_ast_hash_find(soc, mac_addr);
  455. if (ast_entry) {
  456. if (ast_entry->type == CDP_TXRX_AST_TYPE_MEC) {
  457. ast_entry->is_active = TRUE;
  458. qdf_spin_unlock_bh(&soc->ast_lock);
  459. return 0;
  460. }
  461. /*
  462. * WAR for HK 1.x AST issue
  463. * If an AST entry with same mac address already
  464. * exists and is mapped to a different radio, and
  465. * if the current radio is primary radio , delete
  466. * the existing AST entry and return.
  467. *
  468. * New AST entry will be created again on next
  469. * SA_invalid frame
  470. */
  471. if ((ast_entry->pdev_id != vdev->pdev->pdev_id) &&
  472. vdev->pdev->is_primary) {
  473. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  474. "Deleting ast_pdev=%d pdev=%d addr=%pM\n",
  475. ast_entry->pdev_id,
  476. vdev->pdev->pdev_id, mac_addr);
  477. dp_peer_del_ast(soc, ast_entry);
  478. }
  479. qdf_spin_unlock_bh(&soc->ast_lock);
  480. return 0;
  481. }
  482. }
  483. ast_entry = (struct dp_ast_entry *)
  484. qdf_mem_malloc(sizeof(struct dp_ast_entry));
  485. if (!ast_entry) {
  486. qdf_spin_unlock_bh(&soc->ast_lock);
  487. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  488. FL("fail to allocate ast_entry"));
  489. QDF_ASSERT(0);
  490. return ret;
  491. }
  492. qdf_mem_copy(&ast_entry->mac_addr.raw[0], mac_addr, DP_MAC_ADDR_LEN);
  493. ast_entry->peer = peer;
  494. ast_entry->pdev_id = vdev->pdev->pdev_id;
  495. ast_entry->vdev_id = vdev->vdev_id;
  496. switch (type) {
  497. case CDP_TXRX_AST_TYPE_STATIC:
  498. peer->self_ast_entry = ast_entry;
  499. ast_entry->type = CDP_TXRX_AST_TYPE_STATIC;
  500. if (peer->vdev->opmode == wlan_op_mode_sta)
  501. ast_entry->type = CDP_TXRX_AST_TYPE_STA_BSS;
  502. break;
  503. case CDP_TXRX_AST_TYPE_SELF:
  504. peer->self_ast_entry = ast_entry;
  505. ast_entry->type = CDP_TXRX_AST_TYPE_SELF;
  506. break;
  507. case CDP_TXRX_AST_TYPE_WDS:
  508. ast_entry->next_hop = 1;
  509. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  510. break;
  511. case CDP_TXRX_AST_TYPE_WDS_HM:
  512. ast_entry->next_hop = 1;
  513. ast_entry->type = CDP_TXRX_AST_TYPE_WDS_HM;
  514. break;
  515. case CDP_TXRX_AST_TYPE_MEC:
  516. ast_entry->next_hop = 1;
  517. ast_entry->type = CDP_TXRX_AST_TYPE_MEC;
  518. break;
  519. default:
  520. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_ERROR,
  521. FL("Incorrect AST entry type"));
  522. }
  523. ast_entry->is_active = TRUE;
  524. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  525. DP_STATS_INC(soc, ast.added, 1);
  526. dp_peer_ast_hash_add(soc, ast_entry);
  527. qdf_spin_unlock_bh(&soc->ast_lock);
  528. if (ast_entry->type == CDP_TXRX_AST_TYPE_MEC)
  529. qdf_mem_copy(next_node_mac, peer->vdev->mac_addr.raw, 6);
  530. else
  531. qdf_mem_copy(next_node_mac, peer->mac_addr.raw, 6);
  532. if ((ast_entry->type != CDP_TXRX_AST_TYPE_STATIC) &&
  533. (ast_entry->type != CDP_TXRX_AST_TYPE_SELF) &&
  534. (ast_entry->type != CDP_TXRX_AST_TYPE_STA_BSS)) {
  535. if (QDF_STATUS_SUCCESS ==
  536. soc->cdp_soc.ol_ops->peer_add_wds_entry(
  537. peer->vdev->osif_vdev,
  538. mac_addr,
  539. next_node_mac,
  540. flags))
  541. return 0;
  542. }
  543. return ret;
  544. }
  545. #if defined(FEATURE_AST) && defined(AST_HKV1_WORKAROUND)
  546. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  547. {
  548. struct dp_peer *peer = ast_entry->peer;
  549. if (ast_entry->next_hop) {
  550. dp_peer_ast_send_wds_del(soc, ast_entry);
  551. } else {
  552. soc->ast_table[ast_entry->ast_idx] = NULL;
  553. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  554. DP_STATS_INC(soc, ast.deleted, 1);
  555. dp_peer_ast_hash_remove(soc, ast_entry);
  556. qdf_mem_free(ast_entry);
  557. }
  558. }
  559. #else
  560. /*
  561. * dp_peer_del_ast() - Delete and free AST entry
  562. * @soc: SoC handle
  563. * @ast_entry: AST entry of the node
  564. *
  565. * This function removes the AST entry from peer and soc tables
  566. * It assumes caller has taken the ast lock to protect the access to these
  567. * tables
  568. *
  569. * Return: None
  570. */
  571. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  572. {
  573. struct dp_peer *peer = ast_entry->peer;
  574. if (ast_entry->next_hop)
  575. soc->cdp_soc.ol_ops->peer_del_wds_entry(peer->vdev->osif_vdev,
  576. ast_entry->mac_addr.raw);
  577. soc->ast_table[ast_entry->ast_idx] = NULL;
  578. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  579. if (ast_entry == peer->self_ast_entry)
  580. peer->self_ast_entry = NULL;
  581. DP_STATS_INC(soc, ast.deleted, 1);
  582. dp_peer_ast_hash_remove(soc, ast_entry);
  583. qdf_mem_free(ast_entry);
  584. }
  585. #endif
  586. /*
  587. * dp_peer_update_ast() - Delete and free AST entry
  588. * @soc: SoC handle
  589. * @peer: peer to which ast node belongs
  590. * @ast_entry: AST entry of the node
  591. * @flags: wds or hmwds
  592. *
  593. * This function update the AST entry to the roamed peer and soc tables
  594. * It assumes caller has taken the ast lock to protect the access to these
  595. * tables
  596. *
  597. * Return: 0 if ast entry is updated successfully
  598. * -1 failure
  599. */
  600. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  601. struct dp_ast_entry *ast_entry, uint32_t flags)
  602. {
  603. int ret = -1;
  604. struct dp_peer *old_peer;
  605. if ((ast_entry->type == CDP_TXRX_AST_TYPE_STATIC) ||
  606. (ast_entry->type == CDP_TXRX_AST_TYPE_SELF) ||
  607. (ast_entry->type == CDP_TXRX_AST_TYPE_STA_BSS))
  608. return 0;
  609. old_peer = ast_entry->peer;
  610. TAILQ_REMOVE(&old_peer->ast_entry_list, ast_entry, ase_list_elem);
  611. ast_entry->peer = peer;
  612. ast_entry->type = CDP_TXRX_AST_TYPE_WDS;
  613. ast_entry->pdev_id = peer->vdev->pdev->pdev_id;
  614. ast_entry->vdev_id = peer->vdev->vdev_id;
  615. ast_entry->is_active = TRUE;
  616. TAILQ_INSERT_TAIL(&peer->ast_entry_list, ast_entry, ase_list_elem);
  617. ret = soc->cdp_soc.ol_ops->peer_update_wds_entry(
  618. peer->vdev->osif_vdev,
  619. ast_entry->mac_addr.raw,
  620. peer->mac_addr.raw,
  621. flags);
  622. return ret;
  623. }
  624. /*
  625. * dp_peer_ast_get_pdev_id() - get pdev_id from the ast entry
  626. * @soc: SoC handle
  627. * @ast_entry: AST entry of the node
  628. *
  629. * This function gets the pdev_id from the ast entry.
  630. *
  631. * Return: (uint8_t) pdev_id
  632. */
  633. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  634. struct dp_ast_entry *ast_entry)
  635. {
  636. return ast_entry->pdev_id;
  637. }
  638. /*
  639. * dp_peer_ast_get_next_hop() - get next_hop from the ast entry
  640. * @soc: SoC handle
  641. * @ast_entry: AST entry of the node
  642. *
  643. * This function gets the next hop from the ast entry.
  644. *
  645. * Return: (uint8_t) next_hop
  646. */
  647. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  648. struct dp_ast_entry *ast_entry)
  649. {
  650. return ast_entry->next_hop;
  651. }
  652. /*
  653. * dp_peer_ast_set_type() - set type from the ast entry
  654. * @soc: SoC handle
  655. * @ast_entry: AST entry of the node
  656. *
  657. * This function sets the type in the ast entry.
  658. *
  659. * Return:
  660. */
  661. void dp_peer_ast_set_type(struct dp_soc *soc,
  662. struct dp_ast_entry *ast_entry,
  663. enum cdp_txrx_ast_entry_type type)
  664. {
  665. ast_entry->type = type;
  666. }
  667. #else
  668. int dp_peer_add_ast(struct dp_soc *soc, struct dp_peer *peer,
  669. uint8_t *mac_addr, enum cdp_txrx_ast_entry_type type,
  670. uint32_t flags)
  671. {
  672. return 1;
  673. }
  674. void dp_peer_del_ast(struct dp_soc *soc, struct dp_ast_entry *ast_entry)
  675. {
  676. }
  677. int dp_peer_update_ast(struct dp_soc *soc, struct dp_peer *peer,
  678. struct dp_ast_entry *ast_entry, uint32_t flags)
  679. {
  680. return 1;
  681. }
  682. struct dp_ast_entry *dp_peer_ast_hash_find(struct dp_soc *soc,
  683. uint8_t *ast_mac_addr)
  684. {
  685. return NULL;
  686. }
  687. static int dp_peer_ast_hash_attach(struct dp_soc *soc)
  688. {
  689. return 0;
  690. }
  691. static inline void dp_peer_map_ast(struct dp_soc *soc,
  692. struct dp_peer *peer, uint8_t *mac_addr, uint16_t hw_peer_id,
  693. uint8_t vdev_id, uint16_t ast_hash)
  694. {
  695. return;
  696. }
  697. static void dp_peer_ast_hash_detach(struct dp_soc *soc)
  698. {
  699. }
  700. void dp_peer_ast_set_type(struct dp_soc *soc,
  701. struct dp_ast_entry *ast_entry,
  702. enum cdp_txrx_ast_entry_type type)
  703. {
  704. }
  705. uint8_t dp_peer_ast_get_pdev_id(struct dp_soc *soc,
  706. struct dp_ast_entry *ast_entry)
  707. {
  708. return 0xff;
  709. }
  710. uint8_t dp_peer_ast_get_next_hop(struct dp_soc *soc,
  711. struct dp_ast_entry *ast_entry)
  712. {
  713. return 0xff;
  714. }
  715. #endif
  716. #if defined(FEATURE_AST) && defined(AST_HKV1_WORKAROUND)
  717. void dp_peer_ast_set_cp_ctx(struct dp_soc *soc,
  718. struct dp_ast_entry *ast_entry,
  719. void *cp_ctx)
  720. {
  721. ast_entry->cp_ctx = cp_ctx;
  722. }
  723. void *dp_peer_ast_get_cp_ctx(struct dp_soc *soc,
  724. struct dp_ast_entry *ast_entry)
  725. {
  726. void *cp_ctx = NULL;
  727. cp_ctx = ast_entry->cp_ctx;
  728. ast_entry->cp_ctx = NULL;
  729. return cp_ctx;
  730. }
  731. void dp_peer_ast_send_wds_del(struct dp_soc *soc,
  732. struct dp_ast_entry *ast_entry)
  733. {
  734. struct dp_peer *peer = ast_entry->peer;
  735. struct cdp_soc_t *cdp_soc = &soc->cdp_soc;
  736. if (!ast_entry->wmi_sent) {
  737. cdp_soc->ol_ops->peer_del_wds_entry(peer->vdev->osif_vdev,
  738. ast_entry->mac_addr.raw);
  739. ast_entry->wmi_sent = true;
  740. }
  741. }
  742. bool dp_peer_ast_get_wmi_sent(struct dp_soc *soc,
  743. struct dp_ast_entry *ast_entry)
  744. {
  745. return ast_entry->wmi_sent;
  746. }
  747. void dp_peer_ast_free_entry(struct dp_soc *soc,
  748. struct dp_ast_entry *ast_entry)
  749. {
  750. struct dp_peer *peer = ast_entry->peer;
  751. soc->ast_table[ast_entry->ast_idx] = NULL;
  752. TAILQ_REMOVE(&peer->ast_entry_list, ast_entry, ase_list_elem);
  753. DP_STATS_INC(soc, ast.deleted, 1);
  754. dp_peer_ast_hash_remove(soc, ast_entry);
  755. qdf_mem_free(ast_entry);
  756. }
  757. #endif
  758. struct dp_peer *dp_peer_find_hash_find(struct dp_soc *soc,
  759. uint8_t *peer_mac_addr, int mac_addr_is_aligned, uint8_t vdev_id)
  760. {
  761. union dp_align_mac_addr local_mac_addr_aligned, *mac_addr;
  762. unsigned index;
  763. struct dp_peer *peer;
  764. if (mac_addr_is_aligned) {
  765. mac_addr = (union dp_align_mac_addr *) peer_mac_addr;
  766. } else {
  767. qdf_mem_copy(
  768. &local_mac_addr_aligned.raw[0],
  769. peer_mac_addr, DP_MAC_ADDR_LEN);
  770. mac_addr = &local_mac_addr_aligned;
  771. }
  772. index = dp_peer_find_hash_index(soc, mac_addr);
  773. qdf_spin_lock_bh(&soc->peer_ref_mutex);
  774. TAILQ_FOREACH(peer, &soc->peer_hash.bins[index], hash_list_elem) {
  775. #if ATH_SUPPORT_WRAP
  776. /* ProxySTA may have multiple BSS peer with same MAC address,
  777. * modified find will take care of finding the correct BSS peer.
  778. */
  779. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0 &&
  780. ((peer->vdev->vdev_id == vdev_id) ||
  781. (vdev_id == DP_VDEV_ALL))) {
  782. #else
  783. if (dp_peer_find_mac_addr_cmp(mac_addr, &peer->mac_addr) == 0) {
  784. #endif
  785. /* found it - increment the ref count before releasing
  786. * the lock
  787. */
  788. qdf_atomic_inc(&peer->ref_cnt);
  789. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  790. return peer;
  791. }
  792. }
  793. qdf_spin_unlock_bh(&soc->peer_ref_mutex);
  794. return NULL; /* failure */
  795. }
  796. void dp_peer_find_hash_remove(struct dp_soc *soc, struct dp_peer *peer)
  797. {
  798. unsigned index;
  799. struct dp_peer *tmppeer = NULL;
  800. int found = 0;
  801. index = dp_peer_find_hash_index(soc, &peer->mac_addr);
  802. /* Check if tail is not empty before delete*/
  803. QDF_ASSERT(!TAILQ_EMPTY(&soc->peer_hash.bins[index]));
  804. /*
  805. * DO NOT take the peer_ref_mutex lock here - it needs to be taken
  806. * by the caller.
  807. * The caller needs to hold the lock from the time the peer object's
  808. * reference count is decremented and tested up through the time the
  809. * reference to the peer object is removed from the hash table, by
  810. * this function.
  811. * Holding the lock only while removing the peer object reference
  812. * from the hash table keeps the hash table consistent, but does not
  813. * protect against a new HL tx context starting to use the peer object
  814. * if it looks up the peer object from its MAC address just after the
  815. * peer ref count is decremented to zero, but just before the peer
  816. * object reference is removed from the hash table.
  817. */
  818. TAILQ_FOREACH(tmppeer, &soc->peer_hash.bins[index], hash_list_elem) {
  819. if (tmppeer == peer) {
  820. found = 1;
  821. break;
  822. }
  823. }
  824. QDF_ASSERT(found);
  825. TAILQ_REMOVE(&soc->peer_hash.bins[index], peer, hash_list_elem);
  826. }
  827. void dp_peer_find_hash_erase(struct dp_soc *soc)
  828. {
  829. int i;
  830. /*
  831. * Not really necessary to take peer_ref_mutex lock - by this point,
  832. * it's known that the soc is no longer in use.
  833. */
  834. for (i = 0; i <= soc->peer_hash.mask; i++) {
  835. if (!TAILQ_EMPTY(&soc->peer_hash.bins[i])) {
  836. struct dp_peer *peer, *peer_next;
  837. /*
  838. * TAILQ_FOREACH_SAFE must be used here to avoid any
  839. * memory access violation after peer is freed
  840. */
  841. TAILQ_FOREACH_SAFE(peer, &soc->peer_hash.bins[i],
  842. hash_list_elem, peer_next) {
  843. /*
  844. * Don't remove the peer from the hash table -
  845. * that would modify the list we are currently
  846. * traversing, and it's not necessary anyway.
  847. */
  848. /*
  849. * Artificially adjust the peer's ref count to
  850. * 1, so it will get deleted by
  851. * dp_peer_unref_delete.
  852. */
  853. /* set to zero */
  854. qdf_atomic_init(&peer->ref_cnt);
  855. /* incr to one */
  856. qdf_atomic_inc(&peer->ref_cnt);
  857. dp_peer_unref_delete(peer);
  858. }
  859. }
  860. }
  861. }
  862. static void dp_peer_find_map_detach(struct dp_soc *soc)
  863. {
  864. qdf_mem_free(soc->peer_id_to_obj_map);
  865. }
  866. int dp_peer_find_attach(struct dp_soc *soc)
  867. {
  868. if (dp_peer_find_map_attach(soc))
  869. return 1;
  870. if (dp_peer_find_hash_attach(soc)) {
  871. dp_peer_find_map_detach(soc);
  872. return 1;
  873. }
  874. if (dp_peer_ast_hash_attach(soc)) {
  875. dp_peer_find_hash_detach(soc);
  876. dp_peer_find_map_detach(soc);
  877. return 1;
  878. }
  879. return 0; /* success */
  880. }
  881. void dp_rx_tid_stats_cb(struct dp_soc *soc, void *cb_ctxt,
  882. union hal_reo_status *reo_status)
  883. {
  884. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  885. struct hal_reo_queue_status *queue_status = &(reo_status->queue_status);
  886. if (queue_status->header.status != HAL_REO_CMD_SUCCESS) {
  887. DP_TRACE_STATS(FATAL, "REO stats failure %d for TID %d\n",
  888. queue_status->header.status, rx_tid->tid);
  889. return;
  890. }
  891. DP_TRACE_STATS(FATAL, "REO queue stats (TID: %d): \n"
  892. "ssn: %d\n"
  893. "curr_idx : %d\n"
  894. "pn_31_0 : %08x\n"
  895. "pn_63_32 : %08x\n"
  896. "pn_95_64 : %08x\n"
  897. "pn_127_96 : %08x\n"
  898. "last_rx_enq_tstamp : %08x\n"
  899. "last_rx_deq_tstamp : %08x\n"
  900. "rx_bitmap_31_0 : %08x\n"
  901. "rx_bitmap_63_32 : %08x\n"
  902. "rx_bitmap_95_64 : %08x\n"
  903. "rx_bitmap_127_96 : %08x\n"
  904. "rx_bitmap_159_128 : %08x\n"
  905. "rx_bitmap_191_160 : %08x\n"
  906. "rx_bitmap_223_192 : %08x\n"
  907. "rx_bitmap_255_224 : %08x\n",
  908. rx_tid->tid,
  909. queue_status->ssn, queue_status->curr_idx,
  910. queue_status->pn_31_0, queue_status->pn_63_32,
  911. queue_status->pn_95_64, queue_status->pn_127_96,
  912. queue_status->last_rx_enq_tstamp,
  913. queue_status->last_rx_deq_tstamp,
  914. queue_status->rx_bitmap_31_0, queue_status->rx_bitmap_63_32,
  915. queue_status->rx_bitmap_95_64, queue_status->rx_bitmap_127_96,
  916. queue_status->rx_bitmap_159_128,
  917. queue_status->rx_bitmap_191_160,
  918. queue_status->rx_bitmap_223_192,
  919. queue_status->rx_bitmap_255_224);
  920. DP_TRACE_STATS(FATAL,
  921. "curr_mpdu_cnt : %d\n"
  922. "curr_msdu_cnt : %d\n"
  923. "fwd_timeout_cnt : %d\n"
  924. "fwd_bar_cnt : %d\n"
  925. "dup_cnt : %d\n"
  926. "frms_in_order_cnt : %d\n"
  927. "bar_rcvd_cnt : %d\n"
  928. "mpdu_frms_cnt : %d\n"
  929. "msdu_frms_cnt : %d\n"
  930. "total_byte_cnt : %d\n"
  931. "late_recv_mpdu_cnt : %d\n"
  932. "win_jump_2k : %d\n"
  933. "hole_cnt : %d\n",
  934. queue_status->curr_mpdu_cnt, queue_status->curr_msdu_cnt,
  935. queue_status->fwd_timeout_cnt, queue_status->fwd_bar_cnt,
  936. queue_status->dup_cnt, queue_status->frms_in_order_cnt,
  937. queue_status->bar_rcvd_cnt, queue_status->mpdu_frms_cnt,
  938. queue_status->msdu_frms_cnt, queue_status->total_cnt,
  939. queue_status->late_recv_mpdu_cnt, queue_status->win_jump_2k,
  940. queue_status->hole_cnt);
  941. DP_PRINT_STATS("Addba Req : %d\n"
  942. "Addba Resp : %d\n"
  943. "Addba Resp success : %d\n"
  944. "Addba Resp failed : %d\n"
  945. "Delba Req received : %d\n"
  946. "Delba Tx success : %d\n"
  947. "Delba Tx Fail : %d\n"
  948. "BA window size : %d\n"
  949. "Pn size : %d\n",
  950. rx_tid->num_of_addba_req,
  951. rx_tid->num_of_addba_resp,
  952. rx_tid->num_addba_rsp_success,
  953. rx_tid->num_addba_rsp_failed,
  954. rx_tid->num_of_delba_req,
  955. rx_tid->delba_tx_success_cnt,
  956. rx_tid->delba_tx_fail_cnt,
  957. rx_tid->ba_win_size,
  958. rx_tid->pn_size);
  959. }
  960. static inline struct dp_peer *dp_peer_find_add_id(struct dp_soc *soc,
  961. uint8_t *peer_mac_addr, uint16_t peer_id, uint16_t hw_peer_id,
  962. uint8_t vdev_id)
  963. {
  964. struct dp_peer *peer;
  965. QDF_ASSERT(peer_id <= soc->max_peers);
  966. /* check if there's already a peer object with this MAC address */
  967. peer = dp_peer_find_hash_find(soc, peer_mac_addr,
  968. 0 /* is aligned */, vdev_id);
  969. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  970. "%s: peer %pK ID %d vid %d mac %02x:%02x:%02x:%02x:%02x:%02x",
  971. __func__, peer, peer_id, vdev_id, peer_mac_addr[0],
  972. peer_mac_addr[1], peer_mac_addr[2], peer_mac_addr[3],
  973. peer_mac_addr[4], peer_mac_addr[5]);
  974. if (peer) {
  975. /* peer's ref count was already incremented by
  976. * peer_find_hash_find
  977. */
  978. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO,
  979. "%s: ref_cnt: %d", __func__,
  980. qdf_atomic_read(&peer->ref_cnt));
  981. if (!soc->peer_id_to_obj_map[peer_id])
  982. soc->peer_id_to_obj_map[peer_id] = peer;
  983. else {
  984. /* Peer map event came for peer_id which
  985. * is already mapped, this is not expected
  986. */
  987. QDF_ASSERT(0);
  988. }
  989. if (dp_peer_find_add_id_to_obj(peer, peer_id)) {
  990. /* TBDXXX: assert for now */
  991. QDF_ASSERT(0);
  992. }
  993. return peer;
  994. }
  995. return NULL;
  996. }
  997. /**
  998. * dp_rx_peer_map_handler() - handle peer map event from firmware
  999. * @soc_handle - genereic soc handle
  1000. * @peeri_id - peer_id from firmware
  1001. * @hw_peer_id - ast index for this peer
  1002. * @vdev_id - vdev ID
  1003. * @peer_mac_addr - mac address of the peer
  1004. * @ast_hash - ast hash value
  1005. * @is_wds - flag to indicate peer map event for WDS ast entry
  1006. *
  1007. * associate the peer_id that firmware provided with peer entry
  1008. * and update the ast table in the host with the hw_peer_id.
  1009. *
  1010. * Return: none
  1011. */
  1012. void
  1013. dp_rx_peer_map_handler(void *soc_handle, uint16_t peer_id,
  1014. uint16_t hw_peer_id, uint8_t vdev_id,
  1015. uint8_t *peer_mac_addr, uint16_t ast_hash,
  1016. uint8_t is_wds)
  1017. {
  1018. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  1019. struct dp_peer *peer = NULL;
  1020. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  1021. "peer_map_event (soc:%pK): peer_id %di, hw_peer_id %d, peer_mac "
  1022. "%02x:%02x:%02x:%02x:%02x:%02x, vdev_id %d", soc, peer_id,
  1023. hw_peer_id, peer_mac_addr[0], peer_mac_addr[1],
  1024. peer_mac_addr[2], peer_mac_addr[3], peer_mac_addr[4],
  1025. peer_mac_addr[5], vdev_id);
  1026. if ((hw_peer_id < 0) || (hw_peer_id > (WLAN_UMAC_PSOC_MAX_PEERS * 2))) {
  1027. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1028. "invalid hw_peer_id: %d", hw_peer_id);
  1029. qdf_assert_always(0);
  1030. }
  1031. /* Peer map event for WDS ast entry get the peer from
  1032. * obj map
  1033. */
  1034. if (is_wds) {
  1035. peer = soc->peer_id_to_obj_map[peer_id];
  1036. } else {
  1037. peer = dp_peer_find_add_id(soc, peer_mac_addr, peer_id,
  1038. hw_peer_id, vdev_id);
  1039. if (peer) {
  1040. /*
  1041. * For every peer MAp message search and set if bss_peer
  1042. */
  1043. if (!(qdf_mem_cmp(peer->mac_addr.raw,
  1044. peer->vdev->mac_addr.raw,
  1045. DP_MAC_ADDR_LEN))) {
  1046. QDF_TRACE(QDF_MODULE_ID_DP,
  1047. QDF_TRACE_LEVEL_INFO_HIGH,
  1048. "vdev bss_peer!!!!");
  1049. peer->bss_peer = 1;
  1050. peer->vdev->vap_bss_peer = peer;
  1051. }
  1052. if (peer->vdev->opmode == wlan_op_mode_sta)
  1053. peer->vdev->bss_ast_hash = ast_hash;
  1054. }
  1055. }
  1056. dp_peer_map_ast(soc, peer, peer_mac_addr,
  1057. hw_peer_id, vdev_id, ast_hash);
  1058. }
  1059. /**
  1060. * dp_rx_peer_unmap_handler() - handle peer unmap event from firmware
  1061. * @soc_handle - genereic soc handle
  1062. * @peeri_id - peer_id from firmware
  1063. * @vdev_id - vdev ID
  1064. * @peer_mac_addr - mac address of the peer
  1065. * @is_wds - flag to indicate peer map event for WDS ast entry
  1066. *
  1067. * Return: none
  1068. */
  1069. void
  1070. dp_rx_peer_unmap_handler(void *soc_handle, uint16_t peer_id,
  1071. uint8_t vdev_id, uint8_t *peer_mac_addr,
  1072. uint8_t is_wds)
  1073. {
  1074. struct dp_peer *peer;
  1075. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  1076. uint8_t i;
  1077. if (is_wds)
  1078. return;
  1079. peer = __dp_peer_find_by_id(soc, peer_id);
  1080. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  1081. "peer_unmap_event (soc:%pK) peer_id %d peer %pK",
  1082. soc, peer_id, peer);
  1083. /*
  1084. * Currently peer IDs are assigned for vdevs as well as peers.
  1085. * If the peer ID is for a vdev, then the peer pointer stored
  1086. * in peer_id_to_obj_map will be NULL.
  1087. */
  1088. if (!peer) {
  1089. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1090. "%s: Received unmap event for invalid peer_id"
  1091. " %u", __func__, peer_id);
  1092. return;
  1093. }
  1094. soc->peer_id_to_obj_map[peer_id] = NULL;
  1095. for (i = 0; i < MAX_NUM_PEER_ID_PER_PEER; i++) {
  1096. if (peer->peer_ids[i] == peer_id) {
  1097. peer->peer_ids[i] = HTT_INVALID_PEER;
  1098. break;
  1099. }
  1100. }
  1101. if (soc->cdp_soc.ol_ops->peer_unmap_event) {
  1102. soc->cdp_soc.ol_ops->peer_unmap_event(soc->ctrl_psoc,
  1103. peer_id);
  1104. }
  1105. /*
  1106. * Remove a reference to the peer.
  1107. * If there are no more references, delete the peer object.
  1108. */
  1109. dp_peer_unref_delete(peer);
  1110. }
  1111. void
  1112. dp_peer_find_detach(struct dp_soc *soc)
  1113. {
  1114. dp_peer_find_map_detach(soc);
  1115. dp_peer_find_hash_detach(soc);
  1116. dp_peer_ast_hash_detach(soc);
  1117. }
  1118. static void dp_rx_tid_update_cb(struct dp_soc *soc, void *cb_ctxt,
  1119. union hal_reo_status *reo_status)
  1120. {
  1121. struct dp_rx_tid *rx_tid = (struct dp_rx_tid *)cb_ctxt;
  1122. if ((reo_status->rx_queue_status.header.status !=
  1123. HAL_REO_CMD_SUCCESS) &&
  1124. (reo_status->rx_queue_status.header.status !=
  1125. HAL_REO_CMD_DRAIN)) {
  1126. /* Should not happen normally. Just print error for now */
  1127. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1128. "%s: Rx tid HW desc update failed(%d): tid %d",
  1129. __func__,
  1130. reo_status->rx_queue_status.header.status,
  1131. rx_tid->tid);
  1132. }
  1133. }
  1134. /*
  1135. * dp_find_peer_by_addr - find peer instance by mac address
  1136. * @dev: physical device instance
  1137. * @peer_mac_addr: peer mac address
  1138. * @local_id: local id for the peer
  1139. *
  1140. * Return: peer instance pointer
  1141. */
  1142. void *dp_find_peer_by_addr(struct cdp_pdev *dev, uint8_t *peer_mac_addr,
  1143. uint8_t *local_id)
  1144. {
  1145. struct dp_pdev *pdev = (struct dp_pdev *)dev;
  1146. struct dp_peer *peer;
  1147. peer = dp_peer_find_hash_find(pdev->soc, peer_mac_addr, 0, DP_VDEV_ALL);
  1148. if (!peer)
  1149. return NULL;
  1150. /* Multiple peer ids? How can know peer id? */
  1151. *local_id = peer->local_id;
  1152. DP_TRACE(INFO, "%s: peer %pK id %d", __func__, peer, *local_id);
  1153. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  1154. * Decrement it here.
  1155. */
  1156. qdf_atomic_dec(&peer->ref_cnt);
  1157. return peer;
  1158. }
  1159. /*
  1160. * dp_rx_tid_update_wifi3() – Update receive TID state
  1161. * @peer: Datapath peer handle
  1162. * @tid: TID
  1163. * @ba_window_size: BlockAck window size
  1164. * @start_seq: Starting sequence number
  1165. *
  1166. * Return: 0 on success, error code on failure
  1167. */
  1168. static int dp_rx_tid_update_wifi3(struct dp_peer *peer, int tid, uint32_t
  1169. ba_window_size, uint32_t start_seq)
  1170. {
  1171. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  1172. struct dp_soc *soc = peer->vdev->pdev->soc;
  1173. struct hal_reo_cmd_params params;
  1174. qdf_mem_zero(&params, sizeof(params));
  1175. params.std.need_status = 1;
  1176. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  1177. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1178. params.u.upd_queue_params.update_ba_window_size = 1;
  1179. params.u.upd_queue_params.ba_window_size = ba_window_size;
  1180. if (start_seq < IEEE80211_SEQ_MAX) {
  1181. params.u.upd_queue_params.update_ssn = 1;
  1182. params.u.upd_queue_params.ssn = start_seq;
  1183. }
  1184. dp_set_ssn_valid_flag(&params, 0);
  1185. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params, dp_rx_tid_update_cb, rx_tid);
  1186. rx_tid->ba_win_size = ba_window_size;
  1187. if (soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup) {
  1188. soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup(
  1189. peer->vdev->pdev->ctrl_pdev,
  1190. peer->vdev->vdev_id, peer->mac_addr.raw,
  1191. rx_tid->hw_qdesc_paddr, tid, tid, 1, ba_window_size);
  1192. }
  1193. return 0;
  1194. }
  1195. /*
  1196. * dp_reo_desc_free() - Callback free reo descriptor memory after
  1197. * HW cache flush
  1198. *
  1199. * @soc: DP SOC handle
  1200. * @cb_ctxt: Callback context
  1201. * @reo_status: REO command status
  1202. */
  1203. static void dp_reo_desc_free(struct dp_soc *soc, void *cb_ctxt,
  1204. union hal_reo_status *reo_status)
  1205. {
  1206. struct reo_desc_list_node *freedesc =
  1207. (struct reo_desc_list_node *)cb_ctxt;
  1208. struct dp_rx_tid *rx_tid = &freedesc->rx_tid;
  1209. if ((reo_status->fl_cache_status.header.status !=
  1210. HAL_REO_CMD_SUCCESS) &&
  1211. (reo_status->fl_cache_status.header.status !=
  1212. HAL_REO_CMD_DRAIN)) {
  1213. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1214. "%s: Rx tid HW desc flush failed(%d): tid %d",
  1215. __func__,
  1216. reo_status->rx_queue_status.header.status,
  1217. freedesc->rx_tid.tid);
  1218. }
  1219. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_INFO,
  1220. "%s: hw_qdesc_paddr: %pK, tid:%d", __func__,
  1221. (void *)(rx_tid->hw_qdesc_paddr), rx_tid->tid);
  1222. qdf_mem_unmap_nbytes_single(soc->osdev,
  1223. rx_tid->hw_qdesc_paddr,
  1224. QDF_DMA_BIDIRECTIONAL,
  1225. rx_tid->hw_qdesc_alloc_size);
  1226. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  1227. qdf_mem_free(freedesc);
  1228. }
  1229. #if defined(QCA_WIFI_QCA8074) && defined(BUILD_X86)
  1230. /* Hawkeye emulation requires bus address to be >= 0x50000000 */
  1231. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  1232. {
  1233. if (dma_addr < 0x50000000)
  1234. return QDF_STATUS_E_FAILURE;
  1235. else
  1236. return QDF_STATUS_SUCCESS;
  1237. }
  1238. #else
  1239. static inline int dp_reo_desc_addr_chk(qdf_dma_addr_t dma_addr)
  1240. {
  1241. return QDF_STATUS_SUCCESS;
  1242. }
  1243. #endif
  1244. /*
  1245. * dp_rx_tid_setup_wifi3() – Setup receive TID state
  1246. * @peer: Datapath peer handle
  1247. * @tid: TID
  1248. * @ba_window_size: BlockAck window size
  1249. * @start_seq: Starting sequence number
  1250. *
  1251. * Return: 0 on success, error code on failure
  1252. */
  1253. int dp_rx_tid_setup_wifi3(struct dp_peer *peer, int tid,
  1254. uint32_t ba_window_size, uint32_t start_seq)
  1255. {
  1256. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  1257. struct dp_vdev *vdev = peer->vdev;
  1258. struct dp_soc *soc = vdev->pdev->soc;
  1259. uint32_t hw_qdesc_size;
  1260. uint32_t hw_qdesc_align;
  1261. int hal_pn_type;
  1262. void *hw_qdesc_vaddr;
  1263. uint32_t alloc_tries = 0;
  1264. if (peer->delete_in_progress)
  1265. return QDF_STATUS_E_FAILURE;
  1266. rx_tid->ba_win_size = ba_window_size;
  1267. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL)
  1268. return dp_rx_tid_update_wifi3(peer, tid, ba_window_size,
  1269. start_seq);
  1270. rx_tid->delba_tx_status = 0;
  1271. rx_tid->ppdu_id_2k = 0;
  1272. rx_tid->num_of_addba_req = 0;
  1273. rx_tid->num_of_delba_req = 0;
  1274. rx_tid->num_of_addba_resp = 0;
  1275. rx_tid->num_addba_rsp_failed = 0;
  1276. rx_tid->num_addba_rsp_success = 0;
  1277. rx_tid->delba_tx_success_cnt = 0;
  1278. rx_tid->delba_tx_fail_cnt = 0;
  1279. rx_tid->statuscode = 0;
  1280. #ifdef notyet
  1281. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc, ba_window_size);
  1282. #else
  1283. /* TODO: Allocating HW queue descriptors based on max BA window size
  1284. * for all QOS TIDs so that same descriptor can be used later when
  1285. * ADDBA request is recevied. This should be changed to allocate HW
  1286. * queue descriptors based on BA window size being negotiated (0 for
  1287. * non BA cases), and reallocate when BA window size changes and also
  1288. * send WMI message to FW to change the REO queue descriptor in Rx
  1289. * peer entry as part of dp_rx_tid_update.
  1290. */
  1291. if (tid != DP_NON_QOS_TID)
  1292. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  1293. HAL_RX_MAX_BA_WINDOW);
  1294. else
  1295. hw_qdesc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  1296. ba_window_size);
  1297. #endif
  1298. hw_qdesc_align = hal_get_reo_qdesc_align(soc->hal_soc);
  1299. /* To avoid unnecessary extra allocation for alignment, try allocating
  1300. * exact size and see if we already have aligned address.
  1301. */
  1302. rx_tid->hw_qdesc_alloc_size = hw_qdesc_size;
  1303. try_desc_alloc:
  1304. rx_tid->hw_qdesc_vaddr_unaligned =
  1305. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size);
  1306. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  1307. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1308. "%s: Rx tid HW desc alloc failed: tid %d",
  1309. __func__, tid);
  1310. return QDF_STATUS_E_NOMEM;
  1311. }
  1312. if ((unsigned long)(rx_tid->hw_qdesc_vaddr_unaligned) %
  1313. hw_qdesc_align) {
  1314. /* Address allocated above is not alinged. Allocate extra
  1315. * memory for alignment
  1316. */
  1317. qdf_mem_free(rx_tid->hw_qdesc_vaddr_unaligned);
  1318. rx_tid->hw_qdesc_vaddr_unaligned =
  1319. qdf_mem_malloc(rx_tid->hw_qdesc_alloc_size +
  1320. hw_qdesc_align - 1);
  1321. if (!rx_tid->hw_qdesc_vaddr_unaligned) {
  1322. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1323. "%s: Rx tid HW desc alloc failed: tid %d",
  1324. __func__, tid);
  1325. return QDF_STATUS_E_NOMEM;
  1326. }
  1327. hw_qdesc_vaddr = (void *)qdf_align((unsigned long)
  1328. rx_tid->hw_qdesc_vaddr_unaligned,
  1329. hw_qdesc_align);
  1330. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1331. "%s: Total Size %d Aligned Addr %pK",
  1332. __func__, rx_tid->hw_qdesc_alloc_size,
  1333. hw_qdesc_vaddr);
  1334. } else {
  1335. hw_qdesc_vaddr = rx_tid->hw_qdesc_vaddr_unaligned;
  1336. }
  1337. /* TODO: Ensure that sec_type is set before ADDBA is received.
  1338. * Currently this is set based on htt indication
  1339. * HTT_T2H_MSG_TYPE_SEC_IND from target
  1340. */
  1341. switch (peer->security[dp_sec_ucast].sec_type) {
  1342. case cdp_sec_type_tkip_nomic:
  1343. case cdp_sec_type_aes_ccmp:
  1344. case cdp_sec_type_aes_ccmp_256:
  1345. case cdp_sec_type_aes_gcmp:
  1346. case cdp_sec_type_aes_gcmp_256:
  1347. hal_pn_type = HAL_PN_WPA;
  1348. break;
  1349. case cdp_sec_type_wapi:
  1350. if (vdev->opmode == wlan_op_mode_ap)
  1351. hal_pn_type = HAL_PN_WAPI_EVEN;
  1352. else
  1353. hal_pn_type = HAL_PN_WAPI_UNEVEN;
  1354. break;
  1355. default:
  1356. hal_pn_type = HAL_PN_NONE;
  1357. break;
  1358. }
  1359. hal_reo_qdesc_setup(soc->hal_soc, tid, ba_window_size, start_seq,
  1360. hw_qdesc_vaddr, rx_tid->hw_qdesc_paddr, hal_pn_type);
  1361. qdf_mem_map_nbytes_single(soc->osdev, hw_qdesc_vaddr,
  1362. QDF_DMA_BIDIRECTIONAL, rx_tid->hw_qdesc_alloc_size,
  1363. &(rx_tid->hw_qdesc_paddr));
  1364. if (dp_reo_desc_addr_chk(rx_tid->hw_qdesc_paddr) !=
  1365. QDF_STATUS_SUCCESS) {
  1366. if (alloc_tries++ < 10)
  1367. goto try_desc_alloc;
  1368. else {
  1369. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1370. "%s: Rx tid HW desc alloc failed (lowmem): tid %d",
  1371. __func__, tid);
  1372. return QDF_STATUS_E_NOMEM;
  1373. }
  1374. }
  1375. if (soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup) {
  1376. soc->cdp_soc.ol_ops->peer_rx_reorder_queue_setup(
  1377. vdev->pdev->ctrl_pdev,
  1378. peer->vdev->vdev_id, peer->mac_addr.raw,
  1379. rx_tid->hw_qdesc_paddr, tid, tid, 1, ba_window_size);
  1380. }
  1381. return 0;
  1382. }
  1383. /*
  1384. * dp_rx_tid_delete_cb() - Callback to flush reo descriptor HW cache
  1385. * after deleting the entries (ie., setting valid=0)
  1386. *
  1387. * @soc: DP SOC handle
  1388. * @cb_ctxt: Callback context
  1389. * @reo_status: REO command status
  1390. */
  1391. static void dp_rx_tid_delete_cb(struct dp_soc *soc, void *cb_ctxt,
  1392. union hal_reo_status *reo_status)
  1393. {
  1394. struct reo_desc_list_node *freedesc =
  1395. (struct reo_desc_list_node *)cb_ctxt;
  1396. uint32_t list_size;
  1397. struct reo_desc_list_node *desc;
  1398. unsigned long curr_ts = qdf_get_system_timestamp();
  1399. uint32_t desc_size, tot_desc_size;
  1400. struct hal_reo_cmd_params params;
  1401. if (reo_status->rx_queue_status.header.status == HAL_REO_CMD_DRAIN) {
  1402. qdf_mem_zero(reo_status, sizeof(*reo_status));
  1403. reo_status->fl_cache_status.header.status = HAL_REO_CMD_DRAIN;
  1404. dp_reo_desc_free(soc, (void *)freedesc, reo_status);
  1405. return;
  1406. } else if (reo_status->rx_queue_status.header.status !=
  1407. HAL_REO_CMD_SUCCESS) {
  1408. /* Should not happen normally. Just print error for now */
  1409. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1410. "%s: Rx tid HW desc deletion failed(%d): tid %d",
  1411. __func__,
  1412. reo_status->rx_queue_status.header.status,
  1413. freedesc->rx_tid.tid);
  1414. }
  1415. QDF_TRACE(QDF_MODULE_ID_DP, QDF_TRACE_LEVEL_INFO_LOW,
  1416. "%s: rx_tid: %d status: %d", __func__,
  1417. freedesc->rx_tid.tid,
  1418. reo_status->rx_queue_status.header.status);
  1419. qdf_spin_lock_bh(&soc->reo_desc_freelist_lock);
  1420. freedesc->free_ts = curr_ts;
  1421. qdf_list_insert_back_size(&soc->reo_desc_freelist,
  1422. (qdf_list_node_t *)freedesc, &list_size);
  1423. while ((qdf_list_peek_front(&soc->reo_desc_freelist,
  1424. (qdf_list_node_t **)&desc) == QDF_STATUS_SUCCESS) &&
  1425. ((list_size >= REO_DESC_FREELIST_SIZE) ||
  1426. ((curr_ts - desc->free_ts) > REO_DESC_FREE_DEFER_MS))) {
  1427. struct dp_rx_tid *rx_tid;
  1428. qdf_list_remove_front(&soc->reo_desc_freelist,
  1429. (qdf_list_node_t **)&desc);
  1430. list_size--;
  1431. rx_tid = &desc->rx_tid;
  1432. /* Flush and invalidate REO descriptor from HW cache: Base and
  1433. * extension descriptors should be flushed separately */
  1434. tot_desc_size = hal_get_reo_qdesc_size(soc->hal_soc,
  1435. rx_tid->ba_win_size);
  1436. desc_size = hal_get_reo_qdesc_size(soc->hal_soc, 0);
  1437. /* Flush reo extension descriptors */
  1438. while ((tot_desc_size -= desc_size) > 0) {
  1439. qdf_mem_zero(&params, sizeof(params));
  1440. params.std.addr_lo =
  1441. ((uint64_t)(rx_tid->hw_qdesc_paddr) +
  1442. tot_desc_size) & 0xffffffff;
  1443. params.std.addr_hi =
  1444. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1445. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  1446. CMD_FLUSH_CACHE,
  1447. &params,
  1448. NULL,
  1449. NULL)) {
  1450. QDF_TRACE(QDF_MODULE_ID_DP,
  1451. QDF_TRACE_LEVEL_ERROR,
  1452. "%s: fail to send CMD_CACHE_FLUSH:"
  1453. "tid %d desc %pK", __func__,
  1454. rx_tid->tid,
  1455. (void *)(rx_tid->hw_qdesc_paddr));
  1456. }
  1457. }
  1458. /* Flush base descriptor */
  1459. qdf_mem_zero(&params, sizeof(params));
  1460. params.std.need_status = 1;
  1461. params.std.addr_lo =
  1462. (uint64_t)(rx_tid->hw_qdesc_paddr) & 0xffffffff;
  1463. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1464. if (QDF_STATUS_SUCCESS != dp_reo_send_cmd(soc,
  1465. CMD_FLUSH_CACHE,
  1466. &params,
  1467. dp_reo_desc_free,
  1468. (void *)desc)) {
  1469. union hal_reo_status reo_status;
  1470. /*
  1471. * If dp_reo_send_cmd return failure, related TID queue desc
  1472. * should be unmapped. Also locally reo_desc, together with
  1473. * TID queue desc also need to be freed accordingly.
  1474. *
  1475. * Here invoke desc_free function directly to do clean up.
  1476. */
  1477. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1478. "%s: fail to send REO cmd to flush cache: tid %d",
  1479. __func__, rx_tid->tid);
  1480. qdf_mem_zero(&reo_status, sizeof(reo_status));
  1481. reo_status.fl_cache_status.header.status = 0;
  1482. dp_reo_desc_free(soc, (void *)desc, &reo_status);
  1483. }
  1484. }
  1485. qdf_spin_unlock_bh(&soc->reo_desc_freelist_lock);
  1486. }
  1487. /*
  1488. * dp_rx_tid_delete_wifi3() – Delete receive TID queue
  1489. * @peer: Datapath peer handle
  1490. * @tid: TID
  1491. *
  1492. * Return: 0 on success, error code on failure
  1493. */
  1494. static int dp_rx_tid_delete_wifi3(struct dp_peer *peer, int tid)
  1495. {
  1496. struct dp_rx_tid *rx_tid = &(peer->rx_tid[tid]);
  1497. struct dp_soc *soc = peer->vdev->pdev->soc;
  1498. struct hal_reo_cmd_params params;
  1499. struct reo_desc_list_node *freedesc =
  1500. qdf_mem_malloc(sizeof(*freedesc));
  1501. if (!freedesc) {
  1502. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1503. "%s: malloc failed for freedesc: tid %d",
  1504. __func__, tid);
  1505. return -ENOMEM;
  1506. }
  1507. freedesc->rx_tid = *rx_tid;
  1508. qdf_mem_zero(&params, sizeof(params));
  1509. params.std.need_status = 1;
  1510. params.std.addr_lo = rx_tid->hw_qdesc_paddr & 0xffffffff;
  1511. params.std.addr_hi = (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  1512. params.u.upd_queue_params.update_vld = 1;
  1513. params.u.upd_queue_params.vld = 0;
  1514. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  1515. dp_rx_tid_delete_cb, (void *)freedesc);
  1516. rx_tid->hw_qdesc_vaddr_unaligned = NULL;
  1517. rx_tid->hw_qdesc_alloc_size = 0;
  1518. rx_tid->hw_qdesc_paddr = 0;
  1519. return 0;
  1520. }
  1521. #ifdef DP_LFR
  1522. static void dp_peer_setup_remaining_tids(struct dp_peer *peer)
  1523. {
  1524. int tid;
  1525. for (tid = 1; tid < DP_MAX_TIDS-1; tid++) {
  1526. dp_rx_tid_setup_wifi3(peer, tid, 1, 0);
  1527. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1528. "Setting up TID %d for peer %pK peer->local_id %d",
  1529. tid, peer, peer->local_id);
  1530. }
  1531. }
  1532. #else
  1533. static void dp_peer_setup_remaining_tids(struct dp_peer *peer) {};
  1534. #endif
  1535. /*
  1536. * dp_peer_rx_init() – Initialize receive TID state
  1537. * @pdev: Datapath pdev
  1538. * @peer: Datapath peer
  1539. *
  1540. */
  1541. void dp_peer_rx_init(struct dp_pdev *pdev, struct dp_peer *peer)
  1542. {
  1543. int tid;
  1544. struct dp_rx_tid *rx_tid;
  1545. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  1546. rx_tid = &peer->rx_tid[tid];
  1547. rx_tid->array = &rx_tid->base;
  1548. rx_tid->base.head = rx_tid->base.tail = NULL;
  1549. rx_tid->tid = tid;
  1550. rx_tid->defrag_timeout_ms = 0;
  1551. rx_tid->ba_win_size = 0;
  1552. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1553. rx_tid->defrag_waitlist_elem.tqe_next = NULL;
  1554. rx_tid->defrag_waitlist_elem.tqe_prev = NULL;
  1555. #ifdef notyet /* TODO: See if this is required for exception handling */
  1556. /* invalid sequence number */
  1557. peer->tids_last_seq[tid] = 0xffff;
  1558. #endif
  1559. }
  1560. peer->active_ba_session_cnt = 0;
  1561. peer->hw_buffer_size = 0;
  1562. peer->kill_256_sessions = 0;
  1563. /* Setup default (non-qos) rx tid queue */
  1564. dp_rx_tid_setup_wifi3(peer, DP_NON_QOS_TID, 1, 0);
  1565. /* Setup rx tid queue for TID 0.
  1566. * Other queues will be setup on receiving first packet, which will cause
  1567. * NULL REO queue error
  1568. */
  1569. dp_rx_tid_setup_wifi3(peer, 0, 1, 0);
  1570. /*
  1571. * Setup the rest of TID's to handle LFR
  1572. */
  1573. dp_peer_setup_remaining_tids(peer);
  1574. /*
  1575. * Set security defaults: no PN check, no security. The target may
  1576. * send a HTT SEC_IND message to overwrite these defaults.
  1577. */
  1578. peer->security[dp_sec_ucast].sec_type =
  1579. peer->security[dp_sec_mcast].sec_type = cdp_sec_type_none;
  1580. }
  1581. /*
  1582. * dp_peer_rx_cleanup() – Cleanup receive TID state
  1583. * @vdev: Datapath vdev
  1584. * @peer: Datapath peer
  1585. *
  1586. */
  1587. void dp_peer_rx_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  1588. {
  1589. int tid;
  1590. uint32_t tid_delete_mask = 0;
  1591. DP_TRACE(INFO_HIGH, FL("Remove tids for peer: %pK"), peer);
  1592. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  1593. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  1594. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1595. if (peer->rx_tid[tid].hw_qdesc_vaddr_unaligned != NULL) {
  1596. dp_rx_tid_delete_wifi3(peer, tid);
  1597. /* Cleanup defrag related resource */
  1598. dp_rx_defrag_waitlist_remove(peer, tid);
  1599. dp_rx_reorder_flush_frag(peer, tid);
  1600. tid_delete_mask |= (1 << tid);
  1601. }
  1602. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1603. }
  1604. #ifdef notyet /* See if FW can remove queues as part of peer cleanup */
  1605. if (soc->ol_ops->peer_rx_reorder_queue_remove) {
  1606. soc->ol_ops->peer_rx_reorder_queue_remove(vdev->pdev->ctrl_pdev,
  1607. peer->vdev->vdev_id, peer->mac_addr.raw,
  1608. tid_delete_mask);
  1609. }
  1610. #endif
  1611. for (tid = 0; tid < DP_MAX_TIDS; tid++)
  1612. qdf_spinlock_destroy(&peer->rx_tid[tid].tid_lock);
  1613. }
  1614. /*
  1615. * dp_peer_cleanup() – Cleanup peer information
  1616. * @vdev: Datapath vdev
  1617. * @peer: Datapath peer
  1618. *
  1619. */
  1620. void dp_peer_cleanup(struct dp_vdev *vdev, struct dp_peer *peer)
  1621. {
  1622. peer->last_assoc_rcvd = 0;
  1623. peer->last_disassoc_rcvd = 0;
  1624. peer->last_deauth_rcvd = 0;
  1625. /* cleanup the Rx reorder queues for this peer */
  1626. dp_peer_rx_cleanup(vdev, peer);
  1627. }
  1628. /* dp_teardown_256_ba_session() - Teardown sessions using 256
  1629. * window size when a request with
  1630. * 64 window size is received.
  1631. * This is done as a WAR since HW can
  1632. * have only one setting per peer (64 or 256).
  1633. * @peer: Datapath peer
  1634. *
  1635. * Return: void
  1636. */
  1637. static void dp_teardown_256_ba_sessions(struct dp_peer *peer)
  1638. {
  1639. uint8_t delba_rcode = 0;
  1640. int tid;
  1641. struct dp_rx_tid *rx_tid = NULL;
  1642. for (tid = 0; tid < DP_MAX_TIDS; tid++) {
  1643. rx_tid = &peer->rx_tid[tid];
  1644. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1645. if (rx_tid->ba_win_size <= 64) {
  1646. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1647. continue;
  1648. } else {
  1649. if (rx_tid->ba_status == DP_RX_BA_ACTIVE ||
  1650. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  1651. /* send delba */
  1652. if (!rx_tid->delba_tx_status) {
  1653. rx_tid->delba_tx_retry++;
  1654. rx_tid->delba_tx_status = 1;
  1655. rx_tid->delba_rcode =
  1656. IEEE80211_REASON_QOS_SETUP_REQUIRED;
  1657. delba_rcode = rx_tid->delba_rcode;
  1658. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1659. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  1660. peer->vdev->pdev->ctrl_pdev,
  1661. peer->ctrl_peer,
  1662. peer->mac_addr.raw,
  1663. tid, peer->vdev->ctrl_vdev,
  1664. delba_rcode);
  1665. } else {
  1666. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1667. }
  1668. } else {
  1669. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1670. }
  1671. }
  1672. }
  1673. }
  1674. /*
  1675. * dp_rx_addba_resp_tx_completion_wifi3() – Update Rx Tid State
  1676. *
  1677. * @peer: Datapath peer handle
  1678. * @tid: TID number
  1679. * @status: tx completion status
  1680. * Return: 0 on success, error code on failure
  1681. */
  1682. int dp_addba_resp_tx_completion_wifi3(void *peer_handle,
  1683. uint8_t tid, int status)
  1684. {
  1685. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1686. struct dp_rx_tid *rx_tid = NULL;
  1687. if (!peer || peer->delete_in_progress) {
  1688. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1689. "%s: Peer is NULL!\n", __func__);
  1690. return QDF_STATUS_E_FAILURE;
  1691. }
  1692. rx_tid = &peer->rx_tid[tid];
  1693. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1694. if (status) {
  1695. rx_tid->num_addba_rsp_failed++;
  1696. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  1697. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1698. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1699. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1700. "%s: Rx Tid- %d addba rsp tx completion failed!",
  1701. __func__, tid);
  1702. return QDF_STATUS_SUCCESS;
  1703. }
  1704. rx_tid->num_addba_rsp_success++;
  1705. if (rx_tid->ba_status == DP_RX_BA_INACTIVE) {
  1706. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1707. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1708. "%s: Rx Tid- %d hw qdesc is not in IN_PROGRESS",
  1709. __func__, tid);
  1710. return QDF_STATUS_E_FAILURE;
  1711. }
  1712. /* First Session */
  1713. if (peer->active_ba_session_cnt == 0) {
  1714. if (rx_tid->ba_win_size > 64 && rx_tid->ba_win_size <= 256)
  1715. peer->hw_buffer_size = 256;
  1716. else
  1717. peer->hw_buffer_size = 64;
  1718. }
  1719. rx_tid->ba_status = DP_RX_BA_ACTIVE;
  1720. peer->active_ba_session_cnt++;
  1721. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1722. /* Kill any session having 256 buffer size
  1723. * when 64 buffer size request is received.
  1724. * Also, latch on to 64 as new buffer size.
  1725. */
  1726. if (peer->kill_256_sessions) {
  1727. dp_teardown_256_ba_sessions(peer);
  1728. peer->kill_256_sessions = 0;
  1729. }
  1730. return QDF_STATUS_SUCCESS;
  1731. }
  1732. /*
  1733. * dp_rx_addba_responsesetup_wifi3() – Process ADDBA request from peer
  1734. *
  1735. * @peer: Datapath peer handle
  1736. * @tid: TID number
  1737. * @dialogtoken: output dialogtoken
  1738. * @statuscode: output dialogtoken
  1739. * @buffersize: Output BA window size
  1740. * @batimeout: Output BA timeout
  1741. */
  1742. void dp_addba_responsesetup_wifi3(void *peer_handle, uint8_t tid,
  1743. uint8_t *dialogtoken, uint16_t *statuscode,
  1744. uint16_t *buffersize, uint16_t *batimeout)
  1745. {
  1746. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1747. struct dp_rx_tid *rx_tid = NULL;
  1748. if (!peer || peer->delete_in_progress) {
  1749. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1750. "%s: Peer is NULL!\n", __func__);
  1751. return;
  1752. }
  1753. rx_tid = &peer->rx_tid[tid];
  1754. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1755. rx_tid->num_of_addba_resp++;
  1756. /* setup ADDBA response parameters */
  1757. *dialogtoken = rx_tid->dialogtoken;
  1758. *statuscode = rx_tid->statuscode;
  1759. *buffersize = rx_tid->ba_win_size;
  1760. *batimeout = 0;
  1761. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1762. }
  1763. /* dp_check_ba_buffersize() - Check buffer size in request
  1764. * and latch onto this size based on
  1765. * size used in first active session.
  1766. * @peer: Datapath peer
  1767. * @tid: Tid
  1768. * @buffersize: Block ack window size
  1769. *
  1770. * Return: void
  1771. */
  1772. static void dp_check_ba_buffersize(struct dp_peer *peer,
  1773. uint16_t tid,
  1774. uint16_t buffersize)
  1775. {
  1776. struct dp_rx_tid *rx_tid = NULL;
  1777. rx_tid = &peer->rx_tid[tid];
  1778. if (peer->active_ba_session_cnt == 0) {
  1779. rx_tid->ba_win_size = buffersize;
  1780. } else {
  1781. if (peer->hw_buffer_size == 64) {
  1782. if (buffersize <= 64)
  1783. rx_tid->ba_win_size = buffersize;
  1784. else
  1785. rx_tid->ba_win_size = peer->hw_buffer_size;
  1786. } else if (peer->hw_buffer_size == 256) {
  1787. if (buffersize > 64) {
  1788. rx_tid->ba_win_size = buffersize;
  1789. } else {
  1790. rx_tid->ba_win_size = buffersize;
  1791. peer->hw_buffer_size = 64;
  1792. peer->kill_256_sessions = 1;
  1793. }
  1794. }
  1795. }
  1796. }
  1797. /*
  1798. * dp_addba_requestprocess_wifi3() - Process ADDBA request from peer
  1799. *
  1800. * @peer: Datapath peer handle
  1801. * @dialogtoken: dialogtoken from ADDBA frame
  1802. * @tid: TID number
  1803. * @batimeout: BA timeout
  1804. * @buffersize: BA window size
  1805. * @startseqnum: Start seq. number received in BA sequence control
  1806. *
  1807. * Return: 0 on success, error code on failure
  1808. */
  1809. int dp_addba_requestprocess_wifi3(void *peer_handle,
  1810. uint8_t dialogtoken,
  1811. uint16_t tid, uint16_t batimeout,
  1812. uint16_t buffersize,
  1813. uint16_t startseqnum)
  1814. {
  1815. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1816. struct dp_rx_tid *rx_tid = NULL;
  1817. if (!peer || peer->delete_in_progress) {
  1818. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1819. "%s: Peer is NULL!\n", __func__);
  1820. return QDF_STATUS_E_FAILURE;
  1821. }
  1822. rx_tid = &peer->rx_tid[tid];
  1823. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1824. rx_tid->num_of_addba_req++;
  1825. if ((rx_tid->ba_status == DP_RX_BA_ACTIVE &&
  1826. rx_tid->hw_qdesc_vaddr_unaligned != NULL) ||
  1827. (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS)) {
  1828. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  1829. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1830. peer->active_ba_session_cnt--;
  1831. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1832. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  1833. "%s: Rx Tid- %d hw qdesc is already setup",
  1834. __func__, tid);
  1835. return QDF_STATUS_E_FAILURE;
  1836. }
  1837. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  1838. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1839. return QDF_STATUS_E_FAILURE;
  1840. }
  1841. dp_check_ba_buffersize(peer, tid, buffersize);
  1842. if (dp_rx_tid_setup_wifi3(peer, tid, buffersize, startseqnum)) {
  1843. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1844. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1845. return QDF_STATUS_E_FAILURE;
  1846. }
  1847. rx_tid->ba_status = DP_RX_BA_IN_PROGRESS;
  1848. rx_tid->ba_win_size = buffersize;
  1849. rx_tid->dialogtoken = dialogtoken;
  1850. rx_tid->startseqnum = startseqnum;
  1851. if (rx_tid->userstatuscode != IEEE80211_STATUS_SUCCESS)
  1852. rx_tid->statuscode = rx_tid->userstatuscode;
  1853. else
  1854. rx_tid->statuscode = IEEE80211_STATUS_SUCCESS;
  1855. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1856. return QDF_STATUS_SUCCESS;
  1857. }
  1858. /*
  1859. * dp_set_addba_response() – Set a user defined ADDBA response status code
  1860. *
  1861. * @peer: Datapath peer handle
  1862. * @tid: TID number
  1863. * @statuscode: response status code to be set
  1864. */
  1865. void dp_set_addba_response(void *peer_handle, uint8_t tid,
  1866. uint16_t statuscode)
  1867. {
  1868. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1869. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  1870. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1871. rx_tid->userstatuscode = statuscode;
  1872. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1873. }
  1874. /*
  1875. * dp_rx_delba_process_wifi3() – Process DELBA from peer
  1876. * @peer: Datapath peer handle
  1877. * @tid: TID number
  1878. * @reasoncode: Reason code received in DELBA frame
  1879. *
  1880. * Return: 0 on success, error code on failure
  1881. */
  1882. int dp_delba_process_wifi3(void *peer_handle,
  1883. int tid, uint16_t reasoncode)
  1884. {
  1885. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1886. struct dp_rx_tid *rx_tid = &peer->rx_tid[tid];
  1887. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1888. if (rx_tid->ba_status == DP_RX_BA_INACTIVE ||
  1889. rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  1890. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1891. return QDF_STATUS_E_FAILURE;
  1892. }
  1893. /* TODO: See if we can delete the existing REO queue descriptor and
  1894. * replace with a new one without queue extenstion descript to save
  1895. * memory
  1896. */
  1897. rx_tid->delba_rcode = reasoncode;
  1898. rx_tid->num_of_delba_req++;
  1899. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  1900. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1901. peer->active_ba_session_cnt--;
  1902. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1903. return 0;
  1904. }
  1905. /*
  1906. * dp_rx_delba_tx_completion_wifi3() – Send Delba Request
  1907. *
  1908. * @peer: Datapath peer handle
  1909. * @tid: TID number
  1910. * @status: tx completion status
  1911. * Return: 0 on success, error code on failure
  1912. */
  1913. int dp_delba_tx_completion_wifi3(void *peer_handle,
  1914. uint8_t tid, int status)
  1915. {
  1916. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1917. struct dp_rx_tid *rx_tid = NULL;
  1918. if (!peer || peer->delete_in_progress) {
  1919. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  1920. "%s: Peer is NULL!", __func__);
  1921. return QDF_STATUS_E_FAILURE;
  1922. }
  1923. rx_tid = &peer->rx_tid[tid];
  1924. qdf_spin_lock_bh(&rx_tid->tid_lock);
  1925. if (status) {
  1926. rx_tid->delba_tx_fail_cnt++;
  1927. if (rx_tid->delba_tx_retry >= DP_MAX_DELBA_RETRY) {
  1928. rx_tid->delba_tx_retry = 0;
  1929. rx_tid->delba_tx_status = 0;
  1930. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1931. } else {
  1932. rx_tid->delba_tx_retry++;
  1933. rx_tid->delba_tx_status = 1;
  1934. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1935. peer->vdev->pdev->soc->cdp_soc.ol_ops->send_delba(
  1936. peer->vdev->pdev->ctrl_pdev, peer->ctrl_peer,
  1937. peer->mac_addr.raw, tid, peer->vdev->ctrl_vdev,
  1938. rx_tid->delba_rcode);
  1939. }
  1940. return QDF_STATUS_SUCCESS;
  1941. } else {
  1942. rx_tid->delba_tx_success_cnt++;
  1943. rx_tid->delba_tx_retry = 0;
  1944. rx_tid->delba_tx_status = 0;
  1945. }
  1946. if (rx_tid->ba_status == DP_RX_BA_ACTIVE) {
  1947. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  1948. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1949. peer->active_ba_session_cnt--;
  1950. }
  1951. if (rx_tid->ba_status == DP_RX_BA_IN_PROGRESS) {
  1952. dp_rx_tid_update_wifi3(peer, tid, 1, 0);
  1953. rx_tid->ba_status = DP_RX_BA_INACTIVE;
  1954. }
  1955. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  1956. return QDF_STATUS_SUCCESS;
  1957. }
  1958. void dp_rx_discard(struct dp_vdev *vdev, struct dp_peer *peer, unsigned tid,
  1959. qdf_nbuf_t msdu_list)
  1960. {
  1961. while (msdu_list) {
  1962. qdf_nbuf_t msdu = msdu_list;
  1963. msdu_list = qdf_nbuf_next(msdu_list);
  1964. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  1965. "discard rx %pK from partly-deleted peer %pK "
  1966. "(%02x:%02x:%02x:%02x:%02x:%02x)",
  1967. msdu, peer,
  1968. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  1969. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  1970. peer->mac_addr.raw[4], peer->mac_addr.raw[5]);
  1971. qdf_nbuf_free(msdu);
  1972. }
  1973. }
  1974. /**
  1975. * dp_set_pn_check_wifi3() - enable PN check in REO for security
  1976. * @peer: Datapath peer handle
  1977. * @vdev: Datapath vdev
  1978. * @pdev - data path device instance
  1979. * @sec_type - security type
  1980. * @rx_pn - Receive pn starting number
  1981. *
  1982. */
  1983. void
  1984. 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)
  1985. {
  1986. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  1987. struct dp_vdev *vdev = (struct dp_vdev *)vdev_handle;
  1988. struct dp_pdev *pdev;
  1989. struct dp_soc *soc;
  1990. int i;
  1991. uint8_t pn_size;
  1992. struct hal_reo_cmd_params params;
  1993. /* preconditions */
  1994. qdf_assert(vdev);
  1995. pdev = vdev->pdev;
  1996. soc = pdev->soc;
  1997. qdf_mem_zero(&params, sizeof(params));
  1998. params.std.need_status = 1;
  1999. params.u.upd_queue_params.update_pn_valid = 1;
  2000. params.u.upd_queue_params.update_pn_size = 1;
  2001. params.u.upd_queue_params.update_pn = 1;
  2002. params.u.upd_queue_params.update_pn_check_needed = 1;
  2003. params.u.upd_queue_params.update_svld = 1;
  2004. params.u.upd_queue_params.svld = 0;
  2005. peer->security[dp_sec_ucast].sec_type = sec_type;
  2006. switch (sec_type) {
  2007. case cdp_sec_type_tkip_nomic:
  2008. case cdp_sec_type_aes_ccmp:
  2009. case cdp_sec_type_aes_ccmp_256:
  2010. case cdp_sec_type_aes_gcmp:
  2011. case cdp_sec_type_aes_gcmp_256:
  2012. params.u.upd_queue_params.pn_check_needed = 1;
  2013. params.u.upd_queue_params.pn_size = 48;
  2014. pn_size = 48;
  2015. break;
  2016. case cdp_sec_type_wapi:
  2017. params.u.upd_queue_params.pn_check_needed = 1;
  2018. params.u.upd_queue_params.pn_size = 128;
  2019. pn_size = 128;
  2020. if (vdev->opmode == wlan_op_mode_ap) {
  2021. params.u.upd_queue_params.pn_even = 1;
  2022. params.u.upd_queue_params.update_pn_even = 1;
  2023. } else {
  2024. params.u.upd_queue_params.pn_uneven = 1;
  2025. params.u.upd_queue_params.update_pn_uneven = 1;
  2026. }
  2027. break;
  2028. default:
  2029. params.u.upd_queue_params.pn_check_needed = 0;
  2030. pn_size = 0;
  2031. break;
  2032. }
  2033. for (i = 0; i < DP_MAX_TIDS; i++) {
  2034. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  2035. qdf_spin_lock_bh(&rx_tid->tid_lock);
  2036. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL) {
  2037. params.std.addr_lo =
  2038. rx_tid->hw_qdesc_paddr & 0xffffffff;
  2039. params.std.addr_hi =
  2040. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2041. if (sec_type != cdp_sec_type_wapi) {
  2042. params.u.upd_queue_params.update_pn_valid = 0;
  2043. } else {
  2044. /*
  2045. * Setting PN valid bit for WAPI sec_type,
  2046. * since WAPI PN has to be started with
  2047. * predefined value
  2048. */
  2049. params.u.upd_queue_params.update_pn_valid = 1;
  2050. params.u.upd_queue_params.pn_31_0 = rx_pn[0];
  2051. params.u.upd_queue_params.pn_63_32 = rx_pn[1];
  2052. params.u.upd_queue_params.pn_95_64 = rx_pn[2];
  2053. params.u.upd_queue_params.pn_127_96 = rx_pn[3];
  2054. }
  2055. rx_tid->pn_size = pn_size;
  2056. dp_reo_send_cmd(soc, CMD_UPDATE_RX_REO_QUEUE, &params,
  2057. dp_rx_tid_update_cb, rx_tid);
  2058. } else {
  2059. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  2060. "PN Check not setup for TID :%d ", i);
  2061. }
  2062. qdf_spin_unlock_bh(&rx_tid->tid_lock);
  2063. }
  2064. }
  2065. void
  2066. dp_rx_sec_ind_handler(void *soc_handle, uint16_t peer_id,
  2067. enum htt_sec_type sec_type, int is_unicast, u_int32_t *michael_key,
  2068. u_int32_t *rx_pn)
  2069. {
  2070. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  2071. struct dp_peer *peer;
  2072. int sec_index;
  2073. peer = dp_peer_find_by_id(soc, peer_id);
  2074. if (!peer) {
  2075. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  2076. "Couldn't find peer from ID %d - skipping security inits",
  2077. peer_id);
  2078. return;
  2079. }
  2080. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  2081. "sec spec for peer %pK (%02x:%02x:%02x:%02x:%02x:%02x): "
  2082. "%s key of type %d",
  2083. peer,
  2084. peer->mac_addr.raw[0], peer->mac_addr.raw[1],
  2085. peer->mac_addr.raw[2], peer->mac_addr.raw[3],
  2086. peer->mac_addr.raw[4], peer->mac_addr.raw[5],
  2087. is_unicast ? "ucast" : "mcast",
  2088. sec_type);
  2089. sec_index = is_unicast ? dp_sec_ucast : dp_sec_mcast;
  2090. peer->security[sec_index].sec_type = sec_type;
  2091. #ifdef notyet /* TODO: See if this is required for defrag support */
  2092. /* michael key only valid for TKIP, but for simplicity,
  2093. * copy it anyway
  2094. */
  2095. qdf_mem_copy(
  2096. &peer->security[sec_index].michael_key[0],
  2097. michael_key,
  2098. sizeof(peer->security[sec_index].michael_key));
  2099. #ifdef BIG_ENDIAN_HOST
  2100. OL_IF_SWAPBO(peer->security[sec_index].michael_key[0],
  2101. sizeof(peer->security[sec_index].michael_key));
  2102. #endif /* BIG_ENDIAN_HOST */
  2103. #endif
  2104. #ifdef notyet /* TODO: Check if this is required for wifi3.0 */
  2105. if (sec_type != htt_sec_type_wapi) {
  2106. qdf_mem_set(peer->tids_last_pn_valid, _EXT_TIDS, 0x00);
  2107. } else {
  2108. for (i = 0; i < DP_MAX_TIDS; i++) {
  2109. /*
  2110. * Setting PN valid bit for WAPI sec_type,
  2111. * since WAPI PN has to be started with predefined value
  2112. */
  2113. peer->tids_last_pn_valid[i] = 1;
  2114. qdf_mem_copy(
  2115. (u_int8_t *) &peer->tids_last_pn[i],
  2116. (u_int8_t *) rx_pn, sizeof(union htt_rx_pn_t));
  2117. peer->tids_last_pn[i].pn128[1] =
  2118. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[1]);
  2119. peer->tids_last_pn[i].pn128[0] =
  2120. qdf_cpu_to_le64(peer->tids_last_pn[i].pn128[0]);
  2121. }
  2122. }
  2123. #endif
  2124. /* TODO: Update HW TID queue with PN check parameters (pn type for
  2125. * all security types and last pn for WAPI) once REO command API
  2126. * is available
  2127. */
  2128. }
  2129. #ifndef CONFIG_WIN
  2130. /**
  2131. * dp_register_peer() - Register peer into physical device
  2132. * @pdev - data path device instance
  2133. * @sta_desc - peer description
  2134. *
  2135. * Register peer into physical device
  2136. *
  2137. * Return: QDF_STATUS_SUCCESS registration success
  2138. * QDF_STATUS_E_FAULT peer not found
  2139. */
  2140. QDF_STATUS dp_register_peer(struct cdp_pdev *pdev_handle,
  2141. struct ol_txrx_desc_type *sta_desc)
  2142. {
  2143. struct dp_peer *peer;
  2144. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2145. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev,
  2146. sta_desc->sta_id);
  2147. if (!peer)
  2148. return QDF_STATUS_E_FAULT;
  2149. qdf_spin_lock_bh(&peer->peer_info_lock);
  2150. peer->state = OL_TXRX_PEER_STATE_CONN;
  2151. qdf_spin_unlock_bh(&peer->peer_info_lock);
  2152. return QDF_STATUS_SUCCESS;
  2153. }
  2154. /**
  2155. * dp_clear_peer() - remove peer from physical device
  2156. * @pdev - data path device instance
  2157. * @sta_id - local peer id
  2158. *
  2159. * remove peer from physical device
  2160. *
  2161. * Return: QDF_STATUS_SUCCESS registration success
  2162. * QDF_STATUS_E_FAULT peer not found
  2163. */
  2164. QDF_STATUS dp_clear_peer(struct cdp_pdev *pdev_handle, uint8_t local_id)
  2165. {
  2166. struct dp_peer *peer;
  2167. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2168. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev, local_id);
  2169. if (!peer)
  2170. return QDF_STATUS_E_FAULT;
  2171. qdf_spin_lock_bh(&peer->peer_info_lock);
  2172. peer->state = OL_TXRX_PEER_STATE_DISC;
  2173. qdf_spin_unlock_bh(&peer->peer_info_lock);
  2174. return QDF_STATUS_SUCCESS;
  2175. }
  2176. /**
  2177. * dp_find_peer_by_addr_and_vdev() - Find peer by peer mac address within vdev
  2178. * @pdev - data path device instance
  2179. * @vdev - virtual interface instance
  2180. * @peer_addr - peer mac address
  2181. * @peer_id - local peer id with target mac address
  2182. *
  2183. * Find peer by peer mac address within vdev
  2184. *
  2185. * Return: peer instance void pointer
  2186. * NULL cannot find target peer
  2187. */
  2188. void *dp_find_peer_by_addr_and_vdev(struct cdp_pdev *pdev_handle,
  2189. struct cdp_vdev *vdev_handle,
  2190. uint8_t *peer_addr, uint8_t *local_id)
  2191. {
  2192. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2193. struct dp_vdev *vdev = (struct dp_vdev *)vdev_handle;
  2194. struct dp_peer *peer;
  2195. DP_TRACE(INFO, "vdev %pK peer_addr %pK", vdev, peer_addr);
  2196. peer = dp_peer_find_hash_find(pdev->soc, peer_addr, 0, 0);
  2197. DP_TRACE(INFO, "peer %pK vdev %pK", peer, vdev);
  2198. if (!peer)
  2199. return NULL;
  2200. if (peer->vdev != vdev) {
  2201. qdf_atomic_dec(&peer->ref_cnt);
  2202. return NULL;
  2203. }
  2204. *local_id = peer->local_id;
  2205. DP_TRACE(INFO, "peer %pK vdev %pK local id %d", peer, vdev, *local_id);
  2206. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  2207. * Decrement it here.
  2208. */
  2209. qdf_atomic_dec(&peer->ref_cnt);
  2210. return peer;
  2211. }
  2212. /**
  2213. * dp_local_peer_id() - Find local peer id within peer instance
  2214. * @peer - peer instance
  2215. *
  2216. * Find local peer id within peer instance
  2217. *
  2218. * Return: local peer id
  2219. */
  2220. uint16_t dp_local_peer_id(void *peer)
  2221. {
  2222. return ((struct dp_peer *)peer)->local_id;
  2223. }
  2224. /**
  2225. * dp_peer_find_by_local_id() - Find peer by local peer id
  2226. * @pdev - data path device instance
  2227. * @local_peer_id - local peer id want to find
  2228. *
  2229. * Find peer by local peer id within physical device
  2230. *
  2231. * Return: peer instance void pointer
  2232. * NULL cannot find target peer
  2233. */
  2234. void *dp_peer_find_by_local_id(struct cdp_pdev *pdev_handle, uint8_t local_id)
  2235. {
  2236. struct dp_peer *peer;
  2237. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2238. if (local_id >= OL_TXRX_NUM_LOCAL_PEER_IDS) {
  2239. QDF_TRACE_DEBUG_RL(QDF_MODULE_ID_DP,
  2240. "Incorrect local id %u", local_id);
  2241. return NULL;
  2242. }
  2243. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  2244. peer = pdev->local_peer_ids.map[local_id];
  2245. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  2246. DP_TRACE(DEBUG, "peer %pK local id %d", peer, local_id);
  2247. return peer;
  2248. }
  2249. /**
  2250. * dp_peer_state_update() - update peer local state
  2251. * @pdev - data path device instance
  2252. * @peer_addr - peer mac address
  2253. * @state - new peer local state
  2254. *
  2255. * update peer local state
  2256. *
  2257. * Return: QDF_STATUS_SUCCESS registration success
  2258. */
  2259. QDF_STATUS dp_peer_state_update(struct cdp_pdev *pdev_handle, uint8_t *peer_mac,
  2260. enum ol_txrx_peer_state state)
  2261. {
  2262. struct dp_peer *peer;
  2263. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2264. peer = dp_peer_find_hash_find(pdev->soc, peer_mac, 0, DP_VDEV_ALL);
  2265. if (NULL == peer) {
  2266. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  2267. "Failed to find peer for: [%pM]", peer_mac);
  2268. return QDF_STATUS_E_FAILURE;
  2269. }
  2270. peer->state = state;
  2271. DP_TRACE(INFO, "peer %pK state %d", peer, peer->state);
  2272. /* ref_cnt is incremented inside dp_peer_find_hash_find().
  2273. * Decrement it here.
  2274. */
  2275. qdf_atomic_dec(&peer->ref_cnt);
  2276. return QDF_STATUS_SUCCESS;
  2277. }
  2278. /**
  2279. * dp_get_vdevid() - Get virtual interface id which peer registered
  2280. * @peer - peer instance
  2281. * @vdev_id - virtual interface id which peer registered
  2282. *
  2283. * Get virtual interface id which peer registered
  2284. *
  2285. * Return: QDF_STATUS_SUCCESS registration success
  2286. */
  2287. QDF_STATUS dp_get_vdevid(void *peer_handle, uint8_t *vdev_id)
  2288. {
  2289. struct dp_peer *peer = peer_handle;
  2290. DP_TRACE(INFO, "peer %pK vdev %pK vdev id %d",
  2291. peer, peer->vdev, peer->vdev->vdev_id);
  2292. *vdev_id = peer->vdev->vdev_id;
  2293. return QDF_STATUS_SUCCESS;
  2294. }
  2295. struct cdp_vdev *dp_get_vdev_by_sta_id(struct cdp_pdev *pdev_handle,
  2296. uint8_t sta_id)
  2297. {
  2298. struct dp_pdev *pdev = (struct dp_pdev *)pdev_handle;
  2299. struct dp_peer *peer = NULL;
  2300. if (sta_id >= WLAN_MAX_STA_COUNT) {
  2301. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  2302. "Invalid sta id passed");
  2303. return NULL;
  2304. }
  2305. if (!pdev) {
  2306. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  2307. "PDEV not found for sta_id [%d]", sta_id);
  2308. return NULL;
  2309. }
  2310. peer = dp_peer_find_by_local_id((struct cdp_pdev *)pdev, sta_id);
  2311. if (!peer) {
  2312. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_INFO_HIGH,
  2313. "PEER [%d] not found", sta_id);
  2314. return NULL;
  2315. }
  2316. return (struct cdp_vdev *)peer->vdev;
  2317. }
  2318. /**
  2319. * dp_get_vdev_for_peer() - Get virtual interface instance which peer belongs
  2320. * @peer - peer instance
  2321. *
  2322. * Get virtual interface instance which peer belongs
  2323. *
  2324. * Return: virtual interface instance pointer
  2325. * NULL in case cannot find
  2326. */
  2327. struct cdp_vdev *dp_get_vdev_for_peer(void *peer_handle)
  2328. {
  2329. struct dp_peer *peer = peer_handle;
  2330. DP_TRACE(DEBUG, "peer %pK vdev %pK", peer, peer->vdev);
  2331. return (struct cdp_vdev *)peer->vdev;
  2332. }
  2333. /**
  2334. * dp_peer_get_peer_mac_addr() - Get peer mac address
  2335. * @peer - peer instance
  2336. *
  2337. * Get peer mac address
  2338. *
  2339. * Return: peer mac address pointer
  2340. * NULL in case cannot find
  2341. */
  2342. uint8_t *dp_peer_get_peer_mac_addr(void *peer_handle)
  2343. {
  2344. struct dp_peer *peer = peer_handle;
  2345. uint8_t *mac;
  2346. mac = peer->mac_addr.raw;
  2347. DP_TRACE(INFO, "peer %pK mac 0x%x 0x%x 0x%x 0x%x 0x%x 0x%x",
  2348. peer, mac[0], mac[1], mac[2], mac[3], mac[4], mac[5]);
  2349. return peer->mac_addr.raw;
  2350. }
  2351. /**
  2352. * dp_get_peer_state() - Get local peer state
  2353. * @peer - peer instance
  2354. *
  2355. * Get local peer state
  2356. *
  2357. * Return: peer status
  2358. */
  2359. int dp_get_peer_state(void *peer_handle)
  2360. {
  2361. struct dp_peer *peer = peer_handle;
  2362. DP_TRACE(DEBUG, "peer %pK stats %d", peer, peer->state);
  2363. return peer->state;
  2364. }
  2365. /**
  2366. * dp_local_peer_id_pool_init() - local peer id pool alloc for physical device
  2367. * @pdev - data path device instance
  2368. *
  2369. * local peer id pool alloc for physical device
  2370. *
  2371. * Return: none
  2372. */
  2373. void dp_local_peer_id_pool_init(struct dp_pdev *pdev)
  2374. {
  2375. int i;
  2376. /* point the freelist to the first ID */
  2377. pdev->local_peer_ids.freelist = 0;
  2378. /* link each ID to the next one */
  2379. for (i = 0; i < OL_TXRX_NUM_LOCAL_PEER_IDS; i++) {
  2380. pdev->local_peer_ids.pool[i] = i + 1;
  2381. pdev->local_peer_ids.map[i] = NULL;
  2382. }
  2383. /* link the last ID to itself, to mark the end of the list */
  2384. i = OL_TXRX_NUM_LOCAL_PEER_IDS;
  2385. pdev->local_peer_ids.pool[i] = i;
  2386. qdf_spinlock_create(&pdev->local_peer_ids.lock);
  2387. DP_TRACE(INFO, "Peer pool init");
  2388. }
  2389. /**
  2390. * dp_local_peer_id_alloc() - allocate local peer id
  2391. * @pdev - data path device instance
  2392. * @peer - new peer instance
  2393. *
  2394. * allocate local peer id
  2395. *
  2396. * Return: none
  2397. */
  2398. void dp_local_peer_id_alloc(struct dp_pdev *pdev, struct dp_peer *peer)
  2399. {
  2400. int i;
  2401. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  2402. i = pdev->local_peer_ids.freelist;
  2403. if (pdev->local_peer_ids.pool[i] == i) {
  2404. /* the list is empty, except for the list-end marker */
  2405. peer->local_id = OL_TXRX_INVALID_LOCAL_PEER_ID;
  2406. } else {
  2407. /* take the head ID and advance the freelist */
  2408. peer->local_id = i;
  2409. pdev->local_peer_ids.freelist = pdev->local_peer_ids.pool[i];
  2410. pdev->local_peer_ids.map[i] = peer;
  2411. }
  2412. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  2413. DP_TRACE(INFO, "peer %pK, local id %d", peer, peer->local_id);
  2414. }
  2415. /**
  2416. * dp_local_peer_id_free() - remove local peer id
  2417. * @pdev - data path device instance
  2418. * @peer - peer instance should be removed
  2419. *
  2420. * remove local peer id
  2421. *
  2422. * Return: none
  2423. */
  2424. void dp_local_peer_id_free(struct dp_pdev *pdev, struct dp_peer *peer)
  2425. {
  2426. int i = peer->local_id;
  2427. if ((i == OL_TXRX_INVALID_LOCAL_PEER_ID) ||
  2428. (i >= OL_TXRX_NUM_LOCAL_PEER_IDS)) {
  2429. return;
  2430. }
  2431. /* put this ID on the head of the freelist */
  2432. qdf_spin_lock_bh(&pdev->local_peer_ids.lock);
  2433. pdev->local_peer_ids.pool[i] = pdev->local_peer_ids.freelist;
  2434. pdev->local_peer_ids.freelist = i;
  2435. pdev->local_peer_ids.map[i] = NULL;
  2436. qdf_spin_unlock_bh(&pdev->local_peer_ids.lock);
  2437. }
  2438. #endif
  2439. /**
  2440. * dp_get_peer_mac_addr_frm_id(): get mac address of the peer
  2441. * @soc_handle: DP SOC handle
  2442. * @peer_id:peer_id of the peer
  2443. *
  2444. * return: vdev_id of the vap
  2445. */
  2446. uint8_t dp_get_peer_mac_addr_frm_id(struct cdp_soc_t *soc_handle,
  2447. uint16_t peer_id, uint8_t *peer_mac)
  2448. {
  2449. struct dp_soc *soc = (struct dp_soc *)soc_handle;
  2450. struct dp_peer *peer;
  2451. peer = dp_peer_find_by_id(soc, peer_id);
  2452. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_DEBUG,
  2453. "soc %pK peer_id %d", soc, peer_id);
  2454. if (!peer) {
  2455. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  2456. "peer not found ");
  2457. return CDP_INVALID_VDEV_ID;
  2458. }
  2459. qdf_mem_copy(peer_mac, peer->mac_addr.raw, 6);
  2460. return peer->vdev->vdev_id;
  2461. }
  2462. /**
  2463. * dp_peer_rxtid_stats: Retried Rx TID (REO queue) stats from HW
  2464. * @peer: DP peer handle
  2465. * @dp_stats_cmd_cb: REO command callback function
  2466. * @cb_ctxt: Callback context
  2467. *
  2468. * Return: none
  2469. */
  2470. void dp_peer_rxtid_stats(struct dp_peer *peer, void (*dp_stats_cmd_cb),
  2471. void *cb_ctxt)
  2472. {
  2473. struct dp_soc *soc = peer->vdev->pdev->soc;
  2474. struct hal_reo_cmd_params params;
  2475. int i;
  2476. if (!dp_stats_cmd_cb)
  2477. return;
  2478. qdf_mem_zero(&params, sizeof(params));
  2479. for (i = 0; i < DP_MAX_TIDS; i++) {
  2480. struct dp_rx_tid *rx_tid = &peer->rx_tid[i];
  2481. if (rx_tid->hw_qdesc_vaddr_unaligned != NULL) {
  2482. params.std.need_status = 1;
  2483. params.std.addr_lo =
  2484. rx_tid->hw_qdesc_paddr & 0xffffffff;
  2485. params.std.addr_hi =
  2486. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2487. if (cb_ctxt) {
  2488. dp_reo_send_cmd(soc, CMD_GET_QUEUE_STATS,
  2489. &params, dp_stats_cmd_cb, cb_ctxt);
  2490. } else {
  2491. dp_reo_send_cmd(soc, CMD_GET_QUEUE_STATS,
  2492. &params, dp_stats_cmd_cb, rx_tid);
  2493. }
  2494. /* Flush REO descriptor from HW cache to update stats
  2495. * in descriptor memory. This is to help debugging */
  2496. qdf_mem_zero(&params, sizeof(params));
  2497. params.std.need_status = 0;
  2498. params.std.addr_lo =
  2499. rx_tid->hw_qdesc_paddr & 0xffffffff;
  2500. params.std.addr_hi =
  2501. (uint64_t)(rx_tid->hw_qdesc_paddr) >> 32;
  2502. params.u.fl_cache_params.flush_no_inval = 1;
  2503. dp_reo_send_cmd(soc, CMD_FLUSH_CACHE, &params, NULL,
  2504. NULL);
  2505. }
  2506. }
  2507. }
  2508. void dp_set_michael_key(struct cdp_peer *peer_handle,
  2509. bool is_unicast, uint32_t *key)
  2510. {
  2511. struct dp_peer *peer = (struct dp_peer *)peer_handle;
  2512. uint8_t sec_index = is_unicast ? 1 : 0;
  2513. if (!peer) {
  2514. QDF_TRACE(QDF_MODULE_ID_TXRX, QDF_TRACE_LEVEL_ERROR,
  2515. "peer not found ");
  2516. return;
  2517. }
  2518. qdf_mem_copy(&peer->security[sec_index].michael_key[0],
  2519. key, IEEE80211_WEP_MICLEN);
  2520. }