2009-02-24 08:30:22 -07:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 Oracle. All rights reserved.
|
|
|
|
*
|
|
|
|
* This software is available to you under a choice of one of two
|
|
|
|
* licenses. You may choose to be licensed under the terms of the GNU
|
|
|
|
* General Public License (GPL) Version 2, available from the file
|
|
|
|
* COPYING in the main directory of this source tree, or the
|
|
|
|
* OpenIB.org BSD license below:
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or
|
|
|
|
* without modification, are permitted provided that the following
|
|
|
|
* conditions are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer.
|
|
|
|
*
|
|
|
|
* - Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials
|
|
|
|
* provided with the distribution.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
#include <linux/seq_file.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 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2009-02-24 08:30:22 -07:00
|
|
|
#include <linux/proc_fs.h>
|
2011-07-15 09:47:34 -06:00
|
|
|
#include <linux/export.h>
|
2009-02-24 08:30:22 -07:00
|
|
|
|
|
|
|
#include "rds.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file implements a getsockopt() call which copies a set of fixed
|
|
|
|
* sized structs into a user-specified buffer as a means of providing
|
|
|
|
* read-only information about RDS.
|
|
|
|
*
|
|
|
|
* For a given information source there are a given number of fixed sized
|
|
|
|
* structs at a given time. The structs are only copied if the user-specified
|
|
|
|
* buffer is big enough. The destination pages that make up the buffer
|
|
|
|
* are pinned for the duration of the copy.
|
|
|
|
*
|
|
|
|
* This gives us the following benefits:
|
|
|
|
*
|
|
|
|
* - simple implementation, no copy "position" across multiple calls
|
|
|
|
* - consistent snapshot of an info source
|
|
|
|
* - atomic copy works well with whatever locking info source has
|
|
|
|
* - one portable tool to get rds info across implementations
|
|
|
|
* - long-lived tool can get info without allocating
|
|
|
|
*
|
|
|
|
* at the following costs:
|
|
|
|
*
|
|
|
|
* - info source copy must be pinned, may be "large"
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct rds_info_iterator {
|
|
|
|
struct page **pages;
|
|
|
|
void *addr;
|
|
|
|
unsigned long offset;
|
|
|
|
};
|
|
|
|
|
|
|
|
static DEFINE_SPINLOCK(rds_info_lock);
|
|
|
|
static rds_info_func rds_info_funcs[RDS_INFO_LAST - RDS_INFO_FIRST + 1];
|
|
|
|
|
|
|
|
void rds_info_register_func(int optname, rds_info_func func)
|
|
|
|
{
|
|
|
|
int offset = optname - RDS_INFO_FIRST;
|
|
|
|
|
|
|
|
BUG_ON(optname < RDS_INFO_FIRST || optname > RDS_INFO_LAST);
|
|
|
|
|
|
|
|
spin_lock(&rds_info_lock);
|
2010-01-12 12:56:44 -07:00
|
|
|
BUG_ON(rds_info_funcs[offset]);
|
2009-02-24 08:30:22 -07:00
|
|
|
rds_info_funcs[offset] = func;
|
|
|
|
spin_unlock(&rds_info_lock);
|
|
|
|
}
|
2009-08-21 06:28:32 -06:00
|
|
|
EXPORT_SYMBOL_GPL(rds_info_register_func);
|
2009-02-24 08:30:22 -07:00
|
|
|
|
|
|
|
void rds_info_deregister_func(int optname, rds_info_func func)
|
|
|
|
{
|
|
|
|
int offset = optname - RDS_INFO_FIRST;
|
|
|
|
|
|
|
|
BUG_ON(optname < RDS_INFO_FIRST || optname > RDS_INFO_LAST);
|
|
|
|
|
|
|
|
spin_lock(&rds_info_lock);
|
|
|
|
BUG_ON(rds_info_funcs[offset] != func);
|
|
|
|
rds_info_funcs[offset] = NULL;
|
|
|
|
spin_unlock(&rds_info_lock);
|
|
|
|
}
|
2009-08-21 06:28:32 -06:00
|
|
|
EXPORT_SYMBOL_GPL(rds_info_deregister_func);
|
2009-02-24 08:30:22 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Typically we hold an atomic kmap across multiple rds_info_copy() calls
|
|
|
|
* because the kmap is so expensive. This must be called before using blocking
|
|
|
|
* operations while holding the mapping and as the iterator is torn down.
|
|
|
|
*/
|
|
|
|
void rds_info_iter_unmap(struct rds_info_iterator *iter)
|
|
|
|
{
|
2010-01-12 12:56:44 -07:00
|
|
|
if (iter->addr) {
|
2011-11-25 08:14:40 -07:00
|
|
|
kunmap_atomic(iter->addr);
|
2009-02-24 08:30:22 -07:00
|
|
|
iter->addr = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_user_pages() called flush_dcache_page() on the pages for us.
|
|
|
|
*/
|
|
|
|
void rds_info_copy(struct rds_info_iterator *iter, void *data,
|
|
|
|
unsigned long bytes)
|
|
|
|
{
|
|
|
|
unsigned long this;
|
|
|
|
|
|
|
|
while (bytes) {
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!iter->addr)
|
2011-11-25 08:14:40 -07:00
|
|
|
iter->addr = kmap_atomic(*iter->pages);
|
2009-02-24 08:30:22 -07:00
|
|
|
|
|
|
|
this = min(bytes, PAGE_SIZE - iter->offset);
|
|
|
|
|
|
|
|
rdsdebug("page %p addr %p offset %lu this %lu data %p "
|
|
|
|
"bytes %lu\n", *iter->pages, iter->addr,
|
|
|
|
iter->offset, this, data, bytes);
|
|
|
|
|
|
|
|
memcpy(iter->addr + iter->offset, data, this);
|
|
|
|
|
|
|
|
data += this;
|
|
|
|
bytes -= this;
|
|
|
|
iter->offset += this;
|
|
|
|
|
|
|
|
if (iter->offset == PAGE_SIZE) {
|
2011-11-25 08:14:40 -07:00
|
|
|
kunmap_atomic(iter->addr);
|
2009-02-24 08:30:22 -07:00
|
|
|
iter->addr = NULL;
|
|
|
|
iter->offset = 0;
|
|
|
|
iter->pages++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-08-21 06:28:32 -06:00
|
|
|
EXPORT_SYMBOL_GPL(rds_info_copy);
|
2009-02-24 08:30:22 -07:00
|
|
|
|
|
|
|
/*
|
|
|
|
* @optval points to the userspace buffer that the information snapshot
|
|
|
|
* will be copied into.
|
|
|
|
*
|
|
|
|
* @optlen on input is the size of the buffer in userspace. @optlen
|
|
|
|
* on output is the size of the requested snapshot in bytes.
|
|
|
|
*
|
|
|
|
* This function returns -errno if there is a failure, particularly -ENOSPC
|
|
|
|
* if the given userspace buffer was not large enough to fit the snapshot.
|
|
|
|
* On success it returns the positive number of bytes of each array element
|
|
|
|
* in the snapshot.
|
|
|
|
*/
|
|
|
|
int rds_info_getsockopt(struct socket *sock, int optname, char __user *optval,
|
|
|
|
int __user *optlen)
|
|
|
|
{
|
|
|
|
struct rds_info_iterator iter;
|
|
|
|
struct rds_info_lengths lens;
|
|
|
|
unsigned long nr_pages = 0;
|
|
|
|
unsigned long start;
|
|
|
|
rds_info_func func;
|
|
|
|
struct page **pages = NULL;
|
|
|
|
int ret;
|
|
|
|
int len;
|
|
|
|
int total;
|
|
|
|
|
|
|
|
if (get_user(len, optlen)) {
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check for all kinds of wrapping and the like */
|
|
|
|
start = (unsigned long)optval;
|
2015-08-01 06:33:26 -06:00
|
|
|
if (len < 0 || len > INT_MAX - PAGE_SIZE + 1 || start + len < start) {
|
2009-02-24 08:30:22 -07:00
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* a 0 len call is just trying to probe its length */
|
|
|
|
if (len == 0)
|
|
|
|
goto call_func;
|
|
|
|
|
|
|
|
nr_pages = (PAGE_ALIGN(start + len) - (start & PAGE_MASK))
|
|
|
|
>> PAGE_SHIFT;
|
|
|
|
|
treewide: kmalloc() -> kmalloc_array()
The kmalloc() function has a 2-factor argument form, kmalloc_array(). This
patch replaces cases of:
kmalloc(a * b, gfp)
with:
kmalloc_array(a * b, gfp)
as well as handling cases of:
kmalloc(a * b * c, gfp)
with:
kmalloc(array3_size(a, b, c), gfp)
as it's slightly less ugly than:
kmalloc_array(array_size(a, b), c, gfp)
This does, however, attempt to ignore constant size factors like:
kmalloc(4 * 1024, gfp)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The tools/ directory was manually excluded, since it has its own
implementation of kmalloc().
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
kmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
kmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
kmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
kmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
kmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_ID)
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_ID
+ COUNT_ID, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (COUNT_CONST)
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * COUNT_CONST
+ COUNT_CONST, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_ID)
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_ID
+ COUNT_ID, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (COUNT_CONST)
+ COUNT_CONST, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * COUNT_CONST
+ COUNT_CONST, sizeof(THING)
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
- kmalloc
+ kmalloc_array
(
- SIZE * COUNT
+ COUNT, SIZE
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
kmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
kmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
kmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
kmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
kmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
kmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products,
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(
- (E1) * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * E3
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- (E1) * (E2) * (E3)
+ array3_size(E1, E2, E3)
, ...)
|
kmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants,
// keeping sizeof() as the second factor argument.
@@
expression THING, E1, E2;
type TYPE;
constant C1, C2, C3;
@@
(
kmalloc(sizeof(THING) * C2, ...)
|
kmalloc(sizeof(TYPE) * C2, ...)
|
kmalloc(C1 * C2 * C3, ...)
|
kmalloc(C1 * C2, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * (E2)
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(TYPE) * E2
+ E2, sizeof(TYPE)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * (E2)
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- sizeof(THING) * E2
+ E2, sizeof(THING)
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * E2
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- (E1) * (E2)
+ E1, E2
, ...)
|
- kmalloc
+ kmalloc_array
(
- E1 * E2
+ E1, E2
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-12 14:55:00 -06:00
|
|
|
pages = kmalloc_array(nr_pages, sizeof(struct page *), GFP_KERNEL);
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!pages) {
|
2009-02-24 08:30:22 -07:00
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
2020-05-16 19:23:36 -06:00
|
|
|
ret = pin_user_pages_fast(start, nr_pages, FOLL_WRITE, pages);
|
2009-02-24 08:30:22 -07:00
|
|
|
if (ret != nr_pages) {
|
|
|
|
if (ret > 0)
|
|
|
|
nr_pages = ret;
|
|
|
|
else
|
|
|
|
nr_pages = 0;
|
|
|
|
ret = -EAGAIN; /* XXX ? */
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
rdsdebug("len %d nr_pages %lu\n", len, nr_pages);
|
|
|
|
|
|
|
|
call_func:
|
|
|
|
func = rds_info_funcs[optname - RDS_INFO_FIRST];
|
2010-01-12 12:56:44 -07:00
|
|
|
if (!func) {
|
2009-02-24 08:30:22 -07:00
|
|
|
ret = -ENOPROTOOPT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
iter.pages = pages;
|
|
|
|
iter.addr = NULL;
|
|
|
|
iter.offset = start & (PAGE_SIZE - 1);
|
|
|
|
|
|
|
|
func(sock, len, &iter, &lens);
|
|
|
|
BUG_ON(lens.each == 0);
|
|
|
|
|
|
|
|
total = lens.nr * lens.each;
|
|
|
|
|
|
|
|
rds_info_iter_unmap(&iter);
|
|
|
|
|
|
|
|
if (total > len) {
|
|
|
|
len = total;
|
|
|
|
ret = -ENOSPC;
|
|
|
|
} else {
|
|
|
|
len = total;
|
|
|
|
ret = lens.each;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (put_user(len, optlen))
|
|
|
|
ret = -EFAULT;
|
|
|
|
|
|
|
|
out:
|
2020-05-16 19:23:36 -06:00
|
|
|
unpin_user_pages(pages, nr_pages);
|
2009-02-24 08:30:22 -07:00
|
|
|
kfree(pages);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|