Searched refs:GetNextEntry (Results 1 - 25 of 179) sorted by relevance

12345678

/haiku/src/tests/servers/app/statusbar/
H A Dmain.cpp38 while (fHomeFolder.GetNextEntry(&entry) == B_OK)
55 if (fHomeFolder.GetNextEntry(&entry) < B_OK) {
59 if (fHomeFolder.GetNextEntry(&entry) < B_OK)
/haiku/src/kits/package/
H A DTempfileManager.cpp35 while (fBaseDirectory.GetNextEntry(&entry) == B_OK)
/haiku/src/kits/tracker/
H A DNodeWalker.h59 virtual status_t GetNextEntry(BEntry*, bool traverse = false) = 0;
85 virtual status_t GetNextEntry(BEntry*, bool traverse = false);
122 virtual status_t GetNextEntry(BEntry*, bool traverse = false);
153 virtual status_t GetNextEntry(BEntry*, bool traverse = false);
H A DEntryIterator.h60 virtual status_t GetNextEntry(BEntry* entry, bool traverse = false) = 0;
82 virtual status_t GetNextEntry(BEntry* entry, bool traverse = false);
113 virtual status_t GetNextEntry(BEntry* entry, bool traverse = false);
146 virtual status_t GetNextEntry(BEntry* entry, bool traverse = false);
183 virtual status_t GetNextEntry(BEntry* entry, bool traverse = false);
H A DVirtualDirectoryEntryList.h33 virtual status_t GetNextEntry(BEntry* entry,
H A DEntryIterator.cpp72 TWalkerWrapper::GetNextEntry(BEntry* entry, bool traverse) function in class:TWalkerWrapper
74 fStatus = fWalker->GetNextEntry(entry, traverse);
168 CachedEntryIterator::GetNextEntry(BEntry* result, bool traverse) function in class:CachedEntryIterator
183 fStatus = fIterator->GetNextEntry(&fEntryBuffer[fNumEntries],
391 DirectoryEntryList::GetNextEntry(BEntry* entry, bool traverse) function in class:DirectoryEntryList
393 fStatus = fDirectory.GetNextEntry(entry, traverse);
464 EntryIteratorList::GetNextEntry(BEntry* entry, bool traverse) function in class:EntryIteratorList
472 fStatus = fList.ItemAt(fCurrentIndex)->GetNextEntry(entry, traverse);
H A DNodeWalker.cpp54 TWalker::GetNextEntry(BEntry*, bool ) function in class:BTrackerPrivate::TWalker
302 // catch at next call to GetNextEntry
309 TNodeWalker::GetNextEntry(BEntry* entry, bool traverse) function in class:BTrackerPrivate::TNodeWalker
329 status_t result = fTopDir->GetNextEntry(entry, traverse);
335 return GetNextEntry(entry, traverse);
566 TVolWalker::GetNextEntry(BEntry* entry, bool traverse) function in class:BTrackerPrivate::TVolWalker
572 status_t result = _inherited::GetNextEntry(entry, traverse);
579 result = GetNextEntry(entry, traverse);
654 TQueryWalker::GetNextEntry(BEntry* entry, bool traverse) function in class:BTrackerPrivate::TQueryWalker
658 result = fQuery.GetNextEntry(entr
[all...]
/haiku/src/system/boot/loader/file_systems/bfs/
H A DDirectory.cpp99 Directory::GetNextEntry(void *cookie, char *name, size_t size) function in class:BFS::Directory
105 return iterator->GetNextEntry(name, &length, size, &id);
117 status_t status = iterator->GetNextEntry(name, &length, sizeof(name), &id);
151 while (iterator.GetNextEntry(name, &length, B_FILE_NAME_LENGTH, &id)
H A DDirectory.h32 virtual status_t GetNextEntry(void *cookie, char *nameBuffer, size_t bufferSize);
/haiku/src/system/boot/loader/file_systems/fat/
H A DDirectory.h36 virtual status_t GetNextEntry(void *cookie, char *nameBuffer, size_t bufferSize);
51 status_t GetNextEntry(void *cookie,
/haiku/src/kits/print/
H A DPrinterRoster.cpp70 status = fUserPrintersDirectory.GetNextEntry(&entry);
94 while (dir.GetNextEntry(&entry) == B_OK) {
119 while (dir.GetNextEntry(&entry) == B_OK) {
/haiku/headers/os/storage/
H A DEntryList.h27 virtual status_t GetNextEntry(BEntry* entry,
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DDirectory.h23 Entry* GetNextEntry(Entry* entry) const;
/haiku/src/bin/bfs_tools/lib/
H A DHashtable.h33 status_t GetNextEntry(void **value);
/haiku/src/servers/launch/
H A DAbstractEmptyDirectoryJob.cpp47 while (directory.GetNextEntry(&entry) == B_OK) {
/haiku/src/system/boot/loader/file_systems/amiga_ffs/
H A DDirectory.h32 virtual status_t GetNextEntry(void *cookie, char *nameBuffer, size_t bufferSize);
/haiku/src/bin/filteredquery/
H A DFilteredQuery.h36 virtual status_t GetNextEntry(BEntry *entry, bool traverse = false);
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DQuery.cpp27 status_t GetNextEntry(uint8 *buffer, size_t *keyLength, Entry **entry);
75 IndexIterator::GetNextEntry(uint8 *buffer, size_t *_keyLength, Entry **_entry) function in class:IndexIterator
220 return indexIterator->GetNextEntry((uint8*)value, _valueLength, _entry);
327 Query::GetNextEntry(struct dirent* entry, size_t size) function in class:Query
329 return fImpl->GetNextEntry(entry, size);
/haiku/src/apps/text_search/
H A DInitialIterator.cpp123 return fCurrentDir->GetNextEntry(&entry, fRecurseLinks) == B_OK;
167 if (fCurrentDir->GetNextEntry(&entry, fRecurseLinks) == B_OK)
/haiku/headers/private/shared/
H A DQueryFile.h44 virtual status_t GetNextEntry(BEntry* entry,
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DQuery.h52 status_t GetNextEntry(struct dirent* , size_t size);
/haiku/src/tests/servers/app/code_to_name/
H A Dcode_to_name.cpp98 while ((status = query.GetNextEntry(&entry)) == B_OK) {
/haiku/headers/build/private/storage/
H A DMergedDirectory.h42 virtual status_t GetNextEntry(BEntry* entry,
/haiku/headers/private/storage/
H A DMergedDirectory.h42 virtual status_t GetNextEntry(BEntry* entry,
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DQuery.h33 status_t GetNextEntry(struct dirent* entry, size_t size);

Completed in 233 milliseconds

12345678