Lines Matching defs:path

99 	BTree::Path path(fVolume->FSTree());
102 if (fVolume->FSTree()->FindExact(&path, search_key, (void**)&node)
179 BTree::Path path(fVolume->FSTree());
182 status_t status = fVolume->FSTree()->FindPrevious(&path, search_key,
236 BTree::Path path(fVolume->FSTree());
240 status_t status = fVolume->FSTree()->FindPrevious(&path, search_key,
365 BTree::Path path(fVolume->FSTree());
368 if (fVolume->FSTree()->FindPrevious(&path, search_key, &node_ref) != B_OK) {
384 Inode::FindNextIndex(BTree::Path* path) const
391 if (fVolume->FSTree()->FindPrevious(path, key, NULL))
401 Inode::Insert(Transaction& transaction, BTree::Path* path)
403 BTree* tree = path->Tree();
413 status_t status = tree->InsertEntries(transaction, path, &item, data, 1);
424 Inode::Remove(Transaction& transaction, BTree::Path* path)
426 BTree* tree = path->Tree();
431 status_t status = tree->RemoveEntries(transaction, path, key, NULL, 1);
443 Inode::MakeReference(Transaction& transaction, BTree::Path* path,
448 uint64 index = parent->FindNextIndex(path);
464 status_t status = tree->InsertEntries(transaction, path, &entry,
490 status = tree->InsertEntries(transaction, path, &entry,
501 status = tree->InsertEntries(transaction, path, &entry,
515 Inode::Dereference(Transaction& transaction, BTree::Path* path, ino_t parentID,
518 BTree* tree = path->Tree();
526 status_t status = tree->RemoveEntries(transaction, path, key,
536 status = tree->RemoveEntries(transaction, path, key, NULL, 1);
545 status = tree->RemoveEntries(transaction, path, key, NULL, 1);