Lines Matching defs:curr
893 dnode_t *dict_next(dict_t *dict, dnode_t *curr)
897 if (curr->right != nil) {
898 curr = curr->right;
899 while ((left = curr->left) != nil)
900 curr = left;
901 return curr;
904 parent = curr->parent;
906 while (parent != nil && curr == parent->right) {
907 curr = parent;
908 parent = curr->parent;
919 dnode_t *dict_prev(dict_t *dict, dnode_t *curr)
923 if (curr->left != nil) {
924 curr = curr->left;
925 while ((right = curr->right) != nil)
926 curr = right;
927 return curr;
930 parent = curr->parent;
932 while (parent != nil && curr == parent->left) {
933 curr = parent;
934 parent = curr->parent;
1085 dnode_t *curr, *dictnil = dict_nil(dict), *loadnil = &load->nilnode, *next;
1098 for (curr = loadnil->left; curr != loadnil; curr = next) {
1099 next = curr->left;
1120 curr->left = dictnil;
1121 curr->right = dictnil;
1122 curr->color = level % 2;
1123 complete = curr;
1133 curr->left = complete;
1134 curr->color = (level + 1) % 2;
1135 complete->parent = curr;
1136 tree[level] = curr;
