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