2019-06-03 13:44:46 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-only
|
2007-11-30 16:16:50 +08:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2007 Jens Axboe <jens.axboe@oracle.com>
|
|
|
|
*
|
|
|
|
* Scatterlist handling helpers.
|
|
|
|
*/
|
2011-11-17 10:29:17 +08:00
|
|
|
#include <linux/export.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 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2007-11-30 16:16:50 +08:00
|
|
|
#include <linux/scatterlist.h>
|
2008-03-17 23:15:03 +08:00
|
|
|
#include <linux/highmem.h>
|
2010-07-29 05:59:02 +08:00
|
|
|
#include <linux/kmemleak.h>
|
2007-11-30 16:16:50 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_next - return the next scatterlist entry in a list
|
|
|
|
* @sg: The current sg entry
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Usually the next entry will be @sg@ + 1, but if this sg element is part
|
|
|
|
* of a chained scatterlist, it could jump to the start of a new
|
|
|
|
* scatterlist array.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
struct scatterlist *sg_next(struct scatterlist *sg)
|
|
|
|
{
|
|
|
|
if (sg_is_last(sg))
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
sg++;
|
|
|
|
if (unlikely(sg_is_chain(sg)))
|
|
|
|
sg = sg_chain_ptr(sg);
|
|
|
|
|
|
|
|
return sg;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_next);
|
|
|
|
|
2012-09-27 18:45:28 +08:00
|
|
|
/**
|
|
|
|
* sg_nents - return total count of entries in scatterlist
|
|
|
|
* @sg: The scatterlist
|
|
|
|
*
|
|
|
|
* Description:
|
2021-07-08 09:07:31 +08:00
|
|
|
* Allows to know how many entries are in sg, taking into account
|
2012-09-27 18:45:28 +08:00
|
|
|
* chaining as well
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
int sg_nents(struct scatterlist *sg)
|
|
|
|
{
|
2012-09-28 16:38:15 +08:00
|
|
|
int nents;
|
|
|
|
for (nents = 0; sg; sg = sg_next(sg))
|
2012-09-27 18:45:28 +08:00
|
|
|
nents++;
|
|
|
|
return nents;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_nents);
|
|
|
|
|
2015-06-02 00:15:25 +08:00
|
|
|
/**
|
|
|
|
* sg_nents_for_len - return total count of entries in scatterlist
|
|
|
|
* needed to satisfy the supplied length
|
|
|
|
* @sg: The scatterlist
|
|
|
|
* @len: The total required length
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Determines the number of entries in sg that are required to meet
|
2021-07-08 09:07:31 +08:00
|
|
|
* the supplied length, taking into account chaining as well
|
2015-06-02 00:15:25 +08:00
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* the number of sg entries needed, negative error on failure
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
int sg_nents_for_len(struct scatterlist *sg, u64 len)
|
|
|
|
{
|
|
|
|
int nents;
|
|
|
|
u64 total;
|
|
|
|
|
|
|
|
if (!len)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for (nents = 0, total = 0; sg; sg = sg_next(sg)) {
|
|
|
|
nents++;
|
|
|
|
total += sg->length;
|
|
|
|
if (total >= len)
|
|
|
|
return nents;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_nents_for_len);
|
2012-09-27 18:45:28 +08:00
|
|
|
|
2007-11-30 16:16:50 +08:00
|
|
|
/**
|
|
|
|
* sg_last - return the last scatterlist entry in a list
|
|
|
|
* @sgl: First entry in the scatterlist
|
|
|
|
* @nents: Number of entries in the scatterlist
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Should only be used casually, it (currently) scans the entire list
|
|
|
|
* to get the last entry.
|
|
|
|
*
|
|
|
|
* Note that the @sgl@ pointer passed in need not be the first one,
|
|
|
|
* the important bit is that @nents@ denotes the number of entries that
|
|
|
|
* exist from @sgl@.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
struct scatterlist *sg_last(struct scatterlist *sgl, unsigned int nents)
|
|
|
|
{
|
|
|
|
struct scatterlist *sg, *ret = NULL;
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
for_each_sg(sgl, sg, nents, i)
|
|
|
|
ret = sg;
|
|
|
|
|
|
|
|
BUG_ON(!sg_is_last(ret));
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_last);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_init_table - Initialize SG table
|
|
|
|
* @sgl: The SG table
|
|
|
|
* @nents: Number of entries in table
|
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* If this is part of a chained sg table, sg_mark_end() should be
|
|
|
|
* used only on the last table part.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
void sg_init_table(struct scatterlist *sgl, unsigned int nents)
|
|
|
|
{
|
|
|
|
memset(sgl, 0, sizeof(*sgl) * nents);
|
2018-03-30 08:20:59 +08:00
|
|
|
sg_init_marker(sgl, nents);
|
2007-11-30 16:16:50 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_init_table);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_init_one - Initialize a single entry sg list
|
|
|
|
* @sg: SG entry
|
|
|
|
* @buf: Virtual address for IO
|
|
|
|
* @buflen: IO length
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
void sg_init_one(struct scatterlist *sg, const void *buf, unsigned int buflen)
|
|
|
|
{
|
|
|
|
sg_init_table(sg, 1);
|
|
|
|
sg_set_buf(sg, buf, buflen);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_init_one);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The default behaviour of sg_alloc_table() is to use these kmalloc/kfree
|
|
|
|
* helpers.
|
|
|
|
*/
|
|
|
|
static struct scatterlist *sg_kmalloc(unsigned int nents, gfp_t gfp_mask)
|
|
|
|
{
|
2010-07-29 05:59:02 +08:00
|
|
|
if (nents == SG_MAX_SINGLE_ALLOC) {
|
|
|
|
/*
|
|
|
|
* Kmemleak doesn't track page allocations as they are not
|
|
|
|
* commonly used (in a raw form) for kernel data structures.
|
|
|
|
* As we chain together a list of pages and then a normal
|
|
|
|
* kmalloc (tracked by kmemleak), in order to for that last
|
|
|
|
* allocation not to become decoupled (and thus a
|
|
|
|
* false-positive) we need to inform kmemleak of all the
|
|
|
|
* intermediate allocations.
|
|
|
|
*/
|
|
|
|
void *ptr = (void *) __get_free_page(gfp_mask);
|
|
|
|
kmemleak_alloc(ptr, PAGE_SIZE, 1, gfp_mask);
|
|
|
|
return ptr;
|
|
|
|
} else
|
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-13 04:55:00 +08:00
|
|
|
return kmalloc_array(nents, sizeof(struct scatterlist),
|
|
|
|
gfp_mask);
|
2007-11-30 16:16:50 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void sg_kfree(struct scatterlist *sg, unsigned int nents)
|
|
|
|
{
|
2010-07-29 05:59:02 +08:00
|
|
|
if (nents == SG_MAX_SINGLE_ALLOC) {
|
|
|
|
kmemleak_free(sg);
|
2007-11-30 16:16:50 +08:00
|
|
|
free_page((unsigned long) sg);
|
2010-07-29 05:59:02 +08:00
|
|
|
} else
|
2007-11-30 16:16:50 +08:00
|
|
|
kfree(sg);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __sg_free_table - Free a previously mapped sg table
|
|
|
|
* @table: The sg table header to use
|
2008-01-14 04:15:28 +08:00
|
|
|
* @max_ents: The maximum number of entries per single scatterlist
|
2019-04-28 15:39:30 +08:00
|
|
|
* @nents_first_chunk: Number of entries int the (preallocated) first
|
|
|
|
* scatterlist chunk, 0 means no such preallocated first chunk
|
2007-11-30 16:16:50 +08:00
|
|
|
* @free_fn: Free function
|
2021-08-24 22:25:30 +08:00
|
|
|
* @num_ents: Number of entries in the table
|
2007-11-30 16:16:50 +08:00
|
|
|
*
|
|
|
|
* Description:
|
2008-01-14 04:15:28 +08:00
|
|
|
* Free an sg table previously allocated and setup with
|
|
|
|
* __sg_alloc_table(). The @max_ents value must be identical to
|
|
|
|
* that previously used with __sg_alloc_table().
|
2007-11-30 16:16:50 +08:00
|
|
|
*
|
|
|
|
**/
|
2008-01-14 04:15:28 +08:00
|
|
|
void __sg_free_table(struct sg_table *table, unsigned int max_ents,
|
2021-08-24 22:25:30 +08:00
|
|
|
unsigned int nents_first_chunk, sg_free_fn *free_fn,
|
|
|
|
unsigned int num_ents)
|
2007-11-30 16:16:50 +08:00
|
|
|
{
|
|
|
|
struct scatterlist *sgl, *next;
|
2019-04-28 15:39:30 +08:00
|
|
|
unsigned curr_max_ents = nents_first_chunk ?: max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
|
|
|
|
if (unlikely(!table->sgl))
|
|
|
|
return;
|
|
|
|
|
|
|
|
sgl = table->sgl;
|
2021-08-24 22:25:30 +08:00
|
|
|
while (num_ents) {
|
|
|
|
unsigned int alloc_size = num_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
unsigned int sg_size;
|
|
|
|
|
|
|
|
/*
|
2008-01-14 04:15:28 +08:00
|
|
|
* If we have more than max_ents segments left,
|
2007-11-30 16:16:50 +08:00
|
|
|
* then assign 'next' to the sg table after the current one.
|
|
|
|
* sg_size is then one less than alloc size, since the last
|
|
|
|
* element is the chain pointer.
|
|
|
|
*/
|
2019-04-28 15:39:30 +08:00
|
|
|
if (alloc_size > curr_max_ents) {
|
|
|
|
next = sg_chain_ptr(&sgl[curr_max_ents - 1]);
|
|
|
|
alloc_size = curr_max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
sg_size = alloc_size - 1;
|
|
|
|
} else {
|
|
|
|
sg_size = alloc_size;
|
|
|
|
next = NULL;
|
|
|
|
}
|
|
|
|
|
2021-08-24 22:25:30 +08:00
|
|
|
num_ents -= sg_size;
|
2019-04-28 15:39:30 +08:00
|
|
|
if (nents_first_chunk)
|
|
|
|
nents_first_chunk = 0;
|
2014-10-24 03:10:21 +08:00
|
|
|
else
|
|
|
|
free_fn(sgl, alloc_size);
|
2007-11-30 16:16:50 +08:00
|
|
|
sgl = next;
|
2019-04-28 15:39:30 +08:00
|
|
|
curr_max_ents = max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
table->sgl = NULL;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__sg_free_table);
|
|
|
|
|
2021-08-24 22:25:30 +08:00
|
|
|
/**
|
|
|
|
* sg_free_append_table - Free a previously allocated append sg table.
|
|
|
|
* @table: The mapped sg append table header
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
void sg_free_append_table(struct sg_append_table *table)
|
|
|
|
{
|
2022-06-29 11:02:41 +08:00
|
|
|
__sg_free_table(&table->sgt, SG_MAX_SINGLE_ALLOC, 0, sg_kfree,
|
2021-08-24 22:25:30 +08:00
|
|
|
table->total_nents);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_free_append_table);
|
|
|
|
|
|
|
|
|
2007-11-30 16:16:50 +08:00
|
|
|
/**
|
|
|
|
* sg_free_table - Free a previously allocated sg table
|
|
|
|
* @table: The mapped sg table header
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
void sg_free_table(struct sg_table *table)
|
|
|
|
{
|
2022-06-29 11:02:41 +08:00
|
|
|
__sg_free_table(table, SG_MAX_SINGLE_ALLOC, 0, sg_kfree,
|
2021-08-24 22:25:30 +08:00
|
|
|
table->orig_nents);
|
2007-11-30 16:16:50 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_free_table);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __sg_alloc_table - Allocate and initialize an sg table with given allocator
|
|
|
|
* @table: The sg table header to use
|
|
|
|
* @nents: Number of entries in sg list
|
2008-01-14 04:15:28 +08:00
|
|
|
* @max_ents: The maximum number of entries the allocator returns per call
|
2019-04-28 15:39:30 +08:00
|
|
|
* @nents_first_chunk: Number of entries int the (preallocated) first
|
|
|
|
* scatterlist chunk, 0 means no such preallocated chunk provided by user
|
2007-11-30 16:16:50 +08:00
|
|
|
* @gfp_mask: GFP allocation mask
|
|
|
|
* @alloc_fn: Allocator to use
|
|
|
|
*
|
2008-01-14 04:15:28 +08:00
|
|
|
* Description:
|
|
|
|
* This function returns a @table @nents long. The allocator is
|
|
|
|
* defined to return scatterlist chunks of maximum size @max_ents.
|
|
|
|
* Thus if @nents is bigger than @max_ents, the scatterlists will be
|
|
|
|
* chained in units of @max_ents.
|
|
|
|
*
|
2007-11-30 16:16:50 +08:00
|
|
|
* Notes:
|
|
|
|
* If this function returns non-0 (eg failure), the caller must call
|
|
|
|
* __sg_free_table() to cleanup any leftover allocations.
|
|
|
|
*
|
|
|
|
**/
|
2008-01-14 04:15:28 +08:00
|
|
|
int __sg_alloc_table(struct sg_table *table, unsigned int nents,
|
2014-04-15 20:38:31 +08:00
|
|
|
unsigned int max_ents, struct scatterlist *first_chunk,
|
2019-04-28 15:39:30 +08:00
|
|
|
unsigned int nents_first_chunk, gfp_t gfp_mask,
|
|
|
|
sg_alloc_fn *alloc_fn)
|
2007-11-30 16:16:50 +08:00
|
|
|
{
|
|
|
|
struct scatterlist *sg, *prv;
|
|
|
|
unsigned int left;
|
2019-04-28 15:39:30 +08:00
|
|
|
unsigned curr_max_ents = nents_first_chunk ?: max_ents;
|
|
|
|
unsigned prv_max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
|
2013-07-09 07:01:58 +08:00
|
|
|
memset(table, 0, sizeof(*table));
|
|
|
|
|
|
|
|
if (nents == 0)
|
|
|
|
return -EINVAL;
|
2018-11-09 16:51:00 +08:00
|
|
|
#ifdef CONFIG_ARCH_NO_SG_CHAIN
|
2012-12-18 08:05:20 +08:00
|
|
|
if (WARN_ON_ONCE(nents > max_ents))
|
|
|
|
return -EINVAL;
|
2007-11-30 16:16:50 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
left = nents;
|
|
|
|
prv = NULL;
|
|
|
|
do {
|
|
|
|
unsigned int sg_size, alloc_size = left;
|
|
|
|
|
2019-04-28 15:39:30 +08:00
|
|
|
if (alloc_size > curr_max_ents) {
|
|
|
|
alloc_size = curr_max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
sg_size = alloc_size - 1;
|
|
|
|
} else
|
|
|
|
sg_size = alloc_size;
|
|
|
|
|
|
|
|
left -= sg_size;
|
|
|
|
|
2014-04-15 20:38:31 +08:00
|
|
|
if (first_chunk) {
|
|
|
|
sg = first_chunk;
|
|
|
|
first_chunk = NULL;
|
|
|
|
} else {
|
|
|
|
sg = alloc_fn(alloc_size, gfp_mask);
|
|
|
|
}
|
2010-08-31 01:55:09 +08:00
|
|
|
if (unlikely(!sg)) {
|
|
|
|
/*
|
|
|
|
* Adjust entry count to reflect that the last
|
|
|
|
* entry of the previous table won't be used for
|
|
|
|
* linkage. Without this, sg_kfree() may get
|
|
|
|
* confused.
|
|
|
|
*/
|
|
|
|
if (prv)
|
|
|
|
table->nents = ++table->orig_nents;
|
|
|
|
|
2020-01-31 14:16:37 +08:00
|
|
|
return -ENOMEM;
|
2010-08-31 01:55:09 +08:00
|
|
|
}
|
2007-11-30 16:16:50 +08:00
|
|
|
|
|
|
|
sg_init_table(sg, alloc_size);
|
|
|
|
table->nents = table->orig_nents += sg_size;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If this is the first mapping, assign the sg table header.
|
|
|
|
* If this is not the first mapping, chain previous part.
|
|
|
|
*/
|
|
|
|
if (prv)
|
2019-04-28 15:39:30 +08:00
|
|
|
sg_chain(prv, prv_max_ents, sg);
|
2007-11-30 16:16:50 +08:00
|
|
|
else
|
|
|
|
table->sgl = sg;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If no more entries after this one, mark the end
|
|
|
|
*/
|
|
|
|
if (!left)
|
|
|
|
sg_mark_end(&sg[sg_size - 1]);
|
|
|
|
|
|
|
|
prv = sg;
|
2019-04-28 15:39:30 +08:00
|
|
|
prv_max_ents = curr_max_ents;
|
|
|
|
curr_max_ents = max_ents;
|
2007-11-30 16:16:50 +08:00
|
|
|
} while (left);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__sg_alloc_table);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_alloc_table - Allocate and initialize an sg table
|
|
|
|
* @table: The sg table header to use
|
|
|
|
* @nents: Number of entries in sg list
|
|
|
|
* @gfp_mask: GFP allocation mask
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Allocate and initialize an sg table. If @nents@ is larger than
|
|
|
|
* SG_MAX_SINGLE_ALLOC a chained sg table will be setup.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
int sg_alloc_table(struct sg_table *table, unsigned int nents, gfp_t gfp_mask)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
2008-01-14 04:15:28 +08:00
|
|
|
ret = __sg_alloc_table(table, nents, SG_MAX_SINGLE_ALLOC,
|
2019-04-28 15:39:30 +08:00
|
|
|
NULL, 0, gfp_mask, sg_kmalloc);
|
2007-11-30 16:16:50 +08:00
|
|
|
if (unlikely(ret))
|
2021-08-24 22:25:30 +08:00
|
|
|
sg_free_table(table);
|
2007-11-30 16:16:50 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_alloc_table);
|
2008-03-17 23:15:03 +08:00
|
|
|
|
2021-08-24 22:25:30 +08:00
|
|
|
static struct scatterlist *get_next_sg(struct sg_append_table *table,
|
2020-10-04 23:43:37 +08:00
|
|
|
struct scatterlist *cur,
|
|
|
|
unsigned long needed_sges,
|
|
|
|
gfp_t gfp_mask)
|
|
|
|
{
|
|
|
|
struct scatterlist *new_sg, *next_sg;
|
|
|
|
unsigned int alloc_size;
|
|
|
|
|
|
|
|
if (cur) {
|
|
|
|
next_sg = sg_next(cur);
|
|
|
|
/* Check if last entry should be keeped for chainning */
|
|
|
|
if (!sg_is_last(next_sg) || needed_sges == 1)
|
|
|
|
return next_sg;
|
|
|
|
}
|
|
|
|
|
|
|
|
alloc_size = min_t(unsigned long, needed_sges, SG_MAX_SINGLE_ALLOC);
|
|
|
|
new_sg = sg_kmalloc(alloc_size, gfp_mask);
|
|
|
|
if (!new_sg)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
sg_init_table(new_sg, alloc_size);
|
|
|
|
if (cur) {
|
2021-08-24 22:25:30 +08:00
|
|
|
table->total_nents += alloc_size - 1;
|
2020-10-04 23:43:37 +08:00
|
|
|
__sg_chain(next_sg, new_sg);
|
|
|
|
} else {
|
2021-08-24 22:25:30 +08:00
|
|
|
table->sgt.sgl = new_sg;
|
|
|
|
table->total_nents = alloc_size;
|
2020-10-04 23:43:37 +08:00
|
|
|
}
|
|
|
|
return new_sg;
|
|
|
|
}
|
|
|
|
|
2022-10-22 01:41:12 +08:00
|
|
|
static bool pages_are_mergeable(struct page *a, struct page *b)
|
|
|
|
{
|
|
|
|
if (page_to_pfn(a) != page_to_pfn(b) + 1)
|
|
|
|
return false;
|
|
|
|
if (!zone_device_pages_have_same_pgmap(a, b))
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-06-18 15:25:01 +08:00
|
|
|
/**
|
2021-08-24 22:25:30 +08:00
|
|
|
* sg_alloc_append_table_from_pages - Allocate and initialize an append sg
|
|
|
|
* table from an array of pages
|
|
|
|
* @sgt_append: The sg append table to use
|
|
|
|
* @pages: Pointer to an array of page pointers
|
|
|
|
* @n_pages: Number of pages in the pages array
|
2017-08-03 17:13:51 +08:00
|
|
|
* @offset: Offset from start of the first page to the start of a buffer
|
|
|
|
* @size: Number of valid bytes in the buffer (after offset)
|
2020-10-16 19:46:01 +08:00
|
|
|
* @max_segment: Maximum size of a scatterlist element in bytes
|
2020-10-04 23:43:37 +08:00
|
|
|
* @left_pages: Left pages caller have to set after this call
|
2017-08-03 17:13:51 +08:00
|
|
|
* @gfp_mask: GFP allocation mask
|
2012-06-18 15:25:01 +08:00
|
|
|
*
|
2020-10-04 23:43:37 +08:00
|
|
|
* Description:
|
2021-08-24 22:25:30 +08:00
|
|
|
* In the first call it allocate and initialize an sg table from a list of
|
|
|
|
* pages, else reuse the scatterlist from sgt_append. Contiguous ranges of
|
|
|
|
* the pages are squashed into a single scatterlist entry up to the maximum
|
|
|
|
* size specified in @max_segment. A user may provide an offset at a start
|
|
|
|
* and a size of valid data in a buffer specified by the page array. The
|
|
|
|
* returned sg table is released by sg_free_append_table
|
2012-06-18 15:25:01 +08:00
|
|
|
*
|
|
|
|
* Returns:
|
2021-08-24 22:25:30 +08:00
|
|
|
* 0 on success, negative error on failure
|
2020-10-04 23:43:37 +08:00
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* If this function returns non-0 (eg failure), the caller must call
|
2021-08-24 22:25:30 +08:00
|
|
|
* sg_free_append_table() to cleanup any leftover allocations.
|
|
|
|
*
|
|
|
|
* In the fist call, sgt_append must by initialized.
|
2012-06-18 15:25:01 +08:00
|
|
|
*/
|
2021-08-24 22:25:30 +08:00
|
|
|
int sg_alloc_append_table_from_pages(struct sg_append_table *sgt_append,
|
2020-10-04 23:43:37 +08:00
|
|
|
struct page **pages, unsigned int n_pages, unsigned int offset,
|
|
|
|
unsigned long size, unsigned int max_segment,
|
2021-08-24 22:25:30 +08:00
|
|
|
unsigned int left_pages, gfp_t gfp_mask)
|
2012-06-18 15:25:01 +08:00
|
|
|
{
|
2020-10-04 23:43:37 +08:00
|
|
|
unsigned int chunks, cur_page, seg_len, i, prv_len = 0;
|
|
|
|
unsigned int added_nents = 0;
|
2021-08-24 22:25:30 +08:00
|
|
|
struct scatterlist *s = sgt_append->prv;
|
2022-10-22 01:41:12 +08:00
|
|
|
struct page *last_pg;
|
2012-06-18 15:25:01 +08:00
|
|
|
|
2020-10-16 19:46:01 +08:00
|
|
|
/*
|
|
|
|
* The algorithm below requires max_segment to be aligned to PAGE_SIZE
|
|
|
|
* otherwise it can overshoot.
|
|
|
|
*/
|
|
|
|
max_segment = ALIGN_DOWN(max_segment, PAGE_SIZE);
|
|
|
|
if (WARN_ON(max_segment < PAGE_SIZE))
|
2021-08-24 22:25:30 +08:00
|
|
|
return -EINVAL;
|
2020-10-04 23:43:37 +08:00
|
|
|
|
2021-08-24 22:25:30 +08:00
|
|
|
if (IS_ENABLED(CONFIG_ARCH_NO_SG_CHAIN) && sgt_append->prv)
|
|
|
|
return -EOPNOTSUPP;
|
2020-10-04 23:43:37 +08:00
|
|
|
|
2021-08-24 22:25:30 +08:00
|
|
|
if (sgt_append->prv) {
|
2020-10-04 23:43:37 +08:00
|
|
|
if (WARN_ON(offset))
|
2021-08-24 22:25:30 +08:00
|
|
|
return -EINVAL;
|
2020-10-04 23:43:37 +08:00
|
|
|
|
|
|
|
/* Merge contiguous pages into the last SG */
|
2021-08-24 22:25:30 +08:00
|
|
|
prv_len = sgt_append->prv->length;
|
2022-10-22 01:41:12 +08:00
|
|
|
last_pg = sg_page(sgt_append->prv);
|
|
|
|
while (n_pages && pages_are_mergeable(last_pg, pages[0])) {
|
2021-08-24 22:25:30 +08:00
|
|
|
if (sgt_append->prv->length + PAGE_SIZE > max_segment)
|
2020-10-04 23:43:37 +08:00
|
|
|
break;
|
2021-08-24 22:25:30 +08:00
|
|
|
sgt_append->prv->length += PAGE_SIZE;
|
2022-10-22 01:41:12 +08:00
|
|
|
last_pg = pages[0];
|
2020-10-04 23:43:37 +08:00
|
|
|
pages++;
|
|
|
|
n_pages--;
|
|
|
|
}
|
|
|
|
if (!n_pages)
|
|
|
|
goto out;
|
|
|
|
}
|
2017-08-03 17:13:51 +08:00
|
|
|
|
2012-06-18 15:25:01 +08:00
|
|
|
/* compute number of contiguous chunks */
|
|
|
|
chunks = 1;
|
2017-08-03 17:13:12 +08:00
|
|
|
seg_len = 0;
|
|
|
|
for (i = 1; i < n_pages; i++) {
|
|
|
|
seg_len += PAGE_SIZE;
|
|
|
|
if (seg_len >= max_segment ||
|
2022-10-22 01:41:12 +08:00
|
|
|
!pages_are_mergeable(pages[i], pages[i - 1])) {
|
2017-08-03 17:13:12 +08:00
|
|
|
chunks++;
|
|
|
|
seg_len = 0;
|
|
|
|
}
|
|
|
|
}
|
2012-06-18 15:25:01 +08:00
|
|
|
|
|
|
|
/* merging chunks and putting them into the scatterlist */
|
|
|
|
cur_page = 0;
|
2020-10-04 23:43:37 +08:00
|
|
|
for (i = 0; i < chunks; i++) {
|
2017-08-03 17:13:12 +08:00
|
|
|
unsigned int j, chunk_size;
|
2012-06-18 15:25:01 +08:00
|
|
|
|
|
|
|
/* look for the end of the current chunk */
|
2017-08-03 17:13:12 +08:00
|
|
|
seg_len = 0;
|
|
|
|
for (j = cur_page + 1; j < n_pages; j++) {
|
|
|
|
seg_len += PAGE_SIZE;
|
|
|
|
if (seg_len >= max_segment ||
|
2022-10-22 01:41:12 +08:00
|
|
|
!pages_are_mergeable(pages[j], pages[j - 1]))
|
2012-06-18 15:25:01 +08:00
|
|
|
break;
|
2017-08-03 17:13:12 +08:00
|
|
|
}
|
2012-06-18 15:25:01 +08:00
|
|
|
|
2020-10-04 23:43:37 +08:00
|
|
|
/* Pass how many chunks might be left */
|
2021-08-24 22:25:30 +08:00
|
|
|
s = get_next_sg(sgt_append, s, chunks - i + left_pages,
|
|
|
|
gfp_mask);
|
2020-10-04 23:43:37 +08:00
|
|
|
if (IS_ERR(s)) {
|
|
|
|
/*
|
|
|
|
* Adjust entry length to be as before function was
|
|
|
|
* called.
|
|
|
|
*/
|
2021-08-24 22:25:30 +08:00
|
|
|
if (sgt_append->prv)
|
|
|
|
sgt_append->prv->length = prv_len;
|
|
|
|
return PTR_ERR(s);
|
2020-10-04 23:43:37 +08:00
|
|
|
}
|
2012-06-18 15:25:01 +08:00
|
|
|
chunk_size = ((j - cur_page) << PAGE_SHIFT) - offset;
|
2017-08-03 17:13:12 +08:00
|
|
|
sg_set_page(s, pages[cur_page],
|
|
|
|
min_t(unsigned long, size, chunk_size), offset);
|
2020-10-04 23:43:37 +08:00
|
|
|
added_nents++;
|
2012-06-18 15:25:01 +08:00
|
|
|
size -= chunk_size;
|
|
|
|
offset = 0;
|
|
|
|
cur_page = j;
|
|
|
|
}
|
2021-08-24 22:25:30 +08:00
|
|
|
sgt_append->sgt.nents += added_nents;
|
|
|
|
sgt_append->sgt.orig_nents = sgt_append->sgt.nents;
|
|
|
|
sgt_append->prv = s;
|
2020-10-04 23:43:37 +08:00
|
|
|
out:
|
|
|
|
if (!left_pages)
|
|
|
|
sg_mark_end(s);
|
2021-08-24 22:25:30 +08:00
|
|
|
return 0;
|
2012-06-18 15:25:01 +08:00
|
|
|
}
|
2021-08-24 22:25:29 +08:00
|
|
|
EXPORT_SYMBOL(sg_alloc_append_table_from_pages);
|
2017-08-03 17:13:51 +08:00
|
|
|
|
|
|
|
/**
|
2021-08-24 22:25:29 +08:00
|
|
|
* sg_alloc_table_from_pages_segment - Allocate and initialize an sg table from
|
|
|
|
* an array of pages and given maximum
|
|
|
|
* segment.
|
2017-08-03 17:13:51 +08:00
|
|
|
* @sgt: The sg table header to use
|
|
|
|
* @pages: Pointer to an array of page pointers
|
|
|
|
* @n_pages: Number of pages in the pages array
|
|
|
|
* @offset: Offset from start of the first page to the start of a buffer
|
|
|
|
* @size: Number of valid bytes in the buffer (after offset)
|
2021-08-24 22:25:29 +08:00
|
|
|
* @max_segment: Maximum size of a scatterlist element in bytes
|
2017-08-03 17:13:51 +08:00
|
|
|
* @gfp_mask: GFP allocation mask
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Allocate and initialize an sg table from a list of pages. Contiguous
|
2021-08-24 22:25:29 +08:00
|
|
|
* ranges of the pages are squashed into a single scatterlist node up to the
|
|
|
|
* maximum size specified in @max_segment. A user may provide an offset at a
|
|
|
|
* start and a size of valid data in a buffer specified by the page array.
|
2017-08-03 17:13:51 +08:00
|
|
|
*
|
2021-08-24 22:25:29 +08:00
|
|
|
* The returned sg table is released by sg_free_table.
|
|
|
|
*
|
|
|
|
* Returns:
|
2017-08-03 17:13:51 +08:00
|
|
|
* 0 on success, negative error on failure
|
|
|
|
*/
|
2021-08-24 22:25:29 +08:00
|
|
|
int sg_alloc_table_from_pages_segment(struct sg_table *sgt, struct page **pages,
|
|
|
|
unsigned int n_pages, unsigned int offset,
|
|
|
|
unsigned long size, unsigned int max_segment,
|
|
|
|
gfp_t gfp_mask)
|
2017-08-03 17:13:51 +08:00
|
|
|
{
|
2021-08-24 22:25:30 +08:00
|
|
|
struct sg_append_table append = {};
|
|
|
|
int err;
|
|
|
|
|
|
|
|
err = sg_alloc_append_table_from_pages(&append, pages, n_pages, offset,
|
|
|
|
size, max_segment, 0, gfp_mask);
|
|
|
|
if (err) {
|
|
|
|
sg_free_append_table(&append);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
memcpy(sgt, &append.sgt, sizeof(*sgt));
|
|
|
|
WARN_ON(append.total_nents != sgt->orig_nents);
|
|
|
|
return 0;
|
2017-08-03 17:13:51 +08:00
|
|
|
}
|
2021-08-24 22:25:29 +08:00
|
|
|
EXPORT_SYMBOL(sg_alloc_table_from_pages_segment);
|
2012-06-18 15:25:01 +08:00
|
|
|
|
2018-01-06 00:26:46 +08:00
|
|
|
#ifdef CONFIG_SGL_ALLOC
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sgl_alloc_order - allocate a scatterlist and its pages
|
|
|
|
* @length: Length in bytes of the scatterlist. Must be at least one
|
|
|
|
* @order: Second argument for alloc_pages()
|
|
|
|
* @chainable: Whether or not to allocate an extra element in the scatterlist
|
|
|
|
* for scatterlist chaining purposes
|
|
|
|
* @gfp: Memory allocation flags
|
|
|
|
* @nent_p: [out] Number of entries in the scatterlist that have pages
|
|
|
|
*
|
|
|
|
* Returns: A pointer to an initialized scatterlist or %NULL upon failure.
|
|
|
|
*/
|
|
|
|
struct scatterlist *sgl_alloc_order(unsigned long long length,
|
|
|
|
unsigned int order, bool chainable,
|
|
|
|
gfp_t gfp, unsigned int *nent_p)
|
|
|
|
{
|
|
|
|
struct scatterlist *sgl, *sg;
|
|
|
|
struct page *page;
|
|
|
|
unsigned int nent, nalloc;
|
|
|
|
u32 elem_len;
|
|
|
|
|
|
|
|
nent = round_up(length, PAGE_SIZE << order) >> (PAGE_SHIFT + order);
|
|
|
|
/* Check for integer overflow */
|
|
|
|
if (length > (nent << (PAGE_SHIFT + order)))
|
|
|
|
return NULL;
|
|
|
|
nalloc = nent;
|
|
|
|
if (chainable) {
|
|
|
|
/* Check for integer overflow */
|
|
|
|
if (nalloc + 1 < nalloc)
|
|
|
|
return NULL;
|
|
|
|
nalloc++;
|
|
|
|
}
|
|
|
|
sgl = kmalloc_array(nalloc, sizeof(struct scatterlist),
|
2020-10-16 11:11:25 +08:00
|
|
|
gfp & ~GFP_DMA);
|
2018-01-06 00:26:46 +08:00
|
|
|
if (!sgl)
|
|
|
|
return NULL;
|
|
|
|
|
2018-01-20 03:00:54 +08:00
|
|
|
sg_init_table(sgl, nalloc);
|
2018-01-06 00:26:46 +08:00
|
|
|
sg = sgl;
|
|
|
|
while (length) {
|
|
|
|
elem_len = min_t(u64, length, PAGE_SIZE << order);
|
|
|
|
page = alloc_pages(gfp, order);
|
|
|
|
if (!page) {
|
2020-10-16 02:57:35 +08:00
|
|
|
sgl_free_order(sgl, order);
|
2018-01-06 00:26:46 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
sg_set_page(sg, page, elem_len, 0);
|
|
|
|
length -= elem_len;
|
|
|
|
sg = sg_next(sg);
|
|
|
|
}
|
2018-01-20 03:00:54 +08:00
|
|
|
WARN_ONCE(length, "length = %lld\n", length);
|
2018-01-06 00:26:46 +08:00
|
|
|
if (nent_p)
|
|
|
|
*nent_p = nent;
|
|
|
|
return sgl;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sgl_alloc_order);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sgl_alloc - allocate a scatterlist and its pages
|
|
|
|
* @length: Length in bytes of the scatterlist
|
|
|
|
* @gfp: Memory allocation flags
|
|
|
|
* @nent_p: [out] Number of entries in the scatterlist
|
|
|
|
*
|
|
|
|
* Returns: A pointer to an initialized scatterlist or %NULL upon failure.
|
|
|
|
*/
|
|
|
|
struct scatterlist *sgl_alloc(unsigned long long length, gfp_t gfp,
|
|
|
|
unsigned int *nent_p)
|
|
|
|
{
|
|
|
|
return sgl_alloc_order(length, 0, false, gfp, nent_p);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sgl_alloc);
|
|
|
|
|
|
|
|
/**
|
2018-01-20 03:00:54 +08:00
|
|
|
* sgl_free_n_order - free a scatterlist and its pages
|
2018-01-06 00:26:46 +08:00
|
|
|
* @sgl: Scatterlist with one or more elements
|
2018-01-20 03:00:54 +08:00
|
|
|
* @nents: Maximum number of elements to free
|
2018-01-06 00:26:46 +08:00
|
|
|
* @order: Second argument for __free_pages()
|
2018-01-20 03:00:54 +08:00
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* - If several scatterlists have been chained and each chain element is
|
|
|
|
* freed separately then it's essential to set nents correctly to avoid that a
|
|
|
|
* page would get freed twice.
|
|
|
|
* - All pages in a chained scatterlist can be freed at once by setting @nents
|
|
|
|
* to a high number.
|
2018-01-06 00:26:46 +08:00
|
|
|
*/
|
2018-01-20 03:00:54 +08:00
|
|
|
void sgl_free_n_order(struct scatterlist *sgl, int nents, int order)
|
2018-01-06 00:26:46 +08:00
|
|
|
{
|
|
|
|
struct scatterlist *sg;
|
|
|
|
struct page *page;
|
2018-01-20 03:00:54 +08:00
|
|
|
int i;
|
2018-01-06 00:26:46 +08:00
|
|
|
|
2018-01-20 03:00:54 +08:00
|
|
|
for_each_sg(sgl, sg, nents, i) {
|
|
|
|
if (!sg)
|
|
|
|
break;
|
2018-01-06 00:26:46 +08:00
|
|
|
page = sg_page(sg);
|
|
|
|
if (page)
|
|
|
|
__free_pages(page, order);
|
|
|
|
}
|
|
|
|
kfree(sgl);
|
|
|
|
}
|
2018-01-20 03:00:54 +08:00
|
|
|
EXPORT_SYMBOL(sgl_free_n_order);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sgl_free_order - free a scatterlist and its pages
|
|
|
|
* @sgl: Scatterlist with one or more elements
|
|
|
|
* @order: Second argument for __free_pages()
|
|
|
|
*/
|
|
|
|
void sgl_free_order(struct scatterlist *sgl, int order)
|
|
|
|
{
|
|
|
|
sgl_free_n_order(sgl, INT_MAX, order);
|
|
|
|
}
|
2018-01-06 00:26:46 +08:00
|
|
|
EXPORT_SYMBOL(sgl_free_order);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sgl_free - free a scatterlist and its pages
|
|
|
|
* @sgl: Scatterlist with one or more elements
|
|
|
|
*/
|
|
|
|
void sgl_free(struct scatterlist *sgl)
|
|
|
|
{
|
|
|
|
sgl_free_order(sgl, 0);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sgl_free);
|
|
|
|
|
|
|
|
#endif /* CONFIG_SGL_ALLOC */
|
|
|
|
|
2013-02-28 09:02:56 +08:00
|
|
|
void __sg_page_iter_start(struct sg_page_iter *piter,
|
|
|
|
struct scatterlist *sglist, unsigned int nents,
|
|
|
|
unsigned long pgoffset)
|
|
|
|
{
|
|
|
|
piter->__pg_advance = 0;
|
|
|
|
piter->__nents = nents;
|
|
|
|
|
|
|
|
piter->sg = sglist;
|
|
|
|
piter->sg_pgoffset = pgoffset;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__sg_page_iter_start);
|
|
|
|
|
|
|
|
static int sg_page_count(struct scatterlist *sg)
|
|
|
|
{
|
|
|
|
return PAGE_ALIGN(sg->offset + sg->length) >> PAGE_SHIFT;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool __sg_page_iter_next(struct sg_page_iter *piter)
|
|
|
|
{
|
|
|
|
if (!piter->__nents || !piter->sg)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
piter->sg_pgoffset += piter->__pg_advance;
|
|
|
|
piter->__pg_advance = 1;
|
|
|
|
|
|
|
|
while (piter->sg_pgoffset >= sg_page_count(piter->sg)) {
|
|
|
|
piter->sg_pgoffset -= sg_page_count(piter->sg);
|
|
|
|
piter->sg = sg_next(piter->sg);
|
|
|
|
if (!--piter->__nents || !piter->sg)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__sg_page_iter_next);
|
|
|
|
|
2019-01-05 02:40:21 +08:00
|
|
|
static int sg_dma_page_count(struct scatterlist *sg)
|
|
|
|
{
|
|
|
|
return PAGE_ALIGN(sg->offset + sg_dma_len(sg)) >> PAGE_SHIFT;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool __sg_page_iter_dma_next(struct sg_dma_page_iter *dma_iter)
|
|
|
|
{
|
|
|
|
struct sg_page_iter *piter = &dma_iter->base;
|
|
|
|
|
|
|
|
if (!piter->__nents || !piter->sg)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
piter->sg_pgoffset += piter->__pg_advance;
|
|
|
|
piter->__pg_advance = 1;
|
|
|
|
|
|
|
|
while (piter->sg_pgoffset >= sg_dma_page_count(piter->sg)) {
|
|
|
|
piter->sg_pgoffset -= sg_dma_page_count(piter->sg);
|
|
|
|
piter->sg = sg_next(piter->sg);
|
|
|
|
if (!--piter->__nents || !piter->sg)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__sg_page_iter_dma_next);
|
|
|
|
|
2008-07-19 22:03:35 +08:00
|
|
|
/**
|
|
|
|
* sg_miter_start - start mapping iteration over a sg list
|
|
|
|
* @miter: sg mapping iter to be started
|
|
|
|
* @sgl: sg list to iterate over
|
|
|
|
* @nents: number of sg entries
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Starts mapping iterator @miter.
|
|
|
|
*
|
|
|
|
* Context:
|
|
|
|
* Don't care.
|
|
|
|
*/
|
|
|
|
void sg_miter_start(struct sg_mapping_iter *miter, struct scatterlist *sgl,
|
|
|
|
unsigned int nents, unsigned int flags)
|
|
|
|
{
|
|
|
|
memset(miter, 0, sizeof(struct sg_mapping_iter));
|
|
|
|
|
2013-02-28 09:02:57 +08:00
|
|
|
__sg_page_iter_start(&miter->piter, sgl, nents, 0);
|
2009-06-18 16:19:12 +08:00
|
|
|
WARN_ON(!(flags & (SG_MITER_TO_SG | SG_MITER_FROM_SG)));
|
2008-07-19 22:03:35 +08:00
|
|
|
miter->__flags = flags;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_miter_start);
|
|
|
|
|
2013-07-09 07:01:52 +08:00
|
|
|
static bool sg_miter_get_next_page(struct sg_mapping_iter *miter)
|
|
|
|
{
|
|
|
|
if (!miter->__remaining) {
|
|
|
|
struct scatterlist *sg;
|
|
|
|
|
|
|
|
if (!__sg_page_iter_next(&miter->piter))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
sg = miter->piter.sg;
|
|
|
|
|
2019-06-24 15:20:14 +08:00
|
|
|
miter->__offset = miter->piter.sg_pgoffset ? 0 : sg->offset;
|
|
|
|
miter->piter.sg_pgoffset += miter->__offset >> PAGE_SHIFT;
|
|
|
|
miter->__offset &= PAGE_SIZE - 1;
|
2013-07-09 07:01:52 +08:00
|
|
|
miter->__remaining = sg->offset + sg->length -
|
2019-06-24 15:20:14 +08:00
|
|
|
(miter->piter.sg_pgoffset << PAGE_SHIFT) -
|
|
|
|
miter->__offset;
|
2013-07-09 07:01:52 +08:00
|
|
|
miter->__remaining = min_t(unsigned long, miter->__remaining,
|
|
|
|
PAGE_SIZE - miter->__offset);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-07-09 07:01:54 +08:00
|
|
|
/**
|
|
|
|
* sg_miter_skip - reposition mapping iterator
|
|
|
|
* @miter: sg mapping iter to be skipped
|
|
|
|
* @offset: number of bytes to plus the current location
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Sets the offset of @miter to its current location plus @offset bytes.
|
|
|
|
* If mapping iterator @miter has been proceeded by sg_miter_next(), this
|
|
|
|
* stops @miter.
|
|
|
|
*
|
|
|
|
* Context:
|
2021-11-09 10:33:25 +08:00
|
|
|
* Don't care.
|
2013-07-09 07:01:54 +08:00
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* true if @miter contains the valid mapping. false if end of sg
|
|
|
|
* list is reached.
|
|
|
|
*/
|
2013-11-26 12:43:37 +08:00
|
|
|
bool sg_miter_skip(struct sg_mapping_iter *miter, off_t offset)
|
2013-07-09 07:01:54 +08:00
|
|
|
{
|
|
|
|
sg_miter_stop(miter);
|
|
|
|
|
|
|
|
while (offset) {
|
|
|
|
off_t consumed;
|
|
|
|
|
|
|
|
if (!sg_miter_get_next_page(miter))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
consumed = min_t(off_t, offset, miter->__remaining);
|
|
|
|
miter->__offset += consumed;
|
|
|
|
miter->__remaining -= consumed;
|
|
|
|
offset -= consumed;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
2013-11-26 12:43:37 +08:00
|
|
|
EXPORT_SYMBOL(sg_miter_skip);
|
2013-07-09 07:01:54 +08:00
|
|
|
|
2008-07-19 22:03:35 +08:00
|
|
|
/**
|
|
|
|
* sg_miter_next - proceed mapping iterator to the next mapping
|
|
|
|
* @miter: sg mapping iter to proceed
|
|
|
|
*
|
|
|
|
* Description:
|
2012-10-05 08:13:28 +08:00
|
|
|
* Proceeds @miter to the next mapping. @miter should have been started
|
|
|
|
* using sg_miter_start(). On successful return, @miter->page,
|
|
|
|
* @miter->addr and @miter->length point to the current mapping.
|
2008-07-19 22:03:35 +08:00
|
|
|
*
|
|
|
|
* Context:
|
2021-11-09 10:33:25 +08:00
|
|
|
* May sleep if !SG_MITER_ATOMIC.
|
2008-07-19 22:03:35 +08:00
|
|
|
*
|
|
|
|
* Returns:
|
|
|
|
* true if @miter contains the next mapping. false if end of sg
|
|
|
|
* list is reached.
|
|
|
|
*/
|
|
|
|
bool sg_miter_next(struct sg_mapping_iter *miter)
|
|
|
|
{
|
|
|
|
sg_miter_stop(miter);
|
|
|
|
|
2013-02-28 09:02:57 +08:00
|
|
|
/*
|
|
|
|
* Get to the next page if necessary.
|
|
|
|
* __remaining, __offset is adjusted by sg_miter_stop
|
|
|
|
*/
|
2013-07-09 07:01:52 +08:00
|
|
|
if (!sg_miter_get_next_page(miter))
|
|
|
|
return false;
|
2008-07-19 22:03:35 +08:00
|
|
|
|
2013-03-26 21:14:18 +08:00
|
|
|
miter->page = sg_page_iter_page(&miter->piter);
|
2013-02-28 09:02:57 +08:00
|
|
|
miter->consumed = miter->length = miter->__remaining;
|
2008-07-19 22:03:35 +08:00
|
|
|
|
|
|
|
if (miter->__flags & SG_MITER_ATOMIC)
|
2013-02-28 09:02:57 +08:00
|
|
|
miter->addr = kmap_atomic(miter->page) + miter->__offset;
|
2008-07-19 22:03:35 +08:00
|
|
|
else
|
2013-02-28 09:02:57 +08:00
|
|
|
miter->addr = kmap(miter->page) + miter->__offset;
|
2008-07-19 22:03:35 +08:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_miter_next);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_miter_stop - stop mapping iteration
|
|
|
|
* @miter: sg mapping iter to be stopped
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* Stops mapping iterator @miter. @miter should have been started
|
2016-02-08 15:09:08 +08:00
|
|
|
* using sg_miter_start(). A stopped iteration can be resumed by
|
|
|
|
* calling sg_miter_next() on it. This is useful when resources (kmap)
|
|
|
|
* need to be released during iteration.
|
2008-07-19 22:03:35 +08:00
|
|
|
*
|
|
|
|
* Context:
|
2021-11-09 10:33:25 +08:00
|
|
|
* Don't care otherwise.
|
2008-07-19 22:03:35 +08:00
|
|
|
*/
|
|
|
|
void sg_miter_stop(struct sg_mapping_iter *miter)
|
|
|
|
{
|
|
|
|
WARN_ON(miter->consumed > miter->length);
|
|
|
|
|
|
|
|
/* drop resources from the last iteration */
|
|
|
|
if (miter->addr) {
|
|
|
|
miter->__offset += miter->consumed;
|
2013-02-28 09:02:57 +08:00
|
|
|
miter->__remaining -= miter->consumed;
|
2008-07-19 22:03:35 +08:00
|
|
|
|
2021-09-03 05:56:33 +08:00
|
|
|
if (miter->__flags & SG_MITER_TO_SG)
|
|
|
|
flush_dcache_page(miter->page);
|
2009-06-18 16:19:12 +08:00
|
|
|
|
2008-07-19 22:03:35 +08:00
|
|
|
if (miter->__flags & SG_MITER_ATOMIC) {
|
2021-11-09 10:33:25 +08:00
|
|
|
WARN_ON_ONCE(!pagefault_disabled());
|
2011-11-25 23:14:39 +08:00
|
|
|
kunmap_atomic(miter->addr);
|
2008-07-19 22:03:35 +08:00
|
|
|
} else
|
2008-11-20 07:36:19 +08:00
|
|
|
kunmap(miter->page);
|
2008-07-19 22:03:35 +08:00
|
|
|
|
|
|
|
miter->page = NULL;
|
|
|
|
miter->addr = NULL;
|
|
|
|
miter->length = 0;
|
|
|
|
miter->consumed = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_miter_stop);
|
|
|
|
|
2008-03-17 23:15:03 +08:00
|
|
|
/**
|
|
|
|
* sg_copy_buffer - Copy data between a linear buffer and an SG list
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buf: Where to copy from
|
|
|
|
* @buflen: The number of bytes to copy
|
2013-07-09 07:01:54 +08:00
|
|
|
* @skip: Number of bytes to skip before copying
|
|
|
|
* @to_buffer: transfer direction (true == from an sg list to a
|
2020-04-07 11:10:09 +08:00
|
|
|
* buffer, false == from a buffer to an sg list)
|
2008-03-17 23:15:03 +08:00
|
|
|
*
|
|
|
|
* Returns the number of copied bytes.
|
|
|
|
*
|
|
|
|
**/
|
2015-07-01 05:58:57 +08:00
|
|
|
size_t sg_copy_buffer(struct scatterlist *sgl, unsigned int nents, void *buf,
|
|
|
|
size_t buflen, off_t skip, bool to_buffer)
|
2008-03-17 23:15:03 +08:00
|
|
|
{
|
2008-07-19 22:03:35 +08:00
|
|
|
unsigned int offset = 0;
|
|
|
|
struct sg_mapping_iter miter;
|
2009-06-18 16:19:12 +08:00
|
|
|
unsigned int sg_flags = SG_MITER_ATOMIC;
|
|
|
|
|
|
|
|
if (to_buffer)
|
|
|
|
sg_flags |= SG_MITER_FROM_SG;
|
|
|
|
else
|
|
|
|
sg_flags |= SG_MITER_TO_SG;
|
2008-07-19 22:03:35 +08:00
|
|
|
|
2009-06-18 16:19:12 +08:00
|
|
|
sg_miter_start(&miter, sgl, nents, sg_flags);
|
2008-07-19 22:03:35 +08:00
|
|
|
|
2013-07-09 07:01:54 +08:00
|
|
|
if (!sg_miter_skip(&miter, skip))
|
2020-10-27 05:03:10 +08:00
|
|
|
return 0;
|
2013-07-09 07:01:54 +08:00
|
|
|
|
2017-02-28 06:28:27 +08:00
|
|
|
while ((offset < buflen) && sg_miter_next(&miter)) {
|
2008-07-19 22:03:35 +08:00
|
|
|
unsigned int len;
|
|
|
|
|
|
|
|
len = min(miter.length, buflen - offset);
|
|
|
|
|
|
|
|
if (to_buffer)
|
|
|
|
memcpy(buf + offset, miter.addr, len);
|
2009-06-18 16:19:12 +08:00
|
|
|
else
|
2008-07-19 22:03:35 +08:00
|
|
|
memcpy(miter.addr, buf + offset, len);
|
2008-03-17 23:15:03 +08:00
|
|
|
|
2008-07-19 22:03:35 +08:00
|
|
|
offset += len;
|
2008-03-17 23:15:03 +08:00
|
|
|
}
|
|
|
|
|
2008-07-19 22:03:35 +08:00
|
|
|
sg_miter_stop(&miter);
|
|
|
|
|
|
|
|
return offset;
|
2008-03-17 23:15:03 +08:00
|
|
|
}
|
2015-07-01 05:58:57 +08:00
|
|
|
EXPORT_SYMBOL(sg_copy_buffer);
|
2008-03-17 23:15:03 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_copy_from_buffer - Copy from a linear buffer to an SG list
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buf: Where to copy from
|
|
|
|
* @buflen: The number of bytes to copy
|
|
|
|
*
|
|
|
|
* Returns the number of copied bytes.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
size_t sg_copy_from_buffer(struct scatterlist *sgl, unsigned int nents,
|
2015-07-01 05:58:54 +08:00
|
|
|
const void *buf, size_t buflen)
|
2008-03-17 23:15:03 +08:00
|
|
|
{
|
2015-07-01 05:58:54 +08:00
|
|
|
return sg_copy_buffer(sgl, nents, (void *)buf, buflen, 0, false);
|
2008-03-17 23:15:03 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_copy_from_buffer);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_copy_to_buffer - Copy from an SG list to a linear buffer
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buf: Where to copy to
|
|
|
|
* @buflen: The number of bytes to copy
|
|
|
|
*
|
|
|
|
* Returns the number of copied bytes.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
size_t sg_copy_to_buffer(struct scatterlist *sgl, unsigned int nents,
|
|
|
|
void *buf, size_t buflen)
|
|
|
|
{
|
2013-07-09 07:01:54 +08:00
|
|
|
return sg_copy_buffer(sgl, nents, buf, buflen, 0, true);
|
2008-03-17 23:15:03 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_copy_to_buffer);
|
2013-07-09 07:01:54 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_pcopy_from_buffer - Copy from a linear buffer to an SG list
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buf: Where to copy from
|
|
|
|
* @buflen: The number of bytes to copy
|
2015-07-01 05:58:52 +08:00
|
|
|
* @skip: Number of bytes to skip before copying
|
2013-07-09 07:01:54 +08:00
|
|
|
*
|
|
|
|
* Returns the number of copied bytes.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
size_t sg_pcopy_from_buffer(struct scatterlist *sgl, unsigned int nents,
|
2015-07-01 05:58:54 +08:00
|
|
|
const void *buf, size_t buflen, off_t skip)
|
2013-07-09 07:01:54 +08:00
|
|
|
{
|
2015-07-01 05:58:54 +08:00
|
|
|
return sg_copy_buffer(sgl, nents, (void *)buf, buflen, skip, false);
|
2013-07-09 07:01:54 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_pcopy_from_buffer);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_pcopy_to_buffer - Copy from an SG list to a linear buffer
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buf: Where to copy to
|
|
|
|
* @buflen: The number of bytes to copy
|
2015-07-01 05:58:52 +08:00
|
|
|
* @skip: Number of bytes to skip before copying
|
2013-07-09 07:01:54 +08:00
|
|
|
*
|
|
|
|
* Returns the number of copied bytes.
|
|
|
|
*
|
|
|
|
**/
|
|
|
|
size_t sg_pcopy_to_buffer(struct scatterlist *sgl, unsigned int nents,
|
|
|
|
void *buf, size_t buflen, off_t skip)
|
|
|
|
{
|
|
|
|
return sg_copy_buffer(sgl, nents, buf, buflen, skip, true);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_pcopy_to_buffer);
|
2017-06-07 17:45:28 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* sg_zero_buffer - Zero-out a part of a SG list
|
|
|
|
* @sgl: The SG list
|
|
|
|
* @nents: Number of SG entries
|
|
|
|
* @buflen: The number of bytes to zero out
|
|
|
|
* @skip: Number of bytes to skip before zeroing
|
|
|
|
*
|
|
|
|
* Returns the number of bytes zeroed.
|
|
|
|
**/
|
|
|
|
size_t sg_zero_buffer(struct scatterlist *sgl, unsigned int nents,
|
|
|
|
size_t buflen, off_t skip)
|
|
|
|
{
|
|
|
|
unsigned int offset = 0;
|
|
|
|
struct sg_mapping_iter miter;
|
|
|
|
unsigned int sg_flags = SG_MITER_ATOMIC | SG_MITER_TO_SG;
|
|
|
|
|
|
|
|
sg_miter_start(&miter, sgl, nents, sg_flags);
|
|
|
|
|
|
|
|
if (!sg_miter_skip(&miter, skip))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
while (offset < buflen && sg_miter_next(&miter)) {
|
|
|
|
unsigned int len;
|
|
|
|
|
|
|
|
len = min(miter.length, buflen - offset);
|
|
|
|
memset(miter.addr, 0, len);
|
|
|
|
|
|
|
|
offset += len;
|
|
|
|
}
|
|
|
|
|
|
|
|
sg_miter_stop(&miter);
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(sg_zero_buffer);
|