Searched refs:IsFull (Results 1 - 11 of 11) sorted by relevance

/haiku/src/system/kernel/slab/
H A DObjectDepot.cpp31 inline bool IsFull() const;
59 DepotMagazine::IsFull() const function in class:DepotMagazine
75 if (IsFull())
157 ASSERT(magazine == NULL || magazine->IsFull());
268 && (store->previous->IsFull()
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTree.h51 bool IsFull() const function in struct:HTreeCountLimit
H A DHTreeEntryIterator.cpp293 if (countLimit->IsFull()) {
H A DBlockAllocator.cpp39 bool IsFull() const;
212 AllocationBlockGroup::IsFull() const function in class:AllocationBlockGroup
408 if (IsFull()) {
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A DVirtioPrivate.h115 bool IsFull() const { return fRingFree == 0; } function in class:VirtioQueue
H A DVirtioModule.cpp178 return queue->IsFull();
/haiku/headers/private/kernel/
H A Dtracing.h53 bool IsFull() const { return fSize >= fCapacity; } function in class:TraceOutput
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp199 bool IsFull() const { return fFreeBits == 0; } function in class:AllocationGroup
759 if (start >= group.NumBits() || group.IsFull())
/haiku/src/system/kernel/debug/
H A Dtracing.cpp717 if (IsFull())
/haiku/src/system/kernel/cache/
H A Dblock_cache.cpp734 for (int32 i = 0; i < fNumBlocks && !out.IsFull(); i++)
/haiku/src/system/kernel/
H A Dteam.cpp273 for (int32 i = 0; !out.IsFull() && i < fArgCount; i++) {

Completed in 200 milliseconds