Searched refs:getNext (Results 1 - 9 of 9) sorted by relevance
/haiku/src/tests/kits/storage/ |
H A D | StatableTest.cpp | 39 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 49 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 57 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) 72 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 83 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 101 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 145 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 169 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 196 for (testEntries.rewind(); testEntries.getNext(statable, entryName); ) { 229 for (testEntries.rewind(); testEntries.getNext(statabl [all...] |
H A D | NodeTest.cpp | 70 for (testNodes.rewind(); testNodes.getNext(node, entryName); ) 663 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 672 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 775 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 787 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 864 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 871 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 947 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 955 for (testEntries.rewind(); testEntries.getNext(node, nodeName); ) { 1048 for (testEntries.rewind(); testEntries.getNext(nod [all...] |
H A D | StatableTest.h | 58 bool getNext(C *&entry, string &entryName) function in struct:TestEntries
|
/haiku/src/system/libroot/posix/malloc_hoard2/ |
H A D | superblock.h | 80 inline superblock *const getNext(void); 177 _freeList = _freeList->getNext(); 227 superblock::getNext(void) function in class:BPrivate::superblock
|
H A D | processheap.cpp | 176 if (((unsigned long)b->getNext() & 1) == 1) { 178 b = (block *) ((unsigned long)b->getNext() & ~1);
|
H A D | block.h | 110 getNext(void) function in class:BPrivate::block
|
H A D | wrapper.cpp | 138 b = b->getNext(); 187 sUsedList = b->getNext(); 191 while (last != NULL && last->getNext() != b) { 192 last = last->getNext(); 199 last->setNext(b->getNext());
|
H A D | heap.cpp | 157 assert(sb->getNext() == NULL); 263 assert(head->getNext() == NULL); 279 _superblocks[i][sizeclass] = sb->getNext(); 307 oldHead = sb->getNext();
|
H A D | heap.h | 485 assert(sb->getNext() == NULL); 509 _reusableSuperblocks = sb->getNext();
|
Completed in 73 milliseconds