xmit.c 66 KB

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