Lines Matching refs:avail
81 REPORTER_ASSERT(r, stack.preallocUsableSpace() == (size_t) stack.currentBlock()->avail());
154 // Requesting an allocation of avail() should not make a new block
155 size_t avail = pool->currentBlock()->avail<4>();
156 auto pAvail = pool->allocate<4>(avail);
157 validate_ptr(4, avail, pAvail, &p32);
161 REPORTER_ASSERT(r, pool->currentBlock()->avail<4>() < 4);
166 // Allocating more than avail() makes an another block
168 size_t bigRequest = pool->currentBlock()->avail<4>() * 2;
188 REPORTER_ASSERT(r, p.fBlock->avail<4>() > 16);
201 // Confirm that releasing pNext allows 'p' to be resized, and that it can be resized up to avail
203 int fillBlock = p.fBlock->avail<4>();
210 REPORTER_ASSERT(r, p.fBlock->avail<4>() < fillBlock);
466 // Reserving more than what's available adds a scratch block, and current block remains avail.
467 size_t avail = pool->currentBlock()->avail();
468 size_t reserve = avail + 1;
470 REPORTER_ASSERT(r, (size_t) pool->currentBlock()->avail() == avail);
475 // Allocating more than avail activates the scratch block (so totalSize doesn't change)
477 pool->allocate<1>(avail + 1);
483 pool->reserve(pool->currentBlock()->avail());
487 pool->reserve(pool->currentBlock()->avail(), SkBlockAllocator::kIgnoreExistingBytes_Flag);
500 avail = oldTail->avail();
501 size_t scratchAvail = 2 * avail;