HomeSort by relevance Sort by last modified time
    Searched refs:HEAP_SIZE (Results 1 - 12 of 12) sorted by null

  /external/libcxxabi/src/
fallback_malloc.cpp 59 static const size_t HEAP_SIZE = 512;
60 char heap[HEAP_SIZE] __attribute__((aligned));
63 typedef unsigned short heap_size; typedef in namespace:__anon27997
67 heap_size len; // size in units of "sizeof(heap_node)"
71 (heap_node*)(&heap[HEAP_SIZE]); // one past the end of the heap
87 freelist->len = HEAP_SIZE / sizeof(heap_node);
96 return ptr >= heap && ptr < (heap + HEAP_SIZE);
114 p->len = static_cast<heap_size>(p->len - nelems);
117 q->len = static_cast<heap_size>(nelems);
159 p->len = static_cast<heap_size>(
    [all...]
  /device/google/contexthub/firmware/os/core/
heap.c 46 static uint8_t __attribute__ ((aligned (8))) gHeap[HEAP_SIZE];
48 #define REAL_HEAP_SIZE ((HEAP_SIZE) &~ 7)
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
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...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
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/python/cpython2/Modules/zlib/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
545 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]
  /external/u-boot/lib/zlib/
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 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/zlib/src/
deflate.h 45 #define HEAP_SIZE (2*L_CODES+1)
198 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */
trees.c 510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
545 * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
    [all...]

Completed in 3245 milliseconds