Lines Matching refs:child

61 // Returns:  true if __x is a left child of its parent, else false
90     // If this is red, neither child can be red
200 // Effects:  Makes __x->__right_ the subtree root with __x as its left child
220 // Effects:  Makes __x->__left_ the subtree root with __x as its right child
243 //                __x == __root or == a direct or indirect child of __root.
313 //                __z == __root or == a direct or indirect child of __root.
324     // __y will have at most one child.
328     // __x is __y's possibly null single child
346         // __y can't be root if it is a right child
381         // Since __y was black and only had one child (which __x points to), __x
393             //     with a non-null black child).
396                 if (!__tree_is_left_child(__w))  // if x is left child
428                     else  // __w has a red child
432                             // __w left child is non-null and red
440                         // __w has a right red child, left child may be null
480                     else  // __w has a red child
484                             // __w right child is non-null and red
492                         // __w has a left red child, right child may be null
1188     // __cache is right child