Searched refs:Lookup (Results 51 - 75 of 169) sorted by relevance

1234567

/haiku/src/system/boot/loader/
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/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());
H A DVolume.h71 { return fNodes.Lookup(nodeID); }
90 { return fIndices.Lookup(name); }
/haiku/src/system/kernel/fs/
H A DEntryCache.h97 bool Lookup(ino_t dirID, const char* name,
/haiku/src/add-ons/kernel/file_systems/xfs/
H A DNodeAttribute.cpp139 status_t status = Lookup(name, &length);
171 status = Lookup(fName, &namelength);
205 status = Lookup(fName, &namelength);
332 NodeAttribute::Lookup(const char* name, size_t* nameLength) function in class:NodeAttribute
334 TRACE("NodeAttribute::Lookup\n");
H A DLeafAttribute.cpp115 status_t status = Lookup(name, &length);
147 status = Lookup(fName, &namelength);
181 status = Lookup(fName, &namelength);
279 LeafAttribute::Lookup(const char* name, size_t* nameLength) function in class:LeafAttribute
281 TRACE("LeafAttribute::Lookup\n");
H A DBPlusTree.h115 status_t Lookup(const char* name, size_t length,
H A DLeafDirectory.h123 status_t Lookup(const char* name, size_t length,
H A DNode.h113 status_t Lookup(const char* name, size_t length,
H A DExtent.h174 status_t Lookup(const char* name, size_t length,
/haiku/src/system/kernel/vm/
H A DVMAddressSpaceLocking.cpp126 area = VMAreas::Lookup(areaID);
246 area = VMAreas::Lookup(areaID);
282 area = VMAreas::Lookup(areaID);
532 area = VMAreas::Lookup(areaID);
/haiku/headers/private/shared/
H A DHashSet.h246 Element* element = fTable.Lookup(key);
270 Element* element = fTable.Lookup(key);
318 return fTable.Lookup(key) != NULL;
H A DHashMap.h378 Element* element = fTable.Lookup(key);
403 Element* element = fTable.Lookup(key);
454 if (Element* element = fTable.Lookup(key))
465 if (Element* element = fTable.Lookup(key)) {
478 return fTable.Lookup(key) != NULL;
/haiku/src/add-ons/kernel/file_systems/packagefs/util/
H A DStringPool.cpp70 if (StringData* string = sStrings->Lookup(key)) {
/haiku/src/add-ons/kernel/network/datalink_protocols/arp/
H A Darp.cpp83 static arp_entry *Lookup(in_addr_t protocolAddress);
252 arp_entry::Lookup(in_addr_t address) function in class:arp_entry
254 return sCache->Lookup(address);
384 arp_entry *entry = arp_entry::Lookup(protocolAddress);
488 arp_entry* entry = arp_entry::Lookup(inetAddress);
581 arp_entry *entry = arp_entry::Lookup(header.protocol_target);
870 arp_entry *entry = arp_entry::Lookup(control.address);
909 arp_entry *entry = arp_entry::Lookup(control.address);
1034 // Lookup destination (we may need to wait for this)
1035 arp_entry *entry = arp_entry::Lookup(
[all...]
/haiku/src/add-ons/kernel/network/datalink_protocols/ipv6_datagram/
H A Dipv6_datagram.cpp113 static ndp_entry* Lookup(const in6_addr& protocolAddress);
282 ndp_entry::Lookup(const in6_addr& address) function in class:ndp_entry
284 return sCache->Lookup(address);
451 ndp_entry* entry = ndp_entry::Lookup(protocolAddress);
530 ndp_entry* entry = ndp_entry::Lookup(inetAddress);
693 ndp_entry* entry = ndp_entry::Lookup(header.target_address);
1038 // Lookup destination (we may need to wait for this)
1039 ndp_entry* entry = ndp_entry::Lookup(
/haiku/src/system/kernel/posix/
H A Dxsi_semaphore.cpp603 if (sSemaphoreHashTable.Lookup(fID) == NULL)
692 ipcKey = sIpcHashTable.Lookup(key);
702 semaphoreSet = sSemaphoreHashTable.Lookup(semaphoreSetID);
799 XsiSemaphoreSet *semaphoreSet = sSemaphoreHashTable.Lookup(semaphoreID);
988 ipcKey = sIpcHashTable.Lookup(key);
1036 XsiSemaphoreSet *semaphoreSet = sSemaphoreHashTable.Lookup(semaphoreID);
1144 semaphoreSet = sSemaphoreHashTable.Lookup(semaphoreID);
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/haiku/
H A DHaikuKernelFileSystem.cpp202 if (fIORequests->Lookup(request->id) != NULL)
216 HaikuKernelIORequest* request = fIORequests->Lookup(requestID);
247 = fNodeCapabilities->Lookup(ops);
/haiku/headers/private/kernel/util/
H A DSplayTree.h187 Node* Lookup(const Key& key) function in class:SplayTree
547 Node* Lookup(const Key& key) function in class:IteratableSplayTree
549 return fTree.Lookup(key);
H A DMultiHashTable.h106 ValueIterator Lookup(const KeyType &key) const function in class:MultiHashTable
/haiku/src/add-ons/kernel/network/protocols/tcp/
H A DEndpointManager.cpp254 return fConnectionHash.Lookup(std::make_pair(local, peer));
422 EndpointTable::ValueIterator portUsers = fEndpointHash.Lookup(port);
486 if (!fEndpointHash.Lookup(port).HasNext()) {
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTree.h120 status_t Lookup(const char* name,
/haiku/src/add-ons/kernel/network/protocols/ipv6/
H A Dmulticast.cpp167 state = fStates.Lookup(std::make_pair(&groupAddress, interface->index));
/haiku/src/system/kernel/slab/
H A DHashedObjectCache.cpp162 HashedSlab* slab = hash_table.Lookup(::lower_boundary(object, slab_size));
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DDirectoryIterator.cpp110 DirectoryIterator::Lookup(const char* name, size_t nameLength, ino_t* _id) function in class:DirectoryIterator
133 TRACE("DirectoryIterator::Lookup(): Couldn't find entry with hash %" B_PRIu32
147 TRACE("DirectoryIterator::Lookup() entries_length %ld name_length %d\n",

Completed in 136 milliseconds

1234567