mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-27 22:53:55 +08:00
932f4a630a
Pach series "Add FOLL_LONGTERM to GUP fast and use it". HFI1, qib, and mthca, use get_user_pages_fast() due to its performance advantages. These pages can be held for a significant time. But get_user_pages_fast() does not protect against mapping FS DAX pages. Introduce FOLL_LONGTERM and use this flag in get_user_pages_fast() which retains the performance while also adding the FS DAX checks. XDP has also shown interest in using this functionality.[1] In addition we change get_user_pages() to use the new FOLL_LONGTERM flag and remove the specialized get_user_pages_longterm call. [1] https://lkml.org/lkml/2019/3/19/939 "longterm" is a relative thing and at this point is probably a misnomer. This is really flagging a pin which is going to be given to hardware and can't move. I've thought of a couple of alternative names but I think we have to settle on if we are going to use FL_LAYOUT or something else to solve the "longterm" problem. Then I think we can change the flag to a better name. Secondly, it depends on how often you are registering memory. I have spoken with some RDMA users who consider MR in the performance path... For the overall application performance. I don't have the numbers as the tests for HFI1 were done a long time ago. But there was a significant advantage. Some of which is probably due to the fact that you don't have to hold mmap_sem. Finally, architecturally I think it would be good for everyone to use *_fast. There are patches submitted to the RDMA list which would allow the use of *_fast (they reworking the use of mmap_sem) and as soon as they are accepted I'll submit a patch to convert the RDMA core as well. Also to this point others are looking to use *_fast. As an aside, Jasons pointed out in my previous submission that *_fast and *_unlocked look very much the same. I agree and I think further cleanup will be coming. But I'm focused on getting the final solution for DAX at the moment. This patch (of 7): This patch starts a series which aims to support FOLL_LONGTERM in get_user_pages_fast(). Some callers who would like to do a longterm (user controlled pin) of pages with the fast variant of GUP for performance purposes. Rather than have a separate get_user_pages_longterm() call, introduce FOLL_LONGTERM and change the longterm callers to use it. This patch does not change any functionality. In the short term "longterm" or user controlled pins are unsafe for Filesystems and FS DAX in particular has been blocked. However, callers of get_user_pages_fast() were not "protected". FOLL_LONGTERM can _only_ be supported with get_user_pages[_fast]() as it requires vmas to determine if DAX is in use. NOTE: In merging with the CMA changes we opt to change the get_user_pages() call in check_and_migrate_cma_pages() to a call of __get_user_pages_locked() on the newly migrated pages. This makes the code read better in that we are calling __get_user_pages_locked() on the pages before and after a potential migration. As a side affect some of the interfaces are cleaned up but this is not the primary purpose of the series. In review[1] it was asked: <quote> > This I don't get - if you do lock down long term mappings performance > of the actual get_user_pages call shouldn't matter to start with. > > What do I miss? A couple of points. First "longterm" is a relative thing and at this point is probably a misnomer. This is really flagging a pin which is going to be given to hardware and can't move. I've thought of a couple of alternative names but I think we have to settle on if we are going to use FL_LAYOUT or something else to solve the "longterm" problem. Then I think we can change the flag to a better name. Second, It depends on how often you are registering memory. I have spoken with some RDMA users who consider MR in the performance path... For the overall application performance. I don't have the numbers as the tests for HFI1 were done a long time ago. But there was a significant advantage. Some of which is probably due to the fact that you don't have to hold mmap_sem. Finally, architecturally I think it would be good for everyone to use *_fast. There are patches submitted to the RDMA list which would allow the use of *_fast (they reworking the use of mmap_sem) and as soon as they are accepted I'll submit a patch to convert the RDMA core as well. Also to this point others are looking to use *_fast. As an asside, Jasons pointed out in my previous submission that *_fast and *_unlocked look very much the same. I agree and I think further cleanup will be coming. But I'm focused on getting the final solution for DAX at the moment. </quote> [1] https://lore.kernel.org/lkml/20190220180255.GA12020@iweiny-DESK2.sc.intel.com/T/#md6abad2569f3bf6c1f03686c8097ab6563e94965 [ira.weiny@intel.com: v3] Link: http://lkml.kernel.org/r/20190328084422.29911-2-ira.weiny@intel.com Link: http://lkml.kernel.org/r/20190328084422.29911-2-ira.weiny@intel.com Link: http://lkml.kernel.org/r/20190317183438.2057-2-ira.weiny@intel.com Signed-off-by: Ira Weiny <ira.weiny@intel.com> Reviewed-by: Andrew Morton <akpm@linux-foundation.org> Cc: Aneesh Kumar K.V <aneesh.kumar@linux.ibm.com> Cc: Michal Hocko <mhocko@kernel.org> Cc: John Hubbard <jhubbard@nvidia.com> Cc: "Kirill A. Shutemov" <kirill.shutemov@linux.intel.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Jason Gunthorpe <jgg@ziepe.ca> Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org> Cc: Paul Mackerras <paulus@samba.org> Cc: "David S. Miller" <davem@davemloft.net> Cc: Martin Schwidefsky <schwidefsky@de.ibm.com> Cc: Heiko Carstens <heiko.carstens@de.ibm.com> Cc: Rich Felker <dalias@libc.org> Cc: Yoshinori Sato <ysato@users.sourceforge.jp> Cc: Thomas Gleixner <tglx@linutronix.de> Cc: Ingo Molnar <mingo@redhat.com> Cc: Borislav Petkov <bp@alien8.de> Cc: Ralf Baechle <ralf@linux-mips.org> Cc: James Hogan <jhogan@kernel.org> Cc: Dan Williams <dan.j.williams@intel.com> Cc: Mike Marshall <hubcap@omnibond.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
427 lines
11 KiB
C
427 lines
11 KiB
C
/*
|
|
* Copyright (c) 2005 Topspin Communications. All rights reserved.
|
|
* Copyright (c) 2005 Cisco Systems. All rights reserved.
|
|
* Copyright (c) 2005 Mellanox Technologies. 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/mm.h>
|
|
#include <linux/dma-mapping.h>
|
|
#include <linux/sched/signal.h>
|
|
#include <linux/sched/mm.h>
|
|
#include <linux/export.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/pagemap.h>
|
|
#include <rdma/ib_umem_odp.h>
|
|
|
|
#include "uverbs.h"
|
|
|
|
static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
|
|
{
|
|
struct sg_page_iter sg_iter;
|
|
struct page *page;
|
|
|
|
if (umem->nmap > 0)
|
|
ib_dma_unmap_sg(dev, umem->sg_head.sgl, umem->sg_nents,
|
|
DMA_BIDIRECTIONAL);
|
|
|
|
for_each_sg_page(umem->sg_head.sgl, &sg_iter, umem->sg_nents, 0) {
|
|
page = sg_page_iter_page(&sg_iter);
|
|
if (!PageDirty(page) && umem->writable && dirty)
|
|
set_page_dirty_lock(page);
|
|
put_page(page);
|
|
}
|
|
|
|
sg_free_table(&umem->sg_head);
|
|
}
|
|
|
|
/* ib_umem_add_sg_table - Add N contiguous pages to scatter table
|
|
*
|
|
* sg: current scatterlist entry
|
|
* page_list: array of npage struct page pointers
|
|
* npages: number of pages in page_list
|
|
* max_seg_sz: maximum segment size in bytes
|
|
* nents: [out] number of entries in the scatterlist
|
|
*
|
|
* Return new end of scatterlist
|
|
*/
|
|
static struct scatterlist *ib_umem_add_sg_table(struct scatterlist *sg,
|
|
struct page **page_list,
|
|
unsigned long npages,
|
|
unsigned int max_seg_sz,
|
|
int *nents)
|
|
{
|
|
unsigned long first_pfn;
|
|
unsigned long i = 0;
|
|
bool update_cur_sg = false;
|
|
bool first = !sg_page(sg);
|
|
|
|
/* Check if new page_list is contiguous with end of previous page_list.
|
|
* sg->length here is a multiple of PAGE_SIZE and sg->offset is 0.
|
|
*/
|
|
if (!first && (page_to_pfn(sg_page(sg)) + (sg->length >> PAGE_SHIFT) ==
|
|
page_to_pfn(page_list[0])))
|
|
update_cur_sg = true;
|
|
|
|
while (i != npages) {
|
|
unsigned long len;
|
|
struct page *first_page = page_list[i];
|
|
|
|
first_pfn = page_to_pfn(first_page);
|
|
|
|
/* Compute the number of contiguous pages we have starting
|
|
* at i
|
|
*/
|
|
for (len = 0; i != npages &&
|
|
first_pfn + len == page_to_pfn(page_list[i]) &&
|
|
len < (max_seg_sz >> PAGE_SHIFT);
|
|
len++)
|
|
i++;
|
|
|
|
/* Squash N contiguous pages from page_list into current sge */
|
|
if (update_cur_sg) {
|
|
if ((max_seg_sz - sg->length) >= (len << PAGE_SHIFT)) {
|
|
sg_set_page(sg, sg_page(sg),
|
|
sg->length + (len << PAGE_SHIFT),
|
|
0);
|
|
update_cur_sg = false;
|
|
continue;
|
|
}
|
|
update_cur_sg = false;
|
|
}
|
|
|
|
/* Squash N contiguous pages into next sge or first sge */
|
|
if (!first)
|
|
sg = sg_next(sg);
|
|
|
|
(*nents)++;
|
|
sg_set_page(sg, first_page, len << PAGE_SHIFT, 0);
|
|
first = false;
|
|
}
|
|
|
|
return sg;
|
|
}
|
|
|
|
/**
|
|
* ib_umem_find_best_pgsz - Find best HW page size to use for this MR
|
|
*
|
|
* @umem: umem struct
|
|
* @pgsz_bitmap: bitmap of HW supported page sizes
|
|
* @virt: IOVA
|
|
*
|
|
* This helper is intended for HW that support multiple page
|
|
* sizes but can do only a single page size in an MR.
|
|
*
|
|
* Returns 0 if the umem requires page sizes not supported by
|
|
* the driver to be mapped. Drivers always supporting PAGE_SIZE
|
|
* or smaller will never see a 0 result.
|
|
*/
|
|
unsigned long ib_umem_find_best_pgsz(struct ib_umem *umem,
|
|
unsigned long pgsz_bitmap,
|
|
unsigned long virt)
|
|
{
|
|
struct scatterlist *sg;
|
|
unsigned int best_pg_bit;
|
|
unsigned long va, pgoff;
|
|
dma_addr_t mask;
|
|
int i;
|
|
|
|
/* At minimum, drivers must support PAGE_SIZE or smaller */
|
|
if (WARN_ON(!(pgsz_bitmap & GENMASK(PAGE_SHIFT, 0))))
|
|
return 0;
|
|
|
|
va = virt;
|
|
/* max page size not to exceed MR length */
|
|
mask = roundup_pow_of_two(umem->length);
|
|
/* offset into first SGL */
|
|
pgoff = umem->address & ~PAGE_MASK;
|
|
|
|
for_each_sg(umem->sg_head.sgl, sg, umem->nmap, i) {
|
|
/* Walk SGL and reduce max page size if VA/PA bits differ
|
|
* for any address.
|
|
*/
|
|
mask |= (sg_dma_address(sg) + pgoff) ^ va;
|
|
if (i && i != (umem->nmap - 1))
|
|
/* restrict by length as well for interior SGEs */
|
|
mask |= sg_dma_len(sg);
|
|
va += sg_dma_len(sg) - pgoff;
|
|
pgoff = 0;
|
|
}
|
|
best_pg_bit = rdma_find_pg_bit(mask, pgsz_bitmap);
|
|
|
|
return BIT_ULL(best_pg_bit);
|
|
}
|
|
EXPORT_SYMBOL(ib_umem_find_best_pgsz);
|
|
|
|
/**
|
|
* ib_umem_get - Pin and DMA map userspace memory.
|
|
*
|
|
* If access flags indicate ODP memory, avoid pinning. Instead, stores
|
|
* the mm for future page fault handling in conjunction with MMU notifiers.
|
|
*
|
|
* @udata: 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
|
|
* @dmasync: flush in-flight DMA when the memory region is written
|
|
*/
|
|
struct ib_umem *ib_umem_get(struct ib_udata *udata, unsigned long addr,
|
|
size_t size, int access, int dmasync)
|
|
{
|
|
struct ib_ucontext *context;
|
|
struct ib_umem *umem;
|
|
struct page **page_list;
|
|
unsigned long lock_limit;
|
|
unsigned long new_pinned;
|
|
unsigned long cur_base;
|
|
struct mm_struct *mm;
|
|
unsigned long npages;
|
|
int ret;
|
|
unsigned long dma_attrs = 0;
|
|
struct scatterlist *sg;
|
|
unsigned int gup_flags = FOLL_WRITE;
|
|
|
|
if (!udata)
|
|
return ERR_PTR(-EIO);
|
|
|
|
context = container_of(udata, struct uverbs_attr_bundle, driver_udata)
|
|
->context;
|
|
if (!context)
|
|
return ERR_PTR(-EIO);
|
|
|
|
if (dmasync)
|
|
dma_attrs |= DMA_ATTR_WRITE_BARRIER;
|
|
|
|
/*
|
|
* If the combination of the addr and size requested for this memory
|
|
* region causes an integer overflow, return error.
|
|
*/
|
|
if (((addr + size) < addr) ||
|
|
PAGE_ALIGN(addr + size) < (addr + size))
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
if (!can_do_mlock())
|
|
return ERR_PTR(-EPERM);
|
|
|
|
if (access & IB_ACCESS_ON_DEMAND) {
|
|
umem = kzalloc(sizeof(struct ib_umem_odp), GFP_KERNEL);
|
|
if (!umem)
|
|
return ERR_PTR(-ENOMEM);
|
|
umem->is_odp = 1;
|
|
} else {
|
|
umem = kzalloc(sizeof(*umem), GFP_KERNEL);
|
|
if (!umem)
|
|
return ERR_PTR(-ENOMEM);
|
|
}
|
|
|
|
umem->context = context;
|
|
umem->length = size;
|
|
umem->address = addr;
|
|
umem->page_shift = PAGE_SHIFT;
|
|
umem->writable = ib_access_writable(access);
|
|
umem->owning_mm = mm = current->mm;
|
|
mmgrab(mm);
|
|
|
|
if (access & IB_ACCESS_ON_DEMAND) {
|
|
if (WARN_ON_ONCE(!context->invalidate_range)) {
|
|
ret = -EINVAL;
|
|
goto umem_kfree;
|
|
}
|
|
|
|
ret = ib_umem_odp_get(to_ib_umem_odp(umem), access);
|
|
if (ret)
|
|
goto umem_kfree;
|
|
return umem;
|
|
}
|
|
|
|
page_list = (struct page **) __get_free_page(GFP_KERNEL);
|
|
if (!page_list) {
|
|
ret = -ENOMEM;
|
|
goto umem_kfree;
|
|
}
|
|
|
|
npages = ib_umem_num_pages(umem);
|
|
if (npages == 0 || npages > UINT_MAX) {
|
|
ret = -EINVAL;
|
|
goto out;
|
|
}
|
|
|
|
lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
|
|
|
|
new_pinned = atomic64_add_return(npages, &mm->pinned_vm);
|
|
if (new_pinned > lock_limit && !capable(CAP_IPC_LOCK)) {
|
|
atomic64_sub(npages, &mm->pinned_vm);
|
|
ret = -ENOMEM;
|
|
goto out;
|
|
}
|
|
|
|
cur_base = addr & PAGE_MASK;
|
|
|
|
ret = sg_alloc_table(&umem->sg_head, npages, GFP_KERNEL);
|
|
if (ret)
|
|
goto vma;
|
|
|
|
if (!umem->writable)
|
|
gup_flags |= FOLL_FORCE;
|
|
|
|
sg = umem->sg_head.sgl;
|
|
|
|
while (npages) {
|
|
down_read(&mm->mmap_sem);
|
|
ret = get_user_pages(cur_base,
|
|
min_t(unsigned long, npages,
|
|
PAGE_SIZE / sizeof (struct page *)),
|
|
gup_flags | FOLL_LONGTERM,
|
|
page_list, NULL);
|
|
if (ret < 0) {
|
|
up_read(&mm->mmap_sem);
|
|
goto umem_release;
|
|
}
|
|
|
|
cur_base += ret * PAGE_SIZE;
|
|
npages -= ret;
|
|
|
|
sg = ib_umem_add_sg_table(sg, page_list, ret,
|
|
dma_get_max_seg_size(context->device->dma_device),
|
|
&umem->sg_nents);
|
|
|
|
up_read(&mm->mmap_sem);
|
|
}
|
|
|
|
sg_mark_end(sg);
|
|
|
|
umem->nmap = ib_dma_map_sg_attrs(context->device,
|
|
umem->sg_head.sgl,
|
|
umem->sg_nents,
|
|
DMA_BIDIRECTIONAL,
|
|
dma_attrs);
|
|
|
|
if (!umem->nmap) {
|
|
ret = -ENOMEM;
|
|
goto umem_release;
|
|
}
|
|
|
|
ret = 0;
|
|
goto out;
|
|
|
|
umem_release:
|
|
__ib_umem_release(context->device, umem, 0);
|
|
vma:
|
|
atomic64_sub(ib_umem_num_pages(umem), &mm->pinned_vm);
|
|
out:
|
|
free_page((unsigned long) page_list);
|
|
umem_kfree:
|
|
if (ret) {
|
|
mmdrop(umem->owning_mm);
|
|
kfree(umem);
|
|
}
|
|
return ret ? ERR_PTR(ret) : umem;
|
|
}
|
|
EXPORT_SYMBOL(ib_umem_get);
|
|
|
|
static void __ib_umem_release_tail(struct ib_umem *umem)
|
|
{
|
|
mmdrop(umem->owning_mm);
|
|
if (umem->is_odp)
|
|
kfree(to_ib_umem_odp(umem));
|
|
else
|
|
kfree(umem);
|
|
}
|
|
|
|
/**
|
|
* ib_umem_release - release memory pinned with ib_umem_get
|
|
* @umem: umem struct to release
|
|
*/
|
|
void ib_umem_release(struct ib_umem *umem)
|
|
{
|
|
if (umem->is_odp) {
|
|
ib_umem_odp_release(to_ib_umem_odp(umem));
|
|
__ib_umem_release_tail(umem);
|
|
return;
|
|
}
|
|
|
|
__ib_umem_release(umem->context->device, umem, 1);
|
|
|
|
atomic64_sub(ib_umem_num_pages(umem), &umem->owning_mm->pinned_vm);
|
|
__ib_umem_release_tail(umem);
|
|
}
|
|
EXPORT_SYMBOL(ib_umem_release);
|
|
|
|
int ib_umem_page_count(struct ib_umem *umem)
|
|
{
|
|
int i;
|
|
int n;
|
|
struct scatterlist *sg;
|
|
|
|
if (umem->is_odp)
|
|
return ib_umem_num_pages(umem);
|
|
|
|
n = 0;
|
|
for_each_sg(umem->sg_head.sgl, sg, umem->nmap, i)
|
|
n += sg_dma_len(sg) >> umem->page_shift;
|
|
|
|
return n;
|
|
}
|
|
EXPORT_SYMBOL(ib_umem_page_count);
|
|
|
|
/*
|
|
* Copy from the given ib_umem's pages to the given buffer.
|
|
*
|
|
* umem - the umem to copy from
|
|
* offset - offset to start copying from
|
|
* dst - destination buffer
|
|
* length - buffer length
|
|
*
|
|
* Returns 0 on success, or an error code.
|
|
*/
|
|
int ib_umem_copy_from(void *dst, struct ib_umem *umem, size_t offset,
|
|
size_t length)
|
|
{
|
|
size_t end = offset + length;
|
|
int ret;
|
|
|
|
if (offset > umem->length || length > umem->length - offset) {
|
|
pr_err("ib_umem_copy_from not in range. offset: %zd umem length: %zd end: %zd\n",
|
|
offset, umem->length, end);
|
|
return -EINVAL;
|
|
}
|
|
|
|
ret = sg_pcopy_to_buffer(umem->sg_head.sgl, umem->sg_nents, dst, length,
|
|
offset + ib_umem_offset(umem));
|
|
|
|
if (ret < 0)
|
|
return ret;
|
|
else if (ret != length)
|
|
return -EINVAL;
|
|
else
|
|
return 0;
|
|
}
|
|
EXPORT_SYMBOL(ib_umem_copy_from);
|