Searched refs:getNumAvailable (Results 1 – 4 of 4) sorted by relevance
| /haiku/src/system/libroot/posix/malloc/hoard2/ |
| H A D | superblock.h | 68 inline int getNumAvailable(void);
171 assert(getNumAvailable() == 0); in getBlock()
175 assert(getNumAvailable() > 0); in getBlock()
194 assert(getNumAvailable() < getNumBlocks()); in putBlock()
203 superblock::getNumAvailable(void) in getNumAvailable() function
284 * (getNumBlocks() - getNumAvailable())) / getNumBlocks()); in computeFullness()
|
| H A D | heap.cpp | 169 incStats(sizeclass, sb->getNumBlocks() - sb->getNumAvailable(), in insertSuperblock()
174 && sb->getNumBlocks() == sb->getNumAvailable()) { in insertSuperblock()
180 sb->getNumBlocks() - sb->getNumAvailable(), sb->getNumBlocks()); in insertSuperblock()
227 head->getNumBlocks() - head->getNumAvailable(), in removeMaxSuperblock()
257 assert(head->getNumAvailable() * EMPTY_FRACTION >= head->getNumBlocks()); in removeMaxSuperblock()
288 decStats(sizeclass, sb->getNumBlocks() - sb->getNumAvailable(), in removeSuperblock()
378 if ((newFullness == 0) && (sb->getNumBlocks() == sb->getNumAvailable())) { in freeBlock()
403 sb->getNumBlocks() - sb->getNumAvailable(), sb->getNumBlocks()); in freeBlock()
437 assert(maxSb->getNumBlocks() >= maxSb->getNumAvailable()); in freeBlock()
|
| H A D | heap.h | 323 } else if (sb->getNumAvailable() > 0) { in findAvailableSuperblock()
363 sb->getNumBlocks() - sb->getNumAvailable(), in findAvailableSuperblock()
517 sb->getNumBlocks() - sb->getNumAvailable(), in reuse()
524 sb->getNumBlocks() - sb->getNumAvailable(), in reuse()
|
| H A D | processheap.h | 255 assert(EMPTY_FRACTION * sb->getNumAvailable() > sb->getNumBlocks()); in release()
|