headers/private/kernel/tracing.h

53

bool IsFull() const { return fSize >= fCapacity; }

src/add-ons/kernel/bus_managers/virtio/VirtioModule.cpp

179

return queue->IsFull();

src/add-ons/kernel/bus_managers/virtio/VirtioPrivate.h

116

bool IsFull() const { return fRingFree == 0; }

src/add-ons/kernel/file_systems/bfs/BlockAllocator.cpp

875

if (start >= end || group.IsFull())

src/add-ons/kernel/file_systems/ext2/BlockAllocator.cpp

39

bool IsFull() const;

src/add-ons/kernel/file_systems/ext2/BlockAllocator.cpp

408

if (IsFull()) {

src/add-ons/kernel/file_systems/ext2/HTree.h

51

bool IsFull() const

src/add-ons/kernel/file_systems/ext2/HTreeEntryIterator.cpp

293

if (countLimit->IsFull()) {

src/system/kernel/cache/block_cache.cpp

772

for (int32 i = 0; i < fNumBlocks && !out.IsFull(); i++)

src/system/kernel/debug/tracing.cpp

717

if (IsFull())

src/system/kernel/slab/ObjectDepot.cpp

166

ASSERT(magazine == NULL || magazine->IsFull());

src/system/kernel/slab/ObjectDepot.cpp

301

&& (store->previous->IsFull()

src/system/kernel/slab/ObjectDepot.cpp

31

inline bool IsFull() const;

src/system/kernel/slab/ObjectDepot.cpp

82

if (IsFull())

src/system/kernel/team.cpp

273

for (int32 i = 0; !out.IsFull() && i < fArgCount; i++) {