dp_peer.c 80 KB

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