Searched refs:Traverse (Results 1 - 6 of 6) sorted by relevance

/haiku/src/bin/bfs_tools/lib/
H A DBPlusTree.h150 status_t Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value);
192 return Traverse(BPLUSTREE_FORWARD,key,keyLength,maxLength,value);
197 return Traverse(BPLUSTREE_BACKWARD,key,keyLength,maxLength,value);
H A DBPlusTree.cpp370 status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value) function in class:BPlusTree
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp573 BTree::Traverse(btree_traversing type, Path* path, const btrfs_key& key) function in class:BTree
576 TRACE("BTree::Traverse() objectid %" B_PRId64 " type %d offset %"
584 TRACE("BTree::Traverse() level %d count %d\n", node.Level(),
592 TRACE("BTree::Traverse() getting index %" B_PRIu32 "\n", slot);
597 ERROR("BTree::Traverse() unmapped block %" B_PRId64 "\n",
604 TRACE("BTree::Traverse() dump count %" B_PRId32 "\n", node.ItemCount());
611 TRACE("BTree::Traverse() found %" B_PRIu32 " %" B_PRIu32 "\n",
621 status_t status = Traverse(type, path, wanted);
675 status_t status = Traverse(BTREE_FORWARD, path, startKey);
735 status_t status = Traverse(BTREE_EXAC
[all...]
H A DBTree.h72 /*! Traverse from the root to fill in the path along the way
76 status_t Traverse(btree_traversing type, Path* path,
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.h401 status_t Traverse(int8 direction, void* key,
534 return Traverse(BPLUSTREE_FORWARD, key, keyLength, maxLength, value,
543 return Traverse(BPLUSTREE_BACKWARD, key, keyLength, maxLength, value,
H A DBPlusTree.cpp2640 TreeIterator::Traverse(int8 direction, void* key, uint16* keyLength, function in class:BFS::TreeIterator

Completed in 508 milliseconds