libffi/src/dlmalloc.c

1807             |             Pointer to left child (child[0])                  |
1809             |             Pointer to right child (child[1])                 |
1846   the tree.  Unlike a usual binary tree, where we follow left child
1847   pointers until we reach a null, here we follow the right child
1849   both child pointers null. The smallest chunk in the tree will be
1866   struct malloc_tree_chunk* child[2];
1876 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
2719       assert(u->child[0] == 0);
2720       assert(u->child[1] == 0);
2726       assert (u->parent->child[0] == u ||
2727               u->parent->child[1] == u ||
2729       if (u->child[0] != 0) {
2730         assert(u->child[0]->parent == u);
2731         assert(u->child[0] != u);
2732         do_check_tree(m, u->child[0]);
2734       if (u->child[1] != 0) {
2735         assert(u->child[1]->parent == u);
2736         assert(u->child[1] != u);
2737         do_check_tree(m, u->child[1]);
2739       if (u->child[0] != 0 && u->child[1] != 0) {
2740         assert(chunksize(u->child[0]) < chunksize(u->child[1]));
2804         t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
3041   X->child[0] = X->child[1] = 0;\
3053         tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3119     if (((R = *(RP = &(X->child[1]))) != 0) ||\
3120         ((R = *(RP = &(X->child[0]))) != 0)) {\
3122       while ((*(CP = &(R->child[1])) != 0) ||\
3123              (*(CP = &(R->child[0])) != 0)) {\
3140       if (XP->child[0] == X) \
3141         XP->child[0] = R;\
3143         XP->child[1] = R;\
3151         if ((C0 = X->child[0]) != 0) {\
3153             R->child[0] = C0;\
3159         if ((C1 = X->child[1]) != 0) {\
3161             R->child[1] = C1;\
3740       rt = t->child[1];
3741       t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];