headers/private/kernel/util/AVLTree.h

196

fTree(this),

headers/private/kernel/util/AVLTree.h

205

fTree(this),

headers/private/kernel/util/AVLTree.h

221

fTree.MakeEmpty();

headers/private/kernel/util/AVLTree.h

229

if (AVLTreeNode* root = fTree.Root())

headers/private/kernel/util/AVLTree.h

242

AVLTreeNode* node = fTree.Previous(_GetAVLTreeNode(value));

headers/private/kernel/util/AVLTree.h

254

AVLTreeNode* node = fTree.Next(_GetAVLTreeNode(value));

headers/private/kernel/util/AVLTree.h

263

AVLTreeNode* node = fTree.LeftMost();

headers/private/kernel/util/AVLTree.h

275

AVLTreeNode* node = fTree.LeftMost(_GetAVLTreeNode(value));

headers/private/kernel/util/AVLTree.h

284

AVLTreeNode* node = fTree.RightMost();

headers/private/kernel/util/AVLTree.h

296

AVLTreeNode* node = fTree.RightMost(_GetAVLTreeNode(value));

headers/private/kernel/util/AVLTree.h

305

return Iterator(this, fTree.GetIterator());

headers/private/kernel/util/AVLTree.h

313

return ConstIterator(this, fTree.GetIterator());

headers/private/kernel/util/AVLTree.h

321

return Iterator(this, fTree.GetIterator(_GetAVLTreeNode(value)));

headers/private/kernel/util/AVLTree.h

329

return ConstIterator(this, fTree.GetIterator(_GetAVLTreeNode(value)));

headers/private/kernel/util/AVLTree.h

337

if (AVLTreeNode* node = fTree.Find(&key))

headers/private/kernel/util/AVLTree.h

347

if (AVLTreeNode* node = fTree.FindClosest(&key, less))

headers/private/kernel/util/AVLTree.h

358

status_t error = fTree.Insert(node);

headers/private/kernel/util/AVLTree.h

363

*iterator = Iterator(this, fTree.GetIterator(node));

headers/private/kernel/util/AVLTree.h

373

AVLTreeNode* node = fTree.Remove(&key);

headers/private/kernel/util/AVLTree.h

382

return fTree.Remove(_GetAVLTreeNode(value));

headers/private/kernel/util/AVLTree.h

41

inline int Count() const { return fTree.Count(); }

headers/private/kernel/util/AVLTree.h

42

inline bool IsEmpty() const { return fTree.IsEmpty(); }

headers/private/kernel/util/AVLTree.h

68

void CheckTree() const { fTree.CheckTree(); }

headers/private/kernel/util/AVLTree.h

87

AVLTreeBase fTree;

headers/private/kernel/util/AVLTreeMap.h

112

AVLTreeBase fTree;

headers/private/kernel/util/AVLTreeMap.h

252

: fTree(this),

headers/private/kernel/util/AVLTreeMap.h

270

AVLTreeNode* root = fTree.Root();

headers/private/kernel/util/AVLTreeMap.h

272

fTree.MakeEmpty();

headers/private/kernel/util/AVLTreeMap.h

281

if (AVLTreeNode* root = fTree.Root())

headers/private/kernel/util/AVLTreeMap.h

295

AVLTreeNode* treeNode = fTree.Previous(_GetAVLTreeNode(node));

headers/private/kernel/util/AVLTreeMap.h

308

AVLTreeNode* treeNode = fTree.Next(_GetAVLTreeNode(node));

headers/private/kernel/util/AVLTreeMap.h

318

return Iterator(this, fTree.GetIterator());

headers/private/kernel/util/AVLTreeMap.h

327

return ConstIterator(this, fTree.GetIterator());

headers/private/kernel/util/AVLTreeMap.h

336

return Iterator(this, fTree.GetIterator(_GetAVLTreeNode(node)));

headers/private/kernel/util/AVLTreeMap.h

345

return ConstIterator(this, fTree.GetIterator(_GetAVLTreeNode(node)));

headers/private/kernel/util/AVLTreeMap.h

354

if (AVLTreeNode* node = fTree.Find(&key))

headers/private/kernel/util/AVLTreeMap.h

355

return Iterator(this, fTree.GetIterator(node));

headers/private/kernel/util/AVLTreeMap.h

365

if (AVLTreeNode* node = fTree.FindClosest(&key, less))

headers/private/kernel/util/AVLTreeMap.h

366

return Iterator(this, fTree.GetIterator(node));

headers/private/kernel/util/AVLTreeMap.h

384

status_t error = fTree.Insert(node);

headers/private/kernel/util/AVLTreeMap.h

391

*iterator = Iterator(this, fTree.GetIterator(node));

headers/private/kernel/util/AVLTreeMap.h

410

status_t error = fTree.Insert(node);

headers/private/kernel/util/AVLTreeMap.h

428

AVLTreeNode* node = fTree.Remove(&key);

headers/private/kernel/util/AVLTreeMap.h

442

if (!fTree.Remove(node))

headers/private/kernel/util/AVLTreeMap.h

62

inline int Count() const { return fTree.Count(); }

headers/private/kernel/util/AVLTreeMap.h

63

inline bool IsEmpty() const { return fTree.IsEmpty(); }

headers/private/shared/ColorQuantizer.h

72

Node* fTree;

headers/private/util/SplayTree.h

374

fTree(tree)

headers/private/util/SplayTree.h

381

fTree(tree),

headers/private/util/SplayTree.h

409

fTree->Remove(fCurrent);

headers/private/util/SplayTree.h

417

fTree = other.fTree;

headers/private/util/SplayTree.h

426

fNext = fTree->fFirst;

headers/private/util/SplayTree.h

430

Tree* fTree;

headers/private/util/SplayTree.h

448

fTree(tree)

headers/private/util/SplayTree.h

455

fTree(tree),

headers/private/util/SplayTree.h

475

fTree = other.fTree;

headers/private/util/SplayTree.h

482

fNext = fTree->fFirst;

headers/private/util/SplayTree.h

486

const Tree* fTree;

headers/private/util/SplayTree.h

492

fTree(),

headers/private/util/SplayTree.h

499

if (!fTree.Insert(node))

headers/private/util/SplayTree.h

503

if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node)))

headers/private/util/SplayTree.h

516

Node* node = fTree.Remove(key);

headers/private/util/SplayTree.h

521

if (Node* previous = fTree.PreviousDontSplay(key))

headers/private/util/SplayTree.h

533

if (!fTree.Remove(node))

headers/private/util/SplayTree.h

537

if (Node* previous = fTree.PreviousDontSplay(Definition::GetKey(node)))

headers/private/util/SplayTree.h

549

return fTree.Lookup(key);

headers/private/util/SplayTree.h

554

return fTree.Root();

headers/private/util/SplayTree.h

563

return fTree.IsEmpty();

headers/private/util/SplayTree.h

568

return fTree.PreviousDontSplay(key);

headers/private/util/SplayTree.h

573

return fTree.FindClosest(key, greater, orEqual);

headers/private/util/SplayTree.h

578

return fTree.FindMin();

headers/private/util/SplayTree.h

583

return fTree.FindMax();

headers/private/util/SplayTree.h

598

return Iterator(this, fTree.FindClosest(key, greater, orEqual));

headers/private/util/SplayTree.h

608

fTree = other.fTree;

headers/private/util/SplayTree.h

618

SplayTree<Definition> fTree;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

251

if (fTree == NULL || fTree->fStream == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

255

void* cache = fTree->fStream->GetVolume()->BlockCache();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2589

fTree(tree),

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2601

if (fTree)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2602

fTree->_RemoveIterator(this);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2610

if (fTree == NULL || fTree->fStream == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2615

InodeReadLocker locker(fTree->fStream);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2618

off_t nodeOffset = fTree->fHeader.RootNode();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2619

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2638

if (node->AllKeyLength() > fTree->fNodeSize

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2639

|| (addr_t)node->Values() > (addr_t)node + fTree->fNodeSize

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2671

if (fTree == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2686

InodeReadLocker locker(fTree->fStream);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2689

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

269

if (fTree == NULL || fTree->fStream == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2765

> (uint8*)node + fTree->fNodeSize

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2768

fTree->fStream->GetVolume()->Panic();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

277

memcpy(&fTree->fHeader, fNode, sizeof(bplustree_header));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2774

bool needsTermination = fTree->fHeader.DataType() == BPLUSTREE_STRING_TYPE;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

280

block_cache_put(fTree->fStream->GetVolume()->BlockCache(),

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2838

if (fTree == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2847

InodeReadLocker locker(fTree->fStream);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2850

off_t nodeOffset = fTree->fHeader.RootNode();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2852

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2857

status_t status = fTree->_FindKey(node, key, keyLength, &keyIndex,

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2910

fTree = NULL;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

2919

__out("\tfTree = %p\n", fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

304

if (fTree == NULL || fTree->fStream == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

310

if (offset > fTree->fHeader.MaximumSize() - fTree->fNodeSize

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

312

|| (offset % fTree->fNodeSize) != 0) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

323

if (!fTree->fHeader.CheckNode(fNode)) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

326

fBlockNumber, fTree->fStream->ID()));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

341

if (fTree == NULL || fTree->fStream == NULL) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

349

if (offset > fTree->fHeader.MaximumSize() - fTree->fNodeSize

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

351

|| (offset % fTree->fNodeSize) != 0) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

361

if (!fTree->fHeader.CheckNode(fNode)) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

364

fBlockNumber, fTree->fStream->ID()));

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

393

if (fTree == NULL || fTree->fStream == NULL) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

407

if (fTree == NULL || fTree->fStream == NULL) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

414

if (fNode != NULL && !fTree->fInTransaction) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

415

transaction.AddListener(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

416

fTree->fInTransaction = true;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

419

&& fTree->fStream != transaction.GetVolume()->IndicesNode()) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

421

fTree->fStream->ID());

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

433

if (offset >= fTree->fStream->Size()) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

440

status_t status = fTree->fStream->FindBlockRun(offset, run, fileOffset);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

447

Volume* volume = fTree->fStream->GetVolume();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

449

Volume* volume = &fTree->fStream->GetVolume();

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

509

if (fTree == NULL || fTree->fStream == NULL || offset == BPLUSTREE_NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

517

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

527

off_t lastOffset = header->MaximumSize() - fTree->fNodeSize;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

529

status_t status = fTree->fStream->SetFileSize(transaction, lastOffset);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

551

if (fTree == NULL || fTree->fStream == NULL)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

560

if (SetToWritable(transaction, fTree->fHeader.FreeNode(), false) != NULL) {

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

561

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

576

Inode* stream = fTree->fStream;

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

577

if ((status = stream->Append(transaction, fTree->fNodeSize)) != B_OK)

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

580

CachedNode cached(fTree);

src/add-ons/kernel/file_systems/bfs/BPlusTree.cpp

589

+ fTree->fNodeSize);

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

179

fTree(tree),

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

190

fTree(tree),

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

236

BPlusTree* fTree;

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

409

BPlusTree* Tree() const { return fTree; }

src/add-ons/kernel/file_systems/bfs/BPlusTree.h

425

BPlusTree* fTree;

src/add-ons/kernel/file_systems/bfs/Inode.cpp

1385

TreeIterator iterator(fTree);

src/add-ons/kernel/file_systems/bfs/Inode.cpp

180

if (fInode->fTree != NULL)

src/add-ons/kernel/file_systems/bfs/Inode.cpp

181

fTransaction->RemoveListener(fInode->fTree);

src/add-ons/kernel/file_systems/bfs/Inode.cpp

250

fInode->fTree = tree;

src/add-ons/kernel/file_systems/bfs/Inode.cpp

2573

if (fTree == NULL)

src/add-ons/kernel/file_systems/bfs/Inode.cpp

2580

if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) < B_OK)

src/add-ons/kernel/file_systems/bfs/Inode.cpp

2591

return fTree->Remove(transaction, name, id);

src/add-ons/kernel/file_systems/bfs/Inode.cpp

2616

if (fTree->Remove(transaction, name, id) != B_OK && !force) {

src/add-ons/kernel/file_systems/bfs/Inode.cpp

2622

if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) == B_OK) {

src/add-ons/kernel/file_systems/bfs/Inode.cpp

344

fTree(NULL),

src/add-ons/kernel/file_systems/bfs/Inode.cpp

365

fTree = new(std::nothrow) BPlusTree(this);

src/add-ons/kernel/file_systems/bfs/Inode.cpp

378

fTree(NULL),

src/add-ons/kernel/file_systems/bfs/Inode.cpp

425

delete fTree;

src/add-ons/kernel/file_systems/bfs/Inode.cpp

449

if (fTree == NULL)

src/add-ons/kernel/file_systems/bfs/Inode.cpp

452

status_t status = fTree->InitCheck();

src/add-ons/kernel/file_systems/bfs/Inode.h

139

BPlusTree* Tree() const { return fTree; }

src/add-ons/kernel/file_systems/bfs/Inode.h

268

BPlusTree* fTree;

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

302

fTree(tree)

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

333

Node node(fTree->SystemVolume(), block);

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

437

status = fTree->SystemVolume()->GetNewBlock(address, block);

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

466

if (level == fTree->RootLevel())

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

467

fTree->SetRoot(fNodes[level]);

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

477

if (abs(level) >= fTree->RootLevel())

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

484

to = fTree->RootLevel();

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

892

fTree(tree),

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

905

if (fTree)

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

906

fTree->_RemoveIterator(this);

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

927

status_t status = fTree->Traverse(direction, fPath, fKey);

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

954

status = fTree->NextLeaf(fPath);

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

956

status = fTree->PreviousLeaf(fPath);

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

989

fTree = NULL;

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

268

BTree* Tree() const { return fTree; }

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

275

BTree* fTree;

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

296

BTree* Tree() const { return fTree; }

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

313

BTree* fTree;

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

516

fTree(NULL),

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

520

fTree = new(std::nothrow) CachedExtentTree(TreeDefinition());

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

526

delete fTree;

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

527

fTree = NULL;

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

549

status = blockGroup.LoadExtent(fTree, false);

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

554

if (fTree->IsEmpty()) // 4 backup roots is 0

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

559

status = fTree->FillFreeExtents(lowerBound, upperBound);

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

579

if (fTree == NULL)

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

600

fTree->DumpInOrder();

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

618

status = fTree->FindNext(&chosen, start, size, type);

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

635

status = fTree->AddExtent(chosen);

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

158

CachedExtentTree* fTree;

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

170

: fTree(NULL),

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

188

fTree = tree;

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

191

if (fTree) {

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

192

fCurrentNode = fTree->GetRootNode();

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

218

return (fTree && fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT);

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

294

error = fTree->GetNode(child->GetBlockNumber(), &node);

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

453

= (fTree && !fCurrentNode && fPath ? fPath->InitCheck() : B_NO_INIT);

src/add-ons/kernel/file_systems/reiserfs/Iterators.cpp

480

error = fTree->GetNode(element->GetBlockNumber(), &node);

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

116

Tree *fTree;

src/add-ons/kernel/file_systems/reiserfs/Iterators.h

88

Tree *GetTree() const { return fTree; }

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

150

fTree = new(nothrow) Tree;

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

151

if (!fTree)

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

161

error = fTree->Init(this, rootBlock->ToNode(),

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

202

if (fTree) {

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

203

delete fTree;

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

204

fTree = NULL;

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

347

error = fTree->FindStatItem(dirID, objectID, &item);

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

361

error = fTree->FindDirEntry(dirID, objectID, "..", &dirItem, &index);

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

396

error = fTree->FindDirEntry(dir->GetDirID(), dir->GetObjectID(),

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

432

StreamReader reader(fTree, node->GetDirID(), node->GetObjectID());

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

591

DirEntryIterator iterator(fTree, fRootVNode->GetDirID(),

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

631

DirEntryIterator iterator(fTree, fRootVNode->GetDirID(),

src/add-ons/kernel/file_systems/reiserfs/Volume.cpp

73

fTree(NULL),

src/add-ons/kernel/file_systems/reiserfs/Volume.h

60

Tree *GetTree() const { return fTree; }

src/add-ons/kernel/file_systems/reiserfs/Volume.h

98

Tree *fTree;

src/bin/bfs_tools/lib/BPlusTree.cpp

58

return new CacheableNode(offset,fTree->Node(offset,false));

src/bin/bfs_tools/lib/BPlusTree.h

99

BPlusTree *fTree;

src/bin/bfs_tools/lib/Inode.cpp

1060

delete fTree;

src/bin/bfs_tools/lib/Inode.cpp

1124

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1129

return fTree->Rewind();

src/bin/bfs_tools/lib/Inode.cpp

1138

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1145

if ((status = fTree->GetNextEntry(name, &length, B_FILE_NAME_LENGTH - 1,

src/bin/bfs_tools/lib/Inode.cpp

1169

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1189

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1198

if (name && (status = fTree->Find((uint8 *)name, (uint16)strlen(name),

src/bin/bfs_tools/lib/Inode.cpp

1221

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1228

if ((status = fTree->Find((uint8 *)name, (uint16)strlen(name),

src/bin/bfs_tools/lib/Inode.cpp

1244

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1247

status = fTree->Validate();

src/bin/bfs_tools/lib/Inode.cpp

1251

fTree = new BPlusTree(BPLUSTREE_STRING_TYPE, BPLUSTREE_NODE_SIZE,

src/bin/bfs_tools/lib/Inode.cpp

1253

if ((status = fTree->InitCheck()) < B_OK) {

src/bin/bfs_tools/lib/Inode.cpp

1254

delete fTree;

src/bin/bfs_tools/lib/Inode.cpp

1255

fTree = NULL;

src/bin/bfs_tools/lib/Inode.cpp

1264

fTree->SetHoldChanges(true);

src/bin/bfs_tools/lib/Inode.cpp

1268

fTree->Insert(".", Block());

src/bin/bfs_tools/lib/Inode.cpp

1269

fTree->Insert("..", fDisk->ToBlock(Parent()));

src/bin/bfs_tools/lib/Inode.cpp

1281

return fTree->Insert(name.String(), inode->Block());

src/bin/bfs_tools/lib/Inode.cpp

1288

fTree = new BPlusTree(this);

src/bin/bfs_tools/lib/Inode.cpp

1290

status_t status = fTree->InitCheck();

src/bin/bfs_tools/lib/Inode.cpp

1292

delete fTree;

src/bin/bfs_tools/lib/Inode.cpp

1293

fTree = NULL;

src/bin/bfs_tools/lib/Inode.cpp

1303

if (!fTree) {

src/bin/bfs_tools/lib/Inode.cpp

1308

*tree = fTree;

src/bin/bfs_tools/lib/Inode.h

180

BPlusTree *fTree;

src/kits/shared/ColorQuantizer.cpp

116

_GetPaletteColors(fTree, tmpPalette, &index, sums);

src/kits/shared/ColorQuantizer.cpp

142

_GetPaletteColors(fTree, table, &index, NULL);

src/kits/shared/ColorQuantizer.cpp

56

: fTree(NULL),

src/kits/shared/ColorQuantizer.cpp

76

if (fTree != NULL)

src/kits/shared/ColorQuantizer.cpp

77

_DeleteTree(&fTree);

src/kits/shared/ColorQuantizer.cpp

90

_AddColor(&fTree, r, g, b, 0, fBitsPerColor, 0, &fLeafCount,

src/system/boot/loader/file_systems/bfs/Directory.cpp

141

TreeIterator iterator(&fTree);

src/system/boot/loader/file_systems/bfs/Directory.cpp

69

*_cookie = (void *)new(nothrow) TreeIterator(&fTree);

src/system/boot/loader/file_systems/bfs/Directory.cpp

91

if (fTree.Find((uint8 *)name, strlen(name), &id) < B_OK)

src/system/boot/loader/file_systems/bfs/Directory.h

42

BPlusTree fTree;

src/tests/add-ons/kernel/file_systems/bfs/btree/Inode.h

66

void* fTree;

src/tests/system/kernel/file_corruption/fs/Directory.cpp

1089

fTree = (checksumfs_dir_entry_tree*)

src/tests/system/kernel/file_corruption/fs/Directory.cpp

1092

fRootEntryBlock = (checksumfs_dir_entry_block*)(fTree + 1);

src/tests/system/kernel/file_corruption/fs/Directory.cpp

112

inline uint16 _Depth() const { return fTree->depth; }

src/tests/system/kernel/file_corruption/fs/Directory.cpp

117

checksumfs_dir_entry_tree* fTree;

src/tests/system/kernel/file_corruption/fs/Directory.cpp

1393

fTree->depth++;