Traverse
TreeIterator::Traverse(int8 direction, void* key, uint16* keyLength,
BTree::Traverse(btree_traversing type, Path* path, const btrfs_key& key)
status_t BPlusTree::Traverse(int8 direction,void *key,uint16 *keyLength,uint16 maxLength,off_t *value)