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