aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAlan Cox <alc@FreeBSD.org>2011-11-10 16:50:36 +0000
committerAlan Cox <alc@FreeBSD.org>2011-11-10 16:50:36 +0000
commitc7ebd0a8f693d34d130decbf8251e871eb6da890 (patch)
treebe1c389d483c69a9ac8308e960b1589ca6ed782d
parent8fa246a0fd16272ef910e8d05d06c7aafb018830 (diff)
Notes
-rw-r--r--sys/vm/vm_page.c90
1 files changed, 72 insertions, 18 deletions
diff --git a/sys/vm/vm_page.c b/sys/vm/vm_page.c
index c0b3a703ed71..cde138760c0f 100644
--- a/sys/vm/vm_page.c
+++ b/sys/vm/vm_page.c
@@ -908,7 +908,7 @@ void
vm_page_remove(vm_page_t m)
{
vm_object_t object;
- vm_page_t root;
+ vm_page_t next, prev, root;
if ((m->oflags & VPO_UNMANAGED) == 0)
vm_page_lock_assert(m, MA_OWNED);
@@ -923,15 +923,42 @@ vm_page_remove(vm_page_t m)
/*
* Now remove from the object's list of backed pages.
*/
- if (m != object->root)
- vm_page_splay(m->pindex, object->root);
- if (m->left == NULL)
- root = m->right;
- else {
- root = vm_page_splay(m->pindex, m->left);
- root->right = m->right;
+ if ((next = TAILQ_NEXT(m, listq)) != NULL && next->left == m) {
+ /*
+ * Since the page's successor in the list is also its parent
+ * in the tree, its right subtree must be empty.
+ */
+ next->left = m->left;
+ KASSERT(m->right == NULL,
+ ("vm_page_remove: page %p has right child", m));
+ } else if ((prev = TAILQ_PREV(m, pglist, listq)) != NULL &&
+ prev->right == m) {
+ /*
+ * Since the page's predecessor in the list is also its parent
+ * in the tree, its left subtree must be empty.
+ */
+ KASSERT(m->left == NULL,
+ ("vm_page_remove: page %p has left child", m));
+ prev->right = m->right;
+ } else {
+ if (m != object->root)
+ vm_page_splay(m->pindex, object->root);
+ if (m->left == NULL)
+ root = m->right;
+ else if (m->right == NULL)
+ root = m->left;
+ else {
+ /*
+ * Move the page's successor to the root, because
+ * pages are usually removed in ascending order.
+ */
+ if (m->right != next)
+ vm_page_splay(m->pindex, m->right);
+ next->left = m->left;
+ root = next;
+ }
+ object->root = root;
}
- object->root = root;
TAILQ_REMOVE(&object->memq, m, listq);
/*
@@ -2021,7 +2048,7 @@ void
vm_page_cache(vm_page_t m)
{
vm_object_t object;
- vm_page_t root;
+ vm_page_t next, prev, root;
vm_page_lock_assert(m, MA_OWNED);
object = m->object;
@@ -2056,15 +2083,42 @@ vm_page_cache(vm_page_t m)
* Remove the page from the object's collection of resident
* pages.
*/
- if (m != object->root)
- vm_page_splay(m->pindex, object->root);
- if (m->left == NULL)
- root = m->right;
- else {
- root = vm_page_splay(m->pindex, m->left);
- root->right = m->right;
+ if ((next = TAILQ_NEXT(m, listq)) != NULL && next->left == m) {
+ /*
+ * Since the page's successor in the list is also its parent
+ * in the tree, its right subtree must be empty.
+ */
+ next->left = m->left;
+ KASSERT(m->right == NULL,
+ ("vm_page_cache: page %p has right child", m));
+ } else if ((prev = TAILQ_PREV(m, pglist, listq)) != NULL &&
+ prev->right == m) {
+ /*
+ * Since the page's predecessor in the list is also its parent
+ * in the tree, its left subtree must be empty.
+ */
+ KASSERT(m->left == NULL,
+ ("vm_page_cache: page %p has left child", m));
+ prev->right = m->right;
+ } else {
+ if (m != object->root)
+ vm_page_splay(m->pindex, object->root);
+ if (m->left == NULL)
+ root = m->right;
+ else if (m->right == NULL)
+ root = m->left;
+ else {
+ /*
+ * Move the page's successor to the root, because
+ * pages are usually removed in ascending order.
+ */
+ if (m->right != next)
+ vm_page_splay(m->pindex, m->right);
+ next->left = m->left;
+ root = next;
+ }
+ object->root = root;
}
- object->root = root;
TAILQ_REMOVE(&object->memq, m, listq);
object->resident_page_count--;