dp_peer.c 90 KB

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