[deliverable/linux.git] / drivers / net / wireless / rt2x00 / rt2x00queue.c

/*
	Copyright (C) 2004 - 2008 rt2x00 SourceForge Project
	<http://rt2x00.serialmonkey.com>

	This program is free software; you can redistribute it and/or modify
	it under the terms of the GNU General Public License as published by
	the Free Software Foundation; either version 2 of the License, or
	(at your option) any later version.

	This program is distributed in the hope that it will be useful,
	but WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	GNU General Public License for more details.

	You should have received a copy of the GNU General Public License
	along with this program; if not, write to the
	Free Software Foundation, Inc.,
	59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
 */

/*
	Module: rt2x00lib
	Abstract: rt2x00 queue specific routines.
 */

#include <linux/kernel.h>
#include <linux/module.h>

#include "rt2x00.h"
#include "rt2x00lib.h"

struct data_queue *rt2x00queue_get_queue(struct rt2x00_dev *rt2x00dev,
					 const enum data_queue_qid queue)
{
	int atim = test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);

	if (queue < rt2x00dev->hw->queues && rt2x00dev->tx)
		return &rt2x00dev->tx[queue];

	if (!rt2x00dev->bcn)
		return NULL;

	if (queue == QID_BEACON)
		return &rt2x00dev->bcn[0];
	else if (queue == QID_ATIM && atim)
		return &rt2x00dev->bcn[1];

	return NULL;
}
EXPORT_SYMBOL_GPL(rt2x00queue_get_queue);

struct queue_entry *rt2x00queue_get_entry(struct data_queue *queue,
					  enum queue_index index)
{
	struct queue_entry *entry;
	unsigned long irqflags;

	if (unlikely(index >= Q_INDEX_MAX)) {
		ERROR(queue->rt2x00dev,
		      "Entry requested from invalid index type (%d)\n", index);
		return NULL;
	}

	spin_lock_irqsave(&queue->lock, irqflags);

	entry = &queue->entries[queue->index[index]];

	spin_unlock_irqrestore(&queue->lock, irqflags);

	return entry;
}
EXPORT_SYMBOL_GPL(rt2x00queue_get_entry);

void rt2x00queue_index_inc(struct data_queue *queue, enum queue_index index)
{
	unsigned long irqflags;

	if (unlikely(index >= Q_INDEX_MAX)) {
		ERROR(queue->rt2x00dev,
		      "Index change on invalid index type (%d)\n", index);
		return;
	}

	spin_lock_irqsave(&queue->lock, irqflags);

	queue->index[index]++;
	if (queue->index[index] >= queue->limit)
		queue->index[index] = 0;

	if (index == Q_INDEX) {
		queue->length++;
	} else if (index == Q_INDEX_DONE) {
		queue->length--;
		queue->count ++;
	}

	spin_unlock_irqrestore(&queue->lock, irqflags);
}
EXPORT_SYMBOL_GPL(rt2x00queue_index_inc);

static void rt2x00queue_reset(struct data_queue *queue)
{
	unsigned long irqflags;

	spin_lock_irqsave(&queue->lock, irqflags);

	queue->count = 0;
	queue->length = 0;
	memset(queue->index, 0, sizeof(queue->index));

	spin_unlock_irqrestore(&queue->lock, irqflags);
}

void rt2x00queue_init_rx(struct rt2x00_dev *rt2x00dev)
{
	struct data_queue *queue = rt2x00dev->rx;
	unsigned int i;

	rt2x00queue_reset(queue);

	if (!rt2x00dev->ops->lib->init_rxentry)
		return;

	for (i = 0; i < queue->limit; i++)
		rt2x00dev->ops->lib->init_rxentry(rt2x00dev,
						  &queue->entries[i]);
}

void rt2x00queue_init_tx(struct rt2x00_dev *rt2x00dev)
{
	struct data_queue *queue;
	unsigned int i;

	txall_queue_for_each(rt2x00dev, queue) {
		rt2x00queue_reset(queue);

		if (!rt2x00dev->ops->lib->init_txentry)
			continue;

		for (i = 0; i < queue->limit; i++)
			rt2x00dev->ops->lib->init_txentry(rt2x00dev,
							  &queue->entries[i]);
	}
}

static int rt2x00queue_alloc_entries(struct data_queue *queue,
				     const struct data_queue_desc *qdesc)
{
	struct queue_entry *entries;
	unsigned int entry_size;
	unsigned int i;

	rt2x00queue_reset(queue);

	queue->limit = qdesc->entry_num;
	queue->data_size = qdesc->data_size;
	queue->desc_size = qdesc->desc_size;

	/*
	 * Allocate all queue entries.
	 */
	entry_size = sizeof(*entries) + qdesc->priv_size;
	entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
	if (!entries)
		return -ENOMEM;

#define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
	( ((char *)(__base)) + ((__limit) * (__esize)) + \
	    ((__index) * (__psize)) )

	for (i = 0; i < queue->limit; i++) {
		entries[i].flags = 0;
		entries[i].queue = queue;
		entries[i].skb = NULL;
		entries[i].entry_idx = i;
		entries[i].priv_data =
		    QUEUE_ENTRY_PRIV_OFFSET(entries, i, queue->limit,
					    sizeof(*entries), qdesc->priv_size);
	}

#undef QUEUE_ENTRY_PRIV_OFFSET

	queue->entries = entries;

	return 0;
}

int rt2x00queue_initialize(struct rt2x00_dev *rt2x00dev)
{
	struct data_queue *queue;
	int status;


	status = rt2x00queue_alloc_entries(rt2x00dev->rx, rt2x00dev->ops->rx);
	if (status)
		goto exit;

	tx_queue_for_each(rt2x00dev, queue) {
		status = rt2x00queue_alloc_entries(queue, rt2x00dev->ops->tx);
		if (status)
			goto exit;
	}

	status = rt2x00queue_alloc_entries(rt2x00dev->bcn, rt2x00dev->ops->bcn);
	if (status)
		goto exit;

	if (!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags))
		return 0;

	status = rt2x00queue_alloc_entries(&rt2x00dev->bcn[1],
					   rt2x00dev->ops->atim);
	if (status)
		goto exit;

	return 0;

exit:
	ERROR(rt2x00dev, "Queue entries allocation failed.\n");

	rt2x00queue_uninitialize(rt2x00dev);

	return status;
}

void rt2x00queue_uninitialize(struct rt2x00_dev *rt2x00dev)
{
	struct data_queue *queue;

	queue_for_each(rt2x00dev, queue) {
		kfree(queue->entries);
		queue->entries = NULL;
	}
}

static void rt2x00queue_init(struct rt2x00_dev *rt2x00dev,
			     struct data_queue *queue, enum data_queue_qid qid)
{
	spin_lock_init(&queue->lock);

	queue->rt2x00dev = rt2x00dev;
	queue->qid = qid;
	queue->aifs = 2;
	queue->cw_min = 5;
	queue->cw_max = 10;
}

int rt2x00queue_allocate(struct rt2x00_dev *rt2x00dev)
{
	struct data_queue *queue;
	enum data_queue_qid qid;
	unsigned int req_atim =
	    !!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);

	/*
	 * We need the following queues:
	 * RX: 1
	 * TX: hw->queues
	 * Beacon: 1
	 * Atim: 1 (if required)
	 */
	rt2x00dev->data_queues = 2 + rt2x00dev->hw->queues + req_atim;

	queue = kzalloc(rt2x00dev->data_queues * sizeof(*queue), GFP_KERNEL);
	if (!queue) {
		ERROR(rt2x00dev, "Queue allocation failed.\n");
		return -ENOMEM;
	}

	/*
	 * Initialize pointers
	 */
	rt2x00dev->rx = queue;
	rt2x00dev->tx = &queue[1];
	rt2x00dev->bcn = &queue[1 + rt2x00dev->hw->queues];

	/*
	 * Initialize queue parameters.
	 * RX: qid = QID_RX
	 * TX: qid = QID_AC_BE + index
	 * TX: cw_min: 2^5 = 32.
	 * TX: cw_max: 2^10 = 1024.
	 * BCN & Atim: qid = QID_MGMT
	 */
	rt2x00queue_init(rt2x00dev, rt2x00dev->rx, QID_RX);

	qid = QID_AC_BE;
	tx_queue_for_each(rt2x00dev, queue)
		rt2x00queue_init(rt2x00dev, queue, qid++);

	rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[0], QID_MGMT);
	if (req_atim)
		rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[1], QID_MGMT);

	return 0;
}

void rt2x00queue_free(struct rt2x00_dev *rt2x00dev)
{
	kfree(rt2x00dev->rx);
	rt2x00dev->rx = NULL;
	rt2x00dev->tx = NULL;
	rt2x00dev->bcn = NULL;
}
Commit	Line	Data
181d6902 ID	1	/*
	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: rt2x00lib
	23	Abstract: rt2x00 queue specific routines.
	24	*/
	25
	26	#include <linux/kernel.h>
	27	#include <linux/module.h>
	28
	29	#include "rt2x00.h"
	30	#include "rt2x00lib.h"
	31
	32	struct data_queue rt2x00queue_get_queue(struct rt2x00_dev rt2x00dev,
e58c6aca	33	const enum data_queue_qid queue)
181d6902 ID	34	{
	35	int atim = test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
	36
	37	if (queue < rt2x00dev->hw->queues && rt2x00dev->tx)
	38	return &rt2x00dev->tx[queue];
	39
	40	if (!rt2x00dev->bcn)
	41	return NULL;
	42
e58c6aca	43	if (queue == QID_BEACON)
181d6902	44	return &rt2x00dev->bcn[0];
e58c6aca	45	else if (queue == QID_ATIM && atim)
181d6902 ID	46	return &rt2x00dev->bcn[1];
	47
	48	return NULL;
	49	}
	50	EXPORT_SYMBOL_GPL(rt2x00queue_get_queue);
	51
	52	struct queue_entry rt2x00queue_get_entry(struct data_queue queue,
	53	enum queue_index index)
	54	{
	55	struct queue_entry *entry;
5f46c4d0	56	unsigned long irqflags;
181d6902 ID	57
	58	if (unlikely(index >= Q_INDEX_MAX)) {
	59	ERROR(queue->rt2x00dev,
	60	"Entry requested from invalid index type (%d)\n", index);
	61	return NULL;
	62	}
	63
5f46c4d0	64	spin_lock_irqsave(&queue->lock, irqflags);
181d6902 ID	65
	66	entry = &queue->entries[queue->index[index]];
	67
5f46c4d0	68	spin_unlock_irqrestore(&queue->lock, irqflags);
181d6902 ID	69
	70	return entry;
	71	}
	72	EXPORT_SYMBOL_GPL(rt2x00queue_get_entry);
	73
	74	void rt2x00queue_index_inc(struct data_queue *queue, enum queue_index index)
	75	{
5f46c4d0 ID	76	unsigned long irqflags;
5f46c4d0 ID	77
181d6902 ID	78	if (unlikely(index >= Q_INDEX_MAX)) {
	79	ERROR(queue->rt2x00dev,
	80	"Index change on invalid index type (%d)\n", index);
	81	return;
	82	}
	83
5f46c4d0	84	spin_lock_irqsave(&queue->lock, irqflags);
181d6902 ID	85
	86	queue->index[index]++;
	87	if (queue->index[index] >= queue->limit)
	88	queue->index[index] = 0;
	89
10b6b801 ID	90	if (index == Q_INDEX) {
	91	queue->length++;
	92	} else if (index == Q_INDEX_DONE) {
	93	queue->length--;
	94	queue->count ++;
	95	}
181d6902	96
5f46c4d0	97	spin_unlock_irqrestore(&queue->lock, irqflags);
181d6902 ID	98	}
	99	EXPORT_SYMBOL_GPL(rt2x00queue_index_inc);
	100
	101	static void rt2x00queue_reset(struct data_queue *queue)
	102	{
5f46c4d0 ID	103	unsigned long irqflags;
	104
	105	spin_lock_irqsave(&queue->lock, irqflags);
181d6902 ID	106
	107	queue->count = 0;
	108	queue->length = 0;
	109	memset(queue->index, 0, sizeof(queue->index));
	110
5f46c4d0	111	spin_unlock_irqrestore(&queue->lock, irqflags);
181d6902 ID	112	}
	113
	114	void rt2x00queue_init_rx(struct rt2x00_dev *rt2x00dev)
	115	{
	116	struct data_queue *queue = rt2x00dev->rx;
	117	unsigned int i;
	118
	119	rt2x00queue_reset(queue);
	120
	121	if (!rt2x00dev->ops->lib->init_rxentry)
	122	return;
	123
	124	for (i = 0; i < queue->limit; i++)
	125	rt2x00dev->ops->lib->init_rxentry(rt2x00dev,
	126	&queue->entries[i]);
	127	}
	128
	129	void rt2x00queue_init_tx(struct rt2x00_dev *rt2x00dev)
	130	{
	131	struct data_queue *queue;
	132	unsigned int i;
	133
	134	txall_queue_for_each(rt2x00dev, queue) {
	135	rt2x00queue_reset(queue);
	136
	137	if (!rt2x00dev->ops->lib->init_txentry)
	138	continue;
	139
	140	for (i = 0; i < queue->limit; i++)
	141	rt2x00dev->ops->lib->init_txentry(rt2x00dev,
	142	&queue->entries[i]);
	143	}
	144	}
	145
	146	static int rt2x00queue_alloc_entries(struct data_queue *queue,
	147	const struct data_queue_desc *qdesc)
	148	{
	149	struct queue_entry *entries;
	150	unsigned int entry_size;
	151	unsigned int i;
	152
	153	rt2x00queue_reset(queue);
	154
	155	queue->limit = qdesc->entry_num;
	156	queue->data_size = qdesc->data_size;
	157	queue->desc_size = qdesc->desc_size;
	158
	159	/*
	160	* Allocate all queue entries.
	161	*/
	162	entry_size = sizeof(*entries) + qdesc->priv_size;
	163	entries = kzalloc(queue->limit * entry_size, GFP_KERNEL);
	164	if (!entries)
	165	return -ENOMEM;
	166
	167	#define QUEUE_ENTRY_PRIV_OFFSET(__base, __index, __limit, __esize, __psize) \
231be4e9 AB	168	( ((char )(__base)) + ((__limit) (__esize)) + \
231be4e9 AB	169	((__index) * (__psize)) )
181d6902 ID	170
	171	for (i = 0; i < queue->limit; i++) {
	172	entries[i].flags = 0;
	173	entries[i].queue = queue;
	174	entries[i].skb = NULL;
	175	entries[i].entry_idx = i;
	176	entries[i].priv_data =
	177	QUEUE_ENTRY_PRIV_OFFSET(entries, i, queue->limit,
	178	sizeof(*entries), qdesc->priv_size);
	179	}
	180
	181	#undef QUEUE_ENTRY_PRIV_OFFSET
	182
	183	queue->entries = entries;
	184
	185	return 0;
	186	}
	187
	188	int rt2x00queue_initialize(struct rt2x00_dev *rt2x00dev)
	189	{
	190	struct data_queue *queue;
	191	int status;
	192
	193
	194	status = rt2x00queue_alloc_entries(rt2x00dev->rx, rt2x00dev->ops->rx);
	195	if (status)
	196	goto exit;
	197
	198	tx_queue_for_each(rt2x00dev, queue) {
	199	status = rt2x00queue_alloc_entries(queue, rt2x00dev->ops->tx);
	200	if (status)
	201	goto exit;
	202	}
	203
	204	status = rt2x00queue_alloc_entries(rt2x00dev->bcn, rt2x00dev->ops->bcn);
	205	if (status)
	206	goto exit;
	207
	208	if (!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags))
	209	return 0;
	210
	211	status = rt2x00queue_alloc_entries(&rt2x00dev->bcn[1],
	212	rt2x00dev->ops->atim);
	213	if (status)
	214	goto exit;
	215
	216	return 0;
	217
	218	exit:
	219	ERROR(rt2x00dev, "Queue entries allocation failed.\n");
	220
	221	rt2x00queue_uninitialize(rt2x00dev);
	222
	223	return status;
	224	}
	225
	226	void rt2x00queue_uninitialize(struct rt2x00_dev *rt2x00dev)
	227	{
	228	struct data_queue *queue;
	229
	230	queue_for_each(rt2x00dev, queue) {
	231	kfree(queue->entries);
	232	queue->entries = NULL;
	233	}
234	}
235
8f539276 ID	236	static void rt2x00queue_init(struct rt2x00_dev *rt2x00dev,
	237	struct data_queue *queue, enum data_queue_qid qid)
	238	{
	239	spin_lock_init(&queue->lock);
	240
	241	queue->rt2x00dev = rt2x00dev;
	242	queue->qid = qid;
	243	queue->aifs = 2;
	244	queue->cw_min = 5;
	245	queue->cw_max = 10;
	246	}
	247
181d6902 ID	248	int rt2x00queue_allocate(struct rt2x00_dev *rt2x00dev)
	249	{
	250	struct data_queue *queue;
	251	enum data_queue_qid qid;
	252	unsigned int req_atim =
	253	!!test_bit(DRIVER_REQUIRE_ATIM_QUEUE, &rt2x00dev->flags);
	254
	255	/*
	256	* We need the following queues:
	257	* RX: 1
	258	* TX: hw->queues
	259	* Beacon: 1
	260	* Atim: 1 (if required)
	261	*/
	262	rt2x00dev->data_queues = 2 + rt2x00dev->hw->queues + req_atim;
	263
	264	queue = kzalloc(rt2x00dev->data_queues * sizeof(*queue), GFP_KERNEL);
	265	if (!queue) {
	266	ERROR(rt2x00dev, "Queue allocation failed.\n");
	267	return -ENOMEM;
	268	}
	269
	270	/*
	271	* Initialize pointers
	272	*/
	273	rt2x00dev->rx = queue;
	274	rt2x00dev->tx = &queue[1];
	275	rt2x00dev->bcn = &queue[1 + rt2x00dev->hw->queues];
	276
	277	/*
	278	* Initialize queue parameters.
	279	* RX: qid = QID_RX
	280	* TX: qid = QID_AC_BE + index
	281	* TX: cw_min: 2^5 = 32.
	282	* TX: cw_max: 2^10 = 1024.
	283	* BCN & Atim: qid = QID_MGMT
	284	*/
8f539276	285	rt2x00queue_init(rt2x00dev, rt2x00dev->rx, QID_RX);
181d6902	286
8f539276 ID	287	qid = QID_AC_BE;
	288	tx_queue_for_each(rt2x00dev, queue)
	289	rt2x00queue_init(rt2x00dev, queue, qid++);
181d6902	290
8f539276	291	rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[0], QID_MGMT);
181d6902	292	if (req_atim)
8f539276	293	rt2x00queue_init(rt2x00dev, &rt2x00dev->bcn[1], QID_MGMT);
181d6902 ID	294
	295	return 0;
	296	}
	297
	298	void rt2x00queue_free(struct rt2x00_dev *rt2x00dev)
	299	{
	300	kfree(rt2x00dev->rx);
	301	rt2x00dev->rx = NULL;
	302	rt2x00dev->tx = NULL;
	303	rt2x00dev->bcn = NULL;
	304	}