/haiku/src/add-ons/kernel/file_systems/netfs/client/ |
H A D | ShareVolume.cpp | 155 fNodes(NULL), 183 if (fNodes) 184 fNodes->Remove(fRootNode->GetID()); 190 if (fNodes) { 192 if (fNodes->Size() > 0) { 194 "%" B_PRId32 " nodes\n", fNodes->Size()); 196 for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) 198 delete fNodes; 256 fNodes = new(std::nothrow) NodeMap; 257 if (!fNodes) [all...] |
H A D | ShareVolume.h | 232 NodeMap* fNodes; // local ID -> ShareNode member in class:ShareVolume
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | Volume.cpp | 93 fNodes(NULL), 111 if (fNodes) { 117 for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) { 122 delete fNodes; 134 fNodes = new(std::nothrow) NodeMap; 135 if (!fNodes) 137 if (fNodes->InitCheck() != B_OK) 138 return fNodes->InitCheck(); 215 return fNodes->Put(node->GetID(), node); 223 fNodes [all...] |
H A D | Volume.h | 43 NodeMap* fNodes; member in class:Volume
|
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/ |
H A D | AttributeIndex.cpp | 154 return index->fNodes; 172 return index->fNodes->GetIterator().Next(); 177 return index->fNodes->FindClosest(value, false); 250 fNodes(NULL), 265 delete fNodes; 287 fNodes = new(std::nothrow) NodeTree(TreeDefinition(type)); 291 if (fNodes == NULL || fIteratorsToUpdate == NULL || fIndexer == NULL) 301 return fNodes->Count(); 314 fNodes->Insert(treeValue); 326 fNodes [all...] |
H A D | AttributeIndex.h | 57 NodeTree* fNodes; member in class:AttributeIndex
|
H A D | LastModifiedIndex.cpp | 115 return index->fNodes; 140 fNodes(NULL), 154 delete fNodes; 168 fNodes = new(std::nothrow) NodeTree; 170 if (fNodes == NULL || fIteratorsToUpdate == NULL) 180 return fNodes->CountItems(); 187 fNodes->Insert(node); 194 fNodes->Remove(node, node); 211 Node** foundNode = fNodes->Find( 226 if (fNodes [all...] |
H A D | LastModifiedIndex.h | 45 NodeTree* fNodes; member in class:LastModifiedIndex
|
H A D | SizeIndex.cpp | 114 return index->fNodes; 139 fNodes(NULL), 153 delete fNodes; 167 fNodes = new(std::nothrow) NodeTree; 169 if (fNodes == NULL || fIteratorsToUpdate == NULL) 179 return fNodes->CountItems(); 186 fNodes->Insert(node); 193 fNodes->Remove(node, node); 210 Node** foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize), node, 224 if (fNodes [all...] |
H A D | SizeIndex.h | 45 NodeTree* fNodes; member in class:SizeIndex
|
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
H A D | Volume.h | 71 { return fNodes.Lookup(nodeID); } 198 NodeIDHashTable fNodes; member in class:Volume
|
H A D | Volume.cpp | 206 Node* node = fNodes.Clear(true); 238 error = fNodes.Init(); 406 fNodes.Insert(fRootDirectory); 1236 fNodes.Insert(node); 1345 fNodes.Insert(newNode); 1411 fNodes.Insert(node); 1428 fNodes.Remove(node); 1712 fNodes.Insert(directory); 1882 fNodes.Insert(node); 1910 fNodes [all...] |
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/ |
H A D | HaikuKernelVolume.cpp | 47 fNodes(NULL) 64 delete fNodes; 72 fNodes = new(std::nothrow) NodeMap; 73 if (fNodes == NULL) 75 return fNodes->InitCheck(); 84 AutoLocker<NodeMap> _(fNodes); 87 HaikuKernelNode* node = fNodes->Get(vnodeID); 106 status_t error = fNodes->Put(vnodeID, node); 123 AutoLocker<NodeMap> _(fNodes); 126 HaikuKernelNode* node = fNodes [all...] |
H A D | HaikuKernelVolume.h | 206 NodeMap* fNodes; member in class:UserlandFS::HaikuKernelVolume
|
/haiku/src/apps/debuganalyzer/gui/table/ |
H A D | TreeTable.cpp | 578 fNodes(NULL), 586 delete[] fNodes; 625 delete[] fNodes; 626 fNodes = NULL; 647 fNodes = new(std::nothrow) TreeTableNode*[fNodeCount]; 648 if (fNodes == NULL) { 657 fNodes[index++] = dynamic_cast<TreeTableRow*>(row)->Node(); 666 return index >= 0 && index < fNodeCount ? fNodes[index] : NULL;
|
H A D | TreeTable.h | 123 TreeTableNode** fNodes; member in class:TreeTableSelectionModel
|
/haiku/src/kits/storage/ |
H A D | PathMonitor.cpp | 627 NodeMap fNodes; member in class:__anon3::PathHandler 744 fNodes() 755 fStatus = fNodes.Init(); 1684 fNodes.Insert(nodeDeleter.Detach()); 1742 fNodes.Remove(node); 1750 return fNodes.Lookup(nodeRef);
|
H A D | QueryPredicate.cpp | 449 for (int32 i = 0; QueryNode *node = (QueryNode*)fNodes.ItemAt(i); i++) 459 if (!fNodes.AddItem(node)) 469 return (QueryNode*)fNodes.RemoveItem(fNodes.CountItems() - 1); 477 if (error == B_OK && !fNodes.IsEmpty()) {
|
/haiku/headers/private/storage/ |
H A D | QueryPredicate.h | 202 BList fNodes; member in class:BPrivate::Storage::QueryStack
|
/haiku/src/add-ons/kernel/file_cache/ |
H A D | launch_speedup.cpp | 131 struct node *fNodes; member in class:Session 374 fNodes(NULL), 409 fNodes(NULL), 436 node = fNodes; 524 if (fNodes == NULL || fNodeHash != NULL) 527 for (struct node *node = fNodes; node != NULL; node = node->next) { 573 node->next = fNodes; 574 fNodes = node;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.cpp | 305 fNodes[i] = NULL; 314 delete fNodes[i]; 315 fNodes[i] = NULL; 326 return fNodes[level]; 342 if (fNodes[level] == NULL) { 343 fNodes[level] = new Node(fTree->SystemVolume(), node->BlockNum()); 344 if (fNodes[level] == NULL) 347 fNodes[level]->SetTo(node->BlockNum()); 350 fSlots[level] = fNodes[level]->ItemCount() - 1; 353 return fNodes[leve [all...] |
H A D | BTree.h | 273 Node* fNodes[BTRFS_MAX_TREE_DEPTH]; member in class:BTree::Path
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | Package.cpp | 543 while (PackageNode* node = fNodes.RemoveHead()) 623 fNodes.Add(node);
|
H A D | Package.h | 104 const PackageNodeList& Nodes() const { return fNodes; } 141 PackageNodeList fNodes; member in class:Package
|
/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | LastModifiedIndex.cpp | 110 fNodes(new(nothrow) NodeTree), 113 if (fInitStatus == B_OK && (!fNodes || !fIterators)) 135 if (fNodes) 136 delete fNodes; 143 return fNodes->CountItems(); 153 Node **foundNode = fNodes->Find(LastModifiedIndexPrimaryKey(node, 165 error = fNodes->Insert(node); 182 fNodes->Insert(node); 190 fNodes->Remove(node, node); 329 fIndex->fNodes [all...] |