mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-18 15:46:42 +07: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>
503 lines
11 KiB
C
503 lines
11 KiB
C
/*
|
|
* IOMMU helpers in MMU context.
|
|
*
|
|
* Copyright (C) 2015 IBM Corp. <aik@ozlabs.ru>
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version
|
|
* 2 of the License, or (at your option) any later version.
|
|
*
|
|
*/
|
|
|
|
#include <linux/sched/signal.h>
|
|
#include <linux/slab.h>
|
|
#include <linux/rculist.h>
|
|
#include <linux/vmalloc.h>
|
|
#include <linux/mutex.h>
|
|
#include <linux/migrate.h>
|
|
#include <linux/hugetlb.h>
|
|
#include <linux/swap.h>
|
|
#include <linux/sizes.h>
|
|
#include <asm/mmu_context.h>
|
|
#include <asm/pte-walk.h>
|
|
#include <linux/mm_inline.h>
|
|
|
|
static DEFINE_MUTEX(mem_list_mutex);
|
|
|
|
#define MM_IOMMU_TABLE_GROUP_PAGE_DIRTY 0x1
|
|
#define MM_IOMMU_TABLE_GROUP_PAGE_MASK ~(SZ_4K - 1)
|
|
|
|
struct mm_iommu_table_group_mem_t {
|
|
struct list_head next;
|
|
struct rcu_head rcu;
|
|
unsigned long used;
|
|
atomic64_t mapped;
|
|
unsigned int pageshift;
|
|
u64 ua; /* userspace address */
|
|
u64 entries; /* number of entries in hpas/hpages[] */
|
|
/*
|
|
* in mm_iommu_get we temporarily use this to store
|
|
* struct page address.
|
|
*
|
|
* We need to convert ua to hpa in real mode. Make it
|
|
* simpler by storing physical address.
|
|
*/
|
|
union {
|
|
struct page **hpages; /* vmalloc'ed */
|
|
phys_addr_t *hpas;
|
|
};
|
|
#define MM_IOMMU_TABLE_INVALID_HPA ((uint64_t)-1)
|
|
u64 dev_hpa; /* Device memory base address */
|
|
};
|
|
|
|
static long mm_iommu_adjust_locked_vm(struct mm_struct *mm,
|
|
unsigned long npages, bool incr)
|
|
{
|
|
long ret = 0, locked, lock_limit;
|
|
|
|
if (!npages)
|
|
return 0;
|
|
|
|
down_write(&mm->mmap_sem);
|
|
|
|
if (incr) {
|
|
locked = mm->locked_vm + npages;
|
|
lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
|
|
if (locked > lock_limit && !capable(CAP_IPC_LOCK))
|
|
ret = -ENOMEM;
|
|
else
|
|
mm->locked_vm += npages;
|
|
} else {
|
|
if (WARN_ON_ONCE(npages > mm->locked_vm))
|
|
npages = mm->locked_vm;
|
|
mm->locked_vm -= npages;
|
|
}
|
|
|
|
pr_debug("[%d] RLIMIT_MEMLOCK HASH64 %c%ld %ld/%ld\n",
|
|
current ? current->pid : 0,
|
|
incr ? '+' : '-',
|
|
npages << PAGE_SHIFT,
|
|
mm->locked_vm << PAGE_SHIFT,
|
|
rlimit(RLIMIT_MEMLOCK));
|
|
up_write(&mm->mmap_sem);
|
|
|
|
return ret;
|
|
}
|
|
|
|
bool mm_iommu_preregistered(struct mm_struct *mm)
|
|
{
|
|
return !list_empty(&mm->context.iommu_group_mem_list);
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_preregistered);
|
|
|
|
static long mm_iommu_do_alloc(struct mm_struct *mm, unsigned long ua,
|
|
unsigned long entries, unsigned long dev_hpa,
|
|
struct mm_iommu_table_group_mem_t **pmem)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem, *mem2;
|
|
long i, ret, locked_entries = 0, pinned = 0;
|
|
unsigned int pageshift;
|
|
unsigned long entry, chunk;
|
|
|
|
if (dev_hpa == MM_IOMMU_TABLE_INVALID_HPA) {
|
|
ret = mm_iommu_adjust_locked_vm(mm, entries, true);
|
|
if (ret)
|
|
return ret;
|
|
|
|
locked_entries = entries;
|
|
}
|
|
|
|
mem = kzalloc(sizeof(*mem), GFP_KERNEL);
|
|
if (!mem) {
|
|
ret = -ENOMEM;
|
|
goto unlock_exit;
|
|
}
|
|
|
|
if (dev_hpa != MM_IOMMU_TABLE_INVALID_HPA) {
|
|
mem->pageshift = __ffs(dev_hpa | (entries << PAGE_SHIFT));
|
|
mem->dev_hpa = dev_hpa;
|
|
goto good_exit;
|
|
}
|
|
mem->dev_hpa = MM_IOMMU_TABLE_INVALID_HPA;
|
|
|
|
/*
|
|
* For a starting point for a maximum page size calculation
|
|
* we use @ua and @entries natural alignment to allow IOMMU pages
|
|
* smaller than huge pages but still bigger than PAGE_SIZE.
|
|
*/
|
|
mem->pageshift = __ffs(ua | (entries << PAGE_SHIFT));
|
|
mem->hpas = vzalloc(array_size(entries, sizeof(mem->hpas[0])));
|
|
if (!mem->hpas) {
|
|
kfree(mem);
|
|
ret = -ENOMEM;
|
|
goto unlock_exit;
|
|
}
|
|
|
|
down_read(&mm->mmap_sem);
|
|
chunk = (1UL << (PAGE_SHIFT + MAX_ORDER - 1)) /
|
|
sizeof(struct vm_area_struct *);
|
|
chunk = min(chunk, entries);
|
|
for (entry = 0; entry < entries; entry += chunk) {
|
|
unsigned long n = min(entries - entry, chunk);
|
|
|
|
ret = get_user_pages(ua + (entry << PAGE_SHIFT), n,
|
|
FOLL_WRITE | FOLL_LONGTERM,
|
|
mem->hpages + entry, NULL);
|
|
if (ret == n) {
|
|
pinned += n;
|
|
continue;
|
|
}
|
|
if (ret > 0)
|
|
pinned += ret;
|
|
break;
|
|
}
|
|
up_read(&mm->mmap_sem);
|
|
if (pinned != entries) {
|
|
if (!ret)
|
|
ret = -EFAULT;
|
|
goto free_exit;
|
|
}
|
|
|
|
pageshift = PAGE_SHIFT;
|
|
for (i = 0; i < entries; ++i) {
|
|
struct page *page = mem->hpages[i];
|
|
|
|
/*
|
|
* Allow to use larger than 64k IOMMU pages. Only do that
|
|
* if we are backed by hugetlb.
|
|
*/
|
|
if ((mem->pageshift > PAGE_SHIFT) && PageHuge(page)) {
|
|
struct page *head = compound_head(page);
|
|
|
|
pageshift = compound_order(head) + PAGE_SHIFT;
|
|
}
|
|
mem->pageshift = min(mem->pageshift, pageshift);
|
|
/*
|
|
* We don't need struct page reference any more, switch
|
|
* to physical address.
|
|
*/
|
|
mem->hpas[i] = page_to_pfn(page) << PAGE_SHIFT;
|
|
}
|
|
|
|
good_exit:
|
|
atomic64_set(&mem->mapped, 1);
|
|
mem->used = 1;
|
|
mem->ua = ua;
|
|
mem->entries = entries;
|
|
|
|
mutex_lock(&mem_list_mutex);
|
|
|
|
list_for_each_entry_rcu(mem2, &mm->context.iommu_group_mem_list, next) {
|
|
/* Overlap? */
|
|
if ((mem2->ua < (ua + (entries << PAGE_SHIFT))) &&
|
|
(ua < (mem2->ua +
|
|
(mem2->entries << PAGE_SHIFT)))) {
|
|
ret = -EINVAL;
|
|
mutex_unlock(&mem_list_mutex);
|
|
goto free_exit;
|
|
}
|
|
}
|
|
|
|
list_add_rcu(&mem->next, &mm->context.iommu_group_mem_list);
|
|
|
|
mutex_unlock(&mem_list_mutex);
|
|
|
|
*pmem = mem;
|
|
|
|
return 0;
|
|
|
|
free_exit:
|
|
/* free the reference taken */
|
|
for (i = 0; i < pinned; i++)
|
|
put_page(mem->hpages[i]);
|
|
|
|
vfree(mem->hpas);
|
|
kfree(mem);
|
|
|
|
unlock_exit:
|
|
mm_iommu_adjust_locked_vm(mm, locked_entries, false);
|
|
|
|
return ret;
|
|
}
|
|
|
|
long mm_iommu_new(struct mm_struct *mm, unsigned long ua, unsigned long entries,
|
|
struct mm_iommu_table_group_mem_t **pmem)
|
|
{
|
|
return mm_iommu_do_alloc(mm, ua, entries, MM_IOMMU_TABLE_INVALID_HPA,
|
|
pmem);
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_new);
|
|
|
|
long mm_iommu_newdev(struct mm_struct *mm, unsigned long ua,
|
|
unsigned long entries, unsigned long dev_hpa,
|
|
struct mm_iommu_table_group_mem_t **pmem)
|
|
{
|
|
return mm_iommu_do_alloc(mm, ua, entries, dev_hpa, pmem);
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_newdev);
|
|
|
|
static void mm_iommu_unpin(struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
long i;
|
|
struct page *page = NULL;
|
|
|
|
if (!mem->hpas)
|
|
return;
|
|
|
|
for (i = 0; i < mem->entries; ++i) {
|
|
if (!mem->hpas[i])
|
|
continue;
|
|
|
|
page = pfn_to_page(mem->hpas[i] >> PAGE_SHIFT);
|
|
if (!page)
|
|
continue;
|
|
|
|
if (mem->hpas[i] & MM_IOMMU_TABLE_GROUP_PAGE_DIRTY)
|
|
SetPageDirty(page);
|
|
|
|
put_page(page);
|
|
mem->hpas[i] = 0;
|
|
}
|
|
}
|
|
|
|
static void mm_iommu_do_free(struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
|
|
mm_iommu_unpin(mem);
|
|
vfree(mem->hpas);
|
|
kfree(mem);
|
|
}
|
|
|
|
static void mm_iommu_free(struct rcu_head *head)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem = container_of(head,
|
|
struct mm_iommu_table_group_mem_t, rcu);
|
|
|
|
mm_iommu_do_free(mem);
|
|
}
|
|
|
|
static void mm_iommu_release(struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
list_del_rcu(&mem->next);
|
|
call_rcu(&mem->rcu, mm_iommu_free);
|
|
}
|
|
|
|
long mm_iommu_put(struct mm_struct *mm, struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
long ret = 0;
|
|
unsigned long unlock_entries = 0;
|
|
|
|
mutex_lock(&mem_list_mutex);
|
|
|
|
if (mem->used == 0) {
|
|
ret = -ENOENT;
|
|
goto unlock_exit;
|
|
}
|
|
|
|
--mem->used;
|
|
/* There are still users, exit */
|
|
if (mem->used)
|
|
goto unlock_exit;
|
|
|
|
/* Are there still mappings? */
|
|
if (atomic_cmpxchg(&mem->mapped, 1, 0) != 1) {
|
|
++mem->used;
|
|
ret = -EBUSY;
|
|
goto unlock_exit;
|
|
}
|
|
|
|
if (mem->dev_hpa == MM_IOMMU_TABLE_INVALID_HPA)
|
|
unlock_entries = mem->entries;
|
|
|
|
/* @mapped became 0 so now mappings are disabled, release the region */
|
|
mm_iommu_release(mem);
|
|
|
|
unlock_exit:
|
|
mutex_unlock(&mem_list_mutex);
|
|
|
|
mm_iommu_adjust_locked_vm(mm, unlock_entries, false);
|
|
|
|
return ret;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_put);
|
|
|
|
struct mm_iommu_table_group_mem_t *mm_iommu_lookup(struct mm_struct *mm,
|
|
unsigned long ua, unsigned long size)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem, *ret = NULL;
|
|
|
|
list_for_each_entry_rcu(mem, &mm->context.iommu_group_mem_list, next) {
|
|
if ((mem->ua <= ua) &&
|
|
(ua + size <= mem->ua +
|
|
(mem->entries << PAGE_SHIFT))) {
|
|
ret = mem;
|
|
break;
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_lookup);
|
|
|
|
struct mm_iommu_table_group_mem_t *mm_iommu_lookup_rm(struct mm_struct *mm,
|
|
unsigned long ua, unsigned long size)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem, *ret = NULL;
|
|
|
|
list_for_each_entry_lockless(mem, &mm->context.iommu_group_mem_list,
|
|
next) {
|
|
if ((mem->ua <= ua) &&
|
|
(ua + size <= mem->ua +
|
|
(mem->entries << PAGE_SHIFT))) {
|
|
ret = mem;
|
|
break;
|
|
}
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
struct mm_iommu_table_group_mem_t *mm_iommu_get(struct mm_struct *mm,
|
|
unsigned long ua, unsigned long entries)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem, *ret = NULL;
|
|
|
|
mutex_lock(&mem_list_mutex);
|
|
|
|
list_for_each_entry_rcu(mem, &mm->context.iommu_group_mem_list, next) {
|
|
if ((mem->ua == ua) && (mem->entries == entries)) {
|
|
ret = mem;
|
|
++mem->used;
|
|
break;
|
|
}
|
|
}
|
|
|
|
mutex_unlock(&mem_list_mutex);
|
|
|
|
return ret;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_get);
|
|
|
|
long mm_iommu_ua_to_hpa(struct mm_iommu_table_group_mem_t *mem,
|
|
unsigned long ua, unsigned int pageshift, unsigned long *hpa)
|
|
{
|
|
const long entry = (ua - mem->ua) >> PAGE_SHIFT;
|
|
u64 *va;
|
|
|
|
if (entry >= mem->entries)
|
|
return -EFAULT;
|
|
|
|
if (pageshift > mem->pageshift)
|
|
return -EFAULT;
|
|
|
|
if (!mem->hpas) {
|
|
*hpa = mem->dev_hpa + (ua - mem->ua);
|
|
return 0;
|
|
}
|
|
|
|
va = &mem->hpas[entry];
|
|
*hpa = (*va & MM_IOMMU_TABLE_GROUP_PAGE_MASK) | (ua & ~PAGE_MASK);
|
|
|
|
return 0;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_ua_to_hpa);
|
|
|
|
long mm_iommu_ua_to_hpa_rm(struct mm_iommu_table_group_mem_t *mem,
|
|
unsigned long ua, unsigned int pageshift, unsigned long *hpa)
|
|
{
|
|
const long entry = (ua - mem->ua) >> PAGE_SHIFT;
|
|
unsigned long *pa;
|
|
|
|
if (entry >= mem->entries)
|
|
return -EFAULT;
|
|
|
|
if (pageshift > mem->pageshift)
|
|
return -EFAULT;
|
|
|
|
if (!mem->hpas) {
|
|
*hpa = mem->dev_hpa + (ua - mem->ua);
|
|
return 0;
|
|
}
|
|
|
|
pa = (void *) vmalloc_to_phys(&mem->hpas[entry]);
|
|
if (!pa)
|
|
return -EFAULT;
|
|
|
|
*hpa = (*pa & MM_IOMMU_TABLE_GROUP_PAGE_MASK) | (ua & ~PAGE_MASK);
|
|
|
|
return 0;
|
|
}
|
|
|
|
extern void mm_iommu_ua_mark_dirty_rm(struct mm_struct *mm, unsigned long ua)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem;
|
|
long entry;
|
|
void *va;
|
|
unsigned long *pa;
|
|
|
|
mem = mm_iommu_lookup_rm(mm, ua, PAGE_SIZE);
|
|
if (!mem)
|
|
return;
|
|
|
|
if (mem->dev_hpa != MM_IOMMU_TABLE_INVALID_HPA)
|
|
return;
|
|
|
|
entry = (ua - mem->ua) >> PAGE_SHIFT;
|
|
va = &mem->hpas[entry];
|
|
|
|
pa = (void *) vmalloc_to_phys(va);
|
|
if (!pa)
|
|
return;
|
|
|
|
*pa |= MM_IOMMU_TABLE_GROUP_PAGE_DIRTY;
|
|
}
|
|
|
|
bool mm_iommu_is_devmem(struct mm_struct *mm, unsigned long hpa,
|
|
unsigned int pageshift, unsigned long *size)
|
|
{
|
|
struct mm_iommu_table_group_mem_t *mem;
|
|
unsigned long end;
|
|
|
|
list_for_each_entry_rcu(mem, &mm->context.iommu_group_mem_list, next) {
|
|
if (mem->dev_hpa == MM_IOMMU_TABLE_INVALID_HPA)
|
|
continue;
|
|
|
|
end = mem->dev_hpa + (mem->entries << PAGE_SHIFT);
|
|
if ((mem->dev_hpa <= hpa) && (hpa < end)) {
|
|
/*
|
|
* Since the IOMMU page size might be bigger than
|
|
* PAGE_SIZE, the amount of preregistered memory
|
|
* starting from @hpa might be smaller than 1<<pageshift
|
|
* and the caller needs to distinguish this situation.
|
|
*/
|
|
*size = min(1UL << pageshift, end - hpa);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_is_devmem);
|
|
|
|
long mm_iommu_mapped_inc(struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
if (atomic64_inc_not_zero(&mem->mapped))
|
|
return 0;
|
|
|
|
/* Last mm_iommu_put() has been called, no more mappings allowed() */
|
|
return -ENXIO;
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_mapped_inc);
|
|
|
|
void mm_iommu_mapped_dec(struct mm_iommu_table_group_mem_t *mem)
|
|
{
|
|
atomic64_add_unless(&mem->mapped, -1, 1);
|
|
}
|
|
EXPORT_SYMBOL_GPL(mm_iommu_mapped_dec);
|
|
|
|
void mm_iommu_init(struct mm_struct *mm)
|
|
{
|
|
INIT_LIST_HEAD_RCU(&mm->context.iommu_group_mem_list);
|
|
}
|