/haiku/src/kits/debugger/files/ |
H A D | FileManager.cpp | 200 if (fEntries.Lookup(EntryPath(entry)) == entry) 385 LocatableEntry* entry = fEntries.Lookup(entryPath); 772 SourceFileEntry* entry = fSourceFiles->Lookup(path); 791 SourceFileEntry* otherEntry = fSourceFiles->Lookup(entry->path);
|
/haiku/src/add-ons/kernel/network/protocols/ipv4/ |
H A D | multicast.cpp | 178 state = fStates.Lookup(std::make_pair(&groupAddress, interface->index));
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | ShortDirectory.cpp | 81 ShortDirectory::Lookup(const char* name, size_t length, xfs_ino_t* ino) function in class:ShortDirectory 83 TRACE("ShortDirectory::Lookup\n"); 89 TRACE("ShortDirectory:Lookup: name: \".\" ino: (%" B_PRIu64 ")\n", *ino);
|
H A D | LeafAttribute.h | 166 status_t Lookup(const char* name, size_t* nameLength);
|
/haiku/src/system/kernel/vm/ |
H A D | VMArea.cpp | 214 VMAreas::Lookup(area_id id) function in class:VMAreas
|
H A D | VMAnonymousCache.cpp | 535 swapBlock = sSwapHashTable.Lookup(key); 644 swap_block* sourceSwapBlock = sSwapHashTable.Lookup(sourceKey); 658 swapBlock = sSwapHashTable.Lookup(key); 756 swap_block* swap = sSwapHashTable.Lookup(key); 1064 swap_block* swap = sSwapHashTable.Lookup(key); 1073 swap = sSwapHashTable.Lookup(key); 1106 swap_block* swap = sSwapHashTable.Lookup(key); 1132 swap_block* swap = sSwapHashTable.Lookup(key); 1277 swap_block* sourceSwapBlock = sSwapHashTable.Lookup(key); 1285 swap_block* swapBlock = sSwapHashTable.Lookup(ke [all...] |
/haiku/src/system/kernel/locks/ |
H A D | user_mutex.cpp | 184 const bool physical = (sSharedUserMutexContext.table.Lookup(entry->address) == entry); 270 UserMutexEntry* entry = context->table.Lookup(address); 280 entry = context->table.Lookup(address); 313 if (context->table.Lookup(address) != entry)
|
/haiku/src/system/kernel/ |
H A D | module.cpp | 495 image = sModuleImagesHash->Lookup(path); 523 module = sModulesHash->Lookup(info->name); 587 struct module* module = sModulesHash->Lookup((*info)->name); 660 return sModulesHash->Lookup(name); 1319 return fNodes.Lookup(&entry) != NULL; 1329 hash_entry* entry = fNodes.Lookup(&key); 1587 hash_entry* entry = fNodes.Lookup(&key); 1713 moduleImage = sModuleImagesHash->Lookup(path); 1754 module* foundModule = sModulesHash->Lookup(moduleName); 2193 module = sModulesHash->Lookup(pat [all...] |
H A D | system_info.cpp | 301 _AddTargets(fTeamListeners.Lookup(teamID), flags, targets, 303 _AddTargets(fTeamListeners.Lookup(-1), flags, targets, targetCount, 357 _listenerList = fTeamListeners.Lookup(object);
|
H A D | image.cpp | 140 struct image *image = sImageTable->Lookup(id); 241 struct image *image = sImageTable->Lookup(id);
|
/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/add-ons/kernel/file_systems/ext2/ |
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 | 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');
|
/haiku/src/apps/mail/ |
H A D | WIndex.cpp | 218 WIndex::Lookup(int32 key) function in class:WIndex 361 if ((index = Lookup(key)) < 0)
|
/haiku/src/servers/app/font/ |
H A D | FontCacheEntry.cpp | 94 return fGlyphTable.Lookup(glyphIndex); 102 GlyphCache* glyph = fGlyphTable.Lookup(glyphIndex);
|
/haiku/src/system/kernel/device_manager/ |
H A D | legacy_drivers.cpp | 593 legacy_driver* driver = sDriverHash->Lookup(get_leaf(path)); 728 legacy_driver* driver = sDriverHash->Lookup( 743 legacy_driver* driver = sDriverHash->Lookup( 905 legacy_driver* driver = sDriverHash->Lookup(argv[1]); 1072 if (sDirectoryNodeHash.Lookup(&from) == NULL) { 1075 } else if (sDirectoryNodeHash.Lookup(&to) == NULL) { 1470 legacy_driver* driver = sDriverHash->Lookup(driverName);
|
/haiku/src/system/boot/loader/ |
H A D | vfs.cpp | 244 Directory::Lookup(const char* name, bool traverseLinks) function in class:Directory 531 Node* systemNode = fRootDirectory->Lookup("system", true); 587 Node* packagesNode = fSystemDirectory->Lookup("packages", false); 810 nextNode = directory->Lookup(path, true); 1280 Node* node = dir->directory->Lookup(dir->entry()->d_name, false);
|
H A D | heap.cpp | 284 LargeAllocation* allocation = sLargeAllocations.Lookup(address); 519 LargeAllocation* allocation = sLargeAllocations.Lookup(oldBuffer);
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/kernel_add_on/ |
H A D | Volume.cpp | 382 VNode* node = fVNodes->Lookup(vnid); 434 VNode* node = fVNodes->Lookup(vnid); 524 VNode* vnode = fVNodes->Lookup(vnodeID); 538 vnode = fVNodes->Lookup(vnodeID); 556 VNode* vnode = fVNodes->Lookup(vnodeID); 581 VNode* vnode = fVNodes->Lookup(vnodeID); 611 VNode* vnode = fVNodes->Lookup(vnodeID); 633 VNode* vnode = fVNodes->Lookup(vnodeID); 656 VNode* vnode = fVNodes->Lookup(vnodeID); 679 VNode* vnode = fVNodes->Lookup(vnodeI 988 Volume::Lookup(void* dir, const char* entryName, ino_t* vnid) function in class:Volume [all...] |
H A D | FileSystem.cpp | 511 NodeListenerProxy* proxy = fNodeListeners->Lookup( 540 NodeListenerProxy* proxy = fNodeListeners->Lookup( 561 VNodeOps* ops = fVNodeOps.Lookup(capabilities);
|
/haiku/src/system/kernel/debug/ |
H A D | BreakpointManager.cpp | 109 InstalledBreakpoint* installed = fBreakpoints.Lookup(address); 151 InstalledBreakpoint* installed = fBreakpoints.Lookup(address); 433 InstalledBreakpoint* installed = fBreakpoints.Lookup(address);
|
/haiku/src/add-ons/kernel/file_cache/ |
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/userlandfs/server/ |
H A D | Volume.cpp | 88 // Lookup 90 Volume::Lookup(void* dir, const char* entryName, ino_t* vnid) function in class:Volume 116 error = Lookup(node, "..", &parentID); 123 // Lookup() has already called get_vnode() for us, so we need to put it once
|
/haiku/src/kits/storage/ |
H A D | PathMonitor.cpp | 474 return fEntries.Lookup(name); 1638 return fAncestors.Lookup(nodeRef); 1750 return fNodes.Lookup(nodeRef); 1997 Watcher* watcher = sWatchers->Lookup(target); 2002 if (PathHandler* handler = watcher->Lookup(path)) { 2052 Watcher* watcher = sWatchers->Lookup(target); 2056 PathHandler* handler = watcher->Lookup(path); 2080 Watcher* watcher = sWatchers->Lookup(target);
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | BeOSKernelVolume.h | 34 virtual status_t Lookup(void* dir, const char* entryName,
|