/dalvik/vm/alloc/TEST/HeapBitmapTest/ |
main.c | 13 #define HEAP_SIZE (5 * PAGE_SIZE + 888) 30 ok = dvmHeapBitmapInit(&hb, HEAP_BASE, HEAP_SIZE, "test"); 34 assert(hb.bitsLen >= HB_OFFSET_TO_INDEX(HEAP_SIZE)); 81 assert(hb->bitsLen >= HB_OFFSET_TO_INDEX(HEAP_SIZE)); 92 HEAP_BASE + HEAP_SIZE - HB_OBJECT_ALIGNMENT)); 94 HEAP_BASE + HEAP_SIZE)); 101 HEAP_BASE + HEAP_SIZE - HB_OBJECT_ALIGNMENT)); 110 ok = dvmHeapBitmapInit(&hb, HEAP_BASE, HEAP_SIZE, "test"); 123 HEAP_BASE + HEAP_SIZE - HB_OBJECT_ALIGNMENT)); 125 HEAP_BASE + HEAP_SIZE)); [all...] |
/external/compiler-rt/lib/tsan/lit_tests/ |
java.h | 8 void __tsan_java_init(jptr heap_begin, jptr heap_size);
|
/external/compiler-rt/lib/tsan/rtl/ |
tsan_interface_java.cc | 59 const uptr heap_size; member in struct:__tsan::JavaContext 62 JavaContext(jptr heap_begin, jptr heap_size) 64 , heap_size(heap_size) { 65 uptr size = heap_size / kHeapAlignment * sizeof(BlockDesc); 107 CHECK_LT(p, jctx->heap_begin + jctx->heap_size); 123 || addr >= jctx->heap_begin + jctx->heap_size) 165 void __tsan_java_init(jptr heap_begin, jptr heap_size) { 167 DPrintf("#%d: java_init(%p, %p)\n", thr->tid, heap_begin, heap_size); 170 CHECK_GT(heap_size, 0) [all...] |
tsan_interface_java.h | 38 void __tsan_java_init(jptr heap_begin, jptr heap_size) INTERFACE_ATTRIBUTE;
|
/bionic/libc/upstream-netbsd/libc/include/isc/ |
heap.h | 27 int heap_size; member in struct:heap_context
|
/external/llvm/test/Transforms/LoopStrengthReduce/ |
2009-01-13-nonconstant-stride-outside-loop.ll | 10 @heap_size = external global i32 ; <i32*> [#uses=1] 34 %3 = load i32* @heap_size, align 4 ; <i32> [#uses=1]
|
/development/tools/idegen/templates/idea/ |
misc.xml | 35 <option name="HEAP_SIZE" />
|
/external/robolectric/.idea/ |
misc.xml | 29 <option name="HEAP_SIZE" />
|
/external/qemu/distrib/zlib-1.2.3/ |
deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
trees.c | 514 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 549 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 634 s->heap_len = 0, s->heap_max = HEAP_SIZE; [all...] |
/external/zlib/src/ |
deflate.h | 45 #define HEAP_SIZE (2*L_CODES+1) 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
|
trees.c | 512 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { 547 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all 632 s->heap_len = 0, s->heap_max = HEAP_SIZE; [all...] |
/development/tools/idegen/templates/ |
android.ipr | 139 <option name="HEAP_SIZE" />
|
/development/tools/idegen/ |
idegen.ipr | 153 <option name="HEAP_SIZE" />
|
/frameworks/base/tools/preload/ |
preload.ipr | 219 <option name="HEAP_SIZE" />
|
/external/webkit/Source/JavaScriptCore/wtf/ |
FastMalloc.cpp | [all...] |