Lines Matching refs:child
283 to initialize child lock while holding parent lock. The implementation
2341 | Pointer to left child (child[0]) |
2343 | Pointer to right child (child[1]) |
2380 the tree. Unlike a usual binary tree, where we follow left child
2381 child
2383 both child pointers null. The smallest chunk in the tree will be
2400 struct malloc_tree_chunk* child[2];
2410 #define leftmost_child(t) ((t)->child[0] != 0? (t)->child[0] : (t)->child[1])
3336 assert(u->child[0] == 0);
3337 assert(u->child[1] == 0);
3343 assert (u->parent->child[0] == u ||
3344 child[1] == u ||
3346 if (u->child[0] != 0) {
3347 assert(u->child[0]->parent == u);
3348 assert(u->child[0] != u);
3349 do_check_tree(m, u->child[0]);
3351 if (u->child[1] != 0) {
3352 assert(u->child[1]->parent == u);
3353 assert(u->child[1] != u);
3354 do_check_tree(m, u->child[1]);
3356 if (u->child[0] != 0 && u->child[1] != 0) {
3357 assert(chunksize(u->child[0]) < chunksize(u->child[1]));
3421 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
3670 X->child[0] = X->child[1] = 0;\
3682 tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3748 if (((R = *(RP = &(X->child[1]))) != 0) ||\
3749 ((R = *(RP = &(X->child[0]))) != 0)) {\
3751 while ((*(CP = &(R->child[1])) != 0) ||\
3752 (*(CP = &(R->child[0])) != 0)) {\
3769 if (XP->child[0] == X) \
3770 XP->child[0] = R;\
3772 XP->child[1] = R;\
3780 if ((C0 = X->child[0]) != 0) {\
3782 R->child[0] = C0;\
3788 if ((C1 = X->child[1]) != 0) {\
3790 R->child[1] = C1;\
4476 rt = t->child[1];
4477 t = t->child[(sizebits >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1];
