OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:HEAP_SIZE
(Results
1 - 5
of
5
) sorted by null
/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/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/
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
...]
Completed in 1503 milliseconds