HomeSort by relevance Sort by last modified time
    Searched full:heap_size (Results 1 - 25 of 34) sorted by null

1 2

  /external/compiler-rt/lib/tsan/rtl/
tsan_interface_java.cc 31 const uptr heap_size; member in struct:__tsan::JavaContext
33 JavaContext(jptr heap_begin, jptr heap_size)
35 , heap_size(heap_size) {
69 void __tsan_java_init(jptr heap_begin, jptr heap_size) {
71 DPrintf("#%d: java_init(%p, %p)\n", thr->tid, heap_begin, heap_size);
74 CHECK_GT(heap_size, 0);
76 CHECK_EQ(heap_size % kHeapAlignment, 0);
77 CHECK_LT(heap_begin, heap_begin + heap_size);
78 jctx = new(jctx_buf) JavaContext(heap_begin, heap_size);
    [all...]
tsan_interface_java.h 38 void __tsan_java_init(jptr heap_begin, jptr heap_size) INTERFACE_ATTRIBUTE;
  /external/compiler-rt/test/tsan/
java.h 9 void __tsan_java_init(jptr heap_begin, jptr heap_size);
  /external/libcxxabi/src/
fallback_malloc.ipp 53 #define HEAP_SIZE 512
54 char heap [ HEAP_SIZE ];
57 typedef unsigned short heap_size;
61 heap_size len; // size in units of "sizeof(heap_node)"
64 static const heap_node *list_end = (heap_node *) ( &heap [ HEAP_SIZE ] ); // one past the end of the heap
76 freelist->len = HEAP_SIZE / sizeof (heap_node);
84 { return ptr >= heap && ptr < ( heap + HEAP_SIZE ); }
104 q->len = static_cast<heap_size>(nelems);
174 heap_size total_free = 0;
cxa_vector.cpp 144 const size_t heap_size = element_count * element_size + padding_size; local
145 char * const heap_block = static_cast<char *> ( alloc ( heap_size ));
173 const size_t heap_size = element_count * element_size + padding_size; local
174 char * const heap_block = static_cast<char *> ( alloc ( heap_size ));
178 st_heap_block3 heap ( dealloc, heap_block, heap_size );
  /hardware/intel/img/psb_video/src/
object_heap.c 51 int new_heap_size = heap->heap_size + heap->heap_increment;
59 for (i = new_heap_size; i-- > heap->heap_size;) {
73 for (i = new_heap_size; i-- > heap->heap_size;) {
82 heap->heap_size = new_heap_size;
93 heap->heap_size = 0;
127 if ((id < heap->id_offset) || (id > (heap->heap_size + heap->id_offset))) {
160 while (i < heap->heap_size) {
196 for (i = 0; i < heap->heap_size; i++) {
205 heap->heap_size = 0;
object_heap.h 48 int heap_size; member in struct:object_heap_s
  /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/
fallback_malloc.ipp 53 #define HEAP_SIZE 512
54 char heap [ HEAP_SIZE ];
57 typedef unsigned short heap_size;
61 heap_size len; // size in units of "sizeof(heap_node)"
64 static const heap_node *list_end = (heap_node *) ( &heap [ HEAP_SIZE ] ); // one past the end of the heap
76 freelist->len = HEAP_SIZE / sizeof (heap_node);
84 { return ptr >= heap && ptr < ( heap + HEAP_SIZE ); }
104 q->len = static_cast<heap_size>(nelems);
174 heap_size total_free = 0;
cxa_vector.cpp 144 const size_t heap_size = element_count * element_size + padding_size; local
145 char * const heap_block = static_cast<char *> ( alloc ( heap_size ));
173 const size_t heap_size = element_count * element_size + padding_size; local
174 char * const heap_block = static_cast<char *> ( alloc ( heap_size ));
178 st_heap_block3 heap ( dealloc, heap_block, heap_size );
  /bionic/libc/upstream-netbsd/lib/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/chromium_org/base/allocator/
allocator_shim.cc 201 size_t heap_size, allocated_bytes, unmapped_bytes; local
203 if (ext->GetNumericProperty("generic.heap_size", &heap_size) &&
208 *size = heap_size - allocated_bytes - unmapped_bytes;
  /external/chromium_org/base/
sys_info_android.cc 200 static int heap_size = GetDalvikHeapSizeMB(); local
201 return heap_size;
  /external/chromium_org/net/dns/
dns_config_service_win_unittest.cc 72 size_t heap_size = num_adapters * sizeof(IP_ADAPTER_ADDRESSES) + local
76 static_cast<IP_ADAPTER_ADDRESSES*>(malloc(heap_size)));
78 memset(heap.get(), 0, heap_size);
  /external/chromium_org/content/app/
content_main_runner.cc 460 size_t heap_size, allocated_bytes, unmapped_bytes; local
462 if (ext->GetNumericProperty("generic.heap_size", &heap_size) &&
467 *size = heap_size - allocated_bytes - unmapped_bytes;
  /external/chromium_org/third_party/zlib/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
197 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
553 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
fx_zlib_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...]
  /external/qemu/distrib/zlib-1.2.8/
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...]
  /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 */
  /development/tools/idegen/templates/
android.ipr 139 <option name="HEAP_SIZE" />

Completed in 575 milliseconds

1 2