blob: 192b6e789a7f2902ac4a515d4041c5e42a4fa415 [file] [log] [blame]
Ivo van Doorn181d6902008-02-05 16:42:23 -05001/*
2 Copyright (C) 2004 - 2008 rt2x00 SourceForge Project
3 <http://rt2x00.serialmonkey.com>
4
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.
9
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.
14
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.
19 */
20
21/*
22 Module: rt2x00
23 Abstract: rt2x00 queue datastructures and routines
24 */
25
26#ifndef RT2X00QUEUE_H
27#define RT2X00QUEUE_H
28
29#include <linux/prefetch.h>
30
31/**
32 * DOC: Entrie frame size
33 *
34 * Ralink PCI devices demand the Frame size to be a multiple of 128 bytes,
35 * for USB devices this restriction does not apply, but the value of
36 * 2432 makes sense since it is big enough to contain the maximum fragment
37 * size according to the ieee802.11 specs.
38 */
39#define DATA_FRAME_SIZE 2432
40#define MGMT_FRAME_SIZE 256
41
42/**
43 * DOC: Number of entries per queue
44 *
45 * After research it was concluded that 12 entries in a RX and TX
46 * queue would be sufficient. Although this is almost one third of
47 * the amount the legacy driver allocated, the queues aren't getting
48 * filled to the maximum even when working with the maximum rate.
Ivo van Doorn181d6902008-02-05 16:42:23 -050049 */
50#define RX_ENTRIES 12
51#define TX_ENTRIES 12
52#define BEACON_ENTRIES 1
53#define ATIM_ENTRIES 1
54
55/**
56 * enum data_queue_qid: Queue identification
Ivo van Doorne58c6ac2008-04-21 19:00:47 +020057 *
58 * @QID_AC_BE: AC BE queue
59 * @QID_AC_BK: AC BK queue
60 * @QID_AC_VI: AC VI queue
61 * @QID_AC_VO: AC VO queue
62 * @QID_HCCA: HCCA queue
63 * @QID_MGMT: MGMT queue (prio queue)
64 * @QID_RX: RX queue
65 * @QID_OTHER: None of the above (don't use, only present for completeness)
66 * @QID_BEACON: Beacon queue (value unspecified, don't send it to device)
67 * @QID_ATIM: Atim queue (value unspeficied, don't send it to device)
Ivo van Doorn181d6902008-02-05 16:42:23 -050068 */
69enum data_queue_qid {
70 QID_AC_BE = 0,
71 QID_AC_BK = 1,
72 QID_AC_VI = 2,
73 QID_AC_VO = 3,
74 QID_HCCA = 4,
75 QID_MGMT = 13,
76 QID_RX = 14,
77 QID_OTHER = 15,
Ivo van Doorne58c6ac2008-04-21 19:00:47 +020078 QID_BEACON,
79 QID_ATIM,
Ivo van Doorn181d6902008-02-05 16:42:23 -050080};
81
82/**
Ivo van Doornbaf26a72008-02-17 17:32:08 +010083 * enum skb_frame_desc_flags: Flags for &struct skb_frame_desc
84 *
Ivo van Doornbaf26a72008-02-17 17:32:08 +010085 */
Gertjan van Wingerdec4da0042008-06-16 19:56:31 +020086enum skb_frame_desc_flags {
87 SKBDESC_DMA_MAPPED_RX = (1 << 0),
88 SKBDESC_DMA_MAPPED_TX = (1 << 1),
89};
Ivo van Doornbaf26a72008-02-17 17:32:08 +010090
91/**
Ivo van Doorn181d6902008-02-05 16:42:23 -050092 * struct skb_frame_desc: Descriptor information for the skb buffer
93 *
Johannes Berge039fa42008-05-15 12:55:29 +020094 * This structure is placed over the driver_data array, this means that
95 * this structure should not exceed the size of that array (40 bytes).
Ivo van Doorn181d6902008-02-05 16:42:23 -050096 *
Ivo van Doornbaf26a72008-02-17 17:32:08 +010097 * @flags: Frame flags, see &enum skb_frame_desc_flags.
Gertjan van Wingerdec4da0042008-06-16 19:56:31 +020098 * @desc_len: Length of the frame descriptor.
Ivo van Doorn181d6902008-02-05 16:42:23 -050099 * @desc: Pointer to descriptor part of the frame.
100 * Note that this pointer could point to something outside
101 * of the scope of the skb->data pointer.
Gertjan van Wingerdec4da0042008-06-16 19:56:31 +0200102 * @skb_dma: (PCI-only) the DMA address associated with the sk buffer.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500103 * @entry: The entry to which this sk buffer belongs.
104 */
105struct skb_frame_desc {
106 unsigned int flags;
107
Gertjan van Wingerded56d4532008-06-06 22:54:08 +0200108 unsigned int desc_len;
Gertjan van Wingerdec4da0042008-06-16 19:56:31 +0200109 void *desc;
110
111 dma_addr_t skb_dma;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500112
Ivo van Doorn181d6902008-02-05 16:42:23 -0500113 struct queue_entry *entry;
114};
115
Johannes Berge039fa42008-05-15 12:55:29 +0200116/**
117 * get_skb_frame_desc - Obtain the rt2x00 frame descriptor from a sk_buff.
118 * @skb: &struct sk_buff from where we obtain the &struct skb_frame_desc
119 */
Ivo van Doorn181d6902008-02-05 16:42:23 -0500120static inline struct skb_frame_desc* get_skb_frame_desc(struct sk_buff *skb)
121{
Johannes Berge039fa42008-05-15 12:55:29 +0200122 BUILD_BUG_ON(sizeof(struct skb_frame_desc) >
123 IEEE80211_TX_INFO_DRIVER_DATA_SIZE);
124 return (struct skb_frame_desc *)&IEEE80211_SKB_CB(skb)->driver_data;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500125}
126
127/**
Ivo van Doorn19d30e02008-03-15 21:38:07 +0100128 * enum rxdone_entry_desc_flags: Flags for &struct rxdone_entry_desc
129 *
130 * @RXDONE_SIGNAL_PLCP: Does the signal field contain the plcp value,
131 * or does it contain the bitrate itself.
132 * @RXDONE_MY_BSS: Does this frame originate from device's BSS.
133 */
134enum rxdone_entry_desc_flags {
135 RXDONE_SIGNAL_PLCP = 1 << 0,
136 RXDONE_MY_BSS = 1 << 1,
137};
138
139/**
Ivo van Doorn181d6902008-02-05 16:42:23 -0500140 * struct rxdone_entry_desc: RX Entry descriptor
141 *
142 * Summary of information that has been read from the RX frame descriptor.
143 *
144 * @signal: Signal of the received frame.
145 * @rssi: RSSI of the received frame.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500146 * @size: Data size of the received frame.
147 * @flags: MAC80211 receive flags (See &enum mac80211_rx_flags).
Ivo van Doorn19d30e02008-03-15 21:38:07 +0100148 * @dev_flags: Ralink receive flags (See &enum rxdone_entry_desc_flags).
149
Ivo van Doorn181d6902008-02-05 16:42:23 -0500150 */
151struct rxdone_entry_desc {
152 int signal;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500153 int rssi;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500154 int size;
155 int flags;
Ivo van Doorn19d30e02008-03-15 21:38:07 +0100156 int dev_flags;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500157};
158
159/**
Ivo van Doornfb55f4d12008-05-10 13:42:06 +0200160 * enum txdone_entry_desc_flags: Flags for &struct txdone_entry_desc
161 *
162 * @TXDONE_UNKNOWN: Hardware could not determine success of transmission.
163 * @TXDONE_SUCCESS: Frame was successfully send
164 * @TXDONE_FAILURE: Frame was not successfully send
165 * @TXDONE_EXCESSIVE_RETRY: In addition to &TXDONE_FAILURE, the
166 * frame transmission failed due to excessive retries.
167 */
168enum txdone_entry_desc_flags {
169 TXDONE_UNKNOWN = 1 << 0,
170 TXDONE_SUCCESS = 1 << 1,
171 TXDONE_FAILURE = 1 << 2,
172 TXDONE_EXCESSIVE_RETRY = 1 << 3,
173};
174
175/**
Ivo van Doorn181d6902008-02-05 16:42:23 -0500176 * struct txdone_entry_desc: TX done entry descriptor
177 *
178 * Summary of information that has been read from the TX frame descriptor
179 * after the device is done with transmission.
180 *
Ivo van Doornfb55f4d12008-05-10 13:42:06 +0200181 * @flags: TX done flags (See &enum txdone_entry_desc_flags).
Ivo van Doorn181d6902008-02-05 16:42:23 -0500182 * @retry: Retry count.
183 */
184struct txdone_entry_desc {
Ivo van Doornfb55f4d12008-05-10 13:42:06 +0200185 unsigned long flags;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500186 int retry;
187};
188
189/**
190 * enum txentry_desc_flags: Status flags for TX entry descriptor
191 *
192 * @ENTRY_TXD_RTS_FRAME: This frame is a RTS frame.
Ivo van Doorn7050ec82008-05-10 13:46:13 +0200193 * @ENTRY_TXD_CTS_FRAME: This frame is a CTS-to-self frame.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500194 * @ENTRY_TXD_OFDM_RATE: This frame is send out with an OFDM rate.
Ivo van Doorn61486e02008-05-10 13:42:31 +0200195 * @ENTRY_TXD_FIRST_FRAGMENT: This is the first frame.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500196 * @ENTRY_TXD_MORE_FRAG: This frame is followed by another fragment.
197 * @ENTRY_TXD_REQ_TIMESTAMP: Require timestamp to be inserted.
198 * @ENTRY_TXD_BURST: This frame belongs to the same burst event.
199 * @ENTRY_TXD_ACK: An ACK is required for this frame.
Ivo van Doorn61486e02008-05-10 13:42:31 +0200200 * @ENTRY_TXD_RETRY_MODE: When set, the long retry count is used.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500201 */
202enum txentry_desc_flags {
203 ENTRY_TXD_RTS_FRAME,
Ivo van Doorn7050ec82008-05-10 13:46:13 +0200204 ENTRY_TXD_CTS_FRAME,
Ivo van Doorn181d6902008-02-05 16:42:23 -0500205 ENTRY_TXD_OFDM_RATE,
Ivo van Doorn61486e02008-05-10 13:42:31 +0200206 ENTRY_TXD_FIRST_FRAGMENT,
Ivo van Doorn181d6902008-02-05 16:42:23 -0500207 ENTRY_TXD_MORE_FRAG,
208 ENTRY_TXD_REQ_TIMESTAMP,
209 ENTRY_TXD_BURST,
210 ENTRY_TXD_ACK,
Ivo van Doorn61486e02008-05-10 13:42:31 +0200211 ENTRY_TXD_RETRY_MODE,
Ivo van Doorn181d6902008-02-05 16:42:23 -0500212};
213
214/**
215 * struct txentry_desc: TX Entry descriptor
216 *
217 * Summary of information for the frame descriptor before sending a TX frame.
218 *
219 * @flags: Descriptor flags (See &enum queue_entry_flags).
220 * @queue: Queue identification (See &enum data_queue_qid).
221 * @length_high: PLCP length high word.
222 * @length_low: PLCP length low word.
223 * @signal: PLCP signal.
224 * @service: PLCP service.
Ivo van Doorn61486e02008-05-10 13:42:31 +0200225 * @retry_limit: Max number of retries.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500226 * @aifs: AIFS value.
227 * @ifs: IFS value.
228 * @cw_min: cwmin value.
229 * @cw_max: cwmax value.
230 */
231struct txentry_desc {
232 unsigned long flags;
233
234 enum data_queue_qid queue;
235
236 u16 length_high;
237 u16 length_low;
238 u16 signal;
239 u16 service;
240
Ivo van Doorn61486e02008-05-10 13:42:31 +0200241 short retry_limit;
242 short aifs;
243 short ifs;
244 short cw_min;
245 short cw_max;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500246};
247
248/**
249 * enum queue_entry_flags: Status flags for queue entry
250 *
251 * @ENTRY_BCN_ASSIGNED: This entry has been assigned to an interface.
252 * As long as this bit is set, this entry may only be touched
253 * through the interface structure.
254 * @ENTRY_OWNER_DEVICE_DATA: This entry is owned by the device for data
255 * transfer (either TX or RX depending on the queue). The entry should
256 * only be touched after the device has signaled it is done with it.
257 * @ENTRY_OWNER_DEVICE_CRYPTO: This entry is owned by the device for data
258 * encryption or decryption. The entry should only be touched after
259 * the device has signaled it is done with it.
Ivo van Doornf019d512008-06-06 22:47:39 +0200260 * @ENTRY_DATA_PENDING: This entry contains a valid frame and is waiting
261 * for the signal to start sending.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500262 */
Ivo van Doorn181d6902008-02-05 16:42:23 -0500263enum queue_entry_flags {
264 ENTRY_BCN_ASSIGNED,
265 ENTRY_OWNER_DEVICE_DATA,
266 ENTRY_OWNER_DEVICE_CRYPTO,
Ivo van Doornf019d512008-06-06 22:47:39 +0200267 ENTRY_DATA_PENDING,
Ivo van Doorn181d6902008-02-05 16:42:23 -0500268};
269
270/**
271 * struct queue_entry: Entry inside the &struct data_queue
272 *
273 * @flags: Entry flags, see &enum queue_entry_flags.
274 * @queue: The data queue (&struct data_queue) to which this entry belongs.
275 * @skb: The buffer which is currently being transmitted (for TX queue),
276 * or used to directly recieve data in (for RX queue).
277 * @entry_idx: The entry index number.
278 * @priv_data: Private data belonging to this queue entry. The pointer
279 * points to data specific to a particular driver and queue type.
280 */
281struct queue_entry {
282 unsigned long flags;
283
284 struct data_queue *queue;
285
286 struct sk_buff *skb;
287
288 unsigned int entry_idx;
289
290 void *priv_data;
291};
292
293/**
294 * enum queue_index: Queue index type
295 *
296 * @Q_INDEX: Index pointer to the current entry in the queue, if this entry is
297 * owned by the hardware then the queue is considered to be full.
298 * @Q_INDEX_DONE: Index pointer to the next entry which will be completed by
299 * the hardware and for which we need to run the txdone handler. If this
300 * entry is not owned by the hardware the queue is considered to be empty.
301 * @Q_INDEX_CRYPTO: Index pointer to the next entry which encryption/decription
302 * will be completed by the hardware next.
303 * @Q_INDEX_MAX: Keep last, used in &struct data_queue to determine the size
304 * of the index array.
305 */
306enum queue_index {
307 Q_INDEX,
308 Q_INDEX_DONE,
309 Q_INDEX_CRYPTO,
310 Q_INDEX_MAX,
311};
312
313/**
314 * struct data_queue: Data queue
315 *
316 * @rt2x00dev: Pointer to main &struct rt2x00dev where this queue belongs to.
317 * @entries: Base address of the &struct queue_entry which are
318 * part of this queue.
319 * @qid: The queue identification, see &enum data_queue_qid.
320 * @lock: Spinlock to protect index handling. Whenever @index, @index_done or
321 * @index_crypt needs to be changed this lock should be grabbed to prevent
322 * index corruption due to concurrency.
323 * @count: Number of frames handled in the queue.
324 * @limit: Maximum number of entries in the queue.
Ivo van Doornb8697672008-06-06 22:53:14 +0200325 * @threshold: Minimum number of free entries before queue is kicked by force.
Ivo van Doorn181d6902008-02-05 16:42:23 -0500326 * @length: Number of frames in queue.
327 * @index: Index pointers to entry positions in the queue,
328 * use &enum queue_index to get a specific index field.
329 * @aifs: The aifs value for outgoing frames (field ignored in RX queue).
330 * @cw_min: The cw min value for outgoing frames (field ignored in RX queue).
331 * @cw_max: The cw max value for outgoing frames (field ignored in RX queue).
332 * @data_size: Maximum data size for the frames in this queue.
333 * @desc_size: Hardware descriptor size for the data in this queue.
334 */
335struct data_queue {
336 struct rt2x00_dev *rt2x00dev;
337 struct queue_entry *entries;
338
339 enum data_queue_qid qid;
340
341 spinlock_t lock;
342 unsigned int count;
343 unsigned short limit;
Ivo van Doornb8697672008-06-06 22:53:14 +0200344 unsigned short threshold;
Ivo van Doorn181d6902008-02-05 16:42:23 -0500345 unsigned short length;
346 unsigned short index[Q_INDEX_MAX];
347
348 unsigned short aifs;
349 unsigned short cw_min;
350 unsigned short cw_max;
351
352 unsigned short data_size;
353 unsigned short desc_size;
354};
355
356/**
357 * struct data_queue_desc: Data queue description
358 *
359 * The information in this structure is used by drivers
360 * to inform rt2x00lib about the creation of the data queue.
361 *
362 * @entry_num: Maximum number of entries for a queue.
363 * @data_size: Maximum data size for the frames in this queue.
364 * @desc_size: Hardware descriptor size for the data in this queue.
365 * @priv_size: Size of per-queue_entry private data.
366 */
367struct data_queue_desc {
368 unsigned short entry_num;
369 unsigned short data_size;
370 unsigned short desc_size;
371 unsigned short priv_size;
372};
373
374/**
375 * queue_end - Return pointer to the last queue (HELPER MACRO).
376 * @__dev: Pointer to &struct rt2x00_dev
377 *
378 * Using the base rx pointer and the maximum number of available queues,
379 * this macro will return the address of 1 position beyond the end of the
380 * queues array.
381 */
382#define queue_end(__dev) \
383 &(__dev)->rx[(__dev)->data_queues]
384
385/**
386 * tx_queue_end - Return pointer to the last TX queue (HELPER MACRO).
387 * @__dev: Pointer to &struct rt2x00_dev
388 *
389 * Using the base tx pointer and the maximum number of available TX
390 * queues, this macro will return the address of 1 position beyond
391 * the end of the TX queue array.
392 */
393#define tx_queue_end(__dev) \
Gertjan van Wingerde61448f82008-05-10 13:43:33 +0200394 &(__dev)->tx[(__dev)->ops->tx_queues]
Ivo van Doorn181d6902008-02-05 16:42:23 -0500395
396/**
397 * queue_loop - Loop through the queues within a specific range (HELPER MACRO).
398 * @__entry: Pointer where the current queue entry will be stored in.
399 * @__start: Start queue pointer.
400 * @__end: End queue pointer.
401 *
402 * This macro will loop through all queues between &__start and &__end.
403 */
404#define queue_loop(__entry, __start, __end) \
405 for ((__entry) = (__start); \
406 prefetch(&(__entry)[1]), (__entry) != (__end); \
407 (__entry) = &(__entry)[1])
408
409/**
410 * queue_for_each - Loop through all queues
411 * @__dev: Pointer to &struct rt2x00_dev
412 * @__entry: Pointer where the current queue entry will be stored in.
413 *
414 * This macro will loop through all available queues.
415 */
416#define queue_for_each(__dev, __entry) \
417 queue_loop(__entry, (__dev)->rx, queue_end(__dev))
418
419/**
420 * tx_queue_for_each - Loop through the TX queues
421 * @__dev: Pointer to &struct rt2x00_dev
422 * @__entry: Pointer where the current queue entry will be stored in.
423 *
424 * This macro will loop through all TX related queues excluding
425 * the Beacon and Atim queues.
426 */
427#define tx_queue_for_each(__dev, __entry) \
428 queue_loop(__entry, (__dev)->tx, tx_queue_end(__dev))
429
430/**
431 * txall_queue_for_each - Loop through all TX related queues
432 * @__dev: Pointer to &struct rt2x00_dev
433 * @__entry: Pointer where the current queue entry will be stored in.
434 *
435 * This macro will loop through all TX related queues including
436 * the Beacon and Atim queues.
437 */
438#define txall_queue_for_each(__dev, __entry) \
439 queue_loop(__entry, (__dev)->tx, queue_end(__dev))
440
441/**
442 * rt2x00queue_empty - Check if the queue is empty.
443 * @queue: Queue to check if empty.
444 */
445static inline int rt2x00queue_empty(struct data_queue *queue)
446{
447 return queue->length == 0;
448}
449
450/**
451 * rt2x00queue_full - Check if the queue is full.
452 * @queue: Queue to check if full.
453 */
454static inline int rt2x00queue_full(struct data_queue *queue)
455{
456 return queue->length == queue->limit;
457}
458
459/**
460 * rt2x00queue_free - Check the number of available entries in queue.
461 * @queue: Queue to check.
462 */
463static inline int rt2x00queue_available(struct data_queue *queue)
464{
465 return queue->limit - queue->length;
466}
467
468/**
Ivo van Doornb8697672008-06-06 22:53:14 +0200469 * rt2x00queue_threshold - Check if the queue is below threshold
470 * @queue: Queue to check.
471 */
472static inline int rt2x00queue_threshold(struct data_queue *queue)
473{
474 return rt2x00queue_available(queue) < queue->threshold;
475}
476
477/**
Ivo van Doorn181d6902008-02-05 16:42:23 -0500478 * rt2x00_desc_read - Read a word from the hardware descriptor.
479 * @desc: Base descriptor address
480 * @word: Word index from where the descriptor should be read.
481 * @value: Address where the descriptor value should be written into.
482 */
483static inline void rt2x00_desc_read(__le32 *desc, const u8 word, u32 *value)
484{
485 *value = le32_to_cpu(desc[word]);
486}
487
488/**
489 * rt2x00_desc_write - wrote a word to the hardware descriptor.
490 * @desc: Base descriptor address
491 * @word: Word index from where the descriptor should be written.
492 * @value: Value that should be written into the descriptor.
493 */
494static inline void rt2x00_desc_write(__le32 *desc, const u8 word, u32 value)
495{
496 desc[word] = cpu_to_le32(value);
497}
498
499#endif /* RT2X00QUEUE_H */