headers/private/kernel/util/AVLTree.h

347

if (AVLTreeNode* node = fTree.FindClosest(&key, less))

headers/private/kernel/util/AVLTree.h

62

Value* FindClosest(const Key& key, bool less) const;

headers/private/kernel/util/AVLTreeBase.h

61

AVLTreeNode* FindClosest(const void* key, bool less) const;

headers/private/kernel/util/AVLTreeMap.h

365

if (AVLTreeNode* node = fTree.FindClosest(&key, less))

headers/private/util/SimpleAllocator.h

244

FreeChunk* chunk = fFreeChunkTree.FindClosest(FreeChunkKey(size), true, true);

headers/private/util/SplayTree.h

226

Node* FindClosest(const Key& key, bool greater, bool orEqual)

headers/private/util/SplayTree.h

571

Node* FindClosest(const Key& key, bool greater, bool orEqual)

headers/private/util/SplayTree.h

573

return fTree.FindClosest(key, greater, orEqual);

headers/private/util/SplayTree.h

598

return Iterator(this, fTree.FindClosest(key, greater, orEqual));

headers/private/util/SplayTree.h

603

return ConstIterator(this, FindClosest(key, greater, orEqual));

src/add-ons/kernel/file_systems/btrfs/ExtentAllocator.cpp

110

CachedExtent* node = FindClosest(lowerBound, false);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

177

return index->fNodes->FindClosest(value, false);

src/system/kernel/debug/guarded_heap.cpp

238

GuardedHeapChunk* chunk = tree.FindClosest((addr_t)address, false, true);

src/system/kernel/debug/guarded_heap.cpp

282

freeChunk = heap.free_chunks.FindClosest(searchBase, true, false);

src/system/kernel/vm/VMKernelAddressSpace.cpp

165

Range* range = fRangeTree.FindClosest(address, true);

src/system/kernel/vm/VMKernelAddressSpace.cpp

178

Range* range = fRangeTree.FindClosest(address, less);

src/system/kernel/vm/VMKernelAddressSpace.cpp

436

Range* range = fRangeTree.FindClosest(address, false);

src/system/kernel/vm/VMKernelAddressSpace.cpp

549

Range* insertBeforeRange = fRangeTree.FindClosest(range->base, true);

src/system/kernel/vm/VMKernelAddressSpace.cpp

714

Range* range = fRangeTree.FindClosest(start, true);

src/system/kernel/vm/VMKernelAddressSpace.cpp

765

Range* range = fRangeTree.FindClosest(start, true);

src/system/kernel/vm/VMKernelAddressSpace.cpp

791

Range* range = fRangeTree.FindClosest(start, true);

src/system/kernel/vm/VMUserAddressSpace.cpp

138

VMUserArea* area = fAreas.FindClosest(address, true);

src/system/kernel/vm/VMUserAddressSpace.cpp

150

VMUserArea* area = fAreas.FindClosest(address, less);

src/system/kernel/vm/VMUserAddressSpace.cpp

388

VMUserArea* area = fAreas.FindClosest(address, false);

src/system/kernel/vm/VMUserAddressSpace.cpp

484

VMUserArea* reserved = fAreas.FindClosest(start, true);

src/system/kernel/vm/VMUserAddressSpace.cpp

602

VMUserArea* next = fAreas.FindClosest(start + size, false);

src/system/kernel/vm/VMUserAddressSpace.cpp

604

? fAreas.Previous(next) : fAreas.FindClosest(start + size, true);

src/system/libroot/posix/malloc/openbsd/PagesAllocator.cpp

102

FreeChunk* chunk = fChunksBySizeTree.FindClosest(allocate, true, true);

src/system/libroot/posix/malloc/openbsd/PagesAllocator.cpp

128

FreeChunk* chunk = fChunksByAddressTree.FindClosest(address, false, true);

src/system/libroot/posix/malloc/openbsd/PagesAllocator.cpp

302

FreeChunk* preceding = fChunksByAddressTree.FindClosest(address, false, false);