| /haiku/src/add-ons/kernel/file_systems/bfs/ |
| H A D | Inode.cpp | 180 if (fInode->fTree != NULL)
181 fTransaction->RemoveListener(fInode->fTree);
250 fInode->fTree = tree;
344 fTree(NULL),
365 fTree = new(std::nothrow) BPlusTree(this);
378 fTree(NULL),
425 delete fTree;
449 if (fTree == NULL)
452 status_t status = fTree->InitCheck();
1385 TreeIterator iterator(fTree);
[all...] |
| H A D | BPlusTree.cpp | 251 if (fTree == NULL || fTree->fStream == NULL)
255 void* cache = fTree->fStream->GetVolume()->BlockCache();
268 if (fTree == NULL || fTree->fStream == NULL)
276 memcpy(&fTree->fHeader, fNode, sizeof(bplustree_header));
279 block_cache_put(fTree->fStream->GetVolume()->BlockCache(),
302 if (fTree == NULL || fTree->fStream == NULL)
310 if (offset > fTree
[all...] |
| H A D | BPlusTree.h | 179 fTree(tree),
192 fTree(tree),
240 BPlusTree* fTree; member in class:BFS::CachedNode
415 BPlusTree* Tree() const { return fTree; }
431 BPlusTree* fTree; member in class:BFS::TreeIterator
|
| H A D | Inode.h | 139 BPlusTree* Tree() const { return fTree; }
261 BPlusTree* fTree; member in class:Inode
|
| /haiku/headers/private/kernel/util/ |
| H A D | AVLTree.h | 41 inline int Count() const { return fTree.Count(); }
42 inline bool IsEmpty() const { return fTree.IsEmpty(); }
68 void CheckTree() const { fTree.CheckTree(); }
87 AVLTreeBase fTree; member in class:AVLTree
196 fTree(this),
205 fTree(this),
221 fTree.MakeEmpty();
229 if (AVLTreeNode* root = fTree.Root())
242 AVLTreeNode* node = fTree.Previous(_GetAVLTreeNode(value));
254 AVLTreeNode* node = fTree
[all...] |
| H A D | SplayTree.h | 374 fTree(tree)
381 fTree(tree),
409 fTree->Remove(fCurrent);
417 fTree = other.fTree;
426 fNext = fTree->fFirst;
430 Tree* fTree; member in class:IteratableSplayTree::Iterator
448 fTree(tree)
455 fTree(tree),
475 fTree
486 const Tree* fTree; member in class:IteratableSplayTree::ConstIterator
613 SplayTree<Definition> fTree; member in class:IteratableSplayTree
[all...] |
| H A D | AVLTreeMap.h | 62 inline int Count() const { return fTree.Count(); }
63 inline bool IsEmpty() const { return fTree.IsEmpty(); }
112 AVLTreeBase fTree; member in class:AVLTreeMap
252 : fTree(this),
270 AVLTreeNode* root = fTree.Root();
272 fTree.MakeEmpty();
281 if (AVLTreeNode* root = fTree.Root())
295 AVLTreeNode* treeNode = fTree.Previous(_GetAVLTreeNode(node));
308 AVLTreeNode* treeNode = fTree.Next(_GetAVLTreeNode(node));
318 return Iterator(this, fTree
[all...] |
| /haiku/src/bin/bfs_tools/lib/ |
| H A D | Inode.cpp | 1042 fTree(NULL)
1049 fTree(NULL)
1056 delete fTree;
1120 if (!fTree) {
1125 return fTree->Rewind();
1134 if (!fTree) {
1141 if ((status = fTree->GetNextEntry(name, &length, B_FILE_NAME_LENGTH - 1,
1165 if (!fTree) {
1185 if (!fTree) {
1194 if (name && (status = fTree
[all...] |
| H A D | Inode.h | 180 BPlusTree *fTree; member in class:Directory
|
| H A D | BPlusTree.h | 99 BPlusTree *fTree; member in class:NodeCache
|
| H A D | BPlusTree.cpp | 50 fTree(tree)
58 return new CacheableNode(offset,fTree->Node(offset,false));
|
| /haiku/src/add-ons/kernel/file_systems/reiserfs/ |
| H A D | Iterators.cpp | 170 : fTree(NULL),
188 fTree = tree;
191 if (fTree) {
192 fCurrentNode = fTree->GetRootNode();
218 return (fTree && fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT);
294 error = fTree->GetNode(child->GetBlockNumber(), &node);
453 = (fTree && !fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT);
480 error = fTree->GetNode(element->GetBlockNumber(), &node);
|
| H A D | Volume.cpp | 73 fTree(NULL),
150 fTree = new(nothrow) Tree;
151 if (!fTree)
161 error = fTree->Init(this, rootBlock->ToNode(),
202 if (fTree) {
203 delete fTree;
204 fTree = NULL;
347 error = fTree->FindStatItem(dirID, objectID, &item);
361 error = fTree->FindDirEntry(dirID, objectID, "..", &dirItem, &index);
396 error = fTree
[all...] |
| H A D | Volume.h | 60 Tree *GetTree() const { return fTree; }
98 Tree *fTree; member in class:Volume
|
| H A D | Iterators.h | 88 Tree *GetTree() const { return fTree; }
116 Tree *fTree; member in class:TreeIterator
|
| /haiku/src/add-ons/kernel/file_systems/btrfs/ |
| H A D | BTree.cpp | 302 fTree(tree)
333 Node node(fTree->SystemVolume(), block);
343 fNodes[level] = new Node(fTree->SystemVolume(), node->BlockNum());
437 status = fTree->SystemVolume()->GetNewBlock(address, block);
441 fNodes[level] = new(std::nothrow) BTree::Node(fTree->SystemVolume());
466 if (level == fTree->RootLevel())
467 fTree->SetRoot(fNodes[level]);
477 if (abs(level) >= fTree->RootLevel())
484 to = fTree->RootLevel();
891 fTree(tre
[all...] |
| H A D | ExtentAllocator.cpp | 516 fTree(NULL),
520 fTree = new(std::nothrow) CachedExtentTree(TreeDefinition());
526 delete fTree;
527 fTree = NULL;
549 status = blockGroup.LoadExtent(fTree, false);
554 if (fTree->IsEmpty()) // 4 backup roots is 0
559 status = fTree->FillFreeExtents(lowerBound, upperBound);
579 if (fTree == NULL)
600 fTree->DumpInOrder();
618 status = fTree
[all...] |
| H A D | ExtentAllocator.h | 158 CachedExtentTree* fTree; member in class:ExtentAllocator
|
| H A D | BTree.h | 268 BTree* Tree() const { return fTree; }
275 BTree* fTree; member in class:BTree::Path
296 BTree* Tree() const { return fTree; }
313 BTree* fTree; member in class:TreeIterator
|
| /haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/ |
| H A D | Inode.h | 66 void* fTree; member in class:Inode
|
| /haiku/src/system/boot/loader/file_systems/bfs/ |
| H A D | Directory.h | 42 BPlusTree fTree; member in class:BFS::Directory
|
| H A D | Directory.cpp | 31 fTree(&fStream)
39 fTree(&fStream)
47 fTree(&fStream)
69 *_cookie = (void *)new(nothrow) TreeIterator(&fTree);
91 if (fTree.Find((uint8 *)name, strlen(name), &id) < B_OK)
141 TreeIterator iterator(&fTree);
|
| /haiku/src/tests/system/kernel/file_corruption/fs/ |
| H A D | Directory.cpp | 112 inline uint16 _Depth() const { return fTree->depth; }
117 checksumfs_dir_entry_tree* fTree; member in class:DirEntryTree
1089 fTree = (checksumfs_dir_entry_tree*)
1092 fRootEntryBlock = (checksumfs_dir_entry_block*)(fTree + 1);
1393 fTree->depth++;
|
| /haiku/src/kits/shared/ |
| H A D | ColorQuantizer.cpp | 56 : fTree(NULL),
76 if (fTree != NULL)
77 _DeleteTree(&fTree);
90 _AddColor(&fTree, r, g, b, 0, fBitsPerColor, 0, &fLeafCount,
116 _GetPaletteColors(fTree, tmpPalette, &index, sums);
142 _GetPaletteColors(fTree, table, &index, NULL);
|
| /haiku/headers/private/shared/ |
| H A D | ColorQuantizer.h | 72 Node* fTree; member in class:BPrivate::BColorQuantizer
|