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 data_queue *rt2x00queue_get_queue(struct rt2x00_dev *rt2x00dev,
33 const unsigned int queue)
35 int atim = test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
37 if (queue < rt2x00dev->hw->queues && rt2x00dev->tx)
38 return &rt2x00dev->tx[queue];
43 if (queue == RT2X00_BCN_QUEUE_BEACON)
44 return &rt2x00dev->bcn[0];
45 else if (queue == RT2X00_BCN_QUEUE_ATIM && atim)
46 return &rt2x00dev->bcn[1];
50 EXPORT_SYMBOL_GPL(rt2x00queue_get_queue);
52 struct queue_entry *rt2x00queue_get_entry(struct data_queue *queue,
53 enum queue_index index)
55 struct queue_entry *entry;
57 if (unlikely(index >= Q_INDEX_MAX)) {
58 ERROR(queue->rt2x00dev,
59 "Entry requested from invalid index type (%d)\n", index);
63 spin_lock(&queue->lock);
65 entry = &queue->entries[queue->index[index]];
67 spin_unlock(&queue->lock);
71 EXPORT_SYMBOL_GPL(rt2x00queue_get_entry);
73 void rt2x00queue_index_inc(struct data_queue *queue, enum queue_index index)
75 if (unlikely(index >= Q_INDEX_MAX)) {
76 ERROR(queue->rt2x00dev,
77 "Index change on invalid index type (%d)\n", index);
81 spin_lock(&queue->lock);
83 queue->index[index]++;
84 if (queue->index[index] >= queue->limit)
85 queue->index[index] = 0;
88 queue->count += (index == Q_INDEX_DONE);
90 spin_unlock(&queue->lock);
92 EXPORT_SYMBOL_GPL(rt2x00queue_index_inc);
94 static void rt2x00queue_reset(struct data_queue *queue)
96 spin_lock(&queue->lock);
100 memset(queue->index, 0, sizeof(queue->index));
102 spin_unlock(&queue->lock);
105 void rt2x00queue_init_rx(struct rt2x00_dev *rt2x00dev)
107 struct data_queue *queue = rt2x00dev->rx;
110 rt2x00queue_reset(queue);
112 if (!rt2x00dev->ops->lib->init_rxentry)
115 for (i = 0; i < queue->limit; i++)
116 rt2x00dev->ops->lib->init_rxentry(rt2x00dev,
120 void rt2x00queue_init_tx(struct rt2x00_dev *rt2x00dev)
122 struct data_queue *queue;
125 txall_queue_for_each(rt2x00dev, queue) {
126 rt2x00queue_reset(queue);
128 if (!rt2x00dev->ops->lib->init_txentry)
131 for (i = 0; i < queue->limit; i++)
132 rt2x00dev->ops->lib->init_txentry(rt2x00dev,
137 static int rt2x00queue_alloc_entries(struct data_queue *queue,
138 const struct data_queue_desc *qdesc)
140 struct queue_entry *entries;
141 unsigned int entry_size;
144 rt2x00queue_reset(queue);
146 queue->limit = qdesc->entry_num;
147 queue->data_size = qdesc->data_size;
148 queue->desc_size = qdesc->desc_size;
151 * Allocate all queue entries.
153 entry_size = sizeof(*entries) + qdesc->priv_size;
154 entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
158 #define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
159 ( (__base) + ((__limit) * (__esize)) + ((__index) * (__psize)) )
161 for (i = 0; i < queue->limit; i++) {
162 entries[i].flags = 0;
163 entries[i].queue = queue;
164 entries[i].skb = NULL;
165 entries[i].entry_idx = i;
166 entries[i].priv_data =
167 QUEUE_ENTRY_PRIV_OFFSET(entries, i, queue->limit,
168 sizeof(*entries), qdesc->priv_size);
171 #undef QUEUE_ENTRY_PRIV_OFFSET
173 queue->entries = entries;
178 int rt2x00queue_initialize(struct rt2x00_dev *rt2x00dev)
180 struct data_queue *queue;
184 status = rt2x00queue_alloc_entries(rt2x00dev->rx, rt2x00dev->ops->rx);
188 tx_queue_for_each(rt2x00dev, queue) {
189 status = rt2x00queue_alloc_entries(queue, rt2x00dev->ops->tx);
194 status = rt2x00queue_alloc_entries(rt2x00dev->bcn, rt2x00dev->ops->bcn);
198 if (!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags))
201 status = rt2x00queue_alloc_entries(&rt2x00dev->bcn[1],
202 rt2x00dev->ops->atim);
209 ERROR(rt2x00dev, "Queue entries allocation failed.\n");
211 rt2x00queue_uninitialize(rt2x00dev);
216 void rt2x00queue_uninitialize(struct rt2x00_dev *rt2x00dev)
218 struct data_queue *queue;
220 queue_for_each(rt2x00dev, queue) {
221 kfree(queue->entries);
222 queue->entries = NULL;
226 int rt2x00queue_allocate(struct rt2x00_dev *rt2x00dev)
228 struct data_queue *queue;
229 enum data_queue_qid qid;
230 unsigned int req_atim =
231 !!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
234 * We need the following queues:
238 * Atim: 1 (if required)
240 rt2x00dev->data_queues = 2 + rt2x00dev->hw->queues + req_atim;
242 queue = kzalloc(rt2x00dev->data_queues * sizeof(*queue), GFP_KERNEL);
244 ERROR(rt2x00dev, "Queue allocation failed.\n");
249 * Initialize pointers
251 rt2x00dev->rx = queue;
252 rt2x00dev->tx = &queue[1];
253 rt2x00dev->bcn = &queue[1 + rt2x00dev->hw->queues];
256 * Initialize queue parameters.
258 * TX: qid = QID_AC_BE + index
259 * TX: cw_min: 2^5 = 32.
260 * TX: cw_max: 2^10 = 1024.
261 * BCN & Atim: qid = QID_MGMT
264 queue_for_each(rt2x00dev, queue) {
265 spin_lock_init(&queue->lock);
267 queue->rt2x00dev = rt2x00dev;
275 * Fix non-TX data qid's
277 rt2x00dev->rx->qid = QID_RX;
278 rt2x00dev->bcn[0].qid = QID_MGMT;
280 rt2x00dev->bcn[1].qid = QID_MGMT;
285 void rt2x00queue_free(struct rt2x00_dev *rt2x00dev)
287 kfree(rt2x00dev->rx);
288 rt2x00dev->rx = NULL;
289 rt2x00dev->tx = NULL;
290 rt2x00dev->bcn = NULL;