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 void rt2x00queue_create_tx_descriptor(struct queue_entry *entry,
33 struct txentry_desc *txdesc)
35 struct rt2x00_dev *rt2x00dev = entry->queue->rt2x00dev;
36 struct ieee80211_tx_info *tx_info = IEEE80211_SKB_CB(entry->skb);
37 struct ieee80211_hdr *hdr = (struct ieee80211_hdr *)entry->skb->data;
38 struct ieee80211_rate *rate =
39 ieee80211_get_tx_rate(rt2x00dev->hw, tx_info);
40 const struct rt2x00_rate *hwrate;
41 unsigned int data_length;
42 unsigned int duration;
43 unsigned int residual;
46 memset(txdesc, 0, sizeof(*txdesc));
49 * Initialize information from queue
51 txdesc->queue = entry->queue->qid;
52 txdesc->cw_min = entry->queue->cw_min;
53 txdesc->cw_max = entry->queue->cw_max;
54 txdesc->aifs = entry->queue->aifs;
56 /* Data length should be extended with 4 bytes for CRC */
57 data_length = entry->skb->len + 4;
60 * Read required fields from ieee80211 header.
62 frame_control = le16_to_cpu(hdr->frame_control);
65 * Check whether this frame is to be acked.
67 if (!(tx_info->flags & IEEE80211_TX_CTL_NO_ACK))
68 __set_bit(ENTRY_TXD_ACK, &txdesc->flags);
71 * Check if this is a RTS/CTS frame
73 if (is_rts_frame(frame_control) || is_cts_frame(frame_control)) {
74 __set_bit(ENTRY_TXD_BURST, &txdesc->flags);
75 if (is_rts_frame(frame_control))
76 __set_bit(ENTRY_TXD_RTS_FRAME, &txdesc->flags);
78 __set_bit(ENTRY_TXD_CTS_FRAME, &txdesc->flags);
79 if (tx_info->control.rts_cts_rate_idx >= 0)
81 ieee80211_get_rts_cts_rate(rt2x00dev->hw, tx_info);
85 * Determine retry information.
87 txdesc->retry_limit = tx_info->control.retry_limit;
88 if (tx_info->flags & IEEE80211_TX_CTL_LONG_RETRY_LIMIT)
89 __set_bit(ENTRY_TXD_RETRY_MODE, &txdesc->flags);
92 * Check if more fragments are pending
94 if (ieee80211_get_morefrag(hdr)) {
95 __set_bit(ENTRY_TXD_BURST, &txdesc->flags);
96 __set_bit(ENTRY_TXD_MORE_FRAG, &txdesc->flags);
100 * Beacons and probe responses require the tsf timestamp
101 * to be inserted into the frame.
103 if (txdesc->queue == QID_BEACON || is_probe_resp(frame_control))
104 __set_bit(ENTRY_TXD_REQ_TIMESTAMP, &txdesc->flags);
107 * Determine with what IFS priority this frame should be send.
108 * Set ifs to IFS_SIFS when the this is not the first fragment,
109 * or this fragment came after RTS/CTS.
111 if (test_bit(ENTRY_TXD_RTS_FRAME, &txdesc->flags)) {
112 txdesc->ifs = IFS_SIFS;
113 } else if (tx_info->flags & IEEE80211_TX_CTL_FIRST_FRAGMENT) {
114 __set_bit(ENTRY_TXD_FIRST_FRAGMENT, &txdesc->flags);
115 txdesc->ifs = IFS_BACKOFF;
117 txdesc->ifs = IFS_SIFS;
122 * Length calculation depends on OFDM/CCK rate.
124 hwrate = rt2x00_get_rate(rate->hw_value);
125 txdesc->signal = hwrate->plcp;
126 txdesc->service = 0x04;
128 if (hwrate->flags & DEV_RATE_OFDM) {
129 __set_bit(ENTRY_TXD_OFDM_RATE, &txdesc->flags);
131 txdesc->length_high = (data_length >> 6) & 0x3f;
132 txdesc->length_low = data_length & 0x3f;
135 * Convert length to microseconds.
137 residual = get_duration_res(data_length, hwrate->bitrate);
138 duration = get_duration(data_length, hwrate->bitrate);
144 * Check if we need to set the Length Extension
146 if (hwrate->bitrate == 110 && residual <= 30)
147 txdesc->service |= 0x80;
150 txdesc->length_high = (duration >> 8) & 0xff;
151 txdesc->length_low = duration & 0xff;
154 * When preamble is enabled we should set the
155 * preamble bit for the signal.
157 if (rt2x00_get_rate_preamble(rate->hw_value))
158 txdesc->signal |= 0x08;
161 EXPORT_SYMBOL_GPL(rt2x00queue_create_tx_descriptor);
163 void rt2x00queue_write_tx_descriptor(struct queue_entry *entry,
164 struct txentry_desc *txdesc)
166 struct data_queue *queue = entry->queue;
167 struct rt2x00_dev *rt2x00dev = queue->rt2x00dev;
169 rt2x00dev->ops->lib->write_tx_desc(rt2x00dev, entry->skb, txdesc);
172 * All processing on the frame has been completed, this means
173 * it is now ready to be dumped to userspace through debugfs.
175 rt2x00debug_dump_frame(rt2x00dev, DUMP_FRAME_TX, entry->skb);
178 * Check if we need to kick the queue, there are however a few rules
179 * 1) Don't kick beacon queue
180 * 2) Don't kick unless this is the last in frame in a burst.
181 * When the burst flag is set, this frame is always followed
182 * by another frame which in some way are related to eachother.
183 * This is true for fragments, RTS or CTS-to-self frames.
184 * 3) Rule 2 can be broken when the available entries
185 * in the queue are less then a certain threshold.
187 if (entry->queue->qid == QID_BEACON)
190 if (rt2x00queue_threshold(queue) ||
191 !test_bit(ENTRY_TXD_BURST, &txdesc->flags))
192 rt2x00dev->ops->lib->kick_tx_queue(rt2x00dev, queue->qid);
194 EXPORT_SYMBOL_GPL(rt2x00queue_write_tx_descriptor);
196 int rt2x00queue_write_tx_frame(struct data_queue *queue, struct sk_buff *skb)
198 struct queue_entry *entry = rt2x00queue_get_entry(queue, Q_INDEX);
199 struct txentry_desc txdesc;
201 if (unlikely(rt2x00queue_full(queue)))
204 if (__test_and_set_bit(ENTRY_OWNER_DEVICE_DATA, &entry->flags)) {
205 ERROR(queue->rt2x00dev,
206 "Arrived at non-free entry in the non-full queue %d.\n"
207 "Please file bug report to %s.\n",
208 queue->qid, DRV_PROJECT);
213 * Copy all TX descriptor information into txdesc,
214 * after that we are free to use the skb->cb array
215 * for our information.
218 rt2x00queue_create_tx_descriptor(entry, &txdesc);
220 if (unlikely(queue->rt2x00dev->ops->lib->write_tx_data(entry))) {
221 __clear_bit(ENTRY_OWNER_DEVICE_DATA, &entry->flags);
225 __set_bit(ENTRY_DATA_PENDING, &entry->flags);
227 rt2x00queue_index_inc(queue, Q_INDEX);
228 rt2x00queue_write_tx_descriptor(entry, &txdesc);
233 struct data_queue *rt2x00queue_get_queue(struct rt2x00_dev *rt2x00dev,
234 const enum data_queue_qid queue)
236 int atim = test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
238 if (queue < rt2x00dev->ops->tx_queues && rt2x00dev->tx)
239 return &rt2x00dev->tx[queue];
244 if (queue == QID_BEACON)
245 return &rt2x00dev->bcn[0];
246 else if (queue == QID_ATIM && atim)
247 return &rt2x00dev->bcn[1];
251 EXPORT_SYMBOL_GPL(rt2x00queue_get_queue);
253 struct queue_entry *rt2x00queue_get_entry(struct data_queue *queue,
254 enum queue_index index)
256 struct queue_entry *entry;
257 unsigned long irqflags;
259 if (unlikely(index >= Q_INDEX_MAX)) {
260 ERROR(queue->rt2x00dev,
261 "Entry requested from invalid index type (%d)\n", index);
265 spin_lock_irqsave(&queue->lock, irqflags);
267 entry = &queue->entries[queue->index[index]];
269 spin_unlock_irqrestore(&queue->lock, irqflags);
273 EXPORT_SYMBOL_GPL(rt2x00queue_get_entry);
275 void rt2x00queue_index_inc(struct data_queue *queue, enum queue_index index)
277 unsigned long irqflags;
279 if (unlikely(index >= Q_INDEX_MAX)) {
280 ERROR(queue->rt2x00dev,
281 "Index change on invalid index type (%d)\n", index);
285 spin_lock_irqsave(&queue->lock, irqflags);
287 queue->index[index]++;
288 if (queue->index[index] >= queue->limit)
289 queue->index[index] = 0;
291 if (index == Q_INDEX) {
293 } else if (index == Q_INDEX_DONE) {
298 spin_unlock_irqrestore(&queue->lock, irqflags);
300 EXPORT_SYMBOL_GPL(rt2x00queue_index_inc);
302 static void rt2x00queue_reset(struct data_queue *queue)
304 unsigned long irqflags;
306 spin_lock_irqsave(&queue->lock, irqflags);
310 memset(queue->index, 0, sizeof(queue->index));
312 spin_unlock_irqrestore(&queue->lock, irqflags);
315 void rt2x00queue_init_rx(struct rt2x00_dev *rt2x00dev)
317 struct data_queue *queue = rt2x00dev->rx;
320 rt2x00queue_reset(queue);
322 if (!rt2x00dev->ops->lib->init_rxentry)
325 for (i = 0; i < queue->limit; i++)
326 rt2x00dev->ops->lib->init_rxentry(rt2x00dev,
330 void rt2x00queue_init_tx(struct rt2x00_dev *rt2x00dev)
332 struct data_queue *queue;
335 txall_queue_for_each(rt2x00dev, queue) {
336 rt2x00queue_reset(queue);
338 if (!rt2x00dev->ops->lib->init_txentry)
341 for (i = 0; i < queue->limit; i++)
342 rt2x00dev->ops->lib->init_txentry(rt2x00dev,
347 static int rt2x00queue_alloc_entries(struct data_queue *queue,
348 const struct data_queue_desc *qdesc)
350 struct queue_entry *entries;
351 unsigned int entry_size;
354 rt2x00queue_reset(queue);
356 queue->limit = qdesc->entry_num;
357 queue->threshold = DIV_ROUND_UP(qdesc->entry_num, 10);
358 queue->data_size = qdesc->data_size;
359 queue->desc_size = qdesc->desc_size;
362 * Allocate all queue entries.
364 entry_size = sizeof(*entries) + qdesc->priv_size;
365 entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
369 #define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
370 ( ((char *)(__base)) + ((__limit) * (__esize)) + \
371 ((__index) * (__psize)) )
373 for (i = 0; i < queue->limit; i++) {
374 entries[i].flags = 0;
375 entries[i].queue = queue;
376 entries[i].skb = NULL;
377 entries[i].entry_idx = i;
378 entries[i].priv_data =
379 QUEUE_ENTRY_PRIV_OFFSET(entries, i, queue->limit,
380 sizeof(*entries), qdesc->priv_size);
383 #undef QUEUE_ENTRY_PRIV_OFFSET
385 queue->entries = entries;
390 int rt2x00queue_initialize(struct rt2x00_dev *rt2x00dev)
392 struct data_queue *queue;
396 status = rt2x00queue_alloc_entries(rt2x00dev->rx, rt2x00dev->ops->rx);
400 tx_queue_for_each(rt2x00dev, queue) {
401 status = rt2x00queue_alloc_entries(queue, rt2x00dev->ops->tx);
406 status = rt2x00queue_alloc_entries(rt2x00dev->bcn, rt2x00dev->ops->bcn);
410 if (!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags))
413 status = rt2x00queue_alloc_entries(&rt2x00dev->bcn[1],
414 rt2x00dev->ops->atim);
421 ERROR(rt2x00dev, "Queue entries allocation failed.\n");
423 rt2x00queue_uninitialize(rt2x00dev);
428 void rt2x00queue_uninitialize(struct rt2x00_dev *rt2x00dev)
430 struct data_queue *queue;
432 queue_for_each(rt2x00dev, queue) {
433 kfree(queue->entries);
434 queue->entries = NULL;
438 static void rt2x00queue_init(struct rt2x00_dev *rt2x00dev,
439 struct data_queue *queue, enum data_queue_qid qid)
441 spin_lock_init(&queue->lock);
443 queue->rt2x00dev = rt2x00dev;
450 int rt2x00queue_allocate(struct rt2x00_dev *rt2x00dev)
452 struct data_queue *queue;
453 enum data_queue_qid qid;
454 unsigned int req_atim =
455 !!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
458 * We need the following queues:
462 * Atim: 1 (if required)
464 rt2x00dev->data_queues = 2 + rt2x00dev->ops->tx_queues + req_atim;
466 queue = kzalloc(rt2x00dev->data_queues * sizeof(*queue), GFP_KERNEL);
468 ERROR(rt2x00dev, "Queue allocation failed.\n");
473 * Initialize pointers
475 rt2x00dev->rx = queue;
476 rt2x00dev->tx = &queue[1];
477 rt2x00dev->bcn = &queue[1 + rt2x00dev->ops->tx_queues];
480 * Initialize queue parameters.
482 * TX: qid = QID_AC_BE + index
483 * TX: cw_min: 2^5 = 32.
484 * TX: cw_max: 2^10 = 1024.
485 * BCN: qid = QID_BEACON
486 * ATIM: qid = QID_ATIM
488 rt2x00queue_init(rt2x00dev, rt2x00dev->rx, QID_RX);
491 tx_queue_for_each(rt2x00dev, queue)
492 rt2x00queue_init(rt2x00dev, queue, qid++);
494 rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[0], QID_BEACON);
496 rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[1], QID_ATIM);
501 void rt2x00queue_free(struct rt2x00_dev *rt2x00dev)
503 kfree(rt2x00dev->rx);
504 rt2x00dev->rx = NULL;
505 rt2x00dev->tx = NULL;
506 rt2x00dev->bcn = NULL;