Searched refs:BTree (Results 1 - 11 of 11) sorted by relevance
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | Volume.h | 18 class BTree; 47 BTree* FSTree() const { return fFSTree; } 48 BTree* ExtentTree() const { return fExtentTree; } 49 BTree* RootTree() const { return fRootTree; } 96 BTree* fChunkTree; 97 BTree* fRootTree; 98 BTree* fDevTree; 99 BTree* fExtentTree; 100 BTree* fFSTree; 101 BTree* fChecksumTre [all...] |
H A D | BTree.h | 49 class BTree { class 55 BTree(Volume* volume); 56 BTree(Volume* volume, 58 BTree(Volume* volume, 60 ~BTree(); 108 BTree(const BTree& other); 109 BTree& operator=(const BTree& other); 223 Path(BTree* tre [all...] |
H A D | BTree.cpp | 9 //! BTree implementation 12 #include "BTree.h" 25 BTree::Node::Node(Volume* volume) 35 BTree::Node::Node(Volume* volume, off_t block) 46 BTree::Node::~Node() 53 BTree::Node::Unset() 63 BTree::Node::SetTo(off_t block) 72 BTree::Node::SetToWritable(off_t block, int32 transactionId, bool empty) 88 BTree::Node::SearchSlot(const btrfs_key& key, int* slot, btree_traversing type) 136 BTree 509 BTree::BTree(Volume* volume) function in class:BTree 519 BTree::BTree(Volume* volume, btrfs_stream* stream) function in class:BTree 529 BTree::BTree(Volume* volume, fsblock_t rootBlock) function in class:BTree [all...] |
H A D | Inode.h | 14 #include "BTree.h" 74 uint64 FindNextIndex(BTree::Path* path) const; 78 status_t Insert(Transaction& transaction, BTree::Path* path); 79 status_t Remove(Transaction& transaction, BTree::Path* path); 80 status_t MakeReference(Transaction& transaction, BTree::Path* path, 82 status_t Dereference(Transaction& transaction, BTree::Path* path,
|
H A D | Inode.cpp | 99 BTree::Path path(fVolume->FSTree()); 179 BTree::Path path(fVolume->FSTree()); 236 BTree::Path path(fVolume->FSTree()); 365 BTree::Path path(fVolume->FSTree()); 384 Inode::FindNextIndex(BTree::Path* path) const 401 Inode::Insert(Transaction& transaction, BTree::Path* path) 403 BTree* tree = path->Tree(); 424 Inode::Remove(Transaction& transaction, BTree::Path* path) 426 BTree* tree = path->Tree(); 443 Inode::MakeReference(Transaction& transaction, BTree [all...] |
H A D | Volume.cpp | 15 #include "BTree.h" 185 fChunkTree = new(std::nothrow) BTree(this); 192 fRootTree = new(std::nothrow) BTree(this); 199 BTree::Path path(fRootTree); 214 fExtentTree = new(std::nothrow) BTree(this); 230 fFSTree = new(std::nothrow) BTree(this); 246 fDevTree = new(std::nothrow) BTree(this); 262 fChecksumTree = new(std::nothrow) BTree(this); 485 BTree::Path path(fChunkTree);
|
H A D | ExtentAllocator.h | 9 #include "BTree.h" 110 BlockGroup(BTree* extentTree); 134 BTree* fCurrentExtentTree;
|
H A D | Attribute.cpp | 13 #include "BTree.h" 155 BTree::Path path(fInode->GetVolume()->FSTree());
|
H A D | DirectoryIterator.cpp | 126 BTree::Path path(fInode->GetVolume()->FSTree());
|
H A D | ExtentAllocator.cpp | 352 BlockGroup::BlockGroup(BTree* extentTree) 356 fCurrentExtentTree = new(std::nothrow) BTree(extentTree->SystemVolume(), 403 BTree::Path path(fCurrentExtentTree);
|
H A D | kernel_interface.cpp | 673 BTree::Path path(volume->FSTree()); 713 BTree::Path path(volume->FSTree()); 760 BTree::Path path(volume->FSTree());
|
Completed in 129 milliseconds