Searched refs:bitsLen (Results 1 – 3 of 3) sorted by relevance
45 size_t bitsLen; in dvmHeapBitmapInit() local52 bitsLen = HB_OFFSET_TO_INDEX(maxSize) * sizeof(*hb->bits); in dvmHeapBitmapInit()53 allocLen = ALIGN_UP_TO_PAGE_SIZE(bitsLen); // required by ashmem in dvmHeapBitmapInit()66 bits = mmap(NULL, bitsLen, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0); in dvmHeapBitmapInit()70 bitsLen, nameBuf); in dvmHeapBitmapInit()76 hb->bitsLen = bitsLen; in dvmHeapBitmapInit()133 size_t allocLen = ALIGN_UP_TO_PAGE_SIZE(hb->bitsLen); in dvmHeapBitmapDelete()165 madvise(hb->bits, hb->bitsLen, MADV_DONTNEED); in dvmHeapBitmapZero()242 if (hb1->bitsLen != hb2->bitsLen) { in dvmHeapBitmapXorWalk()244 hb1->bitsLen, hb2->bitsLen); in dvmHeapBitmapXorWalk()
44 HB_INDEX_TO_OFFSET((hb_)->bitsLen / sizeof(*(hb_)->bits))59 size_t bitsLen; member189 return index < hb->bitsLen / sizeof(*hb->bits); in HB_INLINE_PROTO()210 assert(index < hb->bitsLen / sizeof(*hb->bits)); in HB_INLINE_PROTO()
34 assert(hb.bitsLen >= HB_OFFSET_TO_INDEX(HEAP_SIZE)); in test_init()54 assert(hb.bitsLen == 0); in test_init()70 for (i = 0; i < hb->bitsLen / sizeof (*hb->bits); i++) { in is_zeroed()81 assert(hb->bitsLen >= HB_OFFSET_TO_INDEX(HEAP_SIZE)); in assert_empty()