2415   struct malloc_tree_chunk* child[2];  member
2425 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
3334       assert(u->child[0] == 0);  in do_check_tree()
3335       assert(u->child[1] == 0);  in do_check_tree()
3341       assert (u->parent->child[0] == u ||  in do_check_tree()
3342               u->parent->child[1] == u ||  in do_check_tree()
3344       if (u->child[0] != 0) {  in do_check_tree()
3345         assert(u->child[0]->parent == u);  in do_check_tree()
3346         assert(u->child[0] != u);  in do_check_tree()
3347         do_check_tree(m, u->child[0]);  in do_check_tree()
3349       if (u->child[1] != 0) {  in do_check_tree()
3350         assert(u->child[1]->parent == u);  in do_check_tree()
3351         assert(u->child[1] != u);  in do_check_tree()
3352         do_check_tree(m, u->child[1]);  in do_check_tree()
3354       if (u->child[0] != 0 && u->child[1] != 0) {  in do_check_tree()
3355         assert(chunksize(u->child[0]) < chunksize(u->child[1]));  in do_check_tree()
3419         t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];  in bin_find()
3666   X->child[0] = X->child[1] = 0;\
3678         tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3744     if (((R = *(RP = &(X->child[1]))) != 0) ||\
3745         ((R = *(RP = &(X->child[0]))) != 0)) {\
3747       while ((*(CP = &(R->child[1])) != 0) ||\
3748              (*(CP = &(R->child[0])) != 0)) {\
3765       if (XP->child[0] == X) \
3766         XP->child[0] = R;\
3768         XP->child[1] = R;\
3776         if ((C0 = X->child[0]) != 0) {\
3778             R->child[0] = C0;\
3784         if ((C1 = X->child[1]) != 0) {\
3786             R->child[1] = C1;\
4464       rt = t->child[1];  in tmalloc_large()
4465       t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];  in tmalloc_large()