Commit f78987cf authored by Helmut Schaa's avatar Helmut Schaa Committed by John W. Linville
Browse files

rt2x00: Calculate tx status fifo size instead of hardcoding it

Instead of hardcoding the tx status fifo size as 512 calculate it based
on the number of tx queues and the number of entries per queue. Also
round the size up to a power of 2 as kfifo would otherwise round it

On rt2800pci this will increase the kfifo size from 512 bytes to 1024
bytes which is then able to hold the tx status for all entries in all
tx queues.

Furthermore, if the number of tx queues or tx entries changes in the
future (use of the MGMT queue for example) the kfifo size doesn't need
to be updated.

Signed-off-by: default avatarHelmut Schaa <>
Acked-by: default avatarGertjan van Wingerde <>
Signed-off-by: default avatarIvo van Doorn <>
Signed-off-by: default avatarJohn W. Linville <>
parent 2e7798b7
......@@ -27,6 +27,7 @@
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/slab.h>
#include <linux/log2.h>
#include "rt2x00.h"
#include "rt2x00lib.h"
......@@ -811,13 +812,18 @@ static int rt2x00lib_probe_hw(struct rt2x00_dev *rt2x00dev)
if (test_bit(DRIVER_REQUIRE_TXSTATUS_FIFO, &rt2x00dev->flags)) {
* Allocate txstatus fifo and tasklet, we use a size of 512
* for the kfifo which is big enough to store 512/4=128 tx
* status reports. In the worst case (tx status for all tx
* queues gets reported before we've got a chance to handle
* them) 24*4=384 tx status reports need to be cached.
* Allocate the txstatus fifo. In the worst case the tx
* status fifo has to hold the tx status of all entries
* in all tx queues. Hence, calculate the kfifo size as
* tx_queues * entry_num and round up to the nearest
* power of 2.
status = kfifo_alloc(&rt2x00dev->txstatus_fifo, 512,
int kfifo_size =
roundup_pow_of_two(rt2x00dev->ops->tx_queues *
rt2x00dev->ops->tx->entry_num *
status = kfifo_alloc(&rt2x00dev->txstatus_fifo, kfifo_size,
if (status)
return status;
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment