/haiku/src/add-ons/kernel/file_systems/ramfs/ |
H A D | kernel_interface.cpp | 1056 status_t GetNext(ino_t *nodeID, const char **entryName) function in class:DirectoryCookie 1078 error = fIterator.GetNext(&entry); 1084 PRINT("EntryIterator %" B_PRId32 ", GetNext() counter: %" B_PRId32 ", entry: %p (%lld)\n", 1306 if (cookie->GetNext(&nodeID, &name) == B_OK) { 1425 if (iterator->GetNext(&attribute) == B_OK) {
|
H A D | Query.cpp | 94 fIterator.GetNext();
|
H A D | Index.cpp | 79 for (IndexEntryIterator it(this); it.GetCurrent(); it.GetNext()) { 131 // GetNext 133 IndexEntryIterator::GetNext() function in class:IndexEntryIterator 135 return (fIterator ? fIterator->GetNext() : NULL); 138 // GetNext 140 IndexEntryIterator::GetNext(uint8 *buffer, size_t *keyLength) function in class:IndexEntryIterator 143 if (fIterator && fIterator->GetNext())
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | ShortAttribute.h | 38 status_t GetNext(char* name, size_t* nameLength);
|
H A D | ShortAttribute.cpp | 125 ShortAttribute::GetNext(char* name, size_t* nameLength) function in class:ShortAttribute 127 TRACE("Short Attribute : GetNext\n");
|
H A D | kernel_interface.cpp | 427 status_t status = iterator->GetNext(buffer->d_name, &length, &ino); 513 status_t status = iterator->GetNext(dirent->d_name, &length);
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | kernel_interface.cpp | 831 status_t status = iterator->GetNext(dirent->d_name, &length, 932 status_t status = iterator->GetNext(dirent->d_name, &length);
|
/haiku/src/system/kernel/fs/ |
H A D | vfs.cpp | 7908 vnode = mount->vnodes.GetNext(&marker); 7918 vnode = mount->vnodes.GetNext(vnode); 7923 mount->vnodes.InsertBefore(mount->vnodes.GetNext(vnode), &marker);
|
/haiku/src/system/kernel/arch/ppc/ |
H A D | arch_int.cpp | 478 module = picModules.GetNext(module)) {
|
/haiku/src/system/kernel/arch/m68k/ |
H A D | arch_int.cpp | 512 module = picModules.GetNext(module)) {
|
/haiku/src/tools/elfsymbolpatcher/ |
H A D | ElfFile.cpp | 446 // GetNext 448 ElfRelocationIterator::GetNext(ElfRelocation* relocation) function in class:ElfRelocationIterator
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Inode.cpp | 2373 while (iterator.GetNext(name, &length, &type, &id) == B_OK) { 2880 AttributeIterator::GetNext(char* name, size_t* _length, uint32* _type, function in class:AttributeIterator 2931 FATAL(("get_vnode() failed in AttributeIterator::GetNext(ino_t" 2939 FATAL(("could not get tree in AttributeIterator::GetNext(ino_t"
|
H A D | kernel_interface.cpp | 1859 status_t status = iterator->GetNext(dirent->d_name, &length, &type,
|
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | kernel_interface.cpp | 1472 status_t status = iterator->GetNext(dirent->d_name, &length, &id);
|
H A D | DirectoryIterator.cpp | 138 DirectoryIterator::GetNext(char* name, size_t* _nameLength, ino_t* _id) function in class:DirectoryIterator 824 return fParent->GetNext(fLogicalBlock);
|
/haiku/src/system/kernel/vm/ |
H A D | vm_page.cpp | 3770 freePage = freePages.GetNext(freePage); 3775 clearPage = clearPages.GetNext(clearPage);
|
/haiku/src/add-ons/kernel/file_systems/ufs2/ |
H A D | kernel_interface.cpp | 398 status_t status = iterator->GetNext(dirent->d_name, &length, &iNodeNo);
|
H A D | DirectoryIterator.cpp | 57 status = GetNext(getname, &len, _id); 68 DirectoryIterator::GetNext(char* name, size_t* _nameLength, ino_t* _id) function in class:DirectoryIterator
|
H A D | DirectoryIterator.h | 47 status_t GetNext(char* name, size_t* _nameLength,
|
/haiku/src/add-ons/kernel/file_systems/packagefs/volume/ |
H A D | Volume.cpp | 1024 PackageNode* nextNode = package->Nodes().GetNext(node);
|
/haiku/headers/private/kernel/util/ |
H A D | DoublyLinkedQueue.h | 57 fNext = fQueue->GetNext(fNext); 114 fNext = fQueue->GetNext(fNext); 159 inline Element *GetNext(Element *element) const; 340 // GetNext 343 DOUBLY_LINKED_QUEUE_CLASS_NAME::GetNext(Element *element) const function in class:DOUBLY_LINKED_QUEUE_CLASS_NAME 357 for (Element* element = First(); element; element = GetNext(element))
|
H A D | DoublyLinkedList.h | 145 fNext = fList->GetNext(fNext); 207 fNext = fList->GetNext(fNext); 358 static inline Element* GetNext(Element* element); 614 // GetNext 617 DOUBLY_LINKED_LIST_CLASS_NAME::GetNext(Element* element) function in class:DOUBLY_LINKED_LIST_CLASS_NAME 630 for (Element* element = First(); element; element = GetNext(element)) { 645 for (Element* element = First(); element; element = GetNext(element)) 661 while ((element = GetNext(element)) != NULL) { 670 tail = GetNext(tail);
|
/haiku/src/kits/media/ |
H A D | MediaRoster.cpp | 632 for (i = 0, list->Rewind(); list->GetNext(&output); i++) { 682 for (i = 0, list->Rewind(); list->GetNext(&input); i++) { 1759 for (i = 0, list.Rewind(); list.GetNext(&input);) { 1811 for (i = 0, list.Rewind(); list.GetNext(&input);) { 1854 for (i = 0, list.Rewind(); list.GetNext(&input); i++) { 1896 for (i = 0, list.Rewind(); list.GetNext(&output);) { 1948 for (i = 0, list.Rewind(); list.GetNext(&output);) { 1993 for (i = 0, list.Rewind(); list.GetNext(&output); i++) {
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.cpp | 819 beginning. The GetNext() does always find the item on the rightmost 872 // GetNext 879 beginning. The GetNext() does always find the item on the rightmost 889 ObjectItemIterator::GetNext(Item *foundItem) function in class:ObjectItemIterator 891 //PRINT(("ObjectItemIterator::GetNext(): fDirID: %lu, fObjectID: %lu\n", fDirID, fObjectID)); 926 // GetNext 938 ObjectItemIterator::GetNext(Item *foundItem, uint32 type) function in class:ObjectItemIterator 942 error = GetNext(foundItem); 1117 // GetNext 1129 DirEntryIterator::GetNext(DirIte function in class:DirEntryIterator [all...] |
/haiku/src/system/kernel/device_manager/ |
H A D | IORequest.cpp | 1173 return dynamic_cast<IORequest*>(fChildren.GetNext(previous));
|