2008-10-05 16:07:45 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Based on minstrel.c:
|
|
|
|
* Copyright (C) 2005-2007 Derek Smithies <derek@indranet.co.nz>
|
|
|
|
* Sponsored by Indranet Technologies Ltd
|
|
|
|
*
|
|
|
|
* Based on sample.c:
|
|
|
|
* Copyright (c) 2005 John Bicket
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer,
|
|
|
|
* without modification.
|
|
|
|
* 2. Redistributions in binary form must reproduce at minimum a disclaimer
|
|
|
|
* similar to the "NO WARRANTY" disclaimer below ("Disclaimer") and any
|
|
|
|
* redistribution must be conditioned upon including a substantially
|
|
|
|
* similar Disclaimer requirement for further binary redistribution.
|
|
|
|
* 3. Neither the names of the above-listed copyright holders nor the names
|
|
|
|
* of any contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* Alternatively, this software may be distributed under the terms of the
|
|
|
|
* GNU General Public License ("GPL") version 2 as published by the Free
|
|
|
|
* Software Foundation.
|
|
|
|
*
|
|
|
|
* NO WARRANTY
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF NONINFRINGEMENT, MERCHANTIBILITY
|
|
|
|
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
|
|
* THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY,
|
|
|
|
* OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
|
|
|
|
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
|
|
|
* THE POSSIBILITY OF SUCH DAMAGES.
|
|
|
|
*/
|
|
|
|
#include <linux/netdevice.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/skbuff.h>
|
|
|
|
#include <linux/debugfs.h>
|
|
|
|
#include <linux/ieee80211.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 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2011-07-15 15:47:34 +00:00
|
|
|
#include <linux/export.h>
|
2008-10-05 16:07:45 +00:00
|
|
|
#include <net/mac80211.h>
|
|
|
|
#include "rc80211_minstrel.h"
|
|
|
|
|
2015-03-24 20:09:36 +00:00
|
|
|
ssize_t
|
|
|
|
minstrel_stats_read(struct file *file, char __user *buf, size_t len, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct minstrel_debugfs_info *ms;
|
|
|
|
|
|
|
|
ms = file->private_data;
|
|
|
|
return simple_read_from_buffer(buf, len, ppos, ms->buf, ms->len);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
minstrel_stats_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
kfree(file->private_data);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-03-01 21:21:40 +00:00
|
|
|
int
|
2008-10-05 16:07:45 +00:00
|
|
|
minstrel_stats_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct minstrel_sta_info *mi = inode->i_private;
|
2010-03-01 21:17:38 +00:00
|
|
|
struct minstrel_debugfs_info *ms;
|
2016-12-14 19:46:58 +00:00
|
|
|
unsigned int i, tp_max, tp_avg, eprob;
|
2008-10-05 16:07:45 +00:00
|
|
|
char *p;
|
|
|
|
|
2014-10-20 08:54:36 +00:00
|
|
|
ms = kmalloc(2048, GFP_KERNEL);
|
2008-10-05 16:07:45 +00:00
|
|
|
if (!ms)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
file->private_data = ms;
|
|
|
|
p = ms->buf;
|
2015-03-24 20:09:34 +00:00
|
|
|
p += sprintf(p, "\n");
|
2015-09-23 08:29:20 +00:00
|
|
|
p += sprintf(p,
|
2016-12-14 19:46:58 +00:00
|
|
|
"best __________rate_________ ________statistics________ ____last_____ ______sum-of________\n");
|
2015-09-23 08:29:20 +00:00
|
|
|
p += sprintf(p,
|
2016-12-14 19:46:58 +00:00
|
|
|
"rate [name idx airtime max_tp] [avg(tp) avg(prob) sd(prob)] [retry|suc|att] [#success | #attempts]\n");
|
2015-03-24 20:09:34 +00:00
|
|
|
|
2008-10-05 16:07:45 +00:00
|
|
|
for (i = 0; i < mi->n_rates; i++) {
|
|
|
|
struct minstrel_rate *mr = &mi->r[i];
|
2014-09-09 21:22:13 +00:00
|
|
|
struct minstrel_rate_stats *mrs = &mi->r[i].stats;
|
2016-12-14 19:47:00 +00:00
|
|
|
unsigned int prob_ewmsd;
|
2008-10-05 16:07:45 +00:00
|
|
|
|
2013-03-04 22:30:07 +00:00
|
|
|
*(p++) = (i == mi->max_tp_rate[0]) ? 'A' : ' ';
|
|
|
|
*(p++) = (i == mi->max_tp_rate[1]) ? 'B' : ' ';
|
|
|
|
*(p++) = (i == mi->max_tp_rate[2]) ? 'C' : ' ';
|
|
|
|
*(p++) = (i == mi->max_tp_rate[3]) ? 'D' : ' ';
|
2008-10-05 16:07:45 +00:00
|
|
|
*(p++) = (i == mi->max_prob_rate) ? 'P' : ' ';
|
2015-03-24 20:09:34 +00:00
|
|
|
|
|
|
|
p += sprintf(p, " %3u%s ", mr->bitrate / 2,
|
2008-10-05 16:07:45 +00:00
|
|
|
(mr->bitrate & 1 ? ".5" : " "));
|
2015-03-24 20:09:34 +00:00
|
|
|
p += sprintf(p, "%3u ", i);
|
2015-03-24 20:09:41 +00:00
|
|
|
p += sprintf(p, "%6u ", mr->perfect_tx_time);
|
2008-10-05 16:07:45 +00:00
|
|
|
|
2015-03-24 20:09:41 +00:00
|
|
|
tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100));
|
|
|
|
tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma);
|
2015-03-24 20:09:39 +00:00
|
|
|
eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000);
|
2016-12-14 19:47:00 +00:00
|
|
|
prob_ewmsd = minstrel_get_ewmsd10(mrs);
|
2008-10-05 16:07:45 +00:00
|
|
|
|
2015-09-23 08:29:20 +00:00
|
|
|
p += sprintf(p, "%4u.%1u %4u.%1u %3u.%1u %3u.%1u"
|
2016-12-14 19:46:58 +00:00
|
|
|
" %3u %3u %-3u "
|
2015-03-24 20:09:43 +00:00
|
|
|
"%9llu %-9llu\n",
|
2015-03-24 20:09:41 +00:00
|
|
|
tp_max / 10, tp_max % 10,
|
2015-03-24 20:09:40 +00:00
|
|
|
tp_avg / 10, tp_avg % 10,
|
2008-10-05 16:07:45 +00:00
|
|
|
eprob / 10, eprob % 10,
|
2016-12-14 19:47:00 +00:00
|
|
|
prob_ewmsd / 10, prob_ewmsd % 10,
|
2015-03-24 20:09:34 +00:00
|
|
|
mrs->retry_count,
|
2014-09-09 21:22:13 +00:00
|
|
|
mrs->last_success,
|
|
|
|
mrs->last_attempts,
|
|
|
|
(unsigned long long)mrs->succ_hist,
|
|
|
|
(unsigned long long)mrs->att_hist);
|
2008-10-05 16:07:45 +00:00
|
|
|
}
|
|
|
|
p += sprintf(p, "\nTotal packet count:: ideal %d "
|
|
|
|
"lookaround %d\n\n",
|
2014-09-09 21:22:13 +00:00
|
|
|
mi->total_packets - mi->sample_packets,
|
|
|
|
mi->sample_packets);
|
2008-10-05 16:07:45 +00:00
|
|
|
ms->len = p - ms->buf;
|
|
|
|
|
2014-10-20 08:54:36 +00:00
|
|
|
WARN_ON(ms->len + sizeof(*ms) > 2048);
|
|
|
|
|
2008-10-05 16:07:45 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-03-24 20:09:36 +00:00
|
|
|
static const struct file_operations minstrel_stat_fops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = minstrel_stats_open,
|
|
|
|
.read = minstrel_stats_read,
|
|
|
|
.release = minstrel_stats_release,
|
|
|
|
.llseek = default_llseek,
|
|
|
|
};
|
|
|
|
|
|
|
|
int
|
|
|
|
minstrel_stats_csv_open(struct inode *inode, struct file *file)
|
2008-10-05 16:07:45 +00:00
|
|
|
{
|
2015-03-24 20:09:36 +00:00
|
|
|
struct minstrel_sta_info *mi = inode->i_private;
|
2010-03-01 21:17:38 +00:00
|
|
|
struct minstrel_debugfs_info *ms;
|
2016-12-14 19:46:58 +00:00
|
|
|
unsigned int i, tp_max, tp_avg, eprob;
|
2015-03-24 20:09:36 +00:00
|
|
|
char *p;
|
2008-10-05 16:07:45 +00:00
|
|
|
|
2015-03-24 20:09:36 +00:00
|
|
|
ms = kmalloc(2048, GFP_KERNEL);
|
|
|
|
if (!ms)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
file->private_data = ms;
|
|
|
|
p = ms->buf;
|
|
|
|
|
|
|
|
for (i = 0; i < mi->n_rates; i++) {
|
|
|
|
struct minstrel_rate *mr = &mi->r[i];
|
|
|
|
struct minstrel_rate_stats *mrs = &mi->r[i].stats;
|
2016-12-14 19:47:00 +00:00
|
|
|
unsigned int prob_ewmsd;
|
2015-03-24 20:09:36 +00:00
|
|
|
|
|
|
|
p += sprintf(p, "%s" ,((i == mi->max_tp_rate[0]) ? "A" : ""));
|
|
|
|
p += sprintf(p, "%s" ,((i == mi->max_tp_rate[1]) ? "B" : ""));
|
|
|
|
p += sprintf(p, "%s" ,((i == mi->max_tp_rate[2]) ? "C" : ""));
|
|
|
|
p += sprintf(p, "%s" ,((i == mi->max_tp_rate[3]) ? "D" : ""));
|
|
|
|
p += sprintf(p, "%s" ,((i == mi->max_prob_rate) ? "P" : ""));
|
|
|
|
|
|
|
|
p += sprintf(p, ",%u%s", mr->bitrate / 2,
|
|
|
|
(mr->bitrate & 1 ? ".5," : ","));
|
|
|
|
p += sprintf(p, "%u,", i);
|
|
|
|
p += sprintf(p, "%u,",mr->perfect_tx_time);
|
|
|
|
|
2015-03-24 20:09:41 +00:00
|
|
|
tp_max = minstrel_get_tp_avg(mr, MINSTREL_FRAC(100,100));
|
|
|
|
tp_avg = minstrel_get_tp_avg(mr, mrs->prob_ewma);
|
2015-03-24 20:09:39 +00:00
|
|
|
eprob = MINSTREL_TRUNC(mrs->prob_ewma * 1000);
|
2016-12-14 19:47:00 +00:00
|
|
|
prob_ewmsd = minstrel_get_ewmsd10(mrs);
|
2015-03-24 20:09:36 +00:00
|
|
|
|
2016-12-14 19:46:58 +00:00
|
|
|
p += sprintf(p, "%u.%u,%u.%u,%u.%u,%u.%u,%u,%u,%u,"
|
2015-03-24 20:09:36 +00:00
|
|
|
"%llu,%llu,%d,%d\n",
|
2015-03-24 20:09:41 +00:00
|
|
|
tp_max / 10, tp_max % 10,
|
2015-03-24 20:09:40 +00:00
|
|
|
tp_avg / 10, tp_avg % 10,
|
2015-03-24 20:09:36 +00:00
|
|
|
eprob / 10, eprob % 10,
|
2016-12-14 19:47:00 +00:00
|
|
|
prob_ewmsd / 10, prob_ewmsd % 10,
|
2015-03-24 20:09:36 +00:00
|
|
|
mrs->retry_count,
|
|
|
|
mrs->last_success,
|
|
|
|
mrs->last_attempts,
|
|
|
|
(unsigned long long)mrs->succ_hist,
|
|
|
|
(unsigned long long)mrs->att_hist,
|
|
|
|
mi->total_packets - mi->sample_packets,
|
|
|
|
mi->sample_packets);
|
|
|
|
|
|
|
|
}
|
|
|
|
ms->len = p - ms->buf;
|
|
|
|
|
|
|
|
WARN_ON(ms->len + sizeof(*ms) > 2048);
|
2008-10-05 16:07:45 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-03-24 20:09:36 +00:00
|
|
|
static const struct file_operations minstrel_stat_csv_fops = {
|
2008-10-05 16:07:45 +00:00
|
|
|
.owner = THIS_MODULE,
|
2015-03-24 20:09:36 +00:00
|
|
|
.open = minstrel_stats_csv_open,
|
2008-10-05 16:07:45 +00:00
|
|
|
.read = minstrel_stats_read,
|
|
|
|
.release = minstrel_stats_release,
|
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 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2008-10-05 16:07:45 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
void
|
|
|
|
minstrel_add_sta_debugfs(void *priv, void *priv_sta, struct dentry *dir)
|
|
|
|
{
|
|
|
|
struct minstrel_sta_info *mi = priv_sta;
|
|
|
|
|
2018-03-23 22:54:38 +00:00
|
|
|
mi->dbg_stats = debugfs_create_file("rc_stats", 0444, dir, mi,
|
|
|
|
&minstrel_stat_fops);
|
2015-03-24 20:09:36 +00:00
|
|
|
|
2018-03-23 22:54:38 +00:00
|
|
|
mi->dbg_stats_csv = debugfs_create_file("rc_stats_csv", 0444, dir, mi,
|
|
|
|
&minstrel_stat_csv_fops);
|
2008-10-05 16:07:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
minstrel_remove_sta_debugfs(void *priv, void *priv_sta)
|
|
|
|
{
|
|
|
|
struct minstrel_sta_info *mi = priv_sta;
|
|
|
|
|
|
|
|
debugfs_remove(mi->dbg_stats);
|
2015-03-24 20:09:36 +00:00
|
|
|
|
|
|
|
debugfs_remove(mi->dbg_stats_csv);
|
2008-10-05 16:07:45 +00:00
|
|
|
}
|