/haiku/src/add-ons/kernel/file_cache/ |
H A D | rule_based_prefetcher.cpp | 95 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 D | BPlusTree.cpp | 631 iterator.Next()->Stop(); 989 iterator.Next()->Update(offset, nextOffset, keyIndex, splitAt, change);
|
H A D | BlockAllocator.cpp | 1434 while (TraceEntry* _entry = iterator.Next()) {
|
H A D | CheckVisitor.cpp | 178 return Next();
|
H A D | Inode.cpp | 569 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 D | Journal.cpp | 1127 LogEntry* entry = iterator.Next();
|
H A D | Volume.cpp | 418 Query* query = iterator.Next(); 436 Query* query = iterator.Next();
|
H A D | kernel_interface.cpp | 736 status_t status = checker->Next();
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.cpp | 548 iterator.Next()->Stop();
|
H A D | ExtentAllocator.cpp | 94 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 D | kernel_interface.cpp | 228 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 D | DirectoryIterator.cpp | 142 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 D | DirectoryIterator.h | 28 status_t Next();
|
H A D | kernel_interface.cpp | 1486 status = iterator->Next();
|
/haiku/src/add-ons/kernel/file_systems/netfs/server/ |
H A D | ClientConnection.cpp | 228 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 D | NodeHandle.cpp | 452 Query* query = it.Next();
|
H A D | VolumeManager.cpp | 230 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 D | NFS4Server.cpp | 67 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 D | Query.cpp | 148 Node* node = indexIterator->Next(value, _valueLength);
|
/haiku/src/add-ons/kernel/file_systems/packagefs/ |
H A D | kernel_interface.cpp | 475 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 D | UnpackingDirectory.cpp | 136 it.Next(); 138 while (PackageDirectory* otherNode = it.Next()) {
|
H A D | UnpackingLeafNode.cpp | 152 it.Next(); 154 while (PackageLeafNode* otherNode = it.Next()) {
|
/haiku/src/add-ons/kernel/file_systems/packagefs/package/ |
H A D | CachedDataReader.cpp | 187 vm_page* page = it.Next();
|
H A D | PackageNode.cpp | 101 PackageNodeAttribute* attribute = it.Next();) {
|
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | TwoKeyAVLTree.h | 313 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();
|