Lines Matching refs:left
863 if ((y = root->left) == NULL)
867 root->left = y->right;
870 if ((y = root->left) == NULL)
874 righttreemin->left = root;
880 /* Rotate left. */
881 root->right = y->left;
882 y->left = root;
887 /* Link into the new root's left tree. */
894 lefttreemax->right = root->left;
895 righttreemin->left = root->right;
896 root->left = dummy.right;
897 root->right = dummy.left;
928 m->left = NULL;
934 m->left = root->left;
936 root->left = NULL;
942 m->left = root;
996 if ((next = TAILQ_NEXT(m, listq)) != NULL && next->left == m) {
1001 next->left = m->left;
1008 * in the tree, its left subtree must be empty.
1010 KASSERT(m->left == NULL,
1011 ("vm_page_remove: page %p has left child", m));
1016 if (m->left == NULL)
1019 root = m->left;
1027 next->left = m->left;
1184 m_next->left = m;
1201 object->cache = m->left;
1205 m_next->left = m->left;
1266 if (m->left == NULL)
1269 root = m->left;
1271 root = vm_page_splay(m->pindex, m->left);
1318 orig_object->cache = m->left;
1320 m->left = NULL;
1330 new_object->cache = m->left;
1331 m->left = orig_object->cache;
1342 m_next->left = m;
2373 if ((next = TAILQ_NEXT(m, listq)) != NULL && next->left == m) {
2378 next->left = m->left;
2385 * in the tree, its left subtree must be empty.
2387 KASSERT(m->left == NULL,
2388 ("vm_page_cache: page %p has left child", m));
2393 if (m->left == NULL)
2396 root = m->left;
2404 next->left = m->left;
2428 m->left = NULL;
2433 m->left = root->left;
2435 root->left = NULL;
2440 m->left = root;