/haiku/src/system/boot/loader/ |
H A D | partitions.cpp | 144 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 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 | Volume.h | 71 { return fNodes.Lookup(nodeID); } 90 { return fIndices.Lookup(name); }
|
/haiku/src/system/kernel/fs/ |
H A D | EntryCache.h | 97 bool Lookup(ino_t dirID, const char* name,
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | NodeAttribute.cpp | 139 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 D | LeafAttribute.cpp | 115 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 D | BPlusTree.h | 115 status_t Lookup(const char* name, size_t length,
|
H A D | LeafDirectory.h | 123 status_t Lookup(const char* name, size_t length,
|
H A D | Node.h | 113 status_t Lookup(const char* name, size_t length,
|
H A D | Extent.h | 174 status_t Lookup(const char* name, size_t length,
|
/haiku/src/system/kernel/vm/ |
H A D | VMAddressSpaceLocking.cpp | 126 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 D | HashSet.h | 246 Element* element = fTable.Lookup(key); 270 Element* element = fTable.Lookup(key); 318 return fTable.Lookup(key) != NULL;
|
H A D | HashMap.h | 378 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 D | StringPool.cpp | 70 if (StringData* string = sStrings->Lookup(key)) {
|
/haiku/src/add-ons/kernel/network/datalink_protocols/arp/ |
H A D | arp.cpp | 83 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 D | ipv6_datagram.cpp | 113 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 D | xsi_semaphore.cpp | 603 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 D | HaikuKernelFileSystem.cpp | 202 if (fIORequests->Lookup(request->id) != NULL) 216 HaikuKernelIORequest* request = fIORequests->Lookup(requestID); 247 = fNodeCapabilities->Lookup(ops);
|
/haiku/headers/private/kernel/util/ |
H A D | SplayTree.h | 187 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 D | MultiHashTable.h | 106 ValueIterator Lookup(const KeyType &key) const function in class:MultiHashTable
|
/haiku/src/add-ons/kernel/network/protocols/tcp/ |
H A D | EndpointManager.cpp | 254 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 D | HTree.h | 120 status_t Lookup(const char* name,
|
/haiku/src/add-ons/kernel/network/protocols/ipv6/ |
H A D | multicast.cpp | 167 state = fStates.Lookup(std::make_pair(&groupAddress, interface->index));
|
/haiku/src/system/kernel/slab/ |
H A D | HashedObjectCache.cpp | 162 HashedSlab* slab = hash_table.Lookup(::lower_boundary(object, slab_size));
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | DirectoryIterator.cpp | 110 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",
|