Home
last modified time | relevance | path

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

/external/llvm/test/CodeGen/X86/
Dinlineasm-sched-bug.ll6 define i32 @foo(i32 %treemap) nounwind uwtable {
8 %sub = sub i32 0, %treemap
9 %and = and i32 %treemap, %sub
/external/libffi/src/
Ddlmalloc.c2014 binmap_t treemap; member
2296 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2297 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2298 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
2690 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
3691 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
3736 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4135 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4145 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
4542 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
/external/qemu/distrib/sdl-1.2.15/src/stdlib/
DSDL_malloc.c2024 binmap_t treemap; member
2306 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2307 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2308 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
2700 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
3701 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
3746 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4145 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4155 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
4552 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
/external/eigen/unsupported/test/mpreal/
Ddlmalloc.c2449 binmap_t treemap; member
2782 #define mark_treemap(M,i) ((M)->treemap |= idx2bit(i))
2783 #define clear_treemap(M,i) ((M)->treemap &= ~idx2bit(i))
2784 #define treemap_is_marked(M,i) ((M)->treemap & idx2bit(i))
3202 int empty = (m->treemap & (1U << i)) == 0; in do_check_treebin()
4219 binmap_t leftbits = left_bits(idx2bit(idx)) & m->treemap; in tmalloc_large()
4264 binmap_t leastbit = least_bit(m->treemap); in tmalloc_small()
4671 else if (gm->treemap != 0 && (mem = tmalloc_small(gm, nb)) != 0) { in dlmalloc()
4681 if (gm->treemap != 0 && (mem = tmalloc_large(gm, nb)) != 0) { in dlmalloc()
5106 else if (ms->treemap != 0 && (mem = tmalloc_small(ms, nb)) != 0) { in mspace_malloc()
[all …]
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
DTreeMapTest.java354 TreeMap<String, String> treemap = new TreeMap<String, String>(c); in test_headMapLjava_lang_Object() local
355 assertEquals(0, treemap.headMap(null).size()); in test_headMapLjava_lang_Object()
357 treemap = new TreeMap(); in test_headMapLjava_lang_Object()
358 SortedMap<String, String> headMap = treemap.headMap("100"); in test_headMapLjava_lang_Object()
/external/webkit/Tools/
DChangeLog5789 [test dashboard] pull treemap files