xmit.c 58 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266
  1. /*
  2. * Copyright (c) 2008-2009 Atheros Communications Inc.
  3. *
  4. * Permission to use, copy, modify, and/or distribute this software for any
  5. * purpose with or without fee is hereby granted, provided that the above
  6. * copyright notice and this permission notice appear in all copies.
  7. *
  8. * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  9. * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  10. * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  11. * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  12. * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  13. * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  14. * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  15. */
  16. #include "ath9k.h"
  17. #define BITS_PER_BYTE 8
  18. #define OFDM_PLCP_BITS 22
  19. #define HT_RC_2_MCS(_rc) ((_rc) & 0x0f)
  20. #define HT_RC_2_STREAMS(_rc) ((((_rc) & 0x78) >> 3) + 1)
  21. #define L_STF 8
  22. #define L_LTF 8
  23. #define L_SIG 4
  24. #define HT_SIG 8
  25. #define HT_STF 4
  26. #define HT_LTF(_ns) (4 * (_ns))
  27. #define SYMBOL_TIME(_ns) ((_ns) << 2) /* ns * 4 us */
  28. #define SYMBOL_TIME_HALFGI(_ns) (((_ns) * 18 + 4) / 5) /* ns * 3.6 us */
  29. #define NUM_SYMBOLS_PER_USEC(_usec) (_usec >> 2)
  30. #define NUM_SYMBOLS_PER_USEC_HALFGI(_usec) (((_usec*5)-4)/18)
  31. #define OFDM_SIFS_TIME 16
  32. static u32 bits_per_symbol[][2] = {
  33. /* 20MHz 40MHz */
  34. { 26, 54 }, /* 0: BPSK */
  35. { 52, 108 }, /* 1: QPSK 1/2 */
  36. { 78, 162 }, /* 2: QPSK 3/4 */
  37. { 104, 216 }, /* 3: 16-QAM 1/2 */
  38. { 156, 324 }, /* 4: 16-QAM 3/4 */
  39. { 208, 432 }, /* 5: 64-QAM 2/3 */
  40. { 234, 486 }, /* 6: 64-QAM 3/4 */
  41. { 260, 540 }, /* 7: 64-QAM 5/6 */
  42. { 52, 108 }, /* 8: BPSK */
  43. { 104, 216 }, /* 9: QPSK 1/2 */
  44. { 156, 324 }, /* 10: QPSK 3/4 */
  45. { 208, 432 }, /* 11: 16-QAM 1/2 */
  46. { 312, 648 }, /* 12: 16-QAM 3/4 */
  47. { 416, 864 }, /* 13: 64-QAM 2/3 */
  48. { 468, 972 }, /* 14: 64-QAM 3/4 */
  49. { 520, 1080 }, /* 15: 64-QAM 5/6 */
  50. };
  51. #define IS_HT_RATE(_rate) ((_rate) & 0x80)
  52. static void ath_tx_send_ht_normal(struct ath_softc *sc, struct ath_txq *txq,
  53. struct ath_atx_tid *tid,
  54. struct list_head *bf_head);
  55. static void ath_tx_complete_buf(struct ath_softc *sc, struct ath_buf *bf,
  56. struct ath_txq *txq,
  57. struct list_head *bf_q,
  58. int txok, int sendbar);
  59. static void ath_tx_txqaddbuf(struct ath_softc *sc, struct ath_txq *txq,
  60. struct list_head *head);
  61. static void ath_buf_set_rate(struct ath_softc *sc, struct ath_buf *bf);
  62. static int ath_tx_num_badfrms(struct ath_softc *sc, struct ath_buf *bf,
  63. int txok);
  64. static void ath_tx_rc_status(struct ath_buf *bf, struct ath_desc *ds,
  65. int nbad, int txok, bool update_rc);
  66. enum {
  67. MCS_DEFAULT,
  68. MCS_HT40,
  69. MCS_HT40_SGI,
  70. };
  71. static int ath_max_4ms_framelen[3][16] = {
  72. [MCS_DEFAULT] = {
  73. 3216, 6434, 9650, 12868, 19304, 25740, 28956, 32180,
  74. 6430, 12860, 19300, 25736, 38600, 51472, 57890, 64320,
  75. },
  76. [MCS_HT40] = {
  77. 6684, 13368, 20052, 26738, 40104, 53476, 60156, 66840,
  78. 13360, 26720, 40080, 53440, 80160, 106880, 120240, 133600,
  79. },
  80. [MCS_HT40_SGI] = {
  81. /* TODO: Only MCS 7 and 15 updated, recalculate the rest */
  82. 6684, 13368, 20052, 26738, 40104, 53476, 60156, 74200,
  83. 13360, 26720, 40080, 53440, 80160, 106880, 120240, 148400,
  84. }
  85. };
  86. /*********************/
  87. /* Aggregation logic */
  88. /*********************/
  89. static void ath_tx_queue_tid(struct ath_txq *txq, struct ath_atx_tid *tid)
  90. {
  91. struct ath_atx_ac *ac = tid->ac;
  92. if (tid->paused)
  93. return;
  94. if (tid->sched)
  95. return;
  96. tid->sched = true;
  97. list_add_tail(&tid->list, &ac->tid_q);
  98. if (ac->sched)
  99. return;
  100. ac->sched = true;
  101. list_add_tail(&ac->list, &txq->axq_acq);
  102. }
  103. static void ath_tx_pause_tid(struct ath_softc *sc, struct ath_atx_tid *tid)
  104. {
  105. struct ath_txq *txq = &sc->tx.txq[tid->ac->qnum];
  106. spin_lock_bh(&txq->axq_lock);
  107. tid->paused++;
  108. spin_unlock_bh(&txq->axq_lock);
  109. }
  110. static void ath_tx_resume_tid(struct ath_softc *sc, struct ath_atx_tid *tid)
  111. {
  112. struct ath_txq *txq = &sc->tx.txq[tid->ac->qnum];
  113. BUG_ON(tid->paused <= 0);
  114. spin_lock_bh(&txq->axq_lock);
  115. tid->paused--;
  116. if (tid->paused > 0)
  117. goto unlock;
  118. if (list_empty(&tid->buf_q))
  119. goto unlock;
  120. ath_tx_queue_tid(txq, tid);
  121. ath_txq_schedule(sc, txq);
  122. unlock:
  123. spin_unlock_bh(&txq->axq_lock);
  124. }
  125. static void ath_tx_flush_tid(struct ath_softc *sc, struct ath_atx_tid *tid)
  126. {
  127. struct ath_txq *txq = &sc->tx.txq[tid->ac->qnum];
  128. struct ath_buf *bf;
  129. struct list_head bf_head;
  130. INIT_LIST_HEAD(&bf_head);
  131. BUG_ON(tid->paused <= 0);
  132. spin_lock_bh(&txq->axq_lock);
  133. tid->paused--;
  134. if (tid->paused > 0) {
  135. spin_unlock_bh(&txq->axq_lock);
  136. return;
  137. }
  138. while (!list_empty(&tid->buf_q)) {
  139. bf = list_first_entry(&tid->buf_q, struct ath_buf, list);
  140. BUG_ON(bf_isretried(bf));
  141. list_move_tail(&bf->list, &bf_head);
  142. ath_tx_send_ht_normal(sc, txq, tid, &bf_head);
  143. }
  144. spin_unlock_bh(&txq->axq_lock);
  145. }
  146. static void ath_tx_update_baw(struct ath_softc *sc, struct ath_atx_tid *tid,
  147. int seqno)
  148. {
  149. int index, cindex;
  150. index = ATH_BA_INDEX(tid->seq_start, seqno);
  151. cindex = (tid->baw_head + index) & (ATH_TID_MAX_BUFS - 1);
  152. tid->tx_buf[cindex] = NULL;
  153. while (tid->baw_head != tid->baw_tail && !tid->tx_buf[tid->baw_head]) {
  154. INCR(tid->seq_start, IEEE80211_SEQ_MAX);
  155. INCR(tid->baw_head, ATH_TID_MAX_BUFS);
  156. }
  157. }
  158. static void ath_tx_addto_baw(struct ath_softc *sc, struct ath_atx_tid *tid,
  159. struct ath_buf *bf)
  160. {
  161. int index, cindex;
  162. if (bf_isretried(bf))
  163. return;
  164. index = ATH_BA_INDEX(tid->seq_start, bf->bf_seqno);
  165. cindex = (tid->baw_head + index) & (ATH_TID_MAX_BUFS - 1);
  166. BUG_ON(tid->tx_buf[cindex] != NULL);
  167. tid->tx_buf[cindex] = bf;
  168. if (index >= ((tid->baw_tail - tid->baw_head) &
  169. (ATH_TID_MAX_BUFS - 1))) {
  170. tid->baw_tail = cindex;
  171. INCR(tid->baw_tail, ATH_TID_MAX_BUFS);
  172. }
  173. }
  174. /*
  175. * TODO: For frame(s) that are in the retry state, we will reuse the
  176. * sequence number(s) without setting the retry bit. The
  177. * alternative is to give up on these and BAR the receiver's window
  178. * forward.
  179. */
  180. static void ath_tid_drain(struct ath_softc *sc, struct ath_txq *txq,
  181. struct ath_atx_tid *tid)
  182. {
  183. struct ath_buf *bf;
  184. struct list_head bf_head;
  185. INIT_LIST_HEAD(&bf_head);
  186. for (;;) {
  187. if (list_empty(&tid->buf_q))
  188. break;
  189. bf = list_first_entry(&tid->buf_q, struct ath_buf, list);
  190. list_move_tail(&bf->list, &bf_head);
  191. if (bf_isretried(bf))
  192. ath_tx_update_baw(sc, tid, bf->bf_seqno);
  193. spin_unlock(&txq->axq_lock);
  194. ath_tx_complete_buf(sc, bf, txq, &bf_head, 0, 0);
  195. spin_lock(&txq->axq_lock);
  196. }
  197. tid->seq_next = tid->seq_start;
  198. tid->baw_tail = tid->baw_head;
  199. }
  200. static void ath_tx_set_retry(struct ath_softc *sc, struct ath_txq *txq,
  201. struct ath_buf *bf)
  202. {
  203. struct sk_buff *skb;
  204. struct ieee80211_hdr *hdr;
  205. bf->bf_state.bf_type |= BUF_RETRY;
  206. bf->bf_retries++;
  207. TX_STAT_INC(txq->axq_qnum, a_retries);
  208. skb = bf->bf_mpdu;
  209. hdr = (struct ieee80211_hdr *)skb->data;
  210. hdr->frame_control |= cpu_to_le16(IEEE80211_FCTL_RETRY);
  211. }
  212. static struct ath_buf* ath_clone_txbuf(struct ath_softc *sc, struct ath_buf *bf)
  213. {
  214. struct ath_buf *tbf;
  215. spin_lock_bh(&sc->tx.txbuflock);
  216. if (WARN_ON(list_empty(&sc->tx.txbuf))) {
  217. spin_unlock_bh(&sc->tx.txbuflock);
  218. return NULL;
  219. }
  220. tbf = list_first_entry(&sc->tx.txbuf, struct ath_buf, list);
  221. list_del(&tbf->list);
  222. spin_unlock_bh(&sc->tx.txbuflock);
  223. ATH_TXBUF_RESET(tbf);
  224. tbf->aphy = bf->aphy;
  225. tbf->bf_mpdu = bf->bf_mpdu;
  226. tbf->bf_buf_addr = bf->bf_buf_addr;
  227. *(tbf->bf_desc) = *(bf->bf_desc);
  228. tbf->bf_state = bf->bf_state;
  229. tbf->bf_dmacontext = bf->bf_dmacontext;
  230. return tbf;
  231. }
  232. static void ath_tx_complete_aggr(struct ath_softc *sc, struct ath_txq *txq,
  233. struct ath_buf *bf, struct list_head *bf_q,
  234. int txok)
  235. {
  236. struct ath_node *an = NULL;
  237. struct sk_buff *skb;
  238. struct ieee80211_sta *sta;
  239. struct ieee80211_hw *hw;
  240. struct ieee80211_hdr *hdr;
  241. struct ieee80211_tx_info *tx_info;
  242. struct ath_atx_tid *tid = NULL;
  243. struct ath_buf *bf_next, *bf_last = bf->bf_lastbf;
  244. struct ath_desc *ds = bf_last->bf_desc;
  245. struct list_head bf_head, bf_pending;
  246. u16 seq_st = 0, acked_cnt = 0, txfail_cnt = 0;
  247. u32 ba[WME_BA_BMP_SIZE >> 5];
  248. int isaggr, txfail, txpending, sendbar = 0, needreset = 0, nbad = 0;
  249. bool rc_update = true;
  250. skb = bf->bf_mpdu;
  251. hdr = (struct ieee80211_hdr *)skb->data;
  252. tx_info = IEEE80211_SKB_CB(skb);
  253. hw = bf->aphy->hw;
  254. rcu_read_lock();
  255. /* XXX: use ieee80211_find_sta! */
  256. sta = ieee80211_find_sta_by_hw(hw, hdr->addr1);
  257. if (!sta) {
  258. rcu_read_unlock();
  259. return;
  260. }
  261. an = (struct ath_node *)sta->drv_priv;
  262. tid = ATH_AN_2_TID(an, bf->bf_tidno);
  263. isaggr = bf_isaggr(bf);
  264. memset(ba, 0, WME_BA_BMP_SIZE >> 3);
  265. if (isaggr && txok) {
  266. if (ATH_DS_TX_BA(ds)) {
  267. seq_st = ATH_DS_BA_SEQ(ds);
  268. memcpy(ba, ATH_DS_BA_BITMAP(ds),
  269. WME_BA_BMP_SIZE >> 3);
  270. } else {
  271. /*
  272. * AR5416 can become deaf/mute when BA
  273. * issue happens. Chip needs to be reset.
  274. * But AP code may have sychronization issues
  275. * when perform internal reset in this routine.
  276. * Only enable reset in STA mode for now.
  277. */
  278. if (sc->sc_ah->opmode == NL80211_IFTYPE_STATION)
  279. needreset = 1;
  280. }
  281. }
  282. INIT_LIST_HEAD(&bf_pending);
  283. INIT_LIST_HEAD(&bf_head);
  284. nbad = ath_tx_num_badfrms(sc, bf, txok);
  285. while (bf) {
  286. txfail = txpending = 0;
  287. bf_next = bf->bf_next;
  288. if (ATH_BA_ISSET(ba, ATH_BA_INDEX(seq_st, bf->bf_seqno))) {
  289. /* transmit completion, subframe is
  290. * acked by block ack */
  291. acked_cnt++;
  292. } else if (!isaggr && txok) {
  293. /* transmit completion */
  294. acked_cnt++;
  295. } else {
  296. if (!(tid->state & AGGR_CLEANUP) &&
  297. ds->ds_txstat.ts_flags != ATH9K_TX_SW_ABORTED) {
  298. if (bf->bf_retries < ATH_MAX_SW_RETRIES) {
  299. ath_tx_set_retry(sc, txq, bf);
  300. txpending = 1;
  301. } else {
  302. bf->bf_state.bf_type |= BUF_XRETRY;
  303. txfail = 1;
  304. sendbar = 1;
  305. txfail_cnt++;
  306. }
  307. } else {
  308. /*
  309. * cleanup in progress, just fail
  310. * the un-acked sub-frames
  311. */
  312. txfail = 1;
  313. }
  314. }
  315. if (bf_next == NULL) {
  316. /*
  317. * Make sure the last desc is reclaimed if it
  318. * not a holding desc.
  319. */
  320. if (!bf_last->bf_stale)
  321. list_move_tail(&bf->list, &bf_head);
  322. else
  323. INIT_LIST_HEAD(&bf_head);
  324. } else {
  325. BUG_ON(list_empty(bf_q));
  326. list_move_tail(&bf->list, &bf_head);
  327. }
  328. if (!txpending) {
  329. /*
  330. * complete the acked-ones/xretried ones; update
  331. * block-ack window
  332. */
  333. spin_lock_bh(&txq->axq_lock);
  334. ath_tx_update_baw(sc, tid, bf->bf_seqno);
  335. spin_unlock_bh(&txq->axq_lock);
  336. if (rc_update && (acked_cnt == 1 || txfail_cnt == 1)) {
  337. ath_tx_rc_status(bf, ds, nbad, txok, true);
  338. rc_update = false;
  339. } else {
  340. ath_tx_rc_status(bf, ds, nbad, txok, false);
  341. }
  342. ath_tx_complete_buf(sc, bf, txq, &bf_head, !txfail, sendbar);
  343. } else {
  344. /* retry the un-acked ones */
  345. if (bf->bf_next == NULL && bf_last->bf_stale) {
  346. struct ath_buf *tbf;
  347. tbf = ath_clone_txbuf(sc, bf_last);
  348. /*
  349. * Update tx baw and complete the frame with
  350. * failed status if we run out of tx buf
  351. */
  352. if (!tbf) {
  353. spin_lock_bh(&txq->axq_lock);
  354. ath_tx_update_baw(sc, tid,
  355. bf->bf_seqno);
  356. spin_unlock_bh(&txq->axq_lock);
  357. bf->bf_state.bf_type |= BUF_XRETRY;
  358. ath_tx_rc_status(bf, ds, nbad,
  359. 0, false);
  360. ath_tx_complete_buf(sc, bf, txq,
  361. &bf_head, 0, 0);
  362. break;
  363. }
  364. ath9k_hw_cleartxdesc(sc->sc_ah, tbf->bf_desc);
  365. list_add_tail(&tbf->list, &bf_head);
  366. } else {
  367. /*
  368. * Clear descriptor status words for
  369. * software retry
  370. */
  371. ath9k_hw_cleartxdesc(sc->sc_ah, bf->bf_desc);
  372. }
  373. /*
  374. * Put this buffer to the temporary pending
  375. * queue to retain ordering
  376. */
  377. list_splice_tail_init(&bf_head, &bf_pending);
  378. }
  379. bf = bf_next;
  380. }
  381. if (tid->state & AGGR_CLEANUP) {
  382. if (tid->baw_head == tid->baw_tail) {
  383. tid->state &= ~AGGR_ADDBA_COMPLETE;
  384. tid->state &= ~AGGR_CLEANUP;
  385. /* send buffered frames as singles */
  386. ath_tx_flush_tid(sc, tid);
  387. }
  388. rcu_read_unlock();
  389. return;
  390. }
  391. /* prepend un-acked frames to the beginning of the pending frame queue */
  392. if (!list_empty(&bf_pending)) {
  393. spin_lock_bh(&txq->axq_lock);
  394. list_splice(&bf_pending, &tid->buf_q);
  395. ath_tx_queue_tid(txq, tid);
  396. spin_unlock_bh(&txq->axq_lock);
  397. }
  398. rcu_read_unlock();
  399. if (needreset)
  400. ath_reset(sc, false);
  401. }
  402. static u32 ath_lookup_rate(struct ath_softc *sc, struct ath_buf *bf,
  403. struct ath_atx_tid *tid)
  404. {
  405. struct sk_buff *skb;
  406. struct ieee80211_tx_info *tx_info;
  407. struct ieee80211_tx_rate *rates;
  408. u32 max_4ms_framelen, frmlen;
  409. u16 aggr_limit, legacy = 0;
  410. int i;
  411. skb = bf->bf_mpdu;
  412. tx_info = IEEE80211_SKB_CB(skb);
  413. rates = tx_info->control.rates;
  414. /*
  415. * Find the lowest frame length among the rate series that will have a
  416. * 4ms transmit duration.
  417. * TODO - TXOP limit needs to be considered.
  418. */
  419. max_4ms_framelen = ATH_AMPDU_LIMIT_MAX;
  420. for (i = 0; i < 4; i++) {
  421. if (rates[i].count) {
  422. int modeidx;
  423. if (!(rates[i].flags & IEEE80211_TX_RC_MCS)) {
  424. legacy = 1;
  425. break;
  426. }
  427. if (rates[i].flags & IEEE80211_TX_RC_SHORT_GI)
  428. modeidx = MCS_HT40_SGI;
  429. else if (rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH)
  430. modeidx = MCS_HT40;
  431. else
  432. modeidx = MCS_DEFAULT;
  433. frmlen = ath_max_4ms_framelen[modeidx][rates[i].idx];
  434. max_4ms_framelen = min(max_4ms_framelen, frmlen);
  435. }
  436. }
  437. /*
  438. * limit aggregate size by the minimum rate if rate selected is
  439. * not a probe rate, if rate selected is a probe rate then
  440. * avoid aggregation of this packet.
  441. */
  442. if (tx_info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE || legacy)
  443. return 0;
  444. if (sc->sc_flags & SC_OP_BT_PRIORITY_DETECTED)
  445. aggr_limit = min((max_4ms_framelen * 3) / 8,
  446. (u32)ATH_AMPDU_LIMIT_MAX);
  447. else
  448. aggr_limit = min(max_4ms_framelen,
  449. (u32)ATH_AMPDU_LIMIT_MAX);
  450. /*
  451. * h/w can accept aggregates upto 16 bit lengths (65535).
  452. * The IE, however can hold upto 65536, which shows up here
  453. * as zero. Ignore 65536 since we are constrained by hw.
  454. */
  455. if (tid->an->maxampdu)
  456. aggr_limit = min(aggr_limit, tid->an->maxampdu);
  457. return aggr_limit;
  458. }
  459. /*
  460. * Returns the number of delimiters to be added to
  461. * meet the minimum required mpdudensity.
  462. */
  463. static int ath_compute_num_delims(struct ath_softc *sc, struct ath_atx_tid *tid,
  464. struct ath_buf *bf, u16 frmlen)
  465. {
  466. struct sk_buff *skb = bf->bf_mpdu;
  467. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  468. u32 nsymbits, nsymbols;
  469. u16 minlen;
  470. u8 flags, rix;
  471. int width, half_gi, ndelim, mindelim;
  472. /* Select standard number of delimiters based on frame length alone */
  473. ndelim = ATH_AGGR_GET_NDELIM(frmlen);
  474. /*
  475. * If encryption enabled, hardware requires some more padding between
  476. * subframes.
  477. * TODO - this could be improved to be dependent on the rate.
  478. * The hardware can keep up at lower rates, but not higher rates
  479. */
  480. if (bf->bf_keytype != ATH9K_KEY_TYPE_CLEAR)
  481. ndelim += ATH_AGGR_ENCRYPTDELIM;
  482. /*
  483. * Convert desired mpdu density from microeconds to bytes based
  484. * on highest rate in rate series (i.e. first rate) to determine
  485. * required minimum length for subframe. Take into account
  486. * whether high rate is 20 or 40Mhz and half or full GI.
  487. *
  488. * If there is no mpdu density restriction, no further calculation
  489. * is needed.
  490. */
  491. if (tid->an->mpdudensity == 0)
  492. return ndelim;
  493. rix = tx_info->control.rates[0].idx;
  494. flags = tx_info->control.rates[0].flags;
  495. width = (flags & IEEE80211_TX_RC_40_MHZ_WIDTH) ? 1 : 0;
  496. half_gi = (flags & IEEE80211_TX_RC_SHORT_GI) ? 1 : 0;
  497. if (half_gi)
  498. nsymbols = NUM_SYMBOLS_PER_USEC_HALFGI(tid->an->mpdudensity);
  499. else
  500. nsymbols = NUM_SYMBOLS_PER_USEC(tid->an->mpdudensity);
  501. if (nsymbols == 0)
  502. nsymbols = 1;
  503. nsymbits = bits_per_symbol[rix][width];
  504. minlen = (nsymbols * nsymbits) / BITS_PER_BYTE;
  505. if (frmlen < minlen) {
  506. mindelim = (minlen - frmlen) / ATH_AGGR_DELIM_SZ;
  507. ndelim = max(mindelim, ndelim);
  508. }
  509. return ndelim;
  510. }
  511. static enum ATH_AGGR_STATUS ath_tx_form_aggr(struct ath_softc *sc,
  512. struct ath_txq *txq,
  513. struct ath_atx_tid *tid,
  514. struct list_head *bf_q)
  515. {
  516. #define PADBYTES(_len) ((4 - ((_len) % 4)) % 4)
  517. struct ath_buf *bf, *bf_first, *bf_prev = NULL;
  518. int rl = 0, nframes = 0, ndelim, prev_al = 0;
  519. u16 aggr_limit = 0, al = 0, bpad = 0,
  520. al_delta, h_baw = tid->baw_size / 2;
  521. enum ATH_AGGR_STATUS status = ATH_AGGR_DONE;
  522. bf_first = list_first_entry(&tid->buf_q, struct ath_buf, list);
  523. do {
  524. bf = list_first_entry(&tid->buf_q, struct ath_buf, list);
  525. /* do not step over block-ack window */
  526. if (!BAW_WITHIN(tid->seq_start, tid->baw_size, bf->bf_seqno)) {
  527. status = ATH_AGGR_BAW_CLOSED;
  528. break;
  529. }
  530. if (!rl) {
  531. aggr_limit = ath_lookup_rate(sc, bf, tid);
  532. rl = 1;
  533. }
  534. /* do not exceed aggregation limit */
  535. al_delta = ATH_AGGR_DELIM_SZ + bf->bf_frmlen;
  536. if (nframes &&
  537. (aggr_limit < (al + bpad + al_delta + prev_al))) {
  538. status = ATH_AGGR_LIMITED;
  539. break;
  540. }
  541. /* do not exceed subframe limit */
  542. if (nframes >= min((int)h_baw, ATH_AMPDU_SUBFRAME_DEFAULT)) {
  543. status = ATH_AGGR_LIMITED;
  544. break;
  545. }
  546. nframes++;
  547. /* add padding for previous frame to aggregation length */
  548. al += bpad + al_delta;
  549. /*
  550. * Get the delimiters needed to meet the MPDU
  551. * density for this node.
  552. */
  553. ndelim = ath_compute_num_delims(sc, tid, bf_first, bf->bf_frmlen);
  554. bpad = PADBYTES(al_delta) + (ndelim << 2);
  555. bf->bf_next = NULL;
  556. bf->bf_desc->ds_link = 0;
  557. /* link buffers of this frame to the aggregate */
  558. ath_tx_addto_baw(sc, tid, bf);
  559. ath9k_hw_set11n_aggr_middle(sc->sc_ah, bf->bf_desc, ndelim);
  560. list_move_tail(&bf->list, bf_q);
  561. if (bf_prev) {
  562. bf_prev->bf_next = bf;
  563. bf_prev->bf_desc->ds_link = bf->bf_daddr;
  564. }
  565. bf_prev = bf;
  566. } while (!list_empty(&tid->buf_q));
  567. bf_first->bf_al = al;
  568. bf_first->bf_nframes = nframes;
  569. return status;
  570. #undef PADBYTES
  571. }
  572. static void ath_tx_sched_aggr(struct ath_softc *sc, struct ath_txq *txq,
  573. struct ath_atx_tid *tid)
  574. {
  575. struct ath_buf *bf;
  576. enum ATH_AGGR_STATUS status;
  577. struct list_head bf_q;
  578. do {
  579. if (list_empty(&tid->buf_q))
  580. return;
  581. INIT_LIST_HEAD(&bf_q);
  582. status = ath_tx_form_aggr(sc, txq, tid, &bf_q);
  583. /*
  584. * no frames picked up to be aggregated;
  585. * block-ack window is not open.
  586. */
  587. if (list_empty(&bf_q))
  588. break;
  589. bf = list_first_entry(&bf_q, struct ath_buf, list);
  590. bf->bf_lastbf = list_entry(bf_q.prev, struct ath_buf, list);
  591. /* if only one frame, send as non-aggregate */
  592. if (bf->bf_nframes == 1) {
  593. bf->bf_state.bf_type &= ~BUF_AGGR;
  594. ath9k_hw_clr11n_aggr(sc->sc_ah, bf->bf_desc);
  595. ath_buf_set_rate(sc, bf);
  596. ath_tx_txqaddbuf(sc, txq, &bf_q);
  597. continue;
  598. }
  599. /* setup first desc of aggregate */
  600. bf->bf_state.bf_type |= BUF_AGGR;
  601. ath_buf_set_rate(sc, bf);
  602. ath9k_hw_set11n_aggr_first(sc->sc_ah, bf->bf_desc, bf->bf_al);
  603. /* anchor last desc of aggregate */
  604. ath9k_hw_set11n_aggr_last(sc->sc_ah, bf->bf_lastbf->bf_desc);
  605. ath_tx_txqaddbuf(sc, txq, &bf_q);
  606. TX_STAT_INC(txq->axq_qnum, a_aggr);
  607. } while (txq->axq_depth < ATH_AGGR_MIN_QDEPTH &&
  608. status != ATH_AGGR_BAW_CLOSED);
  609. }
  610. void ath_tx_aggr_start(struct ath_softc *sc, struct ieee80211_sta *sta,
  611. u16 tid, u16 *ssn)
  612. {
  613. struct ath_atx_tid *txtid;
  614. struct ath_node *an;
  615. an = (struct ath_node *)sta->drv_priv;
  616. txtid = ATH_AN_2_TID(an, tid);
  617. txtid->state |= AGGR_ADDBA_PROGRESS;
  618. ath_tx_pause_tid(sc, txtid);
  619. *ssn = txtid->seq_start;
  620. }
  621. void ath_tx_aggr_stop(struct ath_softc *sc, struct ieee80211_sta *sta, u16 tid)
  622. {
  623. struct ath_node *an = (struct ath_node *)sta->drv_priv;
  624. struct ath_atx_tid *txtid = ATH_AN_2_TID(an, tid);
  625. struct ath_txq *txq = &sc->tx.txq[txtid->ac->qnum];
  626. struct ath_buf *bf;
  627. struct list_head bf_head;
  628. INIT_LIST_HEAD(&bf_head);
  629. if (txtid->state & AGGR_CLEANUP)
  630. return;
  631. if (!(txtid->state & AGGR_ADDBA_COMPLETE)) {
  632. txtid->state &= ~AGGR_ADDBA_PROGRESS;
  633. return;
  634. }
  635. ath_tx_pause_tid(sc, txtid);
  636. /* drop all software retried frames and mark this TID */
  637. spin_lock_bh(&txq->axq_lock);
  638. while (!list_empty(&txtid->buf_q)) {
  639. bf = list_first_entry(&txtid->buf_q, struct ath_buf, list);
  640. if (!bf_isretried(bf)) {
  641. /*
  642. * NB: it's based on the assumption that
  643. * software retried frame will always stay
  644. * at the head of software queue.
  645. */
  646. break;
  647. }
  648. list_move_tail(&bf->list, &bf_head);
  649. ath_tx_update_baw(sc, txtid, bf->bf_seqno);
  650. ath_tx_complete_buf(sc, bf, txq, &bf_head, 0, 0);
  651. }
  652. spin_unlock_bh(&txq->axq_lock);
  653. if (txtid->baw_head != txtid->baw_tail) {
  654. txtid->state |= AGGR_CLEANUP;
  655. } else {
  656. txtid->state &= ~AGGR_ADDBA_COMPLETE;
  657. ath_tx_flush_tid(sc, txtid);
  658. }
  659. }
  660. void ath_tx_aggr_resume(struct ath_softc *sc, struct ieee80211_sta *sta, u16 tid)
  661. {
  662. struct ath_atx_tid *txtid;
  663. struct ath_node *an;
  664. an = (struct ath_node *)sta->drv_priv;
  665. if (sc->sc_flags & SC_OP_TXAGGR) {
  666. txtid = ATH_AN_2_TID(an, tid);
  667. txtid->baw_size =
  668. IEEE80211_MIN_AMPDU_BUF << sta->ht_cap.ampdu_factor;
  669. txtid->state |= AGGR_ADDBA_COMPLETE;
  670. txtid->state &= ~AGGR_ADDBA_PROGRESS;
  671. ath_tx_resume_tid(sc, txtid);
  672. }
  673. }
  674. bool ath_tx_aggr_check(struct ath_softc *sc, struct ath_node *an, u8 tidno)
  675. {
  676. struct ath_atx_tid *txtid;
  677. if (!(sc->sc_flags & SC_OP_TXAGGR))
  678. return false;
  679. txtid = ATH_AN_2_TID(an, tidno);
  680. if (!(txtid->state & (AGGR_ADDBA_COMPLETE | AGGR_ADDBA_PROGRESS)))
  681. return true;
  682. return false;
  683. }
  684. /********************/
  685. /* Queue Management */
  686. /********************/
  687. static void ath_txq_drain_pending_buffers(struct ath_softc *sc,
  688. struct ath_txq *txq)
  689. {
  690. struct ath_atx_ac *ac, *ac_tmp;
  691. struct ath_atx_tid *tid, *tid_tmp;
  692. list_for_each_entry_safe(ac, ac_tmp, &txq->axq_acq, list) {
  693. list_del(&ac->list);
  694. ac->sched = false;
  695. list_for_each_entry_safe(tid, tid_tmp, &ac->tid_q, list) {
  696. list_del(&tid->list);
  697. tid->sched = false;
  698. ath_tid_drain(sc, txq, tid);
  699. }
  700. }
  701. }
  702. struct ath_txq *ath_txq_setup(struct ath_softc *sc, int qtype, int subtype)
  703. {
  704. struct ath_hw *ah = sc->sc_ah;
  705. struct ath_common *common = ath9k_hw_common(ah);
  706. struct ath9k_tx_queue_info qi;
  707. int qnum;
  708. memset(&qi, 0, sizeof(qi));
  709. qi.tqi_subtype = subtype;
  710. qi.tqi_aifs = ATH9K_TXQ_USEDEFAULT;
  711. qi.tqi_cwmin = ATH9K_TXQ_USEDEFAULT;
  712. qi.tqi_cwmax = ATH9K_TXQ_USEDEFAULT;
  713. qi.tqi_physCompBuf = 0;
  714. /*
  715. * Enable interrupts only for EOL and DESC conditions.
  716. * We mark tx descriptors to receive a DESC interrupt
  717. * when a tx queue gets deep; otherwise waiting for the
  718. * EOL to reap descriptors. Note that this is done to
  719. * reduce interrupt load and this only defers reaping
  720. * descriptors, never transmitting frames. Aside from
  721. * reducing interrupts this also permits more concurrency.
  722. * The only potential downside is if the tx queue backs
  723. * up in which case the top half of the kernel may backup
  724. * due to a lack of tx descriptors.
  725. *
  726. * The UAPSD queue is an exception, since we take a desc-
  727. * based intr on the EOSP frames.
  728. */
  729. if (qtype == ATH9K_TX_QUEUE_UAPSD)
  730. qi.tqi_qflags = TXQ_FLAG_TXDESCINT_ENABLE;
  731. else
  732. qi.tqi_qflags = TXQ_FLAG_TXEOLINT_ENABLE |
  733. TXQ_FLAG_TXDESCINT_ENABLE;
  734. qnum = ath9k_hw_setuptxqueue(ah, qtype, &qi);
  735. if (qnum == -1) {
  736. /*
  737. * NB: don't print a message, this happens
  738. * normally on parts with too few tx queues
  739. */
  740. return NULL;
  741. }
  742. if (qnum >= ARRAY_SIZE(sc->tx.txq)) {
  743. ath_print(common, ATH_DBG_FATAL,
  744. "qnum %u out of range, max %u!\n",
  745. qnum, (unsigned int)ARRAY_SIZE(sc->tx.txq));
  746. ath9k_hw_releasetxqueue(ah, qnum);
  747. return NULL;
  748. }
  749. if (!ATH_TXQ_SETUP(sc, qnum)) {
  750. struct ath_txq *txq = &sc->tx.txq[qnum];
  751. txq->axq_qnum = qnum;
  752. txq->axq_link = NULL;
  753. INIT_LIST_HEAD(&txq->axq_q);
  754. INIT_LIST_HEAD(&txq->axq_acq);
  755. spin_lock_init(&txq->axq_lock);
  756. txq->axq_depth = 0;
  757. txq->axq_tx_inprogress = false;
  758. sc->tx.txqsetup |= 1<<qnum;
  759. }
  760. return &sc->tx.txq[qnum];
  761. }
  762. int ath_tx_get_qnum(struct ath_softc *sc, int qtype, int haltype)
  763. {
  764. int qnum;
  765. switch (qtype) {
  766. case ATH9K_TX_QUEUE_DATA:
  767. if (haltype >= ARRAY_SIZE(sc->tx.hwq_map)) {
  768. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_FATAL,
  769. "HAL AC %u out of range, max %zu!\n",
  770. haltype, ARRAY_SIZE(sc->tx.hwq_map));
  771. return -1;
  772. }
  773. qnum = sc->tx.hwq_map[haltype];
  774. break;
  775. case ATH9K_TX_QUEUE_BEACON:
  776. qnum = sc->beacon.beaconq;
  777. break;
  778. case ATH9K_TX_QUEUE_CAB:
  779. qnum = sc->beacon.cabq->axq_qnum;
  780. break;
  781. default:
  782. qnum = -1;
  783. }
  784. return qnum;
  785. }
  786. struct ath_txq *ath_test_get_txq(struct ath_softc *sc, struct sk_buff *skb)
  787. {
  788. struct ath_txq *txq = NULL;
  789. u16 skb_queue = skb_get_queue_mapping(skb);
  790. int qnum;
  791. qnum = ath_get_hal_qnum(skb_queue, sc);
  792. txq = &sc->tx.txq[qnum];
  793. spin_lock_bh(&txq->axq_lock);
  794. if (txq->axq_depth >= (ATH_TXBUF - 20)) {
  795. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_XMIT,
  796. "TX queue: %d is full, depth: %d\n",
  797. qnum, txq->axq_depth);
  798. ath_mac80211_stop_queue(sc, skb_queue);
  799. txq->stopped = 1;
  800. spin_unlock_bh(&txq->axq_lock);
  801. return NULL;
  802. }
  803. spin_unlock_bh(&txq->axq_lock);
  804. return txq;
  805. }
  806. int ath_txq_update(struct ath_softc *sc, int qnum,
  807. struct ath9k_tx_queue_info *qinfo)
  808. {
  809. struct ath_hw *ah = sc->sc_ah;
  810. int error = 0;
  811. struct ath9k_tx_queue_info qi;
  812. if (qnum == sc->beacon.beaconq) {
  813. /*
  814. * XXX: for beacon queue, we just save the parameter.
  815. * It will be picked up by ath_beaconq_config when
  816. * it's necessary.
  817. */
  818. sc->beacon.beacon_qi = *qinfo;
  819. return 0;
  820. }
  821. BUG_ON(sc->tx.txq[qnum].axq_qnum != qnum);
  822. ath9k_hw_get_txq_props(ah, qnum, &qi);
  823. qi.tqi_aifs = qinfo->tqi_aifs;
  824. qi.tqi_cwmin = qinfo->tqi_cwmin;
  825. qi.tqi_cwmax = qinfo->tqi_cwmax;
  826. qi.tqi_burstTime = qinfo->tqi_burstTime;
  827. qi.tqi_readyTime = qinfo->tqi_readyTime;
  828. if (!ath9k_hw_set_txq_props(ah, qnum, &qi)) {
  829. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_FATAL,
  830. "Unable to update hardware queue %u!\n", qnum);
  831. error = -EIO;
  832. } else {
  833. ath9k_hw_resettxqueue(ah, qnum);
  834. }
  835. return error;
  836. }
  837. int ath_cabq_update(struct ath_softc *sc)
  838. {
  839. struct ath9k_tx_queue_info qi;
  840. int qnum = sc->beacon.cabq->axq_qnum;
  841. ath9k_hw_get_txq_props(sc->sc_ah, qnum, &qi);
  842. /*
  843. * Ensure the readytime % is within the bounds.
  844. */
  845. if (sc->config.cabqReadytime < ATH9K_READY_TIME_LO_BOUND)
  846. sc->config.cabqReadytime = ATH9K_READY_TIME_LO_BOUND;
  847. else if (sc->config.cabqReadytime > ATH9K_READY_TIME_HI_BOUND)
  848. sc->config.cabqReadytime = ATH9K_READY_TIME_HI_BOUND;
  849. qi.tqi_readyTime = (sc->beacon_interval *
  850. sc->config.cabqReadytime) / 100;
  851. ath_txq_update(sc, qnum, &qi);
  852. return 0;
  853. }
  854. /*
  855. * Drain a given TX queue (could be Beacon or Data)
  856. *
  857. * This assumes output has been stopped and
  858. * we do not need to block ath_tx_tasklet.
  859. */
  860. void ath_draintxq(struct ath_softc *sc, struct ath_txq *txq, bool retry_tx)
  861. {
  862. struct ath_buf *bf, *lastbf;
  863. struct list_head bf_head;
  864. INIT_LIST_HEAD(&bf_head);
  865. for (;;) {
  866. spin_lock_bh(&txq->axq_lock);
  867. if (list_empty(&txq->axq_q)) {
  868. txq->axq_link = NULL;
  869. spin_unlock_bh(&txq->axq_lock);
  870. break;
  871. }
  872. bf = list_first_entry(&txq->axq_q, struct ath_buf, list);
  873. if (bf->bf_stale) {
  874. list_del(&bf->list);
  875. spin_unlock_bh(&txq->axq_lock);
  876. spin_lock_bh(&sc->tx.txbuflock);
  877. list_add_tail(&bf->list, &sc->tx.txbuf);
  878. spin_unlock_bh(&sc->tx.txbuflock);
  879. continue;
  880. }
  881. lastbf = bf->bf_lastbf;
  882. if (!retry_tx)
  883. lastbf->bf_desc->ds_txstat.ts_flags =
  884. ATH9K_TX_SW_ABORTED;
  885. /* remove ath_buf's of the same mpdu from txq */
  886. list_cut_position(&bf_head, &txq->axq_q, &lastbf->list);
  887. txq->axq_depth--;
  888. spin_unlock_bh(&txq->axq_lock);
  889. if (bf_isampdu(bf))
  890. ath_tx_complete_aggr(sc, txq, bf, &bf_head, 0);
  891. else
  892. ath_tx_complete_buf(sc, bf, txq, &bf_head, 0, 0);
  893. }
  894. spin_lock_bh(&txq->axq_lock);
  895. txq->axq_tx_inprogress = false;
  896. spin_unlock_bh(&txq->axq_lock);
  897. /* flush any pending frames if aggregation is enabled */
  898. if (sc->sc_flags & SC_OP_TXAGGR) {
  899. if (!retry_tx) {
  900. spin_lock_bh(&txq->axq_lock);
  901. ath_txq_drain_pending_buffers(sc, txq);
  902. spin_unlock_bh(&txq->axq_lock);
  903. }
  904. }
  905. }
  906. void ath_drain_all_txq(struct ath_softc *sc, bool retry_tx)
  907. {
  908. struct ath_hw *ah = sc->sc_ah;
  909. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  910. struct ath_txq *txq;
  911. int i, npend = 0;
  912. if (sc->sc_flags & SC_OP_INVALID)
  913. return;
  914. /* Stop beacon queue */
  915. ath9k_hw_stoptxdma(sc->sc_ah, sc->beacon.beaconq);
  916. /* Stop data queues */
  917. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  918. if (ATH_TXQ_SETUP(sc, i)) {
  919. txq = &sc->tx.txq[i];
  920. ath9k_hw_stoptxdma(ah, txq->axq_qnum);
  921. npend += ath9k_hw_numtxpending(ah, txq->axq_qnum);
  922. }
  923. }
  924. if (npend) {
  925. int r;
  926. ath_print(common, ATH_DBG_FATAL,
  927. "Unable to stop TxDMA. Reset HAL!\n");
  928. spin_lock_bh(&sc->sc_resetlock);
  929. r = ath9k_hw_reset(ah, sc->sc_ah->curchan, false);
  930. if (r)
  931. ath_print(common, ATH_DBG_FATAL,
  932. "Unable to reset hardware; reset status %d\n",
  933. r);
  934. spin_unlock_bh(&sc->sc_resetlock);
  935. }
  936. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  937. if (ATH_TXQ_SETUP(sc, i))
  938. ath_draintxq(sc, &sc->tx.txq[i], retry_tx);
  939. }
  940. }
  941. void ath_tx_cleanupq(struct ath_softc *sc, struct ath_txq *txq)
  942. {
  943. ath9k_hw_releasetxqueue(sc->sc_ah, txq->axq_qnum);
  944. sc->tx.txqsetup &= ~(1<<txq->axq_qnum);
  945. }
  946. void ath_txq_schedule(struct ath_softc *sc, struct ath_txq *txq)
  947. {
  948. struct ath_atx_ac *ac;
  949. struct ath_atx_tid *tid;
  950. if (list_empty(&txq->axq_acq))
  951. return;
  952. ac = list_first_entry(&txq->axq_acq, struct ath_atx_ac, list);
  953. list_del(&ac->list);
  954. ac->sched = false;
  955. do {
  956. if (list_empty(&ac->tid_q))
  957. return;
  958. tid = list_first_entry(&ac->tid_q, struct ath_atx_tid, list);
  959. list_del(&tid->list);
  960. tid->sched = false;
  961. if (tid->paused)
  962. continue;
  963. ath_tx_sched_aggr(sc, txq, tid);
  964. /*
  965. * add tid to round-robin queue if more frames
  966. * are pending for the tid
  967. */
  968. if (!list_empty(&tid->buf_q))
  969. ath_tx_queue_tid(txq, tid);
  970. break;
  971. } while (!list_empty(&ac->tid_q));
  972. if (!list_empty(&ac->tid_q)) {
  973. if (!ac->sched) {
  974. ac->sched = true;
  975. list_add_tail(&ac->list, &txq->axq_acq);
  976. }
  977. }
  978. }
  979. int ath_tx_setup(struct ath_softc *sc, int haltype)
  980. {
  981. struct ath_txq *txq;
  982. if (haltype >= ARRAY_SIZE(sc->tx.hwq_map)) {
  983. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_FATAL,
  984. "HAL AC %u out of range, max %zu!\n",
  985. haltype, ARRAY_SIZE(sc->tx.hwq_map));
  986. return 0;
  987. }
  988. txq = ath_txq_setup(sc, ATH9K_TX_QUEUE_DATA, haltype);
  989. if (txq != NULL) {
  990. sc->tx.hwq_map[haltype] = txq->axq_qnum;
  991. return 1;
  992. } else
  993. return 0;
  994. }
  995. /***********/
  996. /* TX, DMA */
  997. /***********/
  998. /*
  999. * Insert a chain of ath_buf (descriptors) on a txq and
  1000. * assume the descriptors are already chained together by caller.
  1001. */
  1002. static void ath_tx_txqaddbuf(struct ath_softc *sc, struct ath_txq *txq,
  1003. struct list_head *head)
  1004. {
  1005. struct ath_hw *ah = sc->sc_ah;
  1006. struct ath_common *common = ath9k_hw_common(ah);
  1007. struct ath_buf *bf;
  1008. /*
  1009. * Insert the frame on the outbound list and
  1010. * pass it on to the hardware.
  1011. */
  1012. if (list_empty(head))
  1013. return;
  1014. bf = list_first_entry(head, struct ath_buf, list);
  1015. list_splice_tail_init(head, &txq->axq_q);
  1016. txq->axq_depth++;
  1017. ath_print(common, ATH_DBG_QUEUE,
  1018. "qnum: %d, txq depth: %d\n", txq->axq_qnum, txq->axq_depth);
  1019. if (txq->axq_link == NULL) {
  1020. ath9k_hw_puttxbuf(ah, txq->axq_qnum, bf->bf_daddr);
  1021. ath_print(common, ATH_DBG_XMIT,
  1022. "TXDP[%u] = %llx (%p)\n",
  1023. txq->axq_qnum, ito64(bf->bf_daddr), bf->bf_desc);
  1024. } else {
  1025. *txq->axq_link = bf->bf_daddr;
  1026. ath_print(common, ATH_DBG_XMIT, "link[%u] (%p)=%llx (%p)\n",
  1027. txq->axq_qnum, txq->axq_link,
  1028. ito64(bf->bf_daddr), bf->bf_desc);
  1029. }
  1030. txq->axq_link = &(bf->bf_lastbf->bf_desc->ds_link);
  1031. ath9k_hw_txstart(ah, txq->axq_qnum);
  1032. }
  1033. static struct ath_buf *ath_tx_get_buffer(struct ath_softc *sc)
  1034. {
  1035. struct ath_buf *bf = NULL;
  1036. spin_lock_bh(&sc->tx.txbuflock);
  1037. if (unlikely(list_empty(&sc->tx.txbuf))) {
  1038. spin_unlock_bh(&sc->tx.txbuflock);
  1039. return NULL;
  1040. }
  1041. bf = list_first_entry(&sc->tx.txbuf, struct ath_buf, list);
  1042. list_del(&bf->list);
  1043. spin_unlock_bh(&sc->tx.txbuflock);
  1044. return bf;
  1045. }
  1046. static void ath_tx_send_ampdu(struct ath_softc *sc, struct ath_atx_tid *tid,
  1047. struct list_head *bf_head,
  1048. struct ath_tx_control *txctl)
  1049. {
  1050. struct ath_buf *bf;
  1051. bf = list_first_entry(bf_head, struct ath_buf, list);
  1052. bf->bf_state.bf_type |= BUF_AMPDU;
  1053. TX_STAT_INC(txctl->txq->axq_qnum, a_queued);
  1054. /*
  1055. * Do not queue to h/w when any of the following conditions is true:
  1056. * - there are pending frames in software queue
  1057. * - the TID is currently paused for ADDBA/BAR request
  1058. * - seqno is not within block-ack window
  1059. * - h/w queue depth exceeds low water mark
  1060. */
  1061. if (!list_empty(&tid->buf_q) || tid->paused ||
  1062. !BAW_WITHIN(tid->seq_start, tid->baw_size, bf->bf_seqno) ||
  1063. txctl->txq->axq_depth >= ATH_AGGR_MIN_QDEPTH) {
  1064. /*
  1065. * Add this frame to software queue for scheduling later
  1066. * for aggregation.
  1067. */
  1068. list_move_tail(&bf->list, &tid->buf_q);
  1069. ath_tx_queue_tid(txctl->txq, tid);
  1070. return;
  1071. }
  1072. /* Add sub-frame to BAW */
  1073. ath_tx_addto_baw(sc, tid, bf);
  1074. /* Queue to h/w without aggregation */
  1075. bf->bf_nframes = 1;
  1076. bf->bf_lastbf = bf;
  1077. ath_buf_set_rate(sc, bf);
  1078. ath_tx_txqaddbuf(sc, txctl->txq, bf_head);
  1079. }
  1080. static void ath_tx_send_ht_normal(struct ath_softc *sc, struct ath_txq *txq,
  1081. struct ath_atx_tid *tid,
  1082. struct list_head *bf_head)
  1083. {
  1084. struct ath_buf *bf;
  1085. bf = list_first_entry(bf_head, struct ath_buf, list);
  1086. bf->bf_state.bf_type &= ~BUF_AMPDU;
  1087. /* update starting sequence number for subsequent ADDBA request */
  1088. INCR(tid->seq_start, IEEE80211_SEQ_MAX);
  1089. bf->bf_nframes = 1;
  1090. bf->bf_lastbf = bf;
  1091. ath_buf_set_rate(sc, bf);
  1092. ath_tx_txqaddbuf(sc, txq, bf_head);
  1093. TX_STAT_INC(txq->axq_qnum, queued);
  1094. }
  1095. static void ath_tx_send_normal(struct ath_softc *sc, struct ath_txq *txq,
  1096. struct list_head *bf_head)
  1097. {
  1098. struct ath_buf *bf;
  1099. bf = list_first_entry(bf_head, struct ath_buf, list);
  1100. bf->bf_lastbf = bf;
  1101. bf->bf_nframes = 1;
  1102. ath_buf_set_rate(sc, bf);
  1103. ath_tx_txqaddbuf(sc, txq, bf_head);
  1104. TX_STAT_INC(txq->axq_qnum, queued);
  1105. }
  1106. static enum ath9k_pkt_type get_hw_packet_type(struct sk_buff *skb)
  1107. {
  1108. struct ieee80211_hdr *hdr;
  1109. enum ath9k_pkt_type htype;
  1110. __le16 fc;
  1111. hdr = (struct ieee80211_hdr *)skb->data;
  1112. fc = hdr->frame_control;
  1113. if (ieee80211_is_beacon(fc))
  1114. htype = ATH9K_PKT_TYPE_BEACON;
  1115. else if (ieee80211_is_probe_resp(fc))
  1116. htype = ATH9K_PKT_TYPE_PROBE_RESP;
  1117. else if (ieee80211_is_atim(fc))
  1118. htype = ATH9K_PKT_TYPE_ATIM;
  1119. else if (ieee80211_is_pspoll(fc))
  1120. htype = ATH9K_PKT_TYPE_PSPOLL;
  1121. else
  1122. htype = ATH9K_PKT_TYPE_NORMAL;
  1123. return htype;
  1124. }
  1125. static int get_hw_crypto_keytype(struct sk_buff *skb)
  1126. {
  1127. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1128. if (tx_info->control.hw_key) {
  1129. if (tx_info->control.hw_key->alg == ALG_WEP)
  1130. return ATH9K_KEY_TYPE_WEP;
  1131. else if (tx_info->control.hw_key->alg == ALG_TKIP)
  1132. return ATH9K_KEY_TYPE_TKIP;
  1133. else if (tx_info->control.hw_key->alg == ALG_CCMP)
  1134. return ATH9K_KEY_TYPE_AES;
  1135. }
  1136. return ATH9K_KEY_TYPE_CLEAR;
  1137. }
  1138. static void assign_aggr_tid_seqno(struct sk_buff *skb,
  1139. struct ath_buf *bf)
  1140. {
  1141. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1142. struct ieee80211_hdr *hdr;
  1143. struct ath_node *an;
  1144. struct ath_atx_tid *tid;
  1145. __le16 fc;
  1146. u8 *qc;
  1147. if (!tx_info->control.sta)
  1148. return;
  1149. an = (struct ath_node *)tx_info->control.sta->drv_priv;
  1150. hdr = (struct ieee80211_hdr *)skb->data;
  1151. fc = hdr->frame_control;
  1152. if (ieee80211_is_data_qos(fc)) {
  1153. qc = ieee80211_get_qos_ctl(hdr);
  1154. bf->bf_tidno = qc[0] & 0xf;
  1155. }
  1156. /*
  1157. * For HT capable stations, we save tidno for later use.
  1158. * We also override seqno set by upper layer with the one
  1159. * in tx aggregation state.
  1160. */
  1161. tid = ATH_AN_2_TID(an, bf->bf_tidno);
  1162. hdr->seq_ctrl = cpu_to_le16(tid->seq_next << IEEE80211_SEQ_SEQ_SHIFT);
  1163. bf->bf_seqno = tid->seq_next;
  1164. INCR(tid->seq_next, IEEE80211_SEQ_MAX);
  1165. }
  1166. static int setup_tx_flags(struct ath_softc *sc, struct sk_buff *skb,
  1167. struct ath_txq *txq)
  1168. {
  1169. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1170. int flags = 0;
  1171. flags |= ATH9K_TXDESC_CLRDMASK; /* needed for crypto errors */
  1172. flags |= ATH9K_TXDESC_INTREQ;
  1173. if (tx_info->flags & IEEE80211_TX_CTL_NO_ACK)
  1174. flags |= ATH9K_TXDESC_NOACK;
  1175. return flags;
  1176. }
  1177. /*
  1178. * rix - rate index
  1179. * pktlen - total bytes (delims + data + fcs + pads + pad delims)
  1180. * width - 0 for 20 MHz, 1 for 40 MHz
  1181. * half_gi - to use 4us v/s 3.6 us for symbol time
  1182. */
  1183. static u32 ath_pkt_duration(struct ath_softc *sc, u8 rix, struct ath_buf *bf,
  1184. int width, int half_gi, bool shortPreamble)
  1185. {
  1186. u32 nbits, nsymbits, duration, nsymbols;
  1187. int streams, pktlen;
  1188. pktlen = bf_isaggr(bf) ? bf->bf_al : bf->bf_frmlen;
  1189. /* find number of symbols: PLCP + data */
  1190. nbits = (pktlen << 3) + OFDM_PLCP_BITS;
  1191. nsymbits = bits_per_symbol[rix][width];
  1192. nsymbols = (nbits + nsymbits - 1) / nsymbits;
  1193. if (!half_gi)
  1194. duration = SYMBOL_TIME(nsymbols);
  1195. else
  1196. duration = SYMBOL_TIME_HALFGI(nsymbols);
  1197. /* addup duration for legacy/ht training and signal fields */
  1198. streams = HT_RC_2_STREAMS(rix);
  1199. duration += L_STF + L_LTF + L_SIG + HT_SIG + HT_STF + HT_LTF(streams);
  1200. return duration;
  1201. }
  1202. static void ath_buf_set_rate(struct ath_softc *sc, struct ath_buf *bf)
  1203. {
  1204. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1205. struct ath9k_11n_rate_series series[4];
  1206. struct sk_buff *skb;
  1207. struct ieee80211_tx_info *tx_info;
  1208. struct ieee80211_tx_rate *rates;
  1209. const struct ieee80211_rate *rate;
  1210. struct ieee80211_hdr *hdr;
  1211. int i, flags = 0;
  1212. u8 rix = 0, ctsrate = 0;
  1213. bool is_pspoll;
  1214. memset(series, 0, sizeof(struct ath9k_11n_rate_series) * 4);
  1215. skb = bf->bf_mpdu;
  1216. tx_info = IEEE80211_SKB_CB(skb);
  1217. rates = tx_info->control.rates;
  1218. hdr = (struct ieee80211_hdr *)skb->data;
  1219. is_pspoll = ieee80211_is_pspoll(hdr->frame_control);
  1220. /*
  1221. * We check if Short Preamble is needed for the CTS rate by
  1222. * checking the BSS's global flag.
  1223. * But for the rate series, IEEE80211_TX_RC_USE_SHORT_PREAMBLE is used.
  1224. */
  1225. rate = ieee80211_get_rts_cts_rate(sc->hw, tx_info);
  1226. ctsrate = rate->hw_value;
  1227. if (sc->sc_flags & SC_OP_PREAMBLE_SHORT)
  1228. ctsrate |= rate->hw_value_short;
  1229. for (i = 0; i < 4; i++) {
  1230. bool is_40, is_sgi, is_sp;
  1231. int phy;
  1232. if (!rates[i].count || (rates[i].idx < 0))
  1233. continue;
  1234. rix = rates[i].idx;
  1235. series[i].Tries = rates[i].count;
  1236. series[i].ChSel = common->tx_chainmask;
  1237. if ((sc->config.ath_aggr_prot && bf_isaggr(bf)) ||
  1238. (rates[i].flags & IEEE80211_TX_RC_USE_RTS_CTS)) {
  1239. series[i].RateFlags |= ATH9K_RATESERIES_RTS_CTS;
  1240. flags |= ATH9K_TXDESC_RTSENA;
  1241. } else if (rates[i].flags & IEEE80211_TX_RC_USE_CTS_PROTECT) {
  1242. series[i].RateFlags |= ATH9K_RATESERIES_RTS_CTS;
  1243. flags |= ATH9K_TXDESC_CTSENA;
  1244. }
  1245. if (rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH)
  1246. series[i].RateFlags |= ATH9K_RATESERIES_2040;
  1247. if (rates[i].flags & IEEE80211_TX_RC_SHORT_GI)
  1248. series[i].RateFlags |= ATH9K_RATESERIES_HALFGI;
  1249. is_sgi = !!(rates[i].flags & IEEE80211_TX_RC_SHORT_GI);
  1250. is_40 = !!(rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH);
  1251. is_sp = !!(rates[i].flags & IEEE80211_TX_RC_USE_SHORT_PREAMBLE);
  1252. if (rates[i].flags & IEEE80211_TX_RC_MCS) {
  1253. /* MCS rates */
  1254. series[i].Rate = rix | 0x80;
  1255. series[i].PktDuration = ath_pkt_duration(sc, rix, bf,
  1256. is_40, is_sgi, is_sp);
  1257. continue;
  1258. }
  1259. /* legcay rates */
  1260. if ((tx_info->band == IEEE80211_BAND_2GHZ) &&
  1261. !(rate->flags & IEEE80211_RATE_ERP_G))
  1262. phy = WLAN_RC_PHY_CCK;
  1263. else
  1264. phy = WLAN_RC_PHY_OFDM;
  1265. rate = &sc->sbands[tx_info->band].bitrates[rates[i].idx];
  1266. series[i].Rate = rate->hw_value;
  1267. if (rate->hw_value_short) {
  1268. if (rates[i].flags & IEEE80211_TX_RC_USE_SHORT_PREAMBLE)
  1269. series[i].Rate |= rate->hw_value_short;
  1270. } else {
  1271. is_sp = false;
  1272. }
  1273. series[i].PktDuration = ath9k_hw_computetxtime(sc->sc_ah,
  1274. phy, rate->bitrate * 100, bf->bf_frmlen, rix, is_sp);
  1275. }
  1276. /* For AR5416 - RTS cannot be followed by a frame larger than 8K */
  1277. if (bf_isaggr(bf) && (bf->bf_al > sc->sc_ah->caps.rts_aggr_limit))
  1278. flags &= ~ATH9K_TXDESC_RTSENA;
  1279. /* ATH9K_TXDESC_RTSENA and ATH9K_TXDESC_CTSENA are mutually exclusive. */
  1280. if (flags & ATH9K_TXDESC_RTSENA)
  1281. flags &= ~ATH9K_TXDESC_CTSENA;
  1282. /* set dur_update_en for l-sig computation except for PS-Poll frames */
  1283. ath9k_hw_set11n_ratescenario(sc->sc_ah, bf->bf_desc,
  1284. bf->bf_lastbf->bf_desc,
  1285. !is_pspoll, ctsrate,
  1286. 0, series, 4, flags);
  1287. if (sc->config.ath_aggr_prot && flags)
  1288. ath9k_hw_set11n_burstduration(sc->sc_ah, bf->bf_desc, 8192);
  1289. }
  1290. static int ath_tx_setup_buffer(struct ieee80211_hw *hw, struct ath_buf *bf,
  1291. struct sk_buff *skb,
  1292. struct ath_tx_control *txctl)
  1293. {
  1294. struct ath_wiphy *aphy = hw->priv;
  1295. struct ath_softc *sc = aphy->sc;
  1296. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1297. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1298. int hdrlen;
  1299. __le16 fc;
  1300. int padpos, padsize;
  1301. tx_info->pad[0] = 0;
  1302. switch (txctl->frame_type) {
  1303. case ATH9K_NOT_INTERNAL:
  1304. break;
  1305. case ATH9K_INT_PAUSE:
  1306. tx_info->pad[0] |= ATH_TX_INFO_FRAME_TYPE_PAUSE;
  1307. /* fall through */
  1308. case ATH9K_INT_UNPAUSE:
  1309. tx_info->pad[0] |= ATH_TX_INFO_FRAME_TYPE_INTERNAL;
  1310. break;
  1311. }
  1312. hdrlen = ieee80211_get_hdrlen_from_skb(skb);
  1313. fc = hdr->frame_control;
  1314. ATH_TXBUF_RESET(bf);
  1315. bf->aphy = aphy;
  1316. bf->bf_frmlen = skb->len + FCS_LEN;
  1317. /* Remove the padding size from bf_frmlen, if any */
  1318. padpos = ath9k_cmn_padpos(hdr->frame_control);
  1319. padsize = padpos & 3;
  1320. if (padsize && skb->len>padpos+padsize) {
  1321. bf->bf_frmlen -= padsize;
  1322. }
  1323. if (conf_is_ht(&hw->conf))
  1324. bf->bf_state.bf_type |= BUF_HT;
  1325. bf->bf_flags = setup_tx_flags(sc, skb, txctl->txq);
  1326. bf->bf_keytype = get_hw_crypto_keytype(skb);
  1327. if (bf->bf_keytype != ATH9K_KEY_TYPE_CLEAR) {
  1328. bf->bf_frmlen += tx_info->control.hw_key->icv_len;
  1329. bf->bf_keyix = tx_info->control.hw_key->hw_key_idx;
  1330. } else {
  1331. bf->bf_keyix = ATH9K_TXKEYIX_INVALID;
  1332. }
  1333. if (ieee80211_is_data_qos(fc) && bf_isht(bf) &&
  1334. (sc->sc_flags & SC_OP_TXAGGR))
  1335. assign_aggr_tid_seqno(skb, bf);
  1336. bf->bf_mpdu = skb;
  1337. bf->bf_dmacontext = dma_map_single(sc->dev, skb->data,
  1338. skb->len, DMA_TO_DEVICE);
  1339. if (unlikely(dma_mapping_error(sc->dev, bf->bf_dmacontext))) {
  1340. bf->bf_mpdu = NULL;
  1341. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_FATAL,
  1342. "dma_mapping_error() on TX\n");
  1343. return -ENOMEM;
  1344. }
  1345. bf->bf_buf_addr = bf->bf_dmacontext;
  1346. /* tag if this is a nullfunc frame to enable PS when AP acks it */
  1347. if (ieee80211_is_nullfunc(fc) && ieee80211_has_pm(fc)) {
  1348. bf->bf_isnullfunc = true;
  1349. sc->ps_flags &= ~PS_NULLFUNC_COMPLETED;
  1350. } else
  1351. bf->bf_isnullfunc = false;
  1352. return 0;
  1353. }
  1354. /* FIXME: tx power */
  1355. static void ath_tx_start_dma(struct ath_softc *sc, struct ath_buf *bf,
  1356. struct ath_tx_control *txctl)
  1357. {
  1358. struct sk_buff *skb = bf->bf_mpdu;
  1359. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1360. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1361. struct ath_node *an = NULL;
  1362. struct list_head bf_head;
  1363. struct ath_desc *ds;
  1364. struct ath_atx_tid *tid;
  1365. struct ath_hw *ah = sc->sc_ah;
  1366. int frm_type;
  1367. __le16 fc;
  1368. frm_type = get_hw_packet_type(skb);
  1369. fc = hdr->frame_control;
  1370. INIT_LIST_HEAD(&bf_head);
  1371. list_add_tail(&bf->list, &bf_head);
  1372. ds = bf->bf_desc;
  1373. ds->ds_link = 0;
  1374. ds->ds_data = bf->bf_buf_addr;
  1375. ath9k_hw_set11n_txdesc(ah, ds, bf->bf_frmlen, frm_type, MAX_RATE_POWER,
  1376. bf->bf_keyix, bf->bf_keytype, bf->bf_flags);
  1377. ath9k_hw_filltxdesc(ah, ds,
  1378. skb->len, /* segment length */
  1379. true, /* first segment */
  1380. true, /* last segment */
  1381. ds); /* first descriptor */
  1382. spin_lock_bh(&txctl->txq->axq_lock);
  1383. if (bf_isht(bf) && (sc->sc_flags & SC_OP_TXAGGR) &&
  1384. tx_info->control.sta) {
  1385. an = (struct ath_node *)tx_info->control.sta->drv_priv;
  1386. tid = ATH_AN_2_TID(an, bf->bf_tidno);
  1387. if (!ieee80211_is_data_qos(fc)) {
  1388. ath_tx_send_normal(sc, txctl->txq, &bf_head);
  1389. goto tx_done;
  1390. }
  1391. if (tx_info->flags & IEEE80211_TX_CTL_AMPDU) {
  1392. /*
  1393. * Try aggregation if it's a unicast data frame
  1394. * and the destination is HT capable.
  1395. */
  1396. ath_tx_send_ampdu(sc, tid, &bf_head, txctl);
  1397. } else {
  1398. /*
  1399. * Send this frame as regular when ADDBA
  1400. * exchange is neither complete nor pending.
  1401. */
  1402. ath_tx_send_ht_normal(sc, txctl->txq,
  1403. tid, &bf_head);
  1404. }
  1405. } else {
  1406. ath_tx_send_normal(sc, txctl->txq, &bf_head);
  1407. }
  1408. tx_done:
  1409. spin_unlock_bh(&txctl->txq->axq_lock);
  1410. }
  1411. /* Upon failure caller should free skb */
  1412. int ath_tx_start(struct ieee80211_hw *hw, struct sk_buff *skb,
  1413. struct ath_tx_control *txctl)
  1414. {
  1415. struct ath_wiphy *aphy = hw->priv;
  1416. struct ath_softc *sc = aphy->sc;
  1417. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1418. struct ath_buf *bf;
  1419. int r;
  1420. bf = ath_tx_get_buffer(sc);
  1421. if (!bf) {
  1422. ath_print(common, ATH_DBG_XMIT, "TX buffers are full\n");
  1423. return -1;
  1424. }
  1425. r = ath_tx_setup_buffer(hw, bf, skb, txctl);
  1426. if (unlikely(r)) {
  1427. struct ath_txq *txq = txctl->txq;
  1428. ath_print(common, ATH_DBG_FATAL, "TX mem alloc failure\n");
  1429. /* upon ath_tx_processq() this TX queue will be resumed, we
  1430. * guarantee this will happen by knowing beforehand that
  1431. * we will at least have to run TX completionon one buffer
  1432. * on the queue */
  1433. spin_lock_bh(&txq->axq_lock);
  1434. if (sc->tx.txq[txq->axq_qnum].axq_depth > 1) {
  1435. ath_mac80211_stop_queue(sc, skb_get_queue_mapping(skb));
  1436. txq->stopped = 1;
  1437. }
  1438. spin_unlock_bh(&txq->axq_lock);
  1439. spin_lock_bh(&sc->tx.txbuflock);
  1440. list_add_tail(&bf->list, &sc->tx.txbuf);
  1441. spin_unlock_bh(&sc->tx.txbuflock);
  1442. return r;
  1443. }
  1444. ath_tx_start_dma(sc, bf, txctl);
  1445. return 0;
  1446. }
  1447. void ath_tx_cabq(struct ieee80211_hw *hw, struct sk_buff *skb)
  1448. {
  1449. struct ath_wiphy *aphy = hw->priv;
  1450. struct ath_softc *sc = aphy->sc;
  1451. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1452. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
  1453. int padpos, padsize;
  1454. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  1455. struct ath_tx_control txctl;
  1456. memset(&txctl, 0, sizeof(struct ath_tx_control));
  1457. /*
  1458. * As a temporary workaround, assign seq# here; this will likely need
  1459. * to be cleaned up to work better with Beacon transmission and virtual
  1460. * BSSes.
  1461. */
  1462. if (info->flags & IEEE80211_TX_CTL_ASSIGN_SEQ) {
  1463. if (info->flags & IEEE80211_TX_CTL_FIRST_FRAGMENT)
  1464. sc->tx.seq_no += 0x10;
  1465. hdr->seq_ctrl &= cpu_to_le16(IEEE80211_SCTL_FRAG);
  1466. hdr->seq_ctrl |= cpu_to_le16(sc->tx.seq_no);
  1467. }
  1468. /* Add the padding after the header if this is not already done */
  1469. padpos = ath9k_cmn_padpos(hdr->frame_control);
  1470. padsize = padpos & 3;
  1471. if (padsize && skb->len>padpos) {
  1472. if (skb_headroom(skb) < padsize) {
  1473. ath_print(common, ATH_DBG_XMIT,
  1474. "TX CABQ padding failed\n");
  1475. dev_kfree_skb_any(skb);
  1476. return;
  1477. }
  1478. skb_push(skb, padsize);
  1479. memmove(skb->data, skb->data + padsize, padpos);
  1480. }
  1481. txctl.txq = sc->beacon.cabq;
  1482. ath_print(common, ATH_DBG_XMIT,
  1483. "transmitting CABQ packet, skb: %p\n", skb);
  1484. if (ath_tx_start(hw, skb, &txctl) != 0) {
  1485. ath_print(common, ATH_DBG_XMIT, "CABQ TX failed\n");
  1486. goto exit;
  1487. }
  1488. return;
  1489. exit:
  1490. dev_kfree_skb_any(skb);
  1491. }
  1492. /*****************/
  1493. /* TX Completion */
  1494. /*****************/
  1495. static void ath_tx_complete(struct ath_softc *sc, struct sk_buff *skb,
  1496. struct ath_wiphy *aphy, int tx_flags)
  1497. {
  1498. struct ieee80211_hw *hw = sc->hw;
  1499. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1500. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1501. struct ieee80211_hdr * hdr = (struct ieee80211_hdr *)skb->data;
  1502. int padpos, padsize;
  1503. ath_print(common, ATH_DBG_XMIT, "TX complete: skb: %p\n", skb);
  1504. if (aphy)
  1505. hw = aphy->hw;
  1506. if (tx_flags & ATH_TX_BAR)
  1507. tx_info->flags |= IEEE80211_TX_STAT_AMPDU_NO_BACK;
  1508. if (!(tx_flags & (ATH_TX_ERROR | ATH_TX_XRETRY))) {
  1509. /* Frame was ACKed */
  1510. tx_info->flags |= IEEE80211_TX_STAT_ACK;
  1511. }
  1512. padpos = ath9k_cmn_padpos(hdr->frame_control);
  1513. padsize = padpos & 3;
  1514. if (padsize && skb->len>padpos+padsize) {
  1515. /*
  1516. * Remove MAC header padding before giving the frame back to
  1517. * mac80211.
  1518. */
  1519. memmove(skb->data + padsize, skb->data, padpos);
  1520. skb_pull(skb, padsize);
  1521. }
  1522. if (sc->ps_flags & PS_WAIT_FOR_TX_ACK) {
  1523. sc->ps_flags &= ~PS_WAIT_FOR_TX_ACK;
  1524. ath_print(common, ATH_DBG_PS,
  1525. "Going back to sleep after having "
  1526. "received TX status (0x%lx)\n",
  1527. sc->ps_flags & (PS_WAIT_FOR_BEACON |
  1528. PS_WAIT_FOR_CAB |
  1529. PS_WAIT_FOR_PSPOLL_DATA |
  1530. PS_WAIT_FOR_TX_ACK));
  1531. }
  1532. if (unlikely(tx_info->pad[0] & ATH_TX_INFO_FRAME_TYPE_INTERNAL))
  1533. ath9k_tx_status(hw, skb);
  1534. else
  1535. ieee80211_tx_status(hw, skb);
  1536. }
  1537. static void ath_tx_complete_buf(struct ath_softc *sc, struct ath_buf *bf,
  1538. struct ath_txq *txq,
  1539. struct list_head *bf_q,
  1540. int txok, int sendbar)
  1541. {
  1542. struct sk_buff *skb = bf->bf_mpdu;
  1543. unsigned long flags;
  1544. int tx_flags = 0;
  1545. if (sendbar)
  1546. tx_flags = ATH_TX_BAR;
  1547. if (!txok) {
  1548. tx_flags |= ATH_TX_ERROR;
  1549. if (bf_isxretried(bf))
  1550. tx_flags |= ATH_TX_XRETRY;
  1551. }
  1552. dma_unmap_single(sc->dev, bf->bf_dmacontext, skb->len, DMA_TO_DEVICE);
  1553. ath_tx_complete(sc, skb, bf->aphy, tx_flags);
  1554. ath_debug_stat_tx(sc, txq, bf);
  1555. /*
  1556. * Return the list of ath_buf of this mpdu to free queue
  1557. */
  1558. spin_lock_irqsave(&sc->tx.txbuflock, flags);
  1559. list_splice_tail_init(bf_q, &sc->tx.txbuf);
  1560. spin_unlock_irqrestore(&sc->tx.txbuflock, flags);
  1561. }
  1562. static int ath_tx_num_badfrms(struct ath_softc *sc, struct ath_buf *bf,
  1563. int txok)
  1564. {
  1565. struct ath_buf *bf_last = bf->bf_lastbf;
  1566. struct ath_desc *ds = bf_last->bf_desc;
  1567. u16 seq_st = 0;
  1568. u32 ba[WME_BA_BMP_SIZE >> 5];
  1569. int ba_index;
  1570. int nbad = 0;
  1571. int isaggr = 0;
  1572. if (ds->ds_txstat.ts_flags == ATH9K_TX_SW_ABORTED)
  1573. return 0;
  1574. isaggr = bf_isaggr(bf);
  1575. if (isaggr) {
  1576. seq_st = ATH_DS_BA_SEQ(ds);
  1577. memcpy(ba, ATH_DS_BA_BITMAP(ds), WME_BA_BMP_SIZE >> 3);
  1578. }
  1579. while (bf) {
  1580. ba_index = ATH_BA_INDEX(seq_st, bf->bf_seqno);
  1581. if (!txok || (isaggr && !ATH_BA_ISSET(ba, ba_index)))
  1582. nbad++;
  1583. bf = bf->bf_next;
  1584. }
  1585. return nbad;
  1586. }
  1587. static void ath_tx_rc_status(struct ath_buf *bf, struct ath_desc *ds,
  1588. int nbad, int txok, bool update_rc)
  1589. {
  1590. struct sk_buff *skb = bf->bf_mpdu;
  1591. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1592. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1593. struct ieee80211_hw *hw = bf->aphy->hw;
  1594. u8 i, tx_rateindex;
  1595. if (txok)
  1596. tx_info->status.ack_signal = ds->ds_txstat.ts_rssi;
  1597. tx_rateindex = ds->ds_txstat.ts_rateindex;
  1598. WARN_ON(tx_rateindex >= hw->max_rates);
  1599. if (update_rc)
  1600. tx_info->pad[0] |= ATH_TX_INFO_UPDATE_RC;
  1601. if (ds->ds_txstat.ts_status & ATH9K_TXERR_FILT)
  1602. tx_info->flags |= IEEE80211_TX_STAT_TX_FILTERED;
  1603. if ((ds->ds_txstat.ts_status & ATH9K_TXERR_FILT) == 0 &&
  1604. (bf->bf_flags & ATH9K_TXDESC_NOACK) == 0 && update_rc) {
  1605. if (ieee80211_is_data(hdr->frame_control)) {
  1606. if (ds->ds_txstat.ts_flags &
  1607. (ATH9K_TX_DATA_UNDERRUN | ATH9K_TX_DELIM_UNDERRUN))
  1608. tx_info->pad[0] |= ATH_TX_INFO_UNDERRUN;
  1609. if ((ds->ds_txstat.ts_status & ATH9K_TXERR_XRETRY) ||
  1610. (ds->ds_txstat.ts_status & ATH9K_TXERR_FIFO))
  1611. tx_info->pad[0] |= ATH_TX_INFO_XRETRY;
  1612. tx_info->status.ampdu_len = bf->bf_nframes;
  1613. tx_info->status.ampdu_ack_len = bf->bf_nframes - nbad;
  1614. }
  1615. }
  1616. for (i = tx_rateindex + 1; i < hw->max_rates; i++) {
  1617. tx_info->status.rates[i].count = 0;
  1618. tx_info->status.rates[i].idx = -1;
  1619. }
  1620. tx_info->status.rates[tx_rateindex].count = bf->bf_retries + 1;
  1621. }
  1622. static void ath_wake_mac80211_queue(struct ath_softc *sc, struct ath_txq *txq)
  1623. {
  1624. int qnum;
  1625. spin_lock_bh(&txq->axq_lock);
  1626. if (txq->stopped &&
  1627. sc->tx.txq[txq->axq_qnum].axq_depth <= (ATH_TXBUF - 20)) {
  1628. qnum = ath_get_mac80211_qnum(txq->axq_qnum, sc);
  1629. if (qnum != -1) {
  1630. ath_mac80211_start_queue(sc, qnum);
  1631. txq->stopped = 0;
  1632. }
  1633. }
  1634. spin_unlock_bh(&txq->axq_lock);
  1635. }
  1636. static void ath_tx_processq(struct ath_softc *sc, struct ath_txq *txq)
  1637. {
  1638. struct ath_hw *ah = sc->sc_ah;
  1639. struct ath_common *common = ath9k_hw_common(ah);
  1640. struct ath_buf *bf, *lastbf, *bf_held = NULL;
  1641. struct list_head bf_head;
  1642. struct ath_desc *ds;
  1643. int txok;
  1644. int status;
  1645. ath_print(common, ATH_DBG_QUEUE, "tx queue %d (%x), link %p\n",
  1646. txq->axq_qnum, ath9k_hw_gettxbuf(sc->sc_ah, txq->axq_qnum),
  1647. txq->axq_link);
  1648. for (;;) {
  1649. spin_lock_bh(&txq->axq_lock);
  1650. if (list_empty(&txq->axq_q)) {
  1651. txq->axq_link = NULL;
  1652. spin_unlock_bh(&txq->axq_lock);
  1653. break;
  1654. }
  1655. bf = list_first_entry(&txq->axq_q, struct ath_buf, list);
  1656. /*
  1657. * There is a race condition that a BH gets scheduled
  1658. * after sw writes TxE and before hw re-load the last
  1659. * descriptor to get the newly chained one.
  1660. * Software must keep the last DONE descriptor as a
  1661. * holding descriptor - software does so by marking
  1662. * it with the STALE flag.
  1663. */
  1664. bf_held = NULL;
  1665. if (bf->bf_stale) {
  1666. bf_held = bf;
  1667. if (list_is_last(&bf_held->list, &txq->axq_q)) {
  1668. spin_unlock_bh(&txq->axq_lock);
  1669. break;
  1670. } else {
  1671. bf = list_entry(bf_held->list.next,
  1672. struct ath_buf, list);
  1673. }
  1674. }
  1675. lastbf = bf->bf_lastbf;
  1676. ds = lastbf->bf_desc;
  1677. status = ath9k_hw_txprocdesc(ah, ds);
  1678. if (status == -EINPROGRESS) {
  1679. spin_unlock_bh(&txq->axq_lock);
  1680. break;
  1681. }
  1682. /*
  1683. * We now know the nullfunc frame has been ACKed so we
  1684. * can disable RX.
  1685. */
  1686. if (bf->bf_isnullfunc &&
  1687. (ds->ds_txstat.ts_status & ATH9K_TX_ACKED)) {
  1688. if ((sc->ps_flags & PS_ENABLED))
  1689. ath9k_enable_ps(sc);
  1690. else
  1691. sc->ps_flags |= PS_NULLFUNC_COMPLETED;
  1692. }
  1693. /*
  1694. * Remove ath_buf's of the same transmit unit from txq,
  1695. * however leave the last descriptor back as the holding
  1696. * descriptor for hw.
  1697. */
  1698. lastbf->bf_stale = true;
  1699. INIT_LIST_HEAD(&bf_head);
  1700. if (!list_is_singular(&lastbf->list))
  1701. list_cut_position(&bf_head,
  1702. &txq->axq_q, lastbf->list.prev);
  1703. txq->axq_depth--;
  1704. txok = !(ds->ds_txstat.ts_status & ATH9K_TXERR_MASK);
  1705. txq->axq_tx_inprogress = false;
  1706. spin_unlock_bh(&txq->axq_lock);
  1707. if (bf_held) {
  1708. spin_lock_bh(&sc->tx.txbuflock);
  1709. list_move_tail(&bf_held->list, &sc->tx.txbuf);
  1710. spin_unlock_bh(&sc->tx.txbuflock);
  1711. }
  1712. if (!bf_isampdu(bf)) {
  1713. /*
  1714. * This frame is sent out as a single frame.
  1715. * Use hardware retry status for this frame.
  1716. */
  1717. bf->bf_retries = ds->ds_txstat.ts_longretry;
  1718. if (ds->ds_txstat.ts_status & ATH9K_TXERR_XRETRY)
  1719. bf->bf_state.bf_type |= BUF_XRETRY;
  1720. ath_tx_rc_status(bf, ds, 0, txok, true);
  1721. }
  1722. if (bf_isampdu(bf))
  1723. ath_tx_complete_aggr(sc, txq, bf, &bf_head, txok);
  1724. else
  1725. ath_tx_complete_buf(sc, bf, txq, &bf_head, txok, 0);
  1726. ath_wake_mac80211_queue(sc, txq);
  1727. spin_lock_bh(&txq->axq_lock);
  1728. if (sc->sc_flags & SC_OP_TXAGGR)
  1729. ath_txq_schedule(sc, txq);
  1730. spin_unlock_bh(&txq->axq_lock);
  1731. }
  1732. }
  1733. static void ath_tx_complete_poll_work(struct work_struct *work)
  1734. {
  1735. struct ath_softc *sc = container_of(work, struct ath_softc,
  1736. tx_complete_work.work);
  1737. struct ath_txq *txq;
  1738. int i;
  1739. bool needreset = false;
  1740. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++)
  1741. if (ATH_TXQ_SETUP(sc, i)) {
  1742. txq = &sc->tx.txq[i];
  1743. spin_lock_bh(&txq->axq_lock);
  1744. if (txq->axq_depth) {
  1745. if (txq->axq_tx_inprogress) {
  1746. needreset = true;
  1747. spin_unlock_bh(&txq->axq_lock);
  1748. break;
  1749. } else {
  1750. txq->axq_tx_inprogress = true;
  1751. }
  1752. }
  1753. spin_unlock_bh(&txq->axq_lock);
  1754. }
  1755. if (needreset) {
  1756. ath_print(ath9k_hw_common(sc->sc_ah), ATH_DBG_RESET,
  1757. "tx hung, resetting the chip\n");
  1758. ath9k_ps_wakeup(sc);
  1759. ath_reset(sc, false);
  1760. ath9k_ps_restore(sc);
  1761. }
  1762. ieee80211_queue_delayed_work(sc->hw, &sc->tx_complete_work,
  1763. msecs_to_jiffies(ATH_TX_COMPLETE_POLL_INT));
  1764. }
  1765. void ath_tx_tasklet(struct ath_softc *sc)
  1766. {
  1767. int i;
  1768. u32 qcumask = ((1 << ATH9K_NUM_TX_QUEUES) - 1);
  1769. ath9k_hw_gettxintrtxqs(sc->sc_ah, &qcumask);
  1770. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  1771. if (ATH_TXQ_SETUP(sc, i) && (qcumask & (1 << i)))
  1772. ath_tx_processq(sc, &sc->tx.txq[i]);
  1773. }
  1774. }
  1775. /*****************/
  1776. /* Init, Cleanup */
  1777. /*****************/
  1778. int ath_tx_init(struct ath_softc *sc, int nbufs)
  1779. {
  1780. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1781. int error = 0;
  1782. spin_lock_init(&sc->tx.txbuflock);
  1783. error = ath_descdma_setup(sc, &sc->tx.txdma, &sc->tx.txbuf,
  1784. "tx", nbufs, 1);
  1785. if (error != 0) {
  1786. ath_print(common, ATH_DBG_FATAL,
  1787. "Failed to allocate tx descriptors: %d\n", error);
  1788. goto err;
  1789. }
  1790. error = ath_descdma_setup(sc, &sc->beacon.bdma, &sc->beacon.bbuf,
  1791. "beacon", ATH_BCBUF, 1);
  1792. if (error != 0) {
  1793. ath_print(common, ATH_DBG_FATAL,
  1794. "Failed to allocate beacon descriptors: %d\n", error);
  1795. goto err;
  1796. }
  1797. INIT_DELAYED_WORK(&sc->tx_complete_work, ath_tx_complete_poll_work);
  1798. err:
  1799. if (error != 0)
  1800. ath_tx_cleanup(sc);
  1801. return error;
  1802. }
  1803. void ath_tx_cleanup(struct ath_softc *sc)
  1804. {
  1805. if (sc->beacon.bdma.dd_desc_len != 0)
  1806. ath_descdma_cleanup(sc, &sc->beacon.bdma, &sc->beacon.bbuf);
  1807. if (sc->tx.txdma.dd_desc_len != 0)
  1808. ath_descdma_cleanup(sc, &sc->tx.txdma, &sc->tx.txbuf);
  1809. }
  1810. void ath_tx_node_init(struct ath_softc *sc, struct ath_node *an)
  1811. {
  1812. struct ath_atx_tid *tid;
  1813. struct ath_atx_ac *ac;
  1814. int tidno, acno;
  1815. for (tidno = 0, tid = &an->tid[tidno];
  1816. tidno < WME_NUM_TID;
  1817. tidno++, tid++) {
  1818. tid->an = an;
  1819. tid->tidno = tidno;
  1820. tid->seq_start = tid->seq_next = 0;
  1821. tid->baw_size = WME_MAX_BA;
  1822. tid->baw_head = tid->baw_tail = 0;
  1823. tid->sched = false;
  1824. tid->paused = false;
  1825. tid->state &= ~AGGR_CLEANUP;
  1826. INIT_LIST_HEAD(&tid->buf_q);
  1827. acno = TID_TO_WME_AC(tidno);
  1828. tid->ac = &an->ac[acno];
  1829. tid->state &= ~AGGR_ADDBA_COMPLETE;
  1830. tid->state &= ~AGGR_ADDBA_PROGRESS;
  1831. }
  1832. for (acno = 0, ac = &an->ac[acno];
  1833. acno < WME_NUM_AC; acno++, ac++) {
  1834. ac->sched = false;
  1835. INIT_LIST_HEAD(&ac->tid_q);
  1836. switch (acno) {
  1837. case WME_AC_BE:
  1838. ac->qnum = ath_tx_get_qnum(sc,
  1839. ATH9K_TX_QUEUE_DATA, ATH9K_WME_AC_BE);
  1840. break;
  1841. case WME_AC_BK:
  1842. ac->qnum = ath_tx_get_qnum(sc,
  1843. ATH9K_TX_QUEUE_DATA, ATH9K_WME_AC_BK);
  1844. break;
  1845. case WME_AC_VI:
  1846. ac->qnum = ath_tx_get_qnum(sc,
  1847. ATH9K_TX_QUEUE_DATA, ATH9K_WME_AC_VI);
  1848. break;
  1849. case WME_AC_VO:
  1850. ac->qnum = ath_tx_get_qnum(sc,
  1851. ATH9K_TX_QUEUE_DATA, ATH9K_WME_AC_VO);
  1852. break;
  1853. }
  1854. }
  1855. }
  1856. void ath_tx_node_cleanup(struct ath_softc *sc, struct ath_node *an)
  1857. {
  1858. int i;
  1859. struct ath_atx_ac *ac, *ac_tmp;
  1860. struct ath_atx_tid *tid, *tid_tmp;
  1861. struct ath_txq *txq;
  1862. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  1863. if (ATH_TXQ_SETUP(sc, i)) {
  1864. txq = &sc->tx.txq[i];
  1865. spin_lock_bh(&txq->axq_lock);
  1866. list_for_each_entry_safe(ac,
  1867. ac_tmp, &txq->axq_acq, list) {
  1868. tid = list_first_entry(&ac->tid_q,
  1869. struct ath_atx_tid, list);
  1870. if (tid && tid->an != an)
  1871. continue;
  1872. list_del(&ac->list);
  1873. ac->sched = false;
  1874. list_for_each_entry_safe(tid,
  1875. tid_tmp, &ac->tid_q, list) {
  1876. list_del(&tid->list);
  1877. tid->sched = false;
  1878. ath_tid_drain(sc, txq, tid);
  1879. tid->state &= ~AGGR_ADDBA_COMPLETE;
  1880. tid->state &= ~AGGR_CLEANUP;
  1881. }
  1882. }
  1883. spin_unlock_bh(&txq->axq_lock);
  1884. }
  1885. }
  1886. }