xmit.c 63 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455
  1. /*
  2. * Copyright (c) 2008-2011 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 <linux/dma-mapping.h>
  17. #include "ath9k.h"
  18. #include "ar9003_mac.h"
  19. #define BITS_PER_BYTE 8
  20. #define OFDM_PLCP_BITS 22
  21. #define HT_RC_2_STREAMS(_rc) ((((_rc) & 0x78) >> 3) + 1)
  22. #define L_STF 8
  23. #define L_LTF 8
  24. #define L_SIG 4
  25. #define HT_SIG 8
  26. #define HT_STF 4
  27. #define HT_LTF(_ns) (4 * (_ns))
  28. #define SYMBOL_TIME(_ns) ((_ns) << 2) /* ns * 4 us */
  29. #define SYMBOL_TIME_HALFGI(_ns) (((_ns) * 18 + 4) / 5) /* ns * 3.6 us */
  30. #define NUM_SYMBOLS_PER_USEC(_usec) (_usec >> 2)
  31. #define NUM_SYMBOLS_PER_USEC_HALFGI(_usec) (((_usec*5)-4)/18)
  32. static u16 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. };
  43. #define IS_HT_RATE(_rate) ((_rate) & 0x80)
  44. static void ath_tx_send_normal(struct ath_softc *sc, struct ath_txq *txq,
  45. struct ath_atx_tid *tid, struct sk_buff *skb);
  46. static void ath_tx_complete(struct ath_softc *sc, struct sk_buff *skb,
  47. int tx_flags, struct ath_txq *txq);
  48. static void ath_tx_complete_buf(struct ath_softc *sc, struct ath_buf *bf,
  49. struct ath_txq *txq, struct list_head *bf_q,
  50. struct ath_tx_status *ts, int txok, int sendbar);
  51. static void ath_tx_txqaddbuf(struct ath_softc *sc, struct ath_txq *txq,
  52. struct list_head *head, bool internal);
  53. static void ath_tx_rc_status(struct ath_softc *sc, struct ath_buf *bf,
  54. struct ath_tx_status *ts, int nframes, int nbad,
  55. int txok);
  56. static void ath_tx_update_baw(struct ath_softc *sc, struct ath_atx_tid *tid,
  57. int seqno);
  58. static struct ath_buf *ath_tx_setup_buffer(struct ath_softc *sc,
  59. struct ath_txq *txq,
  60. struct ath_atx_tid *tid,
  61. struct sk_buff *skb);
  62. enum {
  63. MCS_HT20,
  64. MCS_HT20_SGI,
  65. MCS_HT40,
  66. MCS_HT40_SGI,
  67. };
  68. static int ath_max_4ms_framelen[4][32] = {
  69. [MCS_HT20] = {
  70. 3212, 6432, 9648, 12864, 19300, 25736, 28952, 32172,
  71. 6424, 12852, 19280, 25708, 38568, 51424, 57852, 64280,
  72. 9628, 19260, 28896, 38528, 57792, 65532, 65532, 65532,
  73. 12828, 25656, 38488, 51320, 65532, 65532, 65532, 65532,
  74. },
  75. [MCS_HT20_SGI] = {
  76. 3572, 7144, 10720, 14296, 21444, 28596, 32172, 35744,
  77. 7140, 14284, 21428, 28568, 42856, 57144, 64288, 65532,
  78. 10700, 21408, 32112, 42816, 64228, 65532, 65532, 65532,
  79. 14256, 28516, 42780, 57040, 65532, 65532, 65532, 65532,
  80. },
  81. [MCS_HT40] = {
  82. 6680, 13360, 20044, 26724, 40092, 53456, 60140, 65532,
  83. 13348, 26700, 40052, 53400, 65532, 65532, 65532, 65532,
  84. 20004, 40008, 60016, 65532, 65532, 65532, 65532, 65532,
  85. 26644, 53292, 65532, 65532, 65532, 65532, 65532, 65532,
  86. },
  87. [MCS_HT40_SGI] = {
  88. 7420, 14844, 22272, 29696, 44544, 59396, 65532, 65532,
  89. 14832, 29668, 44504, 59340, 65532, 65532, 65532, 65532,
  90. 22232, 44464, 65532, 65532, 65532, 65532, 65532, 65532,
  91. 29616, 59232, 65532, 65532, 65532, 65532, 65532, 65532,
  92. }
  93. };
  94. /*********************/
  95. /* Aggregation logic */
  96. /*********************/
  97. static void ath_tx_queue_tid(struct ath_txq *txq, struct ath_atx_tid *tid)
  98. {
  99. struct ath_atx_ac *ac = tid->ac;
  100. if (tid->paused)
  101. return;
  102. if (tid->sched)
  103. return;
  104. tid->sched = true;
  105. list_add_tail(&tid->list, &ac->tid_q);
  106. if (ac->sched)
  107. return;
  108. ac->sched = true;
  109. list_add_tail(&ac->list, &txq->axq_acq);
  110. }
  111. static void ath_tx_resume_tid(struct ath_softc *sc, struct ath_atx_tid *tid)
  112. {
  113. struct ath_txq *txq = tid->ac->txq;
  114. WARN_ON(!tid->paused);
  115. spin_lock_bh(&txq->axq_lock);
  116. tid->paused = false;
  117. if (skb_queue_empty(&tid->buf_q))
  118. goto unlock;
  119. ath_tx_queue_tid(txq, tid);
  120. ath_txq_schedule(sc, txq);
  121. unlock:
  122. spin_unlock_bh(&txq->axq_lock);
  123. }
  124. static struct ath_frame_info *get_frame_info(struct sk_buff *skb)
  125. {
  126. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  127. BUILD_BUG_ON(sizeof(struct ath_frame_info) >
  128. sizeof(tx_info->rate_driver_data));
  129. return (struct ath_frame_info *) &tx_info->rate_driver_data[0];
  130. }
  131. static void ath_tx_flush_tid(struct ath_softc *sc, struct ath_atx_tid *tid)
  132. {
  133. struct ath_txq *txq = tid->ac->txq;
  134. struct sk_buff *skb;
  135. struct ath_buf *bf;
  136. struct list_head bf_head;
  137. struct ath_tx_status ts;
  138. struct ath_frame_info *fi;
  139. INIT_LIST_HEAD(&bf_head);
  140. memset(&ts, 0, sizeof(ts));
  141. spin_lock_bh(&txq->axq_lock);
  142. while ((skb = __skb_dequeue(&tid->buf_q))) {
  143. fi = get_frame_info(skb);
  144. bf = fi->bf;
  145. spin_unlock_bh(&txq->axq_lock);
  146. if (bf && fi->retries) {
  147. list_add_tail(&bf->list, &bf_head);
  148. ath_tx_update_baw(sc, tid, bf->bf_state.seqno);
  149. ath_tx_complete_buf(sc, bf, txq, &bf_head, &ts, 0, 1);
  150. } else {
  151. ath_tx_send_normal(sc, txq, NULL, skb);
  152. }
  153. spin_lock_bh(&txq->axq_lock);
  154. }
  155. spin_unlock_bh(&txq->axq_lock);
  156. }
  157. static void ath_tx_update_baw(struct ath_softc *sc, struct ath_atx_tid *tid,
  158. int seqno)
  159. {
  160. int index, cindex;
  161. index = ATH_BA_INDEX(tid->seq_start, seqno);
  162. cindex = (tid->baw_head + index) & (ATH_TID_MAX_BUFS - 1);
  163. __clear_bit(cindex, tid->tx_buf);
  164. while (tid->baw_head != tid->baw_tail && !test_bit(tid->baw_head, tid->tx_buf)) {
  165. INCR(tid->seq_start, IEEE80211_SEQ_MAX);
  166. INCR(tid->baw_head, ATH_TID_MAX_BUFS);
  167. }
  168. }
  169. static void ath_tx_addto_baw(struct ath_softc *sc, struct ath_atx_tid *tid,
  170. u16 seqno)
  171. {
  172. int index, cindex;
  173. index = ATH_BA_INDEX(tid->seq_start, seqno);
  174. cindex = (tid->baw_head + index) & (ATH_TID_MAX_BUFS - 1);
  175. __set_bit(cindex, tid->tx_buf);
  176. if (index >= ((tid->baw_tail - tid->baw_head) &
  177. (ATH_TID_MAX_BUFS - 1))) {
  178. tid->baw_tail = cindex;
  179. INCR(tid->baw_tail, ATH_TID_MAX_BUFS);
  180. }
  181. }
  182. /*
  183. * TODO: For frame(s) that are in the retry state, we will reuse the
  184. * sequence number(s) without setting the retry bit. The
  185. * alternative is to give up on these and BAR the receiver's window
  186. * forward.
  187. */
  188. static void ath_tid_drain(struct ath_softc *sc, struct ath_txq *txq,
  189. struct ath_atx_tid *tid)
  190. {
  191. struct sk_buff *skb;
  192. struct ath_buf *bf;
  193. struct list_head bf_head;
  194. struct ath_tx_status ts;
  195. struct ath_frame_info *fi;
  196. memset(&ts, 0, sizeof(ts));
  197. INIT_LIST_HEAD(&bf_head);
  198. while ((skb = __skb_dequeue(&tid->buf_q))) {
  199. fi = get_frame_info(skb);
  200. bf = fi->bf;
  201. if (!bf) {
  202. spin_unlock(&txq->axq_lock);
  203. ath_tx_complete(sc, skb, ATH_TX_ERROR, txq);
  204. spin_lock(&txq->axq_lock);
  205. continue;
  206. }
  207. list_add_tail(&bf->list, &bf_head);
  208. if (fi->retries)
  209. ath_tx_update_baw(sc, tid, bf->bf_state.seqno);
  210. spin_unlock(&txq->axq_lock);
  211. ath_tx_complete_buf(sc, bf, txq, &bf_head, &ts, 0, 0);
  212. spin_lock(&txq->axq_lock);
  213. }
  214. tid->seq_next = tid->seq_start;
  215. tid->baw_tail = tid->baw_head;
  216. }
  217. static void ath_tx_set_retry(struct ath_softc *sc, struct ath_txq *txq,
  218. struct sk_buff *skb)
  219. {
  220. struct ath_frame_info *fi = get_frame_info(skb);
  221. struct ath_buf *bf = fi->bf;
  222. struct ieee80211_hdr *hdr;
  223. TX_STAT_INC(txq->axq_qnum, a_retries);
  224. if (fi->retries++ > 0)
  225. return;
  226. hdr = (struct ieee80211_hdr *)skb->data;
  227. hdr->frame_control |= cpu_to_le16(IEEE80211_FCTL_RETRY);
  228. dma_sync_single_for_device(sc->dev, bf->bf_buf_addr,
  229. sizeof(*hdr), DMA_TO_DEVICE);
  230. }
  231. static struct ath_buf *ath_tx_get_buffer(struct ath_softc *sc)
  232. {
  233. struct ath_buf *bf = NULL;
  234. spin_lock_bh(&sc->tx.txbuflock);
  235. if (unlikely(list_empty(&sc->tx.txbuf))) {
  236. spin_unlock_bh(&sc->tx.txbuflock);
  237. return NULL;
  238. }
  239. bf = list_first_entry(&sc->tx.txbuf, struct ath_buf, list);
  240. list_del(&bf->list);
  241. spin_unlock_bh(&sc->tx.txbuflock);
  242. return bf;
  243. }
  244. static void ath_tx_return_buffer(struct ath_softc *sc, struct ath_buf *bf)
  245. {
  246. spin_lock_bh(&sc->tx.txbuflock);
  247. list_add_tail(&bf->list, &sc->tx.txbuf);
  248. spin_unlock_bh(&sc->tx.txbuflock);
  249. }
  250. static struct ath_buf* ath_clone_txbuf(struct ath_softc *sc, struct ath_buf *bf)
  251. {
  252. struct ath_buf *tbf;
  253. tbf = ath_tx_get_buffer(sc);
  254. if (WARN_ON(!tbf))
  255. return NULL;
  256. ATH_TXBUF_RESET(tbf);
  257. tbf->bf_mpdu = bf->bf_mpdu;
  258. tbf->bf_buf_addr = bf->bf_buf_addr;
  259. memcpy(tbf->bf_desc, bf->bf_desc, sc->sc_ah->caps.tx_desc_len);
  260. tbf->bf_state = bf->bf_state;
  261. return tbf;
  262. }
  263. static void ath_tx_count_frames(struct ath_softc *sc, struct ath_buf *bf,
  264. struct ath_tx_status *ts, int txok,
  265. int *nframes, int *nbad)
  266. {
  267. struct ath_frame_info *fi;
  268. u16 seq_st = 0;
  269. u32 ba[WME_BA_BMP_SIZE >> 5];
  270. int ba_index;
  271. int isaggr = 0;
  272. *nbad = 0;
  273. *nframes = 0;
  274. isaggr = bf_isaggr(bf);
  275. if (isaggr) {
  276. seq_st = ts->ts_seqnum;
  277. memcpy(ba, &ts->ba_low, WME_BA_BMP_SIZE >> 3);
  278. }
  279. while (bf) {
  280. fi = get_frame_info(bf->bf_mpdu);
  281. ba_index = ATH_BA_INDEX(seq_st, bf->bf_state.seqno);
  282. (*nframes)++;
  283. if (!txok || (isaggr && !ATH_BA_ISSET(ba, ba_index)))
  284. (*nbad)++;
  285. bf = bf->bf_next;
  286. }
  287. }
  288. static void ath_tx_complete_aggr(struct ath_softc *sc, struct ath_txq *txq,
  289. struct ath_buf *bf, struct list_head *bf_q,
  290. struct ath_tx_status *ts, int txok, bool retry)
  291. {
  292. struct ath_node *an = NULL;
  293. struct sk_buff *skb;
  294. struct ieee80211_sta *sta;
  295. struct ieee80211_hw *hw = sc->hw;
  296. struct ieee80211_hdr *hdr;
  297. struct ieee80211_tx_info *tx_info;
  298. struct ath_atx_tid *tid = NULL;
  299. struct ath_buf *bf_next, *bf_last = bf->bf_lastbf;
  300. struct list_head bf_head;
  301. struct sk_buff_head bf_pending;
  302. u16 seq_st = 0, acked_cnt = 0, txfail_cnt = 0;
  303. u32 ba[WME_BA_BMP_SIZE >> 5];
  304. int isaggr, txfail, txpending, sendbar = 0, needreset = 0, nbad = 0;
  305. bool rc_update = true;
  306. struct ieee80211_tx_rate rates[4];
  307. struct ath_frame_info *fi;
  308. int nframes;
  309. u8 tidno;
  310. bool flush = !!(ts->ts_status & ATH9K_TX_FLUSH);
  311. skb = bf->bf_mpdu;
  312. hdr = (struct ieee80211_hdr *)skb->data;
  313. tx_info = IEEE80211_SKB_CB(skb);
  314. memcpy(rates, tx_info->control.rates, sizeof(rates));
  315. rcu_read_lock();
  316. sta = ieee80211_find_sta_by_ifaddr(hw, hdr->addr1, hdr->addr2);
  317. if (!sta) {
  318. rcu_read_unlock();
  319. INIT_LIST_HEAD(&bf_head);
  320. while (bf) {
  321. bf_next = bf->bf_next;
  322. if (!bf->bf_stale || bf_next != NULL)
  323. list_move_tail(&bf->list, &bf_head);
  324. ath_tx_complete_buf(sc, bf, txq, &bf_head, ts,
  325. 0, 0);
  326. bf = bf_next;
  327. }
  328. return;
  329. }
  330. an = (struct ath_node *)sta->drv_priv;
  331. tidno = ieee80211_get_qos_ctl(hdr)[0] & IEEE80211_QOS_CTL_TID_MASK;
  332. tid = ATH_AN_2_TID(an, tidno);
  333. /*
  334. * The hardware occasionally sends a tx status for the wrong TID.
  335. * In this case, the BA status cannot be considered valid and all
  336. * subframes need to be retransmitted
  337. */
  338. if (tidno != ts->tid)
  339. txok = false;
  340. isaggr = bf_isaggr(bf);
  341. memset(ba, 0, WME_BA_BMP_SIZE >> 3);
  342. if (isaggr && txok) {
  343. if (ts->ts_flags & ATH9K_TX_BA) {
  344. seq_st = ts->ts_seqnum;
  345. memcpy(ba, &ts->ba_low, WME_BA_BMP_SIZE >> 3);
  346. } else {
  347. /*
  348. * AR5416 can become deaf/mute when BA
  349. * issue happens. Chip needs to be reset.
  350. * But AP code may have sychronization issues
  351. * when perform internal reset in this routine.
  352. * Only enable reset in STA mode for now.
  353. */
  354. if (sc->sc_ah->opmode == NL80211_IFTYPE_STATION)
  355. needreset = 1;
  356. }
  357. }
  358. __skb_queue_head_init(&bf_pending);
  359. ath_tx_count_frames(sc, bf, ts, txok, &nframes, &nbad);
  360. while (bf) {
  361. u16 seqno = bf->bf_state.seqno;
  362. txfail = txpending = sendbar = 0;
  363. bf_next = bf->bf_next;
  364. skb = bf->bf_mpdu;
  365. tx_info = IEEE80211_SKB_CB(skb);
  366. fi = get_frame_info(skb);
  367. if (ATH_BA_ISSET(ba, ATH_BA_INDEX(seq_st, seqno))) {
  368. /* transmit completion, subframe is
  369. * acked by block ack */
  370. acked_cnt++;
  371. } else if (!isaggr && txok) {
  372. /* transmit completion */
  373. acked_cnt++;
  374. } else {
  375. if ((tid->state & AGGR_CLEANUP) || !retry) {
  376. /*
  377. * cleanup in progress, just fail
  378. * the un-acked sub-frames
  379. */
  380. txfail = 1;
  381. } else if (flush) {
  382. txpending = 1;
  383. } else if (fi->retries < ATH_MAX_SW_RETRIES) {
  384. if (txok || !an->sleeping)
  385. ath_tx_set_retry(sc, txq, bf->bf_mpdu);
  386. txpending = 1;
  387. } else {
  388. txfail = 1;
  389. sendbar = 1;
  390. txfail_cnt++;
  391. }
  392. }
  393. /*
  394. * Make sure the last desc is reclaimed if it
  395. * not a holding desc.
  396. */
  397. INIT_LIST_HEAD(&bf_head);
  398. if ((sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA) ||
  399. bf_next != NULL || !bf_last->bf_stale)
  400. list_move_tail(&bf->list, &bf_head);
  401. if (!txpending || (tid->state & AGGR_CLEANUP)) {
  402. /*
  403. * complete the acked-ones/xretried ones; update
  404. * block-ack window
  405. */
  406. spin_lock_bh(&txq->axq_lock);
  407. ath_tx_update_baw(sc, tid, seqno);
  408. spin_unlock_bh(&txq->axq_lock);
  409. if (rc_update && (acked_cnt == 1 || txfail_cnt == 1)) {
  410. memcpy(tx_info->control.rates, rates, sizeof(rates));
  411. ath_tx_rc_status(sc, bf, ts, nframes, nbad, txok);
  412. rc_update = false;
  413. }
  414. ath_tx_complete_buf(sc, bf, txq, &bf_head, ts,
  415. !txfail, sendbar);
  416. } else {
  417. /* retry the un-acked ones */
  418. if (!(sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA)) {
  419. if (bf->bf_next == NULL && bf_last->bf_stale) {
  420. struct ath_buf *tbf;
  421. tbf = ath_clone_txbuf(sc, bf_last);
  422. /*
  423. * Update tx baw and complete the
  424. * frame with failed status if we
  425. * run out of tx buf.
  426. */
  427. if (!tbf) {
  428. spin_lock_bh(&txq->axq_lock);
  429. ath_tx_update_baw(sc, tid, seqno);
  430. spin_unlock_bh(&txq->axq_lock);
  431. ath_tx_complete_buf(sc, bf, txq,
  432. &bf_head,
  433. ts, 0,
  434. !flush);
  435. break;
  436. }
  437. fi->bf = tbf;
  438. }
  439. }
  440. /*
  441. * Put this buffer to the temporary pending
  442. * queue to retain ordering
  443. */
  444. __skb_queue_tail(&bf_pending, skb);
  445. }
  446. bf = bf_next;
  447. }
  448. /* prepend un-acked frames to the beginning of the pending frame queue */
  449. if (!skb_queue_empty(&bf_pending)) {
  450. if (an->sleeping)
  451. ieee80211_sta_set_buffered(sta, tid->tidno, true);
  452. spin_lock_bh(&txq->axq_lock);
  453. skb_queue_splice(&bf_pending, &tid->buf_q);
  454. if (!an->sleeping) {
  455. ath_tx_queue_tid(txq, tid);
  456. if (ts->ts_status & ATH9K_TXERR_FILT)
  457. tid->ac->clear_ps_filter = true;
  458. }
  459. spin_unlock_bh(&txq->axq_lock);
  460. }
  461. if (tid->state & AGGR_CLEANUP) {
  462. ath_tx_flush_tid(sc, tid);
  463. if (tid->baw_head == tid->baw_tail) {
  464. tid->state &= ~AGGR_ADDBA_COMPLETE;
  465. tid->state &= ~AGGR_CLEANUP;
  466. }
  467. }
  468. rcu_read_unlock();
  469. if (needreset) {
  470. RESET_STAT_INC(sc, RESET_TYPE_TX_ERROR);
  471. ieee80211_queue_work(sc->hw, &sc->hw_reset_work);
  472. }
  473. }
  474. static bool ath_lookup_legacy(struct ath_buf *bf)
  475. {
  476. struct sk_buff *skb;
  477. struct ieee80211_tx_info *tx_info;
  478. struct ieee80211_tx_rate *rates;
  479. int i;
  480. skb = bf->bf_mpdu;
  481. tx_info = IEEE80211_SKB_CB(skb);
  482. rates = tx_info->control.rates;
  483. for (i = 0; i < 4; i++) {
  484. if (!rates[i].count || rates[i].idx < 0)
  485. break;
  486. if (!(rates[i].flags & IEEE80211_TX_RC_MCS))
  487. return true;
  488. }
  489. return false;
  490. }
  491. static u32 ath_lookup_rate(struct ath_softc *sc, struct ath_buf *bf,
  492. struct ath_atx_tid *tid)
  493. {
  494. struct sk_buff *skb;
  495. struct ieee80211_tx_info *tx_info;
  496. struct ieee80211_tx_rate *rates;
  497. struct ath_mci_profile *mci = &sc->btcoex.mci;
  498. u32 max_4ms_framelen, frmlen;
  499. u16 aggr_limit, legacy = 0;
  500. int i;
  501. skb = bf->bf_mpdu;
  502. tx_info = IEEE80211_SKB_CB(skb);
  503. rates = tx_info->control.rates;
  504. /*
  505. * Find the lowest frame length among the rate series that will have a
  506. * 4ms transmit duration.
  507. * TODO - TXOP limit needs to be considered.
  508. */
  509. max_4ms_framelen = ATH_AMPDU_LIMIT_MAX;
  510. for (i = 0; i < 4; i++) {
  511. if (rates[i].count) {
  512. int modeidx;
  513. if (!(rates[i].flags & IEEE80211_TX_RC_MCS)) {
  514. legacy = 1;
  515. break;
  516. }
  517. if (rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH)
  518. modeidx = MCS_HT40;
  519. else
  520. modeidx = MCS_HT20;
  521. if (rates[i].flags & IEEE80211_TX_RC_SHORT_GI)
  522. modeidx++;
  523. frmlen = ath_max_4ms_framelen[modeidx][rates[i].idx];
  524. max_4ms_framelen = min(max_4ms_framelen, frmlen);
  525. }
  526. }
  527. /*
  528. * limit aggregate size by the minimum rate if rate selected is
  529. * not a probe rate, if rate selected is a probe rate then
  530. * avoid aggregation of this packet.
  531. */
  532. if (tx_info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE || legacy)
  533. return 0;
  534. if ((sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_MCI) && mci->aggr_limit)
  535. aggr_limit = (max_4ms_framelen * mci->aggr_limit) >> 4;
  536. else if (sc->sc_flags & SC_OP_BT_PRIORITY_DETECTED)
  537. aggr_limit = min((max_4ms_framelen * 3) / 8,
  538. (u32)ATH_AMPDU_LIMIT_MAX);
  539. else
  540. aggr_limit = min(max_4ms_framelen,
  541. (u32)ATH_AMPDU_LIMIT_MAX);
  542. /*
  543. * h/w can accept aggregates up to 16 bit lengths (65535).
  544. * The IE, however can hold up to 65536, which shows up here
  545. * as zero. Ignore 65536 since we are constrained by hw.
  546. */
  547. if (tid->an->maxampdu)
  548. aggr_limit = min(aggr_limit, tid->an->maxampdu);
  549. return aggr_limit;
  550. }
  551. /*
  552. * Returns the number of delimiters to be added to
  553. * meet the minimum required mpdudensity.
  554. */
  555. static int ath_compute_num_delims(struct ath_softc *sc, struct ath_atx_tid *tid,
  556. struct ath_buf *bf, u16 frmlen,
  557. bool first_subfrm)
  558. {
  559. #define FIRST_DESC_NDELIMS 60
  560. struct sk_buff *skb = bf->bf_mpdu;
  561. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  562. u32 nsymbits, nsymbols;
  563. u16 minlen;
  564. u8 flags, rix;
  565. int width, streams, half_gi, ndelim, mindelim;
  566. struct ath_frame_info *fi = get_frame_info(bf->bf_mpdu);
  567. /* Select standard number of delimiters based on frame length alone */
  568. ndelim = ATH_AGGR_GET_NDELIM(frmlen);
  569. /*
  570. * If encryption enabled, hardware requires some more padding between
  571. * subframes.
  572. * TODO - this could be improved to be dependent on the rate.
  573. * The hardware can keep up at lower rates, but not higher rates
  574. */
  575. if ((fi->keyix != ATH9K_TXKEYIX_INVALID) &&
  576. !(sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA))
  577. ndelim += ATH_AGGR_ENCRYPTDELIM;
  578. /*
  579. * Add delimiter when using RTS/CTS with aggregation
  580. * and non enterprise AR9003 card
  581. */
  582. if (first_subfrm && !AR_SREV_9580_10_OR_LATER(sc->sc_ah) &&
  583. (sc->sc_ah->ent_mode & AR_ENT_OTP_MIN_PKT_SIZE_DISABLE))
  584. ndelim = max(ndelim, FIRST_DESC_NDELIMS);
  585. /*
  586. * Convert desired mpdu density from microeconds to bytes based
  587. * on highest rate in rate series (i.e. first rate) to determine
  588. * required minimum length for subframe. Take into account
  589. * whether high rate is 20 or 40Mhz and half or full GI.
  590. *
  591. * If there is no mpdu density restriction, no further calculation
  592. * is needed.
  593. */
  594. if (tid->an->mpdudensity == 0)
  595. return ndelim;
  596. rix = tx_info->control.rates[0].idx;
  597. flags = tx_info->control.rates[0].flags;
  598. width = (flags & IEEE80211_TX_RC_40_MHZ_WIDTH) ? 1 : 0;
  599. half_gi = (flags & IEEE80211_TX_RC_SHORT_GI) ? 1 : 0;
  600. if (half_gi)
  601. nsymbols = NUM_SYMBOLS_PER_USEC_HALFGI(tid->an->mpdudensity);
  602. else
  603. nsymbols = NUM_SYMBOLS_PER_USEC(tid->an->mpdudensity);
  604. if (nsymbols == 0)
  605. nsymbols = 1;
  606. streams = HT_RC_2_STREAMS(rix);
  607. nsymbits = bits_per_symbol[rix % 8][width] * streams;
  608. minlen = (nsymbols * nsymbits) / BITS_PER_BYTE;
  609. if (frmlen < minlen) {
  610. mindelim = (minlen - frmlen) / ATH_AGGR_DELIM_SZ;
  611. ndelim = max(mindelim, ndelim);
  612. }
  613. return ndelim;
  614. }
  615. static enum ATH_AGGR_STATUS ath_tx_form_aggr(struct ath_softc *sc,
  616. struct ath_txq *txq,
  617. struct ath_atx_tid *tid,
  618. struct list_head *bf_q,
  619. int *aggr_len)
  620. {
  621. #define PADBYTES(_len) ((4 - ((_len) % 4)) % 4)
  622. struct ath_buf *bf, *bf_first = NULL, *bf_prev = NULL;
  623. int rl = 0, nframes = 0, ndelim, prev_al = 0;
  624. u16 aggr_limit = 0, al = 0, bpad = 0,
  625. al_delta, h_baw = tid->baw_size / 2;
  626. enum ATH_AGGR_STATUS status = ATH_AGGR_DONE;
  627. struct ieee80211_tx_info *tx_info;
  628. struct ath_frame_info *fi;
  629. struct sk_buff *skb;
  630. u16 seqno;
  631. do {
  632. skb = skb_peek(&tid->buf_q);
  633. fi = get_frame_info(skb);
  634. bf = fi->bf;
  635. if (!fi->bf)
  636. bf = ath_tx_setup_buffer(sc, txq, tid, skb);
  637. if (!bf)
  638. continue;
  639. bf->bf_state.bf_type = BUF_AMPDU | BUF_AGGR;
  640. seqno = bf->bf_state.seqno;
  641. if (!bf_first)
  642. bf_first = bf;
  643. /* do not step over block-ack window */
  644. if (!BAW_WITHIN(tid->seq_start, tid->baw_size, seqno)) {
  645. status = ATH_AGGR_BAW_CLOSED;
  646. break;
  647. }
  648. if (!rl) {
  649. aggr_limit = ath_lookup_rate(sc, bf, tid);
  650. rl = 1;
  651. }
  652. /* do not exceed aggregation limit */
  653. al_delta = ATH_AGGR_DELIM_SZ + fi->framelen;
  654. if (nframes &&
  655. ((aggr_limit < (al + bpad + al_delta + prev_al)) ||
  656. ath_lookup_legacy(bf))) {
  657. status = ATH_AGGR_LIMITED;
  658. break;
  659. }
  660. tx_info = IEEE80211_SKB_CB(bf->bf_mpdu);
  661. if (nframes && (tx_info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE))
  662. break;
  663. /* do not exceed subframe limit */
  664. if (nframes >= min((int)h_baw, ATH_AMPDU_SUBFRAME_DEFAULT)) {
  665. status = ATH_AGGR_LIMITED;
  666. break;
  667. }
  668. /* add padding for previous frame to aggregation length */
  669. al += bpad + al_delta;
  670. /*
  671. * Get the delimiters needed to meet the MPDU
  672. * density for this node.
  673. */
  674. ndelim = ath_compute_num_delims(sc, tid, bf_first, fi->framelen,
  675. !nframes);
  676. bpad = PADBYTES(al_delta) + (ndelim << 2);
  677. nframes++;
  678. bf->bf_next = NULL;
  679. /* link buffers of this frame to the aggregate */
  680. if (!fi->retries)
  681. ath_tx_addto_baw(sc, tid, seqno);
  682. bf->bf_state.ndelim = ndelim;
  683. __skb_unlink(skb, &tid->buf_q);
  684. list_add_tail(&bf->list, bf_q);
  685. if (bf_prev)
  686. bf_prev->bf_next = bf;
  687. bf_prev = bf;
  688. } while (!skb_queue_empty(&tid->buf_q));
  689. *aggr_len = al;
  690. return status;
  691. #undef PADBYTES
  692. }
  693. /*
  694. * rix - rate index
  695. * pktlen - total bytes (delims + data + fcs + pads + pad delims)
  696. * width - 0 for 20 MHz, 1 for 40 MHz
  697. * half_gi - to use 4us v/s 3.6 us for symbol time
  698. */
  699. static u32 ath_pkt_duration(struct ath_softc *sc, u8 rix, int pktlen,
  700. int width, int half_gi, bool shortPreamble)
  701. {
  702. u32 nbits, nsymbits, duration, nsymbols;
  703. int streams;
  704. /* find number of symbols: PLCP + data */
  705. streams = HT_RC_2_STREAMS(rix);
  706. nbits = (pktlen << 3) + OFDM_PLCP_BITS;
  707. nsymbits = bits_per_symbol[rix % 8][width] * streams;
  708. nsymbols = (nbits + nsymbits - 1) / nsymbits;
  709. if (!half_gi)
  710. duration = SYMBOL_TIME(nsymbols);
  711. else
  712. duration = SYMBOL_TIME_HALFGI(nsymbols);
  713. /* addup duration for legacy/ht training and signal fields */
  714. duration += L_STF + L_LTF + L_SIG + HT_SIG + HT_STF + HT_LTF(streams);
  715. return duration;
  716. }
  717. static void ath_buf_set_rate(struct ath_softc *sc, struct ath_buf *bf,
  718. struct ath_tx_info *info, int len)
  719. {
  720. struct ath_hw *ah = sc->sc_ah;
  721. struct sk_buff *skb;
  722. struct ieee80211_tx_info *tx_info;
  723. struct ieee80211_tx_rate *rates;
  724. const struct ieee80211_rate *rate;
  725. struct ieee80211_hdr *hdr;
  726. int i;
  727. u8 rix = 0;
  728. skb = bf->bf_mpdu;
  729. tx_info = IEEE80211_SKB_CB(skb);
  730. rates = tx_info->control.rates;
  731. hdr = (struct ieee80211_hdr *)skb->data;
  732. /* set dur_update_en for l-sig computation except for PS-Poll frames */
  733. info->dur_update = !ieee80211_is_pspoll(hdr->frame_control);
  734. /*
  735. * We check if Short Preamble is needed for the CTS rate by
  736. * checking the BSS's global flag.
  737. * But for the rate series, IEEE80211_TX_RC_USE_SHORT_PREAMBLE is used.
  738. */
  739. rate = ieee80211_get_rts_cts_rate(sc->hw, tx_info);
  740. info->rtscts_rate = rate->hw_value;
  741. if (sc->sc_flags & SC_OP_PREAMBLE_SHORT)
  742. info->rtscts_rate |= rate->hw_value_short;
  743. for (i = 0; i < 4; i++) {
  744. bool is_40, is_sgi, is_sp;
  745. int phy;
  746. if (!rates[i].count || (rates[i].idx < 0))
  747. continue;
  748. rix = rates[i].idx;
  749. info->rates[i].Tries = rates[i].count;
  750. if (rates[i].flags & IEEE80211_TX_RC_USE_RTS_CTS) {
  751. info->rates[i].RateFlags |= ATH9K_RATESERIES_RTS_CTS;
  752. info->flags |= ATH9K_TXDESC_RTSENA;
  753. } else if (rates[i].flags & IEEE80211_TX_RC_USE_CTS_PROTECT) {
  754. info->rates[i].RateFlags |= ATH9K_RATESERIES_RTS_CTS;
  755. info->flags |= ATH9K_TXDESC_CTSENA;
  756. }
  757. if (rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH)
  758. info->rates[i].RateFlags |= ATH9K_RATESERIES_2040;
  759. if (rates[i].flags & IEEE80211_TX_RC_SHORT_GI)
  760. info->rates[i].RateFlags |= ATH9K_RATESERIES_HALFGI;
  761. is_sgi = !!(rates[i].flags & IEEE80211_TX_RC_SHORT_GI);
  762. is_40 = !!(rates[i].flags & IEEE80211_TX_RC_40_MHZ_WIDTH);
  763. is_sp = !!(rates[i].flags & IEEE80211_TX_RC_USE_SHORT_PREAMBLE);
  764. if (rates[i].flags & IEEE80211_TX_RC_MCS) {
  765. /* MCS rates */
  766. info->rates[i].Rate = rix | 0x80;
  767. info->rates[i].ChSel = ath_txchainmask_reduction(sc,
  768. ah->txchainmask, info->rates[i].Rate);
  769. info->rates[i].PktDuration = ath_pkt_duration(sc, rix, len,
  770. is_40, is_sgi, is_sp);
  771. if (rix < 8 && (tx_info->flags & IEEE80211_TX_CTL_STBC))
  772. info->rates[i].RateFlags |= ATH9K_RATESERIES_STBC;
  773. continue;
  774. }
  775. /* legacy rates */
  776. if ((tx_info->band == IEEE80211_BAND_2GHZ) &&
  777. !(rate->flags & IEEE80211_RATE_ERP_G))
  778. phy = WLAN_RC_PHY_CCK;
  779. else
  780. phy = WLAN_RC_PHY_OFDM;
  781. rate = &sc->sbands[tx_info->band].bitrates[rates[i].idx];
  782. info->rates[i].Rate = rate->hw_value;
  783. if (rate->hw_value_short) {
  784. if (rates[i].flags & IEEE80211_TX_RC_USE_SHORT_PREAMBLE)
  785. info->rates[i].Rate |= rate->hw_value_short;
  786. } else {
  787. is_sp = false;
  788. }
  789. if (bf->bf_state.bfs_paprd)
  790. info->rates[i].ChSel = ah->txchainmask;
  791. else
  792. info->rates[i].ChSel = ath_txchainmask_reduction(sc,
  793. ah->txchainmask, info->rates[i].Rate);
  794. info->rates[i].PktDuration = ath9k_hw_computetxtime(sc->sc_ah,
  795. phy, rate->bitrate * 100, len, rix, is_sp);
  796. }
  797. /* For AR5416 - RTS cannot be followed by a frame larger than 8K */
  798. if (bf_isaggr(bf) && (len > sc->sc_ah->caps.rts_aggr_limit))
  799. info->flags &= ~ATH9K_TXDESC_RTSENA;
  800. /* ATH9K_TXDESC_RTSENA and ATH9K_TXDESC_CTSENA are mutually exclusive. */
  801. if (info->flags & ATH9K_TXDESC_RTSENA)
  802. info->flags &= ~ATH9K_TXDESC_CTSENA;
  803. }
  804. static enum ath9k_pkt_type get_hw_packet_type(struct sk_buff *skb)
  805. {
  806. struct ieee80211_hdr *hdr;
  807. enum ath9k_pkt_type htype;
  808. __le16 fc;
  809. hdr = (struct ieee80211_hdr *)skb->data;
  810. fc = hdr->frame_control;
  811. if (ieee80211_is_beacon(fc))
  812. htype = ATH9K_PKT_TYPE_BEACON;
  813. else if (ieee80211_is_probe_resp(fc))
  814. htype = ATH9K_PKT_TYPE_PROBE_RESP;
  815. else if (ieee80211_is_atim(fc))
  816. htype = ATH9K_PKT_TYPE_ATIM;
  817. else if (ieee80211_is_pspoll(fc))
  818. htype = ATH9K_PKT_TYPE_PSPOLL;
  819. else
  820. htype = ATH9K_PKT_TYPE_NORMAL;
  821. return htype;
  822. }
  823. static void ath_tx_fill_desc(struct ath_softc *sc, struct ath_buf *bf,
  824. struct ath_txq *txq, int len)
  825. {
  826. struct ath_hw *ah = sc->sc_ah;
  827. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(bf->bf_mpdu);
  828. struct ath_buf *bf_first = bf;
  829. struct ath_tx_info info;
  830. bool aggr = !!(bf->bf_state.bf_type & BUF_AGGR);
  831. memset(&info, 0, sizeof(info));
  832. info.is_first = true;
  833. info.is_last = true;
  834. info.txpower = MAX_RATE_POWER;
  835. info.qcu = txq->axq_qnum;
  836. info.flags = ATH9K_TXDESC_INTREQ;
  837. if (tx_info->flags & IEEE80211_TX_CTL_NO_ACK)
  838. info.flags |= ATH9K_TXDESC_NOACK;
  839. if (tx_info->flags & IEEE80211_TX_CTL_LDPC)
  840. info.flags |= ATH9K_TXDESC_LDPC;
  841. ath_buf_set_rate(sc, bf, &info, len);
  842. if (tx_info->flags & IEEE80211_TX_CTL_CLEAR_PS_FILT)
  843. info.flags |= ATH9K_TXDESC_CLRDMASK;
  844. if (bf->bf_state.bfs_paprd)
  845. info.flags |= (u32) bf->bf_state.bfs_paprd << ATH9K_TXDESC_PAPRD_S;
  846. while (bf) {
  847. struct sk_buff *skb = bf->bf_mpdu;
  848. struct ath_frame_info *fi = get_frame_info(skb);
  849. info.type = get_hw_packet_type(skb);
  850. if (bf->bf_next)
  851. info.link = bf->bf_next->bf_daddr;
  852. else
  853. info.link = 0;
  854. info.buf_addr[0] = bf->bf_buf_addr;
  855. info.buf_len[0] = skb->len;
  856. info.pkt_len = fi->framelen;
  857. info.keyix = fi->keyix;
  858. info.keytype = fi->keytype;
  859. if (aggr) {
  860. if (bf == bf_first)
  861. info.aggr = AGGR_BUF_FIRST;
  862. else if (!bf->bf_next)
  863. info.aggr = AGGR_BUF_LAST;
  864. else
  865. info.aggr = AGGR_BUF_MIDDLE;
  866. info.ndelim = bf->bf_state.ndelim;
  867. info.aggr_len = len;
  868. }
  869. ath9k_hw_set_txdesc(ah, bf->bf_desc, &info);
  870. bf = bf->bf_next;
  871. }
  872. }
  873. static void ath_tx_sched_aggr(struct ath_softc *sc, struct ath_txq *txq,
  874. struct ath_atx_tid *tid)
  875. {
  876. struct ath_buf *bf;
  877. enum ATH_AGGR_STATUS status;
  878. struct ieee80211_tx_info *tx_info;
  879. struct list_head bf_q;
  880. int aggr_len;
  881. do {
  882. if (skb_queue_empty(&tid->buf_q))
  883. return;
  884. INIT_LIST_HEAD(&bf_q);
  885. status = ath_tx_form_aggr(sc, txq, tid, &bf_q, &aggr_len);
  886. /*
  887. * no frames picked up to be aggregated;
  888. * block-ack window is not open.
  889. */
  890. if (list_empty(&bf_q))
  891. break;
  892. bf = list_first_entry(&bf_q, struct ath_buf, list);
  893. bf->bf_lastbf = list_entry(bf_q.prev, struct ath_buf, list);
  894. tx_info = IEEE80211_SKB_CB(bf->bf_mpdu);
  895. if (tid->ac->clear_ps_filter) {
  896. tid->ac->clear_ps_filter = false;
  897. tx_info->flags |= IEEE80211_TX_CTL_CLEAR_PS_FILT;
  898. } else {
  899. tx_info->flags &= ~IEEE80211_TX_CTL_CLEAR_PS_FILT;
  900. }
  901. /* if only one frame, send as non-aggregate */
  902. if (bf == bf->bf_lastbf) {
  903. aggr_len = get_frame_info(bf->bf_mpdu)->framelen;
  904. bf->bf_state.bf_type = BUF_AMPDU;
  905. } else {
  906. TX_STAT_INC(txq->axq_qnum, a_aggr);
  907. }
  908. ath_tx_fill_desc(sc, bf, txq, aggr_len);
  909. ath_tx_txqaddbuf(sc, txq, &bf_q, false);
  910. } while (txq->axq_ampdu_depth < ATH_AGGR_MIN_QDEPTH &&
  911. status != ATH_AGGR_BAW_CLOSED);
  912. }
  913. int ath_tx_aggr_start(struct ath_softc *sc, struct ieee80211_sta *sta,
  914. u16 tid, u16 *ssn)
  915. {
  916. struct ath_atx_tid *txtid;
  917. struct ath_node *an;
  918. an = (struct ath_node *)sta->drv_priv;
  919. txtid = ATH_AN_2_TID(an, tid);
  920. if (txtid->state & (AGGR_CLEANUP | AGGR_ADDBA_COMPLETE))
  921. return -EAGAIN;
  922. txtid->state |= AGGR_ADDBA_PROGRESS;
  923. txtid->paused = true;
  924. *ssn = txtid->seq_start = txtid->seq_next;
  925. memset(txtid->tx_buf, 0, sizeof(txtid->tx_buf));
  926. txtid->baw_head = txtid->baw_tail = 0;
  927. return 0;
  928. }
  929. void ath_tx_aggr_stop(struct ath_softc *sc, struct ieee80211_sta *sta, u16 tid)
  930. {
  931. struct ath_node *an = (struct ath_node *)sta->drv_priv;
  932. struct ath_atx_tid *txtid = ATH_AN_2_TID(an, tid);
  933. struct ath_txq *txq = txtid->ac->txq;
  934. if (txtid->state & AGGR_CLEANUP)
  935. return;
  936. if (!(txtid->state & AGGR_ADDBA_COMPLETE)) {
  937. txtid->state &= ~AGGR_ADDBA_PROGRESS;
  938. return;
  939. }
  940. spin_lock_bh(&txq->axq_lock);
  941. txtid->paused = true;
  942. /*
  943. * If frames are still being transmitted for this TID, they will be
  944. * cleaned up during tx completion. To prevent race conditions, this
  945. * TID can only be reused after all in-progress subframes have been
  946. * completed.
  947. */
  948. if (txtid->baw_head != txtid->baw_tail)
  949. txtid->state |= AGGR_CLEANUP;
  950. else
  951. txtid->state &= ~AGGR_ADDBA_COMPLETE;
  952. spin_unlock_bh(&txq->axq_lock);
  953. ath_tx_flush_tid(sc, txtid);
  954. }
  955. void ath_tx_aggr_sleep(struct ieee80211_sta *sta, struct ath_softc *sc,
  956. struct ath_node *an)
  957. {
  958. struct ath_atx_tid *tid;
  959. struct ath_atx_ac *ac;
  960. struct ath_txq *txq;
  961. bool buffered;
  962. int tidno;
  963. for (tidno = 0, tid = &an->tid[tidno];
  964. tidno < WME_NUM_TID; tidno++, tid++) {
  965. if (!tid->sched)
  966. continue;
  967. ac = tid->ac;
  968. txq = ac->txq;
  969. spin_lock_bh(&txq->axq_lock);
  970. buffered = !skb_queue_empty(&tid->buf_q);
  971. tid->sched = false;
  972. list_del(&tid->list);
  973. if (ac->sched) {
  974. ac->sched = false;
  975. list_del(&ac->list);
  976. }
  977. spin_unlock_bh(&txq->axq_lock);
  978. ieee80211_sta_set_buffered(sta, tidno, buffered);
  979. }
  980. }
  981. void ath_tx_aggr_wakeup(struct ath_softc *sc, struct ath_node *an)
  982. {
  983. struct ath_atx_tid *tid;
  984. struct ath_atx_ac *ac;
  985. struct ath_txq *txq;
  986. int tidno;
  987. for (tidno = 0, tid = &an->tid[tidno];
  988. tidno < WME_NUM_TID; tidno++, tid++) {
  989. ac = tid->ac;
  990. txq = ac->txq;
  991. spin_lock_bh(&txq->axq_lock);
  992. ac->clear_ps_filter = true;
  993. if (!skb_queue_empty(&tid->buf_q) && !tid->paused) {
  994. ath_tx_queue_tid(txq, tid);
  995. ath_txq_schedule(sc, txq);
  996. }
  997. spin_unlock_bh(&txq->axq_lock);
  998. }
  999. }
  1000. void ath_tx_aggr_resume(struct ath_softc *sc, struct ieee80211_sta *sta, u16 tid)
  1001. {
  1002. struct ath_atx_tid *txtid;
  1003. struct ath_node *an;
  1004. an = (struct ath_node *)sta->drv_priv;
  1005. if (sc->sc_flags & SC_OP_TXAGGR) {
  1006. txtid = ATH_AN_2_TID(an, tid);
  1007. txtid->baw_size =
  1008. IEEE80211_MIN_AMPDU_BUF << sta->ht_cap.ampdu_factor;
  1009. txtid->state |= AGGR_ADDBA_COMPLETE;
  1010. txtid->state &= ~AGGR_ADDBA_PROGRESS;
  1011. ath_tx_resume_tid(sc, txtid);
  1012. }
  1013. }
  1014. /********************/
  1015. /* Queue Management */
  1016. /********************/
  1017. static void ath_txq_drain_pending_buffers(struct ath_softc *sc,
  1018. struct ath_txq *txq)
  1019. {
  1020. struct ath_atx_ac *ac, *ac_tmp;
  1021. struct ath_atx_tid *tid, *tid_tmp;
  1022. list_for_each_entry_safe(ac, ac_tmp, &txq->axq_acq, list) {
  1023. list_del(&ac->list);
  1024. ac->sched = false;
  1025. list_for_each_entry_safe(tid, tid_tmp, &ac->tid_q, list) {
  1026. list_del(&tid->list);
  1027. tid->sched = false;
  1028. ath_tid_drain(sc, txq, tid);
  1029. }
  1030. }
  1031. }
  1032. struct ath_txq *ath_txq_setup(struct ath_softc *sc, int qtype, int subtype)
  1033. {
  1034. struct ath_hw *ah = sc->sc_ah;
  1035. struct ath9k_tx_queue_info qi;
  1036. static const int subtype_txq_to_hwq[] = {
  1037. [WME_AC_BE] = ATH_TXQ_AC_BE,
  1038. [WME_AC_BK] = ATH_TXQ_AC_BK,
  1039. [WME_AC_VI] = ATH_TXQ_AC_VI,
  1040. [WME_AC_VO] = ATH_TXQ_AC_VO,
  1041. };
  1042. int axq_qnum, i;
  1043. memset(&qi, 0, sizeof(qi));
  1044. qi.tqi_subtype = subtype_txq_to_hwq[subtype];
  1045. qi.tqi_aifs = ATH9K_TXQ_USEDEFAULT;
  1046. qi.tqi_cwmin = ATH9K_TXQ_USEDEFAULT;
  1047. qi.tqi_cwmax = ATH9K_TXQ_USEDEFAULT;
  1048. qi.tqi_physCompBuf = 0;
  1049. /*
  1050. * Enable interrupts only for EOL and DESC conditions.
  1051. * We mark tx descriptors to receive a DESC interrupt
  1052. * when a tx queue gets deep; otherwise waiting for the
  1053. * EOL to reap descriptors. Note that this is done to
  1054. * reduce interrupt load and this only defers reaping
  1055. * descriptors, never transmitting frames. Aside from
  1056. * reducing interrupts this also permits more concurrency.
  1057. * The only potential downside is if the tx queue backs
  1058. * up in which case the top half of the kernel may backup
  1059. * due to a lack of tx descriptors.
  1060. *
  1061. * The UAPSD queue is an exception, since we take a desc-
  1062. * based intr on the EOSP frames.
  1063. */
  1064. if (ah->caps.hw_caps & ATH9K_HW_CAP_EDMA) {
  1065. qi.tqi_qflags = TXQ_FLAG_TXOKINT_ENABLE |
  1066. TXQ_FLAG_TXERRINT_ENABLE;
  1067. } else {
  1068. if (qtype == ATH9K_TX_QUEUE_UAPSD)
  1069. qi.tqi_qflags = TXQ_FLAG_TXDESCINT_ENABLE;
  1070. else
  1071. qi.tqi_qflags = TXQ_FLAG_TXEOLINT_ENABLE |
  1072. TXQ_FLAG_TXDESCINT_ENABLE;
  1073. }
  1074. axq_qnum = ath9k_hw_setuptxqueue(ah, qtype, &qi);
  1075. if (axq_qnum == -1) {
  1076. /*
  1077. * NB: don't print a message, this happens
  1078. * normally on parts with too few tx queues
  1079. */
  1080. return NULL;
  1081. }
  1082. if (!ATH_TXQ_SETUP(sc, axq_qnum)) {
  1083. struct ath_txq *txq = &sc->tx.txq[axq_qnum];
  1084. txq->axq_qnum = axq_qnum;
  1085. txq->mac80211_qnum = -1;
  1086. txq->axq_link = NULL;
  1087. INIT_LIST_HEAD(&txq->axq_q);
  1088. INIT_LIST_HEAD(&txq->axq_acq);
  1089. spin_lock_init(&txq->axq_lock);
  1090. txq->axq_depth = 0;
  1091. txq->axq_ampdu_depth = 0;
  1092. txq->axq_tx_inprogress = false;
  1093. sc->tx.txqsetup |= 1<<axq_qnum;
  1094. txq->txq_headidx = txq->txq_tailidx = 0;
  1095. for (i = 0; i < ATH_TXFIFO_DEPTH; i++)
  1096. INIT_LIST_HEAD(&txq->txq_fifo[i]);
  1097. }
  1098. return &sc->tx.txq[axq_qnum];
  1099. }
  1100. int ath_txq_update(struct ath_softc *sc, int qnum,
  1101. struct ath9k_tx_queue_info *qinfo)
  1102. {
  1103. struct ath_hw *ah = sc->sc_ah;
  1104. int error = 0;
  1105. struct ath9k_tx_queue_info qi;
  1106. if (qnum == sc->beacon.beaconq) {
  1107. /*
  1108. * XXX: for beacon queue, we just save the parameter.
  1109. * It will be picked up by ath_beaconq_config when
  1110. * it's necessary.
  1111. */
  1112. sc->beacon.beacon_qi = *qinfo;
  1113. return 0;
  1114. }
  1115. BUG_ON(sc->tx.txq[qnum].axq_qnum != qnum);
  1116. ath9k_hw_get_txq_props(ah, qnum, &qi);
  1117. qi.tqi_aifs = qinfo->tqi_aifs;
  1118. qi.tqi_cwmin = qinfo->tqi_cwmin;
  1119. qi.tqi_cwmax = qinfo->tqi_cwmax;
  1120. qi.tqi_burstTime = qinfo->tqi_burstTime;
  1121. qi.tqi_readyTime = qinfo->tqi_readyTime;
  1122. if (!ath9k_hw_set_txq_props(ah, qnum, &qi)) {
  1123. ath_err(ath9k_hw_common(sc->sc_ah),
  1124. "Unable to update hardware queue %u!\n", qnum);
  1125. error = -EIO;
  1126. } else {
  1127. ath9k_hw_resettxqueue(ah, qnum);
  1128. }
  1129. return error;
  1130. }
  1131. int ath_cabq_update(struct ath_softc *sc)
  1132. {
  1133. struct ath9k_tx_queue_info qi;
  1134. struct ath_beacon_config *cur_conf = &sc->cur_beacon_conf;
  1135. int qnum = sc->beacon.cabq->axq_qnum;
  1136. ath9k_hw_get_txq_props(sc->sc_ah, qnum, &qi);
  1137. /*
  1138. * Ensure the readytime % is within the bounds.
  1139. */
  1140. if (sc->config.cabqReadytime < ATH9K_READY_TIME_LO_BOUND)
  1141. sc->config.cabqReadytime = ATH9K_READY_TIME_LO_BOUND;
  1142. else if (sc->config.cabqReadytime > ATH9K_READY_TIME_HI_BOUND)
  1143. sc->config.cabqReadytime = ATH9K_READY_TIME_HI_BOUND;
  1144. qi.tqi_readyTime = (cur_conf->beacon_interval *
  1145. sc->config.cabqReadytime) / 100;
  1146. ath_txq_update(sc, qnum, &qi);
  1147. return 0;
  1148. }
  1149. static bool bf_is_ampdu_not_probing(struct ath_buf *bf)
  1150. {
  1151. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(bf->bf_mpdu);
  1152. return bf_isampdu(bf) && !(info->flags & IEEE80211_TX_CTL_RATE_CTRL_PROBE);
  1153. }
  1154. static void ath_drain_txq_list(struct ath_softc *sc, struct ath_txq *txq,
  1155. struct list_head *list, bool retry_tx)
  1156. __releases(txq->axq_lock)
  1157. __acquires(txq->axq_lock)
  1158. {
  1159. struct ath_buf *bf, *lastbf;
  1160. struct list_head bf_head;
  1161. struct ath_tx_status ts;
  1162. memset(&ts, 0, sizeof(ts));
  1163. ts.ts_status = ATH9K_TX_FLUSH;
  1164. INIT_LIST_HEAD(&bf_head);
  1165. while (!list_empty(list)) {
  1166. bf = list_first_entry(list, struct ath_buf, list);
  1167. if (bf->bf_stale) {
  1168. list_del(&bf->list);
  1169. ath_tx_return_buffer(sc, bf);
  1170. continue;
  1171. }
  1172. lastbf = bf->bf_lastbf;
  1173. list_cut_position(&bf_head, list, &lastbf->list);
  1174. txq->axq_depth--;
  1175. if (bf_is_ampdu_not_probing(bf))
  1176. txq->axq_ampdu_depth--;
  1177. spin_unlock_bh(&txq->axq_lock);
  1178. if (bf_isampdu(bf))
  1179. ath_tx_complete_aggr(sc, txq, bf, &bf_head, &ts, 0,
  1180. retry_tx);
  1181. else
  1182. ath_tx_complete_buf(sc, bf, txq, &bf_head, &ts, 0, 0);
  1183. spin_lock_bh(&txq->axq_lock);
  1184. }
  1185. }
  1186. /*
  1187. * Drain a given TX queue (could be Beacon or Data)
  1188. *
  1189. * This assumes output has been stopped and
  1190. * we do not need to block ath_tx_tasklet.
  1191. */
  1192. void ath_draintxq(struct ath_softc *sc, struct ath_txq *txq, bool retry_tx)
  1193. {
  1194. spin_lock_bh(&txq->axq_lock);
  1195. if (sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA) {
  1196. int idx = txq->txq_tailidx;
  1197. while (!list_empty(&txq->txq_fifo[idx])) {
  1198. ath_drain_txq_list(sc, txq, &txq->txq_fifo[idx],
  1199. retry_tx);
  1200. INCR(idx, ATH_TXFIFO_DEPTH);
  1201. }
  1202. txq->txq_tailidx = idx;
  1203. }
  1204. txq->axq_link = NULL;
  1205. txq->axq_tx_inprogress = false;
  1206. ath_drain_txq_list(sc, txq, &txq->axq_q, retry_tx);
  1207. /* flush any pending frames if aggregation is enabled */
  1208. if ((sc->sc_flags & SC_OP_TXAGGR) && !retry_tx)
  1209. ath_txq_drain_pending_buffers(sc, txq);
  1210. spin_unlock_bh(&txq->axq_lock);
  1211. }
  1212. bool ath_drain_all_txq(struct ath_softc *sc, bool retry_tx)
  1213. {
  1214. struct ath_hw *ah = sc->sc_ah;
  1215. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1216. struct ath_txq *txq;
  1217. int i;
  1218. u32 npend = 0;
  1219. if (sc->sc_flags & SC_OP_INVALID)
  1220. return true;
  1221. ath9k_hw_abort_tx_dma(ah);
  1222. /* Check if any queue remains active */
  1223. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  1224. if (!ATH_TXQ_SETUP(sc, i))
  1225. continue;
  1226. if (ath9k_hw_numtxpending(ah, sc->tx.txq[i].axq_qnum))
  1227. npend |= BIT(i);
  1228. }
  1229. if (npend)
  1230. ath_err(common, "Failed to stop TX DMA, queues=0x%03x!\n", npend);
  1231. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  1232. if (!ATH_TXQ_SETUP(sc, i))
  1233. continue;
  1234. /*
  1235. * The caller will resume queues with ieee80211_wake_queues.
  1236. * Mark the queue as not stopped to prevent ath_tx_complete
  1237. * from waking the queue too early.
  1238. */
  1239. txq = &sc->tx.txq[i];
  1240. txq->stopped = false;
  1241. ath_draintxq(sc, txq, retry_tx);
  1242. }
  1243. return !npend;
  1244. }
  1245. void ath_tx_cleanupq(struct ath_softc *sc, struct ath_txq *txq)
  1246. {
  1247. ath9k_hw_releasetxqueue(sc->sc_ah, txq->axq_qnum);
  1248. sc->tx.txqsetup &= ~(1<<txq->axq_qnum);
  1249. }
  1250. /* For each axq_acq entry, for each tid, try to schedule packets
  1251. * for transmit until ampdu_depth has reached min Q depth.
  1252. */
  1253. void ath_txq_schedule(struct ath_softc *sc, struct ath_txq *txq)
  1254. {
  1255. struct ath_atx_ac *ac, *ac_tmp, *last_ac;
  1256. struct ath_atx_tid *tid, *last_tid;
  1257. if (work_pending(&sc->hw_reset_work) || list_empty(&txq->axq_acq) ||
  1258. txq->axq_ampdu_depth >= ATH_AGGR_MIN_QDEPTH)
  1259. return;
  1260. ac = list_first_entry(&txq->axq_acq, struct ath_atx_ac, list);
  1261. last_ac = list_entry(txq->axq_acq.prev, struct ath_atx_ac, list);
  1262. list_for_each_entry_safe(ac, ac_tmp, &txq->axq_acq, list) {
  1263. last_tid = list_entry(ac->tid_q.prev, struct ath_atx_tid, list);
  1264. list_del(&ac->list);
  1265. ac->sched = false;
  1266. while (!list_empty(&ac->tid_q)) {
  1267. tid = list_first_entry(&ac->tid_q, struct ath_atx_tid,
  1268. list);
  1269. list_del(&tid->list);
  1270. tid->sched = false;
  1271. if (tid->paused)
  1272. continue;
  1273. ath_tx_sched_aggr(sc, txq, tid);
  1274. /*
  1275. * add tid to round-robin queue if more frames
  1276. * are pending for the tid
  1277. */
  1278. if (!skb_queue_empty(&tid->buf_q))
  1279. ath_tx_queue_tid(txq, tid);
  1280. if (tid == last_tid ||
  1281. txq->axq_ampdu_depth >= ATH_AGGR_MIN_QDEPTH)
  1282. break;
  1283. }
  1284. if (!list_empty(&ac->tid_q)) {
  1285. if (!ac->sched) {
  1286. ac->sched = true;
  1287. list_add_tail(&ac->list, &txq->axq_acq);
  1288. }
  1289. }
  1290. if (ac == last_ac ||
  1291. txq->axq_ampdu_depth >= ATH_AGGR_MIN_QDEPTH)
  1292. return;
  1293. }
  1294. }
  1295. /***********/
  1296. /* TX, DMA */
  1297. /***********/
  1298. /*
  1299. * Insert a chain of ath_buf (descriptors) on a txq and
  1300. * assume the descriptors are already chained together by caller.
  1301. */
  1302. static void ath_tx_txqaddbuf(struct ath_softc *sc, struct ath_txq *txq,
  1303. struct list_head *head, bool internal)
  1304. {
  1305. struct ath_hw *ah = sc->sc_ah;
  1306. struct ath_common *common = ath9k_hw_common(ah);
  1307. struct ath_buf *bf, *bf_last;
  1308. bool puttxbuf = false;
  1309. bool edma;
  1310. /*
  1311. * Insert the frame on the outbound list and
  1312. * pass it on to the hardware.
  1313. */
  1314. if (list_empty(head))
  1315. return;
  1316. edma = !!(ah->caps.hw_caps & ATH9K_HW_CAP_EDMA);
  1317. bf = list_first_entry(head, struct ath_buf, list);
  1318. bf_last = list_entry(head->prev, struct ath_buf, list);
  1319. ath_dbg(common, ATH_DBG_QUEUE,
  1320. "qnum: %d, txq depth: %d\n", txq->axq_qnum, txq->axq_depth);
  1321. if (edma && list_empty(&txq->txq_fifo[txq->txq_headidx])) {
  1322. list_splice_tail_init(head, &txq->txq_fifo[txq->txq_headidx]);
  1323. INCR(txq->txq_headidx, ATH_TXFIFO_DEPTH);
  1324. puttxbuf = true;
  1325. } else {
  1326. list_splice_tail_init(head, &txq->axq_q);
  1327. if (txq->axq_link) {
  1328. ath9k_hw_set_desc_link(ah, txq->axq_link, bf->bf_daddr);
  1329. ath_dbg(common, ATH_DBG_XMIT,
  1330. "link[%u] (%p)=%llx (%p)\n",
  1331. txq->axq_qnum, txq->axq_link,
  1332. ito64(bf->bf_daddr), bf->bf_desc);
  1333. } else if (!edma)
  1334. puttxbuf = true;
  1335. txq->axq_link = bf_last->bf_desc;
  1336. }
  1337. if (puttxbuf) {
  1338. TX_STAT_INC(txq->axq_qnum, puttxbuf);
  1339. ath9k_hw_puttxbuf(ah, txq->axq_qnum, bf->bf_daddr);
  1340. ath_dbg(common, ATH_DBG_XMIT, "TXDP[%u] = %llx (%p)\n",
  1341. txq->axq_qnum, ito64(bf->bf_daddr), bf->bf_desc);
  1342. }
  1343. if (!edma) {
  1344. TX_STAT_INC(txq->axq_qnum, txstart);
  1345. ath9k_hw_txstart(ah, txq->axq_qnum);
  1346. }
  1347. if (!internal) {
  1348. txq->axq_depth++;
  1349. if (bf_is_ampdu_not_probing(bf))
  1350. txq->axq_ampdu_depth++;
  1351. }
  1352. }
  1353. static void ath_tx_send_ampdu(struct ath_softc *sc, struct ath_atx_tid *tid,
  1354. struct sk_buff *skb, struct ath_tx_control *txctl)
  1355. {
  1356. struct ath_frame_info *fi = get_frame_info(skb);
  1357. struct list_head bf_head;
  1358. struct ath_buf *bf;
  1359. /*
  1360. * Do not queue to h/w when any of the following conditions is true:
  1361. * - there are pending frames in software queue
  1362. * - the TID is currently paused for ADDBA/BAR request
  1363. * - seqno is not within block-ack window
  1364. * - h/w queue depth exceeds low water mark
  1365. */
  1366. if (!skb_queue_empty(&tid->buf_q) || tid->paused ||
  1367. !BAW_WITHIN(tid->seq_start, tid->baw_size, tid->seq_next) ||
  1368. txctl->txq->axq_ampdu_depth >= ATH_AGGR_MIN_QDEPTH) {
  1369. /*
  1370. * Add this frame to software queue for scheduling later
  1371. * for aggregation.
  1372. */
  1373. TX_STAT_INC(txctl->txq->axq_qnum, a_queued_sw);
  1374. __skb_queue_tail(&tid->buf_q, skb);
  1375. if (!txctl->an || !txctl->an->sleeping)
  1376. ath_tx_queue_tid(txctl->txq, tid);
  1377. return;
  1378. }
  1379. bf = ath_tx_setup_buffer(sc, txctl->txq, tid, skb);
  1380. if (!bf)
  1381. return;
  1382. bf->bf_state.bf_type = BUF_AMPDU;
  1383. INIT_LIST_HEAD(&bf_head);
  1384. list_add(&bf->list, &bf_head);
  1385. /* Add sub-frame to BAW */
  1386. ath_tx_addto_baw(sc, tid, bf->bf_state.seqno);
  1387. /* Queue to h/w without aggregation */
  1388. TX_STAT_INC(txctl->txq->axq_qnum, a_queued_hw);
  1389. bf->bf_lastbf = bf;
  1390. ath_tx_fill_desc(sc, bf, txctl->txq, fi->framelen);
  1391. ath_tx_txqaddbuf(sc, txctl->txq, &bf_head, false);
  1392. }
  1393. static void ath_tx_send_normal(struct ath_softc *sc, struct ath_txq *txq,
  1394. struct ath_atx_tid *tid, struct sk_buff *skb)
  1395. {
  1396. struct ath_frame_info *fi = get_frame_info(skb);
  1397. struct list_head bf_head;
  1398. struct ath_buf *bf;
  1399. bf = fi->bf;
  1400. if (!bf)
  1401. bf = ath_tx_setup_buffer(sc, txq, tid, skb);
  1402. if (!bf)
  1403. return;
  1404. INIT_LIST_HEAD(&bf_head);
  1405. list_add_tail(&bf->list, &bf_head);
  1406. bf->bf_state.bf_type = 0;
  1407. /* update starting sequence number for subsequent ADDBA request */
  1408. if (tid)
  1409. INCR(tid->seq_start, IEEE80211_SEQ_MAX);
  1410. bf->bf_lastbf = bf;
  1411. ath_tx_fill_desc(sc, bf, txq, fi->framelen);
  1412. ath_tx_txqaddbuf(sc, txq, &bf_head, false);
  1413. TX_STAT_INC(txq->axq_qnum, queued);
  1414. }
  1415. static void setup_frame_info(struct ieee80211_hw *hw, struct sk_buff *skb,
  1416. int framelen)
  1417. {
  1418. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1419. struct ieee80211_sta *sta = tx_info->control.sta;
  1420. struct ieee80211_key_conf *hw_key = tx_info->control.hw_key;
  1421. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1422. struct ath_frame_info *fi = get_frame_info(skb);
  1423. struct ath_node *an = NULL;
  1424. enum ath9k_key_type keytype;
  1425. keytype = ath9k_cmn_get_hw_crypto_keytype(skb);
  1426. if (sta)
  1427. an = (struct ath_node *) sta->drv_priv;
  1428. memset(fi, 0, sizeof(*fi));
  1429. if (hw_key)
  1430. fi->keyix = hw_key->hw_key_idx;
  1431. else if (an && ieee80211_is_data(hdr->frame_control) && an->ps_key > 0)
  1432. fi->keyix = an->ps_key;
  1433. else
  1434. fi->keyix = ATH9K_TXKEYIX_INVALID;
  1435. fi->keytype = keytype;
  1436. fi->framelen = framelen;
  1437. }
  1438. u8 ath_txchainmask_reduction(struct ath_softc *sc, u8 chainmask, u32 rate)
  1439. {
  1440. struct ath_hw *ah = sc->sc_ah;
  1441. struct ath9k_channel *curchan = ah->curchan;
  1442. if ((ah->caps.hw_caps & ATH9K_HW_CAP_APM) &&
  1443. (curchan->channelFlags & CHANNEL_5GHZ) &&
  1444. (chainmask == 0x7) && (rate < 0x90))
  1445. return 0x3;
  1446. else
  1447. return chainmask;
  1448. }
  1449. /*
  1450. * Assign a descriptor (and sequence number if necessary,
  1451. * and map buffer for DMA. Frees skb on error
  1452. */
  1453. static struct ath_buf *ath_tx_setup_buffer(struct ath_softc *sc,
  1454. struct ath_txq *txq,
  1455. struct ath_atx_tid *tid,
  1456. struct sk_buff *skb)
  1457. {
  1458. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1459. struct ath_frame_info *fi = get_frame_info(skb);
  1460. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1461. struct ath_buf *bf;
  1462. u16 seqno;
  1463. bf = ath_tx_get_buffer(sc);
  1464. if (!bf) {
  1465. ath_dbg(common, ATH_DBG_XMIT, "TX buffers are full\n");
  1466. goto error;
  1467. }
  1468. ATH_TXBUF_RESET(bf);
  1469. if (tid) {
  1470. seqno = tid->seq_next;
  1471. hdr->seq_ctrl = cpu_to_le16(tid->seq_next << IEEE80211_SEQ_SEQ_SHIFT);
  1472. INCR(tid->seq_next, IEEE80211_SEQ_MAX);
  1473. bf->bf_state.seqno = seqno;
  1474. }
  1475. bf->bf_mpdu = skb;
  1476. bf->bf_buf_addr = dma_map_single(sc->dev, skb->data,
  1477. skb->len, DMA_TO_DEVICE);
  1478. if (unlikely(dma_mapping_error(sc->dev, bf->bf_buf_addr))) {
  1479. bf->bf_mpdu = NULL;
  1480. bf->bf_buf_addr = 0;
  1481. ath_err(ath9k_hw_common(sc->sc_ah),
  1482. "dma_mapping_error() on TX\n");
  1483. ath_tx_return_buffer(sc, bf);
  1484. goto error;
  1485. }
  1486. fi->bf = bf;
  1487. return bf;
  1488. error:
  1489. dev_kfree_skb_any(skb);
  1490. return NULL;
  1491. }
  1492. /* FIXME: tx power */
  1493. static void ath_tx_start_dma(struct ath_softc *sc, struct sk_buff *skb,
  1494. struct ath_tx_control *txctl)
  1495. {
  1496. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1497. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1498. struct ath_atx_tid *tid = NULL;
  1499. struct ath_buf *bf;
  1500. u8 tidno;
  1501. spin_lock_bh(&txctl->txq->axq_lock);
  1502. if ((sc->sc_flags & SC_OP_TXAGGR) && txctl->an &&
  1503. ieee80211_is_data_qos(hdr->frame_control)) {
  1504. tidno = ieee80211_get_qos_ctl(hdr)[0] &
  1505. IEEE80211_QOS_CTL_TID_MASK;
  1506. tid = ATH_AN_2_TID(txctl->an, tidno);
  1507. WARN_ON(tid->ac->txq != txctl->txq);
  1508. }
  1509. if ((tx_info->flags & IEEE80211_TX_CTL_AMPDU) && tid) {
  1510. /*
  1511. * Try aggregation if it's a unicast data frame
  1512. * and the destination is HT capable.
  1513. */
  1514. ath_tx_send_ampdu(sc, tid, skb, txctl);
  1515. } else {
  1516. bf = ath_tx_setup_buffer(sc, txctl->txq, tid, skb);
  1517. if (!bf)
  1518. goto out;
  1519. bf->bf_state.bfs_paprd = txctl->paprd;
  1520. if (txctl->paprd)
  1521. bf->bf_state.bfs_paprd_timestamp = jiffies;
  1522. ath_tx_send_normal(sc, txctl->txq, tid, skb);
  1523. }
  1524. out:
  1525. spin_unlock_bh(&txctl->txq->axq_lock);
  1526. }
  1527. /* Upon failure caller should free skb */
  1528. int ath_tx_start(struct ieee80211_hw *hw, struct sk_buff *skb,
  1529. struct ath_tx_control *txctl)
  1530. {
  1531. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
  1532. struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
  1533. struct ieee80211_sta *sta = info->control.sta;
  1534. struct ieee80211_vif *vif = info->control.vif;
  1535. struct ath_softc *sc = hw->priv;
  1536. struct ath_txq *txq = txctl->txq;
  1537. int padpos, padsize;
  1538. int frmlen = skb->len + FCS_LEN;
  1539. int q;
  1540. /* NOTE: sta can be NULL according to net/mac80211.h */
  1541. if (sta)
  1542. txctl->an = (struct ath_node *)sta->drv_priv;
  1543. if (info->control.hw_key)
  1544. frmlen += info->control.hw_key->icv_len;
  1545. /*
  1546. * As a temporary workaround, assign seq# here; this will likely need
  1547. * to be cleaned up to work better with Beacon transmission and virtual
  1548. * BSSes.
  1549. */
  1550. if (info->flags & IEEE80211_TX_CTL_ASSIGN_SEQ) {
  1551. if (info->flags & IEEE80211_TX_CTL_FIRST_FRAGMENT)
  1552. sc->tx.seq_no += 0x10;
  1553. hdr->seq_ctrl &= cpu_to_le16(IEEE80211_SCTL_FRAG);
  1554. hdr->seq_ctrl |= cpu_to_le16(sc->tx.seq_no);
  1555. }
  1556. /* Add the padding after the header if this is not already done */
  1557. padpos = ath9k_cmn_padpos(hdr->frame_control);
  1558. padsize = padpos & 3;
  1559. if (padsize && skb->len > padpos) {
  1560. if (skb_headroom(skb) < padsize)
  1561. return -ENOMEM;
  1562. skb_push(skb, padsize);
  1563. memmove(skb->data, skb->data + padsize, padpos);
  1564. hdr = (struct ieee80211_hdr *) skb->data;
  1565. }
  1566. if ((vif && vif->type != NL80211_IFTYPE_AP &&
  1567. vif->type != NL80211_IFTYPE_AP_VLAN) ||
  1568. !ieee80211_is_data(hdr->frame_control))
  1569. info->flags |= IEEE80211_TX_CTL_CLEAR_PS_FILT;
  1570. setup_frame_info(hw, skb, frmlen);
  1571. /*
  1572. * At this point, the vif, hw_key and sta pointers in the tx control
  1573. * info are no longer valid (overwritten by the ath_frame_info data.
  1574. */
  1575. q = skb_get_queue_mapping(skb);
  1576. spin_lock_bh(&txq->axq_lock);
  1577. if (txq == sc->tx.txq_map[q] &&
  1578. ++txq->pending_frames > ATH_MAX_QDEPTH && !txq->stopped) {
  1579. ieee80211_stop_queue(sc->hw, q);
  1580. txq->stopped = 1;
  1581. }
  1582. spin_unlock_bh(&txq->axq_lock);
  1583. ath_tx_start_dma(sc, skb, txctl);
  1584. return 0;
  1585. }
  1586. /*****************/
  1587. /* TX Completion */
  1588. /*****************/
  1589. static void ath_tx_complete(struct ath_softc *sc, struct sk_buff *skb,
  1590. int tx_flags, struct ath_txq *txq)
  1591. {
  1592. struct ieee80211_hw *hw = sc->hw;
  1593. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1594. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1595. struct ieee80211_hdr * hdr = (struct ieee80211_hdr *)skb->data;
  1596. int q, padpos, padsize;
  1597. ath_dbg(common, ATH_DBG_XMIT, "TX complete: skb: %p\n", skb);
  1598. if (tx_flags & ATH_TX_BAR)
  1599. tx_info->flags |= IEEE80211_TX_STAT_AMPDU_NO_BACK;
  1600. if (!(tx_flags & ATH_TX_ERROR))
  1601. /* Frame was ACKed */
  1602. tx_info->flags |= IEEE80211_TX_STAT_ACK;
  1603. padpos = ath9k_cmn_padpos(hdr->frame_control);
  1604. padsize = padpos & 3;
  1605. if (padsize && skb->len>padpos+padsize) {
  1606. /*
  1607. * Remove MAC header padding before giving the frame back to
  1608. * mac80211.
  1609. */
  1610. memmove(skb->data + padsize, skb->data, padpos);
  1611. skb_pull(skb, padsize);
  1612. }
  1613. if (sc->ps_flags & PS_WAIT_FOR_TX_ACK) {
  1614. sc->ps_flags &= ~PS_WAIT_FOR_TX_ACK;
  1615. ath_dbg(common, ATH_DBG_PS,
  1616. "Going back to sleep after having received TX status (0x%lx)\n",
  1617. sc->ps_flags & (PS_WAIT_FOR_BEACON |
  1618. PS_WAIT_FOR_CAB |
  1619. PS_WAIT_FOR_PSPOLL_DATA |
  1620. PS_WAIT_FOR_TX_ACK));
  1621. }
  1622. q = skb_get_queue_mapping(skb);
  1623. if (txq == sc->tx.txq_map[q]) {
  1624. spin_lock_bh(&txq->axq_lock);
  1625. if (WARN_ON(--txq->pending_frames < 0))
  1626. txq->pending_frames = 0;
  1627. if (txq->stopped && txq->pending_frames < ATH_MAX_QDEPTH) {
  1628. ieee80211_wake_queue(sc->hw, q);
  1629. txq->stopped = 0;
  1630. }
  1631. spin_unlock_bh(&txq->axq_lock);
  1632. }
  1633. ieee80211_tx_status(hw, skb);
  1634. }
  1635. static void ath_tx_complete_buf(struct ath_softc *sc, struct ath_buf *bf,
  1636. struct ath_txq *txq, struct list_head *bf_q,
  1637. struct ath_tx_status *ts, int txok, int sendbar)
  1638. {
  1639. struct sk_buff *skb = bf->bf_mpdu;
  1640. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1641. unsigned long flags;
  1642. int tx_flags = 0;
  1643. if (sendbar)
  1644. tx_flags = ATH_TX_BAR;
  1645. if (!txok)
  1646. tx_flags |= ATH_TX_ERROR;
  1647. if (ts->ts_status & ATH9K_TXERR_FILT)
  1648. tx_info->flags |= IEEE80211_TX_STAT_TX_FILTERED;
  1649. dma_unmap_single(sc->dev, bf->bf_buf_addr, skb->len, DMA_TO_DEVICE);
  1650. bf->bf_buf_addr = 0;
  1651. if (bf->bf_state.bfs_paprd) {
  1652. if (time_after(jiffies,
  1653. bf->bf_state.bfs_paprd_timestamp +
  1654. msecs_to_jiffies(ATH_PAPRD_TIMEOUT)))
  1655. dev_kfree_skb_any(skb);
  1656. else
  1657. complete(&sc->paprd_complete);
  1658. } else {
  1659. ath_debug_stat_tx(sc, bf, ts, txq, tx_flags);
  1660. ath_tx_complete(sc, skb, tx_flags, txq);
  1661. }
  1662. /* At this point, skb (bf->bf_mpdu) is consumed...make sure we don't
  1663. * accidentally reference it later.
  1664. */
  1665. bf->bf_mpdu = NULL;
  1666. /*
  1667. * Return the list of ath_buf of this mpdu to free queue
  1668. */
  1669. spin_lock_irqsave(&sc->tx.txbuflock, flags);
  1670. list_splice_tail_init(bf_q, &sc->tx.txbuf);
  1671. spin_unlock_irqrestore(&sc->tx.txbuflock, flags);
  1672. }
  1673. static void ath_tx_rc_status(struct ath_softc *sc, struct ath_buf *bf,
  1674. struct ath_tx_status *ts, int nframes, int nbad,
  1675. int txok)
  1676. {
  1677. struct sk_buff *skb = bf->bf_mpdu;
  1678. struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)skb->data;
  1679. struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(skb);
  1680. struct ieee80211_hw *hw = sc->hw;
  1681. struct ath_hw *ah = sc->sc_ah;
  1682. u8 i, tx_rateindex;
  1683. if (txok)
  1684. tx_info->status.ack_signal = ts->ts_rssi;
  1685. tx_rateindex = ts->ts_rateindex;
  1686. WARN_ON(tx_rateindex >= hw->max_rates);
  1687. if (tx_info->flags & IEEE80211_TX_CTL_AMPDU) {
  1688. tx_info->flags |= IEEE80211_TX_STAT_AMPDU;
  1689. BUG_ON(nbad > nframes);
  1690. }
  1691. tx_info->status.ampdu_len = nframes;
  1692. tx_info->status.ampdu_ack_len = nframes - nbad;
  1693. if ((ts->ts_status & ATH9K_TXERR_FILT) == 0 &&
  1694. (tx_info->flags & IEEE80211_TX_CTL_NO_ACK) == 0) {
  1695. /*
  1696. * If an underrun error is seen assume it as an excessive
  1697. * retry only if max frame trigger level has been reached
  1698. * (2 KB for single stream, and 4 KB for dual stream).
  1699. * Adjust the long retry as if the frame was tried
  1700. * hw->max_rate_tries times to affect how rate control updates
  1701. * PER for the failed rate.
  1702. * In case of congestion on the bus penalizing this type of
  1703. * underruns should help hardware actually transmit new frames
  1704. * successfully by eventually preferring slower rates.
  1705. * This itself should also alleviate congestion on the bus.
  1706. */
  1707. if (unlikely(ts->ts_flags & (ATH9K_TX_DATA_UNDERRUN |
  1708. ATH9K_TX_DELIM_UNDERRUN)) &&
  1709. ieee80211_is_data(hdr->frame_control) &&
  1710. ah->tx_trig_level >= sc->sc_ah->config.max_txtrig_level)
  1711. tx_info->status.rates[tx_rateindex].count =
  1712. hw->max_rate_tries;
  1713. }
  1714. for (i = tx_rateindex + 1; i < hw->max_rates; i++) {
  1715. tx_info->status.rates[i].count = 0;
  1716. tx_info->status.rates[i].idx = -1;
  1717. }
  1718. tx_info->status.rates[tx_rateindex].count = ts->ts_longretry + 1;
  1719. }
  1720. static void ath_tx_process_buffer(struct ath_softc *sc, struct ath_txq *txq,
  1721. struct ath_tx_status *ts, struct ath_buf *bf,
  1722. struct list_head *bf_head)
  1723. __releases(txq->axq_lock)
  1724. __acquires(txq->axq_lock)
  1725. {
  1726. int txok;
  1727. txq->axq_depth--;
  1728. txok = !(ts->ts_status & ATH9K_TXERR_MASK);
  1729. txq->axq_tx_inprogress = false;
  1730. if (bf_is_ampdu_not_probing(bf))
  1731. txq->axq_ampdu_depth--;
  1732. spin_unlock_bh(&txq->axq_lock);
  1733. if (!bf_isampdu(bf)) {
  1734. ath_tx_rc_status(sc, bf, ts, 1, txok ? 0 : 1, txok);
  1735. ath_tx_complete_buf(sc, bf, txq, bf_head, ts, txok, 0);
  1736. } else
  1737. ath_tx_complete_aggr(sc, txq, bf, bf_head, ts, txok, true);
  1738. spin_lock_bh(&txq->axq_lock);
  1739. if (sc->sc_flags & SC_OP_TXAGGR)
  1740. ath_txq_schedule(sc, txq);
  1741. }
  1742. static void ath_tx_processq(struct ath_softc *sc, struct ath_txq *txq)
  1743. {
  1744. struct ath_hw *ah = sc->sc_ah;
  1745. struct ath_common *common = ath9k_hw_common(ah);
  1746. struct ath_buf *bf, *lastbf, *bf_held = NULL;
  1747. struct list_head bf_head;
  1748. struct ath_desc *ds;
  1749. struct ath_tx_status ts;
  1750. int status;
  1751. ath_dbg(common, ATH_DBG_QUEUE, "tx queue %d (%x), link %p\n",
  1752. txq->axq_qnum, ath9k_hw_gettxbuf(sc->sc_ah, txq->axq_qnum),
  1753. txq->axq_link);
  1754. spin_lock_bh(&txq->axq_lock);
  1755. for (;;) {
  1756. if (work_pending(&sc->hw_reset_work))
  1757. break;
  1758. if (list_empty(&txq->axq_q)) {
  1759. txq->axq_link = NULL;
  1760. if (sc->sc_flags & SC_OP_TXAGGR)
  1761. ath_txq_schedule(sc, txq);
  1762. break;
  1763. }
  1764. bf = list_first_entry(&txq->axq_q, struct ath_buf, list);
  1765. /*
  1766. * There is a race condition that a BH gets scheduled
  1767. * after sw writes TxE and before hw re-load the last
  1768. * descriptor to get the newly chained one.
  1769. * Software must keep the last DONE descriptor as a
  1770. * holding descriptor - software does so by marking
  1771. * it with the STALE flag.
  1772. */
  1773. bf_held = NULL;
  1774. if (bf->bf_stale) {
  1775. bf_held = bf;
  1776. if (list_is_last(&bf_held->list, &txq->axq_q))
  1777. break;
  1778. bf = list_entry(bf_held->list.next, struct ath_buf,
  1779. list);
  1780. }
  1781. lastbf = bf->bf_lastbf;
  1782. ds = lastbf->bf_desc;
  1783. memset(&ts, 0, sizeof(ts));
  1784. status = ath9k_hw_txprocdesc(ah, ds, &ts);
  1785. if (status == -EINPROGRESS)
  1786. break;
  1787. TX_STAT_INC(txq->axq_qnum, txprocdesc);
  1788. /*
  1789. * Remove ath_buf's of the same transmit unit from txq,
  1790. * however leave the last descriptor back as the holding
  1791. * descriptor for hw.
  1792. */
  1793. lastbf->bf_stale = true;
  1794. INIT_LIST_HEAD(&bf_head);
  1795. if (!list_is_singular(&lastbf->list))
  1796. list_cut_position(&bf_head,
  1797. &txq->axq_q, lastbf->list.prev);
  1798. if (bf_held) {
  1799. list_del(&bf_held->list);
  1800. ath_tx_return_buffer(sc, bf_held);
  1801. }
  1802. ath_tx_process_buffer(sc, txq, &ts, bf, &bf_head);
  1803. }
  1804. spin_unlock_bh(&txq->axq_lock);
  1805. }
  1806. static void ath_tx_complete_poll_work(struct work_struct *work)
  1807. {
  1808. struct ath_softc *sc = container_of(work, struct ath_softc,
  1809. tx_complete_work.work);
  1810. struct ath_txq *txq;
  1811. int i;
  1812. bool needreset = false;
  1813. #ifdef CONFIG_ATH9K_DEBUGFS
  1814. sc->tx_complete_poll_work_seen++;
  1815. #endif
  1816. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++)
  1817. if (ATH_TXQ_SETUP(sc, i)) {
  1818. txq = &sc->tx.txq[i];
  1819. spin_lock_bh(&txq->axq_lock);
  1820. if (txq->axq_depth) {
  1821. if (txq->axq_tx_inprogress) {
  1822. needreset = true;
  1823. spin_unlock_bh(&txq->axq_lock);
  1824. break;
  1825. } else {
  1826. txq->axq_tx_inprogress = true;
  1827. }
  1828. }
  1829. spin_unlock_bh(&txq->axq_lock);
  1830. }
  1831. if (needreset) {
  1832. ath_dbg(ath9k_hw_common(sc->sc_ah), ATH_DBG_RESET,
  1833. "tx hung, resetting the chip\n");
  1834. RESET_STAT_INC(sc, RESET_TYPE_TX_HANG);
  1835. ieee80211_queue_work(sc->hw, &sc->hw_reset_work);
  1836. }
  1837. ieee80211_queue_delayed_work(sc->hw, &sc->tx_complete_work,
  1838. msecs_to_jiffies(ATH_TX_COMPLETE_POLL_INT));
  1839. }
  1840. void ath_tx_tasklet(struct ath_softc *sc)
  1841. {
  1842. int i;
  1843. u32 qcumask = ((1 << ATH9K_NUM_TX_QUEUES) - 1);
  1844. ath9k_hw_gettxintrtxqs(sc->sc_ah, &qcumask);
  1845. for (i = 0; i < ATH9K_NUM_TX_QUEUES; i++) {
  1846. if (ATH_TXQ_SETUP(sc, i) && (qcumask & (1 << i)))
  1847. ath_tx_processq(sc, &sc->tx.txq[i]);
  1848. }
  1849. }
  1850. void ath_tx_edma_tasklet(struct ath_softc *sc)
  1851. {
  1852. struct ath_tx_status ts;
  1853. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1854. struct ath_hw *ah = sc->sc_ah;
  1855. struct ath_txq *txq;
  1856. struct ath_buf *bf, *lastbf;
  1857. struct list_head bf_head;
  1858. int status;
  1859. for (;;) {
  1860. if (work_pending(&sc->hw_reset_work))
  1861. break;
  1862. status = ath9k_hw_txprocdesc(ah, NULL, (void *)&ts);
  1863. if (status == -EINPROGRESS)
  1864. break;
  1865. if (status == -EIO) {
  1866. ath_dbg(common, ATH_DBG_XMIT,
  1867. "Error processing tx status\n");
  1868. break;
  1869. }
  1870. /* Skip beacon completions */
  1871. if (ts.qid == sc->beacon.beaconq)
  1872. continue;
  1873. txq = &sc->tx.txq[ts.qid];
  1874. spin_lock_bh(&txq->axq_lock);
  1875. if (list_empty(&txq->txq_fifo[txq->txq_tailidx])) {
  1876. spin_unlock_bh(&txq->axq_lock);
  1877. return;
  1878. }
  1879. bf = list_first_entry(&txq->txq_fifo[txq->txq_tailidx],
  1880. struct ath_buf, list);
  1881. lastbf = bf->bf_lastbf;
  1882. INIT_LIST_HEAD(&bf_head);
  1883. list_cut_position(&bf_head, &txq->txq_fifo[txq->txq_tailidx],
  1884. &lastbf->list);
  1885. if (list_empty(&txq->txq_fifo[txq->txq_tailidx])) {
  1886. INCR(txq->txq_tailidx, ATH_TXFIFO_DEPTH);
  1887. if (!list_empty(&txq->axq_q)) {
  1888. struct list_head bf_q;
  1889. INIT_LIST_HEAD(&bf_q);
  1890. txq->axq_link = NULL;
  1891. list_splice_tail_init(&txq->axq_q, &bf_q);
  1892. ath_tx_txqaddbuf(sc, txq, &bf_q, true);
  1893. }
  1894. }
  1895. ath_tx_process_buffer(sc, txq, &ts, bf, &bf_head);
  1896. spin_unlock_bh(&txq->axq_lock);
  1897. }
  1898. }
  1899. /*****************/
  1900. /* Init, Cleanup */
  1901. /*****************/
  1902. static int ath_txstatus_setup(struct ath_softc *sc, int size)
  1903. {
  1904. struct ath_descdma *dd = &sc->txsdma;
  1905. u8 txs_len = sc->sc_ah->caps.txs_len;
  1906. dd->dd_desc_len = size * txs_len;
  1907. dd->dd_desc = dma_alloc_coherent(sc->dev, dd->dd_desc_len,
  1908. &dd->dd_desc_paddr, GFP_KERNEL);
  1909. if (!dd->dd_desc)
  1910. return -ENOMEM;
  1911. return 0;
  1912. }
  1913. static int ath_tx_edma_init(struct ath_softc *sc)
  1914. {
  1915. int err;
  1916. err = ath_txstatus_setup(sc, ATH_TXSTATUS_RING_SIZE);
  1917. if (!err)
  1918. ath9k_hw_setup_statusring(sc->sc_ah, sc->txsdma.dd_desc,
  1919. sc->txsdma.dd_desc_paddr,
  1920. ATH_TXSTATUS_RING_SIZE);
  1921. return err;
  1922. }
  1923. static void ath_tx_edma_cleanup(struct ath_softc *sc)
  1924. {
  1925. struct ath_descdma *dd = &sc->txsdma;
  1926. dma_free_coherent(sc->dev, dd->dd_desc_len, dd->dd_desc,
  1927. dd->dd_desc_paddr);
  1928. }
  1929. int ath_tx_init(struct ath_softc *sc, int nbufs)
  1930. {
  1931. struct ath_common *common = ath9k_hw_common(sc->sc_ah);
  1932. int error = 0;
  1933. spin_lock_init(&sc->tx.txbuflock);
  1934. error = ath_descdma_setup(sc, &sc->tx.txdma, &sc->tx.txbuf,
  1935. "tx", nbufs, 1, 1);
  1936. if (error != 0) {
  1937. ath_err(common,
  1938. "Failed to allocate tx descriptors: %d\n", error);
  1939. goto err;
  1940. }
  1941. error = ath_descdma_setup(sc, &sc->beacon.bdma, &sc->beacon.bbuf,
  1942. "beacon", ATH_BCBUF, 1, 1);
  1943. if (error != 0) {
  1944. ath_err(common,
  1945. "Failed to allocate beacon descriptors: %d\n", error);
  1946. goto err;
  1947. }
  1948. INIT_DELAYED_WORK(&sc->tx_complete_work, ath_tx_complete_poll_work);
  1949. if (sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA) {
  1950. error = ath_tx_edma_init(sc);
  1951. if (error)
  1952. goto err;
  1953. }
  1954. err:
  1955. if (error != 0)
  1956. ath_tx_cleanup(sc);
  1957. return error;
  1958. }
  1959. void ath_tx_cleanup(struct ath_softc *sc)
  1960. {
  1961. if (sc->beacon.bdma.dd_desc_len != 0)
  1962. ath_descdma_cleanup(sc, &sc->beacon.bdma, &sc->beacon.bbuf);
  1963. if (sc->tx.txdma.dd_desc_len != 0)
  1964. ath_descdma_cleanup(sc, &sc->tx.txdma, &sc->tx.txbuf);
  1965. if (sc->sc_ah->caps.hw_caps & ATH9K_HW_CAP_EDMA)
  1966. ath_tx_edma_cleanup(sc);
  1967. }
  1968. void ath_tx_node_init(struct ath_softc *sc, struct ath_node *an)
  1969. {
  1970. struct ath_atx_tid *tid;
  1971. struct ath_atx_ac *ac;
  1972. int tidno, acno;
  1973. for (tidno = 0, tid = &an->tid[tidno];
  1974. tidno < WME_NUM_TID;
  1975. tidno++, tid++) {
  1976. tid->an = an;
  1977. tid->tidno = tidno;
  1978. tid->seq_start = tid->seq_next = 0;
  1979. tid->baw_size = WME_MAX_BA;
  1980. tid->baw_head = tid->baw_tail = 0;
  1981. tid->sched = false;
  1982. tid->paused = false;
  1983. tid->state &= ~AGGR_CLEANUP;
  1984. __skb_queue_head_init(&tid->buf_q);
  1985. acno = TID_TO_WME_AC(tidno);
  1986. tid->ac = &an->ac[acno];
  1987. tid->state &= ~AGGR_ADDBA_COMPLETE;
  1988. tid->state &= ~AGGR_ADDBA_PROGRESS;
  1989. }
  1990. for (acno = 0, ac = &an->ac[acno];
  1991. acno < WME_NUM_AC; acno++, ac++) {
  1992. ac->sched = false;
  1993. ac->txq = sc->tx.txq_map[acno];
  1994. INIT_LIST_HEAD(&ac->tid_q);
  1995. }
  1996. }
  1997. void ath_tx_node_cleanup(struct ath_softc *sc, struct ath_node *an)
  1998. {
  1999. struct ath_atx_ac *ac;
  2000. struct ath_atx_tid *tid;
  2001. struct ath_txq *txq;
  2002. int tidno;
  2003. for (tidno = 0, tid = &an->tid[tidno];
  2004. tidno < WME_NUM_TID; tidno++, tid++) {
  2005. ac = tid->ac;
  2006. txq = ac->txq;
  2007. spin_lock_bh(&txq->axq_lock);
  2008. if (tid->sched) {
  2009. list_del(&tid->list);
  2010. tid->sched = false;
  2011. }
  2012. if (ac->sched) {
  2013. list_del(&ac->list);
  2014. tid->ac->sched = false;
  2015. }
  2016. ath_tid_drain(sc, txq, tid);
  2017. tid->state &= ~AGGR_ADDBA_COMPLETE;
  2018. tid->state &= ~AGGR_CLEANUP;
  2019. spin_unlock_bh(&txq->axq_lock);
  2020. }
  2021. }