2005-07-08 02:57:14 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2005 Topspin Communications. All rights reserved.
|
|
|
|
* Copyright (c) 2005 Cisco Systems. All rights reserved.
|
2005-08-11 08:03:10 +02:00
|
|
|
* Copyright (c) 2005 Mellanox Technologies. All rights reserved.
|
2005-07-08 02:57:14 +02:00
|
|
|
*
|
|
|
|
* 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/mm.h>
|
|
|
|
#include <linux/dma-mapping.h>
|
Detach sched.h from mm.h
First thing mm.h does is including sched.h solely for can_do_mlock() inline
function which has "current" dereference inside. By dealing with can_do_mlock()
mm.h can be detached from sched.h which is good. See below, why.
This patch
a) removes unconditional inclusion of sched.h from mm.h
b) makes can_do_mlock() normal function in mm/mlock.c
c) exports can_do_mlock() to not break compilation
d) adds sched.h inclusions back to files that were getting it indirectly.
e) adds less bloated headers to some files (asm/signal.h, jiffies.h) that were
getting them indirectly
Net result is:
a) mm.h users would get less code to open, read, preprocess, parse, ... if
they don't need sched.h
b) sched.h stops being dependency for significant number of files:
on x86_64 allmodconfig touching sched.h results in recompile of 4083 files,
after patch it's only 3744 (-8.3%).
Cross-compile tested on
all arm defconfigs, all mips defconfigs, all powerpc defconfigs,
alpha alpha-up
arm
i386 i386-up i386-defconfig i386-allnoconfig
ia64 ia64-up
m68k
mips
parisc parisc-up
powerpc powerpc-up
s390 s390-up
sparc sparc-up
sparc64 sparc64-up
um-x86_64
x86_64 x86_64-up x86_64-defconfig x86_64-allnoconfig
as well as my two usual configs.
Signed-off-by: Alexey Dobriyan <adobriyan@gmail.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-05-20 23:22:52 +02:00
|
|
|
#include <linux/sched.h>
|
2011-05-27 21:29:33 +02:00
|
|
|
#include <linux/export.h>
|
2007-09-13 18:15:28 +02:00
|
|
|
#include <linux/hugetlb.h>
|
2008-04-29 10:00:34 +02:00
|
|
|
#include <linux/dma-attrs.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 09:04:11 +01:00
|
|
|
#include <linux/slab.h>
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
#include "uverbs.h"
|
|
|
|
|
2007-08-01 12:33:56 +02:00
|
|
|
#define IB_UMEM_MAX_PAGE_CHUNK \
|
|
|
|
((PAGE_SIZE - offsetof(struct ib_umem_chunk, page_list)) / \
|
|
|
|
((void *) &((struct ib_umem_chunk *) 0)->page_list[1] - \
|
|
|
|
(void *) &((struct ib_umem_chunk *) 0)->page_list[0]))
|
|
|
|
|
2005-07-08 02:57:14 +02:00
|
|
|
static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
|
|
|
|
{
|
|
|
|
struct ib_umem_chunk *chunk, *tmp;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(chunk, tmp, &umem->chunk_list, list) {
|
2006-12-12 23:28:30 +01:00
|
|
|
ib_dma_unmap_sg(dev, chunk->page_list,
|
|
|
|
chunk->nents, DMA_BIDIRECTIONAL);
|
2005-07-08 02:57:14 +02:00
|
|
|
for (i = 0; i < chunk->nents; ++i) {
|
2007-10-22 21:19:53 +02:00
|
|
|
struct page *page = sg_page(&chunk->page_list[i]);
|
|
|
|
|
2005-07-08 02:57:14 +02:00
|
|
|
if (umem->writable && dirty)
|
2007-10-22 21:19:53 +02:00
|
|
|
set_page_dirty_lock(page);
|
|
|
|
put_page(page);
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
kfree(chunk);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
/**
|
|
|
|
* ib_umem_get - Pin and DMA map userspace memory.
|
|
|
|
* @context: userspace context to pin memory for
|
|
|
|
* @addr: userspace virtual address to start at
|
|
|
|
* @size: length of region to pin
|
|
|
|
* @access: IB_ACCESS_xxx flags for memory being pinned
|
2008-04-29 10:00:34 +02:00
|
|
|
* @dmasync: flush in-flight DMA when the memory region is written
|
2007-03-05 01:15:11 +01:00
|
|
|
*/
|
|
|
|
struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
|
2008-04-29 10:00:34 +02:00
|
|
|
size_t size, int access, int dmasync)
|
2005-07-08 02:57:14 +02:00
|
|
|
{
|
2007-03-05 01:15:11 +01:00
|
|
|
struct ib_umem *umem;
|
2005-07-08 02:57:14 +02:00
|
|
|
struct page **page_list;
|
2007-09-13 18:15:28 +02:00
|
|
|
struct vm_area_struct **vma_list;
|
2005-07-08 02:57:14 +02:00
|
|
|
struct ib_umem_chunk *chunk;
|
|
|
|
unsigned long locked;
|
|
|
|
unsigned long lock_limit;
|
|
|
|
unsigned long cur_base;
|
|
|
|
unsigned long npages;
|
2007-03-05 01:15:11 +01:00
|
|
|
int ret;
|
2005-07-08 02:57:14 +02:00
|
|
|
int off;
|
|
|
|
int i;
|
2008-04-29 10:00:34 +02:00
|
|
|
DEFINE_DMA_ATTRS(attrs);
|
|
|
|
|
|
|
|
if (dmasync)
|
|
|
|
dma_set_attr(DMA_ATTR_WRITE_BARRIER, &attrs);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
if (!can_do_mlock())
|
2007-03-05 01:15:11 +01:00
|
|
|
return ERR_PTR(-EPERM);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
umem = kmalloc(sizeof *umem, GFP_KERNEL);
|
|
|
|
if (!umem)
|
|
|
|
return ERR_PTR(-ENOMEM);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
umem->context = context;
|
|
|
|
umem->length = size;
|
|
|
|
umem->offset = addr & ~PAGE_MASK;
|
|
|
|
umem->page_size = PAGE_SIZE;
|
|
|
|
/*
|
|
|
|
* We ask for writable memory if any access flags other than
|
|
|
|
* "remote read" are set. "Local write" and "remote write"
|
|
|
|
* obviously require write access. "Remote atomic" can do
|
|
|
|
* things like fetch and add, which will modify memory, and
|
|
|
|
* "MW bind" can change permissions by binding a window.
|
|
|
|
*/
|
|
|
|
umem->writable = !!(access & ~IB_ACCESS_REMOTE_READ);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-09-13 18:15:28 +02:00
|
|
|
/* We assume the memory is from hugetlb until proved otherwise */
|
|
|
|
umem->hugetlb = 1;
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
INIT_LIST_HEAD(&umem->chunk_list);
|
|
|
|
|
|
|
|
page_list = (struct page **) __get_free_page(GFP_KERNEL);
|
|
|
|
if (!page_list) {
|
|
|
|
kfree(umem);
|
|
|
|
return ERR_PTR(-ENOMEM);
|
|
|
|
}
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-09-13 18:15:28 +02:00
|
|
|
/*
|
|
|
|
* if we can't alloc the vma_list, it's not so bad;
|
|
|
|
* just assume the memory is not hugetlb memory
|
|
|
|
*/
|
|
|
|
vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
|
|
|
|
if (!vma_list)
|
|
|
|
umem->hugetlb = 0;
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
npages = PAGE_ALIGN(size + umem->offset) >> PAGE_SHIFT;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
down_write(¤t->mm->mmap_sem);
|
|
|
|
|
2011-11-01 01:07:30 +01:00
|
|
|
locked = npages + current->mm->pinned_vm;
|
2010-02-12 00:40:48 +01:00
|
|
|
lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
cur_base = addr & PAGE_MASK;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-06-09 01:29:43 +02:00
|
|
|
ret = 0;
|
2005-07-08 02:57:14 +02:00
|
|
|
while (npages) {
|
|
|
|
ret = get_user_pages(current, current->mm, cur_base,
|
IB/umem: Avoid sign problems when demoting npages to integer
On a 64-bit architecture, if ib_umem_get() is called with a size value
that is so big that npages is negative when cast to int, then the
length of the page list passed to get_user_pages(), namely
min_t(int, npages, PAGE_SIZE / sizeof (struct page *))
will be negative, and get_user_pages() will immediately return 0 (at
least since 900cf086, "Be more robust about bad arguments in
get_user_pages()"). This leads to an infinite loop in ib_umem_get(),
since the code boils down to:
while (npages) {
ret = get_user_pages(...);
npages -= ret;
}
Fix this by taking the minimum as unsigned longs, so that the value of
npages is never truncated.
The impact of this bug isn't too severe, since the value of npages is
checked against RLIMIT_MEMLOCK, so a process would need to have an
astronomical limit or have CAP_IPC_LOCK to be able to trigger this,
and such a process could already cause lots of mischief. But it does
let buggy userspace code cause a kernel lock-up; for example I hit
this with code that passes a negative value into a memory registartion
function where it is promoted to a huge u64 value.
Cc: <stable@kernel.org>
Signed-off-by: Roland Dreier <rolandd@cisco.com>
2008-06-07 06:38:37 +02:00
|
|
|
min_t(unsigned long, npages,
|
2005-07-08 02:57:14 +02:00
|
|
|
PAGE_SIZE / sizeof (struct page *)),
|
2007-09-13 18:15:28 +02:00
|
|
|
1, !umem->writable, page_list, vma_list);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
if (ret < 0)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
cur_base += ret * PAGE_SIZE;
|
|
|
|
npages -= ret;
|
|
|
|
|
|
|
|
off = 0;
|
|
|
|
|
|
|
|
while (ret) {
|
|
|
|
chunk = kmalloc(sizeof *chunk + sizeof (struct scatterlist) *
|
|
|
|
min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (!chunk) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
chunk->nents = min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK);
|
2007-10-22 21:19:53 +02:00
|
|
|
sg_init_table(chunk->page_list, chunk->nents);
|
2005-07-08 02:57:14 +02:00
|
|
|
for (i = 0; i < chunk->nents; ++i) {
|
2007-09-13 18:15:28 +02:00
|
|
|
if (vma_list &&
|
|
|
|
!is_vm_hugetlb_page(vma_list[i + off]))
|
|
|
|
umem->hugetlb = 0;
|
2007-10-24 11:20:47 +02:00
|
|
|
sg_set_page(&chunk->page_list[i], page_list[i + off], PAGE_SIZE, 0);
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
|
|
|
|
2008-04-29 10:00:34 +02:00
|
|
|
chunk->nmap = ib_dma_map_sg_attrs(context->device,
|
|
|
|
&chunk->page_list[0],
|
|
|
|
chunk->nents,
|
|
|
|
DMA_BIDIRECTIONAL,
|
|
|
|
&attrs);
|
2005-07-08 02:57:14 +02:00
|
|
|
if (chunk->nmap <= 0) {
|
|
|
|
for (i = 0; i < chunk->nents; ++i)
|
2007-10-22 21:19:53 +02:00
|
|
|
put_page(sg_page(&chunk->page_list[i]));
|
2005-07-08 02:57:14 +02:00
|
|
|
kfree(chunk);
|
|
|
|
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret -= chunk->nents;
|
|
|
|
off += chunk->nents;
|
2007-03-05 01:15:11 +01:00
|
|
|
list_add_tail(&chunk->list, &umem->chunk_list);
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
out:
|
2007-03-05 01:15:11 +01:00
|
|
|
if (ret < 0) {
|
|
|
|
__ib_umem_release(context->device, umem, 0);
|
|
|
|
kfree(umem);
|
|
|
|
} else
|
2011-11-01 01:07:30 +01:00
|
|
|
current->mm->pinned_vm = locked;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
2007-09-13 18:15:28 +02:00
|
|
|
if (vma_list)
|
|
|
|
free_page((unsigned long) vma_list);
|
2005-07-08 02:57:14 +02:00
|
|
|
free_page((unsigned long) page_list);
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
return ret < 0 ? ERR_PTR(ret) : umem;
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
2007-03-05 01:15:11 +01:00
|
|
|
EXPORT_SYMBOL(ib_umem_get);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-04-19 05:20:28 +02:00
|
|
|
static void ib_umem_account(struct work_struct *work)
|
2005-07-08 02:57:14 +02:00
|
|
|
{
|
2007-04-19 05:20:28 +02:00
|
|
|
struct ib_umem *umem = container_of(work, struct ib_umem, work);
|
|
|
|
|
|
|
|
down_write(&umem->mm->mmap_sem);
|
2011-11-01 01:07:30 +01:00
|
|
|
umem->mm->pinned_vm -= umem->diff;
|
2007-04-19 05:20:28 +02:00
|
|
|
up_write(&umem->mm->mmap_sem);
|
|
|
|
mmput(umem->mm);
|
|
|
|
kfree(umem);
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
/**
|
|
|
|
* ib_umem_release - release memory pinned with ib_umem_get
|
|
|
|
* @umem: umem struct to release
|
|
|
|
*/
|
|
|
|
void ib_umem_release(struct ib_umem *umem)
|
2005-07-08 02:57:14 +02:00
|
|
|
{
|
2007-03-05 01:15:11 +01:00
|
|
|
struct ib_ucontext *context = umem->context;
|
2005-07-08 02:57:14 +02:00
|
|
|
struct mm_struct *mm;
|
2007-03-05 01:15:11 +01:00
|
|
|
unsigned long diff;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
__ib_umem_release(umem->context->device, umem, 1);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
|
|
|
mm = get_task_mm(current);
|
2007-05-14 10:35:43 +02:00
|
|
|
if (!mm) {
|
|
|
|
kfree(umem);
|
2005-07-08 02:57:14 +02:00
|
|
|
return;
|
2007-05-14 10:35:43 +02:00
|
|
|
}
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
diff = PAGE_ALIGN(umem->length + umem->offset) >> PAGE_SHIFT;
|
|
|
|
|
2005-07-08 02:57:14 +02:00
|
|
|
/*
|
|
|
|
* We may be called with the mm's mmap_sem already held. This
|
|
|
|
* can happen when a userspace munmap() is the call that drops
|
|
|
|
* the last reference to our file and calls our release
|
|
|
|
* method. If there are memory regions to destroy, we'll end
|
2007-03-05 01:15:11 +01:00
|
|
|
* up here and not be able to take the mmap_sem. In that case
|
|
|
|
* we defer the vm_locked accounting to the system workqueue.
|
2005-07-08 02:57:14 +02:00
|
|
|
*/
|
2007-06-21 20:05:58 +02:00
|
|
|
if (context->closing) {
|
|
|
|
if (!down_write_trylock(&mm->mmap_sem)) {
|
|
|
|
INIT_WORK(&umem->work, ib_umem_account);
|
|
|
|
umem->mm = mm;
|
|
|
|
umem->diff = diff;
|
|
|
|
|
2010-10-19 17:24:36 +02:00
|
|
|
queue_work(ib_wq, &umem->work);
|
2007-06-21 20:05:58 +02:00
|
|
|
return;
|
|
|
|
}
|
2007-03-05 01:15:11 +01:00
|
|
|
} else
|
|
|
|
down_write(&mm->mmap_sem);
|
|
|
|
|
2012-05-10 22:28:05 +02:00
|
|
|
current->mm->pinned_vm -= diff;
|
2007-03-05 01:15:11 +01:00
|
|
|
up_write(&mm->mmap_sem);
|
|
|
|
mmput(mm);
|
2007-04-19 05:20:28 +02:00
|
|
|
kfree(umem);
|
2007-03-05 01:15:11 +01:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(ib_umem_release);
|
|
|
|
|
|
|
|
int ib_umem_page_count(struct ib_umem *umem)
|
|
|
|
{
|
|
|
|
struct ib_umem_chunk *chunk;
|
|
|
|
int shift;
|
|
|
|
int i;
|
|
|
|
int n;
|
|
|
|
|
|
|
|
shift = ilog2(umem->page_size);
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
n = 0;
|
|
|
|
list_for_each_entry(chunk, &umem->chunk_list, list)
|
|
|
|
for (i = 0; i < chunk->nmap; ++i)
|
|
|
|
n += sg_dma_len(&chunk->page_list[i]) >> shift;
|
2005-07-08 02:57:14 +02:00
|
|
|
|
2007-03-05 01:15:11 +01:00
|
|
|
return n;
|
2005-07-08 02:57:14 +02:00
|
|
|
}
|
2007-03-05 01:15:11 +01:00
|
|
|
EXPORT_SYMBOL(ib_umem_page_count);
|