Searched refs:Find (Results 101 - 125 of 146) sorted by relevance

123456

/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DQuery.cpp93 // Find
95 IndexIterator::Find(const uint8 *const key, size_t keyLength) function in class:IndexIterator
99 // TODO: We actually don't want an exact Find() here, but rather a
101 fInitialized = fIndexWrapper->fIndex->Find(key, keyLength, &fIterator);
1131 status = (*iterator)->Find(Value(), keySize);
H A DAttributeIndexImpl.cpp241 Attribute **foundAttribute = fAttributes->Find(
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DQuery.cpp93 // Find
95 IndexIterator::Find(const uint8 *const key, size_t keyLength) function in class:IndexIterator
99 // TODO: We actually don't want an exact Find() here, but rather a
101 fInitialized = fIndexWrapper->fIndex->Find(key, keyLength, &fIterator);
1118 status = (*iterator)->Find(Value(), keySize);
H A DAttributeIndexImpl.cpp245 Attribute **foundAttribute = fAttributes->Find(
H A DAVLTree.h155 Value *Find(const Key &key, Iterator *iterator = NULL);
392 // Find
395 AVL_TREE_CLASS_NAME::Find(const Key &key, Iterator *iterator) function in class:AVL_TREE_CLASS_NAME
/haiku-fatelf/src/kits/app/
H A DMessage.cpp2406 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
2417 BMessage::Find##typeName(const char *name, type *p) const \
2434 BMessage::Find##typeName(const char *name, int32 index, type *p) const \
2507 BMessage::Find##typeName(const char *name, int32 index) const \
2510 Find##typeName(name, index, &val); \
2542 if (Find##typeName(name, index, &value) == B_OK) \
2585 if (Find##typeName(name, index, &value) == B_OK) \
2813 // Find*() clobbers the object even on failure
/haiku-fatelf/src/add-ons/kernel/file_systems/udf/
H A DIcb.cpp546 Icb::Find(const char *filename, ino_t *id) function in class:Icb
548 TRACE(("Icb::Find: filename = `%s', id = %p\n", filename, id));
H A Dkernel_interface.cpp227 status = dir->Find(file, vnodeID);
/haiku-fatelf/src/bin/gdb/gdb/
H A Dgdbarch.sh1054 /* Helper function. Find an architecture matching info.
2044 /* Find an architecture that matches the specified INFO. Create a new
2090 /* Find the tdep code that knows about this architecture. */
2129 /* Find the existing arch in the list. */
2191 /* Find the specified architecture. */
/haiku-fatelf/src/build/libbe/app/
H A DMessage.cpp1623 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
1633 BMessage::Find##typeName(const char *name, type *p) const \
1649 BMessage::Find##typeName(const char *name, int32 index, type *p) const \
1715 BMessage::Find##typeName(const char *name, int32 index) const \
1718 Find##typeName(name, index, &val); \
/haiku-fatelf/src/system/kernel/util/
H A DAVLTreeBase.cpp139 AVLTreeBase::Find(const void* key) const function in class:AVLTreeBase
/haiku-fatelf/src/bin/bfs_tools/
H A Dchkindex.cpp277 if (tree.Find((uint8 *)key,keyLength,&value) < B_OK)
/haiku-fatelf/src/servers/print/
H A DConfigWindow.cpp405 fCurrentPrinter = Printer::Find(fPrinterName);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DInode.cpp934 if ((status = tree->Find((uint8 *)name, (uint16)strlen(name), &id)) == B_OK) {
1850 if (tree->Find((uint8 *)name, (uint16)strlen(name), &id) < B_OK)
1894 if (tree->Find((uint8 *)name, (uint16)strlen(name), &id) == B_OK) {
1960 if (tree->Find((uint8 *)name, (uint16)strlen(name), &offset) == B_OK) {
H A DJournal.cpp576 if (fArray.Find(blockNumber) >= 0) {
H A DQuery.cpp991 status = (*iterator)->Find((uint8 *)&value, keySize);
995 status = (*iterator)->Find(Value(), keySize);
H A Dkernel_interface_r5.cpp642 if ((status = tree->Find((uint8 *)file, (uint16)strlen(file), _vnodeID)) < B_OK) {
1185 status = tree->Find((const uint8 *)oldName, strlen(oldName), &id);
1237 if (newTree->Find((const uint8 *)newName, strlen(newName), &clobber) < B_OK)
/haiku-fatelf/src/apps/diskprobe/
H A DProbeView.cpp186 void Find(off_t startAt, const uint8 *data, size_t dataSize,
1074 Find(startAt, data, dataSize, caseInsensitive, progressMonitor);
1085 EditorLooper::Find(off_t startAt, const uint8 *data, size_t dataSize, function in class:EditorLooper
1094 off_t foundAt = fEditor.Find(startAt, data, dataSize, caseInsensitive,
1452 menu->AddItem(item = new BMenuItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS),
1455 menu->AddItem(fFindAgainMenuItem = new BMenuItem(B_TRANSLATE("Find again"),
/haiku-fatelf/src/add-ons/kernel/drivers/audio/usb_audio/
H A DAudioFunction.cpp578 AudioControlsIterator it = fDevice->fAudioControls.Find(fSourceID);
596 it = fDevice->fOutputTerminals.Find(fID);
H A DDevice.cpp397 _AudioControl *control = fAudioControl.Find(id);
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DQuery.cpp1015 status = (*iterator)->Find((uint8*)&value, keySize);
1019 status = (*iterator)->Find(Value(), keySize);
H A DBPlusTree.cpp46 inline int32 Find(off_t value) const function in struct:duplicate_array
2213 BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value) function in class:BPlusTree
2711 /*! This is more or less a copy of BPlusTree::Find() - but it just
2716 TreeIterator::Find(const uint8* key, uint16 keyLength) function in class:TreeIterator
3027 int32 index = Find(value);
/haiku-fatelf/src/system/kernel/disk_device_manager/
H A DKDiskDeviceManager.cpp442 PartitionMap::Iterator iterator = fPartitions->Find(id);
911 DiskSystemMap::Iterator it = fDiskSystems->Find(id);
/haiku-fatelf/src/add-ons/kernel/drivers/network/sis19x/
H A DDevice.cpp676 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End();
/haiku-fatelf/src/add-ons/kernel/drivers/network/usb_asix/
H A DASIXDevice.cpp645 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End();

Completed in 344 milliseconds

123456