/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Tree.cpp | 0 // Tree.cpp 24 #include "Tree.h" 36 \class Tree 37 \brief Represents the on-disk S+Tree. 47 Tree::Tree() function in class:Tree 56 Tree::~Tree() 64 Tree::Init(Volume *volume, Node *rootNode, uint32 treeHeight) 85 Tree [all...] |
H A D | Iterators.h | 34 class Tree; 81 TreeIterator(Tree *tree); 84 status_t SetTo(Tree *tree); 88 Tree *GetTree() const { return fTree; } 116 Tree *fTree; 125 ItemIterator(Tree *tree); 127 status_t SetTo(Tree *tree); 130 Tree *GetTree() const { return fTreeIterator.GetTree(); } 154 ObjectItemIterator(Tree *tree, uint32 dirID, uint32 objectID, 157 status_t SetTo(Tree *tre [all...] |
H A D | Tree.h | 0 // Tree.h 36 // Tree 37 class Tree { class 39 Tree(); 40 ~Tree();
|
H A D | Volume.h | 34 class Tree; 60 Tree *GetTree() const { return fTree; } 98 Tree *fTree;
|
H A D | Iterators.cpp | 30 #include "Tree.h" 169 TreeIterator::TreeIterator(Tree *tree) 185 TreeIterator::SetTo(Tree *tree) 538 ItemIterator::ItemIterator(Tree *tree) 546 ItemIterator::SetTo(Tree *tree) 828 ObjectItemIterator::ObjectItemIterator(Tree *tree, uint32 dirID, 853 ObjectItemIterator::SetTo(Tree *tree, uint32 dirID, uint32 objectID, 1057 DirEntryIterator::DirEntryIterator(Tree *tree, uint32 dirID, uint32 objectID, 1084 DirEntryIterator::SetTo(Tree *tree, uint32 dirID, uint32 objectID, 1262 StreamReader::StreamReader(Tree *tre [all...] |
H A D | Volume.cpp | 40 #include "Tree.h" 150 fTree = new(nothrow) Tree;
|
H A D | kernel_interface.cpp | 44 #include "Tree.h" 449 DirectoryCookie(Tree *tree, uint32 dirID, uint32 objectID,
|
/haiku/headers/private/kernel/util/ |
H A D | SplayTree.h | 358 typedef IteratableSplayTree<Definition> Tree; typedef in class:IteratableSplayTree 372 Iterator(Tree* tree) 379 Iterator(Tree* tree, Node* next) 430 Tree* fTree; 446 ConstIterator(const Tree* tree) 453 ConstIterator(const Tree* tree, Node* next) 486 const Tree* fTree;
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | FileSystemVisitor.cpp | 81 BPlusTree* tree = inode->Tree();
|
H A D | CheckVisitor.cpp | 305 status = inode->Tree()->Validate(repairErrors, errorsFound); 356 Control().status = _RemoveInvalidNode(parent, iterator->Tree(), 692 BPlusTree* tree = inode->Tree(); 738 BPlusTree* tree = index->inode->Tree();
|
H A D | Index.cpp | 77 BPlusTree* tree = indices->Tree(); 253 BPlusTree* tree = Node()->Tree();
|
H A D | Inode.h | 139 BPlusTree* Tree() const { return fTree; } function in class:Inode
|
H A D | Debug.cpp | 299 kprintf(" tree: %p\n", inode->Tree());
|
H A D | kernel_interface.cpp | 601 BPlusTree* tree = directory->Tree(); 1198 BPlusTree* tree = oldDirectory->Tree(); 1243 newTree = newDirectory->Tree(); 1307 BPlusTree* movedTree = inode->Tree(); 1717 BPlusTree* tree = inode->Tree();
|
H A D | BPlusTree.h | 415 BPlusTree* Tree() const { return fTree; } function in class:BFS::TreeIterator
|
H A D | Inode.cpp | 1323 BPlusTree* tree = attributes->Tree(); 2632 tree = parent->Tree(); 2936 BPlusTree* tree = fAttributes->Tree();
|
H A D | Query.cpp | 514 BPlusTree* tree = index.Node()->Tree();
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.h | 21 //! Tree traversal direction status, used by functions manipulating trees 268 BTree* Tree() const { return fTree; } function in class:BTree::Path 296 BTree* Tree() const { return fTree; } function in class:TreeIterator
|
H A D | Inode.cpp | 403 BTree* tree = path->Tree(); 426 BTree* tree = path->Tree(); 518 BTree* tree = path->Tree();
|