2007-05-05 22:45:53 +04:00
|
|
|
/*
|
|
|
|
* Copyright 2002-2005, Instant802 Networks, Inc.
|
|
|
|
* Copyright 2005-2006, Devicescape Software, Inc.
|
|
|
|
* Copyright (c) 2006 Jiri Benc <jbenc@suse.cz>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License version 2 as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/kernel.h>
|
2007-07-27 17:43:23 +04:00
|
|
|
#include <linux/rtnetlink.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 11:04:11 +03:00
|
|
|
#include <linux/slab.h>
|
2011-05-27 17:12:25 +04:00
|
|
|
#include <linux/module.h>
|
2008-04-08 23:14:40 +04:00
|
|
|
#include "rate.h"
|
2007-05-05 22:45:53 +04:00
|
|
|
#include "ieee80211_i.h"
|
2008-09-18 20:14:18 +04:00
|
|
|
#include "debugfs.h"
|
2007-05-05 22:45:53 +04:00
|
|
|
|
|
|
|
struct rate_control_alg {
|
|
|
|
struct list_head list;
|
|
|
|
struct rate_control_ops *ops;
|
|
|
|
};
|
|
|
|
|
|
|
|
static LIST_HEAD(rate_ctrl_algs);
|
|
|
|
static DEFINE_MUTEX(rate_ctrl_mutex);
|
|
|
|
|
2007-12-19 03:26:16 +03:00
|
|
|
static char *ieee80211_default_rc_algo = CONFIG_MAC80211_RC_DEFAULT;
|
|
|
|
module_param(ieee80211_default_rc_algo, charp, 0644);
|
|
|
|
MODULE_PARM_DESC(ieee80211_default_rc_algo,
|
|
|
|
"Default rate control algorithm for mac80211 to use");
|
|
|
|
|
2007-05-05 22:45:53 +04:00
|
|
|
int ieee80211_rate_control_register(struct rate_control_ops *ops)
|
|
|
|
{
|
|
|
|
struct rate_control_alg *alg;
|
|
|
|
|
2007-10-28 16:17:44 +03:00
|
|
|
if (!ops->name)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2007-10-28 16:49:33 +03:00
|
|
|
mutex_lock(&rate_ctrl_mutex);
|
|
|
|
list_for_each_entry(alg, &rate_ctrl_algs, list) {
|
|
|
|
if (!strcmp(alg->ops->name, ops->name)) {
|
|
|
|
/* don't register an algorithm twice */
|
|
|
|
WARN_ON(1);
|
2007-12-14 02:52:11 +03:00
|
|
|
mutex_unlock(&rate_ctrl_mutex);
|
2007-10-28 16:49:33 +03:00
|
|
|
return -EALREADY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
some kmalloc/memset ->kzalloc (tree wide)
Transform some calls to kmalloc/memset to a single kzalloc (or kcalloc).
Here is a short excerpt of the semantic patch performing
this transformation:
@@
type T2;
expression x;
identifier f,fld;
expression E;
expression E1,E2;
expression e1,e2,e3,y;
statement S;
@@
x =
- kmalloc
+ kzalloc
(E1,E2)
... when != \(x->fld=E;\|y=f(...,x,...);\|f(...,x,...);\|x=E;\|while(...) S\|for(e1;e2;e3) S\)
- memset((T2)x,0,E1);
@@
expression E1,E2,E3;
@@
- kzalloc(E1 * E2,E3)
+ kcalloc(E1,E2,E3)
[akpm@linux-foundation.org: get kcalloc args the right way around]
Signed-off-by: Yoann Padioleau <padator@wanadoo.fr>
Cc: Richard Henderson <rth@twiddle.net>
Cc: Ivan Kokshaysky <ink@jurassic.park.msu.ru>
Acked-by: Russell King <rmk@arm.linux.org.uk>
Cc: Bryan Wu <bryan.wu@analog.com>
Acked-by: Jiri Slaby <jirislaby@gmail.com>
Cc: Dave Airlie <airlied@linux.ie>
Acked-by: Roland Dreier <rolandd@cisco.com>
Cc: Jiri Kosina <jkosina@suse.cz>
Acked-by: Dmitry Torokhov <dtor@mail.ru>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: Mauro Carvalho Chehab <mchehab@infradead.org>
Acked-by: Pierre Ossman <drzeus-list@drzeus.cx>
Cc: Jeff Garzik <jeff@garzik.org>
Cc: "David S. Miller" <davem@davemloft.net>
Acked-by: Greg KH <greg@kroah.com>
Cc: James Bottomley <James.Bottomley@steeleye.com>
Cc: "Antonino A. Daplas" <adaplas@pol.net>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-07-19 12:49:03 +04:00
|
|
|
alg = kzalloc(sizeof(*alg), GFP_KERNEL);
|
2007-05-05 22:45:53 +04:00
|
|
|
if (alg == NULL) {
|
2007-10-28 16:49:33 +03:00
|
|
|
mutex_unlock(&rate_ctrl_mutex);
|
2007-05-05 22:45:53 +04:00
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
alg->ops = ops;
|
|
|
|
|
|
|
|
list_add_tail(&alg->list, &rate_ctrl_algs);
|
|
|
|
mutex_unlock(&rate_ctrl_mutex);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(ieee80211_rate_control_register);
|
|
|
|
|
|
|
|
void ieee80211_rate_control_unregister(struct rate_control_ops *ops)
|
|
|
|
{
|
|
|
|
struct rate_control_alg *alg;
|
|
|
|
|
|
|
|
mutex_lock(&rate_ctrl_mutex);
|
|
|
|
list_for_each_entry(alg, &rate_ctrl_algs, list) {
|
|
|
|
if (alg->ops == ops) {
|
|
|
|
list_del(&alg->list);
|
2007-12-14 03:17:03 +03:00
|
|
|
kfree(alg);
|
2007-05-05 22:45:53 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&rate_ctrl_mutex);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(ieee80211_rate_control_unregister);
|
|
|
|
|
|
|
|
static struct rate_control_ops *
|
|
|
|
ieee80211_try_rate_control_ops_get(const char *name)
|
|
|
|
{
|
|
|
|
struct rate_control_alg *alg;
|
|
|
|
struct rate_control_ops *ops = NULL;
|
|
|
|
|
2007-10-28 16:17:44 +03:00
|
|
|
if (!name)
|
|
|
|
return NULL;
|
|
|
|
|
2007-05-05 22:45:53 +04:00
|
|
|
mutex_lock(&rate_ctrl_mutex);
|
|
|
|
list_for_each_entry(alg, &rate_ctrl_algs, list) {
|
2007-10-28 16:17:44 +03:00
|
|
|
if (!strcmp(alg->ops->name, name))
|
2007-05-05 22:45:53 +04:00
|
|
|
if (try_module_get(alg->ops->module)) {
|
|
|
|
ops = alg->ops;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
mutex_unlock(&rate_ctrl_mutex);
|
|
|
|
return ops;
|
|
|
|
}
|
|
|
|
|
2007-12-19 03:26:16 +03:00
|
|
|
/* Get the rate control algorithm. */
|
2007-05-05 22:45:53 +04:00
|
|
|
static struct rate_control_ops *
|
|
|
|
ieee80211_rate_control_ops_get(const char *name)
|
|
|
|
{
|
|
|
|
struct rate_control_ops *ops;
|
2007-12-19 03:26:16 +03:00
|
|
|
const char *alg_name;
|
2007-05-05 22:45:53 +04:00
|
|
|
|
2010-08-12 09:04:27 +04:00
|
|
|
kparam_block_sysfs_write(ieee80211_default_rc_algo);
|
2007-10-28 16:17:44 +03:00
|
|
|
if (!name)
|
2007-12-19 03:26:16 +03:00
|
|
|
alg_name = ieee80211_default_rc_algo;
|
|
|
|
else
|
|
|
|
alg_name = name;
|
2007-10-28 16:17:44 +03:00
|
|
|
|
2007-12-19 03:26:16 +03:00
|
|
|
ops = ieee80211_try_rate_control_ops_get(alg_name);
|
2007-05-05 22:45:53 +04:00
|
|
|
if (!ops) {
|
2007-12-19 03:26:16 +03:00
|
|
|
request_module("rc80211_%s", alg_name);
|
|
|
|
ops = ieee80211_try_rate_control_ops_get(alg_name);
|
2007-05-05 22:45:53 +04:00
|
|
|
}
|
2007-12-19 03:26:16 +03:00
|
|
|
if (!ops && name)
|
|
|
|
/* try default if specific alg requested but not found */
|
|
|
|
ops = ieee80211_try_rate_control_ops_get(ieee80211_default_rc_algo);
|
|
|
|
|
2008-01-02 17:17:03 +03:00
|
|
|
/* try built-in one if specific alg requested but not found */
|
|
|
|
if (!ops && strlen(CONFIG_MAC80211_RC_DEFAULT))
|
|
|
|
ops = ieee80211_try_rate_control_ops_get(CONFIG_MAC80211_RC_DEFAULT);
|
2010-08-12 09:04:27 +04:00
|
|
|
kparam_unblock_sysfs_write(ieee80211_default_rc_algo);
|
2008-01-02 17:17:03 +03:00
|
|
|
|
2007-05-05 22:45:53 +04:00
|
|
|
return ops;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void ieee80211_rate_control_ops_put(struct rate_control_ops *ops)
|
|
|
|
{
|
|
|
|
module_put(ops->module);
|
|
|
|
}
|
|
|
|
|
2008-09-18 20:14:18 +04:00
|
|
|
#ifdef CONFIG_MAC80211_DEBUGFS
|
|
|
|
static ssize_t rcname_read(struct file *file, char __user *userbuf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct rate_control_ref *ref = file->private_data;
|
|
|
|
int len = strlen(ref->ops->name);
|
|
|
|
|
|
|
|
return simple_read_from_buffer(userbuf, count, ppos,
|
|
|
|
ref->ops->name, len);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations rcname_ops = {
|
|
|
|
.read = rcname_read,
|
2012-04-06 01:25:11 +04:00
|
|
|
.open = simple_open,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 20:52:59 +04:00
|
|
|
.llseek = default_llseek,
|
2008-09-18 20:14:18 +04:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2010-02-08 05:47:50 +03:00
|
|
|
static struct rate_control_ref *rate_control_alloc(const char *name,
|
2007-05-05 22:45:53 +04:00
|
|
|
struct ieee80211_local *local)
|
|
|
|
{
|
2008-09-18 20:14:18 +04:00
|
|
|
struct dentry *debugfsdir = NULL;
|
2007-05-05 22:45:53 +04:00
|
|
|
struct rate_control_ref *ref;
|
|
|
|
|
|
|
|
ref = kmalloc(sizeof(struct rate_control_ref), GFP_KERNEL);
|
|
|
|
if (!ref)
|
|
|
|
goto fail_ref;
|
2008-09-18 20:14:18 +04:00
|
|
|
ref->local = local;
|
2007-05-05 22:45:53 +04:00
|
|
|
ref->ops = ieee80211_rate_control_ops_get(name);
|
|
|
|
if (!ref->ops)
|
|
|
|
goto fail_ops;
|
2008-09-18 20:14:18 +04:00
|
|
|
|
|
|
|
#ifdef CONFIG_MAC80211_DEBUGFS
|
|
|
|
debugfsdir = debugfs_create_dir("rc", local->hw.wiphy->debugfsdir);
|
|
|
|
local->debugfs.rcdir = debugfsdir;
|
2009-10-27 14:59:03 +03:00
|
|
|
debugfs_create_file("name", 0400, debugfsdir, ref, &rcname_ops);
|
2008-09-18 20:14:18 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
ref->priv = ref->ops->alloc(&local->hw, debugfsdir);
|
2007-05-05 22:45:53 +04:00
|
|
|
if (!ref->priv)
|
|
|
|
goto fail_priv;
|
|
|
|
return ref;
|
|
|
|
|
|
|
|
fail_priv:
|
|
|
|
ieee80211_rate_control_ops_put(ref->ops);
|
|
|
|
fail_ops:
|
|
|
|
kfree(ref);
|
|
|
|
fail_ref:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-01-17 13:33:29 +04:00
|
|
|
static void rate_control_free(struct rate_control_ref *ctrl_ref)
|
2007-05-05 22:45:53 +04:00
|
|
|
{
|
|
|
|
ctrl_ref->ops->free(ctrl_ref->priv);
|
2008-09-18 20:14:18 +04:00
|
|
|
|
|
|
|
#ifdef CONFIG_MAC80211_DEBUGFS
|
2009-10-27 14:59:03 +03:00
|
|
|
debugfs_remove_recursive(ctrl_ref->local->debugfs.rcdir);
|
2008-09-18 20:14:18 +04:00
|
|
|
ctrl_ref->local->debugfs.rcdir = NULL;
|
|
|
|
#endif
|
|
|
|
|
2007-05-05 22:45:53 +04:00
|
|
|
ieee80211_rate_control_ops_put(ctrl_ref->ops);
|
|
|
|
kfree(ctrl_ref);
|
|
|
|
}
|
|
|
|
|
2011-09-29 19:04:04 +04:00
|
|
|
static bool rc_no_data_or_no_ack_use_min(struct ieee80211_tx_rate_control *txrc)
|
2009-07-16 21:05:41 +04:00
|
|
|
{
|
|
|
|
struct sk_buff *skb = txrc->skb;
|
|
|
|
struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
|
|
|
|
struct ieee80211_tx_info *info = IEEE80211_SKB_CB(skb);
|
|
|
|
__le16 fc;
|
|
|
|
|
|
|
|
fc = hdr->frame_control;
|
|
|
|
|
2011-09-29 19:04:04 +04:00
|
|
|
return (info->flags & (IEEE80211_TX_CTL_NO_ACK |
|
|
|
|
IEEE80211_TX_CTL_USE_MINRATE)) ||
|
|
|
|
!ieee80211_is_data(fc);
|
2009-07-16 21:05:41 +04:00
|
|
|
}
|
|
|
|
|
2010-11-22 22:58:24 +03:00
|
|
|
static void rc_send_low_broadcast(s8 *idx, u32 basic_rates,
|
2010-11-11 17:07:23 +03:00
|
|
|
struct ieee80211_supported_band *sband)
|
2009-12-29 13:59:19 +03:00
|
|
|
{
|
|
|
|
u8 i;
|
|
|
|
|
|
|
|
if (basic_rates == 0)
|
|
|
|
return; /* assume basic rates unknown and accept rate */
|
|
|
|
if (*idx < 0)
|
|
|
|
return;
|
|
|
|
if (basic_rates & (1 << *idx))
|
|
|
|
return; /* selected rate is a basic rate */
|
|
|
|
|
2010-11-11 17:07:23 +03:00
|
|
|
for (i = *idx + 1; i <= sband->n_bitrates; i++) {
|
2009-12-29 13:59:19 +03:00
|
|
|
if (basic_rates & (1 << i)) {
|
|
|
|
*idx = i;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* could not find a basic rate; use original selection */
|
|
|
|
}
|
|
|
|
|
2011-09-25 13:23:31 +04:00
|
|
|
static inline s8
|
|
|
|
rate_lowest_non_cck_index(struct ieee80211_supported_band *sband,
|
|
|
|
struct ieee80211_sta *sta)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < sband->n_bitrates; i++) {
|
|
|
|
struct ieee80211_rate *srate = &sband->bitrates[i];
|
|
|
|
if ((srate->bitrate == 10) || (srate->bitrate == 20) ||
|
|
|
|
(srate->bitrate == 55) || (srate->bitrate == 110))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (rate_supported(sta, sband->band, i))
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* No matching rate found */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-07-16 21:05:41 +04:00
|
|
|
bool rate_control_send_low(struct ieee80211_sta *sta,
|
|
|
|
void *priv_sta,
|
|
|
|
struct ieee80211_tx_rate_control *txrc)
|
|
|
|
{
|
|
|
|
struct ieee80211_tx_info *info = IEEE80211_SKB_CB(txrc->skb);
|
2010-11-22 22:58:24 +03:00
|
|
|
struct ieee80211_supported_band *sband = txrc->sband;
|
|
|
|
int mcast_rate;
|
2009-07-16 21:05:41 +04:00
|
|
|
|
2011-09-29 19:04:04 +04:00
|
|
|
if (!sta || !priv_sta || rc_no_data_or_no_ack_use_min(txrc)) {
|
2011-09-25 13:23:31 +04:00
|
|
|
if ((sband->band != IEEE80211_BAND_2GHZ) ||
|
|
|
|
!(info->flags & IEEE80211_TX_CTL_NO_CCK_RATE))
|
|
|
|
info->control.rates[0].idx =
|
|
|
|
rate_lowest_index(txrc->sband, sta);
|
|
|
|
else
|
|
|
|
info->control.rates[0].idx =
|
|
|
|
rate_lowest_non_cck_index(txrc->sband, sta);
|
2009-07-16 21:05:41 +04:00
|
|
|
info->control.rates[0].count =
|
|
|
|
(info->flags & IEEE80211_TX_CTL_NO_ACK) ?
|
|
|
|
1 : txrc->hw->max_rate_tries;
|
2010-11-22 22:58:24 +03:00
|
|
|
if (!sta && txrc->bss) {
|
|
|
|
mcast_rate = txrc->bss_conf->mcast_rate[sband->band];
|
|
|
|
if (mcast_rate > 0) {
|
|
|
|
info->control.rates[0].idx = mcast_rate - 1;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-12-29 13:59:19 +03:00
|
|
|
rc_send_low_broadcast(&info->control.rates[0].idx,
|
|
|
|
txrc->bss_conf->basic_rates,
|
2010-11-22 22:58:24 +03:00
|
|
|
sband);
|
|
|
|
}
|
2009-07-16 21:05:41 +04:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(rate_control_send_low);
|
|
|
|
|
2012-01-28 20:25:33 +04:00
|
|
|
static bool rate_idx_match_legacy_mask(struct ieee80211_tx_rate *rate,
|
|
|
|
int n_bitrates, u32 mask)
|
2010-01-06 14:09:08 +03:00
|
|
|
{
|
|
|
|
int j;
|
|
|
|
|
|
|
|
/* See whether the selected rate or anything below it is allowed. */
|
|
|
|
for (j = rate->idx; j >= 0; j--) {
|
|
|
|
if (mask & (1 << j)) {
|
|
|
|
/* Okay, found a suitable rate. Use it. */
|
|
|
|
rate->idx = j;
|
2012-01-28 20:25:33 +04:00
|
|
|
return true;
|
2010-01-06 14:09:08 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Try to find a higher rate that would be allowed */
|
|
|
|
for (j = rate->idx + 1; j < n_bitrates; j++) {
|
|
|
|
if (mask & (1 << j)) {
|
|
|
|
/* Okay, found a suitable rate. Use it. */
|
|
|
|
rate->idx = j;
|
2012-01-28 20:25:33 +04:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool rate_idx_match_mcs_mask(struct ieee80211_tx_rate *rate,
|
|
|
|
u8 mcs_mask[IEEE80211_HT_MCS_MASK_LEN])
|
|
|
|
{
|
|
|
|
int i, j;
|
|
|
|
int ridx, rbit;
|
|
|
|
|
|
|
|
ridx = rate->idx / 8;
|
|
|
|
rbit = rate->idx % 8;
|
|
|
|
|
|
|
|
/* sanity check */
|
2012-02-01 11:42:11 +04:00
|
|
|
if (ridx < 0 || ridx >= IEEE80211_HT_MCS_MASK_LEN)
|
2012-01-28 20:25:33 +04:00
|
|
|
return false;
|
|
|
|
|
|
|
|
/* See whether the selected rate or anything below it is allowed. */
|
|
|
|
for (i = ridx; i >= 0; i--) {
|
|
|
|
for (j = rbit; j >= 0; j--)
|
|
|
|
if (mcs_mask[i] & BIT(j)) {
|
|
|
|
rate->idx = i * 8 + j;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
rbit = 7;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Try to find a higher rate that would be allowed */
|
|
|
|
ridx = (rate->idx + 1) / 8;
|
|
|
|
rbit = (rate->idx + 1) % 8;
|
|
|
|
|
|
|
|
for (i = ridx; i < IEEE80211_HT_MCS_MASK_LEN; i++) {
|
|
|
|
for (j = rbit; j < 8; j++)
|
|
|
|
if (mcs_mask[i] & BIT(j)) {
|
|
|
|
rate->idx = i * 8 + j;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
rbit = 0;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void rate_idx_match_mask(struct ieee80211_tx_rate *rate,
|
|
|
|
struct ieee80211_tx_rate_control *txrc,
|
|
|
|
u32 mask,
|
|
|
|
u8 mcs_mask[IEEE80211_HT_MCS_MASK_LEN])
|
|
|
|
{
|
|
|
|
struct ieee80211_tx_rate alt_rate;
|
|
|
|
|
|
|
|
/* handle HT rates */
|
|
|
|
if (rate->flags & IEEE80211_TX_RC_MCS) {
|
|
|
|
if (rate_idx_match_mcs_mask(rate, mcs_mask))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* also try the legacy rates. */
|
|
|
|
alt_rate.idx = 0;
|
|
|
|
/* keep protection flags */
|
|
|
|
alt_rate.flags = rate->flags &
|
|
|
|
(IEEE80211_TX_RC_USE_RTS_CTS |
|
|
|
|
IEEE80211_TX_RC_USE_CTS_PROTECT |
|
|
|
|
IEEE80211_TX_RC_USE_SHORT_PREAMBLE);
|
|
|
|
alt_rate.count = rate->count;
|
|
|
|
if (rate_idx_match_legacy_mask(&alt_rate,
|
|
|
|
txrc->sband->n_bitrates,
|
|
|
|
mask)) {
|
|
|
|
*rate = alt_rate;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
struct sk_buff *skb = txrc->skb;
|
|
|
|
struct ieee80211_hdr *hdr = (struct ieee80211_hdr *) skb->data;
|
|
|
|
__le16 fc;
|
|
|
|
|
|
|
|
/* handle legacy rates */
|
|
|
|
if (rate_idx_match_legacy_mask(rate, txrc->sband->n_bitrates,
|
|
|
|
mask))
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* if HT BSS, and we handle a data frame, also try HT rates */
|
2012-11-09 14:39:59 +04:00
|
|
|
if (txrc->bss_conf->chandef.width == NL80211_CHAN_WIDTH_20_NOHT)
|
2012-01-28 20:25:33 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
fc = hdr->frame_control;
|
|
|
|
if (!ieee80211_is_data(fc))
|
|
|
|
return;
|
|
|
|
|
|
|
|
alt_rate.idx = 0;
|
|
|
|
/* keep protection flags */
|
|
|
|
alt_rate.flags = rate->flags &
|
|
|
|
(IEEE80211_TX_RC_USE_RTS_CTS |
|
|
|
|
IEEE80211_TX_RC_USE_CTS_PROTECT |
|
|
|
|
IEEE80211_TX_RC_USE_SHORT_PREAMBLE);
|
|
|
|
alt_rate.count = rate->count;
|
|
|
|
|
|
|
|
alt_rate.flags |= IEEE80211_TX_RC_MCS;
|
|
|
|
|
2012-11-09 14:39:59 +04:00
|
|
|
if (txrc->bss_conf->chandef.width == NL80211_CHAN_WIDTH_40)
|
2012-01-28 20:25:33 +04:00
|
|
|
alt_rate.flags |= IEEE80211_TX_RC_40_MHZ_WIDTH;
|
|
|
|
|
|
|
|
if (rate_idx_match_mcs_mask(&alt_rate, mcs_mask)) {
|
|
|
|
*rate = alt_rate;
|
2010-01-06 14:09:08 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Uh.. No suitable rate exists. This should not really happen with
|
|
|
|
* sane TX rate mask configurations. However, should someone manage to
|
|
|
|
* configure supported rates and TX rate mask in incompatible way,
|
|
|
|
* allow the frame to be transmitted with whatever the rate control
|
|
|
|
* selected.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
2008-09-18 20:14:18 +04:00
|
|
|
void rate_control_get_rate(struct ieee80211_sub_if_data *sdata,
|
2008-10-21 14:40:02 +04:00
|
|
|
struct sta_info *sta,
|
|
|
|
struct ieee80211_tx_rate_control *txrc)
|
2007-12-20 15:50:07 +03:00
|
|
|
{
|
2008-09-18 20:14:18 +04:00
|
|
|
struct rate_control_ref *ref = sdata->local->rate_ctrl;
|
|
|
|
void *priv_sta = NULL;
|
|
|
|
struct ieee80211_sta *ista = NULL;
|
2008-10-21 14:40:02 +04:00
|
|
|
struct ieee80211_tx_info *info = IEEE80211_SKB_CB(txrc->skb);
|
2007-12-20 15:50:07 +03:00
|
|
|
int i;
|
2010-01-06 14:09:08 +03:00
|
|
|
u32 mask;
|
2012-01-28 20:25:33 +04:00
|
|
|
u8 mcs_mask[IEEE80211_HT_MCS_MASK_LEN];
|
2007-12-20 15:50:07 +03:00
|
|
|
|
2012-01-20 16:55:23 +04:00
|
|
|
if (sta && test_sta_flag(sta, WLAN_STA_RATE_CONTROL)) {
|
2008-09-18 20:14:18 +04:00
|
|
|
ista = &sta->sta;
|
|
|
|
priv_sta = sta->rate_ctrl_priv;
|
|
|
|
}
|
|
|
|
|
2008-10-21 14:40:02 +04:00
|
|
|
for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
|
|
|
|
info->control.rates[i].idx = -1;
|
|
|
|
info->control.rates[i].flags = 0;
|
2012-02-20 08:35:31 +04:00
|
|
|
info->control.rates[i].count = 0;
|
2008-10-21 14:40:02 +04:00
|
|
|
}
|
|
|
|
|
2010-02-12 11:05:45 +03:00
|
|
|
if (sdata->local->hw.flags & IEEE80211_HW_HAS_RATE_CONTROL)
|
|
|
|
return;
|
|
|
|
|
2010-01-06 14:09:08 +03:00
|
|
|
ref->ops->get_rate(ref->priv, ista, priv_sta, txrc);
|
2008-10-21 14:40:02 +04:00
|
|
|
|
|
|
|
/*
|
2010-01-06 14:09:08 +03:00
|
|
|
* Try to enforce the rateidx mask the user wanted. skip this if the
|
|
|
|
* default mask (allow all rates) is used to save some processing for
|
|
|
|
* the common case.
|
2008-10-21 14:40:02 +04:00
|
|
|
*/
|
2010-01-06 14:09:08 +03:00
|
|
|
mask = sdata->rc_rateidx_mask[info->band];
|
2012-01-28 20:25:33 +04:00
|
|
|
memcpy(mcs_mask, sdata->rc_rateidx_mcs_mask[info->band],
|
|
|
|
sizeof(mcs_mask));
|
2010-01-06 14:09:08 +03:00
|
|
|
if (mask != (1 << txrc->sband->n_bitrates) - 1) {
|
|
|
|
if (sta) {
|
|
|
|
/* Filter out rates that the STA does not support */
|
|
|
|
mask &= sta->sta.supp_rates[info->band];
|
2012-01-28 20:25:33 +04:00
|
|
|
for (i = 0; i < sizeof(mcs_mask); i++)
|
|
|
|
mcs_mask[i] &= sta->sta.ht_cap.mcs.rx_mask[i];
|
2010-01-06 14:09:08 +03:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Make sure the rate index selected for each TX rate is
|
|
|
|
* included in the configured mask and change the rate indexes
|
|
|
|
* if needed.
|
|
|
|
*/
|
2008-10-21 14:40:02 +04:00
|
|
|
for (i = 0; i < IEEE80211_TX_MAX_RATES; i++) {
|
2010-10-16 20:49:15 +04:00
|
|
|
/* Skip invalid rates */
|
|
|
|
if (info->control.rates[i].idx < 0)
|
|
|
|
break;
|
2012-01-28 20:25:33 +04:00
|
|
|
rate_idx_match_mask(&info->control.rates[i], txrc,
|
|
|
|
mask, mcs_mask);
|
2010-01-06 14:09:08 +03:00
|
|
|
}
|
2007-12-20 15:50:07 +03:00
|
|
|
}
|
2008-10-21 14:40:02 +04:00
|
|
|
|
|
|
|
BUG_ON(info->control.rates[0].idx < 0);
|
2007-12-20 15:50:07 +03:00
|
|
|
}
|
|
|
|
|
2007-07-27 17:43:23 +04:00
|
|
|
int ieee80211_init_rate_ctrl_alg(struct ieee80211_local *local,
|
|
|
|
const char *name)
|
|
|
|
{
|
2012-01-17 13:33:29 +04:00
|
|
|
struct rate_control_ref *ref;
|
2007-07-27 17:43:23 +04:00
|
|
|
|
|
|
|
ASSERT_RTNL();
|
2009-11-17 20:18:36 +03:00
|
|
|
|
2009-06-17 19:43:56 +04:00
|
|
|
if (local->open_count)
|
2007-07-27 17:43:23 +04:00
|
|
|
return -EBUSY;
|
|
|
|
|
2009-11-17 20:18:36 +03:00
|
|
|
if (local->hw.flags & IEEE80211_HW_HAS_RATE_CONTROL) {
|
|
|
|
if (WARN_ON(!local->ops->set_rts_threshold))
|
|
|
|
return -EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-07-27 17:43:23 +04:00
|
|
|
ref = rate_control_alloc(name, local);
|
|
|
|
if (!ref) {
|
2010-08-21 03:25:38 +04:00
|
|
|
wiphy_warn(local->hw.wiphy,
|
|
|
|
"Failed to select rate control algorithm\n");
|
2007-07-27 17:43:23 +04:00
|
|
|
return -ENOENT;
|
|
|
|
}
|
|
|
|
|
2012-01-17 13:33:29 +04:00
|
|
|
WARN_ON(local->rate_ctrl);
|
2007-07-27 17:43:23 +04:00
|
|
|
local->rate_ctrl = ref;
|
|
|
|
|
2010-08-21 03:25:38 +04:00
|
|
|
wiphy_debug(local->hw.wiphy, "Selected rate control algorithm '%s'\n",
|
|
|
|
ref->ops->name);
|
2007-07-27 17:43:23 +04:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void rate_control_deinitialize(struct ieee80211_local *local)
|
|
|
|
{
|
|
|
|
struct rate_control_ref *ref;
|
|
|
|
|
|
|
|
ref = local->rate_ctrl;
|
2009-11-17 20:18:36 +03:00
|
|
|
|
|
|
|
if (!ref)
|
|
|
|
return;
|
|
|
|
|
2007-07-27 17:43:23 +04:00
|
|
|
local->rate_ctrl = NULL;
|
2012-01-17 13:33:29 +04:00
|
|
|
rate_control_free(ref);
|
2007-07-27 17:43:23 +04:00
|
|
|
}
|
2007-12-19 03:26:16 +03:00
|
|
|
|