xmit.c 63 KB

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