dp_peer.c 87 KB

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