BTree
BTree::Path path(fInode->GetVolume()->FSTree());
BTree::Node::_CalculateSpace(uint32 from, uint32 to, uint8 type) const
BTree::Node::SpaceUsed() const
BTree::Node::SpaceLeft() const
BTree::Node::_Copy(const Node* origin, uint32 at, uint32 from, uint32 to,
BTree::Node::_SpaceCheck(int length) const
BTree::Node::Copy(const Node* origin, uint32 start, uint32 end, int length)
BTree::Node::MoveEntries(uint32 start, uint32 end, int length) const
BTree::Node::Node(Volume* volume)
BTree::Path::Path(BTree* tree)
BTree::Path::~Path()
BTree::Node*
BTree::Path::GetNode(int level, int* _slot) const
BTree::Node*
BTree::Path::SetNode(off_t block, int slot)
BTree::Node*
BTree::Path::SetNode(const Node* node, int slot)
BTree::Node::Node(Volume* volume, off_t block)
BTree::Path::Move(int level, int step)
BTree::Path::GetEntry(int slot, btrfs_key* _key, void** _value, uint32* _size,
BTree::Node* leaf = fNodes[0];
BTree::Path::SetEntry(int slot, const btrfs_entry& entry, void* value)
BTree::Path::CopyOnWrite(Transaction& transaction, int level, uint32 start,
fNodes[level] = new(std::nothrow) BTree::Node(fTree->SystemVolume());
BTree::Node::~Node()
BTree::Path::InternalCopy(Transaction& transaction, int level)
BTree::BTree(Volume* volume)
BTree::BTree(Volume* volume, btrfs_stream* stream)
BTree::BTree(Volume* volume, fsblock_t rootBlock)
BTree::Node::Unset()
BTree::~BTree()
BTree::Traverse(btree_traversing type, Path* path, const btrfs_key& key)
BTree::_Find(Path* path, btrfs_key& wanted, void** _value, uint32* _size,
BTree::Node::SetTo(off_t block)
BTree::FindNext(Path* path, btrfs_key& key, void** _value, uint32* _size,
BTree::FindPrevious(Path* path, btrfs_key& key, void** _value, uint32* _size,
BTree::FindExact(Path* path, btrfs_key& key, void** _value, uint32* _size,
BTree::MakeEntries(Transaction& transaction, Path* path,
BTree::InsertEntries(Transaction& transaction, Path* path,
BTree::Node::SetToWritable(off_t block, int32 transactionId, bool empty)
BTree::RemoveEntries(Transaction& transaction, Path* path,
BTree::PreviousLeaf(Path* path) const
BTree::NextLeaf(Path* path) const
BTree::SetRoot(off_t logical, fsblock_t* block)
BTree::SetRoot(Node* root)
BTree::_AddIterator(TreeIterator* iterator)
BTree::Node::SearchSlot(const btrfs_key& key, int* slot, btree_traversing type)
BTree::_RemoveIterator(TreeIterator* iterator)
TreeIterator::TreeIterator(BTree* tree, const btrfs_key& key)
fPath = new(std::nothrow) BTree::Path(tree);
BTree(const BTree& other);
BTree& operator=(const BTree& other);
Path(BTree* tree);
BTree* Tree() const { return fTree; }
BTree* fTree;
TreeIterator(BTree* tree, const btrfs_key& key);
BTree* Tree() const { return fTree; }
friend class BTree;
BTree* fTree;
BTree::Path* fPath;
BTree::Path::GetCurrentEntry(btrfs_key* _key, void** _value, uint32* _size,
class BTree {
BTree(Volume* volume);
BTree(Volume* volume,
BTree(Volume* volume,
~BTree();
BTree::Path path(fInode->GetVolume()->FSTree());
BlockGroup::BlockGroup(BTree* extentTree)
fCurrentExtentTree = new(std::nothrow) BTree(extentTree->SystemVolume(),
BTree::Path path(fCurrentExtentTree);
BlockGroup(BTree* extentTree);
BTree* fCurrentExtentTree;
BTree::Path path(fVolume->FSTree());
BTree::Path path(fVolume->FSTree());
BTree::Path path(fVolume->FSTree());
BTree::Path path(fVolume->FSTree());
Inode::FindNextIndex(BTree::Path* path) const
Inode::Insert(Transaction& transaction, BTree::Path* path)
BTree* tree = path->Tree();
Inode::Remove(Transaction& transaction, BTree::Path* path)
BTree* tree = path->Tree();
Inode::MakeReference(Transaction& transaction, BTree::Path* path,
BTree* tree = fVolume->FSTree();
Inode::Dereference(Transaction& transaction, BTree::Path* path, ino_t parentID,
BTree* tree = path->Tree();
uint64 FindNextIndex(BTree::Path* path) const;
status_t Insert(Transaction& transaction, BTree::Path* path);
status_t Remove(Transaction& transaction, BTree::Path* path);
status_t MakeReference(Transaction& transaction, BTree::Path* path,
status_t Dereference(Transaction& transaction, BTree::Path* path,
fChunkTree = new(std::nothrow) BTree(this);
fRootTree = new(std::nothrow) BTree(this);
BTree::Path path(fRootTree);
fExtentTree = new(std::nothrow) BTree(this);
fFSTree = new(std::nothrow) BTree(this);
fDevTree = new(std::nothrow) BTree(this);
fChecksumTree = new(std::nothrow) BTree(this);
BTree::Path path(fChunkTree);
BTree* fFSTree;
BTree* fChecksumTree;
class BTree;
BTree* FSTree() const { return fFSTree; }
BTree* ExtentTree() const { return fExtentTree; }
BTree* RootTree() const { return fRootTree; }
BTree* fChunkTree;
BTree* fRootTree;
BTree* fDevTree;
BTree* fExtentTree;
BTree::Path path(volume->FSTree());
BTree::Path path(volume->FSTree());
BTree::Path path(volume->FSTree());