Searched refs:Lookup (Results 101 - 125 of 169) sorted by last modified time

1234567

/haiku/src/system/boot/loader/file_systems/packagefs/
H A Dpackagefs.cpp228 PackageNode* Lookup(const char* name) function in struct:PackageFS::PackageDirectory
745 PackageNode* child = fDirectory->Lookup(name);
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/
H A DPackageFSRoot.cpp255 = fResolvables.Lookup(resolvable->Name())) {
267 = fDependencies.Lookup(resolvable->Name())) {
281 = fDependencies.Lookup(dependency->Name())) {
387 = fResolvables.Lookup(dependency->Name());
/haiku/src/add-ons/kernel/network/protocols/ipv4/
H A Dmulticast.cpp178 state = fStates.Lookup(std::make_pair(&groupAddress, interface->index));
/haiku/src/system/boot/loader/
H A DFileMapDisk.cpp158 dirnode = volume->Lookup(FMAP_FOLDER_NAME, true);
162 node = dir->Lookup(FMAP_IMAGE_NAME, true);
H A Dpartitions.cpp144 Partition::Lookup(partition_id id, NodeList *list) function in class:boot::Partition
157 Partition *c = Lookup(id, &p->fChildren);
458 // temporarily for Lookup() to work
498 Partition *partition = Partition::Lookup(id);
536 Partition *partition = Partition::Lookup(id);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/
H A DUserlandRequestHandler.cpp409 result = volume->Lookup(request->node,
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DVolume.cpp289 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 DDirectoryIterator.cpp121 DirectoryIterator::Lookup(const char* name, size_t nameLength, ino_t* _id) function in class:DirectoryIterator
146 TRACE("DirectoryIterator::Lookup() found ID %" B_PRIdINO "\n",
153 TRACE("DirectoryIterator::Lookup() not found %s\n", name);
/haiku/src/tests/system/kernel/util/
H A DBOpenHashTableTest.cpp88 "BOpenHashTable::Lookup test",
229 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), &entry);
240 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), &entry);
243 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), NULL);
255 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), &entry);
258 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), NULL);
281 CPPUNIT_ASSERT_EQUAL(table.Lookup(123), &entry1);
282 CPPUNIT_ASSERT_EQUAL(table.Lookup(456), &entry2);
283 CPPUNIT_ASSERT_EQUAL(table.Lookup(789), NULL);
295 CPPUNIT_ASSERT_EQUAL(table.Lookup(12
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeTable.cpp33 if (fNodes.Lookup(node->GetID()) != NULL)
55 if (Node *element = fNodes.Lookup(id))
66 Node *node = fNodes.Lookup(id);
H A DDirectoryEntryTable.h138 Entry* child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
148 Entry *child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DRevokeManager.h23 virtual bool Lookup(uint32 block, uint32 commitID) = 0;
H A DJournal.cpp1105 if (!fRevokeManager->Lookup(tag->BlockNumber(),
H A DHashRevokeManager.h61 virtual bool Lookup(uint32 block, uint32 commitID);
H A DHashRevokeManager.cpp65 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 DHTreeEntryIterator.h28 status_t Lookup(uint32 hash, int indirections,
H A DHTreeEntryIterator.cpp135 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 DHTree.cpp106 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/kits/storage/
H A DPathMonitor.cpp474 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/btrfs/
H A DDirectoryIterator.h33 status_t Lookup(const char* name, size_t nameLength, ino_t* _id);
/haiku/src/tools/fs_shell/
H A DOpenHashTable.h153 ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const function in class:BOpenHashTable
/haiku/src/system/kernel/vm/
H A DVMAddressSpace.cpp268 VMAddressSpace* addressSpace = sAddressSpaceTable.Lookup(teamID);
300 return sAddressSpaceTable.Lookup(teamID);
310 VMAddressSpace* addressSpace = sAddressSpaceTable.Lookup(id);
338 aspace = sAddressSpaceTable.Lookup(id);
/haiku/src/system/kernel/
H A DTeamThreadTables.h91 Element* Lookup(id_type id, bool visibleOnly = true) const function in struct:BKernel::TeamThreadTable
93 Element* element = fTable.Lookup(id);
/haiku/src/bin/debug/ltrace/
H A Dltrace_stub.cpp118 PatchEntry* entry = sPatchedTable.Lookup(stub);
155 PatchEntry* entry = sOriginalTable.Lookup(*symbol);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelVolume.cpp267 // Lookup
269 HaikuKernelVolume::Lookup(void* _dir, const char* entryName, ino_t* vnid) function in class:HaikuKernelVolume

Completed in 116 milliseconds

1234567