mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2025-01-01 02:36:02 +00:00
423f52d650
Currently the child leaves are stored in the shared interval tree and every lookup for a child must be done under the interval tree rwsem. This is further complicated by dropping the rwsem during iteration (ie the odp_lookup(), odp_next() pattern), which requires a very tricky an difficult to understand locking scheme with SRCU. Instead reserve the interval tree for the exclusive use of the mmu notifier related code in umem_odp.c and give each implicit MR a xarray containing all the child MRs. Since the size of each child is 1GB of VA, a 1 level xarray will index 64G of VA, and a 2 level will index 2TB, making xarray a much better data structure choice than an interval tree. The locking properties of xarray will be used in the next patches to rework the implicit ODP locking scheme into something simpler. At this point, the xarray is locked by the implicit MR's umem_mutex, and read can also be locked by the odp_srcu. Link: https://lore.kernel.org/r/20191009160934.3143-10-jgg@ziepe.ca Reviewed-by: Artemy Kovalyov <artemyko@mellanox.com> Signed-off-by: Jason Gunthorpe <jgg@mellanox.com>
190 lines
5.9 KiB
C
190 lines
5.9 KiB
C
/*
|
|
* Copyright (c) 2014 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.
|
|
*/
|
|
|
|
#ifndef IB_UMEM_ODP_H
|
|
#define IB_UMEM_ODP_H
|
|
|
|
#include <rdma/ib_umem.h>
|
|
#include <rdma/ib_verbs.h>
|
|
#include <linux/interval_tree.h>
|
|
|
|
struct ib_umem_odp {
|
|
struct ib_umem umem;
|
|
struct ib_ucontext_per_mm *per_mm;
|
|
|
|
/*
|
|
* An array of the pages included in the on-demand paging umem.
|
|
* Indices of pages that are currently not mapped into the device will
|
|
* contain NULL.
|
|
*/
|
|
struct page **page_list;
|
|
/*
|
|
* An array of the same size as page_list, with DMA addresses mapped
|
|
* for pages the pages in page_list. The lower two bits designate
|
|
* access permissions. See ODP_READ_ALLOWED_BIT and
|
|
* ODP_WRITE_ALLOWED_BIT.
|
|
*/
|
|
dma_addr_t *dma_list;
|
|
/*
|
|
* The umem_mutex protects the page_list and dma_list fields of an ODP
|
|
* umem, allowing only a single thread to map/unmap pages. The mutex
|
|
* also protects access to the mmu notifier counters.
|
|
*/
|
|
struct mutex umem_mutex;
|
|
void *private; /* for the HW driver to use. */
|
|
|
|
int notifiers_seq;
|
|
int notifiers_count;
|
|
int npages;
|
|
|
|
/* Tree tracking */
|
|
struct interval_tree_node interval_tree;
|
|
|
|
/*
|
|
* An implicit odp umem cannot be DMA mapped, has 0 length, and serves
|
|
* only as an anchor for the driver to hold onto the per_mm. FIXME:
|
|
* This should be removed and drivers should work with the per_mm
|
|
* directly.
|
|
*/
|
|
bool is_implicit_odp;
|
|
|
|
struct completion notifier_completion;
|
|
int dying;
|
|
unsigned int page_shift;
|
|
struct work_struct work;
|
|
};
|
|
|
|
static inline struct ib_umem_odp *to_ib_umem_odp(struct ib_umem *umem)
|
|
{
|
|
return container_of(umem, struct ib_umem_odp, umem);
|
|
}
|
|
|
|
/* Returns the first page of an ODP umem. */
|
|
static inline unsigned long ib_umem_start(struct ib_umem_odp *umem_odp)
|
|
{
|
|
return umem_odp->interval_tree.start;
|
|
}
|
|
|
|
/* Returns the address of the page after the last one of an ODP umem. */
|
|
static inline unsigned long ib_umem_end(struct ib_umem_odp *umem_odp)
|
|
{
|
|
return umem_odp->interval_tree.last + 1;
|
|
}
|
|
|
|
static inline size_t ib_umem_odp_num_pages(struct ib_umem_odp *umem_odp)
|
|
{
|
|
return (ib_umem_end(umem_odp) - ib_umem_start(umem_odp)) >>
|
|
umem_odp->page_shift;
|
|
}
|
|
|
|
/*
|
|
* The lower 2 bits of the DMA address signal the R/W permissions for
|
|
* the entry. To upgrade the permissions, provide the appropriate
|
|
* bitmask to the map_dma_pages function.
|
|
*
|
|
* Be aware that upgrading a mapped address might result in change of
|
|
* the DMA address for the page.
|
|
*/
|
|
#define ODP_READ_ALLOWED_BIT (1<<0ULL)
|
|
#define ODP_WRITE_ALLOWED_BIT (1<<1ULL)
|
|
|
|
#define ODP_DMA_ADDR_MASK (~(ODP_READ_ALLOWED_BIT | ODP_WRITE_ALLOWED_BIT))
|
|
|
|
#ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
|
|
|
|
struct ib_ucontext_per_mm {
|
|
struct mmu_notifier mn;
|
|
struct pid *tgid;
|
|
|
|
struct rb_root_cached umem_tree;
|
|
/* Protects umem_tree */
|
|
struct rw_semaphore umem_rwsem;
|
|
};
|
|
|
|
struct ib_umem_odp *ib_umem_odp_get(struct ib_udata *udata, unsigned long addr,
|
|
size_t size, int access);
|
|
struct ib_umem_odp *ib_umem_odp_alloc_implicit(struct ib_udata *udata,
|
|
int access);
|
|
struct ib_umem_odp *ib_umem_odp_alloc_child(struct ib_umem_odp *root_umem,
|
|
unsigned long addr, size_t size);
|
|
void ib_umem_odp_release(struct ib_umem_odp *umem_odp);
|
|
|
|
int ib_umem_odp_map_dma_pages(struct ib_umem_odp *umem_odp, u64 start_offset,
|
|
u64 bcnt, u64 access_mask,
|
|
unsigned long current_seq);
|
|
|
|
void ib_umem_odp_unmap_dma_pages(struct ib_umem_odp *umem_odp, u64 start_offset,
|
|
u64 bound);
|
|
|
|
typedef int (*umem_call_back)(struct ib_umem_odp *item, u64 start, u64 end,
|
|
void *cookie);
|
|
/*
|
|
* Call the callback on each ib_umem in the range. Returns the logical or of
|
|
* the return values of the functions called.
|
|
*/
|
|
int rbt_ib_umem_for_each_in_range(struct rb_root_cached *root,
|
|
u64 start, u64 end,
|
|
umem_call_back cb,
|
|
bool blockable, void *cookie);
|
|
|
|
static inline int ib_umem_mmu_notifier_retry(struct ib_umem_odp *umem_odp,
|
|
unsigned long mmu_seq)
|
|
{
|
|
/*
|
|
* This code is strongly based on the KVM code from
|
|
* mmu_notifier_retry. Should be called with
|
|
* the relevant locks taken (umem_odp->umem_mutex
|
|
* and the ucontext umem_mutex semaphore locked for read).
|
|
*/
|
|
|
|
if (unlikely(umem_odp->notifiers_count))
|
|
return 1;
|
|
if (umem_odp->notifiers_seq != mmu_seq)
|
|
return 1;
|
|
return 0;
|
|
}
|
|
|
|
#else /* CONFIG_INFINIBAND_ON_DEMAND_PAGING */
|
|
|
|
static inline struct ib_umem_odp *ib_umem_odp_get(struct ib_udata *udata,
|
|
unsigned long addr,
|
|
size_t size, int access)
|
|
{
|
|
return ERR_PTR(-EINVAL);
|
|
}
|
|
|
|
static inline void ib_umem_odp_release(struct ib_umem_odp *umem_odp) {}
|
|
|
|
#endif /* CONFIG_INFINIBAND_ON_DEMAND_PAGING */
|
|
|
|
#endif /* IB_UMEM_ODP_H */
|