Lines Matching refs:child
2456 struct malloc_tree_chunk* child[2]; member
2466 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
3375 assert(u->child[0] == 0); in do_check_tree()
3376 assert(u->child[1] == 0); in do_check_tree()
3382 assert (u->parent->child[0] == u || in do_check_tree()
3383 u->parent->child[1] == u || in do_check_tree()
3385 if (u->child[0] != 0) { in do_check_tree()
3386 assert(u->child[0]->parent == u); in do_check_tree()
3387 assert(u->child[0] != u); in do_check_tree()
3388 do_check_tree(m, u->child[0]); in do_check_tree()
3390 if (u->child[1] != 0) { in do_check_tree()
3391 assert(u->child[1]->parent == u); in do_check_tree()
3392 assert(u->child[1] != u); in do_check_tree()
3393 do_check_tree(m, u->child[1]); in do_check_tree()
3395 if (u->child[0] != 0 && u->child[1] != 0) { in do_check_tree()
3396 assert(chunksize(u->child[0]) < chunksize(u->child[1])); in do_check_tree()
3460 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; in bin_find()
3707 X->child[0] = X->child[1] = 0;\
3719 tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3785 if (((R = *(RP = &(X->child[1]))) != 0) ||\
3786 ((R = *(RP = &(X->child[0]))) != 0)) {\
3788 while ((*(CP = &(R->child[1])) != 0) ||\
3789 (*(CP = &(R->child[0])) != 0)) {\
3806 if (XP->child[0] == X) \
3807 XP->child[0] = R;\
3809 XP->child[1] = R;\
3817 if ((C0 = X->child[0]) != 0) {\
3819 R->child[0] = C0;\
3825 if ((C1 = X->child[1]) != 0) {\
3827 R->child[1] = C1;\
4505 rt = t->child[1]; in tmalloc_large()
4506 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]; in tmalloc_large()