Searched refs:treemap (Results 1 – 7 of 7) sorted by relevance
| /external/llvm/test/CodeGen/X86/ |
| D | inlineasm-sched-bug.ll | 6 define i32 @foo(i32 %treemap) nounwind uwtable {
8 %sub = sub i32 0, %treemap
9 %and = and i32 %treemap, %sub
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
| D | inlineasm-sched-bug.ll | 6 define i32 @foo(i32 %treemap) nounwind uwtable {
8 %sub = sub i32 0, %treemap
9 %and = and i32 %treemap, %sub
|
| /external/swiftshader/third_party/subzero/bloat/ |
| D | README.chromium | 19 Name: Webtreemap - Web-based treemap
30 A simple treemap implementation using web technologies (DOM nodes, CSS
|
| /external/python/cpython2/Modules/_ctypes/libffi/src/ |
| D | dlmalloc.c | 2076 binmap_t treemap; member
2358 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2359 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2360 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
2757 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
3758 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
3803 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4202 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4212 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
4609 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
|
| /external/libffi/src/ |
| D | dlmalloc.c | 2071 binmap_t treemap; member
2353 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2354 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2355 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
2752 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
3753 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
3798 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4197 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4207 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
4604 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
|
| /external/dlmalloc/ |
| D | malloc.c | 2581 binmap_t treemap; member
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; in do_check_treebin()
3943 m->smallmap = m->treemap = 0; in reset_on_error()
4488 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4533 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4646 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4656 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
[all …]
|
| /external/libtextclassifier/ |
| D | Android.bp | 59 // For debug / treemap purposes.
|