dp_peer.c 88 KB

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