Lines Matching defs:curr
869 dnode_t *dict_next(dict_t *dict, dnode_t *curr)
873 if (curr->right != nil) {
874 curr = curr->right;
875 while ((left = curr->left) != nil)
876 curr = left;
877 return curr;
880 parent = curr->parent;
882 while (parent != nil && curr == parent->right) {
883 curr = parent;
884 parent = curr->parent;
894 dnode_t *dict_prev(dict_t *dict, dnode_t *curr)
898 if (curr->left != nil) {
899 curr = curr->left;
900 while ((right = curr->right) != nil)
901 curr = right;
902 return curr;
905 parent = curr->parent;
907 while (parent != nil && curr == parent->left) {
908 curr = parent;
909 parent = curr->parent;
1064 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next;
1077 for (curr = loadnil->left; curr != loadnil; curr = next) {
1078 next = curr->left;
1099 curr->left = dictnil;
1100 curr->right = dictnil;
1101 curr->color = level % 2;
1102 complete = curr;
1112 curr->left = complete;
1113 curr->color = (level + 1) % 2;
1114 complete->parent = curr;
1115 tree[level] = curr;