Searched refs:treemap (Results 1 – 1 of 1) sorted by relevance
2596 binmap_t treemap; member2937 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))2938 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))2939 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))3367 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()3939 m->smallmap = m->treemap = 0; in reset_on_error()4476 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()4521 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()4634 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()4644 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()[all …]