headers/private/storage/QueryPredicate.h

202

BList fNodes;

src/add-ons/kernel/file_cache/launch_speedup.cpp

131

struct node *fNodes;

src/add-ons/kernel/file_cache/launch_speedup.cpp

374

fNodes(NULL),

src/add-ons/kernel/file_cache/launch_speedup.cpp

409

fNodes(NULL),

src/add-ons/kernel/file_cache/launch_speedup.cpp

436

node = fNodes;

src/add-ons/kernel/file_cache/launch_speedup.cpp

524

if (fNodes == NULL || fNodeHash != NULL)

src/add-ons/kernel/file_cache/launch_speedup.cpp

527

for (struct node *node = fNodes; node != NULL; node = node->next) {

src/add-ons/kernel/file_cache/launch_speedup.cpp

573

node->next = fNodes;

src/add-ons/kernel/file_cache/launch_speedup.cpp

574

fNodes = node;

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

305

fNodes[i] = NULL;

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

314

delete fNodes[i];

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

315

fNodes[i] = NULL;

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

326

return fNodes[level];

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

342

if (fNodes[level] == NULL) {

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

343

fNodes[level] = new Node(fTree->SystemVolume(), node->BlockNum());

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

344

if (fNodes[level] == NULL)

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

347

fNodes[level]->SetTo(node->BlockNum());

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

350

fSlots[level] = fNodes[level]->ItemCount() - 1;

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

353

return fNodes[level];

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

363

if (static_cast<uint32>(fSlots[level]) >= fNodes[level]->ItemCount())

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

373

BTree::Node* leaf = fNodes[0];

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

405

memcpy(fNodes[0]->Item(slot), &entry, sizeof(btrfs_entry));

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

406

memcpy(fNodes[0]->ItemData(slot), value, entry.Size());

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

415

Node* node = fNodes[level];

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

441

fNodes[level] = new(std::nothrow) BTree::Node(fTree->SystemVolume());

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

442

if (fNodes[level] == NULL)

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

445

fNodes[level]->SetToWritable(block, transaction.ID(), true);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

447

status = fNodes[level]->Copy(node, start, start + num - 1, length);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

451

fNodes[level]->SetGeneration(transaction.SystemID());

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

452

fNodes[level]->SetLogicalAddress(address);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

454

fNodes[level]->SetItemCount(node->ItemCount() - num);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

456

fNodes[level]->SetItemCount(node->ItemCount() + num);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

458

fNodes[level]->SetItemCount(num);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

467

fTree->SetRoot(fNodes[level]);

src/add-ons/kernel/file_systems/btrfs/BTree.cpp

495

node = fNodes[from];

src/add-ons/kernel/file_systems/btrfs/BTree.h

273

Node* fNodes[BTRFS_MAX_TREE_DEPTH];

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

155

fNodes(NULL),

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

183

if (fNodes)

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

184

fNodes->Remove(fRootNode->GetID());

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

190

if (fNodes) {

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

192

if (fNodes->Size() > 0) {

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

194

"%" B_PRId32 " nodes\n", fNodes->Size());

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

196

for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();)

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

198

delete fNodes;

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

2421

return fNodes->Get(localID);

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

2432

return fNodes->Get(localID);

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

2469

error = fNodes->Put(node->GetID(), node);

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

256

fNodes = new(std::nothrow) NodeMap;

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

257

if (!fNodes)

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

259

error = fNodes->InitCheck();

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

2810

fNodes->Remove(localID);

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

308

error = fNodes->Put(localID, fRootNode);

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

353

int32 count = fNodes->Size();

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

365

for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) {

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

376

if (Node* node = fNodes->Get(ids[i])) {

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

383

fNodes->Remove(node->GetID());

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.cpp

533

fNodes->Remove(node->GetID());

src/add-ons/kernel/file_systems/netfs/client/ShareVolume.h

232

NodeMap* fNodes; // local ID -> ShareNode

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

111

if (fNodes) {

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

117

for (NodeMap::Iterator it = fNodes->GetIterator(); it.HasNext();) {

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

122

delete fNodes;

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

134

fNodes = new(std::nothrow) NodeMap;

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

135

if (!fNodes)

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

137

if (fNodes->InitCheck() != B_OK)

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

138

return fNodes->InitCheck();

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

215

return fNodes->Put(node->GetID(), node);

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

223

fNodes->Remove(node->GetID());

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

234

return fNodes->Get(nodeID);

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

241

NodeMap::Iterator it = fNodes->GetIterator();

src/add-ons/kernel/file_systems/netfs/server/Volume.cpp

93

fNodes(NULL),

src/add-ons/kernel/file_systems/netfs/server/Volume.h

43

NodeMap* fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

154

return index->fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

172

return index->fNodes->GetIterator().Next();

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

177

return index->fNodes->FindClosest(value, false);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

250

fNodes(NULL),

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

265

delete fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

287

fNodes = new(std::nothrow) NodeTree(TreeDefinition(type));

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

291

if (fNodes == NULL || fIteratorsToUpdate == NULL || fIndexer == NULL)

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

301

return fNodes->Count();

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

314

fNodes->Insert(treeValue);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

326

fNodes->Remove(treeValue);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

351

fNodes->Remove(oldTreeValue);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.cpp

356

fNodes->Insert(treeValue);

src/add-ons/kernel/file_systems/packagefs/indices/AttributeIndex.h

57

NodeTree* fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

115

return index->fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

140

fNodes(NULL),

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

154

delete fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

168

fNodes = new(std::nothrow) NodeTree;

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

170

if (fNodes == NULL || fIteratorsToUpdate == NULL)

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

180

return fNodes->CountItems();

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

187

fNodes->Insert(node);

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

194

fNodes->Remove(node, node);

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

211

Node** foundNode = fNodes->Find(

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.cpp

226

if (fNodes->Insert(node) != B_OK) {

src/add-ons/kernel/file_systems/packagefs/indices/LastModifiedIndex.h

45

NodeTree* fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

114

return index->fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

139

fNodes(NULL),

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

153

delete fNodes;

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

167

fNodes = new(std::nothrow) NodeTree;

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

169

if (fNodes == NULL || fIteratorsToUpdate == NULL)

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

179

return fNodes->CountItems();

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

186

fNodes->Insert(node);

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

193

fNodes->Remove(node, node);

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

210

Node** foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize), node,

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.cpp

224

if (fNodes->Insert(node) != B_OK) {

src/add-ons/kernel/file_systems/packagefs/indices/SizeIndex.h

45

NodeTree* fNodes;

src/add-ons/kernel/file_systems/packagefs/package/Package.cpp

542

while (PackageNode* node = fNodes.RemoveHead())

src/add-ons/kernel/file_systems/packagefs/package/Package.cpp

622

fNodes.Add(node);

src/add-ons/kernel/file_systems/packagefs/package/Package.h

104

const PackageNodeList& Nodes() const { return fNodes; }

src/add-ons/kernel/file_systems/packagefs/package/Package.h

141

PackageNodeList fNodes;

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1250

fNodes.Insert(node);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1366

fNodes.Insert(newNode);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1432

fNodes.Insert(node);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1449

fNodes.Remove(node);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1749

fNodes.Insert(directory);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1921

fNodes.Insert(node);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

1949

fNodes.Remove(node);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

206

Node* node = fNodes.Clear(true);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

238

error = fNodes.Init();

src/add-ons/kernel/file_systems/packagefs/volume/Volume.cpp

406

fNodes.Insert(fRootDirectory);

src/add-ons/kernel/file_systems/packagefs/volume/Volume.h

199

NodeIDHashTable fNodes;

src/add-ons/kernel/file_systems/packagefs/volume/Volume.h

72

{ return fNodes.Lookup(nodeID); }

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

113

fNodes(new(nothrow) NodeTree),

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

116

if (fInitStatus == B_OK && (!fNodes || !fIterators))

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

138

if (fNodes)

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

139

delete fNodes;

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

146

return fNodes->CountItems();

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

158

Node **foundNode = fNodes->Find(LastModifiedIndexPrimaryKey(node,

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

170

error = fNodes->Insert(node);

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

187

fNodes->Insert(node);

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

195

fNodes->Remove(node, node);

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

336

fIndex->fNodes->GetIterator(&fIterator);

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.cpp

338

found = fIndex->fNodes->FindFirst(modified, &fIterator);

src/add-ons/kernel/file_systems/ramfs/LastModifiedIndex.h

42

NodeTree *fNodes;

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

12

fInitStatus = fNodes.Init(1000);

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

33

if (fNodes.Lookup(node->GetID()) != NULL)

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

34

fNodes.Remove(node);

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

35

SET_ERROR(error, fNodes.Insert(node));

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

55

if (Node *element = fNodes.Lookup(id))

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

56

fNodes.Remove(element);

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

66

Node *node = fNodes.Lookup(id);

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

74

info.AddNodeTableAllocation(0, fNodes.TableSize(),

src/add-ons/kernel/file_systems/ramfs/NodeTable.cpp

75

sizeof(Node*), fNodes.CountElements());

src/add-ons/kernel/file_systems/ramfs/NodeTable.h

56

BOpenHashTable<NodeHash> fNodes;

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

111

fNodes(new(nothrow) NodeTree),

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

114

if (fInitStatus == B_OK && (!fNodes || !fIterators))

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

136

if (fNodes)

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

137

delete fNodes;

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

144

return fNodes->CountItems();

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

156

Node **foundNode = fNodes->Find(SizeIndexPrimaryKey(node, oldSize),

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

169

error = fNodes->Insert(node);

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

186

fNodes->Insert(node);

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

194

fNodes->Remove(node, node);

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

334

fIndex->fNodes->GetIterator(&fIterator);

src/add-ons/kernel/file_systems/ramfs/SizeIndex.cpp

336

found = fIndex->fNodes->FindFirst(size, &fIterator);

src/add-ons/kernel/file_systems/ramfs/SizeIndex.h

42

NodeTree *fNodes;

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

2624

} while (fNodes.Lookup(id) != NULL);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

2782

node = fNodes.Lookup(st.st_ino);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

2792

fNodes.Insert(node);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

2825

fNodes.Remove(node);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

3371

node = fNodes.Lookup(nodeID);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

3417

fNodes.Insert(node);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

3503

node = fNodes.Lookup(nodeID);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

3549

fNodes.Insert(node);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

724

error = fNodes.Init();

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

796

fNodes.Insert(node);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

839

FUSENodeTable::Iterator it = fNodes.GetIterator();

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.cpp

983

FUSENode* node = fNodes.Lookup(vnid);

src/add-ons/kernel/file_systems/userlandfs/server/fuse/FUSEVolume.h

224

FUSENodeTable fNodes;

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

106

status_t error = fNodes->Put(vnodeID, node);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

123

AutoLocker<NodeMap> _(fNodes);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

126

HaikuKernelNode* node = fNodes->Get(vnodeID);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

146

status_t error = fNodes->Put(vnodeID, node);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

165

fNodes->Remove(node->id);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

174

fNodes->Remove(node->id);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

183

return fNodes->Get(vnodeID);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

307

AutoLocker<NodeMap> locker(fNodes);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

308

if (fNodes->Get(vnid) != NULL)

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

311

status_t error = fNodes->Put(vnid, node);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

321

fNodes->Remove(vnid);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

331

fNodes->Remove(vnid);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

352

fNodes->Remove(node->id);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

369

fNodes->Remove(node->id);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

64

delete fNodes;

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

72

fNodes = new(std::nothrow) NodeMap;

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

73

if (fNodes == NULL)

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

75

return fNodes->InitCheck();

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

84

AutoLocker<NodeMap> _(fNodes);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.cpp

87

HaikuKernelNode* node = fNodes->Get(vnodeID);

src/add-ons/kernel/file_systems/userlandfs/server/haiku/HaikuKernelVolume.h

206

NodeMap* fNodes;

src/apps/debuganalyzer/gui/table/TreeTable.cpp

578

fNodes(NULL),

src/apps/debuganalyzer/gui/table/TreeTable.cpp

586

delete[] fNodes;

src/apps/debuganalyzer/gui/table/TreeTable.cpp

625

delete[] fNodes;

src/apps/debuganalyzer/gui/table/TreeTable.cpp

626

fNodes = NULL;

src/apps/debuganalyzer/gui/table/TreeTable.cpp

647

fNodes = new(std::nothrow) TreeTableNode*[fNodeCount];

src/apps/debuganalyzer/gui/table/TreeTable.cpp

648

if (fNodes == NULL) {

src/apps/debuganalyzer/gui/table/TreeTable.cpp

657

fNodes[index++] = dynamic_cast<TreeTableRow*>(row)->Node();

src/apps/debuganalyzer/gui/table/TreeTable.cpp

666

return index >= 0 && index < fNodeCount ? fNodes[index] : NULL;

src/apps/debuganalyzer/gui/table/TreeTable.h

123

TreeTableNode** fNodes;

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1193

int32 count = fNodes.CountItems();

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1196

if (!fNodes.IsEmpty()) {

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1198

fNodes.ItemAt(i)->ReleaseReference();

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1199

fNodes.MakeEmpty();

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1389

return fNodes.CountItems();

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1409

return fNodes.ItemAt(index);

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1673

int32 index = fNodes.IndexOf(node);

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1679

fNodes.RemoveItemAt(index);

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1713

childIndex = fNodes.CountItems();

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1715

if (!fNodes.AddItem(node))

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

1775

int32 index = fNodes.IndexOf(node);

src/apps/debugger/user_interface/gui/team_window/VariablesView.cpp

759

NodeList fNodes;

src/apps/haikudepot/process/ProcessCoordinator.cpp

144

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

145

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.cpp

170

fNodes.AddItem(node);

src/apps/haikudepot/process/ProcessCoordinator.cpp

187

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

188

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.cpp

211

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

212

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.cpp

225

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

226

status_t result = fNodes.ItemAt(i)->Process()->ErrorStatus();

src/apps/haikudepot/process/ProcessCoordinator.cpp

243

int32 count = fNodes.CountItems();

src/apps/haikudepot/process/ProcessCoordinator.cpp

249

result = fNodes.ItemAt(0)->Process()->Progress();

src/apps/haikudepot/process/ProcessCoordinator.cpp

254

AbstractProcess* process = fNodes.ItemAt(i)->Process();

src/apps/haikudepot/process/ProcessCoordinator.cpp

298

for (int32 i = fNodes.CountItems() - 1; i >= 0; i--) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

299

AbstractProcess* process = fNodes.ItemAt(i)->Process();

src/apps/haikudepot/process/ProcessCoordinator.cpp

385

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

386

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.cpp

410

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

411

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.cpp

443

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

444

AbstractProcess *process = fNodes.ItemAt(i)->Process();

src/apps/haikudepot/process/ProcessCoordinator.cpp

458

for (int32 i = 0; i < fNodes.CountItems(); i++) {

src/apps/haikudepot/process/ProcessCoordinator.cpp

461

AbstractProcessNode* node = fNodes.ItemAt(i);

src/apps/haikudepot/process/ProcessCoordinator.h

134

fNodes;

src/kits/storage/PathMonitor.cpp

1684

fNodes.Insert(nodeDeleter.Detach());

src/kits/storage/PathMonitor.cpp

1742

fNodes.Remove(node);

src/kits/storage/PathMonitor.cpp

1750

return fNodes.Lookup(nodeRef);

src/kits/storage/PathMonitor.cpp

627

NodeMap fNodes;

src/kits/storage/PathMonitor.cpp

755

fStatus = fNodes.Init();

src/kits/storage/QueryPredicate.cpp

449

for (int32 i = 0; QueryNode *node = (QueryNode*)fNodes.ItemAt(i); i++)

src/kits/storage/QueryPredicate.cpp

459

if (!fNodes.AddItem(node))

src/kits/storage/QueryPredicate.cpp

469

return (QueryNode*)fNodes.RemoveItem(fNodes.CountItems() - 1);

src/kits/storage/QueryPredicate.cpp

477

if (error == B_OK && !fNodes.IsEmpty()) {

src/system/kernel/module.cpp

1319

return fNodes.Lookup(&entry) != NULL;

src/system/kernel/module.cpp

1329

hash_entry* entry = fNodes.Lookup(&key);

src/system/kernel/module.cpp

1337

fNodes.Remove(entry);

src/system/kernel/module.cpp

1377

fNodes.Insert(entry);

src/system/kernel/module.cpp

1587

hash_entry* entry = fNodes.Lookup(&key);

src/system/kernel/module.cpp

272

NodeHash fNodes;