xmit.c 62 KB

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