Searched refs:Find (Results 76 - 100 of 109) sorted by relevance

12345

/haiku/src/add-ons/kernel/file_systems/udf/
H A DIcb.cpp560 Icb::Find(const char *filename, ino_t *id) function in class:Icb
562 TRACE(("Icb::Find: filename = `%s', id = %p\n", filename, id));
H A Dkernel_interface.cpp227 status = dir->Find(file, vnodeID);
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DAttributeIndexImpl.cpp246 Attribute **foundAttribute = fAttributes->Find(
/haiku/src/build/libbe/app/
H A DMessage.cpp1624 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
1634 BMessage::Find##typeName(const char *name, type *p) const \
1650 BMessage::Find##typeName(const char *name, int32 index, type *p) const \
1716 BMessage::Find##typeName(const char *name, int32 index) const \
1719 Find##typeName(name, index, &val); \
/haiku/src/bin/bfs_tools/
H A Dchkindex.cpp278 if (tree.Find((uint8 *)key,keyLength,&value) < B_OK)
/haiku/src/add-ons/kernel/drivers/audio/usb/
H A DAudioStreamingInterface.cpp489 _AudioControl* control = fControlInterface->Find(TerminalLink());
/haiku/src/apps/diskprobe/
H A DProbeView.cpp186 void Find(off_t startAt, const uint8* data,
965 Find(startAt, data, dataSize, caseInsensitive, progressMonitor);
976 EditorLooper::Find(off_t startAt, const uint8* data, size_t dataSize, function in class:EditorLooper
985 off_t foundAt = fEditor.Find(startAt, data, dataSize, caseInsensitive,
1313 menu->AddItem(item = new BMenuItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS),
1316 menu->AddItem(fFindAgainMenuItem = new BMenuItem(B_TRANSLATE("Find again"),
H A DDataEditor.cpp1076 DataEditor::Find(off_t startPosition, const uint8 *data, size_t dataSize, function in class:DataEditor
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DQuery.cpp559 status = (*iterator)->Find((uint8*)&value, keySize);
563 status = (*iterator)->Find(_Value(), keySize);
H A DCheckVisitor.cpp409 status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
H A DInode.cpp734 // Find the last item or one with the same name we have to add
1330 status_t status = tree->Find((uint8*)name, (uint16)strlen(name), &id);
2531 if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) < B_OK)
2573 if (fTree->Find((uint8*)name, (uint16)strlen(name), &id) == B_OK) {
2652 if (tree->Find((uint8*)name, (uint16)strlen(name), &offset) == B_OK) {
H A DBPlusTree.cpp61 inline int32 Find(off_t value) const function in struct:BFS::duplicate_array
2277 BPlusTree::Find(const uint8* key, uint16 keyLength, off_t* _value) function in class:BFS::BPlusTree
2803 /*! This is more or less a copy of BPlusTree::Find() - but it just
2808 TreeIterator::Find(const uint8* key, uint16 keyLength) function in class:BFS::TreeIterator
3123 int32 index = Find(value);
H A Dkernel_interface.cpp605 status = tree->Find((uint8*)file, (uint16)strlen(file), _vnodeID);
1203 status = tree->Find((const uint8*)oldName, strlen(oldName), &id);
1254 if (newTree->Find((const uint8*)newName, strlen(newName), &clobber)
/haiku/src/system/kernel/disk_device_manager/
H A DKDiskDeviceManager.cpp450 PartitionMap::Iterator iterator = fPartitions->Find(id);
917 DiskSystemMap::Iterator it = fDiskSystems->Find(id);
/haiku/src/kits/app/
H A DMessage.cpp2437 /* Relay functions from here on (Add... -> AddData, Find... -> FindData) */
2448 BMessage::Find##typeName(const char* name, type* p) const \
2450 return Find##typeName(name, 0, p); \
2455 BMessage::Find##typeName(const char* name, int32 index, type* p) const \
2530 BMessage::Find##typeName(const char* name, int32 index) const \
2533 Find##typeName(name, index, &val); \
2565 if (Find##typeName(name, index, &value) == B_OK) \
2634 if (Find##typeName(name, index, &value) == B_OK) \
2899 // Find*() clobbers the object even on failure
/haiku/src/tests/kits/app/bmessage/
H A DMessageSpeedTest.cpp121 message.Find##type("data", i, &value); \
/haiku/src/add-ons/kernel/drivers/network/ether/usb_asix/
H A DASIXDevice.cpp647 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End();
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp387 status_t status = iterator.Find((uint8*)gKeys[i].data, gKeys[i].length);
394 printf("TreeIterator::Find() returned: %s\n", strerror(status));
/haiku/src/system/kernel/events/
H A Devent_queue.cpp530 select_event* event = fEventTree.Find(key);
/haiku/src/bin/bfs_tools/lib/
H A DInode.cpp1194 if (name && (status = fTree->Find((uint8 *)name, (uint16)strlen(name),
1224 if ((status = fTree->Find((uint8 *)name, (uint16)strlen(name),
H A DBPlusTree.cpp1040 status_t BPlusTree::Find(uint8 *key,uint16 keyLength,off_t *value) function in class:BPlusTree
/haiku/src/apps/terminal/
H A DTermWindow.cpp526 .AddItem(B_TRANSLATE("Find" B_UTF8_ELLIPSIS), MENU_FIND_STRING, 'F')
527 .AddItem(B_TRANSLATE("Find previous"), MENU_FIND_PREVIOUS, 'G',
531 .AddItem(B_TRANSLATE("Find next"), MENU_FIND_NEXT, 'G')
816 BAlert* alert = new BAlert(B_TRANSLATE("Find failed"),
830 findresult = _ActiveTermView()->Find(fFindString, fForwardSearch,
834 BAlert* alert = new BAlert(B_TRANSLATE("Find failed"),
845 // Enable the menu items Find Next and Find Previous
853 findresult = _ActiveTermView()->Find(fFindString,
857 BAlert* alert = new BAlert(B_TRANSLATE("Find faile
[all...]
/haiku/src/add-ons/kernel/drivers/network/ether/usb_davicom/
H A DDavicomDevice.cpp766 bool isInTable = fMulticastHashes.Find(hash) != fMulticastHashes.End();
/haiku/src/system/kernel/vm/
H A DVMKernelAddressSpace.cpp949 if (fRangeTree.Find(range->base) != range) {
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp631 ERROR("Find() not found wanted: %" B_PRIu64 " %" B_PRIu8 " %"
928 ERROR("TreeIterator::Traverse() Find failed\n");
974 TreeIterator::Find(const btrfs_key& key) function in class:TreeIterator

Completed in 219 milliseconds

12345