2016-03-09 02:14:20 +07:00
|
|
|
/*
|
|
|
|
* Copyright(c) 2016 Intel Corporation.
|
|
|
|
*
|
|
|
|
* This file is provided under a dual BSD/GPLv2 license. When using or
|
|
|
|
* redistributing this file, you may do so under either license.
|
|
|
|
*
|
|
|
|
* GPL LICENSE SUMMARY
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of version 2 of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* BSD LICENSE
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
* - Neither the name of Intel Corporation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
#ifndef _HFI1_MMU_RB_H
|
|
|
|
#define _HFI1_MMU_RB_H
|
|
|
|
|
|
|
|
#include "hfi.h"
|
|
|
|
|
|
|
|
struct mmu_rb_node {
|
|
|
|
unsigned long addr;
|
|
|
|
unsigned long len;
|
2016-03-09 02:14:53 +07:00
|
|
|
unsigned long __last;
|
|
|
|
struct rb_node node;
|
2016-03-09 02:14:20 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
struct mmu_rb_ops {
|
2016-07-28 23:27:29 +07:00
|
|
|
bool (*filter)(struct mmu_rb_node *node, unsigned long addr,
|
|
|
|
unsigned long len);
|
|
|
|
int (*insert)(struct rb_root *root, struct mmu_rb_node *mnode);
|
|
|
|
void (*remove)(struct rb_root *root, struct mmu_rb_node *mnode,
|
|
|
|
struct mm_struct *mm);
|
|
|
|
int (*invalidate)(struct rb_root *root, struct mmu_rb_node *node);
|
2016-03-09 02:14:20 +07:00
|
|
|
};
|
|
|
|
|
2016-07-29 02:21:19 +07:00
|
|
|
int hfi1_mmu_rb_register(struct mm_struct *mm, struct rb_root *root,
|
|
|
|
struct mmu_rb_ops *ops);
|
2016-03-09 02:14:20 +07:00
|
|
|
void hfi1_mmu_rb_unregister(struct rb_root *);
|
|
|
|
int hfi1_mmu_rb_insert(struct rb_root *, struct mmu_rb_node *);
|
|
|
|
void hfi1_mmu_rb_remove(struct rb_root *, struct mmu_rb_node *);
|
IB/hfi1: Extract and reinsert MMU RB node on lookup
The page pinning function, which also maintains the pin cache,
behaves one of two ways when an exact buffer match is not found:
1. If no node is not found (a buffer with the same starting address
is not found in the cache), a new node is created, the buffer
pages are pinned, and the node is inserted into the RB tree, or
2. If a node is found but the buffer in that node is a subset of
the new user buffer, the node is extended with the new buffer
pages.
Both modes of operation require (re-)insertion into the interval RB
tree.
When the node being inserted is a new node, the operations are pretty
simple. However, when the node is already existing and is being
extended, special care must be taken.
First, we want to guard against an asynchronous attempt to
delete the node by the MMU invalidation notifier. The simplest way to
do this is to remove the node from the RB tree, preventing the search
algorithm from finding it.
Second, the node needs to be re-inserted so it lands in the proper place
in the tree and the tree is correctly re-balanced. This also requires
the node to be removed from the RB tree.
This commit adds the hfi1_mmu_rb_extract() function, which will search
for a node in the interval RB tree matching an address and length and
remove it from the RB tree if found. This allows for both of the above
special cases be handled in a single step.
Reviewed-by: Dean Luick <dean.luick@intel.com>
Signed-off-by: Mitko Haralanov <mitko.haralanov@intel.com>
Signed-off-by: Dennis Dalessandro <dennis.dalessandro@intel.com>
Signed-off-by: Doug Ledford <dledford@redhat.com>
2016-04-13 00:46:47 +07:00
|
|
|
struct mmu_rb_node *hfi1_mmu_rb_extract(struct rb_root *, unsigned long,
|
|
|
|
unsigned long);
|
2016-03-09 02:14:20 +07:00
|
|
|
|
|
|
|
#endif /* _HFI1_MMU_RB_H */
|