Home
last modified time | relevance | path

Searched refs:HEAP_SIZE (Results 1 – 7 of 7) sorted by relevance

/external/libcxxabi/src/
Dfallback_malloc.cpp59 static const size_t HEAP_SIZE = 512; variable
60 char heap[HEAP_SIZE] __attribute__((aligned));
71 (heap_node*)(&heap[HEAP_SIZE]); // one past the end of the heap
87 freelist->len = HEAP_SIZE / sizeof(heap_node); in init_heap()
96 return ptr >= heap && ptr < (heap + HEAP_SIZE); in is_fallback_ptr()
/external/u-boot/lib/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/external/zlib/src/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
/external/python/cpython2/Modules/zlib/
Ddeflate.h45 #define HEAP_SIZE (2*L_CODES+1) macro
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
Dtrees.c510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;