xmit.c 62 KB

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