Searched refs:getNumBlocks (Results 1 – 5 of 5) sorted by relevance
169 incStats(sizeclass, sb->getNumBlocks() - sb->getNumAvailable(), in insertSuperblock()170 sb->getNumBlocks()); in insertSuperblock()173 && sb->getNumBlocks() > 1 in insertSuperblock()174 && sb->getNumBlocks() == sb->getNumAvailable()) { in insertSuperblock()180 sb->getNumBlocks() - sb->getNumAvailable(), sb->getNumBlocks()); in insertSuperblock()187 m.deallocate((int)sb->getNumBlocks() * in insertSuperblock()193 pHeap->setDeallocated(0, sb->getNumBlocks() * sizeFromClass(sb->getBlockSizeClass())); in insertSuperblock()227 head->getNumBlocks() - head->getNumAvailable(), in removeMaxSuperblock()228 head->getNumBlocks()); in removeMaxSuperblock()257 assert(head->getNumAvailable() * EMPTY_FRACTION >= head->getNumBlocks()); in removeMaxSuperblock()[all …]
71 inline int getNumBlocks(void);194 assert(getNumAvailable() < getNumBlocks()); in putBlock()211 superblock::getNumBlocks(void) in getNumBlocks() function284 * (getNumBlocks() - getNumAvailable())) / getNumBlocks()); in computeFullness()
363 sb->getNumBlocks() - sb->getNumAvailable(), in findAvailableSuperblock()364 sb->getNumBlocks()); in findAvailableSuperblock()484 assert(sb->getNumBlocks() > 1); in recycle()511 assert(sb->getNumBlocks() > 1); in reuse()517 sb->getNumBlocks() - sb->getNumAvailable(), in reuse()518 sb->getNumBlocks()); in reuse()524 sb->getNumBlocks() - sb->getNumAvailable(), in reuse()525 sb->getNumBlocks()); in reuse()
83 m.allocate((int)sb->getNumBlocks() * in malloc()89 sb->getNumBlocks() * sizeFromClass(sb->getBlockSizeClass())); in malloc()
255 assert(EMPTY_FRACTION * sb->getNumAvailable() > sb->getNumBlocks()); in release()