dp_peer.c 92 KB

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