Searched refs:fNodes (Results 1 - 25 of 36) sorted by relevance

12

/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeTable.cpp12 fInitStatus = fNodes.Init(1000);
33 if (fNodes.Lookup(node->GetID()) != NULL)
34 fNodes.Remove(node);
35 SET_ERROR(error, fNodes.Insert(node));
55 if (Node *element = fNodes.Lookup(id))
56 fNodes.Remove(element);
66 Node *node = fNodes.Lookup(id);
74 info.AddNodeTableAllocation(0, fNodes.TableSize(),
75 sizeof(Node*), fNodes.CountElements());
H A DSizeIndex.cpp108 fNodes(new(nothrow) NodeTree),
111 if (fInitStatus == B_OK && (!fNodes || !fIterators))
133 if (fNodes)
134 delete fNodes;
141 return fNodes->CountItems();
151 Node **foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize),
164 error = fNodes->Insert(node);
181 fNodes->Insert(node);
189 fNodes->Remove(node, node);
327 fIndex->fNodes
[all...]
H A DLastModifiedIndex.cpp110 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...]
H A DSizeIndex.h42 NodeTree *fNodes; member in class:SizeIndex
H A DLastModifiedIndex.h42 NodeTree *fNodes; member in class:LastModifiedIndex
H A DNodeTable.h56 BOpenHashTable<NodeHash> fNodes; member in class:NodeTable
/haiku/src/apps/haikudepot/process/
H A DProcessCoordinator.cpp156 for (int32 i = 0; i < fNodes.CountItems(); i++) {
157 AbstractProcessNode* node = fNodes.ItemAt(i);
182 fNodes.AddItem(node);
199 for (int32 i = 0; i < fNodes.CountItems(); i++) {
200 AbstractProcessNode* node = fNodes.ItemAt(i);
223 for (int32 i = 0; i < fNodes.CountItems(); i++) {
224 AbstractProcessNode* node = fNodes.ItemAt(i);
237 for (int32 i = 0; i < fNodes.CountItems(); i++) {
238 status_t result = fNodes.ItemAt(i)->Process()->ErrorStatus();
255 int32 count = fNodes
[all...]
H A DProcessCoordinator.h134 fNodes; member in class:ProcessCoordinator
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DVolume.cpp93 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 DVolume.h43 NodeMap* fNodes; member in class:Volume
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DLastModifiedIndex.cpp115 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 DSizeIndex.cpp114 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 DAttributeIndex.cpp154 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 DLastModifiedIndex.h45 NodeTree* fNodes; member in class:LastModifiedIndex
H A DSizeIndex.h45 NodeTree* fNodes; member in class:SizeIndex
H A DAttributeIndex.h57 NodeTree* fNodes; member in class:AttributeIndex
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp305 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...]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelVolume.cpp47 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...]
/haiku/src/kits/storage/
H A DQueryPredicate.cpp449 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/src/add-ons/kernel/file_systems/packagefs/package/
H A DPackage.h104 const PackageNodeList& Nodes() const { return fNodes; }
141 PackageNodeList fNodes; member in class:Package
/haiku/src/add-ons/kernel/file_cache/
H A Dlaunch_speedup.cpp131 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/netfs/client/
H A DShareVolume.cpp155 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...]
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DVolume.h71 { return fNodes.Lookup(nodeID); }
198 NodeIDHashTable fNodes; member in class:Volume
/haiku/src/apps/debuganalyzer/gui/table/
H A DTreeTable.cpp578 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;
/haiku/headers/private/storage/
H A DQueryPredicate.h202 BList fNodes; member in class:BPrivate::Storage::QueryStack

Completed in 133 milliseconds

12