/haiku-fatelf/src/servers/app/ |
H A D | WindowList.cpp | 20 previous(NULL), 64 windowAnchor.previous = beforeAnchor.previous; 65 if (windowAnchor.previous != NULL) 66 windowAnchor.previous->Anchor(fIndex).next = window; 68 beforeAnchor.previous = window; 75 windowAnchor.previous = fLastWindow; 78 windowAnchor.previous = NULL; 99 // it must have a previous sibling, then 100 windowAnchor.previous [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/network/pegasus/ |
H A D | devlist.c | 56 pegasus_dev *previous; local 57 for (previous = sDeviceList; previous != NULL; previous = previous->next) { 58 if (previous->next == device) { 59 previous->next = device->next; 65 ASSERT(previous != NULL);
|
/haiku-fatelf/src/system/libroot/posix/pthread/ |
H A D | pthread_cleanup.cpp | 17 handler->previous = thread->cleanup_handlers; 33 thread->cleanup_handlers = handler->previous;
|
/haiku-fatelf/src/system/kernel/debug/ |
H A D | debug_heap.cpp | 27 uint32 previous; member in struct:allocation_header 50 fBase[1].previous = 0; 111 fBase[next].previous = index; 116 fBase[nextNext].previous = next; 141 // join with previous, if possible 142 if (index > 1 && fBase[header->previous].free) { 143 uint32 previous = header->previous; local 144 _RemoveFreeEntry(previous); 146 fBase[previous] 177 uint32 previous; local 199 uint32 previous = ((free_entry*)&fBase[index])->previous_free; local [all...] |
/haiku-fatelf/src/system/kernel/scheduler/ |
H A D | scheduler_tracing.h | 39 EnqueueThread(Thread* thread, Thread* previous, Thread* next) argument 46 if (previous != NULL) 47 fPreviousID = previous->id; 88 ScheduleThread(Thread* thread, Thread* previous) argument 91 fPreviousID(previous->id), 92 fCPU(previous->cpu->cpu_num), 94 fPreviousState(previous->state), 95 fPreviousWaitObjectType(previous->wait.type) 105 fPreviousWaitObject = previous->wait.object;
|
/haiku-fatelf/headers/private/kernel/util/ |
H A D | DoublyLinkedQueue.h | 183 elLink->previous = NULL; 186 sGetLink(fFirst)->previous = element; 207 link->previous = beforeLink->previous; 208 if (link->previous != NULL) 209 sGetLink(link->previous)->next = element; 210 beforeLink->previous = element; 231 if (elLink->previous) 232 sGetLink(elLink->previous)->next = elLink->next; 236 sGetLink(elLink->next)->previous [all...] |
H A D | MultiHashTable.h | 138 ValueType *previous; local 141 for (previous = table[index]; previous 142 && !HashTable::fDefinition.CompareValues(previous, value); 143 previous = HashTable::_Link(previous)); 145 if (previous) { 146 HashTable::_Link(value) = HashTable::_Link(previous); 147 HashTable::_Link(previous) = value;
|
H A D | DoublyLinkedList.h | 30 Element* previous; member in class:DoublyLinkedListLink 400 elLink->previous = fLast; 410 elLink->previous = NULL; 413 sGetLink(fFirst)->previous = element; 442 link->previous = beforeLink->previous; 443 beforeLink->previous = element; 445 if (link->previous != NULL) 446 sGetLink(link->previous)->next = element; 467 elLink->previous [all...] |
/haiku-fatelf/src/apps/icon-o-matic/generic/command/ |
H A D | Command.cpp | 63 Command::UndoesPrevious(const Command* previous) argument 77 Command::CombineWithPrevious(const Command* previous) argument
|
H A D | Command.h | 30 virtual bool UndoesPrevious(const Command* previous); 32 virtual bool CombineWithPrevious(const Command* previous);
|
/haiku-fatelf/src/apps/mediaplayer/support/ |
H A D | Command.cpp | 63 Command::UndoesPrevious(const Command* previous) argument 77 Command::CombineWithPrevious(const Command* previous) argument
|
H A D | Command.h | 30 virtual bool UndoesPrevious(const Command* previous); 32 virtual bool CombineWithPrevious(const Command* previous);
|
/haiku-fatelf/src/kits/debug/arch/m68k/ |
H A D | arch_debug_support.cpp | 13 struct stack_frame *previous; member in struct:stack_frame
|
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/shared/ |
H A D | DLList.h | 39 DLListLink() : previous(NULL), next(NULL) {} 42 Element *previous; member in class:UserlandFSUtil::DLListLink 238 elLink->previous = fLast; 248 elLink->previous = NULL; 251 fGetLink(fFirst)->previous = element; 266 if (elLink->previous) 267 fGetLink(elLink->previous)->next = elLink->next; 271 fGetLink(elLink->next)->previous = elLink->previous; 273 fLast = elLink->previous; [all...] |
H A D | SLList.h | 173 inline void InsertAfter(Element *previous, Element *element); 198 inline void _Remove(Element *previous, Element *element); 226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element) argument 230 if (previous) { 231 // insert after previous element 232 Link *prevLink = fGetLink(previous); 236 // no previous element given: prepend 242 if (fLast == previous) 307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element) argument 310 if (previous) [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | cache.c | 107 struct HASH_ENTRY *previous; local 113 previous = (struct HASH_ENTRY*)NULL; 115 previous = link; 119 if (previous) 120 previous->next = link->next; 151 struct CACHED_GENERIC *previous; local 181 previous = current->previous; 183 if (previous) { 188 previous 338 struct CACHED_GENERIC *previous; local [all...] |
H A D | cache.h | 29 struct CACHED_GENERIC *previous; member in struct:CACHED_GENERIC 37 struct CACHED_INODE *previous; member in struct:CACHED_INODE 47 struct CACHED_NIDATA *previous; member in struct:CACHED_NIDATA 58 struct CACHED_LOOKUP *previous; member in struct:CACHED_LOOKUP
|
/haiku-fatelf/src/system/kernel/slab/ |
H A D | ObjectDepot.cpp | 44 DepotMagazine* previous; member in struct:depot_cpu_store 224 depot->stores[i].previous = NULL; 257 // if it's not empty, or from the previous magazine if it's full 267 if (store->previous 268 && (store->previous->IsFull() 269 || exchange_with_full(depot, store->previous))) { 270 std::swap(store->previous, store->loaded); 286 // and it's not full, or to the previous one if it is empty. If 295 if ((store->previous != NULL && store->previous [all...] |
/haiku-fatelf/src/kits/debug/arch/x86/ |
H A D | arch_debug_support.cpp | 13 struct stack_frame *previous; member in struct:stack_frame 48 stackFrameInfo->parent_frame = stackFrame.previous;
|
/haiku-fatelf/src/kits/debug/arch/x86_64/ |
H A D | arch_debug_support.cpp | 14 struct stack_frame *previous; member in struct:stack_frame 49 stackFrameInfo->parent_frame = stackFrame.previous;
|
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/ |
H A D | Block.h | 44 inline void SetTo(Block *previous, size_t size, bool isFree, bool hasNext, 72 Block *previous, size_t size, bool isFree, 90 inline void SetTo(Block *previous, size_t size, bool hasNext, 94 // Block *previous, size_t size, bool hasNext, TFreeBlock *previousFree, 235 BlockHeader::SetTo(Block *previous, size_t size, bool isFree, bool hasNext, argument 238 SetPreviousBlock(previous); 268 Block::MakeBlock(void *address, ssize_t offset, Block *previous, size_t size, 272 block->SetTo(previous, size, isFree, hasNext, reference); 282 TFreeBlock::SetTo(Block *previous, size_t size, bool hasNext, argument 285 Block::SetTo(previous, siz [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/ |
H A D | Block.h | 44 inline void SetTo(Block *previous, size_t size, bool isFree, bool hasNext, 72 Block *previous, size_t size, bool isFree, 90 inline void SetTo(Block *previous, size_t size, bool hasNext, 94 // Block *previous, size_t size, bool hasNext, TFreeBlock *previousFree, 235 BlockHeader::SetTo(Block *previous, size_t size, bool isFree, bool hasNext, argument 238 SetPreviousBlock(previous); 268 Block::MakeBlock(void *address, ssize_t offset, Block *previous, size_t size, 272 block->SetTo(previous, size, isFree, hasNext, reference); 282 TFreeBlock::SetTo(Block *previous, size_t size, bool hasNext, argument 285 Block::SetTo(previous, siz [all...] |
/haiku-fatelf/headers/private/fs_shell/ |
H A D | DoublyLinkedList.h | 22 DoublyLinkedListLink() : next(NULL), previous(NULL) {} 26 Element *previous; member in class:FSShell::DoublyLinkedListLink 383 elLink->previous = fLast; 393 elLink->previous = NULL; 396 sGetLink(fFirst)->previous = element; 420 link->previous = beforeLink->previous; 421 if (link->previous != NULL) 422 sGetLink(link->previous)->next = element; 423 beforeLink->previous [all...] |
/haiku-fatelf/src/add-ons/kernel/network/protocols/tcp/ |
H A D | BufferQueue.cpp | 128 net_buffer *previous = NULL; local 130 while ((previous = iterator.Next()) != NULL) { 131 if (sequence >= previous->sequence) { 136 next = previous; 140 if (previous != NULL) { 141 if (sequence == previous->sequence) { 145 if (previous->size >= buffer->size) { 149 fList.Remove(previous); 150 fNumBytes -= previous->size; 151 gBufferModule->free(previous); [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/headers/shared/ |
H A D | SLList.h | 173 inline void InsertAfter(Element *previous, Element *element); 198 inline void _Remove(Element *previous, Element *element); 226 SL_LIST_CLASS_NAME::InsertAfter(Element *previous, Element *element) argument 230 if (previous) { 231 // insert after previous element 232 Link *prevLink = fGetLink(previous); 236 // no previous element given: prepend 242 if (fLast == previous) 307 SL_LIST_CLASS_NAME::_Remove(Element *previous, Element *element) argument 310 if (previous) [all...] |