Lines Matching full:child
1796 | Pointer to left child (child[0]) |
1798 | Pointer to right child (child[1]) |
1835 the tree. Unlike a usual binary tree, where we follow left child
1836 pointers until we reach a null, here we follow the right child
1838 both child pointers null. The smallest chunk in the tree will be
1855 struct malloc_tree_chunk* child[2];
1865 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
2667 assert(u->child[0] == 0);
2668 assert(u->child[1] == 0);
2674 assert (u->parent->child[0] == u ||
2675 u->parent->child[1] == u ||
2677 if (u->child[0] != 0) {
2678 assert(u->child[0]->parent == u);
2679 assert(u->child[0] != u);
2680 do_check_tree(m, u->child[0]);
2682 if (u->child[1] != 0) {
2683 assert(u->child[1]->parent == u);
2684 assert(u->child[1] != u);
2685 do_check_tree(m, u->child[1]);
2687 if (u->child[0] != 0 && u->child[1] != 0) {
2688 assert(chunksize(u->child[0]) < chunksize(u->child[1]));
2752 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
2991 X->child[0] = X->child[1] = 0;\
3003 tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3069 if (((R = *(RP = &(X->child[1]))) != 0) ||\
3070 ((R = *(RP = &(X->child[0]))) != 0)) {\
3072 while ((*(CP = &(R->child[1])) != 0) ||\
3073 (*(CP = &(R->child[0])) != 0)) {\
3090 if (XP->child[0] == X) \
3091 XP->child[0] = R;\
3093 XP->child[1] = R;\
3101 if ((C0 = X->child[0]) != 0) {\
3103 R->child[0] = C0;\
3109 if ((C1 = X->child[1]) != 0) {\
3111 R->child[1] = C1;\
3688 rt = t->child[1];
3689 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
