Lines Matching refs:left
80 /* traverse to left-most child, count black nodes */
83 while (n && n->left) {
86 n = n->left;
111 assert(!n->left || c_rbnode_parent(n->left) == n);
119 assert(!n->left || c_rbnode_is_black(n->left));
127 if (!n->left && !n->right)
136 while (n->left) {
137 n = n->left;
149 if (p && c_rbnode_is_black(p->left))
169 i = &(*i)->left;