Home
last modified time | relevance | path

Searched refs:treemap (Results 1 – 2 of 2) sorted by relevance

/utopia/UTPA2-700.0.x/modules/msos/msos/ucos/
H A Ddlmalloc.c2028 binmap_t treemap; member
2310 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2311 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2312 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
2713 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
3724 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
3769 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4168 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4178 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
4579 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
/utopia/UTPA2-700.0.x/modules/msos/msos/linux/
H A Ddlmalloc.c2538 binmap_t treemap; member
2872 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2873 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2874 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3297 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
4321 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4366 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4773 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4783 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
5209 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mstar_mspace_malloc()
[all …]