xmit.c 62 KB

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