TreeIterator
SinglyLinkedList<TreeIterator>::ConstIterator iterator
BPlusTree::_AddIterator(TreeIterator* iterator)
BPlusTree::_RemoveIterator(TreeIterator* iterator)
TreeIterator::TreeIterator(BPlusTree* tree)
TreeIterator::~TreeIterator()
TreeIterator::Goto(int8 to)
TreeIterator::Traverse(int8 direction, void* key, uint16* keyLength,
TreeIterator::Find(const uint8* key, uint16 keyLength)
TreeIterator::SkipDuplicates()
TreeIterator::Update(off_t offset, off_t nextOffset, uint16 keyIndex,
TreeIterator::Stop()
TreeIterator::Dump()
SinglyLinkedList<TreeIterator>::ConstIterator iterator
class TreeIterator;
void _AddIterator(TreeIterator* iterator);
void _RemoveIterator(TreeIterator* iterator);
friend class TreeIterator;
SinglyLinkedList<TreeIterator> fIterators;
class TreeIterator : public SinglyLinkedListLinkImpl<TreeIterator> {
TreeIterator(BPlusTree* tree);
~TreeIterator();
TreeIterator::Rewind()
TreeIterator::GetNextEntry(void* key, uint16* keyLength, uint16 maxLength,
TreeIterator::GetPreviousEntry(void* key, uint16* keyLength, uint16 maxLength,
char* treeName, TreeIterator* iterator)
TreeIterator* iterator);
char* treeName, TreeIterator* iterator)
fIterator = new(std::nothrow) TreeIterator(tree);
class TreeIterator;
TreeIterator* iterator);
TreeIterator* fIterator;
TreeIterator iterator(fTree);
|| (fIterator = new(std::nothrow) TreeIterator(tree)) == NULL) {
class TreeIterator;
TreeIterator* fIterator;
struct IndexIterator : TreeIterator {
TreeIterator(tree),
TreeIterator* iterator = new(std::nothrow) TreeIterator(tree);
TreeIterator* iterator = (TreeIterator*)_cookie;
TreeIterator* iterator = (TreeIterator*)_cookie;
delete (TreeIterator*)_cookie;
fIterator = new(std::nothrow) TreeIterator(inode->GetVolume()->FSTree(),
TreeIterator* fIterator;
SinglyLinkedList<TreeIterator>::ConstIterator iterator
BTree::_AddIterator(TreeIterator* iterator)
BTree::_RemoveIterator(TreeIterator* iterator)
TreeIterator::TreeIterator(BTree* tree, const btrfs_key& key)
TreeIterator::~TreeIterator()
TreeIterator::Rewind(bool inverse)
TreeIterator::_Traverse(btree_traversing direction)
TreeIterator::_GetEntry(btree_traversing type, void** _value, uint32* _size,
TreeIterator::Find(const btrfs_key& key)
TreeIterator::Stop()
void _AddIterator(TreeIterator* iterator);
void _RemoveIterator(TreeIterator* iterator);
friend class TreeIterator;
SinglyLinkedList<TreeIterator> fIterators;
class TreeIterator : public SinglyLinkedListLinkImpl<TreeIterator> {
TreeIterator(BTree* tree, const btrfs_key& key);
~TreeIterator();
TreeIterator::GetNextEntry(void** _value, uint32* _size, uint32* _offset)
TreeIterator::GetPreviousEntry(void** _value, uint32* _size, uint32* _offset)
class TreeIterator;
fIterator = new(std::nothrow) TreeIterator(inode->GetVolume()->FSTree(),
TreeIterator* fIterator;
TreeIterator iterator(fCurrentExtentTree, key);
TreeIterator::TreeIterator(Tree *tree)
TreeIterator::~TreeIterator()
TreeIterator::SetTo(Tree *tree)
TreeIterator::Unset()
TreeIterator::InitCheck() const
TreeIterator::GetNode() const
TreeIterator::GetLevel() const
TreeIterator::GoTo(uint32 direction)
TreeIterator::GoToPreviousLeaf(LeafNode **node)
TreeIterator::GoToNextLeaf(LeafNode **node)
TreeIterator::FindRightMostLeaf(const VKey *k, LeafNode **node)
TreeIterator::Suspend()
TreeIterator::Resume()
TreeIterator::_PushCurrentNode(Node *newTopNode, int32 newIndex)
TreeIterator::_PopTopNode()
TreeIterator::_SearchRightMost(InternalNode *node, const VKey *k, int32 *index)
TreeIterator fTreeIterator;
class TreeIterator {
TreeIterator(Tree *tree);
~TreeIterator();
class TreeIterator;
TreeIterator *iterator = (TreeIterator *)cookie;
TreeIterator *iterator = (TreeIterator *)cookie;
TreeIterator *iterator = (TreeIterator *)cookie;
TreeIterator iterator(&fTree);
*_cookie = (void *)new(nothrow) TreeIterator(&fTree);
delete (TreeIterator *)cookie;
TreeIterator iterator(tree);
TreeIterator iterator(tree);