summaryrefslogtreecommitdiffstats
path: root/lib/prio_tree.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/prio_tree.c')
-rw-r--r--lib/prio_tree.c19
1 files changed, 2 insertions, 17 deletions
diff --git a/lib/prio_tree.c b/lib/prio_tree.c
index 4e0d2edff2b4..bba37148c15e 100644
--- a/lib/prio_tree.c
+++ b/lib/prio_tree.c
@@ -44,27 +44,12 @@
44 * The following macros are used for implementing prio_tree for i_mmap 44 * The following macros are used for implementing prio_tree for i_mmap
45 */ 45 */
46 46
47#define RADIX_INDEX(vma) ((vma)->vm_pgoff)
48#define VMA_SIZE(vma) (((vma)->vm_end - (vma)->vm_start) >> PAGE_SHIFT)
49/* avoid overflow */
50#define HEAP_INDEX(vma) ((vma)->vm_pgoff + (VMA_SIZE(vma) - 1))
51
52
53static void get_index(const struct prio_tree_root *root, 47static void get_index(const struct prio_tree_root *root,
54 const struct prio_tree_node *node, 48 const struct prio_tree_node *node,
55 unsigned long *radix, unsigned long *heap) 49 unsigned long *radix, unsigned long *heap)
56{ 50{
57 if (root->raw) { 51 *radix = node->start;
58 struct vm_area_struct *vma = prio_tree_entry( 52 *heap = node->last;
59 node, struct vm_area_struct, shared.prio_tree_node);
60
61 *radix = RADIX_INDEX(vma);
62 *heap = HEAP_INDEX(vma);
63 }
64 else {
65 *radix = node->start;
66 *heap = node->last;
67 }
68} 53}
69 54
70static unsigned long index_bits_to_maxindex[BITS_PER_LONG]; 55static unsigned long index_bits_to_maxindex[BITS_PER_LONG];