2421 typedef struct malloc_tree_chunk* tchunkptr;  typedef
2829 static void   do_check_tree(mstate m, tchunkptr t);
3313 static void do_check_tree(mstate m, tchunkptr t) {  in do_check_tree()
3314   tchunkptr head = 0;  in do_check_tree()
3315   tchunkptr u = t;  in do_check_tree()
3366   tchunkptr t = *tb;  in do_check_treebin()
3416       tchunkptr t = *treebin_at(m, tidx);  in bin_find()
3423         tchunkptr u = t;  in bin_find()
3425           if (u == (tchunkptr)x)  in bin_find()
3670     X->parent = (tchunkptr)H;\
3674     tchunkptr T = *H;\
3678         tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3694         tchunkptr F = T->fd;\
3729   tchunkptr XP = X->parent;\
3730   tchunkptr R;\
3732     tchunkptr F = X->fd;\
3743     tchunkptr* RP;\
3746       tchunkptr* CP;\
3774         tchunkptr C0, C1;\
3803   else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }
3807   else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }
4275         tchunkptr tp = (tchunkptr)p;  in release_unused_segments()
4447   tchunkptr v = 0;  in tmalloc_large()
4449   tchunkptr t;  in tmalloc_large()
4455     tchunkptr rst = 0;  /* The deepest untaken right subtree */  in tmalloc_large()
4457       tchunkptr rt;  in tmalloc_large()
4518   tchunkptr t, v;  in tmalloc_small()
4791             tchunkptr tp = (tchunkptr)p;  in dlfree()
5733             tchunkptr tp = (tchunkptr)p;  in mspace_free()