Lines Matching refs:treemap
2522 treebins ("treemap). Each bin sets its bit when non-empty, and
2581 binmap_t treemap;
2924 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2925 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2926 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3369 int empty = (m->treemap & (1U << i)) == 0;
3943 m->smallmap = m->treemap = 0;
4488 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap;
4533 binmap_t leastbit = least_bit(m->treemap);
4646 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) {
4656 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) {
5594 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) {
5604 if (ms->treemap != 0 && (mem = tmalloc_large(ms, nb)) != 0) {
