2 Copyright (C) 2004 - 2008 rt2x00 SourceForge Project
3 <http://rt2x00.serialmonkey.com>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the
17 Free Software Foundation, Inc.,
18 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
23 Abstract: rt2x00 queue specific routines.
26 #include <linux/kernel.h>
27 #include <linux/module.h>
30 #include "rt2x00lib.h"
32 struct sk_buff
*rt2x00queue_alloc_skb(struct data_queue
*queue
)
35 unsigned int frame_size
;
36 unsigned int reserved_size
;
39 * The frame size includes descriptor size, because the
40 * hardware directly receive the frame into the skbuffer.
42 frame_size
= queue
->data_size
+ queue
->desc_size
;
45 * Reserve a few bytes extra headroom to allow drivers some moving
46 * space (e.g. for alignment), while keeping the skb aligned.
53 skb
= dev_alloc_skb(frame_size
+ reserved_size
);
57 skb_reserve(skb
, reserved_size
);
58 skb_put(skb
, frame_size
);
62 EXPORT_SYMBOL_GPL(rt2x00queue_alloc_skb
);
64 void rt2x00queue_free_skb(struct sk_buff
*skb
)
66 dev_kfree_skb_any(skb
);
68 EXPORT_SYMBOL_GPL(rt2x00queue_free_skb
);
70 void rt2x00queue_create_tx_descriptor(struct queue_entry
*entry
,
71 struct txentry_desc
*txdesc
)
73 struct rt2x00_dev
*rt2x00dev
= entry
->queue
->rt2x00dev
;
74 struct ieee80211_tx_info
*tx_info
= IEEE80211_SKB_CB(entry
->skb
);
75 struct ieee80211_hdr
*hdr
= (struct ieee80211_hdr
*)entry
->skb
->data
;
76 struct ieee80211_rate
*rate
=
77 ieee80211_get_tx_rate(rt2x00dev
->hw
, tx_info
);
78 const struct rt2x00_rate
*hwrate
;
79 unsigned int data_length
;
80 unsigned int duration
;
81 unsigned int residual
;
83 memset(txdesc
, 0, sizeof(*txdesc
));
86 * Initialize information from queue
88 txdesc
->queue
= entry
->queue
->qid
;
89 txdesc
->cw_min
= entry
->queue
->cw_min
;
90 txdesc
->cw_max
= entry
->queue
->cw_max
;
91 txdesc
->aifs
= entry
->queue
->aifs
;
93 /* Data length should be extended with 4 bytes for CRC */
94 data_length
= entry
->skb
->len
+ 4;
97 * Check whether this frame is to be acked.
99 if (!(tx_info
->flags
& IEEE80211_TX_CTL_NO_ACK
))
100 __set_bit(ENTRY_TXD_ACK
, &txdesc
->flags
);
103 * Check if this is a RTS/CTS frame
105 if (ieee80211_is_rts(hdr
->frame_control
) ||
106 ieee80211_is_cts(hdr
->frame_control
)) {
107 __set_bit(ENTRY_TXD_BURST
, &txdesc
->flags
);
108 if (ieee80211_is_rts(hdr
->frame_control
))
109 __set_bit(ENTRY_TXD_RTS_FRAME
, &txdesc
->flags
);
111 __set_bit(ENTRY_TXD_CTS_FRAME
, &txdesc
->flags
);
112 if (tx_info
->control
.rts_cts_rate_idx
>= 0)
114 ieee80211_get_rts_cts_rate(rt2x00dev
->hw
, tx_info
);
118 * Determine retry information.
120 txdesc
->retry_limit
= tx_info
->control
.retry_limit
;
121 if (tx_info
->flags
& IEEE80211_TX_CTL_LONG_RETRY_LIMIT
)
122 __set_bit(ENTRY_TXD_RETRY_MODE
, &txdesc
->flags
);
125 * Check if more fragments are pending
127 if (ieee80211_has_morefrags(hdr
->frame_control
)) {
128 __set_bit(ENTRY_TXD_BURST
, &txdesc
->flags
);
129 __set_bit(ENTRY_TXD_MORE_FRAG
, &txdesc
->flags
);
133 * Beacons and probe responses require the tsf timestamp
134 * to be inserted into the frame.
136 if (ieee80211_is_beacon(hdr
->frame_control
) ||
137 ieee80211_is_probe_resp(hdr
->frame_control
))
138 __set_bit(ENTRY_TXD_REQ_TIMESTAMP
, &txdesc
->flags
);
141 * Determine with what IFS priority this frame should be send.
142 * Set ifs to IFS_SIFS when the this is not the first fragment,
143 * or this fragment came after RTS/CTS.
145 if (test_bit(ENTRY_TXD_RTS_FRAME
, &txdesc
->flags
)) {
146 txdesc
->ifs
= IFS_SIFS
;
147 } else if (tx_info
->flags
& IEEE80211_TX_CTL_FIRST_FRAGMENT
) {
148 __set_bit(ENTRY_TXD_FIRST_FRAGMENT
, &txdesc
->flags
);
149 txdesc
->ifs
= IFS_BACKOFF
;
151 txdesc
->ifs
= IFS_SIFS
;
156 * Length calculation depends on OFDM/CCK rate.
158 hwrate
= rt2x00_get_rate(rate
->hw_value
);
159 txdesc
->signal
= hwrate
->plcp
;
160 txdesc
->service
= 0x04;
162 if (hwrate
->flags
& DEV_RATE_OFDM
) {
163 __set_bit(ENTRY_TXD_OFDM_RATE
, &txdesc
->flags
);
165 txdesc
->length_high
= (data_length
>> 6) & 0x3f;
166 txdesc
->length_low
= data_length
& 0x3f;
169 * Convert length to microseconds.
171 residual
= get_duration_res(data_length
, hwrate
->bitrate
);
172 duration
= get_duration(data_length
, hwrate
->bitrate
);
178 * Check if we need to set the Length Extension
180 if (hwrate
->bitrate
== 110 && residual
<= 30)
181 txdesc
->service
|= 0x80;
184 txdesc
->length_high
= (duration
>> 8) & 0xff;
185 txdesc
->length_low
= duration
& 0xff;
188 * When preamble is enabled we should set the
189 * preamble bit for the signal.
191 if (rt2x00_get_rate_preamble(rate
->hw_value
))
192 txdesc
->signal
|= 0x08;
195 EXPORT_SYMBOL_GPL(rt2x00queue_create_tx_descriptor
);
197 void rt2x00queue_write_tx_descriptor(struct queue_entry
*entry
,
198 struct txentry_desc
*txdesc
)
200 struct data_queue
*queue
= entry
->queue
;
201 struct rt2x00_dev
*rt2x00dev
= queue
->rt2x00dev
;
203 rt2x00dev
->ops
->lib
->write_tx_desc(rt2x00dev
, entry
->skb
, txdesc
);
206 * All processing on the frame has been completed, this means
207 * it is now ready to be dumped to userspace through debugfs.
209 rt2x00debug_dump_frame(rt2x00dev
, DUMP_FRAME_TX
, entry
->skb
);
212 * Check if we need to kick the queue, there are however a few rules
213 * 1) Don't kick beacon queue
214 * 2) Don't kick unless this is the last in frame in a burst.
215 * When the burst flag is set, this frame is always followed
216 * by another frame which in some way are related to eachother.
217 * This is true for fragments, RTS or CTS-to-self frames.
218 * 3) Rule 2 can be broken when the available entries
219 * in the queue are less then a certain threshold.
221 if (entry
->queue
->qid
== QID_BEACON
)
224 if (rt2x00queue_threshold(queue
) ||
225 !test_bit(ENTRY_TXD_BURST
, &txdesc
->flags
))
226 rt2x00dev
->ops
->lib
->kick_tx_queue(rt2x00dev
, queue
->qid
);
228 EXPORT_SYMBOL_GPL(rt2x00queue_write_tx_descriptor
);
230 int rt2x00queue_write_tx_frame(struct data_queue
*queue
, struct sk_buff
*skb
)
232 struct queue_entry
*entry
= rt2x00queue_get_entry(queue
, Q_INDEX
);
233 struct txentry_desc txdesc
;
235 if (unlikely(rt2x00queue_full(queue
)))
238 if (__test_and_set_bit(ENTRY_OWNER_DEVICE_DATA
, &entry
->flags
)) {
239 ERROR(queue
->rt2x00dev
,
240 "Arrived at non-free entry in the non-full queue %d.\n"
241 "Please file bug report to %s.\n",
242 queue
->qid
, DRV_PROJECT
);
247 * Copy all TX descriptor information into txdesc,
248 * after that we are free to use the skb->cb array
249 * for our information.
252 rt2x00queue_create_tx_descriptor(entry
, &txdesc
);
254 if (unlikely(queue
->rt2x00dev
->ops
->lib
->write_tx_data(entry
))) {
255 __clear_bit(ENTRY_OWNER_DEVICE_DATA
, &entry
->flags
);
259 __set_bit(ENTRY_DATA_PENDING
, &entry
->flags
);
261 rt2x00queue_index_inc(queue
, Q_INDEX
);
262 rt2x00queue_write_tx_descriptor(entry
, &txdesc
);
267 struct data_queue
*rt2x00queue_get_queue(struct rt2x00_dev
*rt2x00dev
,
268 const enum data_queue_qid queue
)
270 int atim
= test_bit(DRIVER_REQUIRE_ATIM_QUEUE
, &rt2x00dev
->flags
);
272 if (queue
< rt2x00dev
->ops
->tx_queues
&& rt2x00dev
->tx
)
273 return &rt2x00dev
->tx
[queue
];
278 if (queue
== QID_BEACON
)
279 return &rt2x00dev
->bcn
[0];
280 else if (queue
== QID_ATIM
&& atim
)
281 return &rt2x00dev
->bcn
[1];
285 EXPORT_SYMBOL_GPL(rt2x00queue_get_queue
);
287 struct queue_entry
*rt2x00queue_get_entry(struct data_queue
*queue
,
288 enum queue_index index
)
290 struct queue_entry
*entry
;
291 unsigned long irqflags
;
293 if (unlikely(index
>= Q_INDEX_MAX
)) {
294 ERROR(queue
->rt2x00dev
,
295 "Entry requested from invalid index type (%d)\n", index
);
299 spin_lock_irqsave(&queue
->lock
, irqflags
);
301 entry
= &queue
->entries
[queue
->index
[index
]];
303 spin_unlock_irqrestore(&queue
->lock
, irqflags
);
307 EXPORT_SYMBOL_GPL(rt2x00queue_get_entry
);
309 void rt2x00queue_index_inc(struct data_queue
*queue
, enum queue_index index
)
311 unsigned long irqflags
;
313 if (unlikely(index
>= Q_INDEX_MAX
)) {
314 ERROR(queue
->rt2x00dev
,
315 "Index change on invalid index type (%d)\n", index
);
319 spin_lock_irqsave(&queue
->lock
, irqflags
);
321 queue
->index
[index
]++;
322 if (queue
->index
[index
] >= queue
->limit
)
323 queue
->index
[index
] = 0;
325 if (index
== Q_INDEX
) {
327 } else if (index
== Q_INDEX_DONE
) {
332 spin_unlock_irqrestore(&queue
->lock
, irqflags
);
334 EXPORT_SYMBOL_GPL(rt2x00queue_index_inc
);
336 static void rt2x00queue_reset(struct data_queue
*queue
)
338 unsigned long irqflags
;
340 spin_lock_irqsave(&queue
->lock
, irqflags
);
344 memset(queue
->index
, 0, sizeof(queue
->index
));
346 spin_unlock_irqrestore(&queue
->lock
, irqflags
);
349 void rt2x00queue_init_rx(struct rt2x00_dev
*rt2x00dev
)
351 struct data_queue
*queue
= rt2x00dev
->rx
;
354 rt2x00queue_reset(queue
);
356 if (!rt2x00dev
->ops
->lib
->init_rxentry
)
359 for (i
= 0; i
< queue
->limit
; i
++)
360 rt2x00dev
->ops
->lib
->init_rxentry(rt2x00dev
,
364 void rt2x00queue_init_tx(struct rt2x00_dev
*rt2x00dev
)
366 struct data_queue
*queue
;
369 txall_queue_for_each(rt2x00dev
, queue
) {
370 rt2x00queue_reset(queue
);
372 if (!rt2x00dev
->ops
->lib
->init_txentry
)
375 for (i
= 0; i
< queue
->limit
; i
++)
376 rt2x00dev
->ops
->lib
->init_txentry(rt2x00dev
,
381 static int rt2x00queue_alloc_entries(struct data_queue
*queue
,
382 const struct data_queue_desc
*qdesc
)
384 struct queue_entry
*entries
;
385 unsigned int entry_size
;
388 rt2x00queue_reset(queue
);
390 queue
->limit
= qdesc
->entry_num
;
391 queue
->threshold
= DIV_ROUND_UP(qdesc
->entry_num
, 10);
392 queue
->data_size
= qdesc
->data_size
;
393 queue
->desc_size
= qdesc
->desc_size
;
396 * Allocate all queue entries.
398 entry_size
= sizeof(*entries
) + qdesc
->priv_size
;
399 entries
= kzalloc(queue
->limit
* entry_size
, GFP_KERNEL
);
403 #define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
404 ( ((char *)(__base)) + ((__limit) * (__esize)) + \
405 ((__index) * (__psize)) )
407 for (i
= 0; i
< queue
->limit
; i
++) {
408 entries
[i
].flags
= 0;
409 entries
[i
].queue
= queue
;
410 entries
[i
].skb
= NULL
;
411 entries
[i
].entry_idx
= i
;
412 entries
[i
].priv_data
=
413 QUEUE_ENTRY_PRIV_OFFSET(entries
, i
, queue
->limit
,
414 sizeof(*entries
), qdesc
->priv_size
);
417 #undef QUEUE_ENTRY_PRIV_OFFSET
419 queue
->entries
= entries
;
424 static void rt2x00queue_free_skbs(struct data_queue
*queue
)
431 for (i
= 0; i
< queue
->limit
; i
++) {
432 if (queue
->entries
[i
].skb
)
433 rt2x00queue_free_skb(queue
->entries
[i
].skb
);
437 static int rt2x00queue_alloc_skbs(struct data_queue
*queue
)
442 for (i
= 0; i
< queue
->limit
; i
++) {
443 skb
= rt2x00queue_alloc_skb(queue
);
447 queue
->entries
[i
].skb
= skb
;
453 rt2x00queue_free_skbs(queue
);
458 int rt2x00queue_initialize(struct rt2x00_dev
*rt2x00dev
)
460 struct data_queue
*queue
;
463 status
= rt2x00queue_alloc_entries(rt2x00dev
->rx
, rt2x00dev
->ops
->rx
);
467 tx_queue_for_each(rt2x00dev
, queue
) {
468 status
= rt2x00queue_alloc_entries(queue
, rt2x00dev
->ops
->tx
);
473 status
= rt2x00queue_alloc_entries(rt2x00dev
->bcn
, rt2x00dev
->ops
->bcn
);
477 if (test_bit(DRIVER_REQUIRE_ATIM_QUEUE
, &rt2x00dev
->flags
)) {
478 status
= rt2x00queue_alloc_entries(&rt2x00dev
->bcn
[1],
479 rt2x00dev
->ops
->atim
);
484 status
= rt2x00queue_alloc_skbs(rt2x00dev
->rx
);
491 ERROR(rt2x00dev
, "Queue entries allocation failed.\n");
493 rt2x00queue_uninitialize(rt2x00dev
);
498 void rt2x00queue_uninitialize(struct rt2x00_dev
*rt2x00dev
)
500 struct data_queue
*queue
;
502 rt2x00queue_free_skbs(rt2x00dev
->rx
);
504 queue_for_each(rt2x00dev
, queue
) {
505 kfree(queue
->entries
);
506 queue
->entries
= NULL
;
510 static void rt2x00queue_init(struct rt2x00_dev
*rt2x00dev
,
511 struct data_queue
*queue
, enum data_queue_qid qid
)
513 spin_lock_init(&queue
->lock
);
515 queue
->rt2x00dev
= rt2x00dev
;
522 int rt2x00queue_allocate(struct rt2x00_dev
*rt2x00dev
)
524 struct data_queue
*queue
;
525 enum data_queue_qid qid
;
526 unsigned int req_atim
=
527 !!test_bit(DRIVER_REQUIRE_ATIM_QUEUE
, &rt2x00dev
->flags
);
530 * We need the following queues:
534 * Atim: 1 (if required)
536 rt2x00dev
->data_queues
= 2 + rt2x00dev
->ops
->tx_queues
+ req_atim
;
538 queue
= kzalloc(rt2x00dev
->data_queues
* sizeof(*queue
), GFP_KERNEL
);
540 ERROR(rt2x00dev
, "Queue allocation failed.\n");
545 * Initialize pointers
547 rt2x00dev
->rx
= queue
;
548 rt2x00dev
->tx
= &queue
[1];
549 rt2x00dev
->bcn
= &queue
[1 + rt2x00dev
->ops
->tx_queues
];
552 * Initialize queue parameters.
554 * TX: qid = QID_AC_BE + index
555 * TX: cw_min: 2^5 = 32.
556 * TX: cw_max: 2^10 = 1024.
557 * BCN: qid = QID_BEACON
558 * ATIM: qid = QID_ATIM
560 rt2x00queue_init(rt2x00dev
, rt2x00dev
->rx
, QID_RX
);
563 tx_queue_for_each(rt2x00dev
, queue
)
564 rt2x00queue_init(rt2x00dev
, queue
, qid
++);
566 rt2x00queue_init(rt2x00dev
, &rt2x00dev
->bcn
[0], QID_BEACON
);
568 rt2x00queue_init(rt2x00dev
, &rt2x00dev
->bcn
[1], QID_ATIM
);
573 void rt2x00queue_free(struct rt2x00_dev
*rt2x00dev
)
575 kfree(rt2x00dev
->rx
);
576 rt2x00dev
->rx
= NULL
;
577 rt2x00dev
->tx
= NULL
;
578 rt2x00dev
->bcn
= NULL
;