Cross Reference: /dalvik/vm/alloc/Copying.cpp

Lines Matching defs:blocks
57  * The block queue exists to thread lists of blocks from the various
68  * more contiguous blocks.  Objects that are small enough to fit
71  * blocks.  When half the available blocks are filled, a garbage
78  * scheme; blocks containing such objects are grayed (promoted) at the
153  * We use 512-byte blocks.
183     /* Total number of blocks available for allocation. */
194      * Base and limit blocks.  Basically the shifted start address of
195      * the block.  We convert blocks to a relative number when
294  * blocks.
296 static void *allocateBlocks(HeapSource *heapSource, size_t blocks)
301     assert(blocks != 0);
303     if (allocBlocks + blocks > totalBlocks / 2) {
309         for (size_t j = 0; j < blocks; ++j) { /* runs over totalBlocks */
315         if (j != blocks) {
321         for (size_t j = 1; j < blocks; ++j) {
324         heapSource->allocBlocks += blocks;
326         memset(addr, 0, blocks*BLOCK_SIZE);
341     ALOGE("Insufficient space, %zu blocks, %zu blocks allocated and %zu bytes allocated",
399     LOG_SCAV("freed %zu blocks (%zu bytes)", count, count*BLOCK_SIZE);
433         /* TODO(cshapiro): count continued blocks?*/
455     /* Allocate underlying storage for blocks. */
581  * of contiguous blocks.
587     size_t aligned, available, blocks;
619     /* Try allocating in a span of blocks. */
620     blocks = alignUp(aligned, BLOCK_SIZE) / BLOCK_SIZE;
622     addr = allocateBlocks(heapSource, blocks);
777     /* Whiten all allocated blocks. */
1983     /* Count the number of blocks enqueued. */
2022  * Scan the block list and verify all blocks that are marked as being
2080      * Promote blocks with stationary objects.
2108      * Scavenge blocks and relocate movable objects.