Searched refs:Next (Results 201 - 225 of 392) sorted by path

1234567891011>>

/haiku/src/add-ons/kernel/file_cache/
H A Drule_based_prefetcher.cpp95 Rule *&Next() { return fNext; } function in class:Rule
288 rule = rule->Next();
298 rule->Next() = rules->first;
607 for (Rule *rule = rules->first; rule != NULL; rule = rule->Next()) {
733 Rule *next = rule->Next();
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp631 iterator.Next()->Stop();
989 iterator.Next()->Update(offset, nextOffset, keyIndex, splitAt, change);
H A DBlockAllocator.cpp1434 while (TraceEntry* _entry = iterator.Next()) {
H A DCheckVisitor.cpp178 return Next();
H A DInode.cpp569 for (; !item->IsLast(node); item = item->Next(), index++) {
630 small_data* next = item->Next();
635 last = last->Next();
655 iterator.Next()->Update(index, -1);
678 item = item->Next();
738 item = item->Next();
748 last = last->Next();
773 item = item->Next();
779 last = last->Next();
788 small_data* next = item->Next();
[all...]
H A DJournal.cpp1127 LogEntry* entry = iterator.Next();
H A DVolume.cpp418 Query* query = iterator.Next();
436 Query* query = iterator.Next();
H A Dkernel_interface.cpp736 status_t status = checker->Next();
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp548 iterator.Next()->Stop();
H A DExtentAllocator.cpp94 found = Next(found);
123 while ((next = Next(node)) != NULL && next->End() < upperBound) {
292 CachedExtent* other = Next(node);
/haiku/src/add-ons/kernel/file_systems/cdda/
H A Dkernel_interface.cpp228 Inode* Next() const { return fNext; } function in class:Inode
344 Attribute* attribute = iterator.Next();
363 Attribute* attribute = iterator.Next();
601 next = inode->Next();
785 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
801 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
871 current = current->Next();
920 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
928 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
945 for (Inode* inode = fFirstEntry; inode != NULL; inode = inode->Next()) {
[all...]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DDirectoryIterator.cpp142 status = Next();
151 DirectoryIterator::Next() function in class:DirectoryIterator
153 TRACE("DirectoryIterator::Next() fDirectory->ID() %" B_PRIdINO "\n",
157 TRACE("DirectoryIterator::Next() out of entries\n");
161 TRACE("DirectoryIterator::Next(): Creating cached block\n");
166 TRACE("DirectoryIterator::Next(): Loading cached block\n");
201 TRACE("DirectoryIterator::Next() end of directory file\n");
221 TRACE("DirectoryIterator::Next() skipping entry %d %" B_PRIu32 "\n",
225 TRACE("DirectoryIterator::Next() entry->Length() %d entry->name %*s\n",
342 status = Next();
[all...]
H A DDirectoryIterator.h28 status_t Next();
H A Dkernel_interface.cpp1486 status = iterator->Next();
/haiku/src/add-ons/kernel/file_systems/netfs/server/
H A DClientConnection.cpp228 delete it.Next().value;
346 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID()))
386 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID()))
429 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID()))
2540 ClientVolume* clientVolume = it.Next().value;
2850 if (ClientVolume* volume = _GetVolume(it.Next().value->GetID())) {
2892 // No request? Next round...
3307 ClientVolume* clientVolume = it.Next().value;
3325 ClientVolume* clientVolume = it.Next().value;
H A DNodeHandle.cpp452 Query* query = it.Next();
H A DVolumeManager.cpp230 it.Next().value->ReleaseReference();
237 it.Next().value->ReleaseReference();
244 it.Next().value->ReleaseReference();
252 it.Next().value->ReleaseReference();
260 it.Next().value->ReleaseReference();
268 Volume* volume = it.Next().value;
822 Volume* volume = it.Next().value;
1097 ClientVolume* clientVolume = it.Next().value;
1185 ClientVolume* clientVolume = it.Next().value;
1280 ClientVolume* clientVolume = it.Next()
[all...]
/haiku/src/add-ons/kernel/file_systems/nfs4/
H A DNFS4Server.cpp67 OpenState* current = iterator.Next();
71 current = iterator.Next();
412 Delegation* current = iterator.Next();
419 current = iterator.Next();
/haiku/src/add-ons/kernel/file_systems/packagefs/indices/
H A DQuery.cpp148 Node* node = indexIterator->Next(value, _valueLength);
/haiku/src/add-ons/kernel/file_systems/packagefs/
H A Dkernel_interface.cpp475 Node* Next() function in struct:DirectoryCookie
625 cookie->Next();
893 Index* index = iterator->Next();
/haiku/src/add-ons/kernel/file_systems/packagefs/nodes/
H A DUnpackingDirectory.cpp136 it.Next();
138 while (PackageDirectory* otherNode = it.Next()) {
H A DUnpackingLeafNode.cpp152 it.Next();
154 while (PackageLeafNode* otherNode = it.Next()) {
/haiku/src/add-ons/kernel/file_systems/packagefs/package/
H A DCachedDataReader.cpp187 vm_page* page = it.Next();
H A DPackageNode.cpp101 PackageNodeAttribute* attribute = it.Next();) {
/haiku/src/add-ons/kernel/file_systems/packagefs/util/
H A DTwoKeyAVLTree.h313 Node* Next(Node* node) const;
376 inline Value* Next() function in class:TWO_KEY_AVL_TREE_CLASS_NAME::Iterator
378 fIterator.Next();
464 TWO_KEY_AVL_TREE_CLASS_NAME::Next(Node* node) const function in class:TWO_KEY_AVL_TREE_CLASS_NAME
466 return fTreeMap.Next(node);
511 node = less ? Previous(node) : Next(node);
573 it.Next();

Completed in 861 milliseconds

1234567891011>>