3320   bindex_t idx;  in do_check_tree()  local
3321   compute_tree_index(tsize, idx);  in do_check_tree()
3322   assert(tindex == idx);  in do_check_tree()
3324   assert(tsize >= minsize_for_tree_index(idx));  in do_check_tree()
3325   assert((idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1))));  in do_check_tree()
4462   bindex_t idx;  in tmalloc_large()  local
4463   compute_tree_index(nb, idx);  in tmalloc_large()
4464   if ((t = *treebin_at(m, idx)) != 0) {  in tmalloc_large()
4466     size_t sizebits = nb << leftshift_for_tree_index(idx);  in tmalloc_large()
4488     binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;  in tmalloc_large()
4600       bindex_t idx;  in dlmalloc()  local
4603       idx = small_index(nb);  in dlmalloc()
4604       smallbits = gm->smallmap >> idx;  in dlmalloc()
4608         idx += ~smallbits & 1;       /* Uses next bin if idx empty */  in dlmalloc()
4609         b = smallbin_at(gm, idx);  in dlmalloc()
4611         assert(chunksize(p) == small_index2size(idx));  in dlmalloc()
4612         unlink_first_small_chunk(gm, b, p, idx);  in dlmalloc()
4613         set_inuse_and_pinuse(gm, p, small_index2size(idx));  in dlmalloc()
4624           binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));  in dlmalloc()
5543       bindex_t idx;  in mspace_malloc()  local
5546       idx = small_index(nb);  in mspace_malloc()
5547       smallbits = ms->smallmap >> idx;  in mspace_malloc()
5551         idx += ~smallbits & 1;       /* Uses next bin if idx empty */  in mspace_malloc()
5552         b = smallbin_at(ms, idx);  in mspace_malloc()
5554         assert(chunksize(p) == small_index2size(idx));  in mspace_malloc()
5555         unlink_first_small_chunk(ms, b, p, idx);  in mspace_malloc()
5556         set_inuse_and_pinuse(ms, p, small_index2size(idx));  in mspace_malloc()
5567           binmap_t leftbits = (smallbits << idx) & left_bits(idx2bit(idx));  in mspace_malloc()