[linux-2.6-block.git] / mm / interval_tree.c

// SPDX-License-Identifier: GPL-2.0-only
/*
 * mm/interval_tree.c - interval tree for mapping->i_mmap
 *
 * Copyright (C) 2012, Michel Lespinasse <walken@google.com>
 */

#include <linux/mm.h>
#include <linux/fs.h>
#include <linux/rmap.h>
#include <linux/interval_tree_generic.h>

static inline unsigned long vma_start_pgoff(struct vm_area_struct *v)
{
	return v->vm_pgoff;
}

static inline unsigned long vma_last_pgoff(struct vm_area_struct *v)
{
	return v->vm_pgoff + vma_pages(v) - 1;
}

INTERVAL_TREE_DEFINE(struct vm_area_struct, shared.rb,
		     unsigned long, shared.rb_subtree_last,
		     vma_start_pgoff, vma_last_pgoff,, vma_interval_tree)

/* Insert node immediately after prev in the interval tree */
void vma_interval_tree_insert_after(struct vm_area_struct *node,
				    struct vm_area_struct *prev,
				    struct rb_root_cached *root)
{
	struct rb_node **link;
	struct vm_area_struct *parent;
	unsigned long last = vma_last_pgoff(node);

	VM_BUG_ON_VMA(vma_start_pgoff(node) != vma_start_pgoff(prev), node);

	if (!prev->shared.rb.rb_right) {
		parent = prev;
		link = &prev->shared.rb.rb_right;
	} else {
		parent = rb_entry(prev->shared.rb.rb_right,
				  struct vm_area_struct, shared.rb);
		if (parent->shared.rb_subtree_last < last)
			parent->shared.rb_subtree_last = last;
		while (parent->shared.rb.rb_left) {
			parent = rb_entry(parent->shared.rb.rb_left,
				struct vm_area_struct, shared.rb);
			if (parent->shared.rb_subtree_last < last)
				parent->shared.rb_subtree_last = last;
		}
		link = &parent->shared.rb.rb_left;
	}

	node->shared.rb_subtree_last = last;
	rb_link_node(&node->shared.rb, &parent->shared.rb, link);
	rb_insert_augmented(&node->shared.rb, &root->rb_root,
			    &vma_interval_tree_augment);
}

static inline unsigned long avc_start_pgoff(struct anon_vma_chain *avc)
{
	return vma_start_pgoff(avc->vma);
}

static inline unsigned long avc_last_pgoff(struct anon_vma_chain *avc)
{
	return vma_last_pgoff(avc->vma);
}

INTERVAL_TREE_DEFINE(struct anon_vma_chain, rb, unsigned long, rb_subtree_last,
		     avc_start_pgoff, avc_last_pgoff,
		     static inline, __anon_vma_interval_tree)

void anon_vma_interval_tree_insert(struct anon_vma_chain *node,
				   struct rb_root_cached *root)
{
#ifdef CONFIG_DEBUG_VM_RB
	node->cached_vma_start = avc_start_pgoff(node);
	node->cached_vma_last = avc_last_pgoff(node);
#endif
	__anon_vma_interval_tree_insert(node, root);
}

void anon_vma_interval_tree_remove(struct anon_vma_chain *node,
				   struct rb_root_cached *root)
{
	__anon_vma_interval_tree_remove(node, root);
}

struct anon_vma_chain *
anon_vma_interval_tree_iter_first(struct rb_root_cached *root,
				  unsigned long first, unsigned long last)
{
	return __anon_vma_interval_tree_iter_first(root, first, last);
}

struct anon_vma_chain *
anon_vma_interval_tree_iter_next(struct anon_vma_chain *node,
				 unsigned long first, unsigned long last)
{
	return __anon_vma_interval_tree_iter_next(node, first, last);
}

#ifdef CONFIG_DEBUG_VM_RB
void anon_vma_interval_tree_verify(struct anon_vma_chain *node)
{
	WARN_ON_ONCE(node->cached_vma_start != avc_start_pgoff(node));
	WARN_ON_ONCE(node->cached_vma_last != avc_last_pgoff(node));
}
#endif
Commit	Line	Data
8092f73c	1	// SPDX-License-Identifier: GPL-2.0-only
6b2dbba8 ML	2	/*
	3	* mm/interval_tree.c - interval tree for mapping->i_mmap
	4	*
	5	* Copyright (C) 2012, Michel Lespinasse <walken@google.com>
6b2dbba8 ML	6	*/
	7
	8	#include <linux/mm.h>
	9	#include <linux/fs.h>
bf181b9f	10	#include <linux/rmap.h>
9826a516	11	#include <linux/interval_tree_generic.h>
6b2dbba8	12
9826a516 ML	13	static inline unsigned long vma_start_pgoff(struct vm_area_struct *v)
	14	{
	15	return v->vm_pgoff;
	16	}
	17
	18	static inline unsigned long vma_last_pgoff(struct vm_area_struct *v)
	19	{
e025f059	20	return v->vm_pgoff + vma_pages(v) - 1;
9826a516 ML	21	}
9826a516 ML	22
ac51b934 KS	23	INTERVAL_TREE_DEFINE(struct vm_area_struct, shared.rb,
ac51b934 KS	24	unsigned long, shared.rb_subtree_last,
9826a516 ML	25	vma_start_pgoff, vma_last_pgoff,, vma_interval_tree)
	26
	27	/* Insert node immediately after prev in the interval tree */
	28	void vma_interval_tree_insert_after(struct vm_area_struct *node,
	29	struct vm_area_struct *prev,
f808c13f	30	struct rb_root_cached *root)
6b2dbba8 ML	31	{
	32	struct rb_node **link;
	33	struct vm_area_struct *parent;
9826a516	34	unsigned long last = vma_last_pgoff(node);
6b2dbba8	35
81d1b09c	36	VM_BUG_ON_VMA(vma_start_pgoff(node) != vma_start_pgoff(prev), node);
6b2dbba8	37
ac51b934	38	if (!prev->shared.rb.rb_right) {
9826a516	39	parent = prev;
ac51b934	40	link = &prev->shared.rb.rb_right;
6b2dbba8	41	} else {
ac51b934 KS	42	parent = rb_entry(prev->shared.rb.rb_right,
	43	struct vm_area_struct, shared.rb);
	44	if (parent->shared.rb_subtree_last < last)
	45	parent->shared.rb_subtree_last = last;
	46	while (parent->shared.rb.rb_left) {
	47	parent = rb_entry(parent->shared.rb.rb_left,
	48	struct vm_area_struct, shared.rb);
	49	if (parent->shared.rb_subtree_last < last)
	50	parent->shared.rb_subtree_last = last;
6b2dbba8	51	}
ac51b934	52	link = &parent->shared.rb.rb_left;
6b2dbba8 ML	53	}
6b2dbba8 ML	54
ac51b934 KS	55	node->shared.rb_subtree_last = last;
ac51b934 KS	56	rb_link_node(&node->shared.rb, &parent->shared.rb, link);
f808c13f	57	rb_insert_augmented(&node->shared.rb, &root->rb_root,
9826a516	58	&vma_interval_tree_augment);
6b2dbba8	59	}
bf181b9f ML	60
	61	static inline unsigned long avc_start_pgoff(struct anon_vma_chain *avc)
	62	{
	63	return vma_start_pgoff(avc->vma);
	64	}
	65
	66	static inline unsigned long avc_last_pgoff(struct anon_vma_chain *avc)
	67	{
	68	return vma_last_pgoff(avc->vma);
	69	}
	70
	71	INTERVAL_TREE_DEFINE(struct anon_vma_chain, rb, unsigned long, rb_subtree_last,
ed8ea815 ML	72	avc_start_pgoff, avc_last_pgoff,
	73	static inline, __anon_vma_interval_tree)
	74
	75	void anon_vma_interval_tree_insert(struct anon_vma_chain *node,
f808c13f	76	struct rb_root_cached *root)
ed8ea815 ML	77	{
	78	#ifdef CONFIG_DEBUG_VM_RB
	79	node->cached_vma_start = avc_start_pgoff(node);
	80	node->cached_vma_last = avc_last_pgoff(node);
	81	#endif
	82	__anon_vma_interval_tree_insert(node, root);
	83	}
	84
	85	void anon_vma_interval_tree_remove(struct anon_vma_chain *node,
f808c13f	86	struct rb_root_cached *root)
ed8ea815 ML	87	{
	88	__anon_vma_interval_tree_remove(node, root);
	89	}
	90
	91	struct anon_vma_chain *
f808c13f	92	anon_vma_interval_tree_iter_first(struct rb_root_cached *root,
ed8ea815 ML	93	unsigned long first, unsigned long last)
	94	{
	95	return __anon_vma_interval_tree_iter_first(root, first, last);
	96	}
	97
	98	struct anon_vma_chain *
	99	anon_vma_interval_tree_iter_next(struct anon_vma_chain *node,
	100	unsigned long first, unsigned long last)
	101	{
	102	return __anon_vma_interval_tree_iter_next(node, first, last);
	103	}
	104
	105	#ifdef CONFIG_DEBUG_VM_RB
	106	void anon_vma_interval_tree_verify(struct anon_vma_chain *node)
	107	{
	108	WARN_ON_ONCE(node->cached_vma_start != avc_start_pgoff(node));
	109	WARN_ON_ONCE(node->cached_vma_last != avc_last_pgoff(node));
	110	}
	111	#endif