/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | Transaction.cpp | 294 BlockInfo* info = fBlockInfos.Lookup(blockIndex); 334 BlockInfo* info = fBlockInfos.Lookup(blockIndex);
|
/haiku/src/tests/system/kernel/slab/ |
H A D | Slab.h | 370 return fHashTable.Lookup(object); 467 Link *link = fHashTable.Lookup(it);
|
/haiku/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const function in class:BOpenHashTable
|
/haiku/headers/private/kernel/boot/ |
H A D | vfs.h | 69 virtual Node* Lookup(const char* name, bool traverseLinks);
|
/haiku/headers/private/kernel/util/ |
H A D | OpenHashTable.h | 153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const function in class:BOpenHashTable
|
/haiku/headers/private/kernel/vm/ |
H A D | VMArea.h | 220 static VMArea* Lookup(area_id id);
|
/haiku/src/add-ons/kernel/bus_managers/agp_gart/ |
H A D | agp_gart.cpp | 134 aperture_memory *GetMemory(addr_t base) { return fHashTable.Lookup(base); } 410 return sApertureHashTable.Lookup(id); 1007 Aperture *aperture = sApertureHashTable.Lookup(id);
|
/haiku/src/add-ons/kernel/file_cache/ |
H A D | launch_speedup.cpp | 466 return fNodeHash->Lookup(key); 662 fSession = sTeamHash->Lookup(team);
|
H A D | rule_based_prefetcher.cpp | 260 return sRulesHash->Lookup(name); 568 fRules = sTeamHash->Lookup(team); 599 struct rules *rules = sRulesHash->Lookup(name);
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | kernel_interface.cpp | 390 status = DirectoryIterator(directory).Lookup(name, strlen(name), _vnodeID); 676 status = DirectoryIterator(directory).Lookup(name, strlen(name), &id); 763 status_t status = DirectoryIterator(directory).Lookup(name, strlen(name),
|
/haiku/src/add-ons/kernel/file_systems/exfat/ |
H A D | Volume.cpp | 289 return fInodesInoTree->Lookup(id); 296 return fInodesClusterTree->Lookup(cluster); 308 struct node* node = fNodeTree.Lookup(key); 330 struct node* node = fInoTree.Lookup(ino);
|
H A D | kernel_interface.cpp | 398 status = DirectoryIterator(directory).Lookup(name, strlen(name), _vnodeID);
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | HTree.cpp | 106 HTree::Lookup(const char* name, DirectoryIterator** iterator) function in class:HTree 108 TRACE("HTree::Lookup()\n"); 148 status = fRootEntry->Lookup(hash, (uint32)root->indirection_levels, 150 TRACE("HTree::Lookup(): detach root: %c\n", detachRoot ? 't' : 'f');
|
H A D | HTreeEntryIterator.cpp | 135 HTreeEntryIterator::Lookup(uint32 hash, int indirections, function in class:HTreeEntryIterator 138 TRACE("HTreeEntryIterator::Lookup()\n"); 161 TRACE("HTreeEntryIterator::Lookup() current entry: %u\n", 163 TRACE("HTreeEntryIterator::Lookup() indirections: %d s:%p m:%p e:%p\n", 170 TRACE("HTreeEntryIterator::Lookup() indirections: %d s:%p m:%p e:%p\n", 173 TRACE("HTreeEntryIterator::Lookup() %" B_PRIx32 " %" B_PRIx32 "\n", 187 TRACE("HTreeEntryIterator::Lookup(): Creating an indexed directory " 200 TRACE("HTreeEntryIterator::Lookup(): Creating a HTree entry iterator " 220 return fChild->Lookup(hash, indirections - 1, directoryIterator,
|
H A D | HTreeEntryIterator.h | 28 status_t Lookup(uint32 hash, int indirections,
|
H A D | HashRevokeManager.cpp | 65 RevokeElement* element = fHash->Lookup(block); 90 RevokeElement* element = fHash->Lookup(block); 96 // Can't fail as we just did a sucessful Lookup() 104 HashRevokeManager::Lookup(uint32 block, uint32 commitID) function in class:HashRevokeManager 106 RevokeElement* element = fHash->Lookup(block);
|
H A D | HashRevokeManager.h | 61 virtual bool Lookup(uint32 block, uint32 commitID);
|
H A D | Inode.cpp | 515 status_t status = htree.Lookup(name, &entries);
|
H A D | Journal.cpp | 1105 if (!fRevokeManager->Lookup(tag->BlockNumber(),
|
H A D | RevokeManager.h | 23 virtual bool Lookup(uint32 block, uint32 commitID) = 0;
|
H A D | kernel_interface.cpp | 463 status = htree.Lookup(name, &iterator); 894 status = htree.Lookup(name, &directoryIterator); 960 status = oldHTree.Lookup(oldName, &oldIterator); 1005 status = newHTree.Lookup(newName, &newIterator); 1077 status = oldHTree.Lookup(oldName, &oldIterator); 1394 status = htree.Lookup(name, &directoryIterator);
|
/haiku/src/add-ons/kernel/file_systems/layers/write_overlay/ |
H A D | write_overlay.cpp | 147 status_t Lookup(const char *name, ino_t *inodeNumber); 409 OverlayInode::Lookup(const char *name, ino_t *inodeNumber) function in class:write_overlay::OverlayInode 1608 return ((OverlayInode *)vnode->private_node)->Lookup(name, id);
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | CachedDataReader.cpp | 424 = fCacheLineLockers.Lookup(lineLocker->Offset());
|
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
H A D | PackageFSRoot.cpp | 255 = fResolvables.Lookup(resolvable->Name())) { 267 = fDependencies.Lookup(resolvable->Name())) { 281 = fDependencies.Lookup(dependency->Name())) { 387 = fResolvables.Lookup(dependency->Name());
|
H A D | PackageSettings.cpp | 124 return fEntries.Lookup(EntryKey(parent, name)); 131 return fEntries.Lookup(EntryKey(parent, name)); 246 return fPackageItems.Lookup(name); 255 PackageSettingsItem* packageItem = fPackageItems.Lookup(StringKey(name));
|