Lines Matching refs:right
82 struct hilite_node *right;
428 * If we don't find the right node within a small
462 if (n->right != NULL)
464 n = n->right;
536 * we're filtered right to the beginning, otherwise just return pos.
655 struct hilite_node *nr = n->right;
656 struct hilite_node *nrl = n->right->left;
663 np->right = nr;
669 n->right = nrl;
678 * Rotate the tree right around a pivot node.
684 struct hilite_node *nlr = n->left->right;
688 if (n == np->right)
689 np->right = nl;
696 nl->right = n;
752 if (p->right != NULL)
754 p = p->right;
761 * Now we're at the right leaf, again check for contiguous ranges
800 p->right = n = hlist_getnode(anchor);
814 * The tree is in the correct order and covers the right ranges
843 u = n->parent->parent->right;
860 if (n == n->parent->right &&
866 n->parent == n->parent->parent->right)
869 n = n->right;