dp_peer.c 88 KB

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