2406 typedef struct malloc_tree_chunk* tchunkptr;  typedef
2814 static void   do_check_tree(mstate m, tchunkptr t);
3315 static void do_check_tree(mstate m, tchunkptr t) {  in do_check_tree()
3316   tchunkptr head = 0;  in do_check_tree()
3317   tchunkptr u = t;  in do_check_tree()
3368   tchunkptr t = *tb;  in do_check_treebin()
3418       tchunkptr t = *treebin_at(m, tidx);  in bin_find()
3425         tchunkptr u = t;  in bin_find()
3427           if (u == (tchunkptr)x)  in bin_find()
3674     X->parent = (tchunkptr)H;\
3678     tchunkptr T = *H;\
3682         tchunkptr* C = &(T->child[(K >> (SIZE_T_BITSIZE-SIZE_T_ONE)) & 1]);\
3698         tchunkptr F = T->fd;\
3733   tchunkptr XP = X->parent;\
3734   tchunkptr R;\
3736     tchunkptr F = X->fd;\
3747     tchunkptr* RP;\
3750       tchunkptr* CP;\
3778         tchunkptr C0, C1;\
3807   else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }
3811   else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); }
4287         tchunkptr tp = (tchunkptr)p;  in release_unused_segments()
4459   tchunkptr v = 0;  in tmalloc_large()
4461   tchunkptr t;  in tmalloc_large()
4467     tchunkptr rst = 0;  /* The deepest untaken right subtree */  in tmalloc_large()
4469       tchunkptr rt;  in tmalloc_large()
4530   tchunkptr t, v;  in tmalloc_small()
4795             tchunkptr tp = (tchunkptr)p;  in dlfree()
5736             tchunkptr tp = (tchunkptr)p;  in mspace_free()