| /haiku/headers/private/kernel/util/ |
| H A D | SplayTree.h | 55 fRoot(NULL)
67 if (fRoot == NULL) {
68 fRoot = node;
77 int c = Definition::Compare(key, fRoot);
81 Link* rootLink = Definition::GetLink(fRoot);
85 nodeLink->right = fRoot;
89 nodeLink->left = fRoot;
93 fRoot = node;
99 if (fRoot == NULL)
104 if (Definition::Compare(key, fRoot) !
348 Node* fRoot; member in class:SplayTree
[all...] |
| H A D | AVLTreeBase.h | 47 inline AVLTreeNode* Root() const { return fRoot; }
101 AVLTreeNode* fRoot; member in class:AVLTreeBase
198 return LeftMost(fRoot);
205 return RightMost(fRoot);
|
| /haiku/src/system/boot/loader/file_systems/amiga_ffs/ |
| H A D | Volume.h | 30 Directory *Root() { return fRoot; }
38 Directory *fRoot; member in class:FFS::Volume
|
| H A D | Volume.cpp | 26 fRoot(NULL)
78 fRoot = new(nothrow) Directory(*this, fRootNode);
79 // fRoot will free the buffer for us upon destruction
85 delete fRoot;
93 if (fRoot != NULL)
|
| /haiku/headers/build/private/storage/mime/ |
| H A D | MimeUpdateThread.h | 43 const entry_ref fRoot; member in class:BPrivate::Storage::Mime::MimeUpdateThread
|
| /haiku/src/servers/registrar/mime/ |
| H A D | MimeUpdateThread.h | 44 const entry_ref fRoot; member in class:BPrivate::Storage::Mime::MimeUpdateThread
|
| H A D | MimeUpdateThread.cpp | 58 fRoot(root ? *root : entry_ref()),
107 err = UpdateEntry(&fRoot);
|
| /haiku/src/system/boot/loader/file_systems/fat/ |
| H A D | Volume.h | 32 Directory *Root() { return fRoot; }
88 Directory *fRoot; member in class:FATFS::Volume
|
| H A D | Volume.cpp | 33 fRoot(NULL)
156 fRoot = new(nothrow) Directory(*this, 0, fRootDirCluster, "/");
168 delete fRoot;
179 if (fRoot == NULL)
|
| /haiku/src/kits/device/ |
| H A D | USBRoster.cpp | 54 WatchedEntry * fRoot; member in class:RosterLooper
188 fRoot(NULL),
205 fRoot = new(std::nothrow) WatchedEntry(fRoster, fMessenger, &ref);
215 delete fRoot;
238 fRoot->EntryCreated(&ref);
247 fRoot->EntryRemoved(node);
|
| /haiku/src/system/kernel/util/ |
| H A D | AVLTreeBase.cpp | 48 : fRoot(NULL),
63 fRoot = NULL;
145 AVLTreeNode* node = fRoot;
165 AVLTreeNode* node = fRoot;
220 AVLTreeNode* node = fRoot;
259 _CheckTree(NULL, fRoot, nodeCount);
388 AVLTreeNode** node = &fRoot;
542 = (parent ? (isLeft ? &parent->left : &parent->right) : &fRoot);
587 nodeP = (parent ? (isLeft ? &parent->left : &parent->right) : &fRoot);
|
| /haiku/src/servers/package/ |
| H A D | Volume.h | 111 { return fRoot; }
113 { fRoot = root; }
196 Root* fRoot; member in class:Volume
|
| H A D | PackageManager.cpp | 40 fRoot(root),
136 if (Volume* volume = fRoot->GetVolume(repository.Location())) {
203 Volume* volume = fRoot->GetVolume(transaction.Repository().Location());
217 Volume* volume = fRoot->GetVolume(transaction.Repository().Location());
|
| H A D | Root.cpp | 101 fRoot(root),
114 fRoot->_CommitTransaction(fVolume, fMessage.Get());
118 Root* fRoot; member in struct:Root::CommitTransactionJob
|
| H A D | PackageManager.h | 103 Root* fRoot; member in class:PackageManager
|
| /haiku/src/add-ons/kernel/file_systems/nfs4/ |
| H A D | RPCServer.cpp | 318 fRoot(NULL)
426 ServerNode* node = fRoot;
447 ServerNode* current = fRoot;
467 fRoot = NULL;
509 ServerNode* current = fRoot;
523 fRoot = node;
|
| H A D | FileSystem.h | 108 RootInode* fRoot; member in class:FileSystem
124 return fRoot;
|
| H A D | FileSystem.cpp | 43 fRoot(NULL),
77 delete fRoot;
245 fs->fRoot = rootInode;
305 if (!fRoot->ProbeMigration())
309 status_t result = fRoot->GetLocations(&values);
|
| H A D | RPCServer.h | 189 ServerNode* fRoot; member in class:RPC::ServerManager
|
| /haiku/src/add-ons/screen_savers/ifs/ |
| H A D | IFS.cpp | 159 fRoot(NULL),
174 if (fRoot == NULL) {
175 fRoot = (FRACTAL*)calloc(1, sizeof(FRACTAL));
176 if (fRoot == NULL)
179 Fractal = fRoot;
273 if (fRoot != NULL) {
274 _FreeIFS(fRoot);
275 free((void*)fRoot);
299 if (fRoot == NULL)
302 F = fRoot;
[all...] |
| H A D | IFS.h | 107 FRACTAL* fRoot; member in class:IFS
|
| /haiku/src/add-ons/kernel/file_systems/xfs/ |
| H A D | BPlusTree.h | 150 BlockInDataFork* fRoot; member in class:TreeDirectory
|
| H A D | BPlusTree.cpp | 16 fRoot(NULL),
25 fRoot = new(std::nothrow) BlockInDataFork;
26 if (fRoot == NULL) {
37 memcpy((void*)fRoot,
49 delete fRoot;
201 for (int i = fRoot->NumRecords() - 1; i >= 0; i--) {
214 int level = fRoot->Levels() - 1;
294 uint16 levelsInTree = fRoot->Levels();
|
| /haiku/src/kits/tracker/ |
| H A D | VirtualDirectoryManager.cpp | 49 fRoot(root),
66 return fRoot;
141 Info* info = new(std::nothrow) Info(fRoot, this, path,
161 RootInfo* fRoot; member in class:BPrivate::VirtualDirectoryManager::Info
|
| /haiku/src/kits/storage/ |
| H A D | PathMonitor.cpp | 623 Ancestor* fRoot; member in class:__anon3::PathHandler
740 fRoot(NULL),
845 fStatus = _StartWatchingAncestors(fRoot, false);
859 while (fRoot != NULL) {
860 Ancestor* nextAncestor = fRoot->Child();
861 delete fRoot;
862 fRoot = nextAncestor;
952 if (fRoot == NULL)
953 fRoot = ancestor;
1249 _StopWatchingAncestors(fRoot, fals
[all...] |